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 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 s.p.luttik at TUE.nl Thu Apr 26 17:15:35 2012 From: s.p.luttik at TUE.nl (Luttik, S.P.) Date: Thu, 26 Apr 2012 23:15:35 +0200 Subject: [TYPES/announce] 1st CfP: EXPRESS/SOS 2012 Message-ID: <7F7F3F9A-FF9A-4FD0-AB7B-0939F9B50FD9@TUE.nl> First Call for Papers: ----------------------------------------------------------------- EXPRESS/SOS 2012 Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics ----------------------------------------------------------------- September 3, 2012, Newcastle upon Tyne (UK) Affiliated with CONCUR 2012 http://www.win.tue.nl/expresssos2012/ Submission of abstracts: Friday June 1, 2012 Submission of papers: Friday June 8, 2012 ----------------------------------------------------------------- SCOPE AND TOPICS: The EXPRESS workshop series aims at bringing together researchers interested in the expressiveness of various formal systems and semantic notions, particularly in the field of concurrency. The SOS workshop series aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. This year the EXPRESS and SOS communities organize a combined EXPRESS/SOS 2012 workshop on the formal semantics of systems and programming concepts, and on the expressiveness of mathematical models of computation. Topics of interest for this combined workshop include (but are not limited to): * expressiveness and comparison of models of computation (process algebras, event structures, Petri nets, rewrite systems), and programming models (distributed, component-based, object-oriented, and service-oriented computing); * logics for concurrency (modal logics, probabilistic and stochastic logics, temporal logics and resource logics); * analysis techniques for concurrent systems; * theory of structural operational semantics (metatheory, category-theoretic approaches, congruence results); * comparison of structural operational semantics to other forms of semantics; * applications of structural operational semantics; * software tools that automate, or are based on, structural operational semantics. SUBMISSION GUIDELINES: We solicit two types of submissions: * Short papers (up to 5 pages, not included in the proceedings) * Full papers (up to 15 pages). Simultaneous submission to journals, conferences or other workshops is only allowed for short papers; full papers must be unpublished. All submissions should adhere to the EPTCS format (http://www.eptcs.org), and submission is performed through the EXPRESS/SOS 2012 EasyChair server (http://www.easychair.org/conferences/?conf=expresssos2012). The final versions of accepted full papers will be published in EPTCS. Furthermore, authors of a selection of the accepted papers will be invited to submit an extended version to a special issue of a high-quality journal. INVITED SPEAKER: Colin Stirling (University of Edinburgh, UK) IMPORTANT DATES: Abstract submission: June 1, 2012 Paper submission: June 8, 2012 Notification date: July 9, 2012 Camera ready version: July 27, 2012 WORKSHOP CO-CHAIRS: Bas Luttik (Eindhoven University of Technology, NL) Michel Reniers (Eindhoven University of Technology, NL) PROGRAMME COMMITTEE: Luca Aceto (Reykjavik University, Iceland) Johannes Borgstr?m (Uppsala University, Sweden) Ilaria Castellani (INRIA Sophia Antipolis, France) Sibylle Fr?schle (University of Oldenburg, Germany) Fabio Gadducci (Universita di Pisa, Italy) Bartek Klin (University of Warsaw, Poland) Bas Luttik (Eindhoven University of Technology, The Netherlands) Keiko Nakata (Tallinn University of Technology, Estonia) Michel Reniers (Eindhoven University of Technology, The Netherlands) Jiri Srba (Aalborg University, Denmark) Alwen Tiu (Australian National University, Australia) Walter Vogler (Augsburg University, Germany) From ewen.w.denney at nasa.gov Fri Apr 27 18:15:00 2012 From: ewen.w.denney at nasa.gov (Ewen Denney) Date: Fri, 27 Apr 2012 15:15:00 -0700 Subject: [TYPES/announce] Final call: ASE '12 Tool Demonstrations Message-ID: <4F9B1A64.3010502@nasa.gov> Automated Software Engineering 2012: Final Call for Tool Demonstrations [Tools based on typed-based formalisms that have applicability to some area of software engineering are welcome.] http://ase2012.paluno.uni-due.de/calls/#tool_demonstrations 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) From palmgren at math.su.se Sat Apr 28 10:21:02 2012 From: palmgren at math.su.se (Erik Palmgren) Date: Sat, 28 Apr 2012 16:21:02 +0200 Subject: [TYPES/announce] Third Announcement and CFP: 8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK - Extended deadline Message-ID: <375E9B70-A2BE-44D5-ABEB-EB6984E738B3@math.su.se> 8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK Third 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. **UPDATE: SUBMISSION DATE has been extended: 1 June NOTIFICATION OF ACCEPTANCE: 15 June STUDENT GRANTS We are happy to announce that the ASL is sponsoring SLS2012. Among other things, this means that student ASL members may apply for ASL travel funds that are available for sponsored meetings. (see http://www.aslonline.org/studenttravelawards.html). 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 murano at na.infn.it Sat Apr 28 12:11:37 2012 From: murano at na.infn.it (Nello Murano) Date: Sat, 28 Apr 2012 18:11:37 +0200 (CEST) Subject: [TYPES/announce] Call for papers GandALF 2012 Message-ID: <46176.2.226.21.88.1335629497.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 ************************************************ | 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 CO-LOCATED EVENT GAMES 2012, Annual Workshop of the ESF Networking Programme on Games for Design and Verification (http://www.games.unina.it/). INVITED SPEAKERS Alberto Policriti (University of Udine, Italy). Moreover, we plan to have two joint invited speakers with the co-located GAMES meeting. 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 swarat at rice.edu Sun Apr 29 09:15:11 2012 From: swarat at rice.edu (Swarat Chaudhuri) Date: Sun, 29 Apr 2012 08:15:11 -0500 Subject: [TYPES/announce] Postdoctoral position on programming models for robotic motion planning at Rice University Message-ID: <4F9D3EDF.8060701@rice.edu> Postdoctoral position on programming models for robotic motion planning at Rice University ------------------------------------------------------------------ The Computer-Aided Program Design group (http://www.cs.rice.edu/~swarat/capd) and the Physical and Biological Computing group (http://www.kavrakilab.org/) at Rice University are looking to hire an enthusiastic postdoctoral researcher to enhance their joint research efforts on high-level programming models for robotic motion planning. The goal of the project is the development of declarative programming models for motion planning that nonexperts can use with relative ease, and the design and implementation of program synthesis techniques that can automatically generate executable code from high-level models. The ideal applicant would have a passion for bringing together theory and practice, prior exposure to programming language semantics and techniques for reasoning about correctness of systems (especially physical systems), and significant experience in writing software. Candidates that will be given priority include those with deep expertise in program verification/synthesis (especially modern invariant generation techniques) and/or hybrid control systems, and those with a good understanding of practical issues in programming real-world robots. The duration of the position is one year and can be renewed for a second year. Compensation is commensurate with experience. To apply, send a resume, a brief statement of interest, and names of two references to Swarat Chaudhuri (swarat at rice.edu). From chong at seas.harvard.edu Sun Apr 29 23:10:37 2012 From: chong at seas.harvard.edu (Stephen Chong) Date: Sun, 29 Apr 2012 23:10:37 -0400 Subject: [TYPES/announce] Post doc in Language-Based and Systems Security at Harvard Message-ID: <4F9E02AD.3010600@seas.harvard.edu> Applications are invited for a postdoctoral position in the area of language-based and systems security at Harvard University, starting in Fall 2012. The hosting project aims to improve the guarantees offered by both language-based information security mechanisms and operating system information security mechanisms by considering the interaction between these mechanisms. The ideal candidate will have a Ph.D. in Computer Science (completed or soon to be completed), a combination of strong theoretical and practical interests, expertise in language-based and systems security, a substantial publication history, good teamwork and communication skills, including excellent spoken and written English. The position is initially for one year, with possible extension up to three years. Please note that Harvard requires confirmation of Ph.D. completion before the postdoctoral position can begin. To apply, please send a CV, research statement, and the names and contact information of three people who can be asked for letters of reference to Stephen Chong (http://people.seas.harvard.edu/~chong). Review of applications will begin immediately. Applications received by June 1 will receive full consideration. Harvard University is an Equal Opportunity/Affirmative Action employer and applications from women and minority candidates are strongly encouraged. -------------- next part -------------- An HTML attachment was scrubbed... URL: From lionel.vaux at univ-amu.fr Mon Apr 30 09:21:27 2012 From: lionel.vaux at univ-amu.fr (Lionel Vaux) Date: Mon, 30 Apr 2012 15:21:27 +0200 Subject: [TYPES/announce] Postdoc position in proof theory (IML, Marseille, France) Message-ID: <20120430132127.GW5071@garbure.info> [Apologies for multiple posting] The French ANR project LOGOI is inviting applications for a postdoctoral position within the team Logique de la Programmation (LDP) of the Institut de Math?matiques de Luminy (IML) in Marseille, France. Context ------- The LOGOI project pursues the programme of Geometry of Interaction (GoI), which aims at a reconstruction of logic from interaction as the primitive notion, considered as an abstract counterpart of cut elimination. This programme has started together with linear logic and has evolved since its early days, from the limited case of multiplicatives to recent developments involving the theory of operator algebras and providing a strikingly new perspective on implicit complexity via light logics. The goals of the LOGOI project are on one side to better understand and refine the current theory of GoI, and on the other side to draw on the novel tools and concepts provided by this framework, in order to propose a new structured approach to proof theory and its connections with other areas of computer science. Post Doctoral Position ---------------------- This is a full-time research position for one year, with a possible one-year extension. It is expected to start at the beginning of fall 2012 (between 1 Sep. and 1 Nov.). Research will take place at the IML in Marseille. The successful applicant will contribute to the main areas of the LOGOI project research effort: geometry of interaction, ludics, proof theoretical aspects of computation. Possible connections with other fields of proof theory and computer science are also of interest. The post-doc is of course expected to participate to group activities (workshops, meetings, tutorials) both of the LOGOI project and the LDP team. Requirements ------------ Applicants must hold a PhD degree in computer science or mathematics, and should have a strong background in logic and proof theory. Skills in an additional area of computer science (complexity, concurrency, programming language semantics, etc.) are very welcome. If the PhD thesis is not defended yet, the candidate must provide the planned defence date and the composition of the thesis committee. Knowledge of French is not required. Application ----------- To apply, please send an email to logoi-postdoc at iml.univ-mrs.fr, including your current CV, a link to a list of your publications, and a research statement summarizing your research activities and goals (preferably two pages at most). You might also include the names of up to two references. The deadline for applications is 20 june 2012, but early expression of interest is encouraged. More Information ---------------- Logoi: http://www.logoi.fr/ IML: http://iml.univ-mrs.fr/ From adamc at csail.mit.edu Wed May 2 10:29:43 2012 From: adamc at csail.mit.edu (Adam Chlipala) Date: Wed, 02 May 2012 10:29:43 -0400 Subject: [TYPES/announce] Postdoc opportunities in functional programming & formal verification Message-ID: <4FA144D7.4060904@csail.mit.edu> This is an informal attempt to reach out to people who might be interested in doing postdocs with me, perhaps starting as early as this summer or fall. I am a new faculty member in computer science at MIT, currently in the tail end of my first cycle of research grant applications, waiting for decisions. So, I don't have any specific funding for postdocs awarded yet, but I'm optimistic that there will be some opportunities soon, and I hope to start some conversations with interested candidates now. I work in program verification and other formal theorem proving with the Coq proof assistant, along with design and implementation of functional programming languages, especially those inspired by dependent type theory (as in Coq). Lengthier overview of my interests here: http://adam.chlipala.net/summary.html I'd like to invite recent PhD graduates or those who expect to receive PhD's soon to get in touch with me by e-mail, if they think they might like to come to MIT for a year or more to work with me on these sorts of topics. Ideal candidates will have track records as lead authors of papers published at top programming languages conferences like POPL, PLDI, and ICFP; or perhaps lack of such a record can be overcome by significant implementation experience in research-oriented projects. While I'm writing, I'll also mention that I'd be glad to exchange e-mails with those considering applying to our PhD program this fall who might like to work in my group. In contrast to the situation with postdocs, there is a formal, centralized application process for graduate students, but it can still be useful to gather some information on fit ahead of time. From frfrantz at unijui.edu.br Wed May 2 17:35:11 2012 From: frfrantz at unijui.edu.br (Fabricia Roos Frantz) Date: Wed, 2 May 2012 18:35:11 -0300 Subject: [TYPES/announce] Call for Papers - Third Workshop on Formal Methods and Analysis in Software Product Line Engineering In-Reply-To: References: Message-ID: *Note: We believe that this CFP is relevant to readers of the TYPES forum because the objective of the workshop ?Formal Methods and Analysis in Software Product Line Engineering (FMSPLE)? is to bring together researchers and practitioners from the SPLE community with researchers and practitioners working in the area of formal methods and analysis.* CALL FOR PAPERS Third Workshop on Formal Methods and Analysis in Software Product Line Engineering (FMSPLE 2012), 2 September 2012 http://www.iese.fraunhofer.de/en/events/fmsple2012.html Co-located with the 16th International Software Product Line Conference (SPLC 2012), 2 - 7 September 2012, Salvador, Brazil http://www.splc2012.net/ -------------------------------------------------------------- IMPORTANT DATES: - Deadline for submissions: May 25, 2012 - Notification of acceptance: June 15, 2012 - Final papers due: June 29, 2012 -------------------------------------------------------------- BACKGROUND AND OBJECTIVES Software product line engineering (SPLE) aims at developing a family of systems by reuse in order to reduce time to market and to increase product quality. The correctness of the development artifacts intended for reuse as well as the correctness of the developed products is of crucial interest for many safety-critical or business-critical applications. Formal methods and analysis approaches have been successfully applied in single system engineering over the last years in order to rigorously establish critical system requirements. However, in SPLE, formal methods and analysis approaches are not broadly applied yet, despite their potential to improve product quality. One of the reasons is that existing formal approaches from single system engineering do not consider variability, an essential aspect of product lines. The objective of the workshop "Formal Methods and Analysis in Software Product Line Engineering (FMSPLE)" is to bring together researchers and practitioners from the SPLE community with researchers and practitioners working in the area of formal methods and analysis. So far, both communities are only loosely connected, despite very promising initial work on formal analysis techniques for software product lines. The workshop aims at reviewing the state of the art and the state of the practice in which formal methods and analysis approaches are currently applied in SPLE. This leads to a discussion of a research agenda for the extension of existing formal approaches and the development of new formal techniques for dealing with the particular needs of SPLE. To achieve the above objectives, the workshop is intended as a highly interactive event fostering discussion and initiating collaborations between the participants from both communities. TOPICS The proposed workshop focuses on the application of formal methods and analysis approaches in all phases of SPLE, including domain and application engineering, in order to ensure the correctness of individual artifacts as well as the consistency among them. The topics of interest include, but are not limited to: - Analysis approaches and formal methods for: - domain analysis and scoping - variability modeling - specification and verification of functional and non-functional properties in SPLE - safety and security aspects in SPLE - product line architectures and component-based product line development - product line implementation, such as type systems, programming languages, formal semantics - formal verification of product lines and product line artifacts - correctness-by-construction techniques in SPLE - automated test case generation and model-based testing in SPLE - product derivation and application engineering - product line life-cycle management (e.g., consistency assurance) - reuse and evolution of SPLs - Proofs of concept, industrial experiences and empirical evaluations - Tool presentations - Vision and position papers on formal methods and analyses applied to SPLE FORMAT The FMSPLE workshop will be a full-day event, starting with a keynote presentation by David Benavides, University of Seville, Spain. The keynote will be followed by presentations of selected peer-reviewed papers. To foster interaction within the workshop, a discussant will be assigned to each presented paper. The task of the discussant will be to prepare a summary of the paper and initiate the discussion of its results. The workshop will close with a discussion of its participants to summarize the state of the art and the state of the practice as presented in the workshop, to collect research challenges for the application of formal methods in SPLE and to identify research topics for future workshops. PREVIOUS WORKSHOPS FMSPLE merges two workshops, namely FMSPLE 2010 ( http://www.iese.fraunhofer.de/en/events/fmsple2010.html) and ASPL 2008 ( http://www.isa.us.es/aspl08), both of which were affiliated to the International Software Product Line Conference (SPLC). A first joint edition was held in 2011 as FMSPLE at the 15th SPLC ( http://www.iese.fraunhofer.de/en/events/fmsple2011.html). This is the 3rd edition of the successful FMSPLE workshop series. SUBMISSION AND PUBLICATION The contributed papers are expected to comprise research papers containing novel and previously unpublished results, experience reports, reports of industrial case studies, tool descriptions, and short papers describing work in progress or exploratory ideas. All papers have to follow the ACM two-column conference proceedings format (Letter) and be 4 - 8 pages of length. The papers should be submitted via EasyChair; each paper will be reviewed by at least three members of the program committee. The program committee will select the best papers based on quality, relevance to the workshop, and potential to initiate discussions for presentation. The workshop proceedings will be published by the ACM in the second volume of the SPLC proceedings. PROGRAM COMMITTEE Vander Alves, University of Brasilia, Brazil Hugo Arboleda, Icesi University, Cali, Colombia Jo Atlee, University of Waterloo, Canada Ebrahim Bagheri, Athabasca University, Canada Maurice H. ter Beek, ISTI-CNR, Pisa, Italy Dirk Beyer, University of Passau, Germany Paulo Borba, Federal University of Pernambuco, Brazil Manfred Broy, Technical University Munich, Germany Dave Clarke, Katholieke Universiteit Leuven, Belgium Andreas Classen, Intec Software Engineering and University of Namur, Belgium Stefania Gnesi, ISTI-CNR, Pisa, Italy Klaus Havelund, NASA JPL, USA Kim Larsen, Aalborg University, Denmark Arnaud Hubaux, University of Namur, Belgium Axel Legay, INRIA Rennes, France Ivan C. Machado, Federal University of Bahia, Salvador, Brazil Tomi Mannisto, Aalto University, Finland Marcilio Mendonca, University of Waterloo, Canada Henry Muccini, University of L'Aquila, Italy Antonio Ruiz-Cortes, University of Seville, Spain Ina Schaefer, Technical University of Braunschweig, Germany Erik de Vink, Eindhoven University of Technology, The Netherlands Andrzej Wasowski, ITU Kopenhagen, Denmark PROGRAM CO-CHAIRS Maurice H. ter Beek (ISTI-CNR, Pisa, Italy) Andreas Classen (University of Namur, Belgium) ORGANISING COMMITTEE Ina Schaefer (Technical University of Braunschweig, Germany) Martin Becker (Fraunhofer IESE, Germany) Fabricia Roos-Frantz (UNIJUI University, Brazil) Peter Y. H. Wong (Fredhopper B.V., Amsterdam, The Netherlands) _______________________________________________ Please do not post msgs that are not relevant to the database community at large. Go to www.cs.wisc.edu/dbworld for guidelines and posting forms. To unsubscribe, go to https://lists.cs.wisc.edu/mailman/listinfo/dbworld -------------- next part -------------- An HTML attachment was scrubbed... URL: From gorel at cs.lth.se Sat May 5 09:48:22 2012 From: gorel at cs.lth.se (=?iso-8859-1?Q?G=F6rel_Hedin?=) Date: Sat, 5 May 2012 15:48:22 +0200 Subject: [TYPES/announce] Call for submissions: SLE 2012. Main track, poster track, doctoral symposium Message-ID: <11E6DC4A-32CC-4D3D-BBC8-8EDD9E1D7609@cs.lth.se> ======================================================================== CALL FOR SUBMISSIONS: Main track, poster track, doctoral symposium SLE 2012: The 5th International Conference on Software Language Engineering Dresden, Sep 25-28, 2012. General chair: Uwe Assmann The program will include invited talks, main track, poster track, minitutorials, and a doctoral symposium. Collocated events include GPCE 2012, FOSD 2012, and ITSLE 2012. The 5th International Conference on Software Language Engineering (SLE) is devoted to topics related to artificial languages in software engineering. SLE encourages communication among communities that have traditionally looked at software languages from different and yet complementary perspectives. Of particular relevance to SLE are technologies, methods, experiments, and case studies on software languages from modelware, grammarware and ontologyware perspectives. ======================================================================== MAIN TRACK Co-chairs: Krzysztof Czarnecki and G?rel Hedin Research papers, industrial experience papers, tool demo papers. Postproceedings in LNCS, Springer. Selected papers invited to submit to special issue of SCP, Elsevier EAPLS best paper award Submission deadlines: Abstracts: June 4, Full papers: June 11 POSTER TRACK Co-chairs: Anya Helene Bagge and Dimitris Kolovos On-line proceedings Submission deadline: July 10 DOCTORAL SYMPOSIUM Co-chairs: Ulrich Eisenecker and Christian Bucholdt On-line proceedings Submission deadline: July 10 For further information, see http://planet-sl.org/sle2012 From pmt6sbc at maths.leeds.ac.uk Sat May 5 20:08:25 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Sun, 6 May 2012 01:08:25 +0100 (BST) Subject: [TYPES/announce] CiE 2012: Turing Centenary Conference, Cambridge - Final Call for Presentations Message-ID: <201205060008.q4608Pq2025882@maths.leeds.ac.uk> ********************************************************************** FINAL 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 CiE 2012 is one of three major international Turing Centenary Celebrations. CiE 2012 offers researchers an opportunity to actively participate in this remarkable year of activities. SUBMISSION OF ABSTRACTS OF INFORMAL PRESENTATIONS are invited with a deadline of MAY 11th 2012. For submission details, see: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?12 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. 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. The conference is sponsored by the ASL, EACSL, EATCS, Elsevier, the IET, IFCoLog, King's College Cambridge, Science Magazine, The University of Cambridge, the Isaac Newton Institute, IOS Press, 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 jonathan.aldrich at cs.cmu.edu Sun May 6 22:49:05 2012 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Sun, 06 May 2012 22:49:05 -0400 Subject: [TYPES/announce] 2nd CFP: LaME'12 Languages for the Multi-core Era (ECOOP workshop) Message-ID: <4FA73821.2050600@cs.cmu.edu> [LaME welcomes type-based approaches to parallelism. The CFP has been updated with detailed calls for position papers and challenge problem solutions. Note that as space may be limited, priority for attendance at the workshop will be given to authors/presenters of regular papers, position papers, and challenge problem solutions.] LaME'12 Second Call for Contributions 2012 International Workshop on Languages for the Multi-core Era http://lame.dei.uc.pt/index.php?title=Main_Page June 13 2012, at ECOOP 2012, Beijing China http://ecoop12.cs.purdue.edu/ (also colocated with PLDI, ISMM, and LCTES) 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. Space at the workshop is limited. We can ensure admission only to those submitting accepted position papers, programming challenge solutions, or other presentations. We still solicit contributions of the following two forms, by May 20, 2012, at https://www.easychair.org/conferences/?conf=lame12 (The full paper deadline is now past.) 1. 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. Attendees submitting position papers relevant to the workshop sessions on open issues in LaME may be invited to present brief (two-slide) synopses of their ideas and work on the following. (Authors should indicate which if any session their position papers address.) * Type Systems including those for isolation, state, and effects * Intermediate program representations including those supporting optimizations across tasks, memory locality * Extensible Libraries including DSL support, coordination frameworks * Asynchronous programming including IO, events, reactive programing * Heterogeneous systems including integrated GPU and FPGA support, NUMA-awareness 2. Solutions to the LaME'12 programming challenge. 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. We solicit solutions to all or part of the following challenge, designed to showcase the expressiveness of different parallel language abstractions. The challenge is in two parts, one algorithmic and one engineering parallelism into a real-world context. Solutions may target either or both parts. Solutions should include source code (ideally complete, but this is not required) as well as a short paper discussing the benefits and drawbacks of the approach. Comparisons to alternative approaches are welcome. While the primary focus of this challenge is on expressiveness of the language, library or other abstractions used in the solution, evaluations showing the scalability and performance of the proposed approach are encouraged to show the performance that can be achieved with the approach. The paper should be at most 4 pages. Code and papers will not be formally published, but will be archived on the LaME website. Solutions to the challenge problem will be presented and discussed at a workshop session. PART A: PARALLEL ALGORITHMS The first challenge involves expressing algorithms cleanly. Prospective solutions will implement one or more of the benchmarks from the Problem Based Benchmark Suite. This open source suite describes a number of common real-world problems in terms of the function they implement and not the particular algorithm or code they use, and are thus a useful way to compare different programming languages, methodologies, and algorithm designs. A description of the problems in the benchmark suite, together with sample implementations and sample inputs, is available at: http://www.cs.cmu.edu/~guyb/pbbs/ PART B: PARALLELISM IN CONTEXT The second challenge involves putting parallelism into a real-world context. While expressing the core of an algorithm is important, equally important is getting the data from the world, into an algorithm, and back out into the world. Desirable characteristics include code that is short, clear, and efficient. Prospective solutions will show how to get parallel data from some public source, process it in parallel, and display the output in some meaningful way. The processing itself may be a solution to Part A or it may be any other parallel algorithm. Data sources to consider include Tim Bray's Wide Finder and Wide Finder 2 benchmarks: http://www.tbray.org/ongoing/When/200x/2008/05/01/Wide-Finder-2 or one of the research-quality data sets described here: https://bitly.com/bundles/hmason/1 However, any public data source may be used. 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 maffei at cs.uni-saarland.de Mon May 7 08:25:31 2012 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Mon, 7 May 2012 14:25:31 +0200 Subject: [TYPES/announce] Call for participation: 2012 COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2012) Message-ID: 2012 COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2012) --- June 25?27, 2012 , Harvard University, Cambridge MA, USA --- CSF associated workshops: FCC, ASA, STAST Website: http://csf2012.seas.harvard.edu/ The early registration deadline is May 23, 2012 --- 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. Over the past two decades, many seminal papers and techniques have been presented first at CSF. In 2008, CiteSeer listed CSF as 38th out of more than 1200 computer science venues (top 3.11%) in impact based on citation frequency. CiteSeerX lists CSF 2007 as 7th out of 581 computer science venues (top 1.2%) in impact based on citation frequency. The atmosphere of the symposium is informal, often in a peaceful, rural setting that encourages an exchange of thoughtful technical discussion by all attendees, both during and after scheduled presentations. --- Invited speakers: William Guenther, Mass Insight Global Partnerships Butler Lampson, Microsoft Research --- List of accepted papers: Information-Flow Security for a Core of JavaScript Daniel Hedin, Andrei Sabelfeld Secure Information Flow for Concurrent Programs under Total Store Order Jeffrey A. Vaughan, Todd Millstein ENCOVER: Symbolic Exploration for Information Flow Security Musard Balliu, Mads Dam, Gurvan Le Guernic Information-flow control for programming on encrypted data John C. Mitchell, Rahul Sharma, Deian Stefan, Joe Zimmerman Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings Alisa Pankova, Peeter Laud Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties Benedikt Schmidt, Simon Meier, Cas Cremers, David Basin Verifying privacy-type properties in a modular way Myrto Arapinis, Vincent Cheval, St?phanie Delaune Security Analysis of Access Control through Program Verification Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato Gran: model checking grsecurity RBAC policies Michele Bugliesi, Stefano Calzavara, Riccardo Focardi, Marco Squarcina Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction Valerio Genovese, Deepak Garg, Daniele Rispoli Securing Interactive Programs Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld Learning is Change in Knowledge: Knowledge-based Security for Dynamic Policies Aslan Askarov, Stephen Chong Mashic Compiler: Mashup Sandboxing based on Inter-frame Communication Zhengqin Luo, Tamara Rezk Secure compilation to modern processors Pieter Agten, Raoul Strackx, Bart Jacobs, Frank Piessens Cache-leakage resilient OS isolation in an idealized model of virtualization Gilles Barthe, Gustavo Betarte, Juan Diego Campo, Carlos Luna A Framework for the Cryptographic Verification of Java-like Programs Ralf Kuesters, Tomasz Truderung, Juergen Graf Constructing Optimistic Multi-party Contract Signing Protocols Barbara Kordy, Sasa Radomirovic Refining Key Establishment Christoph Sprenger, David Basin Discovering Concrete Attacks on Website Authorization by Formal Analysis Chetan Bansal, Karthikeyan Bhargavan, Sergio Maffeis Measuring Information Leakage using Generalized Gain Functions M?rio S. Alvim, Kostas Chatzikokolakis, Catuscia Palamidessi, Geoffrey Smith The Thermodynamics of Confidentiality Pasquale Malacaria, Fabrizio Smeraldi Generic Indifferentiability Proofs of Hash Designs Marion Daubignard, Pierre-Alain Fouque, Yassine Lakhnech Automatically Verified Mechanized Proof of One-Encryption Key Exchange Bruno Blanchet Verified Security of Merkle-Damgaard Michael Backes, Gilles Barthe, Matthias Berg, Benjamin Gr?goire, C?sar Kunz, Malte Skoruppa, Santiago Zanella B?guelin Provably Secure and Practical Onion Routing Michael Backes, Ian Goldberg, Aniket Kate, Esfandiar Mohammadi --- Registration: For online registration, please follow the link on the CSF website at http://csf2012.seas.harvard.edu/registration.html The early registration deadline is May 23, 2012. --- CSF Program Chairs: - Veronique Cortier, LORIA and CNRS - Steve Zdancewic, University of Pennsylvania CSF General Chair: - Stephen Chong, Harvard University From ulrich.fahrenberg at irisa.fr Mon May 7 14:33:50 2012 From: ulrich.fahrenberg at irisa.fr (Uli Fahrenberg) Date: Mon, 07 May 2012 20:33:50 +0200 Subject: [TYPES/announce] Second CfP: QFM 2012 Message-ID: <4FA8158E.9020506@irisa.fr> Apologies should you receive 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/ DEADLINE EXTENSION: 22 May 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: 22 May 2012, 23:00 UTC (EXTENDED) Notification: 15 June 2012 Final version: 10 July 2012 QFM 2012: 28 August 2012 From nicolas.pouillard at gmail.com Tue May 8 06:55:17 2012 From: nicolas.pouillard at gmail.com (Nicolas Pouillard) Date: Tue, 08 May 2012 12:55:17 +0200 Subject: [TYPES/announce] [ANN] Agda Intensive Meeting 16th (AIM XVI) in Copenhagen Message-ID: <1336474466-turnsole-86296@ss> [We apologize for multiple copies] Hello, It is my pleasure to announce that the next AIM will be held at ITU in Copenhagen from October 3 to October 9. Everyone with a genuine interest in Agda is invited to attend. The meeting will be similar to previous ones: * Presentations concerning theory, implementation, and use cases of Agda. * Discussions around issues of the Agda language. * Plenty of time to work on or in Agda, in collaboration with the other participants. A few details can be found on the wiki page of the event: http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXVI including pointers to recommended accommodations. Registration ------------ Although no official registration is needed, we want to know how many will attend. If you want to give a talk please send us the title and an abstract. To register, please send an email to (aim16 at ?.net ? or if you are not an unicode aficionado aim16 at xn?dia.net), filling out the following form: ---------------8<---------------------------------------- Name: Affiliation: email: Program: * I'd like to give a talk or lead a discussion (yes/no): Title: Abstract: (optional) * Suggestion for code-sprint (optional): ---------------8<---------------------------------------- See you in K?benhavn, -- Nicolas Pouillard http://nicolaspouillard.fr From falke at iti.uka.de Tue May 8 07:00:38 2012 From: falke at iti.uka.de (Stephan Falke) Date: Tue, 08 May 2012 13:00:38 +0200 Subject: [TYPES/announce] CfP: Joint SVARM & VERIFY Workshop 2012 Message-ID: <4FA8FCD6.7060401@iti.uka.de> Call for Papers Joint SVARM & VERIFY Workshop 2012 affiliated with IJCAR 2012 Manchester, UK, June 30 / July 1 http://baldur.iti.kit.edu/SVARM-VERIFY-2012 Overview -------- Verification has developed into a flourishing research field attracting researchers with different backgrounds, ranging from computation/proof theory, deductive systems, and model checking to hardware/software analysis andsoftware engineering. With this joint workshop we want to bring together researchers from these fields to discuss topics on verification of computer systems as well as underlying theoretical foundations. The workshop combines the already established workshops SVARM and VERIFY. SVARM ----- Tools for automated analysis of computer systems are nowadays employed in areas as diverse as software development, hardware design, or knowledge representation. Despite many success stories, today's analysis methods are still not widespread in engineering practice. The SVARM (Synthesis, Verification, and Analysis of Rich Models) workshop explores directions and techniques for making automated reasoning (including analysis and synthesis) applicable to a wider range of problems, as well as making them easier to use by researchers, software developers, hardware designers, and information system users and developers. VERIFY ------ The VERIFY workshops aim at bringing together people who are interested in the development of safety and security critical systems, in formal methods, in the development of automated theorem proving techniques, and in the development of tool support. Practical experiences gained in realistic verifications are of interest to the automated theorem proving community, and new theorem proving techniques should be transferred into practice. The overall objective of the VERIFY workshops is to identify open problems and to discuss possible solutions under the theme: What are the verification problems? What are the deduction techniques? Submission Format ----------------- There are two different categories to submit papers in: - Regular paper: Submissions in this category describe previously unpublished work (completed or in progress), including descriptions of research tools, and applications. Papers must be 6-15 pages long (in Springer LNCS style). - Discussion paper: Submissions in this category are intended to initiate discussions and hence should address controversial issues. Papers must be 3-15 pages long (in Springer LNCS style). Please also indicate with your submission, whether you consider your paper more suitable for the VERIFY or SVARM part of the joint workshop. Submission of papers to the Joint SVARM & VERIFY 2012 Workshop is via EasyChair: https://www.easychair.org/conferences/?conf=svarmverify2012. Each accepted paper shall be presented at the workshop and at least one author of each paper must attend the workshop. The collection of accepted papers will be distributed at the workshop and will also be published in the CEUR Workshop Proceedings series. Important Dates --------------- May 14, 2012: Abstract submission deadline. May 21, 2012: Paper submission May 30, 2012: Notifications sent to authors. June 8, 2012: Final versions of papers due. June 30 / July 1, 2012: Workshop. Organizing Committee -------------------- Chairs: Viktor Kuncak, EPFL Lausanne, Switzerland Carsten Sinz, KIT, Karlsruhe, Germany For a list of members of the program committee see the web page: http://baldur.iti.kit.edu/SVARM-VERIFY-2012 From sslf12 at info.uaic.ro Tue May 8 16:06:28 2012 From: sslf12 at info.uaic.ro (SSLF 2012) Date: Tue, 8 May 2012 15:06:28 -0500 Subject: [TYPES/announce] CFP: Summer School on Language Frameworks Message-ID: <201205082006.q48K6SlW028961@fsl3.cs.uiuc.edu> Summer School on Language Frameworks Sinaia, Romania, July 23-31, 2012. https://fmse.info.uaic.ro/events/SSLF12/ This nine-day summer school is dedicated to investigating six state-of-the-art programming language definitional frameworks, at a relaxed pace, by means of tutorials, hands-on projects, and plenty of discussions in a picturesque place in the Carpathian Mountains (alphabetically): K (http://k-framework.org/) Presenter: Grigore Rosu (http://fsl.cs.uiuc.edu/~grosu) Maude (http://maude.cs.uiuc.edu/) Presenter: Jose Meseguer (http://formal.cs.uiuc.edu/meseguer/) PLanCompS (http://www.plancomps.org/) Presenter: Peter Mosses (http://www.cs.swan.ac.uk/~cspdm/) Rascal (http://www.rascal-mpl.org/) Presenter: Paul Klint (http://www.rascal-mpl.org/) Redex (http://redex.racket-lang.org/) Presenter: Robby Findler (http://www.eecs.northwestern.edu/~robby/) Spoofax (http://spoofax.org/) Presenters: Eelco Visser (http://swerl.tudelft.nl/bin/view/EelcoVisser) Guido Wachsmuth (http://www.linkedin.com/in/guidowachsmuth) Please visit https://fmse.info.uaic.ro/events/SSLF12/ for details and registration. The number of participants is limited. From hamana at cs.gunma-u.ac.jp Wed May 9 08:45:41 2012 From: hamana at cs.gunma-u.ac.jp (Makoto Hamana) Date: Wed, 9 May 2012 21:45:41 +0900 (JST) Subject: [TYPES/announce] Call for Participation: HOR'12, Nagoya Message-ID: <20120509124541.BA0D258DAD3@vc2.tech.gunma-u.ac.jp> ===================================================================== Call for Participation 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. Invited speaker --------------- * Zhenjiang Hu (National Institute of Informatics, Japan) Can Graph Transformation be Bidirectionalized? -- Bidirectional Semantics of Structural Recursion on Graphs -- Special Session: Current Status of Higher-Order Termination Tools ----------------------------------------------------------------- * Carsten Fuhs: Haskell termination tool * Rene Thiemann: Isabelle termination tool * Aoto,Yamada: Simply-typed TRS termination tool * Cynthia Kop: WANDA, termination tool for AFS Accepted papers --------------- * Beniamino Accattoli and Delia Kesner: The permutative lambda-calculus (The original paper was presented at LPAR'12, LNCS 7180, pp.381-395) * Thibaut Balabonski: A Unified Approach to Fully Lazy Sharing (The original paper was presented at POPL'12, pp.233-246) * Yuki Chiba and Takahito Aoto: Pattern Matching Algorithm for Higher Order Program Transformations * Jean-Pierre Jouannaud and Jian-Qi Li: Termination of higher-order rewriting in dependent type calculi * Vincent van Oostrom: Confluence via Critical Valleys * Kristoffer Rose: Higher Order Rewriting for Real Programmers From cbraga at ic.uff.br Wed May 9 09:21:39 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 9 May 2012 10:21:39 -0300 Subject: [TYPES/announce] SBMF 2012 - Deadline Extended to May 20 Message-ID: <6630F701-BDE7-4565-A325-3E2611AFBA91@ic.uff.br> *** Apologies for multiple copies due to cross-posting *** *** Please forward to colleagues who might be interested *** ===SBMF 2012=== 15th BRAZILIAN SYMPOSIUM ON FORMAL METHODS http://cbsoft.dimap.ufrn.br/ Natal, Brazil September 23-28, 2012 *** Proceedings will published in LNCS/Springer *** *** New submission deadlines *** Paper Submission: May 20, 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 May 20, 2012: Full Paper Submission Deadline (American Samoa Time Zone) July 05, 2012: Full Paper Acceptance Notification July 12, 2012: Full Paper Camera-ready Version July 20, 2012: Short Paper Submission Deadline August 20, 2012: Short Paper Acceptance Notification August 31, 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 viktor at mpi-sws.org Wed May 9 11:15:51 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Wed, 9 May 2012 17:15:51 +0200 Subject: [TYPES/announce] POPL 2013: Call for papers Message-ID: <93FA0EE7-8851-418D-8F66-0507AB336B40@mpi-sws.org> ********************* POPL 2013: Call for papers ************************ 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages http://popl.mpi-sws.org/2013/ POPL dates: 23-25 January 2013 Co-located events: 20-22, 26 January 2013 Location: Rome, Italy Paper registration: 6 July 2012, 11:59pm American Samoa time (UTC-11h) Paper submission: 10 July 2012, 11:59pm American Samoa time (UTC-11h) Author response: 10-13 September 2012 Notification: 1 October 2012 Submission URL: https://popl2013.ens.fr (will open nearer the deadline) Scope: The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and systems, with emphasis on how principles underpin practice. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. Papers discussing new ideas and areas are most welcome, as are high-quality expositions or elucidations of existing concepts that are likely to yield new insights ("pearls"). For more information and submission guidelines, please consult the POPL'13 website: http://popl.mpi-sws.org/2013/ From su at cs.ucdavis.edu Wed May 9 16:17:26 2012 From: su at cs.ucdavis.edu (Zhendong Su) Date: Wed, 09 May 2012 13:17:26 -0700 Subject: [TYPES/announce] ISSTA 2012 Call for Participation In-Reply-To: <4FAAB6BE.3000002@cs.ucdavis.edu> References: <4FAAB6BE.3000002@cs.ucdavis.edu> Message-ID: <4FAAD0D6.60909@cs.ucdavis.edu> ISSTA 2012 CALL FOR PARTICIPATION REGISTRATION NOW OPEN! ===================================================================== 2012 International Symposium on Software Testing and Analysis (ISSTA 2012) July 15th-20th, 2012, Minneapolis, MN http://crisys.cs.umn.edu/issta2012/ ===================================================================== ISSTA is the premier ACM conference focusing on research related to software testing and analysis. The conference features the presentation of research papers, three co-located workshops, a co-located industry research event targeting the local medical devices industry, and two keynotes. This year's keynotes will be given by Rance Cleaveland (University of Maryland) and Martin Rinard (MIT). ISSTA 2012 has accepted 31 papers out of the 108 submissions (http://www.cs.ucdavis.edu/~su/issta12-papers.html) to its technical track this year. In addition to a rich and diverse technical track, ISSTA's co-located events offer deeper coverage of focused topics. Co-Located Events ================= * ETSE: The 2nd Workshop on End-to-end Test Script Engineering * PADTAD: The 10th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging * WODA: The 10th International Workshop on Dynamic Analysis * SSS: The 4th University of Minnesota Summer Software Symposium Registration ============ Early registration ends June 18, 2012. https://regmaster3.com/2012conf/ISSTA12/register.php Hotel Reservations ================== Make reservations at the conference hotel at discounted rates: http://crisys.cs.umn.edu/issta2012/location.shtml CAPS Funding for Travel and Childcare ===================================== Check out the SIGSOFT CAPS program for travel support: http://www.sigsoft.org/CAPS/ General Chair ============= Mats Heimdahl - University of Minnesota Program Committee Chair ======================= Zhendong Su - University of California, Davis Sponsored By ============ Association for Computing Machinery (ACM) ACM Special Interest Group on Software Engineering (ACM SIGSOFT) Supported By ============ EMC/Greenplum IBM Research Microsoft Research (additional sponsors to be confirmed) From gabriel at info.uaic.ro Thu May 10 00:32:11 2012 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Thu, 10 May 2012 07:32:11 +0300 (EEST) Subject: [TYPES/announce] CfP MeCBIC 2012 (8th September, Newcastle) Message-ID: Apologies for multiple copies. ---------------------------------------------------------------- Call for Papers MeCBIC 2012 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi 8th September 2012, Newcastle, UK http://www.info.uaic.ro/~mecbic/mecbic2012/ ================================================================ *** IMPORTANT DATES *** Title and Abstract: 11 June, 2012 Paper Submission: 16 June, 2012 Notification: 23 July, 2012 Revised version: 7 August, 2012 The 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi will be held this year on 8th September in Newcastle as one of the affiliated workshops of CONCUR 2012. Traditionally MeCBIC papers deal with multilevel multiset rewriting as they appear in membrane computing (a rule-based formalism), in Petri nets, and in several process calculi (mobile ambients, brane calculi). A cross fertilization of various research areas has recently started; a deeper investigation of the relations between these related formalisms is interesting, as it is important to understand the similarities and the differences. Topics of interest include (but are not limited to): Biologically inspired models and calculi; Biologically inspired systems and their applications; Analysis of properties of biologically inspired models and languages; Theoretical links and comparison between different models/systems. *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work, and not be submitted concurrently to another conference or journal. Authors are invited to submit their papers (of about 16 pages) using the web page http://www.easychair.org/conferences/?conf=mecbic2012. We also encourage short papers (around 8 pages) presenting new tools or platforms related to the topics of MeCBIC 2012. The workshop proceedings will be published in the Electronic Proceedings in Theoretical Computer Science. After the workshop, some selected papers will be published in Scientific Annals of Computer Science. *** PROGRAM COMMITTEE *** * Bogdan Aman, A.I.Cuza University, Iasi, RO * Roberto Barbuti, University of Pisa, Italy * Luca Cardelli, Microsoft, Cambridge, UK * Gabriel Ciobanu, Romanian Academy, Iasi (chair) * Erik de Vink, TU Eindhoven, NL * Jean-Louis Giavitto, IRCAM CNRS, Paris, France * Jane Hillston, University of Edinburgh, UK * Jetty Kleijn, Leiden University, NL * Jean Krivine, University Paris 7, France * Emanuela Merelli, University of Camerino, Italy * Paolo Milazzo, University of Pisa, Italy * Gethin Norman, University of Glasgow, UK * Michele Pinna, University of Cagliari, Italy * Franck Pommereau, University of Evry, France * Jason Steggles, Newcastle University, UK * Angelo Troina, University of Torino, Italy ======================================================== Past Events: The first edition of MeCBIC was held in Venice in 2006 (co-located with ICALP 2006). The second MeCBIC was held in Iasi in 2008, the third one took place in Bologna (as a satellite event of CONCUR 2009), and the forth one in Jena. The previous proceedings of the MeCBIC workshops have been published as ENTCS volumes 171 and 227 (2006, 2008), EPTCS volumes 11 and 40 (2009, 2010), in arXiv.org in 2011, and in Theoretical Computer Science volume 431 in 2012. From koba at kb.is.s.u-tokyo.ac.jp Thu May 10 02:57:43 2012 From: koba at kb.is.s.u-tokyo.ac.jp (koba) Date: Thu, 10 May 2012 15:57:43 +0900 (JST) Subject: [TYPES/announce] Postdoc position on automated verification of higher-order programs Message-ID: <20120510.155743.1000278277145530409.koba@kb.is.s.u-tokyo.ac.jp> A postdoc position is available for 5-year project "Higher-Order Model Checking and its Applications" (see the project description below), at University of Tokyo, Japan. The appointment can start as early as September 2012 (the starting date is negotiable). The contract of appointment will be renewed for each academic year, and can be extended up to March 2016, subject to performance. Salary will be about 300,000-350,000 Japanese yen per month. Applicants should have a Ph.D in computer science or related fields, and have a strong background in at least one (preferably two or more) of the following topics: program verification, type systems, game semantics, model checking, formal languages and automata, and automated theorem proving. Interested candidates are invited to send a detailed CV via email to Naoki Kobayashi (koba at is.s.u-tokyo.ac.jp), no later than June 30th, 2012. Project Description -------------------- Project Title: Higher-Order Model Checking and its Applications Principal Investigator: Naoki Kobayashi (University of Tokyo) Collaborators: Atushi Igarashi (Kyoto University) and Ayumi Shinohara (Tohoku University) Term: June 2011 - March 2016 Model checking is one of the promising techniques for software verification, but traditional model checking (such as finite-state and pushdown model checking) was not suitable for verification of high-level programs that use higher-order functions and recursion. We have recently studied higher-order model checking (more precisely, model checking of the trees generated by higher-order recursion schemes, which has been studied only among theoretical communities until recently), and shown that (i) many program verification problems can be reduced to higher-order model checking, and that (ii) despite its extremely high worst-case complexity, higher-order model checking can be solved efficiently for many typical inputs. Based on those results, we have constructed the first higher-order model checker TRecS and implemented a prototype automated program verification tool for a subset of ML, on top of the model checker. The aim of this project is to further advance this series of work on higher-order model checking and program verification, and to construct a software model checker for full-scale functional (and possibly also object-oriented) programming languages. We will also exploit new applications of higher-order model checking, such as data compression. Related publications: Naoki Kobayashi, "Types and Higher-Order Recursion Schemes for Verification of Higher-Order Programs," Proceedings of POPL 2009, pp.416-428, 2009. Naoki Kobayashi and Luke Ong, "A Type System Equivalent to Modal Mu-Calculus Model Checking of Recursion Schemes," Proceedings of LICS 2009, pp.179-188, 2009 Naoki Kobayashi, "Model-Checking Higher-Order Functions", Proceedings of PPDP 2009, pp.25-36, 2009. Naoki Kobayashi, Naoshi Tabuchi, and Hiroshi Unno, "Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification", Proceedings of POPL 2010, pp.495-508, 2010. Naoki Kobayashi, Ryosuke Sato, and Hiroshi Unno, "Predicate Abstraction and CEGAR for Higher-Order Model Checking", Proceedings of PLDI 2011, pp.222-233, 2011. Naoki Kobayashi, Kazutaka Matsuda, and Ayumi Shinohara "Functional Programs as Compressed Data", PEPM 2012. Naoki Kobayashi, "Higher-Order Model Checking: From Theory to Practice", Invited paper in Proceedings of LICS 2011. (A very brief survery of the field) --------------------- Naoki Kobayashi Department of Computer Science Graduate School of Information Science and Technology Univeristy of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033 Japan email: koba at is.s.u-tokyo.ac.jp From web.alessio.guglielmi at gmail.com Thu May 10 05:10:16 2012 From: web.alessio.guglielmi at gmail.com (Alessio Guglielmi) Date: Thu, 10 May 2012 10:10:16 +0100 Subject: [TYPES/announce] University of Bath Prize Fellow - 21/5 deadline approaching Message-ID: <4fab85ff.429ccc0a.185d.23bb@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 a.das at bath.ac.uk Thu May 10 07:36:09 2012 From: a.das at bath.ac.uk (Anupam Das) Date: Thu, 10 May 2012 12:36:09 +0100 Subject: [TYPES/announce] Wessex Theory Seminar, Bath, 23rd May Message-ID: <4FABA829.4000306@bath.ac.uk> I am happy to announce that the 14th Wessex Theory Seminar will be taking place at the University of Bath on Wednesday 23rd May. The Wessex Theory Seminars are a series of workshops focussed on theoretical computer science, and in particular mathematical foundations of programming languages. It is designed to be a joint seminar of Mathematics and Computer Science departments, and industrial collaborators. More information can be found on the wiki: https://wiki.bath.ac.uk/display/wessex/Wessex+Theory+Seminar . We have already lined up the following speakers: Alessio Guglielmi, Bath Jim Laird, Bath Edmund Robinson, QMUL There is space for 2-3 more talks, so please contact me if you are interested. Also let me know if you are planning to attend by replying to this message. As usual there is funding available to support attendance at the seminar. Further details will be announced closer to the time; check the wiki for the latest information: https://wiki.bath.ac.uk/display/wessex/14th+Wessex+Theory+Seminar Anupam From murano at na.infn.it Thu May 10 06:43:29 2012 From: murano at na.infn.it (Nello Murano) Date: Thu, 10 May 2012 12:43:29 +0200 (CEST) Subject: [TYPES/announce] Call for papers GandALF 2012 -- EXTENDED DEADLINE Message-ID: <54997.172.16.4.15.1336646609.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 Co-located with GAMES 2012 ****************************************************** | CALL FOR PAPERS (EXTENDED DEADLINE) | ****************************************************** 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 CO-LOCATED EVENT GAMES 2012, Annual Workshop of the ESF Networking Programme on Games for Design and Verification (http://www.games.unina.it/). INVITED SPEAKERS Alberto Policriti (University of Udine, Italy). Moreover, we plan to have joint invited speakers with the co-located GAMES meeting. 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 16, 2012 (EXTENDED) Paper submission May 22, 2012 (EXTENDED) 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 sescobar at dsic.upv.es Thu May 10 10:25:40 2012 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Thu, 10 May 2012 16:25:40 +0200 Subject: [TYPES/announce] 6th International School on Rewriting (ISR), Valencia, July 16-20, 2012 References: <1C141D88-3ACB-48DC-8493-38CADA017BCC@dsic.upv.es> Message-ID: <8727B743-B658-4109-8036-DABFEEC1A7C8@dsic.upv.es> Call for Participation ISR 2012 6th International School on Rewriting http://www.dsic.upv.es/~isr2012 July 16th - 20th Valencia, Spain Early registration before June 15, 2012! 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. 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 For more information, please contact Salvador Lucas From sandra at dcc.fc.up.pt Sat May 12 19:06:55 2012 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Sun, 13 May 2012 00:06:55 +0100 Subject: [TYPES/announce] CFP - IFCoLog-CIE Student Session ******** Deadline Extension ********* Message-ID: <1336864015.2275.5.camel@localhost.localdomain> ******************************************************** * DEADLINE EXTENSION * * IFCoLog-CIE Student Session * * 18-23 June 2012, University of Cambridge. * * In conjunction with CiE 2012 * * TURING CENTENARY CONFERENCE ? How the World Computes * ******************************************************** The new dates are: --------------- * 21 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 From jhala at cs.ucsd.edu Sat May 12 20:57:34 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Sat, 12 May 2012 17:57:34 -0700 Subject: [TYPES/announce] 2nd Call For Papers: APLAS 2012, 10th Asian Symposium on Programming Languages and Systems Message-ID: <1A45C051-1252-4666-A9A6-9F942F9A2371@cs.ucsd.edu> (Apologies for multiple copies. Abstract deadline in 30 days!) 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 Pieter.Philippaerts at cs.kuleuven.be Mon May 14 10:02:40 2012 From: Pieter.Philippaerts at cs.kuleuven.be (Pieter Philippaerts) Date: Mon, 14 May 2012 16:02:40 +0200 Subject: [TYPES/announce] Fifth International Symposium on Engineering Secure Software and Systems (ESSoS) - Call for Papers Message-ID: <00d601cd31da$3a074940$ae15dbc0$@cs.kuleuven.be> Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos2013/ February 27 - March 1, 2013, Paris, France In cooperation with (pending): ACM SIGSAC and SIGSOFT and IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Hostile, networked environments, like the Internet, can allow vulnerabilities in software to be exploited from anywhere. To address this, high-quality security building blocks (e.g., cryptographic components) are necessary, but insufficient. Indeed, the construction of secure software is challenging because of the complexity of modern applications, the growing sophistication of security requirements, the multitude of available software technologies and the progress of attack vectors. Clearly, a strong need exists for engineering techniques that scale well and that demonstrably improve the software's security properties. GOAL AND SETUP The goal of this symposium, which will be the fifth in the series, is to bring together researchers and practitioners to advance the states of the art and practice in secure software engineering. Being one of the few conference-level events dedicated to this topic, it explicitly aims to bridge the software engineering and security engineering communities, and promote cross-fertilization. The symposium will feature two days of technical program, and is also open to proposals for both tutorials and workshops. In addition to academic papers, the symposium encourages submission of high-quality, informative experience papers about successes and failures in security software engineering and the lessons learned. Furthermore, the symposium also accepts short idea papers that crisply describe a promising direction, approach, or insight. TOPICS The Symposium seeks submissions on subjects related to its goals. This includes a diversity of topics including (but not limited to): - scalable techniques for threat modeling and analysis of vulnerabilities - specification and management of security requirements and policies - security architecture and design for software and systems - model checking for security - specification formalisms for security artifacts - verification techniques for security properties - systematic support for security best practices - security testing - security assurance cases - programming paradigms, models and DLS's for security - program rewriting techniques - processes for the development of secure software and systems - security-oriented software reconfiguration and evolution - security measurement - automated development - trade-off between security and other non-functional requirements (in particular economic considerations) - support for assurance, certification and accreditation - empirical secure software engineering SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag (pending) in the Lecture Notes in Computer Science Series (http://www.springer.com/lncs). Submissions should follow the formatting instructions of Springer LNCS. Submitted papers must present original, non-published work of high quality. For selected papers, there will be an invitation to submit extended versions to a special issue in the International Journal of Information Security. Two types of papers will be accepted: Full papers (max 14 pages without bibliography/appendices) - May describe original technical research with a solid foundation, such as formal analysis or experimental results, with acceptance determined mostly based on novelty and validation. Or, may describe case studies applying existing techniques or analysis methods in industrial settings, with acceptance determined mostly by the general applicability of techniques and the completeness of the technical presentation details. Idea papers (max 8 pages with bibliography) - May crisply describe a novel idea that is both feasible and interesting, where the idea may range from a variant of an existing technique all the way to a vision for the future of security technology. Idea papers allow authors to introduce ideas to the field and get feedback, while allowing for later publication of complete, fully-developed results. Submissions will be judged primarily on novelty, excitement, and exposition, but feasibility is required, and acceptance will be unlikely without some basic, principled validation (e.g., extrapolation from limited experiments or simple formal analysis). In the proceedings, idea papers will clearly identified by means of the "Idea" tag in the title. Proposals for both tutorials and workshops are welcome. Further guidelines will appear on the website of the symposium. IMPORTANT DATES Paper submission: September 30, 2012 Author notification: November 22, 2012 Camera-ready: December 13, 2012 PROGRAM COMMITTEE PC Co-Chairs Jan J?rjens, TU Dortmund and Fraunhofer ISST Ben Livshits, Microsoft Research PC Davide Balzarotti, EURECOM, France Ruth Breu, University of Innsbruck, Austria Cristian Cadar, Imperial College, UK Julian Dolby, IBM Research, US Matt Fredrikson, University of Wisconsin, US Dieter Gollmann, TU Hamburg-Harburg, Germany Maritta Heisel, U. Duisburg Essen, Germany Peter Herrmann, NTNU, Trondheim, Norway Thorsten Holz, U. Ruhr Bochum, Germany Sergio Maffeis, Imperial College, UK Heiko Mantel, TU Darmstadt, Germany Anders M?ller, Aarhus University, Denmark Haris Mouratidis, University of East London, UK Zachary Peterson, Naval Postgraduate School, US Frank Piessens, KU Leuven, Belgium Erik Poll, RU Nijmegen, NL Alexander Pretschner, TU Munich, Germany Wolfgang Reif, University of Augsburg, Germany Jianying Zhou, Institute for Infocomm Research, Singapore Mohammad Zulkernine, Queens University, Canada Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From might at cs.utah.edu Mon May 14 10:33:57 2012 From: might at cs.utah.edu (Matt Might) Date: Mon, 14 May 2012 08:33:57 -0600 Subject: [TYPES/announce] 2nd Call for Papers: NSAD 2012 (co-located with SAS 2012) Message-ID: Event: Numerical and Symbolic Abstract Domains (NSAD 2012) Submission: 6 June 2012 (Three weeks away!) Date: 10 September 2012 Location: Deauville, France. (Co-located with SAS'2012.) Site: 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 U.Berger at swansea.ac.uk Mon May 14 11:52:27 2012 From: U.Berger at swansea.ac.uk (Ulrich Berger) Date: Mon, 14 May 2012 16:52:27 +0100 Subject: [TYPES/announce] MFPS 28: Programme and Call for Participation Message-ID: <4FB12A3B.5050304@swansea.ac.uk> 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 For a preliminary PROGRAMME scroll down to the end of this email For CONFERENCE REGISTRATION and HOTEL RESERVATION follow the links given at http://www.math.tulane.edu/~mfps/MFPS28 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 three 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 * 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 also will be a series of Tutorial Lectures on Game Semantics. These are being organized by Andrea Schalk (Manchester) and Paul-Andre M?llies (Paris VII), The speakers will include the organizers as well as Martin Hyland (Cambridge) and Luke Ong (Oxford). 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 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). PRELIMINARY PROGRAMME Wednesday June 6 8:30-9:30 Tutorial 1 on Game Semantics Andrea Schalk, Manchester Introduction to game semantics 9:30-9:50 Break 9:50-10:50 Plenary Address Patricia Johann, Strathclyde Lifting Functors: Induction, Coinduction, and (maybe) Parametricity 10:50-11:00 Break 11:00-11:30 Stephen Brookes Concurrent Separation Logic and Syntactic Control of Interference 11:30-12:00 Aquinas Hobor and Robert Dockins Time Bounds for General Function Pointers 12:00-13:30 Lunch Session on Logic, computation and algebraic topology 13:30-14:30 Plenary Address Steve Awodey, CMU Homotopy Type Theory 14:30-15:00 Sanjeevi Krishnan Title tba 15:00-15:20 Break 15:20-15:50 Eric Goubault Geometry of trace spaces and (some) applications 15:50-16:20 Nicola Gambino Homotopy-initial W-types 16:20-16:50 Andrej Bauer Automation of proofs in HoTT End of session on Logic, computation and algebraic topology 16:50-17:00 Break 17:00-17:30 Joachim Kock Data Types with Symmetries and Polynomial Functors Over Groupoids 17:30-18:00 Naohiko Hoshino A Representation Theorem for Unique Decomposition Categories 19:00 Reception at the Roman Baths Thursday, 7 June 8:30-9:30 Tutorial 2 on Game Semantics Paul-Andre Mellies, Paris VII Tensorial logic, dialogue categories and games 9:30-9:50 Break 9:50-10:50 Plenary Address Michael Clarkson, GWU Mathematical Foundations for Computer Security 10:50-11:00 Break 11:00-11:30 Matteo Cimini, Mohammadreza Mousavi, Michel Reniers and Murdoch Gabbay Nominal SOS 11:30-12:00 Murdoch Gabbay and Dan Ghica Game Semantics in the Nominal Model 12:00-13:30 Lunch Session on Computational effects 13:30-14:30 Plenary Address John Power, Bath Category Theoretic Understandings of Universal Algebra and its dual: monads and Lawvere theories, comonads and ? 14:30-15:00 Alex Simpson Observational equivalence for computational effects 15:00-15:20 Break 15:20-15:50 Neil Ghani Fibrational Induction Meets Effects 15:50-16:20 Andrej Bauer A semantic account of an effect system 16:20-16:50 Sam Staton State-passing style End of Session on Computational effects 16:50-17:00 Break 17:00-17:30 Ingo Battenfeld Observationally-induced effects in cartesian closed categories 17:30-18:00 Barbara Petit Continuation Models for the Lambda Calculus with Constructors Friday, 8 June 8:30-9:30 Tutorial 3 on Game Semantics Martin Hyland, Cambridge 9:30-9:50 Break 9:50-10:20 Ugo Montanari and Matteo Sammartino Network Conscious pi-calculus: a Concurrent Semantics 10:20-10:50 Toby Wilkinson A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation 10:50-11:00 Break 11:00-11:30 Filippo Bonchi, Marcello Bonsangue, Georgiana Caltais, Jan Rutten and Alexandra Silva Final Semantics for Decorated Traces 11:30-12:00 Dan Teodosiu A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources 12:00-13:30 Lunch Session on Computability on Continuous Data This session is part of the ATY 13:30-14:30 Plenary Address Drew Moshier Title tba 14:30-15:00 Nick Bezhanishili Logics for compact Hausdorff spaces 15:00-15:20 Break 15:20-15:50 Paul Taylor Semilattice bases for locally compact spaces 15:50-16:20 Jens Blanck Interval domains and computable sequences 16:20-16:50 Martin Escardo The intrinsic topology of a Martin-Lof universe, with an application to Rice's theorem for the universe End of Session on Computability on Continuous Data 16:50-17:00 Break 17:00-17:30 Oleksandr Manzyuk A Simply Typed Lambda-Calculus of Forward Automatic Differentiation 17:30-18:00 Andrew Lawrence, Ulrich Berger and Monika Seisenberger Extracting a DPLL Algorithm 20:00 Dinner at the Roman Baths Saturday, 9 June 8:30-9:30 Tutorial 4 on Game Semantics Luke Ong, Oxford Two-level Game Semantics, Intersection Types and Higher-Order Model Checking 13:00-9:50 Break 9:50-10:20 Dan Ghica and Nikos Tzevelekos A System-Level Game Semantics 10:20-10:50 Guy McCusker, John Power and Cai Wingfield. A Graphical Foundation for Schedules 10:50-11:00 Break 11:00-11:30 Roy Dyckhoff, Mehrnoosh Sadrzadeh and Julien Truffaut Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators 11:30-12:00 Wolfgang Jeltsch Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming 12:00-13:30 Lunch 13:30-14:30 Plenary Address Dexter Kozen New 14:30-14:50 Break 14:50-15:20 Robin Cockett, Ximo Diaz-Boils, Jonathan Gallagher and Pavel Hrubes Timed Sets, Functional Complexity, and Computability 15:20-15:50 Ulrich Berger and Tie Hou Typed vs Untyped Realizability End of conference From cesar.a.munoz at nasa.gov Tue May 15 13:35:51 2012 From: cesar.a.munoz at nasa.gov (MUNOZ, CESAR (LARC-D320)) Date: Tue, 15 May 2012 12:35:51 -0500 Subject: [TYPES/announce] [fm-announcements] NASA/NIA PVS Class 2012 Message-ID: NASA/NIA PVS Class October 9-12, 2012 The Formal Methods teams at the NASA Langley Research Center and the National Institute of Aerospace are offering a short course on the PVS theorem prover in the fall of 2012. The class will take place October 9-12 in Hampton, Virginia: http://shemesh.larc.nasa.gov/PVSClass2012 The course is offered free of charge as a public service to the formal methods community. The class is open to all interested individuals. However, seats are limited and all attendees must register at http://shemesh.larc.nasa.gov/PVSClass2012/registration.html We emphasize a hands-on, immersion-style learning approach. Both lecturematerial and in-class exercises using PVS are featured. For this reason, we strongly encourage attendees to bring a laptop equipped to run PVS. All the instructors are members of the NASA Langley Formal Methods group and expert PVS users. The PVS Class 2012 will feature a technical lecture and an invited talk by Sam Owre, one of the creators of PVS and its main developer. For more information, please contact Cesar Munoz (Cesar.A.Munoz at nasa.gov), Anthony Narkawicz (Anthony.Narkawicz at nasa.gov) http://shemesh.larc.nasa.gov/PVSClass2012 --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From francesco.zappa_nardelli at inria.fr Wed May 16 03:18:09 2012 From: francesco.zappa_nardelli at inria.fr (Francesco Zappa Nardelli) Date: Wed, 16 May 2012 09:18:09 +0200 Subject: [TYPES/announce] PostDoc position in Paris, France on weak-memory concurrency and compilation Message-ID: [Please bring these to the attention of any suitable candidates - thanks, -francesco] ********************************************************************** We are seeking applicants for a post-doctoral position to join a group working on the broad area of concurrency and compilation in the Parkas team (http://www.di.ens.fr/ParkasTeam.html -- INRIA, located at ENS, Paris, France). Recent work has focussed on the relaxed-memory concurrency that real systems exhibit, including work on the memory models of multiprocessors (x86, Power, ARM), 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://moscova.inria.fr/~zappa/projects/weakmemory/. We now plan to continue some of the above, and design and implement compilation techniques for efficiently exploit the model parallel hardware, including non-coherent many-core architectures as Tilera and Kalray, or investigate parallel compilation of synchronous languages. Applicants must have a PhD 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. Starting date is negotiable (tentatively October 2012). A keen interest in programming languages, concurrency, and compilation 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 ANR WMC project (http://moscova.inria.fr/~zappa/projects/wmc/) led by Francesco Zappa Nardelli (http://moscova.inria.fr/~zappa/). Applications should include: * a curriculum vitae * a brief statement of the particular contribution you would like to make to the project * the names and contact details (postal and e-mail addresses) of two referees. Applications and enquiries should be sent to francesco.zappa_nardelli (@) inria.fr Closing Date: 4 June 2012 ********************************************************************** From pangjun at gmail.com Wed May 16 05:50:43 2012 From: pangjun at gmail.com (Jun PANG) Date: Wed, 16 May 2012 11:50:43 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at SAC 2013: First CfP Message-ID: ================================================== 28th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 18 - 22, 2013, Coimbra, Portugal More information: http://www.win.tue.nl/sacsvt13/ and http://www.acm.org/conferences/sac/sac2013/ =================================================== Important dates --------------- * September 21st 2012: Submission deadline * November 10th 2012: Notification of acceptance/rejection * November 30th 2012: Camera-ready versions due ACM Symposium on Applied Computing ---------------------------------- The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-seven years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2013 is sponsored by SIGAPP and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra, Coimbra, Portugal. Software Verification and Testing Track --------------------------------------- We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - refinement and correct by construction development - model-based testing - verification-based testing - run-time verification - symbolic execution and partial evaluation - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines ---------------------- Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/c/sac2013/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Publication of accepted articles requires the commitment of one of the authors to register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2013 proceedings. A special issue of Science of Computer Programming (SCP) has been confirmed. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of SCP. Program committee ----------------- Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Sarfraz Khurshid, University of Texas at Austin, USA Ramtin Khosravi, University of Tehran, Iran Yang Liu, National University of Singapore, Singapore Delphine Longuet, Universit? Paris-Sud 11, France Yves Le Traon, University of Luxembourg, Luxembourg MohammadReza Mousavi (co-chair), Eindhoven University of Technology, The Netherlands Mercedes Merayo, Universidad Complutense de Madrid, Spain Stephan Merz, INRIA Nancy, France Markus Mueller-Olm, University of Muenster, Germany Jun Pang (co-chair), University of Luxembourg, Luxembourg Dave Parker, University of Birmingham, UK Hongyang Qu, Oxford University, UK Martin Steffen, University of Oslo, Norway Tim Willemse, Eindhoven University of Technology, The Netherlands From ruy at cin.ufpe.br Wed May 16 06:10:10 2012 From: ruy at cin.ufpe.br (Ruy de Queiroz) Date: Wed, 16 May 2012 07:10:10 -0300 Subject: [TYPES/announce] E. W. Beth Dissertation Prize: 2012 new call for nominations In-Reply-To: References: Message-ID: E. W. Beth Dissertation Prize: 2012 new call for nominations Since 2002, FoLLI (the Association for Logic, Language, and Information, http://www.folli.org) awards the E.W. Beth Dissertation Prize to outstanding dissertations in the fields of Logic, Language, and Information. We invite submissions for the best dissertation which resulted in a Ph.D. degree in the year 2011. The dissertations will be judged on technical depth and strength, originality, and impact made in at least two of three fields of Logic, Language, and Computation. Interdisciplinarity is an important feature of the theses competing for the E.W. Beth Dissertation Prize. Who qualifies. Nominations of candidates are admitted who were awarded a Ph.D. degree in the areas of Logic, Language, or Information between January 1st, 2011 and December 31st, 2011. There is no restriction on the nationality of the candidate or the university where the Ph.D. was granted. After a careful consideration, FoLLI has decided to accept only dissertations written in English. Dissertations produced in 2011 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (for dissertations defended in 2012). The present call for nominations for the E.W. Beth Disertation Award 2012 will also accept nominations of full English translations of theses originally written in another language than English and defended in 2010 or 2011. Prize. The prize consists of: -a certificate -a donation of 2500 euros provided by the E.W. Beth Foundation -an invitation to submit the thesis (or a revised version of it) to the FoLLI Publications on Logic, Language and Information (Springer). For further information on this series see the FoLLI site. How to submit. Only electronic submissions are accepted. The following documents are required: 1. The thesis in pdf or ps format (doc/rtf not accepted); 2. A ten page abstract of the dissertation in ascii or pdf format; 3. A letter of nomination from the thesis supervisor. Self-nominations are not admitted: each nomination must be sponsored by the thesis supervisor. The letter of nomination should concisely describe the scope and significance of the dissertation and state when the degree was officially awarded; 4. Two additional letters of support, including at least one letter from a referee not affiliated with the academic institution that awarded the Ph.D. degree. All documents must be submitted electronically to buszko at amu.edu.pl. Hard copy submissions are not admitted. In case of any problems with the email submission or a lack of notification within three working days, nominators should write to buszko at amu.edu.pl. Important dates: Deadline for Submissions: May 1, 2012. *Extended: June 30, 2012*. Notification of Decision: July 31, 2012. Explanation: Due to some technical obstacles, the first call for nominations was announced on the site of FoLLI in the beginning of March 2012 but not widely distributed through mailing lists. Therefore we essentially prolong the deadline now. We ask all potential nominators to inform the chair earlier by a mail to buszko at amu.edu.pl, even before having completed the required documents. Committee : Chris Barker (New York) Wojciech Buszkowski (chair) (Poznan) Dale Miller (Palaiseau) Larry Moss (Bloomington) Ian Pratt-Hartmann (Manchester) Ruy de Queiroz (Recife) Giovanni Sambin (Padua) Rob van der Sandt (Nijmegen) Rineke Verbrugge (Groningen) Heinrich Wansing (Bochum) -------------- next part -------------- An HTML attachment was scrubbed... URL: From iliano at cmu.edu Wed May 16 08:48:07 2012 From: iliano at cmu.edu (Iliano Cervesato) Date: Wed, 16 May 2012 15:48:07 +0300 Subject: [TYPES/announce] Postdoctoral Position on Ensemble Programming at CMU Pittsburgh, PA Message-ID: <4FB3A207.6060808@cmu.edu> Postdoctoral Positions on Ensemble Programming at CMU, Pittsburgh, PA (further details at www.qatar.cmu.edu/iliano/projects/ripple) The School of Computer Science at Carnegie Mellon University seeks applications for one postdoctoral fellow position on effective programming for large distributed ensembles. The position is based in Pittsburgh, PA and targets expertise towards the synergetic development of recent work on logic-based multiset rewriting and on programmable matter (Claytronics) into a usable and verifiable programming language for large distributed ensembles of agents. See the project page for publications and related links. The research will be conducted under the supervision of Prof. Seth Goldstein, Prof. Frank Pfenning and Prof. Iliano Cervesato. Applicants should have a strong background in computer systems (especially distributed systems, embedded systems, reconfigurable computing, or swarm robotics) and familiarity with programming language theory (especially, operational semantics, computational logic, or multiset rewriting), or vice versa. To apply, send a cover letter, a CV and a list of references in PDF format to seth at cs.cmu.edu, fp at cs.cmu.edu and iliano at cmu.edu. Additional material will be requested as needed. -- Iliano Cervesato www.qatar.cmu.edu/~iliano/ Associate Professor Carnegie Mellon University From pierre.hyvernat at univ-savoie.fr Wed May 16 08:53:56 2012 From: pierre.hyvernat at univ-savoie.fr (Pierre Hyvernat) Date: Wed, 16 May 2012 14:53:56 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?Workshop_=22R=E9alisabilit=E9_in_?= =?iso-8859-1?q?Chamb=E9ry_=235=22?= Message-ID: <20120516125356.GA16485@d53> Greetings to all! This is the second 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. The invited speakers are: - Martin Hofmann (Munich): "Proof-relevant logical relations", - Jonas Frey (Paris): "Basic relational objects as an algebraic framework for realizability" - Jean-Louis Krivine (Paris): classical realizability, TBA, - Alexandre Miquel (Lyon): realizability model for set theory, TBA. The program will be made available shortly here: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2012/program.php Note that the meeting will start on Tuesday the 5th, at 2'00 pm. 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 There will be sessions for contributed talks, and PhD students are particularly encouraged to submit a talk. (There are very few submissions at this time: don't hesitate to submit something...) 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. If you are interested, register and contact me as soon as possible... It is 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... You do have to register before the 25th of May though. Other possibilities for accommodation are given on the web page: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2012/logistic.php Pierre Hyvernat -- A complex system that works is invariably found to have evolved from a simple system that works. From a.das at bath.ac.uk Wed May 16 13:09:45 2012 From: a.das at bath.ac.uk (Anupam Das) Date: Wed, 16 May 2012 18:09:45 +0100 Subject: [TYPES/announce] Wessex Theory Seminar, Bath, 23rd May In-Reply-To: <4FABA829.4000306@bath.ac.uk> References: <4FABA829.4000306@bath.ac.uk> Message-ID: <4FB3DF59.2040305@bath.ac.uk> Dear all, A reminder that the 14th Wessex Theory Seminar will be taking place at the University of Bath on 23rd May (next Wednesday). If you plan to attend please reply to this message so I can put you on the attendance list. As usual there is funding available to reimburse travel expenses etc. The preliminary programme is below, and further information can be found on the website: https://wiki.bath.ac.uk/display/wessex/14th+Wessex+Theory+Seminar . The Wessex Theory Seminars are a series of workshops focussed on theoretical computer science, and in particular mathematical foundations of programming languages. It is designed to be a joint seminar of Mathematics and Computer Science departments, and industrial collaborators. More information about the series can be found on the website: https://wiki.bath.ac.uk/display/wessex/Wessex+Theory+Seminar . PRELIMINARY PROGRAMME 10:30 Coffee 11:00 Olle Fredriksson, Birmingham 11:45 Georg Struth, Sheffield 12:30 Lunch 13:45 Alessio Guglielmi, Bath 14:30 James Davenport, Bath 15:15 Edmund Robinson, Queen Mary 16:00 Coffee 16:30 Jim Laird, Bath 17:15 Uday Reddy, Birmingham 18:00 Pub/Dinner Finally, if you are generally interested in the Wessex Theory Seminar series, you can join the wessex-theory mail list by emailing Guy McCusker . I look forward to seeing many of you next week. Anupam On 10/05/12 12:36, Anupam Das wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > I am happy to announce that the 14th Wessex Theory Seminar will be > taking place at the University of Bath on Wednesday 23rd May. > > The Wessex Theory Seminars are a series of workshops focussed on > theoretical computer science, and in particular mathematical > foundations of programming languages. It is designed to be a joint > seminar > of Mathematics and Computer Science departments, and industrial > collaborators. More information can be found on the wiki: > https://wiki.bath.ac.uk/display/wessex/Wessex+Theory+Seminar . > > We have already lined up the following speakers: > > Alessio Guglielmi, Bath > Jim Laird, Bath > Edmund Robinson, QMUL > > There is space for 2-3 more talks, so please contact me if you are > interested. Also let me know if you are planning to attend by replying > to this message. > > As usual there is funding available to support attendance at the seminar. > > Further details will be announced closer to the time; check the wiki > for the latest information: > > https://wiki.bath.ac.uk/display/wessex/14th+Wessex+Theory+Seminar > > Anupam > From amal at ccs.neu.edu Wed May 16 15:01:59 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Wed, 16 May 2012 15:01:59 -0400 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) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Wed May 16 19:23:22 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Thu, 17 May 2012 01:23:22 +0200 Subject: [TYPES/announce] Haskell Symposium 2012 - deadline approaching Message-ID: <4FB436EA.2010808@informatik.uni-bonn.de> [Deadline for submission of abstracts is in two weeks. The submission page is open, earlier submissions welcome.] ======================================================================== "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 * Paper Submission : Sat 2nd June 2012, anywhere on earth * 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: ====== * https://www.easychair.org/conferences/?conf=haskell2012 (submission link) * http://www.haskell.org/haskell-symposium/2012 (the 2012 Haskell Symposium web page) * http://www.icfpconference.org/icfp2012 (the ICFP 2012 web page) * http://www.haskell.org/haskell-symposium (the permanent web page of the Haskell Symposium) From Chris.Hawblitzel at microsoft.com Wed May 16 19:41:29 2012 From: Chris.Hawblitzel at microsoft.com (Chris Hawblitzel) Date: Wed, 16 May 2012 23:41:29 +0000 Subject: [TYPES/announce] 2nd CFP: CPP 2012 - 2nd International Conference on Certified Programs and Proofs Message-ID: <4B55FCDDCA68024B958A711D5437C2E20EEAB5@CH1PRD0310MB391.namprd03.prod.outlook.com> The deadline for submitting to CPP 2012 is June 8, 2012. 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, the proceedings will be published in Springer-Verlag's Lecture Notes in Computer Science series. Suggested, but not exclusive, specific topics of interest for submissions include: certified or certifying programming, compilation, linking, OS kernels, runtime systems, and security monitors; program logics, type systems, and semantics for certified code; certified decision procedures, mathematical libraries, and mathematical theorems; proof assistants and proof theory; new languages and tools for certified programming; program analysis, program verification, and proof-carrying code; certified secure protocols and transactions; certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; certificates for program termination; logics for certifying concurrent and distributed programs; higher-order logics, logical systems, separation logics, and logics for security; teaching mathematics and computer science with proof assistants; and "Proof Pearls" (elegant, concise, and instructive examples). IMPORTANT DATES: Authors are required to submit a paper title and a short abstract before submitting the full paper. The submission should include when necessary a url where to find the formal development assessing the essential aspects of the work. All submissions will be electronic. All deadlines are at midnight (GMT). Abstract Deadline: Friday, 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 (secunet Security Networks AG) 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 adamc at csail.mit.edu Thu May 17 11:45:46 2012 From: adamc at csail.mit.edu (Adam Chlipala) Date: Thu, 17 May 2012 11:45:46 -0400 Subject: [TYPES/announce] Deadline extension: LFMTP'12 Message-ID: <4FB51D2A.7070801@csail.mit.edu> We've extended the deadline for this workshop to _June_1_. Please consider submitting papers about systems for representing and reasoning about languages and logics! ============================================================= 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: June 1, 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 cav2012.publicity.chair at gmail.com Thu May 17 15:43:45 2012 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Thu, 17 May 2012 15:43:45 -0400 Subject: [TYPES/announce] CAV 2012: Call for Participation Message-ID: ====== CALL FOR PARTICIPATION ================================================== 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. ** 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) Invited Talks -------------------------------------------------------------------------------- - Wolfgang Thomas, RWTH Aachen University "Synthesis and Some of Its Challenges" - David Dill, Stanford University "Model Checking Cell Biology" - Alex Haldermann, University of Michigan On security of voting machines Invited Tutorials -------------------------------------------------------------------------------- - Rastislav Bodik and Emina Torlak, University of California, Berkeley "Synthesizing Programs with Constraint Solvers" - Aaron Bradley, University of Colorado at Boulder "IC3 and Beyond: Incremental, Inductive Verification" - Chris Myers, University of Utah "Formal Verification of Genetic Circuits" - Micha? Moskal, Microsoft Research, Seattle "From C to infinity and back: Unbounded auto-active verification with VCC" ====== CONFERENCE PROGRAM ====================================================== Saturday July 7 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - LfSA 2012 Logics for System Analysis Co-chairs: Andr? Platzer, Philipp R?mmer Sunday July 8 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - BOOGIE 2012 2nd International Workshop on Intermediate Verification Languages Chair: Zvonimir Rakamaric - REORDER 2012 First International Workshop on Memory Consistency Models Co-chairs: Sela Mador-Haim, Jade Alglave Monday July 9 - INVITED TUTORIALS ---------------------------------------- 8:30 - 10:00: "Synthesizing Programs with Constraint Solvers" (Ras Bodik and Emina Torlak) 10:00 - 10:30: Break 10:30 - 12:00: "IC3 and Beyond: Incremental, Inductive Verification" (Aaron Bradley) 12:00 - 1:30: Break 1:30 - 3:00: "Formal Verification of Genetic Circuits" (Chris Myers) 3:00 - 3:30: Break 3:30 - 5:00: "From C to infinity and back: Unbounded auto-active verification with VCC" (Michal Moskal) Tuesday July 10 ---------------------------------------- 8:30 - 9:00: Welcome 9:00 - 10:00: "Synthesis and Some of Its Challenges" (Wolfgang Thomas - Keynote) 10:00 - 10:30: Break 10:30 - 12:00: AUTOMATA AND SYNTHESIS R1 Jan Kretinsky and Javier Esparza "Deterministic Automata for the (F,G)-fragment of LTL" R2 Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny "Efficient Controller Synthesis for Consumption Games with Multiple Resource Types" R3 R?diger Ehlers "ACTL ? LTL Synthesis" T1 Fran?ois Raskin "Acacia+, a tool for LTL synthesis" T2 Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl and Alois Knoll "MGSyn: Automatic Synthesis for Industrial Automation" 12:00 - 1:30: Break 1:30 - 3:35: INDUCTIVE INFERENCE AND TERMINATION R4 Yu-Fang Chen and Bow-Yaw Wang "Learning Boolean Functions Incrementally" R5 Rahul Sharma, Aditya Nori and Alex Aiken "Interpolants as Classifiers" R6 Wonchan Lee, Bow-Yaw Wang and Kwangkeun Yi "Termination Analysis with Algorithmic Learning" R7 Marc Brockschmidt, Richard Musiol, Carsten Otto and J?rgen Giesl "Automated Termination Proofs for Java Programs with Cyclic Data" R8 Javier Esparza, Andreas Gaiser and Stefan Kiefer "Proving Termination of Probabilistic Programs Using Patterns" 3:35 - 4:00: Break 4:00 - 6:05: ABSTRACTION R9 Arnaud Venet "The Gauge Domain: Scalable Analysis of Linear Inequality Invariants" R10 Josh Berdine, Arlen Cox, Samin Ishtiaq and Christoph Wintersteiger "Diagnosing Abstraction Failure for Separation Logic-based Analyses" R11 Aditya Thakur and Thomas Reps "A Method for Symbolic Computation of Abstract Operations" R12 Simone Fulvio Rollini, Ondrej Sery and Natasha Sharygina "Leveraging Interpolant Strength in Model Checking" T3 Evan Driscoll, Aditya Thakur and Thomas Reps "OpenNWA: A Nested Word Automaton Library" T4 Aws Albarghouthi, Yi Li, Arie Gurfinkel and Marsha Chechik "UFO: A Framework for Abstraction- and Interpolation-Based Verification" T5 Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina "SAFARI: SMT-based Abstraction For Arrays with Interpolants" 6:30 - 8:30: PC dinner Wednesday July 11 ---------------------------------------- 8:35 - 10:35: CONCURRENCY & SOFTWARE VERIFICATION R13 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi and Akash Lal "Detecting Fair Non-Termination in Multithreaded Programs" R14 Vineet Kahlon and Chao Wang "Lock Removal for Concurrent Trace Programs" R15 Gerhard Schellhorn, John Derrick and Heike Wehrheim "How to prove algorithms linearisable" R16 Anthony Widjaja Lin and Matthew Hague "Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters" R17 Alessandro Cimatti and Alberto Griggio "Software Model Checking via IC3" 10:35 - 11:00: Break 11:00 - 12:00: "Model Checking Cell Biology" (David Dill - Keynote) 12:00 - 1:30: Lunch 1:30 - 3:00: BIOLOGY & PROBABILISTIC SYSTEMS R18 Calin Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu and Ali Sezgin "Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits" R19 Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke "Assume-Guarantee Abstraction Refinement for Probabilistic Systems" R20 Cyrille Jegourel, Axel Legay and Sean Sedwards "Cross entropy optimisation of importance sampling parameters for statistical model checking" T6 David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex Taylor and Moshe Vardi "Ripple: Visual Tool for Modeling and Analysis of Biological Networks" T7 Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Bj?rn Wachter and James Worrell "APEX: An analyzer for open probabilistic programs" 3:30 - 4:00: Break 4:00 - 5:30: *EMBEDDED AND CONTROL SYSTEMS* - special track session R21 Adiya Zutshi, Sriram Sankaranarayanan and Ashish Tiwari "Timed Relational Abstractions For Sampled Data Control Systems" R22 Rupak Majumdar and Majid Zamani "Approximately Bisimilar Symbolic Models for Digital Control Systems" R23 Alessandro Cimatti, Raffaele Corvino, Armando Lazzaro, Iman Narasamdya, Tiziana Rizzo, Marco Roveri, Angela Sanseviero and Andrei Tchaltsev "Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System" T8 Philip Armstrong, Joel Ouaknine, Hristina Palikareva and Bill Roscoe "Recent Developments in FDR" T9 Songzheng Song, Jun Sun, Yang Liu and Jin Song Dong "A Model Checker for Hierarchical Probabilistic Real-time Systems" 6:00 - 9:30: Banquet Thursday July 12 ---------------------------------------- 8:30 - 10:00: *SAT/SMT SOLVING AND SMT-BASED VERIFICATION* - special track session R24 Isil Dillig, Thomas Dillig, Kenneth McMillan and Alex Aiken "Minimum Satisfying Assignments for SMT" R25 Cheng-Shen Han and Jie-Hong Roland Jiang "When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way" R26 Akash Lal, Shaz Qadeer and Shuvendu Lahiri "Corral: A Solver for Reachability Modulo Theories" T10 Shuvendu Lahiri, Chris Hawblitzel, Ming Kawaguchi and Henrique Reb?lo "SymDiff: A language-agnostic semantic diff tool" T11 Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout and Fatiha Zaidi "Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems" 10:00 - 10:30: Break 10:30 - 12:00: *TIMED & HYBRID SYSTEMS* - special track session R27 Shibashis Guha, Chinmay Narayan and S. Arun-Kumar "On Decidability of Prebisimulation for Timed Automata" R28 Ichiro Hasuo and Kohei Suenaga "Exercises in Nonstandard Static Analysis of Hybrid Systems" R29 Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle "A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx" T12 Ashish Tiwari "HybridSal Relational Abstracter" T13 Swarat Chaudhuri and Armando Solar-Lezama "Euler: A System for Numerical Optimization of Programs" 12:00 - 1:30: Lunch 1:30 - 2:45: *HARDWARE VERIFICATION* - special track session R30 Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Scott Owens, Jade Alglave, Kayvan Memarian, Rajeev Alur, Milo Martin, Peter Sewell and Derek Williams "An Axiomatic Memory Model for Power Multiprocessors" R31 Flavio M de Paula, Alan Hu and Amir Nahir "nuTAB-BackSpace: Rewriting to Normalize Non-Determinism in Post-Silicon Debug Traces" R32 Zyad Hassan, Aaron Bradley and Fabio Somenzi "Incremental Inductive CTL Model Checking" 2:45 - 3:35: Miscellaneous Tools T14 Rishabh Singh and Armando Solar-Lezama "SPT : Storyboard Programming Tool" T15 Patrick Rondon, Ming Kawaguchi, Alexander Bakst and Ranjit Jhala "CSolve: Verifying C With Liquid Types" T16 Daniel Schwartz-Narbonne, Feng Liu, David August and Sharad Malik "PASSERT: A tool for debugging parallel programs" T17 Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas and Andrew E. Santosa "TRACER: A Symbolic Execution Tool for Verification" T18 Stephan Arlt and Martin Sch?f "Joogie: Infeasible Code Detection for Java" T19 David Hopkins, Andrzej Murawski and Luke Ong "Hector: An Equivalence Checker for a Higher-Order Fragment of ML" T20 Jan Hoffmann, Klaus Aehlig and Martin Hofmann "Resource Aware ML" 3:35 - 4:00: Break 4:00 - 5:30: Tool demo/poster session 5:30 - 6:30: CAV business meeting 6:30 - 9:00: SC dinner Friday July 13 ---------------------------------------- 9:00 - 10:00: On security of voting machines (Alex Haldermann - Invited talk) 10:00 - 10:30: Break 10:30 - 11:45: *SECURITY* - special track session R33 Matt Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassen Saidi and Vinod Yegneswaran "Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement" R34 Boris K?pf, Laurent Mauborgne and Mart?n Ochoa "Automatic Quantification of Cache Side-Channels" R35 William Harris, Somesh Jha and Thomas Reps "Secure Programming via Visibly Pushdown Safety Games" 11:45 - 11:50: Mini-break 11:50 - 1:05: VERIFICATION AND SYNTHESIS R36 Nishant Sinha, Nimit Singhania, Satish Chandra and Manu Sridharan "Alternate and Learn: Finding witnesses without looking all over" R37 Duc Hiep Chu and Joxan Jaffar "A Complete Method for Symmetry Reduction in Safety Verification" R38 Rishabh Singh and Sumit Gulwani "Synthesizing Number Transformations from Input-Output Examples" 1:00 - 1:15: Conference Wrap-up -------------- next part -------------- An HTML attachment was scrubbed... URL: From t.kitamura at aist.go.jp Fri May 18 03:13:41 2012 From: t.kitamura at aist.go.jp (Takashi KITAMURA) Date: Fri, 18 May 2012 16:13:41 +0900 Subject: [TYPES/announce] 1st CFP: FTSCS 2012 - 1st International Workshop on Formal Techniques for Safety-Critical Systems Message-ID: --------------------------------------------------------------------- Call for Papers FTSCS 2012 1st International Workshop on Formal Techniques for Safety-Critical Systems Kyoto, Japan, November 12, 2012 (satellite workshop of ICFEM 2012) http://www.ftscs12.org --------------------------------------------------------------------- *** Science of Computer Programming special issue *** *** EPTCS proceedings *** Aims and Scope: There is an increasing demand in industry to use formal methods to achieve software-independent verification and validation of safety-critical systems, e.g., in fields such as avionics, automotive, medical, and other cyber-physical systems. Newer standards, such as DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for formal methods and model-based development, speeding up the adaptation of such methods in industry. The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. In particular, FTSCS strives strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. Specific topics include, but are not limited to: * case studies and experience reports on the use of formal methods for analyzing safety-critical systems, including avionics, automotive, medical, and other kinds of safety-critical and QoS-critical systems * methods, techniques and tools to support automated analysis, certification, debugging, etc., of complex safety/QoS-critical systems * analysis methods that address the limitations of formal methods in industry (usability, scalability, etc.) * formal analysis support for modeling languages used in industry, such as AADL, Ptolemy, SysML, SCADE, Modelica, etc. * code generation from validated models. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. Invited speaker: TBA Submission: We solicit submissions reporting on: A- original research contributions (16 pages max, EPTCS format); B- applications and experiences (16 pages max, EPTCS format); C- surveys, comparisons, and state-of-the-art reports (16 pages max, EPTCS format); D- tool papers (4 pages max, EPTCS format); E- position papers and work in progress (4 pages max, EPTCS format) related to the topics mentioned above. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission will be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2012. The final version of the paper must be prepared in LaTeX, adhering to the EPTCS format available at http://style.eptcs.org/. Note, in particular, that EPTCS requires that you include the doi of each reference in the bibliography. Publication: All accepted papers will appear in the pre-proceedings of FTSCS 2012. Accepted papers in the categories A-D above will appear in the workshop proceedings that will be published as a volume in Electronic Proceedings in Theoretical Computer Science. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to appear in a special issue of the Science of Computer Programming journal. Important dates: Submission deadline: September 2, 2012 Notification of acceptance: October 1, 2012 Workshop: November 12, 2012 Venue: Kyoto, Japan Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Erika Abraham RWTH Aachen University, Germany Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia Farhad Arbab Leiden University and CWI, The Netherlands Cyrille Artho AIST, Japan Armin Biere Johannes Kepler University, Austria Saddek Bensalem Verimag, France Peter Bokor Technical University Darmstadt, Germany Santiago Escobar Universidad Politecnica de Valencia, Spain Bernd Fischer University of Southampton, UK Klaus Havelund NASA JPL, USA Marieke Huisman University of Twente, The Netherlands Ralf Huuck NICTA/UNSW, Sydney, Australia Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Yang Liu NUS, Singapore Steven P. Miller Rockwell Collins, USA Tang Nguyen AIST, Japan Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Grigore Rosu University of Illinois at Urbana-Champaign, USA Neha Rungta NASA Ames, USA Carolyn Talcott SRI International, USA Tatsuhiro Tsuchiya Osaka University, Japan Contact: (web) http://www.ftscs12.org (email) peterol at ifi.uio.no c.artho at aist.go.jp -- 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 aleks.nanevski at imdea.org Fri May 18 15:53:02 2012 From: aleks.nanevski at imdea.org (Aleksandar Nanevski) Date: Fri, 18 May 2012 21:53:02 +0200 Subject: [TYPES/announce] Postdoctoral position at IMDEA Software Institute, Madrid In-Reply-To: <4FB3A207.6060808@cmu.edu> References: <4FB3A207.6060808@cmu.edu> Message-ID: <4FB6A89E.1040402@imdea.org> Applications are invited for a postdoctoral position at IMDEA Software Institute (http://software.imdea.org) in Madrid, Spain, starting in Fall 2012. The postdoc will work under supervision of Anindya Banerjee (http://software.imdea.org/~ab) and Aleks Nanevski (http://software.imdea.org/~aleks), on a topic in the areas of software verification, language-based security and logics for concurrency. The precise topic will be determined based on the common interests of the candidate and the supervisors. The candidate must have a Ph.D. in Computer Science, preferably with expertise in program semantics and program logics, type systems, type theory and interactive theorem proving, as they apply to the above areas. Good teamwork and communication skills, including excellent spoken and written English are essential. The position is initially for one year, with possible extension up to two years. Interested applicants are encouraged to contact Anindya Banerjee and Aleks Nanevski with inquires. Formal applications should be submitted over the web. Please select the postdoc-researcher option at https://www.imdea.org/internationalcall/Default.aspx?IdInstitute=17. Review of applications will begin immediately. From J.T.Jeuring at uu.nl Mon May 21 08:56:32 2012 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Mon, 21 May 2012 14:56:32 +0200 Subject: [TYPES/announce] CICM 2012: Call for participation Message-ID: <644A89D2-93DF-4918-B68C-CC5145DBE6D8@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 participation ---------------------------------------------------------------- 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 is 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 is 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 ---------------------------------------------------------------- Programme ---------------------------------------------------------------- The global programme of the conference, tracks, and workshops are available via: http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=programme and the accepted papers via: http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=accepted ---------------------------------------------------------------- Registration ---------------------------------------------------------------- Early registration rates are applicable until June 15. See http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=registration From bcpierce at cis.upenn.edu Tue May 22 09:13:47 2012 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Tue, 22 May 2012 09:13:47 -0400 Subject: [TYPES/announce] Japanese translation of Software Foundations Message-ID: <95FCA616-9F78-46C9-A5DF-E92B322AAB52@cis.upenn.edu> Friends and colleagues, As many of you know, Software Foundations (http://www.cis.upenn.edu/~bcpierce/sf/) is a electronic textbook introducing functional programming, Coq proof development, and the theory of programming languages, written entirely in Coq. It has been developed over the past five years by a large group of contributors and is widely used for both teaching and self-study. Today, I am delighted to announce that, thanks to a dedicated team of translators, Software Foundations can now be read in Japanese! http://proofcafe.org/sf Many thanks to the translation team for this effort! - Akihiro Umemura - Koji Katayama - Hiroki Mizuno - Daichi Oohashi - Moe Masuko - Yoshihiro Imai Share and enjoy, - Benjamin -------------- next part -------------- An HTML attachment was scrubbed... URL: From daniel.james at cs.ox.ac.uk Wed May 23 07:28:01 2012 From: daniel.james at cs.ox.ac.uk (Daniel James) Date: Wed, 23 May 2012 12:28:01 +0100 Subject: [TYPES/announce] IFL 2012 Call for Papers Message-ID: ------------------------------------------------------------------------------- CALL FOR PAPERS 24th Symposium on Implementation and Application of Functional Languages (IFL 2012) University of Oxford, UK, August 30-September 1, 2012 http://www.cs.ox.ac.uk/conferences/IFL2012/ This year IFL will be hosted by the University of Oxford, within the idyllic setting of the dreaming spires and picturesque colleges, which have been the home to academic endeavour and research for over nine centuries. The symposium will be held between 30 August and 1 September, 2012. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2012 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2012 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2012 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. Work submitted to IFL must not be submitted simultaneously to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2012, please contact the PC chair at ralf.hinze at cs.ox.ac.uk. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques run-time profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques (industrial) applications of functional programming Submission details ------------------ Presentation submission deadline: July 30th, 2012 Notification of acceptance: August 1st, 2012 Early registration deadline: August 10th, 2012 IFL 2012 Symposium: August 30-September 1, 2012 Submission for (post) review process: November 30th, 2012 Notification Accept/Reject: February 4th, 2013 Camera ready version: March 18th, 2013 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of the University of Oxford. (We are more liberal with the draft proceedings, where longer papers or SIGPLAN 2 column 12 page papers are acceptable. For other formats please contact the chair at ralf.hinze at cs.ox.ac.uk. For consideration for the final proceedings, only the 16 page LNCS format will be accepted.) Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2012 Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Edwin Brady, University of St. Andrews, UK Andrew Butterfield, University of Dublin, Ireland Matthew Flatt, University of Utah, US Andy Gill, University of Kansas, US Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (Chair), University of Oxford, UK Zhenjiang Hu, National Institute of Informatics, Japan Patrik Jansson, Chalmers University of Technology, Sweden Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Gabriele Keller, University of New South Wales, Australia Simon Marlow, Microsoft Research, UK Pablo Nogueira, Technical University of Madrid, Spain Bruno Oliveira, Seoul National University, Korea Jos? Nuno Oliveira, University of Minho, Portugal Rinus Plasmeijer, Radboud University Nijmegen, Netherlands Tom Schrijvers, Ghent University, Belgium Tim Sheard, Portland State University, US Wouter Swierstra, University of Utrecht, Netherlands Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Steve Zdancewic, University of Pennsylvania, US From jose.proenca at cs.kuleuven.be Wed May 23 07:56:22 2012 From: jose.proenca at cs.kuleuven.be (=?iso-8859-1?Q?Jos=E9_Proen=E7a?=) Date: Wed, 23 May 2012 13:56:22 +0200 Subject: [TYPES/announce] FOCLASA'12: 2nd Call for Papers References: <455B8B43-9E25-4BCD-9C79-7EAE3262E1FA@cs.kuleuven.be> Message-ID: 2nd 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 INVITER SPEAKER Sebastian Uchitel (Imperial College London) "Controller Synthesis for Architecture Level Adaptation" 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 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 (publicity chair) 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 frfrantz at unijui.edu.br Wed May 23 14:04:34 2012 From: frfrantz at unijui.edu.br (Fabricia Roos Frantz) Date: Wed, 23 May 2012 15:04:34 -0300 Subject: [TYPES/announce] FMSPLE'12 Deadline Extension (1st June) - Third Workshop on Formal Methods and Analysis in Software Product Line Engineering In-Reply-To: References: Message-ID: Deadline for paper submission has been extended to June 1, 2012 CALL FOR PAPERS Third Workshop on Formal Methods and Analysis in Software Product Line Engineering (FMSPLE 2012), 2 September 2012 http://www.iese.fraunhofer.de/en/events/fmsple2012.html Co-located with the 16th International Software Product Line Conference (SPLC 2012), 2 - 7 September 2012, Salvador, Brazil http://www.splc2012.net/ -------------------------------------------------------------- IMPORTANT DATES: - Deadline for submissions: June 01, 2012 - Notification of acceptance: June 15, 2012 - Final papers due: June 29, 2012 -------------------------------------------------------------- BACKGROUND AND OBJECTIVES Software product line engineering (SPLE) aims at developing a family of systems by reuse in order to reduce time to market and to increase product quality. The correctness of the development artifacts intended for reuse as well as the correctness of the developed products is of crucial interest for many safety-critical or business-critical applications. Formal methods and analysis approaches have been successfully applied in single system engineering over the last years in order to rigorously establish critical system requirements. However, in SPLE, formal methods and analysis approaches are not broadly applied yet, despite their potential to improve product quality. One of the reasons is that existing formal approaches from single system engineering do not consider variability, an essential aspect of product lines. The objective of the workshop "Formal Methods and Analysis in Software Product Line Engineering (FMSPLE)" is to bring together researchers and practitioners from the SPLE community with researchers and practitioners working in the area of formal methods and analysis. So far, both communities are only loosely connected, despite very promising initial work on formal analysis techniques for software product lines. The workshop aims at reviewing the state of the art and the state of the practice in which formal methods and analysis approaches are currently applied in SPLE. This leads to a discussion of a research agenda for the extension of existing formal approaches and the development of new formal techniques for dealing with the particular needs of SPLE. To achieve the above objectives, the workshop is intended as a highly interactive event fostering discussion and initiating collaborations between the participants from both communities. TOPICS The proposed workshop focuses on the application of formal methods and analysis approaches in all phases of SPLE, including domain and application engineering, in order to ensure the correctness of individual artifacts as well as the consistency among them. The topics of interest include, but are not limited to: - Analysis approaches and formal methods for: ??? - domain analysis and scoping ??? - variability modeling ??? - specification and verification of functional and non-functional properties in SPLE ??? - safety and security aspects in SPLE ??? - product line architectures and component-based product line development ??? - product line implementation, such as type systems, programming languages, formal semantics ??? - formal verification of product lines and product line artifacts ??? - correctness-by-construction techniques in SPLE ??? - automated test case generation and model-based testing in SPLE ??? - product derivation and application engineering ??? - product line life-cycle management (e.g., consistency assurance) ??? - reuse and evolution of SPLs - Proofs of concept, industrial experiences and empirical evaluations - Tool presentations - Vision and position papers on formal methods and analyses applied to SPLE FORMAT The FMSPLE workshop will be a full-day event, starting with a keynote presentation by David Benavides, University of Seville, Spain. The keynote will be followed by presentations of selected peer-reviewed papers. To foster interaction within the workshop, a discussant will be assigned to each presented paper. The task of the discussant will be to prepare a summary of the paper and initiate the discussion of its results. The workshop will close with a discussion of its participants to summarize the state of the art and the state of the practice as presented in the workshop, to collect research challenges for the application of formal methods in SPLE and to identify research topics for future workshops. PREVIOUS WORKSHOPS FMSPLE merges two workshops, namely FMSPLE 2010 (http://www.iese.fraunhofer.de/en/events/fmsple2010.html) and ASPL 2008 (http://www.isa.us.es/aspl08), both of which were affiliated to the International Software Product Line Conference (SPLC). A first joint edition was held in 2011 as FMSPLE at the 15th SPLC (http://www.iese.fraunhofer.de/en/events/fmsple2011.html). This is the 3rd edition of the successful FMSPLE workshop series. SUBMISSION AND PUBLICATION The contributed papers are expected to comprise research papers containing novel and previously unpublished results, experience reports, reports of industrial case studies, tool descriptions, and short papers describing work in progress or exploratory ideas. All papers have to follow the ACM two-column conference proceedings format (Letter) and be 4 - 8 pages of length. The papers should be submitted via EasyChair; each paper will be reviewed by at least three members of the program committee. The program committee will select the best papers based on quality, relevance to the workshop, and potential to initiate discussions for presentation. The workshop proceedings will be published by the ACM in the second volume of the SPLC proceedings. PROGRAM COMMITTEE Vander Alves, University of Brasilia, Brazil Hugo Arboleda, Icesi University, Cali, Colombia Jo Atlee, University of Waterloo, Canada Ebrahim Bagheri, Athabasca University, Canada Maurice H. ter Beek, ISTI-CNR, Pisa, Italy Dirk Beyer, University of Passau, Germany Paulo Borba, Federal University of Pernambuco, Brazil Manfred Broy, Technical University Munich, Germany Dave Clarke, Katholieke Universiteit Leuven, Belgium Andreas Classen, Intec Software Engineering and University of Namur, Belgium Stefania Gnesi, ISTI-CNR, Pisa, Italy Klaus Havelund, NASA JPL, USA Kim Larsen, Aalborg University, Denmark Arnaud Hubaux, University of Namur, Belgium Axel Legay, INRIA Rennes, France Ivan C. Machado, Federal University of Bahia, Salvador, Brazil Tomi Mannisto, Aalto University, Finland Marcilio Mendonca, University of Waterloo, Canada Henry Muccini, University of L'Aquila, Italy Antonio Ruiz-Cortes, University of Seville, Spain Ina Schaefer, Technical University of Braunschweig, Germany Erik de Vink, Eindhoven University of Technology, The Netherlands Andrzej Wasowski, ITU Kopenhagen, Denmark PROGRAM CO-CHAIRS Maurice H. ter Beek (ISTI-CNR, Pisa, Italy) Andreas Classen (University of Namur, Belgium) ORGANISING COMMITTEE Ina Schaefer (Technical University of Braunschweig, Germany) Martin Becker (Fraunhofer IESE, Germany) Fabricia Roos-Frantz (UNIJUI University, Brazil) Peter Y. H. Wong (Fredhopper B.V., Amsterdam, The Netherlands) From Jeremy.Gibbons at cs.ox.ac.uk Wed May 23 17:35:01 2012 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Wed, 23 May 2012 22:35:01 +0100 Subject: [TYPES/announce] MPC2012 Call for Participation Message-ID: <201205232135.q4NLZ1L4009982@linux2.cs.ox.ac.uk> CALL FOR PARTICIPATION 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 Hotel rooms reserved until: *** 30th May 2012 *** Early registration deadline: *** 6th June 2012 *** BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. VENUE The conference will take place in Madrid, the capital of Spain, in the Sala de Grados of the Facultad de Inform?tica of Universidad Complutense de Madrid, right in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation has been reserved in a nearby 4-star hotel, the VP Jardin Metropolitano. REGISTRATION Conference registration is now open; see http://babel.ls.fi.upm.es/mpc2012/registration.html Registration fees have been kept low thanks to a grant from the Spanish Ministerio de Economia y Competitividad. The early registration fee is ?240, which includes lunches, coffees, and social events. The early registration deadline is 6th June 2012; after this point, the registration fee rises to ?340. Hotel reservation is handled separately; see http://babel.ls.fi.upm.es/mpc2012/accom.html We have a block booking of rooms at the conference hotel at a special reduced rate, but only until 30th May 2012; after this point, the rooms will be released and the special rate unavailable. (There are few well-connected budget hotels in the area, and June marks the start of Spain's tourist season with a sharp rise in hotel rates; so we strongly advise you to meet this hotel registration deadline.) INVITED SPEAKERS * Gilles Barthe, IMDEA Software Institute (http://software.imdea.org/people/gilles.barthe/) "Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs" * Dan Ghica, University of Birmingham (http://www.cs.bham.ac.uk/~drg/) "The Geometry of Synthesis: How to Make Hardware out of Software" * Tony Hoare, Microsoft Research (http://research.microsoft.com/en-us/people/thoare/) "The Laws of Programming Unify Process Calculi" ACCEPTED PAPERS * "Scheduler-Independent Declassification" Alexander Lux, Heiko Mantel and Matthias Perner * "Elementary Probability Theory in the Eindhoven Style" Carroll Morgan * "Scheduling and Buffer Sizing of n-Synchronous Systems: Typing of Ultimately Periodic Clocks in Lucy-n" Louis Mandel and Florence Plateau * "Deriving Real-Time Action Systems Controllers from Multiscale System Specifications" Brijesh Dongol and Ian J. Hayes * "Calculating Graph Algorithms for Dominance and Shortest Path" Ilya Sergey, Jan Midtgaard and Dave Clarke * "First-Past-the-Post Games" Roland Backhouse * "Reverse Exchange for Concurrency and Local Reasoning" Han-Hing Dang and Bernhard M?ller * "Unifying Correctness Statements" Walter Guttmann * "Dependently Typed Programming based on Automated Theorem Proving" Alasdair Armstrong, Simon Foster and Georg Struth * "An Algebraic Calculus of Database Preferences" Bernhard M?ller, Patrick Roocks and Markus Endres * "Modular Tree Automata" Patrick Bahr * "Constructing Applicative Functors" Ross Paterson * "Kan Extensions for Program Optimisation, Or: Art and Dan Explain an Old Trick" Ralf Hinze SOCIAL EVENTS The conference excursion will be a guided tour of Madrid's Royal Palace. The banquet will be Northern Spanish cuisine at the Sidreria-Asador Gaztemanu. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Polit?cnica de Madrid, ES (co-chair) Ralph Back ?bo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Universit? Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universit?t Passau, DE Larissa Meinicke University of Queensland, AU Bernhard M?ller Universit?t Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Utrecht Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA LOCAL ORGANIZERS Pablo Nogueira Universidad Polit?cnica de Madrid Ricardo Pe?a Universidad Complutense de Madrid Alvaro Garc?a IMDEA Software Institute and Universidad Polit?cnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo at babel.ls.fi.upm.es. From s.p.luttik at TUE.nl Fri May 25 06:34:59 2012 From: s.p.luttik at TUE.nl (Luttik, S.P.) Date: Fri, 25 May 2012 12:34:59 +0200 Subject: [TYPES/announce] EXPRESS/SOS 2012: call for papers Message-ID: <54D73E29-09D9-4DC2-B97A-4FFFBA9C2506@TUE.nl> ------------------------------------------------------------ Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics (EXPRESS/SOS 2012) EXPRESS/SOS 2012 ------------------------------------------------------------ September 3, 2012, Newcastle upon Tyne (UK) Affiliated with CONCUR 2012 http://www.win.tue.nl/expresssos2012/ Submission of abstracts: Friday June 1, 2012 Submission of papers: Friday June 8, 2012 ------------------------------------------------------ SCOPE AND TOPICS: The EXPRESS workshop series aims at bringing together researchers interested in the expressiveness of various formal systems and semantic notions, particularly in the field of concurrency. The SOS workshop series aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. This year the EXPRESS and SOS communities organize a combined EXPRESS/SOS 2012 workshop on the formal semantics of systems and programming concepts, and on the expressiveness of mathematical models of computation. Topics of interest for this combined workshop include (but are not limited to): - expressiveness and comparison of models of computation (process algebras, event structures, Petri nets, rewrite systems), and programming models (distributed, component-based, object-oriented, and service-oriented computing); - logics for concurrency (modal logics, probabilistic and stochastic logics, temporal logics and resource logics); - analysis techniques for concurrent systems; - theory of structural operational semantics (metatheory, category-theoretic approaches, congruence results); - comparison of structural operational semantics to other forms of semantics; - applications of structural operational semantics; - software tools that automate, or are based on, structural operational semantics. INVITED SPEAKER: Colin Stirling (University of Edinburgh, UK) SUBMISSION GUIDELINES: We solicit two types of submissions: * Short papers (up to 5 pages, not included in the workshop proceedings) * Full papers (up to 15 pages). Simultaneous submission to journals, conferences or other workshops is only allowed for short papers; full papers must be unpublished. All submissions should adhere to the EPTCS format (http://www.eptcs.org), and submission is performed through the EXPRESS/SOS 2012 EasyChair server (http://www.easychair.org/conferences/?conf=expresssos2012). The final versions of accepted full papers will be published in EPTCS. Furthermore, authors of a selection of the accepted papers will be invited to submit an extended version to a special issue of a high-quality journal. IMPORTANT DATES: Abstract submission: June 1, 2012 Paper submission: June 8, 2012 Notification date: July 9, 2012 Camera ready version: July 27, 2012 WORKSHOP CO-CHAIRS: Bas Luttik (Eindhoven University of Technology, NL) Michel Reniers (Eindhoven University of Technology, NL) PROGRAMME COMMITTEE: Luca Aceto (Reykjav?k University, Iceland) Johannes Borgstr?m (Uppsala University, Sweden) Ilaria Castellani (INRIA Sophia Antipolis, France) Sibylle Fr?schle (University of Oldenburg, Germany) Fabio Gadducci (Universit? di Pisa, Italy) Bartek Klin (University of Warsaw, Poland) Bas Luttik (Eindhoven University of Technology, The Netherlands) Keiko Nakata (Tallinn University of Technology, Estonia) Michel Reniers (Eindhoven University of Technology, The Netherlands) Jiri Srba (Aalborg University, Denmark) Alwen Tiu (Australian National University, Australia) Frank Valencia (LIX, CNRS & Ecole Polytechnique, France) Walter Vogler (Augsburg University, Germany) From gorel at cs.lth.se Sat May 26 08:15:36 2012 From: gorel at cs.lth.se (=?iso-8859-1?Q?G=F6rel_Hedin?=) Date: Sat, 26 May 2012 14:15:36 +0200 Subject: [TYPES/announce] Last CFP: SLE 2012 - International Conference on Software Language Engineering Message-ID: ======================================================================== LAST CALL FOR PAPERS (Main track) Fifth International Conference on Software Language Engineering (SLE 2012) Sept 25-28, 2012, Dresden, Germany General chair: Uwe Assmann Program co-chairs: Krzysztof Czarnecki and G?rel Hedin http://planet-sl.org/sle2012 The program will include invited talks, main track, poster track, minitutorials, and a doctoral symposium. Collocated events include GPCE 2012, FOSD 2012, and ITSLE 2012. The 5th International Conference on Software Language Engineering (SLE) is devoted to topics related to artificial languages in software engineering. SLE encourages communication among communities that have traditionally looked at software languages from different and yet complementary perspectives. Of particular relevance to SLE are technologies, methods, experiments, and case studies on software languages from modelware, grammarware and ontologyware perspectives. ======================================================================== MAIN TRACK Co-chairs: Krzysztof Czarnecki and G?rel Hedin Research papers, industrial experience papers, tool demo papers. Postproceedings in LNCS, Springer. Selected papers invited to submit to special issue of SCP, Elsevier EAPLS best paper award Submission deadlines: Abstracts: June 4, Full papers: June 11 POSTER TRACK Co-chairs: Anya Helene Bagge and Dimitris Kolovos On-line proceedings Submission deadline: July 10 DOCTORAL SYMPOSIUM Co-chairs: Ulrich Eisenecker and Christian Bucholdt On-line proceedings Submission deadline: July 10 TOPICS OF INTEREST 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. PROGRAM COMMITTEE (Main track) 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 For further information, see http://planet-sl.org/sle2012 From davide at disi.unige.it Sat May 26 13:03:58 2012 From: davide at disi.unige.it (Davide Ancona) Date: Sat, 26 May 2012 19:03:58 +0200 Subject: [TYPES/announce] OOPS track at SAC 2013: First Call for Papers Message-ID: <4FC10CFE.2050904@disi.unige.it> OOPS 2013 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS13 Special Track at the 28th ACM Symposium on Applied Computing, SAC 2013 http://www.acm.org/conferences/sac/sac2013 Institute of Engineering of the Polytechnic Institute of Coimbra, Portugal March 18-22, 2013 - Important Dates (deadlines are strict) Regular papers: September 21, 2012 Paper submission November 10, 2012 Author notification November 30, 2012 Camera-ready copies March 18-22, 2013 SAC 2013 Student Research Abstracts: October 31, 2012 Research Abstracts November 30, 2012 Author Notification March 19, 2013 Presentations - Track Chair Davide Ancona (davide at disi.unige.it) DIBRIS, University of Genova, Italy - Program Committee To be announced - SAC 2013 For the past twenty-seven years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Polytechnic Institute of Coimbra, Coimbra, Portugal, Institute of Systems and Robotics, University of Coimbra, Coimbra, Portugal Mathematical and Computer Sciences Institute, University of Sao Paulo, Sao Paulo, Brazil, and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra. - Call For Student Research Abstracts (New to SAC): Graduate students seeking feedback from the scientific community on their research ideas are invited to submit abstracts of their original un-published and in-progress research work in areas of experimental computing and application development related to SAC 2013 Tracks. - OOPS Track Object-oriented programming (OOP) has become the mainstream programming paradigm for developing complex software systems in most application domains. However, existing OO languages and platforms need to evolve to meet the continuous demand for new abstractions, features, and tools able to reduce the time, effort, and cost of creating object-oriented software systems, and improving their performance, quality and usability. To this aim, OOPS is seeking for research advances bringing benefits in all those typical aspects of software development, such as modeling, prototyping, design, implementation, concurrency and distribution, code generation, analysis, verification, testing, evaluation, deployment, maintenance, reuse, and software evolution and adaptation. The specific OO related topics of interest for the OOPS track include, but are not limited to, the following: * Aspects and components * Code generation, and optimization, just-in-time compilation * Distribution and concurrency * Dynamic and scripting languages * Evaluation * Formal verification * Integration with databases, object persistence * Integration with other paradigms * Interoperability, versioning and software evolution and adaptation * Language design and implementation * Modular and generic programming * Reflection, meta-programming * Software product lines * Static analysis * Type systems and type inference * Virtual machines OOPS offers a great opportunity to the OOP community to gain visibility, and to exploit the inter-disciplinary nature of SAC. - Submission Instructions Prospective papers should be submitted in pdf format using the provided automated submission system. All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The format of the paper must adhere to the sig-alternate style. The paper must not exceed 8 pages according to the above style; please note that this is the same page limit as for the final version. However, for camera-ready papers exceeding 6 pages each additional page will be charged 80 USD. Papers that fail to comply with length limitations risk rejection. All papers must be submitted by September 21, 2012. For more information please visit the SAC 2013 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as 2-3 pages extended abstracts in the same proceedings (the additional third page will be charged 80 USD). Please note that full registration is required for papers and posters to be included in the conference proceedings and CD. Papers and posters NOT presented at conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, depending on the quality and the overall number of accepted papers, authors of selected papers will be invited to submit an extended version for a journal special issue, after the conference. From alastair.donaldson at imperial.ac.uk Sun May 27 16:11:35 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Sun, 27 May 2012 21:11:35 +0100 Subject: [TYPES/announce] Call for Participation: SPIN 2012 - 19th International SPIN Workshop on Model Checking Software 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: <4FC28A77.6050208@imperial.ac.uk> Apologies for multiple copies. 19th International SPIN Workshop on Model Checking of Software Oxford, 23-24 July 2012 ================ Registration is now open! For the full programme, and to register, visit: http://qav.cs.ox.ac.uk/spin2012 EARLY REGISTRATION closes 22 June ================ Invited speakers ================ * Tom Ball, Microsoft Research, Redmond. Beyond First-order Satisfaction: Fixed points, Interpolants, Automata and Polynomials. * Andrey Rybalchenko, TU Munich. Towards Automatic Synthesis of Software Verification Tools * Andreas Zeller, Saarland University. Mining Models ================ Invited tutorial ================ * Cristian Cadar, Imperial College London. How to Crash Your Code using Dynamic Symbolic Execution ============== Regular papers ============== * Gerard Holzmann. Parallelizing the Spin Model Checker * Ethan Burns and Rong Zhou. Parallel Model Checking using Abstraction * Alexander Ditter, Milan Ceska and Gerald L?ttgen. On Parallel Software Verification using Boolean Equation Systems * Anton J. Wijs and Dragan Bosnacki. Improving GPU Sparse Matrix-Vector Multiplication for Probabilistic Model Checking * Stefan Leue and Mitra Tabaei Befrouei. Counterexample Explanation by Anomaly Detection * Sami Evangelista and Lars Kristensen. Combining the Sweep-Line Method with the use of an External-memory Priority Queue * Hao Zheng, Emmanuel Rodriguez, Yingying Zhang and Chris Myers. A compositional Minimization Approach for Large Asynchronous Design Verification * Theo Ruys and Pim Kars. Gossiping Girls Are All Alike * Shravan Garlapati and Sandeep Shukla. Formal Verification of Hierarchically Distributed Agent Based Protection Scheme in Smart Grid * Reng Zeng, Zhuo Sun, Su Liu and Xudong He. McPatom: A Predictive Analysis Tool for Atomicity Violation using Model Checking * Divjyot Sethi, Murali Talupur, Sharad Malik and Daniel Schwartz-Narbonne. Parameterized Model Checking of Fine Grained Concurrency =========== Tool papers =========== * Jonathan Bogdoll, Alexandre David, Arnd Hartmanns and Holger Hermanns. mctau: Bridging the Gap between Modest and UPPAAL * Heinz Riener and Goerschwin Fey. FAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation * Martin Sulzmann and Axel Zechner. Model Checking DSL-Generated C Source Code * Juergen Christ, Jochen Hoenicke and Alexander Nutz. SMTInterpol ? An Interpolating SMT Solver * Yong Jiang and Zongyan Qiu. S2N: Model Transformation from SPIN to NuSMV ======== Sponsors ======== * ARM (http://www.arm.com) * Codeplay Software (http://www.codeplay.com) * Microsoft Research (http://research.microsoft.com/en-us) * Monoidics (http://www.monoidics.com) From eberinge at cs.princeton.edu Sun May 27 20:05:17 2012 From: eberinge at cs.princeton.edu ( Lennart Beringer) Date: Sun, 27 May 2012 20:05:17 -0400 (EDT) Subject: [TYPES/announce] ITP 2012: preliminary call for participation In-Reply-To: Message-ID: ITP 2012: PRELIMINARY CALL FOR PARTICIPATION Interested parties are invited to start making travel arrangements for the 3rd International Conference on Interactive Theorem Proving August 13 - 15, 2012, Princeton, NJ itp2012.cs.princeton.edu with colocated workshops on Coq and Isabelle on August 12th. Registration will be available via the conference web site shortly. Highlights of the conference: ----------------------------- - Pre-conference reception Sunday, August 12th; open to conference and workshop participants. - Start of technical program: 9am, Monday August 13th - 3 invited speakers: Gilles Barthe (IMDEA Madrid) Larry Paulson (Cambridge) Andre Platzer (CMU) - Tutorial on Abella by Andrew Gacek (Rockwell Collins) - 21 technical papers, 4 rough diamonds - Outdoor event: canoeing/kayaking on the Delaware & Raritan Canal - BBQ at the shore of Carnegie Lake - End of conference: around 5pm, Wednesday August 15th Associated workshops (August 12): ----------------------------------------- Isabelle Users Workshop 2012 (www21.in.tum.de/~nipkow/Isabelle2012) The 4th Coq Workshop (coq.inria.fr/coq-workshop/2012) Accommodation options (please see conference web page for details): ------------------------------------------------------------------- - Hotel: Nassau Inn (nassauinn.com): $135pppn + Tax, incl breakfast Booking is under the responsibility of the conference attendees. Please mention "ITP 2012" when making a reservation to obtain the above rate. - Student Dormitory: "Scully Hall": $60pppn incl breakfast. Booking will be part of conference registration process. Travel (again see conference web page for details): --------------------------------------------------- We strongly recommend flying to/from Newark International Airport (Airport code: EWR). Other airports in the area (JKF, La Guardia, Philadelphia) are possible but significantly less convenient. Conference registration: ------------------------ - early registration will open within next 2 weeks - late registration rates apply after July 22nd - registration options include conference-only, workshops-only, and conference+workshops - reduced student rates available for all categories Chairs ------ Andrew Appel, Lennart Beringer, Amy Felty From amal at ccs.neu.edu Mon May 28 11:21:37 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Mon, 28 May 2012 11:21:37 -0400 Subject: [TYPES/announce] LOLA 2012: Call for Participation (early registration by May 31) Message-ID: <6D29AEE5-3DD2-400E-9DCC-362F5FD0C853@ccs.neu.edu> ============================================================ *** CALL FOR PARTICIPATION *** 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/ ============================================================ *** Early Registration DEADLINE: 31 May 2012 *** Registration, accomodation, and travel information for LICS and all affiliated workshops is on the LICS 2012 web page: http://www2.informatik.hu-berlin.de/lics/lics12/ INVITED TALKS: * Jade Alglave (University of Oxford). * Ulrich Schoepp (LMU Munich). CONTRIBUTED TALKS: * Nikos Tzevelekos and Andrzej Murawski. Algorithmic Games for Full Ground References * Jacob Thamsborg, Lars Birkedal, Guilhem Jaber, and Filip Sieczkowski. Kripke Logical Relations for Region Polymorphism * Tadeusz Litak. Extending Nakano-style Type Systems and Logics * Nick Benton, Andrew Kennedy, and Jonas Jensen. Using Coq to Generate and Reason About x86 Systems Code * Ruy Ley-Wild and Aleksandar Nanevski. Subjective Concurrent Separation Logic * Paul-Andre Mellies. Strong Monads and Enriched Adjunctions DESCRIPTION OF THE WORKSHOP: It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants. PROGRAMME COMMITTEE: * Amal Ahmed (Northeastern University, co-chair) * 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) * Aleksandar Nanevski (IMDEA Software, co-chair) * Sungwoo Park (Pohang University of Science and Technology) * Dusko Pavlovic (Royal Holloway, University of London) * Andreas Rossberg (Google) From jose.proenca at cs.kuleuven.be Mon May 28 17:47:55 2012 From: jose.proenca at cs.kuleuven.be (=?iso-8859-1?Q?Jos=E9_Proen=E7a?=) Date: Mon, 28 May 2012 23:47:55 +0200 Subject: [TYPES/announce] FOCLASA'12: Deadline extension (15th June) References: Message-ID: <2AB45112-8A32-4265-9317-CFFD1E59B033@cs.kuleuven.be> The deadline for paper submission has been extended to June 15, 2012. Abstracts can now be submitted until June 8, 2012. Final 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: June 8th, 2012 Paper submission: June 15th, 2012 Notification: July 9th, 2012 Final version: July 25th, 2012 Workshop: September 8th, 2012 INVITER SPEAKER Sebastian Uchitel (Imperial College London) "Controller Synthesis for Architecture Level Adaptation" 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 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: http://www.easychair.org/conferences/?conf=foclasa2012 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 (publicity chair) 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 georg.granstrom at gmail.com Tue May 29 07:11:33 2012 From: georg.granstrom at gmail.com (=?ISO-8859-1?Q?Johan_Georg_Granstr=F6m?=) Date: Tue, 29 May 2012 13:11:33 +0200 Subject: [TYPES/announce] "A New Paradigm for Component-based Development" Message-ID: Dear Friends and Colleagues, I would like to announce a new publication applying dependent type theory to component based software engineering. The reason for announcing it here is that it is published in an unusual venue for this type of work (Journal of Software). The paper has open access and is available from here: http://ojs.academypublisher.com/index.php/jsw/article/view/jsw070511361148 PDF direct link: http://ojs.academypublisher.com/index.php/jsw/article/download/jsw070511361148/4771 Best Regards, - Johan Granstr?m From alain at frisch.fr Tue May 29 13:02:53 2012 From: alain at frisch.fr (Alain Frisch) Date: Tue, 29 May 2012 19:02:53 +0200 Subject: [TYPES/announce] ML workshop 2012: second Call for Presentations Message-ID: <4FC5013D.3010306@frisch.fr> The submission deadline for ML2012 is approaching (next Monday, 2012-06-04), but given the submission format, it's not too late. Please consider submitting a presentation proposal! More information on the workshop: http://www.lexifi.com/ml2012/ -- Alain ======================================================================= 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 ------------------ Matthew Fluet (Rochester Institute of Technology) Alain Frisch (LexiFi) Jacques Garrigue (Nagoya University) Yaron Minsky (Jane Street) Greg Morrisett (Harvard University) Andreas Rossberg (chair)(Google) Chung-chieh Shan (Cornell University) From H.W.Loidl at hw.ac.uk Tue May 29 19:05:23 2012 From: H.W.Loidl at hw.ac.uk (Hans-Wolfgang Loidl) Date: Tue, 29 May 2012 23:05:23 +0000 Subject: [TYPES/announce] Call for Participation: TFP12, Trends in Functional Programming 2012, St Andrews, U.K., June 12-14, 2012 Message-ID: <20120529230523.4fddfe3d@hw.ac.uk> CALL FOR PARTICIPATION 13th International Symposium Trends in Functional Programming 2012 St Andrews, U.K. June 12-14, 2012 TFP12: http://www-fp.cs.st-andrews.ac.uk/tifp/TFP2012/TFP_2012/Home.html Programme: http://www-fp.cs.st-andrews.ac.uk/tifp/TFP2012/TFP_2012/TFP12_prg.txt Registration: http://tinyurl.com/7y5gpxc 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/. 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 lazy 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 Room: G48 Tel: +44 131 451 3421 Fax: +44 131 451 3327 E-Mail: H.W.Loidl at hw.ac.uk Skype: hwloidl URL: http://www.macs.hw.ac.uk/~hwloidl School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS Scotland, U.K. From pmt6sbc at maths.leeds.ac.uk Wed May 30 06:09:26 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Wed, 30 May 2012 11:09:26 +0100 (BST) Subject: [TYPES/announce] CiE 2012 Turing Centenary Conference, Cambridge - Final Call for Participation Message-ID: <201205301009.q4UA9Q0A023331@maths.leeds.ac.uk> ********************************************************************** CiE 2012 FINAL CALL FOR PARTICIPATION: 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. Current registrations indicate a final participation approaching 400, with over 240 speakers. ONLINE REGISTRATION is invited for this historic event. For registration details, see: http://www.cl.cam.ac.uk/~amp66/CiE%20Homepage/ ONLINE REGISTRATION DEADLINE: JUNE 8th, 2012 PLENARY SPEAKERS include: Andrew Hodges (Oxford, Special Public 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). SPECIAL SESSIONS include: * Cryptography, Complexity, and Randomness Chairs: Rod Downey and Jack Lutz Speakers: Eric Allender, Laurent Bienvenu, Lance Fortnow, Valentine Kabanets, 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 + 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: Jack Copeland, Steven Ericsson-Zenith, Ivor Grattan-Guinness, Mark Priestley, Bruno Scarpellini, Robert I. Soare, John Tucker 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) 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 L??we (Amsterdam), Arno Pauly (Cambridge), Andrew Pitts (Cambridge) The conference is sponsored by the ASL, EACSL, EATCS, Elsevier, the IET, IFCoLog, King's College Cambridge, IOS Press, Springer, 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: cie-2012 at cl.cam.ac.uk ********************************************************************** From vladimir at ias.edu Wed May 30 08:43:06 2012 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Wed, 30 May 2012 08:43:06 -0400 Subject: [TYPES/announce] Univalent Foundations Program - important update. Message-ID: <353CA57A-21BF-4017-B8ED-EA334CDD193C@ias.edu> Dear All, it is only now that we have fully realized that the plan for the next year program at the IAS as it is stated in the web description: > We plan to have four main working groups oriented towards the goals described below. However applications from people with interest in other aspects of mathematics and computer science related to the univalent semantics of type theories will also be considered. > For general information on Univalent Foundations and Homotopy Type Theory see Homotopy Type Theory website and Vladimir Voevodsky?s homepage . > In connection with the activities of Group 1 there will probably be a series of presentations based on the "Univalent Foundations" library as it will be by that time. > For all other purposes we plan to have a weekly seminar where each of the groups will be given, on average, one spot per month. > Group 1. Practical formalization of set-level mathematics in Coq based on the univalent approach. > Goals: developing skills for collective work on libraries of formalized mathematics, locating the points of "tension" between constructive and non-constructive approaches especially in the formalization of analysis, creating libraries for future use. > Group 2. Computational issues in constructive type theory related to the univalence axiom. > Goals: looking for approaches to the proof of the "main computational conjecture" of the univalent approach with a special focus on looking for practical algorithms for automatic construction of fully constructive terms from terms build with the help of extensionality axioms. > Group 3. Formalization of advanced homotopy-theoretic structures in constructive type theory. > Goals: looking for approaches to formalize higher coherence structures (simplicial types, H-types, n-1-categories and n-1-functors etc.). Looking for possible syntax and computation rules for higher inductive definitions. Looking for the constructions of elements in homotopy groups of spheres as mappings between the corresponding loop "functors". > Group 4. Relation of constructive type theory to set-theoretic foundations. > Goals: formalizations of type theories and known constructions of their models in ZFC and related theories. Looking for new models of constructive type theories, especially for non-standard models of the univalence axiom. must be changed. We reason as follows. The ultimate goal of the univalent program is to make formalized and computer verified proofs a standard in pure and eventually in applied mathematics. A necessary intermediate goal is to have a proof assistant based on a type system which is compatible with the univalent model and implements resizing rules. Because of this fact we decided put as Group 1 a group which will start working on a type system and a proof assistant with required properties. It is a very serious change but we feel strongly that it is necessary. The further discussion related to this issue will be only posted to HOTT ( homotopytypetheory at googlegroups.com ) so please subscribe to it if you would like to follow the discussion and/or participate in the project itself. Steve Awodey, Thierry Coquand and Vladimir Voevodsky (organizers of the Univalent Foundations program). -------------- next part -------------- An HTML attachment was scrubbed... URL: From c.grelck at uva.nl Wed May 30 08:51:54 2012 From: c.grelck at uva.nl (Clemens Grelck) Date: Wed, 30 May 2012 14:51:54 +0200 Subject: [TYPES/announce] FHPC 2012: Workshop on Functional High Performance Computing Message-ID: <4FC617EA.60706@uva.nl> ======================================================================== CALL FOR PAPERS FHPC 2012 ACM SIGPLAN Workshop on Functional High Performance Computing Copenhagen, Denmark September 15th, 2012 http://www.hiperfit.dk/fhpc12/ Co-located with the International Conference on Functional Programming (ICFP 2012) ======================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative, high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. Such computations would typically -- but not necessarily -- involve execution on highly parallel systems ranging from multi-core multi-processor systems to graphics accelerators (GPGPUs), reconfigurable hardware (FPGAs), large-scale compute clusters or any combination thereof. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. The 2012 FHPC workshop comes with a particular theme motivated by geographic co-location with the newly established HIPERFIT Research Centre for Functional High-Performance Computing for Financial Information Technology (www.hiperfit.dk) at the University of Copenhagen. Hence, we particularly encourage submissions with a background in computational finance. Notwithstanding, the workshop welcomes submissions from other application domains as much as general-purpose work on the theory and practice of declarative approaches to high-performance computing. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submission Deadline: 10th June 2012, anywhere on earth * Author Notification: 27th June 2012 * Final Papers Due : 10th July 2012 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (double column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. The page limit is 12 pages. Submission deadlines and page limit are firm. Any paper submitted must adhere to ACM SIGPLAN's republication policy (http://www.sigplan.org/republicationpolicy.htm). 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). Programme Committee: ============================== Marco Aldinucci University of Torino, Italy Manuel Chakravarty University of New South Wales, Australia Andrzej Filinski University of Copenhagen, Denmark (chair) Clemens Grelck University of Amsterdam, Netherlands (chair) Gaetan Hains University of Paris Est, France Zhenjiang Hu National Institute of Informatics, Japan Mike Giles Oxford University, UK Neal Glew Intel, USA Ryan Newton University of Indiana, USA Satnam Singh Google, USA Phil Trinder Heriot-Watt University, UK Viktoria Zsok Eotvos Lorand University Budapest, Hungary Workshop Organizers: ==================== Andrzej Filinski Clemens Grelck DIKU Informatics Institute University of Copenhagen University of Amsterdam Universitetsparken 1 Science Park 904 2100 Copenhagen 1098XH Amsterdam Denmark Netherlands andrzej at diku.dk c.grelck at uva.nl -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From wcook at cs.utexas.edu Wed May 30 19:00:09 2012 From: wcook at cs.utexas.edu (William Cook) Date: Wed, 30 May 2012 18:00:09 -0500 Subject: [TYPES/announce] FOOL 2012 Call for Papers Message-ID: <4FC6A679.1090901@cs.utexas.edu> Call For Papers 19th International Workshop on Foundations of Object-Oriented Languages (FOOL 2012) A Workshop of SPLASH (OOPSLA) 2012 Tucson, AZ, USA http://www.cs.uwm.edu/~boyland/fool2012 Abstract August 5 Full Paper August 12 Notification September 7 Final Paper September 30 Workshop October 22 The search for sound principles for object-oriented languages has given rise to much work during the past two decades, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, program verification, and program development. Submissions for this event are invited in the general area of foundations of object-oriented languages. Topics of interest include language semantics, type systems, memory models, program verification, formal calculi, concurrent and distributed languages, database languages, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy. Submissions should be PDF in standard SIGPLAN 9pt conference format for a US-letter size page. While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. Papers must be submitted electronically via EasyChair. An informal proceedings will be made publicly available on the web page. However, presentation at FOOL does not count as prior publication, and many of the results presented at FOOL have later been published at ECOOP, OOPSLA, POPL, and other main conferences. Program Committee Jonathan Aldrich, Carnegie Mellon University, PA, USA John Boyland, University of Wisconsin-Milwaukee, USA, chair Nicholas Cameron, Mozilla Corporation Dave Clarke, Katholieke Universiteit Leuven, Belgium William R. Cook, University of Texas at Austin, USA Stephen Freund, Williams College, MA, USA Ronald Garcia, University of British Columbia, Vancouver, Canada Simon Gay, University of Glasgow, UK Peter Mueller, ETH Zurich, Switzerland Uday S. Reddy, University of Birmingham, UK Sukyoung Ryu, KAIST, Korea Marco Servetto, Victoria University of Wellington, New Zealand Scott F. Smith, The Johns Hopkins University, MD, USA Organizers Jonathan Aldrich John Boyland Jeremy Siek, chair Steering Committee Jonathan Aldrich Viviana Bono Atsushi Igarashi James Noble Jeremy Siek Elena Zucca From sacerdot at cs.unibo.it Thu May 31 23:06:01 2012 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Fri, 01 Jun 2012 05:06:01 +0200 Subject: [TYPES/announce] Post-Doc positions in the CerCo FET-Open EU Project In-Reply-To: <1296059286.27942.41.camel@zenone> References: <1262690107.5919.57.camel@zenone> <1296059286.27942.41.camel@zenone> Message-ID: <1338519434.6612.33.camel@zenone> === Two New Post-Doc positions in the CerCo FET-Open EU Project === ** Job duration: 01/07/2012-30/06/2013 (one year) ** Deadline for reception of candidatures: 29/06/2011 We are currently looking for two Post-Doc positions at the Department of Computer Science, University of Bologna, to work on the CerCo FET-Open EU Project (see description below). The gross salary is 26174 euros per year. Only a minimal amount of taxes is due. The University of Bologna is the oldest running western university and the Department of Computer Science (http://www.cs.unibo.it/en/), located in the historic city center, has strong expertise in theoretical computer science and logic and it participates to several national and international projects. The Post-Doc will join the HELM team, leaded by Prof. Asperti, whose members work in the domains of Type Theory and Mathematical Knowledge Management. The CerCo project is headed by Dr. Sacerdoti Coen. The candidates will benefit from exchange opportunity with the other project participants (University Paris-Diderot, Paris, and University of Edinburgh, Edinburgh). The candidates will not have any teaching duties. Requirements: We are looking for candidates with a Ph.D. in Computer Science and previous experience in Type Theory (in particular Interactive Theorem Proving), and being proficient in functional programming languages. We also accept candidates that will defend their Ph.D. thesis in the near future, if they can provide a formal proof that they will. Starting date: The proposed starting date is the 01/07/2012. The contract is for one year. The candidate should contact sacerdot at cs.unibo.it for further information. Project description: The CerCo FET-Open EU Project is aimed at producing the first _formally_ _verified_ _complexity_preserving_ compiler for a subset of C to the object code for a microprocessor used in embedded systems. The output of the compilation process will be the object code and a copy of the source code annotated with _exact_ computational complexities for each program slice in O(1). The exact computational complexities (expressed in clock cycles and parametric in the program input) can then be used to formally reason on the overall code complexity. The source code of the compiler will be formally verified using the Matita Interactive Theorem Prover (http://matita.cs.unibo.it), based on a variant of the Calculus of (Co)Inductive Constructions. The candidate will contribute to the formal proof of correctness of the compiler. How to submit candidatures: All candidates are invited to get in touch in advance with Dr. Claudio Sacerdoti Coen , submitting a curriculum vitae. The official candidature must be received by standard mail (no electronic submission) before the 29/06/2011. Candidates must fill in the forms (in Italian only) that can be found at the following address: https://www.aric.unibo.it/AssegniRicerca/BandiPubblicati/zz_Bandi_din.aspx (look for the word "Matita" in the second column) Candidates must also attach two recommendation letters. Foreign candidates will be helped in compiling the forms. Kind regards, C.S.C. -- ---------------------------------------------------------------- Real name: Claudio Sacerdoti Coen Doctor in Computer Science, University of Bologna E-mail: sacerdot at cs.unibo.it http://www.cs.unibo.it/~sacerdot ---------------------------------------------------------------- From murano at na.infn.it Fri Jun 1 06:49:30 2012 From: murano at na.infn.it (Nello Murano) Date: Fri, 1 Jun 2012 12:49:30 +0200 (CEST) Subject: [TYPES/announce] GAMES 2012 -- Call for contributions -- Message-ID: <36543.2.226.21.88.1338547770.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ================================================================ GAMES 2012 - CALL FOR CONTRIBUTIONS Annual Workshop of the ESF Networking Programme on Games for Design and Verification 7th - 12th September 2012 - Napoli, Italy http://www.games.unina.it/ ================================================================ The ESF Networking Programme on Games for Design and Verification is a European Network pursuing research and training on the design and verification of computing systems. This network proposes a research and training programme for the design and verification of computing systems, using a methodological framework that is based on the interplay of finite and infinite games, mathematical logic and automata theory. For details, see www.games.rwth-aachen.de/ GAMES is the annual workshop of the Network and this year edition is the concluding one. GAMES 2012 will be held at Universita' di Napoli Federico II, Italy. SCOPE: The scope of the workshop includes the mathematical and algorithmic analysis of finite and infinite games, the interplay of games with automata theory and logic, and applications of games, automata, and logic to the design and verification of computing systems. PROGRAMME: As in previous years, GAMES 2012 will be an informal workshop, without proceedings. Its programme consists of 10 invited talks, contributed talks (30 min) and short presentations (15 min). Contributed talks and short presentations will be selected by the programme committee on the basis of submitted abstracts. INVITED SPEAKERS: - Mikolaj Bojanczyk (Warsaw University, Poland) - Krishnendu Chatterjee (IST Vienna, Austria) - Thomas Colcombet (CNRS Paris, France) - Olivier Friedman (University of Munich, Germany) - Hugo Gimbert (CNRS, France) - Joseph Halpern (Cornell University, USA) - Damian Niwinsky (Warsaw University, Poland) - Luke Ong (Oxford University, UK) - Jean-Fran?ois Raskin (Universit? Libre de Bruxelles, Belgium) - Wolfgang Thomas (RWTH Aachen University, Germany) SUBMISSIONS: Researchers who would like to present a talk at GAMES 2012 are invited to submit an abstract of up to two pages by email to esfgames2012 at gmail.com by 27 June 2012. Decisions about acceptance will be made by 17 July 2012. IMPORTANT DATES: Abstract submission: June 27th 2012 Author notification: July 17th 2012 Travel grant application: July 30th 2012 Regular registration: July 30th 2012 Workshop: September 7th - 12th 2012 TRAVEL SUPPORT: We will be able to cover travel and accommodation costs for a limited number of participants (especially students). For information, please contact Aniello Murano via . There will be no registration fee. LOCATION: The workshop will be held at the Centro Congressi Ateneo Federico II, Via Partenope 36, Napoli, located on a wonderful seafront promenade, close to the historical center and the Castel dell'Ovo. The location is just in front of the baia that hosted last America's Cup World Competition. PROGRAMME COMMITTEE: - Krzysztof Apt, CWI and University of Amsterdam, The Netherlands - Dietmar Berwanger, CNRS and ENS Cachan, France - Erich Gr?del, RWTH Aachen University, Germany - Christof L?ding, RWTH Aachen University, Germany - Angelo Montanari, University of Udine, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy (Main Organizer) - Mimmo Parente, Univerit? di Salerno, Italy - Sven Shewe, University of Liverpool, UK - Igor Walukiewicz, Universit? Bordeaux 1, France CO-LOCATED EVENTS: GandALF 2012 - Third International Symposium on Games, Automata, Logics, and Formal Verification - www.gandalf.unina.it/ - September 6th-8th, 2012 INFO: Please visit the workshop website (http://www.games.unina.it) for more information. From murano at na.infn.it Fri Jun 1 07:22:59 2012 From: murano at na.infn.it (Nello Murano) Date: Fri, 1 Jun 2012 13:22:59 +0200 (CEST) Subject: [TYPES/announce] GAMES 2012 -- Call for contributions -- Message-ID: <36711.2.226.21.88.1338549779.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ================================================================ GAMES 2012 - CALL FOR CONTRIBUTIONS Annual Workshop of the ESF Networking Programme on Games for Design and Verification 7th - 12th September 2012 - Napoli, Italy http://www.games.unina.it/ ================================================================ The ESF Networking Programme on Games for Design and Verification is a European Network pursuing research and training on the design and verification of computing systems. This network proposes a research and training programme for the design and verification of computing systems, using a methodological framework that is based on the interplay of finite and infinite games, mathematical logic and automata theory. For details, see www.games.rwth-aachen.de/ GAMES is the annual workshop of the Network and this year edition is the concluding one. GAMES 2012 will be held at Universita' di Napoli Federico II, Italy. SCOPE: The scope of the workshop includes the mathematical and algorithmic analysis of finite and infinite games, the interplay of games with automata theory and logic, and applications of games, automata, and logic to the design and verification of computing systems. PROGRAMME: As in previous years, GAMES 2012 will be an informal workshop, without proceedings. Its programme consists of 10 invited talks, contributed talks (30 min) and short presentations (15 min). Contributed talks and short presentations will be selected by the programme committee on the basis of submitted abstracts. INVITED SPEAKERS: - Mikolaj Bojanczyk (Warsaw University, Poland) - Krishnendu Chatterjee (IST Vienna, Austria) - Thomas Colcombet (CNRS Paris, France) - Olivier Friedman (University of Munich, Germany) - Hugo Gimbert (CNRS, France) - Joseph Halpern (Cornell University, USA) - Damian Niwinsky (Warsaw University, Poland) - Luke Ong (Oxford University, UK) - Jean-Fran?ois Raskin (Universit? Libre de Bruxelles, Belgium) - Wolfgang Thomas (RWTH Aachen University, Germany) SUBMISSIONS: Researchers who would like to present a talk at GAMES 2012 are invited to submit an abstract of up to two pages by email to esfgames2012 at gmail.com by 27 June 2012. Decisions about acceptance will be made by 17 July 2012. IMPORTANT DATES: Abstract submission: June 27th 2012 Author notification: July 17th 2012 Travel grant application: July 30th 2012 Regular registration: July 30th 2012 Workshop: September 7th - 12th 2012 TRAVEL SUPPORT: We will be able to cover travel and accommodation costs for a limited number of participants (especially students). For information, please contact Aniello Murano via . There will be no registration fee. LOCATION: The workshop will be held at the Centro Congressi Ateneo Federico II, Via Partenope 36, Napoli, located on a wonderful seafront promenade, close to the historical center and the Castel dell'Ovo. The location is just in front of the baia that hosted last America's Cup World Competition. PROGRAMME COMMITTEE: - Krzysztof Apt, CWI and University of Amsterdam, The Netherlands - Dietmar Berwanger, CNRS and ENS Cachan, France - Erich Gr?del, RWTH Aachen University, Germany - Christof L?ding, RWTH Aachen University, Germany - Angelo Montanari, University of Udine, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy (Main Organizer) - Mimmo Parente, Univerit? di Salerno, Italy - Sven Shewe, University of Liverpool, UK - Igor Walukiewicz, Universit? Bordeaux 1, France CO-LOCATED EVENTS: GandALF 2012 - Third International Symposium on Games, Automata, Logics, and Formal Verification - www.gandalf.unina.it/ - September 6th-8th, 2012 INFO: Please visit the workshop website (http://www.games.unina.it) for more information. From jv at informatik.uni-bonn.de Fri Jun 1 17:40:26 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Fri, 01 Jun 2012 23:40:26 +0200 Subject: [TYPES/announce] Call for Participation - Workshop on Reversible Computation 2012 Message-ID: <4FC936CA.5090709@informatik.uni-bonn.de> Please distribute to anyone who may be interested. ============================================================== Call for Participation 4th Workshop on Reversible Computation (RC 2012) July 2nd-3rd, 2012, Copenhagen, Denmark 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 electrical engineering to discuss new developments and directions for future research in Reversible Computation. This also includes applications of reversibility in quantum computation. The 4th Workshop on Reversible Computation will take place on July 2nd and 3rd, 2012 in Copenhagen, Denmark and is organized by the University of Copenhagen. Previous editions of the Workshop on Reversible Computation took place in York (UK), Bremen (Germany), and Gent (Belgium). ===== Technical Program ===== This year, we received a record number of 46 submissions out of which 15 full papers, 7 work-in-progress papers, and 1 tutorial paper have been accepted. A full list of all papers accepted for RC 2012 is provided at http://www.reversible-computation.org/2012/cms/index.php?program The program features an invited talk by Eric Lutz, Freie Universit?t Berlin, on "The Physics of Information: from Maxwell's Demon to Landauer". The full program will be published soon. ===== Registration ===== Interested researchers are invited to participate at the workshop. DKK 1500,- (approx. 200 EUR). This includes food and refreshments (i.e. lunch for Monday and Tuesday, dinner for Monday, coffee breaks, etc.), one ticket for the social event, as well as (informal) proceedings. Registration website: http://www.reversible-computation.org/2012/cms/index.php?registration ===== Program Chairs ===== Robert Gl?ck University of Copenhagen Tetsuo Yokoyama Nanzan University ===== 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 Quantum Tech, Singapore) * Jarkko J. Kari (University of Turku, Finland) * Martin Kutrib (University of Giessen, Germany) * Per Larsson-Edefors (Chalmers University of Technology, Sweden) * Kazutaka Matsuda (University of Tokyo, 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 might at cs.utah.edu Sun Jun 3 13:46:56 2012 From: might at cs.utah.edu (Matt Might) Date: Sun, 3 Jun 2012 11:46:56 -0600 Subject: [TYPES/announce] Final CFP for NSAD 2012: Deadline extended to 16 June 2012 Message-ID: Due to several requests, we have extended the deadline for NSAD 2012 to 16 June 2012. ********* Event: Numerical and Symbolic Abstract Domains (NSAD 2012) Submission: 16 June 2012 (Two weeks away) Date: 10 September 2012 Location: Deauville, France. (Co-located with SAS'2012.) Site: 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: 16 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 pmt6sbc at maths.leeds.ac.uk Sun Jun 3 06:37:55 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Sun, 3 Jun 2012 11:37:55 +0100 (BST) Subject: [TYPES/announce] Turing Centenary Conference, Manchester, June 22-25: Call for Participation Message-ID: <201206031037.q53Abt1F004586@maths.leeds.ac.uk> THE TURING CENTENARY CONFERENCE Manchester, UK, June 22-25, 2012 http://www.turing100.manchester.ac.uk/ Call for Participation NEWS: (1) The early registration deadline has been extended to June 11, 2012 (2) The organisers have funds for supporting participants. Please write to the programme chair if support is essential for your attendance. The programme includes 18 invited talks (of which 10 are given by Turing Award winners), 2 public talks, 2 panels, a poster session, a chess programme and a competition of programs proving theorems. Public lectures: -- Jack Copeland (University of Canterbury, New Zealand) Alan Turing, Pioneer of the Information Age -- Sir Roger Penrose (University of Oxford, Wolf Prize winner) The Problem of Modelling the Mathematical Mind Invited lectures: -- Garry Kasparov (Kasparov Chess Foundation) The Reconstruction of Turing's "Paper Machine" -- Vint Cerf (Google, Turing Award winner) Turing's Legacy in the Networked World -- David Ferrucci (IBM) Beyond Jeopardy! The Future of Watson -- Don Knuth (Stanford University, Turing Award winner) All Remaining Questions Answered -- Adi Shamir (Weizmann Institute of Science, Turing Award winner) Turing's Cryptography from a Modern Perspective -- Samuel Klein (Wikipedia) TBC -- George Ellis (University of Cape Town, Templeton Award winner) On the Nature of Causation in Digital Computer Systems -- Frederick P. Brooks, Jr. (University of North Carolina, Turing Award winner) Pilot ACE Architecture in Context -- Sir Tony Hoare (Microsoft Research, Turing Award winner) Can Computers Understand Their Own Programs? -- Edmund M. Clarke (Carnegie Mellon University, Turing Award winner) Model Checking and the Curse of Dimensionality -- Michael O. Rabin (Harvard University, Turing Award winner) Turing, Church, G??del, Computability, Complexity and Randomization: A Personal Perspective -- Leslie Valiant (Harvard University, Turing Award winner) Computer Science as a Natural Science -- Andrew Chi-Chih Yao (Tsinghua University, Turing Award winner) Quantum Computing: A Great Science in the Making -- Manuela M. Veloso (Carnegie Mellon University) Symbiotic Autonomy: Robots, Humans, and the Web -- Rodney Brooks (MIT) Turing's Humanoid Thinking Machines -- Hans Meinhardt (Max Planck Institute for Developmental Biology) Turing's Pioneering Paper 'The Chemical Basis of Morphogenesis and the Subsequent Development of Theories of Biological Pattern Formation -- Yuri Matiyasevich (Institute of Mathematics, St. Petersburgh) Alan Turing and Number Theory Panel speakers: -- Samson Abramsky (Oxford University) -- Ron Brachman (Yahoo Labs) -- Martin Davis (New York University) -- 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) For more details please check http://www.turing100.manchester.ac.uk/. 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 June 11) late (June 12 or later) Student 280 330 Regular 380 450 To qualify for a student registration you must be a registered 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 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) Computer Chess Programme Chair Frederic Friedel (Chessbase) Programme Chair Andrei Voronkov (The University of Manchester) ------------------------------------------------------------------- The Alan Turing Year: http://www.turingcentenary.eu/ ------------------------------------------------------------------- From a.ricci at unibo.it Mon Jun 4 10:02:25 2012 From: a.ricci at unibo.it (Alessandro Ricci) Date: Mon, 4 Jun 2012 14:02:25 +0000 Subject: [TYPES/announce] CFP: AGERE! @ SPLASH 2012 - Programming based on Actors, Agents and Decentralized Control Message-ID: CALL FOR PAPERS AGERE! @ SPLASH 2012 2nd Int. Workshop on Programming based on Actors, Agents, and Decentralized Control Workshop held at the ACM SPLASH Conference 2012 Tucson, Arizona (US) October 22, 2012 http://agere2012.apice.unibo.it Deadlines: Abstracts August 5, 2012 Papers August 12, 2012 + special issue in Science of Computer Programming ?go ?go, ?gis, egi, actum, ?g?re latin verb meaning to act, to lead, to do, common root for actors and agents The fundamental turn of software into concurrency and distribution is not only a matter of performance, but also of design and abstraction. It calls for programming paradigms that, compared to current mainstream paradigms, would allow us to more naturally think about, design, develop, execute, debug, and profile systems exhibiting different degrees of concurrency, autonomy, decentralization of control, and physical distribution. The AGERE! workshop is dedicated to focusing on and developing the research on programming systems, languages and applications based on actors, agents and any related programming paradigm promoting a decentralized control mindset in solving problems and in developing systems to implement such solutions. The workshop is designed to cover both the theory and the practice of design and programming, bringing together researchers working on the models, languages and technologies, and practitioners developing real-world systems and applications. The first edition of AGERE! was organized in SPLASH 2011, drawing significant interest and attendance (see program at http://agere2011.apice.unibo.it). The workshop is now scheduled to take place also at SPLASH 2012 and, related to this event, a special issue on the journal Science of Computer Programming is scheduled for the end of the year. === Organizers Gul Agha, University of Illinois at Urbana-Champaign, USA Rafael H. Bordini, FACIN?PUCRS, Brazil Assaf Marron, Weizmann Institute of Science, Israel Alessandro Ricci, University of Bologna, Italy (ref: a.ricci at unibo.it) === Program Committee (partial list, other names are to be confirmed) Gul Agha, University of Illinois at Urbana-Champaign, USA Joe Armstrong, SICS / Ericsson, Sweden Saddek Bensalem, Verimag, France Rafael H. Bordini, FACIN?PUCRS, Brazil Gilad Braha, Google, USA Rem Collier, UCD, Dublin Tom Van Cutsem, Vrije Universiteit, Brussel, Belgium Amal El Fallah Seghrouchni, LIP6 - Univ. P and M. Curie, Paris, France Jurgen Dix, Technical University of Clausthal, Germany Tom Holvoet, Dept. Computer Science K.U.Leuven, Belgium Assaf Marron, Weizmann Institute of Science, Israel Jens Palsberg, UCLA, Los Angeles, USA Ravi Pandya, Microsoft, USA Arnd Poetzsch-Heffter, University of Kaiserslautern, Germany Alessandro Ricci, University of Bologna, Italy Birna van Riemsdijk, Delft University of Technology, The Netherlands Giovanni Rimassa, Whitestein Technologies, Switzerland Gera Weiss, Ben Gurion University, Israel Guy Wiener, HP, Israel Akinori Yonezawa, University of Tokyo, Japan University, Japan ... === Main topics The topics of interest for the workshop include: - Programming languages and frameworks + theory and practice about languages and frameworks based on agents, actors, and decentralized control. - Foundations + ideas, concepts, formalization of the computation and programming models for agents, actors and decentralized control. - Design + design principles underlying the paradigms and bridging the gap between design to programming - Validation and verification + theory and tools about testing, debugging, profiling, verifying and validating software systems based on such paradigms - Applications + design and development of real-world applications - Teaching + experiences and reflections about using these paradigms in teaching (concurrent and distributed) programming === Contributions & deadlines AGERE! welcomes three kinds of contributions: - full-papers + length up to 12 pages; covering new research, per the above topics, not previously published. - short-papers & position papers + length up to 4 pages, these papers are meant to introduce a contribution (an idea, a viewpoint, an argument, work in progress...) which may be in its initial stage and not fully developed but which is worth to be presented given its relevance to the AGERE! topics, triggering discussions and interactions. - reviews & surveys + up to 12 pages, these papers are meant to provide a good synthesis & reflections about some aspect (specific or general) which is relevant for the workshop, contributing then to workshop discussions on the state of the art and open issues - demo + length up to 4 pages, these contributions are about a technology/system that will be demonstrated during the workshop. Deadlines: Abstracts August 5, 2012 Papers (*) August 12, 2012 Papers can be submitted at https://www.easychair.org/conferences/?conf=ageresplash2012 in PDF format. Submissions should use the ACM format, following the guidelines in http://www.sigplan.org/authorInformation.htm. (*) including full-papers, short/position papers, reviews & surveys, demo papers === Publication channels Accepted papers (full, short/position, surveys/reviews, demo) will be included in the ACM DL proceedings after the conference. Besides, a selected set of papers will be invited to be extended and included in a special issue which is being organized for the end of the year in the journal Science of Computer Programming. The special issue will be about actor-oriented and agent-oriented programming, and - more generally - on programming systems, languages, and applications based on actors, agents, and decentralized control abstractions. Read more at the AGERE! web site: http://agere2012.apice.unibo.it === SELECTED BIBLIOGRAPHY * To ?set the frequency? [1] Actors and Agents as Programming Paradigms - An Overview. AGERE! 2011 introductory talk. A. Ricci. http://apice.unibo.it/xwiki/bin/download/AGERE/WebHome/opening.pdf [2] H. Sutter and J. Larus. Software and the concurrency revolution. ACM Queue: Tomorrow?s Computing Today, 3(7):54?62, Sept. 2005. [3] M. Resnick. Turtles, Termites and Traffic Jams. Explorations in Massively Parallel Microworlds. MIT Press, 1994. [4] A. Kay. Programming and programming languages, 2010. VPRI Research Note RN-2010-001. [5] Howell R. Jordan, Goetz Botterweck, Marc-Philippe Huget, Rem Collier: A feature model of actor, agent, and object programming languages. SPLASH Workshops 2011: 147-158 * Actors & OO Concurrent Programming approaches [1] G. Agha. Actors: a model of concurrent computation in distributed systems. MIT Press, Cambridge, MA, USA, 1986. [2] C. Hewitt. Viewing control structures as patterns of passing messages. Artif. Intell., 8(3):323?364, 1977. [3] G. Agha, I. A. Mason, S. Smith, and C. Talcott. A Foundation for Actor Computation. Journal of Functional Programming, 7(01):1?72, 1997. [4] J.P. Briot, R. Guerraoui, and K.P. Lohr. Concurrency and distribution in object-oriented programming. ACM Comput. Surv., 30(3):291?329, 1998. [5] G. Agha. Concurrent object-oriented programming. In in Communications of the ACM, Association for Computing Machinery, vol. 33, no. 9, pp 125-141, September, 1990. [6] G. Agha, P. Wegner, and A. Yonezawa, editors. Research directions in concurrent object-oriented programming. MIT Press, Cambridge, MA, USA, 1993. [7] R. K. Karmani, A. Shali, and G. Agha. Actor frameworks for the JVM platform: a comparative analysis. In PPPJ ?09: Proceedings of the 7th International Conference on Principles and Practice of Programming in Java, pages 11?20, New York, NY, USA, 2009. ACM. [8] A. Yonezawa, editor. ABCL: an object-oriented concurrent system. MIT Press, Cambridge, MA, USA, 1990. [9] J. Armstrong. Erlang. Commun. ACM, 53(9):68?75, 2010. [10] J. Schafer and A. Poetzsch-Heffter. Jcobox: generalizing ?active objects to concurrent components. In Proceedings of the 24th European conference on Object-oriented programming, ECOOP?10, pages 275?299, Berlin, Heidelberg, 2010. Springer-Verlag. [11] P. Haller and M. Odersky. Scala actors: Unifying thread-based and event-based programming. Theoretical Computer Science, 2008. [12] T. Van Cutsem: AmbientTalk: modern actors for modern networks. SPLASH Workshops 2011: 227-230 [13] M. S. Miller, Eric Dean Tribble, Jonathan S. Shapiro: Concurrency Among Strangers. TGC 2005: 195-229 * Agents and Agent-Oriented Programming [1] J. J. Odell. Objects and agents compared. Journal of Object Technology, 1(1):41?53, 2002. [2] N. R. Jennings. An agent-based approach for building complex software systems. Commun. ACM, 44(4):35?41, 2001. [3] Y. Shoham. Agent-oriented programming. Artificial Intelligence, 60(1):51?92, 1993. [4] R. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors. Multi-Agent Programming Languages, Platforms and Applications. Volume 1 (2005) and 2 (2009). Springer. [5] A. Ricci, A. Santi. Designing a General-Purpose Programming Language based on Agent-Oriented Abstractions: The simpAL Project. SPLASH Workshops 2011: 159-170 [6] M. D. Travers. Programming with Agents: New metaphors for thinking about computation. Massachusetts Institute of Technology, 1996. [7] R. Bordini, J. Hubner, and M. Wooldridge. Programming Multi-Agent Systems in AgentSpeak Using Jason. John Wiley & Sons, Ltd, 2007. [8] M. Dastani. 2apl: a practical agent programming language. Autonomous Agents and Multi-Agent Systems, 16(3):214?248, 2008. [9] K. V. Hindriks. Programming rational agents in GOAL. In R. H. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors, Multi-Agent Programming: Languages, Platforms and Applications (2nd volume), pages 3?37. Springer-Verlag, 2009. [10] F. Bellifemine, G. Caire, A. Poggi, G. Rimassa: JADE: A software framework for developing multi-agent applications. Lessons learned. Information & Software Technology 50(1-2): 10-21 (2008) [11] N. Howden, R. Ronnquist, A. Hodgson, and A. Lucas. JACK intelligent agentsTM ? summary of an agent infrastructure. In Proceedings of Second International Workshop on Infras- tructure for Agents, MAS, and Scalable MAS, held with the Fifth International Conference on Autonomous Agents (Agents 2001), 2001. [12] Sean Edward Russell, Howell R. Jordan, Gregory M. P. O'Hare, Rem W. Collier: Agent Factory: A Framework for Prototyping Logic-Based AOP Languages. MATES 2011: 125-136 [13] A. Pokahr, L. Braubach, Kai Jander: Unifying Agent and Component Concepts: Jadex Active Components. MATES 2010: 100-112 * Other Decentralized Control Programming Approaches [1] D. Harel, Assaf Marron, Gera Weiss: Programming Coordinated Behavior in Java. ECOOP 2010: 250-274 [2] S. Bliudze and J. Sifakis. A notion of glue expressiveness for component-based systems. CONCUR, 2008. [3] D. Harel, Assaf Marron, Guy Wiener, Gera Weiss: Behavioral programming, decentralized control, and multiple time scales. AGERE! @ SPLASH Workshops 2011: 171-182 LA RICERCA C?? E SI VEDE: 5 per mille all'Universit? di Bologna - C.F.: 80007010376 http://www.unibo.it/5permille Questa informativa ? inserita in automatico dal sistema al fine esclusivo della realizzazione dei fini istituzionali dell?ente. From cav2012.publicity.chair at gmail.com Tue Jun 5 06:28:21 2012 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Tue, 5 Jun 2012 06:28:21 -0400 Subject: [TYPES/announce] *** Early registration ends June 20 *** CAV 2012: Call for Participation Message-ID: *** Early registration ends June 20 *** ====== CALL FOR PARTICIPATION ================================================== 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. ** 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) Invited Talks -------------------------------------------------------------------------------- - Wolfgang Thomas, RWTH Aachen University "Synthesis and Some of Its Challenges" - David Dill, Stanford University "Model Checking Cell Biology" - Alex Haldermann, University of Michigan On security of voting machines Invited Tutorials -------------------------------------------------------------------------------- - Rastislav Bodik and Emina Torlak, University of California, Berkeley "Synthesizing Programs with Constraint Solvers" - Aaron Bradley, University of Colorado at Boulder "IC3 and Beyond: Incremental, Inductive Verification" - Chris Myers, University of Utah "Formal Verification of Genetic Circuits" - Micha? Moskal, Microsoft Research, Seattle "From C to infinity and back: Unbounded auto-active verification with VCC" ====== CONFERENCE PROGRAM ====================================================== Saturday July 7 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - LfSA 2012 Logics for System Analysis Co-chairs: Andr? Platzer, Philipp R?mmer Sunday July 8 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - BOOGIE 2012 2nd International Workshop on Intermediate Verification Languages Chair: Zvonimir Rakamaric - REORDER 2012 First International Workshop on Memory Consistency Models Co-chairs: Sela Mador-Haim, Jade Alglave Monday July 9 - INVITED TUTORIALS ---------------------------------------- 8:30 - 10:00: "Synthesizing Programs with Constraint Solvers" (Ras Bodik and Emina Torlak) 10:00 - 10:30: Break 10:30 - 12:00: "IC3 and Beyond: Incremental, Inductive Verification" (Aaron Bradley) 12:00 - 1:30: Break 1:30 - 3:00: "Formal Verification of Genetic Circuits" (Chris Myers) 3:00 - 3:30: Break 3:30 - 5:00: "From C to infinity and back: Unbounded auto-active verification with VCC" (Michal Moskal) Tuesday July 10 ---------------------------------------- 8:30 - 9:00: Welcome 9:00 - 10:00: "Synthesis and Some of Its Challenges" (Wolfgang Thomas - Keynote) 10:00 - 10:30: Break 10:30 - 12:00: AUTOMATA AND SYNTHESIS R1 Jan Kretinsky and Javier Esparza "Deterministic Automata for the (F,G)-fragment of LTL" R2 Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny "Efficient Controller Synthesis for Consumption Games with Multiple Resource Types" R3 R?diger Ehlers "ACTL ? LTL Synthesis" T1 Fran?ois Raskin "Acacia+, a tool for LTL synthesis" T2 Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl and Alois Knoll "MGSyn: Automatic Synthesis for Industrial Automation" 12:00 - 1:30: Break 1:30 - 3:35: INDUCTIVE INFERENCE AND TERMINATION R4 Yu-Fang Chen and Bow-Yaw Wang "Learning Boolean Functions Incrementally" R5 Rahul Sharma, Aditya Nori and Alex Aiken "Interpolants as Classifiers" R6 Wonchan Lee, Bow-Yaw Wang and Kwangkeun Yi "Termination Analysis with Algorithmic Learning" R7 Marc Brockschmidt, Richard Musiol, Carsten Otto and J?rgen Giesl "Automated Termination Proofs for Java Programs with Cyclic Data" R8 Javier Esparza, Andreas Gaiser and Stefan Kiefer "Proving Termination of Probabilistic Programs Using Patterns" 3:35 - 4:00: Break 4:00 - 6:05: ABSTRACTION R9 Arnaud Venet "The Gauge Domain: Scalable Analysis of Linear Inequality Invariants" R10 Josh Berdine, Arlen Cox, Samin Ishtiaq and Christoph Wintersteiger "Diagnosing Abstraction Failure for Separation Logic-based Analyses" R11 Aditya Thakur and Thomas Reps "A Method for Symbolic Computation of Abstract Operations" R12 Simone Fulvio Rollini, Ondrej Sery and Natasha Sharygina "Leveraging Interpolant Strength in Model Checking" T3 Evan Driscoll, Aditya Thakur and Thomas Reps "OpenNWA: A Nested Word Automaton Library" T4 Aws Albarghouthi, Yi Li, Arie Gurfinkel and Marsha Chechik "UFO: A Framework for Abstraction- and Interpolation-Based Verification" T5 Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina "SAFARI: SMT-based Abstraction For Arrays with Interpolants" 6:30 - 8:30: PC dinner Wednesday July 11 ---------------------------------------- 8:35 - 10:35: CONCURRENCY & SOFTWARE VERIFICATION R13 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi and Akash Lal "Detecting Fair Non-Termination in Multithreaded Programs" R14 Vineet Kahlon and Chao Wang "Lock Removal for Concurrent Trace Programs" R15 Gerhard Schellhorn, John Derrick and Heike Wehrheim "How to prove algorithms linearisable" R16 Anthony Widjaja Lin and Matthew Hague "Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters" R17 Alessandro Cimatti and Alberto Griggio "Software Model Checking via IC3" 10:35 - 11:00: Break 11:00 - 12:00: "Model Checking Cell Biology" (David Dill - Keynote) 12:00 - 1:30: Lunch 1:30 - 3:00: BIOLOGY & PROBABILISTIC SYSTEMS R18 Calin Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu and Ali Sezgin "Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits" R19 Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke "Assume-Guarantee Abstraction Refinement for Probabilistic Systems" R20 Cyrille Jegourel, Axel Legay and Sean Sedwards "Cross entropy optimisation of importance sampling parameters for statistical model checking" T6 David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex Taylor and Moshe Vardi "Ripple: Visual Tool for Modeling and Analysis of Biological Networks" T7 Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Bj?rn Wachter and James Worrell "APEX: An analyzer for open probabilistic programs" 3:30 - 4:00: Break 4:00 - 5:30: *EMBEDDED AND CONTROL SYSTEMS* - special track session R21 Adiya Zutshi, Sriram Sankaranarayanan and Ashish Tiwari "Timed Relational Abstractions For Sampled Data Control Systems" R22 Rupak Majumdar and Majid Zamani "Approximately Bisimilar Symbolic Models for Digital Control Systems" R23 Alessandro Cimatti, Raffaele Corvino, Armando Lazzaro, Iman Narasamdya, Tiziana Rizzo, Marco Roveri, Angela Sanseviero and Andrei Tchaltsev "Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System" T8 Philip Armstrong, Joel Ouaknine, Hristina Palikareva and Bill Roscoe "Recent Developments in FDR" T9 Songzheng Song, Jun Sun, Yang Liu and Jin Song Dong "A Model Checker for Hierarchical Probabilistic Real-time Systems" 6:00 - 9:30: Banquet Thursday July 12 ---------------------------------------- 8:30 - 10:00: *SAT/SMT SOLVING AND SMT-BASED VERIFICATION* - special track session R24 Isil Dillig, Thomas Dillig, Kenneth McMillan and Alex Aiken "Minimum Satisfying Assignments for SMT" R25 Cheng-Shen Han and Jie-Hong Roland Jiang "When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way" R26 Akash Lal, Shaz Qadeer and Shuvendu Lahiri "Corral: A Solver for Reachability Modulo Theories" T10 Shuvendu Lahiri, Chris Hawblitzel, Ming Kawaguchi and Henrique Reb?lo "SymDiff: A language-agnostic semantic diff tool" T11 Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout and Fatiha Zaidi "Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems" 10:00 - 10:30: Break 10:30 - 12:00: *TIMED & HYBRID SYSTEMS* - special track session R27 Shibashis Guha, Chinmay Narayan and S. Arun-Kumar "On Decidability of Prebisimulation for Timed Automata" R28 Ichiro Hasuo and Kohei Suenaga "Exercises in Nonstandard Static Analysis of Hybrid Systems" R29 Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle "A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx" T12 Ashish Tiwari "HybridSal Relational Abstracter" T13 Swarat Chaudhuri and Armando Solar-Lezama "Euler: A System for Numerical Optimization of Programs" 12:00 - 1:30: Lunch 1:30 - 2:45: *HARDWARE VERIFICATION* - special track session R30 Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Scott Owens, Jade Alglave, Kayvan Memarian, Rajeev Alur, Milo Martin, Peter Sewell and Derek Williams "An Axiomatic Memory Model for Power Multiprocessors" R31 Flavio M de Paula, Alan Hu and Amir Nahir "nuTAB-BackSpace: Rewriting to Normalize Non-Determinism in Post-Silicon Debug Traces" R32 Zyad Hassan, Aaron Bradley and Fabio Somenzi "Incremental Inductive CTL Model Checking" 2:45 - 3:35: Miscellaneous Tools T14 Rishabh Singh and Armando Solar-Lezama "SPT : Storyboard Programming Tool" T15 Patrick Rondon, Ming Kawaguchi, Alexander Bakst and Ranjit Jhala "CSolve: Verifying C With Liquid Types" T16 Daniel Schwartz-Narbonne, Feng Liu, David August and Sharad Malik "PASSERT: A tool for debugging parallel programs" T17 Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas and Andrew E. Santosa "TRACER: A Symbolic Execution Tool for Verification" T18 Stephan Arlt and Martin Sch?f "Joogie: Infeasible Code Detection for Java" T19 David Hopkins, Andrzej Murawski and Luke Ong "Hector: An Equivalence Checker for a Higher-Order Fragment of ML" T20 Jan Hoffmann, Klaus Aehlig and Martin Hofmann "Resource Aware ML" 3:35 - 4:00: Break 4:00 - 5:30: Tool demo/poster session 5:30 - 6:30: CAV business meeting 6:30 - 9:00: SC dinner Friday July 13 ---------------------------------------- 9:00 - 10:00: On security of voting machines (Alex Haldermann - Invited talk) 10:00 - 10:30: Break 10:30 - 11:45: *SECURITY* - special track session R33 Matt Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassen Saidi and Vinod Yegneswaran "Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement" R34 Boris K?pf, Laurent Mauborgne and Mart?n Ochoa "Automatic Quantification of Cache Side-Channels" R35 William Harris, Somesh Jha and Thomas Reps "Secure Programming via Visibly Pushdown Safety Games" 11:45 - 11:50: Mini-break 11:50 - 1:05: VERIFICATION AND SYNTHESIS R36 Nishant Sinha, Nimit Singhania, Satish Chandra and Manu Sridharan "Alternate and Learn: Finding witnesses without looking all over" R37 Duc Hiep Chu and Joxan Jaffar "A Complete Method for Symmetry Reduction in Safety Verification" R38 Rishabh Singh and Sumit Gulwani "Synthesizing Number Transformations from Input-Output Examples" 1:00 - 1:15: Conference Wrap-up -------------- next part -------------- An HTML attachment was scrubbed... URL: From amal at ccs.neu.edu Tue Jun 5 20:33:42 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Tue, 5 Jun 2012 20:33:42 -0400 Subject: [TYPES/announce] HOPE 2012 (a new workshop co-located with ICFP): Final Call for Talk Proposals Message-ID: <653F2819-8A1F-464B-9B06-1EC7B678216B@ccs.neu.edu> The deadline for HOPE 2012 talk proposals is this Friday, June 8th. Short submissions of a few paragraphs are quite welcome! ------------------------------------------------------------------- FINAL 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) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jhala at cs.ucsd.edu Wed Jun 6 00:24:41 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Tue, 5 Jun 2012 21:24:41 -0700 Subject: [TYPES/announce] Final Call For Papers: APLAS 2012, 10th Asian Symposium on Programming Languages and Systems Message-ID: <8798E20C-CE11-4213-A8F0-96F10B246243@cs.ucsd.edu> Apologies for multiple copies. Abstract deadline in 1 week! 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. Invited Speakers ---------------- - Jan Vitek (Purdue Univ.) - Xavier Leroy (INRIA), joint with CPP 2012 - Greg Morrisett (Harvard Univ.) joint with CPP 2012 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 gabriel at info.uaic.ro Wed Jun 6 04:27:04 2012 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Wed, 6 Jun 2012 11:27:04 +0300 (EEST) Subject: [TYPES/announce] Call for Papers MeCBIC 2012 / Newcastle, 8th Sept.2012 Message-ID: Dear Potential Participant, The 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi will be held this year on 8th September in Newcastle as one of the workshops of CONCUR 2012 -- http://conferences.ncl.ac.uk/concur-2012 . If your work is related to MeCBIC topics, it is now a good opportunity to submit a paper (of about 16 pages). Submission deadline is 16th June (in 10 days), with a title and abstract in less than 1 weak. Traditionally MeCBIC papers deal with multilevel multiset rewriting as they appear in membrane computing (a rule-based formalism) and in Petri nets, as well as compartments as they appear in membrane computing and in several process calculi (mobile ambients, brane calculi). During the last years, several additional ingredients were involved. A cross fertilization of these research areas has recently started; a deeper investigation of the relations between these related formalisms is interesting, as it is important to understand the similarities and the differences. Topics of interest include (but are not limited to): Biologically inspired models and calculi; Biologically inspired systems and their applications; Analysis of properties of biologically inspired models and languages; Theoretical links and comparison between different models/systems. The workshop proceedings will be published in the Electronic Proceedings in Theoretical Computer Science. After the workshop, some selected papers will be published in Scientific Annals of Computer Science. More details at http://www.info.uaic.ro/~mecbic/mecbic2012/ With best regards, Gabriel Ciobanu PS. If you indent to submit a paper and need few additional days, please send a message to mecbic at info.uaic.ro and/or gabriel at iit.tuiasi.ro. From Kim.Nguyen at lri.fr Wed Jun 6 05:48:57 2012 From: Kim.Nguyen at lri.fr (Kim Nguyen) Date: Wed, 6 Jun 2012 11:48:57 +0200 Subject: [TYPES/announce] Postdoc position on Typefull XML at LRI Univ. Paris-Sud Message-ID: Postdoctoral position on Typeful and Certified XML Universit? Paris Sud - INRIA - Saclay available. [Planned start date: fall 2012 - early winter 2013] ******************************************************************** Applications are invited for a postdoctoral position at LRI - Universit? of Paris Sud 11, ProVal - Proof of programs group joint group with INRIA Saclay ?le de France. http://proval.lri.fr/ The selected candidate will have to conduct research in the area of programming languages, data-centric programming languages, and XML. The research will take place in the context of the ANR project Typex: Typeful and Certified XML: http://typex.lri.fr/index.html Profile: -------- Candidates must have a PhD in Computer Science with a strong background in type theory, functional programming and programming language design. Skills in an additional area of computer science (proof theory, interactive theorem provers, etc.) are very welcome. The term of the postdoc position is one year and half (18 months). Starting date is negotiable (tentatively September 2012). The expected salary is about 2400 euros net income (4400 gross income) per month depending on the experience of the candidate. Application: ------------ To apply, send a resume, a brief statement of interest, and names of at least two references to: Veronique Benzaken (veronique.benzaken at lri.fr) and Kim Nguyen (kn at lri.fr) Detailed research plan: Toward a typeful XQuery ----------------------------------------------- XQuery [1], the W3C XML query language, blends in its upcoming 3rd version usual declarative constructs (FOR loop, akin to list comprehension, ORDER BY, XPath [2] queries, ...) and functional traits (higher order, pattern-matching, ...). In parallel, recent progress has been made [3,4] on the front of functional languages for XML. In particular the CDuce language features full regular expression types, a powerful pattern-matching construct, a powerful subtyping relation and type algebra (allowing amongst other things, higher-order functions, overloading, extensible records, ...). A missing feature (namely parametric polymorphism) has recently been added [5]. Topic of research: ----------------------- The goal of this postdoc position is to bridge the gap between XQuery and CDuce by porting the advanced typing features of CDuce to XQuery. A first work is to define a functional core of XQuery 3 (similar to the XQuery Core [6] but taking into account higher order). While close this Core XQuery would remain different from CDuce in one key aspect: use of path expression instead of pattern-matching as querying primitives. With this core language in place, a second goal is to adapt the rich type system of CDuce to XQuery 3 Core, in particular by adding some polymorphic traits to XQuery's existing type system (by extending it if necessary) [1] http://www.w3.org/TR/xquery-30/ [2] http://www.w3.org/TR/xpath/ [3] http://www.cduce.org [4] A. Frisch, G. Castagna, and V. Benzaken: Semantic Subtyping: dealing set-theoretically with function, union, intersection, and negation types. Journal of the ACM, vol.?55, n.?4, pag.?1?64, 2008. [5] G. Castagna and Z. Xu: Set-theoretic Foundation of Parametric Polymorphism and Subtyping. In ICFP?'11: 16th ACM-SIGPLAN International Conference on Functional Programming, pag.?94-106, September, 2011. [6] http://www.w3.org/TR/xquery-semantics/ -- Kim From Neil.Ghani at cis.strath.ac.uk Thu Jun 7 06:38:53 2012 From: Neil.Ghani at cis.strath.ac.uk (Neil Ghani) Date: Thu, 7 Jun 2012 11:38:53 +0100 Subject: [TYPES/announce] Lectureship Position @ MSP, Strathclyde Message-ID: <3E89928D-FCCE-4324-9FE4-DA1089948B6A@cis.strath.ac.uk> ****************************************************************** *** Lectureship *** *** Mathematically Structured Programming Group *** University of Strathclyde *** ****************************************************************** Applications are invited for lectureship within the MSP group at the University of Strathclyde The applicant's motivation must centre on a desire to discover beautiful mathematics of lasting value. The applicant should also have an innate sense of the wonder of learning allied with the capacity for self-motivation and a track record of academic achievement. The Mathematically Structured Programming Group's vision is to use mathematics to understand the nature of computation, and to then turn that understanding into practical advances within programming languages research. This reflects the symbiotic relationship between mathematics, programming, and the design of programming languages --- we believe that 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. The group consists of a number of internationally leading researchers including Professor Neil Ghani, Dr Patricia Johann, Dr Conor McBride, Dr Peter Hancock, Dr Robert Atkey, and our PhD students. While the lectureship is formally in the area of Program Verification, this is to be interpreted broadly. Very broadly. Anyone interested should in the first instance contact Professor Neil Ghani, whose email address is "neil.ghani at strath.ac.uk" to register interest. Details of the position can be found at http://www.mis.strath.ac.uk/Personnel/open/712012.pdf The closing date for applications is Thursday July 26. Please pass this on to anyone who you think would enjoy the chance to work with us. All the best Neil -------------- next part -------------- An HTML attachment was scrubbed... URL: From sescobar at dsic.upv.es Fri Jun 8 04:22:37 2012 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Fri, 8 Jun 2012 10:22:37 +0200 Subject: [TYPES/announce] 6th International School on Rewriting (ISR 2012) - Early registration (250 euro): June 15!! References: Message-ID: <93768126-7667-4712-A13C-2451FAF19837@dsic.upv.es> Call for Participation ISR 2012 6th International School on Rewriting http://www.dsic.upv.es/~isr2012 July 16th - 20th, 2012 Universitat Politecnica de Valencia Valencia, Spain !!!!!Early registration until June 15, 2012!!!!! http://www.dsic.upv.es/~isr2012/registration.html Early registration fee: 250 euro Accommodation: between 20 and 28 euro per night 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. Registration is now open! 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 Javier Insa Cabrera Sonia Santiago Alicia Villanueva From nipkow at in.tum.de Fri Jun 8 07:05:45 2012 From: nipkow at in.tum.de (Tobias Nipkow) Date: Fri, 08 Jun 2012 13:05:45 +0200 Subject: [TYPES/announce] =?utf-8?q?Isabelle_Users_Workshop_2012_=E2=80=94?= =?utf-8?q?_final_call?= Message-ID: <4FD1DC89.5010704@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 tiezzi at dsi.unifi.it Fri Jun 8 12:21:08 2012 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Fri, 8 Jun 2012 18:21:08 +0200 Subject: [TYPES/announce] CfP: JLAP Special Issue on Automated Specification and Verification of Web Systems Message-ID: <5A186784-B0E8-4A7F-B5D3-0B4A87192D38@dsi.unifi.it> [Apologies for multiple copies] **************************************************************************** Call for Papers JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING Special Issue on Automated Specification and Verification of Web Systems http://rap.dsi.unifi.it/wwv2011/jlap-wwv.html *** NEW DATE: Submission deadline: August 27, 2012 *** The deadline has been postponed to allow authors of WWV 2012 accepted papers to submit extended versions of their works **************************************************************************** AIMS AND SCOPE This special issue of the Journal of Logic and Algebraic Programming (JLAP, http://www.journals.elsevier.com/the-journal-of-logic-and-algebraic-programming/) is devoted to the topics of: - the 7th International Workshop on Automated Specification and Verification of Web Systems (WWV 2011, http://rap.dsi.unifi.it/wwv2011/), which took place on June 2011 in Reykjavik, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2011); - the 8th International Workshop on Automated Specification and Verification of Web Systems (WWV 2012, http://users.dsic.upv.es/~jsilva/wwv2012/), which will take place on June 2012 in Stockholm, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2012). This is however an open call for papers, therefore both participants of the workshop and other authors are encouraged to submit contributions. The aim of this special issue is to provide 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 have 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. We solicit original papers on topics of either theoretical or applied interest, which 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. IMPORTANT DATES **NEW** Submission of papers: August 27, 2012 First review decision: November 26, 2012 Revision due: January 14, 2013 Acceptance notification: February 25, 2013 Final manuscript due: March 25, 2013 Expected publication: Summer 2013 SUBMISSION We expect original articles (typically 20-30 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published in another journal and that must not be simultaneously submitted for publication elsewhere. Each paper will undergo a thorough evaluation by at least two reviewers. The authors will have about 50 days to incorporate the comments of the reviewers and submit a revised version of their papers, which will be evaluated again by the reviewers to make a final decision. Contributions should be in PDF format and must comply with JLAP's author guidelines, which can be retrieved from http://www.elsevier.com/wps/find/journaldescription.cws_home/621520/authorinstructions. The manuscripts must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are handled using the Elsevier Editorial System and can be uploaded using the following link: http://ees.elsevier.com/jlap/default.asp In the submission process, the authors must select the article type 'Special Issue:WWV 2011'. GUEST EDITORS Laura Kovacs (lkovacs at complang.tuwien.ac.at) Vienna University of Technology, Austria Rosario Pugliese (rosario.pugliese at unifi.it) University of Florence, Italy Josep Silva (jsilva at dsic.upv.es) Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi (francesco.tiezzi at imtlucca.it) IMT Advanced Studies Lucca, Italy From lanese at cs.unibo.it Sun Jun 10 11:51:29 2012 From: lanese at cs.unibo.it (Ivan Lanese) Date: Sun, 10 Jun 2012 17:51:29 +0200 (CEST) Subject: [TYPES/announce] SOAP track CfP Message-ID: Call for Papers Service-Oriented Architectures and Programming track of the 28th Symposium On Applied Computing http://www.itu.dk/acmsac2013-soap/ ACM SAC 2013 For the past twenty-eight years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is held at the Institute of Engineering of the Polytechnic Institute of Coimbra (ISEC-IPC). SOAP TRACK: CALL FOR PAPERS Service-Oriented Programming (SOP) is quickly changing our vision of the Web, bringing a paradigmatic shift in the methodologies followed by programmers when designing and implementing distributed systems. Originally, the Web was mainly seen as a means of presenting information to a wide spectrum of people, but SOP is triggering a radical transformation of the Web towards a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be discovered by other services and then invoked, abstracting from their actual implementation. Research on SOP is giving strong impetus to the development of new technologies and tools for creating and deploying distributed software. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of SOP needs to be clarified on many aspects, both from the engineering and from the foundational points of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modelling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, OWL, ...) and the syntactic one (WSDL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrate only on a few features of Service-Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service-Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming SOP into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what SOP still needs in order to achieve its original goal. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service-Oriented Computing - Methodologies and tools for Service-Oriented application design - Service-Oriented Middlewares - Service-Oriented Programming languages - Test methodologies for Service-Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service-Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service-Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service-Oriented Computing IMPORTANT DATES (strict) September 21, 2012: Paper submissions November 10, 2012: Author notification November 30, 2012: Camera-Ready Copy March 18-22, 2013: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will double-blindly review submissions. Accepted papers will be published in the annual conference proceedings. SOAP track chairs will not submit to the track. Submissions from SOAP PC members and from PC members and track chairs of other SAC tracks are welcome. Submission guidelines can be found on SAC 2013 Website: http://www.acm.org/conferences/sac/sac2013/ Prospective papers should be submitted to the track using the provided automated submission system. Please pay attention to ensure anonimity of your submitted manuscript as detailed in the submission page so to allow for double-blind review. Papers not satisfying this constraint will be automatically rejected. The maximum length for papers is 8 pages. Accepted papers whose camera-ready version will exceed 6 pages will have to pay an extra charge. For each accepted paper, an author or a proxy attending SAC MUST present the paper. This is a requirement for the paper to be included in the ACM/IEEE digital library. SPECIAL ISSUE Authors of best papers will be invited to submit an extended and revised version of their work to a special issue of Science of Computer Programming. STUDENT RESEARCH COMPETITION PROGRAM Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts will have the opportunity to give poster presentations of their work and compete for three top-winning places. The Student Research Competition committee will evaluate and select First-, Second-, and Third- place winners. The winners will receive cash awards and SIGAPP recognition certificates during the conference banquet. Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Luis Barbosa, Universidade do Minho - Braga (Portugal) Jesper Bengtson, IT University of Copenhagen (Denmark) Laura Bocchi, University of Leicester (UK) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Ettore Ferranti, ABB Switzerland Ltd Corporate Research (Switzerland) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. - Bologna (Italy) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Antonio Ravara, New University of Lisbon (Portugal) Gwen Sala?n, INRIA Grenoble (France) Martin Sch?f, UNU-IIST (Macao) Francesco Tiezzi, IMT Lucca (Italy) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) Huibiao Zhu, East China Normal University - Shanghai (China) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk UNU-IIST, Macao / School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy From viktor at mpi-sws.org Mon Jun 11 05:39:34 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Mon, 11 Jun 2012 11:39:34 +0200 Subject: [TYPES/announce] POPL 2013: Second call for papers Message-ID: <789CEE42-8803-46FE-8720-FDC2C1287C0E@mpi-sws.org> ********************* POPL 2013: Call for papers ************************ 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages http://popl.mpi-sws.org/2013/ POPL dates: 23-25 January 2013 Co-located events: 20-22, 26 January 2013 Location: Rome, Italy Paper registration: 6 July 2012, 11:59pm American Samoa time (UTC-11h) Paper submission: 10 July 2012, 11:59pm American Samoa time (UTC-11h) Author response: 10-13 September 2012 Notification: 1 October 2012 Submission URL: https://popl2013.ens.fr (will be opened nearer the deadline) Scope: The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and systems, with emphasis on how principles underpin practice. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. Papers discussing new ideas and areas are most welcome, as are high-quality expositions or elucidations of existing concepts that are likely to yield new insights ("pearls"). For more information and submission guidelines please consult the POPL'13 website: http://popl.mpi-sws.org/2013/ From J.T.Jeuring at uu.nl Mon Jun 11 10:27:11 2012 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Mon, 11 Jun 2012 16:27:11 +0200 Subject: [TYPES/announce] CICM 2012: 2nd Call for participation; early registration deadline approaching In-Reply-To: <644A89D2-93DF-4918-B68C-CC5145DBE6D8@uu.nl> References: <644A89D2-93DF-4918-B68C-CC5145DBE6D8@uu.nl> Message-ID: <03D64256-3F12-4BFD-8B5C-FE925F6AD84E@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 participation ---------------------------------------------------------------- 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 is 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 is 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 ---------------------------------------------------------------- Programme ---------------------------------------------------------------- The global programme of the conference, tracks, and workshops are available via: http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=programme and the accepted papers via: http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=accepted ---------------------------------------------------------------- Registration ---------------------------------------------------------------- Early registration rates are applicable until June 15. See http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=registration From basia.kordy at gmail.com Mon Jun 11 13:09:15 2012 From: basia.kordy at gmail.com (Basia Kordy) Date: Mon, 11 Jun 2012 19:09:15 +0200 Subject: [TYPES/announce] Ph.D. position in computer security at the University of Luxembourg Message-ID: ****Ph.D. Position in Computer Security (Ref: SNT-PhD-STAST-0512)**** The University of Luxembourg has an open Ph.D. position at its Interdisciplinary Centre for Security, Reliability and Trust (SnT) (http://wwwen.uni.lu/snt). We are seeking Ph.D. candidates to participate in the activities of the SaToSS research group (http://satoss.uni.lu/). Project description: ---------------------- The main objective of the Ph.D. project is to develop a formal framework supporting modeling and analysis of socio-technical components of information systems. We aim to develop strategies and tools to detect and prevent attacks involving human, physical and digital elements. One of the goals is to extend current methodology for security protocol analysis, by taking human behavior and properties of physical objects into account. This goal includes a necessity of defining appropriate adversary models and identifying the security properties relevant in a socio-technical context. Research environment: ---------------------- The student will collaborate with the research groups SaToSS (Security and Trust of Software Systems) led by Prof. Dr. S. Mauw and APSIA (Applied Security and Information Assurance) led by Prof. Dr. P.Y.A. Ryan. This position is part of a national research project "Socio-Technical Analysis of Security and Trust" funded by the National Research Fund in Luxembourg. The University of Luxembourg offers a three years appointment (extension up to 4 years in total is possible) in an international and multicultural environment. The University is an equal opportunity employer. Applicant's profile: -------------------- * MSc in Computer Science or Mathematics * A proven interest in security * Strong background in formal methods or logics * Good written and oral English skills Start date: ----------- As soon as possible Applications: ------------- Applications, written in English, should be submitted electronically via the University of Luxembourg's recruitment portal http://emea3.mrted.ly/1bho Applications should include: * Curriculum Vitae (including your contact address, work experience and list of publications) * Cover letter explaining your motivation * Transcript of all courses and grades for your Bachelor and Master program * A short description of your Master's work (max 1 page) * Contact information for at least one referee Deadline for applications: -------------------------- June 30, 2012 For further inquiries please contact: ------------------------------------- Prof. Dr. Sjouke Mauw (sjouke.mauw at uni.lu) or Dr. Barbara Kordy (barbara.kordy at uni.lu) or Dr. Gabriele Lenzini (gabriele.lenzini at uni.lu) --------------------------------- Best regards, Barbara Kordy Campus Kirchberg, room F012 Universit? du Luxembourg Interdisciplinary Centre for Security, Reliability and Trust 6, rue Richard Coudenhove-Kalergi L-1359 Luxembourg Phone: +352 466 644 5506 Fax: +352 466 644 5741 From lionel.vaux at univ-amu.fr Tue Jun 12 10:22:05 2012 From: lionel.vaux at univ-amu.fr (Lionel Vaux) Date: Tue, 12 Jun 2012 16:22:05 +0200 Subject: [TYPES/announce] Postdoc position in proof theory (IML, Marseille, France) Message-ID: <20120612142204.GG15937@garbure.info> [Apologies for multiple posting] SECOND ANNOUNCEMENT The French ANR project LOGOI is inviting applications for a postdoctoral position within the team Logique de la Programmation (LDP) of the Institut de Math?matiques de Luminy (IML) in Marseille, France. Context ------- The LOGOI project pursues the programme of Geometry of Interaction (GoI), which aims at a reconstruction of logic from interaction as the primitive notion, considered as an abstract counterpart of cut elimination. This programme has started together with linear logic and has evolved since its early days, from the limited case of multiplicatives to recent developments involving the theory of operator algebras and providing a strikingly new perspective on implicit complexity via light logics. The goals of the LOGOI project are on one side to better understand and refine the current theory of GoI, and on the other side to draw on the novel tools and concepts provided by this framework, in order to propose a new structured approach to proof theory and its connections with other areas of computer science. Post Doctoral Position ---------------------- This is a full-time research position for one year, with a possible one-year extension. It is expected to start at the beginning of fall 2012 (between 1 Sep. and 1 Nov.). Research will take place at the IML in Marseille. The successful applicant will contribute to the main areas of the LOGOI project research effort: geometry of interaction, ludics, proof theoretical aspects of computation. Possible connections with other fields of proof theory and computer science are also of interest. The post-doc is of course expected to participate to group activities (workshops, meetings, tutorials) both of the LOGOI project and the LDP team. Requirements ------------ Applicants must hold a PhD degree in computer science or mathematics, and should have a strong background in logic and proof theory. Skills in an additional area of computer science (complexity, concurrency, programming language semantics, etc.) are very welcome. If the PhD thesis is not defended yet, the candidate must provide the planned defence date and the composition of the thesis committee. Knowledge of French is not required. Application ----------- To apply, please send an email to logoi-postdoc at iml.univ-mrs.fr, including your current CV, a link to a list of your publications, and a research statement summarizing your research activities and goals (preferably two pages at most). You might also include the names of up to two references. The deadline for applications is 20 june 2012. More Information ---------------- Logoi: http://www.logoi.fr/ IML: http://iml.univ-mrs.fr/ From msteffen at ifi.uio.no Tue Jun 12 11:59:53 2012 From: msteffen at ifi.uio.no (Martin Steffen) Date: Tue, 12 Jun 2012 17:59:53 +0200 Subject: [TYPES/announce] PhD position in Computer Science at the University of Oslo Message-ID: ========================================================== University of Oslo, Department of Informatics PhD Research Fellowship in the group Precise Modeling and Analysis of Dependable Systems ========================================================== The fellowship is for a period of 4 years, with 25 % compulsory work (such as teaching assistance). Starting date: no later than 01.10.2012. For further details of how to apply, contact persons, required documents, and other formal requirements and conditions of the position, see http://uio.easycruit.com/vacancy/711997/64290?iso=no ================================================================== Job/ project description: o The project is in formal methods for runtime updates of distributed systems, addressing system evolution through the upgrade of executing code, and combines theoretical work with more applied programming. o The candidate is expected to work on analysis techniques to ensure safe program evolution, such as e.g., extended type systems or abstract interpretation, as well as tool development for runtime software evolution, such as run-time checking. Scala could be a suitable target language for the upgrade framework, but the candidate will have opportunity to influence this decision. The applicant should preferably have experience in formal methods, and concurrent and object-oriented programming. o The Precise Modeling and Analysis group at the Department of Informatics, University of Oslo, Norway, works on formal methods, and in particular on tools and languages for object-oriented and component-based software development. Our current research focus includes - formal specification and analysis of real-time systems - object-orientation and open distributed systems - rewriting logic - specification and verification of object-oriented programs o Our research combines theoretical foundations with the goal to develop practical tools and languages to capture software adaptability. The group's activities include both theoretical, foundational, and experimental work within formal methods, semantics, and language design. For more information, see the following web-page: http://www.mn.uio.no/ifi/english/research/groups/pma/index.html The group is involved in the European research project Highly Adaptable and Trustworthy Systems using Formal Models (HATS). The HATS project is also a good starting point for this PhD project and we encourage participation in HATS. For more information, see the following web-page: http://www.hats-project.eu ============================================================================== From elaine at mat.ufmg.br Tue Jun 12 16:56:04 2012 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Tue, 12 Jun 2012 22:56:04 +0200 Subject: [TYPES/announce] LSFA -- extended deadline Message-ID: ======================================================================= [ please distribute - apologies for multiple copies ] ======================================================================= ****************************** *********** Extended ********** ****** submission deadline ****** ****** June 22th, 2012 ****** ****************************** 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 22th, 2012 (extended) 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 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 (extended) submission deadline in June 22th, 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) (co-chair) * Luiz Carlos Pereira (PUC-Rio, UFRJ) * Mauricio Ayala-Rincon (UnB) (co-chair) ======================================================================= -- Elaine. ------------------------------------------------- Elaine Pimentel? - DMat/UFMG Address: Departamento de Matematica ? ?? Universidade Federal de Minas Gerais ? ?? Av Antonio Carlos, 6627 - C.P. 702 ? ?? Pampulha - CEP 30.161-970 ? ?? Belo Horizonte - Minas Gerais - Brazil Phone:?? 55 31 3409-5970/3409-5994 Fax:? ? ?? 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- From henglein at diku.dk Wed Jun 13 05:21:08 2012 From: henglein at diku.dk (Fritz Henglein) Date: Wed, 13 Jun 2012 11:21:08 +0200 Subject: [TYPES/announce] Ph.D. position in computer science at DIKU In-Reply-To: References: Message-ID: The Department of Computer Science, University of Copenhagen, Denmark (DIKU) invites applications for a PhD scholarship starting September/October 2012. The scholarship is internally financed and *not* subject to requirements of a specific research project or an external funding agent. The Algorithms and Programming Languages group at DIKU would welcome applications from candidates with a strong background in core computer science (algorithms, languages, systems) and interests in type systems, including related topics such as functional programming, program transformation, verification, theorem proving, functional high-performance computing. Application deadline: July 2nd, 2012. For more information, see http://diku.dk/ominstituttet/ledige_stillinger/phd_computer_science/ If you have questions, please feel free to contact Fritz Henglein at henglein at diku.dk. From jnfoster at cs.cornell.edu Wed Jun 13 08:35:36 2012 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Wed, 13 Jun 2012 08:35:36 -0400 Subject: [TYPES/announce] Call for papers: Workshop on Rigorous Protocol Engineering (WRiPE) Message-ID: The 2nd International Workshop on Rigorous Protocol Engineering http://www.cs.cornell.edu/conferences/wripe2012 Austin, Texas, USA 30 October 2012 co-located with ICNP 2012 OVERVIEW The increased performance and maturity of verification techniques, including the use of tools such as model checkers, theorem provers, and SAT/SMT solvers, provides a rich set of techniques that could be applied to the area of networking. Unfortunately these techniques are rarely used in practice. WRiPE is an inter-disciplinary workshop that seeks to bring together researchers from the networking, formal methods, and programming languages communities to discuss current research on rigorous network protocol design and implementation. The goal of the workshop is to reinvigorate and revitalize the application of formal methods to the design, analysis, and implementation of protocols. SCOPE We include under the heading of verification any rigorous method of synthesizing an implementation, demonstrating that an existing implementation satisfies a given specification, or showing how reliable conclusions can be extracted from measurements. Under network protocols we include the traditional IP stack, emerging software router platforms such as OpenFlow, as well as routing, transport, application overlays, wireless protocols for carrier, enterprise, and data center networks. We are also interested in rigorous methods for establishing security properties of protocols. Specific topics of interest include (but are not limited to) the following: * Correct-by-construction methods for developing protocols. * Applications of model checkers, theorem provers, SAT/SMT solvers, and so on to network protocols. * Techniques for synthesizing protocol implementations and configurations. * Domain specific languages for describing protocols. * Run-time techniques for formally verifying and testing the correctness of protocols. IMPORTANT DATES Submission: 31 July 2012 (anywhere in the world) Notification: 3 September 2012 Camera-ready: 20 September 2012 WRiPE 2012: 30 October 2012 ORGANIZERS Nate Foster (Cornell University, co-chair) Alexander Gurney (University of Pennsylvania, co-chair) Limin Jia (Carnegie Mellon University) Peyman Kazemian (Stanford University) Hung Nguyen (University of Adelaide) Olaf Maennel (Loughborough University) Robbert van Renesse (Cornell University) Michael Schapira (Hebrew University of Jerusalem) Stefano Vissicchio (Universite Catholique de Louvain) David Walker (Princeton University) Pamela Zave (AT&T Research) Wenchao Zhou (Georgetown University) AUTHOR GUIDELINES Prospective authors are invited to submit papers in English presenting original research. Submissions to WRiPE must not be concurrent with a substantially similar submission to a conference or workshop, including condensed versions of work that has been submitted and is currently under review. Please do not submit abbreviated versions of journal or conference papers. Reviewing will not be blind. We encourage submissions of work-in-progress based on novel and interesting ideas and tool demonstrations. All submitted papers must be no longer than six (6) pages in double-column format with standard margins (i.e., at least one inch all around) and at least a 10 point font. Longer submissions will not be reviewed. We suggest using the IEEE Transactions Style: http://www.ieee.org/web/publications/authors/transjnl/index.html. PROCEEDINGS Accepted papers will be published by the IEEE Press. From bengt.nordstrom at gmail.com Thu Jun 14 10:40:03 2012 From: bengt.nordstrom at gmail.com (Bengt Nordstrom) Date: Thu, 14 Jun 2012 16:40:03 +0200 Subject: [TYPES/announce] Senior lecturer in Logic of Programs in University of Gothenburg, Sweden Message-ID: Permanent position as Senior lecturer in Logic of Programs in University of Gothenburg, Sweden Deadline for application: 7 Aug 2012 Topics of interest include: - program verification, - dependent type theory, - dependently typed functional programming, - lambda calculus, - semantics of programming languages, - implementation of proof assistants, - applications of proof theory and category theory in programming. The Department of Computer Science and Engineering is joint between Chalmers and the University of Gothenburg and offers BSc- and MSc- and PhD-level education in a broad range of subjects: Algorithms, Computer Security, Dependable Computer Systems, Distributed Systems, Formal Methods, Integrated Electronic System Design, Language Technology, Logic, Networks and Software Engineering. The CSE education includes almost 150 courses offered to around 20 different programmes at two universities. More information at http://goo.gl/ne7wY From Damien.Pous at ens-lyon.fr Fri Jun 15 03:15:30 2012 From: Damien.Pous at ens-lyon.fr (Damien Pous) Date: Fri, 15 Jun 2012 09:15:30 +0200 Subject: [TYPES/announce] Call for papers : JFLA 2013 Message-ID: (This message is intentionally written in French) * Merci de faire circuler : premier appel ? communication * JFLA'2013 (http://jfla.inria.fr/2013/) Journ?es Francophones des Langages Applicatifs Organis?es par l'INRIA, ? Aussois, du 3 f?vrier au 6 f?vrier 2013 Les JFLA r?unissent concepteurs, utilisateurs et th?oriciens ; elles ont pour ambition de couvrir les domaines des langages applicatifs, de la preuve formelle, et des objets math?matiques qui sous-tendent ces outils. Ces domaines doivent ?tre pris au sens large : nous souhaitons avant tout favoriser les ponts entre les diff?rentes th?matiques : . Langages fonctionnels et applicatifs : s?mantique, compilation, optimisation, typage, mesures, extensions par d'autres paradigmes. . Assistants de preuve : impl?mentation, nouvelles tactiques, d?veloppements pr?sentant un int?r?t technique ou m?thodologique. . Logique, correspondance de Curry-Howard, r?alisabilit?, extraction de programmes, mod?les. . Sp?cification, prototypage, d?veloppements formels d'algorithmes. . Utilisation industrielle des langages fonctionnels et applicatifs, ou des m?thodes issues des preuves formelles, outils pour le web. Les articles soumis aux JFLA sont relus par au moins deux personnes s'ils sont accept?s, trois personnes s'ils sont rejet?s. Les critiques des relecteurs sont toujours bienveillantes et la plupart du temps encourageantes et constructives, m?me en cas de rejet. Il n'y a donc pas de raison de ne pas soumettre aux JFLA ! Nous accepterons cette ann?e deux types de soumissions : . article de recherche de quinze pages au plus, portant sur des travaux originaux. Nous accepterons volontier des travaux en cours (pour lesquels l'aspect recherche n'est pas enti?rement termin?) ; dans tous les cas, la forme de l'article devra ?tre soign?e. Les articles s?lectionn?s seront publi?s dans les actes de la conf?rence, les auteurs seront invit?s ? faire une pr?sentation en vingt-cinq minutes lors des journ?es. . proposition d'expos? court (dix minutes) pour d?crire prototype, faire une d?monstration d'un outil, reparler d'un article d?j? publi?, rechercher de l'aide pour r?soudre un probl?me particulier. Dans ce cas, nous vous demandons seulement de soumettre un r?sum? de deux ? trois pages, qui nous permettra de s?lectionner les orateurs en cas de forte affluence. Comit? de programme ------------------- Damien Pous, Pr?sident (CNRS -- ENS Lyon) Christine Tasson, Vice pr?sidente (PPS -- Universit? Paris Diderot) Jade Alglave (University of Oxford) David Baelde (ITU Copenhague) Pierre-Malo Deni?lou (Royal Holloway, University of London) Pascal Fradet (INRIA Rh?ne-Alpes) Samuel Mimram (CEA Saclay) Yann R?gis-Gianas (Universit? Paris VII) Matthieu Sozeau (INRIA Paris -- Rocquencourt) Nicolas Tabareau (INRIA Nantes) Enrico Tassi (LIX -- ?cole Polytechnique) Soumission ---------- Date limite de soumission : 12 octobre 2012 Les soumissions doivent ?tre d?pos?es sur Easychair, ? l'adresse suivante : https://www.easychair.org/conferences/?conf=jfla2013 Elles peuvent ?tre r?dig?es en anglais, mais elles sont limit?es ? 15 pages A4 et le style LaTeX est impos? : http://jfla.inria.fr/2013/actes.sty Dates importantes ----------------- 12 octobre 2012 : Date limite de soumission 16 novembre 2012 : Notification aux auteurs 7 d?cembre 2012 : Remise des articles d?finitifs 10 janvier 2013 : Date limite d'inscription aux journ?es 3 f?vrier au 6 f?vrier 2013 : Journ?es Pour tout renseignement d'ordre administratif, contacter -------------------------------------------------------- Dani?le Herzog INRIA Rh?ne-Alpes, Bureau des cours et colloques 655 Avenue de l'Europe, Montbonnot 38 334 St Ismier Cedex - France Tel : +33 (0)4 76 61 52 23 - Fax : +33 (0)4 56 52 71 90 email : colloques at inrialpes.fr http://jfla.inria.fr/2013/ From scm-ml at iis.sinica.edu.tw Sat Jun 16 01:10:09 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml) Date: Sat, 16 Jun 2012 13:10:09 +0800 Subject: [TYPES/announce] PEPM 2012: Preliminary Call for Papers Message-ID: <6B915123-3CD4-4B5B-B473-523C0A10597A@iis.sinica.edu.tw> P R E L I M I N A R Y C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ** SUBMISSION DEADLINE: ** late September/early October (precise date to be announced on the website shortly) SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Like for recent PEPMs, selected papers will be invited for a journal special issue dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France) -------------- next part -------------- An HTML attachment was scrubbed... URL: From scm-ml at iis.sinica.edu.tw Sun Jun 17 10:28:58 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml) Date: Sun, 17 Jun 2012 22:28:58 +0800 Subject: [TYPES/announce] *correction* PEPM 2013: Preliminary Call for Papers Message-ID: *correction* PEPM 2013: Preliminary Call for Papers The call for papers we sent several hours ago was, of course, about PEPM 2013, rather than PEPM 2012. The work shops will be held during 20-21 January 2013, co-located with POPL 2013. Sorry for the confusion! The previous CFP was otherwise correct. The full call for papers can be found on our homepage: http://www.program-transformation.org/PEPM13/CallForPapers Thank you! From francesca.poggiolesi at unifi.it Mon Jun 18 11:43:34 2012 From: francesca.poggiolesi at unifi.it (francesca.poggiolesi at unifi.it) Date: Mon, 18 Jun 2012 17:43:34 +0200 Subject: [TYPES/announce] Master LOPHISC 2012-2013 (Paris) Message-ID: <20120618174334.gajpfdldwkwswsok@webmail.unifi.it> Master LOPHISC 2012-2013 Logic, philosophy of logic and philosophy of science - Paris 1 and Paris 4 OPEN TO STUDENTS WITH A SCIENTIFIC BACKGROUND The University of Paris 1 and Paris 4 propose a master in logic, philosophy of science, and epistemology. Students can chose amongst the following three main branches: 1. Logic and Philosophy of Logic (Paris 1). 2. Philosophy and History of Science (Paris 1). 3. Philosophy of Science and Epistemology (Paris 4). A detailed description can be found here: http://www.lophisc.org/ From andrzej.murawski at leicester.ac.uk Tue Jun 19 04:08:07 2012 From: andrzej.murawski at leicester.ac.uk (Andrzej Murawski) Date: Tue, 19 Jun 2012 09:08:07 +0100 Subject: [TYPES/announce] LICS 2012 - Last Call for Participation Message-ID: 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2012) Last Call for Participation June 25-28, 2012 Dubrovnik, Croatia http://www2.informatik.hu-berlin.de/lics/lics12/ * The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik, Croatia, from June 25th to 28th, 2012. * TUTORIALS LICS 2012 will continue the tradition of pre-conference tutorials that was initiated in 2011. This year, Jan Willem Klop will give a tutorial on term rewriting systems and Andre Platzer will give a tutorial on logics of dynamical systems. * SPECIAL EVENTS AND INVITED LECTURES There will be an invited lecture by Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences, and a plenary session in honor of Alan Turing on the occasion of his centenary, with talks by Robert L. Constable, E. Allen Emerson (co-winner of 2008 A. M. Turing Award), Joan Feigenbaum, and Leonid Levin. * AFFILIATED WORKSHOPS - June 24 (Sunday) Logic and Computational Complexity (LCC'12) Syntax and Semantics of Low-Level Languages (LOLA'12) - June 29 (Friday) Algorithmics on Infinite-State Systems (AISS'12) Games for Logic and Programming Languages (GALOP'12) Intersection Types and Related Systems (ITRS'12) Logic and Systems Biology (LSB'12) * REGISTRATION Visit http://www2.informatik.hu-berlin.de/lics/lics12/ and follow the link to "Registration". -------------- next part -------------- An HTML attachment was scrubbed... URL: From cav2012.publicity.chair at gmail.com Tue Jun 19 06:30:49 2012 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Tue, 19 Jun 2012 06:30:49 -0400 Subject: [TYPES/announce] *** Early registration extended through June 25 *** CAV 2012: Call for Participation Message-ID: *** Early registration extended through June 25 *** ====== CALL FOR PARTICIPATION ================================================== 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/ *UPDATE* Hotel accommodation is filling up fast. Book your rooms soon! 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. ** 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) Invited Talks -------------------------------------------------------------------------------- - Wolfgang Thomas, RWTH Aachen University "Synthesis and Some of Its Challenges" - David Dill, Stanford University "Model Checking Cell Biology" - Alex Haldermann, University of Michigan On security of voting machines Invited Tutorials -------------------------------------------------------------------------------- - Rastislav Bodik and Emina Torlak, University of California, Berkeley "Synthesizing Programs with Constraint Solvers" - Aaron Bradley, University of Colorado at Boulder "IC3 and Beyond: Incremental, Inductive Verification" - Chris Myers, University of Utah "Formal Verification of Genetic Circuits" - Micha? Moskal, Microsoft Research, Seattle "From C to infinity and back: Unbounded auto-active verification with VCC" ====== CONFERENCE PROGRAM ====================================================== Saturday July 7 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - LfSA 2012 Logics for System Analysis Co-chairs: Andr? Platzer, Philipp R?mmer Sunday July 8 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - BOOGIE 2012 2nd International Workshop on Intermediate Verification Languages Chair: Zvonimir Rakamaric - REORDER 2012 First International Workshop on Memory Consistency Models Co-chairs: Sela Mador-Haim, Jade Alglave Monday July 9 - INVITED TUTORIALS ---------------------------------------- 8:30 - 10:00: "Synthesizing Programs with Constraint Solvers" (Ras Bodik and Emina Torlak) 10:00 - 10:30: Break 10:30 - 12:00: "IC3 and Beyond: Incremental, Inductive Verification" (Aaron Bradley) 12:00 - 1:30: Break 1:30 - 3:00: "Formal Verification of Genetic Circuits" (Chris Myers) 3:00 - 3:30: Break 3:30 - 5:00: "From C to infinity and back: Unbounded auto-active verification with VCC" (Michal Moskal) Tuesday July 10 ---------------------------------------- 8:30 - 9:00: Welcome 9:00 - 10:00: "Synthesis and Some of Its Challenges" (Wolfgang Thomas - Keynote) 10:00 - 10:30: Break 10:30 - 12:00: AUTOMATA AND SYNTHESIS R1 Jan Kretinsky and Javier Esparza "Deterministic Automata for the (F,G)-fragment of LTL" R2 Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny "Efficient Controller Synthesis for Consumption Games with Multiple Resource Types" R3 R?diger Ehlers "ACTL ? LTL Synthesis" T1 Fran?ois Raskin "Acacia+, a tool for LTL synthesis" T2 Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl and Alois Knoll "MGSyn: Automatic Synthesis for Industrial Automation" 12:00 - 1:30: Break 1:30 - 3:35: INDUCTIVE INFERENCE AND TERMINATION R4 Yu-Fang Chen and Bow-Yaw Wang "Learning Boolean Functions Incrementally" R5 Rahul Sharma, Aditya Nori and Alex Aiken "Interpolants as Classifiers" R6 Wonchan Lee, Bow-Yaw Wang and Kwangkeun Yi "Termination Analysis with Algorithmic Learning" R7 Marc Brockschmidt, Richard Musiol, Carsten Otto and J?rgen Giesl "Automated Termination Proofs for Java Programs with Cyclic Data" R8 Javier Esparza, Andreas Gaiser and Stefan Kiefer "Proving Termination of Probabilistic Programs Using Patterns" 3:35 - 4:00: Break 4:00 - 6:05: ABSTRACTION R9 Arnaud Venet "The Gauge Domain: Scalable Analysis of Linear Inequality Invariants" R10 Josh Berdine, Arlen Cox, Samin Ishtiaq and Christoph Wintersteiger "Diagnosing Abstraction Failure for Separation Logic-based Analyses" R11 Aditya Thakur and Thomas Reps "A Method for Symbolic Computation of Abstract Operations" R12 Simone Fulvio Rollini, Ondrej Sery and Natasha Sharygina "Leveraging Interpolant Strength in Model Checking" T3 Evan Driscoll, Aditya Thakur and Thomas Reps "OpenNWA: A Nested Word Automaton Library" T4 Aws Albarghouthi, Yi Li, Arie Gurfinkel and Marsha Chechik "UFO: A Framework for Abstraction- and Interpolation-Based Verification" T5 Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina "SAFARI: SMT-based Abstraction For Arrays with Interpolants" 6:30 - 8:30: PC dinner Wednesday July 11 ---------------------------------------- 8:35 - 10:35: CONCURRENCY & SOFTWARE VERIFICATION R13 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi and Akash Lal "Detecting Fair Non-Termination in Multithreaded Programs" R14 Vineet Kahlon and Chao Wang "Lock Removal for Concurrent Trace Programs" R15 Gerhard Schellhorn, John Derrick and Heike Wehrheim "How to prove algorithms linearisable" R16 Anthony Widjaja Lin and Matthew Hague "Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters" R17 Alessandro Cimatti and Alberto Griggio "Software Model Checking via IC3" 10:35 - 11:00: Break 11:00 - 12:00: "Model Checking Cell Biology" (David Dill - Keynote) 12:00 - 1:30: Lunch 1:30 - 3:00: BIOLOGY & PROBABILISTIC SYSTEMS R18 Calin Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu and Ali Sezgin "Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits" R19 Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke "Assume-Guarantee Abstraction Refinement for Probabilistic Systems" R20 Cyrille Jegourel, Axel Legay and Sean Sedwards "Cross entropy optimisation of importance sampling parameters for statistical model checking" T6 David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex Taylor and Moshe Vardi "Ripple: Visual Tool for Modeling and Analysis of Biological Networks" T7 Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Bj?rn Wachter and James Worrell "APEX: An analyzer for open probabilistic programs" 3:30 - 4:00: Break 4:00 - 5:30: *EMBEDDED AND CONTROL SYSTEMS* - special track session R21 Adiya Zutshi, Sriram Sankaranarayanan and Ashish Tiwari "Timed Relational Abstractions For Sampled Data Control Systems" R22 Rupak Majumdar and Majid Zamani "Approximately Bisimilar Symbolic Models for Digital Control Systems" R23 Alessandro Cimatti, Raffaele Corvino, Armando Lazzaro, Iman Narasamdya, Tiziana Rizzo, Marco Roveri, Angela Sanseviero and Andrei Tchaltsev "Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System" T8 Philip Armstrong, Joel Ouaknine, Hristina Palikareva and Bill Roscoe "Recent Developments in FDR" T9 Songzheng Song, Jun Sun, Yang Liu and Jin Song Dong "A Model Checker for Hierarchical Probabilistic Real-time Systems" 6:00 - 9:30: Banquet Thursday July 12 ---------------------------------------- 8:30 - 10:00: *SAT/SMT SOLVING AND SMT-BASED VERIFICATION* - special track session R24 Isil Dillig, Thomas Dillig, Kenneth McMillan and Alex Aiken "Minimum Satisfying Assignments for SMT" R25 Cheng-Shen Han and Jie-Hong Roland Jiang "When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way" R26 Akash Lal, Shaz Qadeer and Shuvendu Lahiri "Corral: A Solver for Reachability Modulo Theories" T10 Shuvendu Lahiri, Chris Hawblitzel, Ming Kawaguchi and Henrique Reb?lo "SymDiff: A language-agnostic semantic diff tool" T11 Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout and Fatiha Zaidi "Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems" 10:00 - 10:30: Break 10:30 - 12:00: *TIMED & HYBRID SYSTEMS* - special track session R27 Shibashis Guha, Chinmay Narayan and S. Arun-Kumar "On Decidability of Prebisimulation for Timed Automata" R28 Ichiro Hasuo and Kohei Suenaga "Exercises in Nonstandard Static Analysis of Hybrid Systems" R29 Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle "A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx" T12 Ashish Tiwari "HybridSal Relational Abstracter" T13 Swarat Chaudhuri and Armando Solar-Lezama "Euler: A System for Numerical Optimization of Programs" 12:00 - 1:30: Lunch 1:30 - 2:45: *HARDWARE VERIFICATION* - special track session R30 Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Scott Owens, Jade Alglave, Kayvan Memarian, Rajeev Alur, Milo Martin, Peter Sewell and Derek Williams "An Axiomatic Memory Model for Power Multiprocessors" R31 Flavio M de Paula, Alan Hu and Amir Nahir "nuTAB-BackSpace: Rewriting to Normalize Non-Determinism in Post-Silicon Debug Traces" R32 Zyad Hassan, Aaron Bradley and Fabio Somenzi "Incremental Inductive CTL Model Checking" 2:45 - 3:35: Miscellaneous Tools T14 Rishabh Singh and Armando Solar-Lezama "SPT : Storyboard Programming Tool" T15 Patrick Rondon, Ming Kawaguchi, Alexander Bakst and Ranjit Jhala "CSolve: Verifying C With Liquid Types" T16 Daniel Schwartz-Narbonne, Feng Liu, David August and Sharad Malik "PASSERT: A tool for debugging parallel programs" T17 Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas and Andrew E. Santosa "TRACER: A Symbolic Execution Tool for Verification" T18 Stephan Arlt and Martin Sch?f "Joogie: Infeasible Code Detection for Java" T19 David Hopkins, Andrzej Murawski and Luke Ong "Hector: An Equivalence Checker for a Higher-Order Fragment of ML" T20 Jan Hoffmann, Klaus Aehlig and Martin Hofmann "Resource Aware ML" 3:35 - 4:00: Break 4:00 - 5:30: Tool demo/poster session 5:30 - 6:30: CAV business meeting 6:30 - 9:00: SC dinner Friday July 13 ---------------------------------------- 9:00 - 10:00: On security of voting machines (Alex Haldermann - Invited talk) 10:00 - 10:30: Break 10:30 - 11:45: *SECURITY* - special track session R33 Matt Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassen Saidi and Vinod Yegneswaran "Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement" R34 Boris K?pf, Laurent Mauborgne and Mart?n Ochoa "Automatic Quantification of Cache Side-Channels" R35 William Harris, Somesh Jha and Thomas Reps "Secure Programming via Visibly Pushdown Safety Games" 11:45 - 11:50: Mini-break 11:50 - 1:05: VERIFICATION AND SYNTHESIS R36 Nishant Sinha, Nimit Singhania, Satish Chandra and Manu Sridharan "Alternate and Learn: Finding witnesses without looking all over" R37 Duc Hiep Chu and Joxan Jaffar "A Complete Method for Symmetry Reduction in Safety Verification" R38 Rishabh Singh and Sumit Gulwani "Synthesizing Number Transformations from Input-Output Examples" 1:00 - 1:15: Conference Wrap-up -------------- next part -------------- An HTML attachment was scrubbed... URL: From gorel at cs.lth.se Tue Jun 19 09:23:35 2012 From: gorel at cs.lth.se (=?iso-8859-1?Q?G=F6rel_Hedin?=) Date: Tue, 19 Jun 2012 15:23:35 +0200 Subject: [TYPES/announce] Second Call for Submissions: SLE 2012 Poster Track and Doctoral Symposium Message-ID: ======================================================================== SECOND CALL FOR SUBMISSIONS to Poster Track and Doctoral Symposium Fifth International Conference on Software Language Engineering (SLE 2012) Sept 25-28, 2012, Dresden, Germany General chair: Uwe Assmann http://planet-sl.org/sle2012 SLE is co-located with GPCE, FOSD, and ITSLE. Call for submissions to Poster Track and the Doctoral Symposium closes July 10. Call for papers to the main track is closed. The 5th International Conference on Software Language Engineering (SLE) is devoted to topics related to artificial languages in software engineering. SLE encourages communication among communities that have traditionally looked at software languages from different and yet complementary perspectives. Of particular relevance to SLE are technologies, methods, experiments, and case studies on software languages from modelware, grammarware and ontologyware perspectives. ======================================================================== POSTER TRACK On-line proceedings Submission deadline: July 10 For the poster track, we solicit short papers of length between 5 and 6 pages in topics of interest to the SLE community, and we encourage authors to report on early work and applications. Poster papers will be evaluated based on novelty and clearness of presentation. Submitted papers must not have been previously published or currently be submitted for publication elsewhere. Authors of accepted short papers will present their posters during a poster session at the conference. Poster track co-chairs: - Dimitris Kolovos, University of York - Anya Helene Bagge, University of Bergen Poster track program committee: - Emilie Balland, INRIA - Laurence Tratt, Middlesex University - Alessandro Rossini, University of Bergen - Pieter Van Gorp, Eindhoven University of Technology - Anne Etien, LIFL - University of Lille 1 - Antonio Cicchetti, M?lardalen University - Louis Rose, University of York - Zinovy Diskin, McMaster University / University of Waterloo ======================================================================== DOCTORAL SYMPOSIUM On-line proceedings Submission deadline: July 10 The International Conference on Software Language Engineering (SLE) aims to bring together the different sub-communities of the software-language-engineering community to foster cross-fertilisation and to strengthen research overall. Within this context the Doctoral Symposium at SLE 2012 contributes towards these goals by providing a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice from researchers both in and out of their particular research area. The main objectives of this event are: - to provide PhD students with an opportunity to write about and present their research - to provide PhD students with constructive feedback on their work from their peers and from established researchers in their own and in different SLE sub-communities - to build bridges for potential research collaboration - to foster integrated thinking about SLE challenges crossing the boundaries between sub-communities - to encourage discussion about research methodology Besides research topics as mentioned in the SLE conference positioning, we explicitly solicit papers that address - unusual cross-domain aspects of software languages, - practical application of software language engineering concepts in real world examples, commercial or non-commercial, or - usage and usability aspects of software languages for non-IT and non-research audience as well. Furthermore, we encourage PhD students to submit papers about research aspects of and connected to software language engineering, even if not explicitly mentioned in the positioning of SLE and doctoral symposium in order to start exchange of such research ideas in the community. Doctoral Symposium co-chairs: - Prof. Dr. Ulrich W. Eisenecker, University of Leipzig - Christian Bucholdt, Credit Suisse AG, Z?rich Doctoral Symposium program committee: - Roberto Lopez Herrejon, Johannes Kepler University of Linz, AT - Michael Haupt, Oracle - Rick Rabiser, Johannes Kepler University of Linz, AT - Zoltan Porkolab, E?tv?s Lor?nd University, HU - Valentino Vranic, University of Technology Bratislava, SK - Sebastian G?nther, Vrije University Brussels, BE - Gunther Saake, University of Magdeburg, DE - Ulrich Breymann, University of Applied Sciences Bremen, DE - Johannes M?ller, University of Leipzig, DE - Christian K?stner, University of Marburg, DE - Mark van den Brand, Eindhoven University of Technology, NL - J?rg Liebig, University of Passau, DE - Jaako J?rvi, Texas A&M University, College Station, USA - Arnaud Hubaux, University of Namur, BE - Steffen Becker, University of Paderborn, DE - Heike Wehrheim, University of Paderborn, DE - David Benavides, University of Seville, ES - Oscar Nierstrasz, University of Bern, CH - Michal Valenta, University of Technology Prague, CZ - Jaroslav Poruban, Technical University of Kosice, SK ======================================================================== SLE TOPICS OF INTEREST 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. For further information, see http://planet-sl.org/sle2012 From brucker at spamfence.net Tue Jun 19 09:42:23 2012 From: brucker at spamfence.net (Achim D. Brucker) Date: Tue, 19 Jun 2012 15:42:23 +0200 Subject: [TYPES/announce] Call for Papers: STVR Special Issue on Tests and Proofs Message-ID: <20120619134223.GA27580@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 eberinge at cs.princeton.edu Tue Jun 19 15:01:11 2012 From: eberinge at cs.princeton.edu ( Lennart Beringer) Date: Tue, 19 Jun 2012 15:01:11 -0400 (EDT) Subject: [TYPES/announce] ITP2012: call for participation In-Reply-To: <1f51a76a-621b-4e79-aa1b-ec1604c813d1@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <8cb04375-4eea-4bc2-b0d8-bf9a05c17541@suckerpunch-mbx-0.CS.Princeton.EDU> Differences to preliminary call: - Registration is now open, for conference and associated workshops - Reservation for student dorm rooms now open (part of registration) - Technical Program now available on the web page ------------------------------------------------------------- 3rd International Conference on Interactive Theorem Proving August 13 - 15, 2012, Princeton, NJ itp2012.cs.princeton.edu with colocated workshops on Coq and Isabelle on August 12th. Registration is now available via the conference web page, including the option to book accommodation in a student dormitory. See below for fees etc. Highlights of the conference: ----------------------------- - Pre-conference reception Sunday, August 12th; open to conference and workshop participants. - Start of technical program: 9am, Monday August 13th - 3 invited speakers: Gilles Barthe (IMDEA Madrid): Computer-aided Cryptographic Proofs Larry Paulson (Cambridge): MetiTarski: Past and Future Andre Platzer (CMU): Differential Dynamic Logic and Differential Invariants for Hybrid Systems - Tutorial on Abella by Andrew Gacek (Rockwell Collins) - 21 technical papers, 4 rough diamonds - Outdoor event: canoeing/kayaking on the Delaware & Raritan Canal - BBQ at the shore of Carnegie Lake - End of conference: around 5pm, Wednesday August 15th - A detailed schedule of presentations is available on the conference web site Associated workshops (August 12): --------------------------------- Isabelle Users Workshop 2012 (www21.in.tum.de/~nipkow/Isabelle2012) The 4th Coq Workshop (coq.inria.fr/coq-workshop/2012) Accommodation options (please see conference web page for details): ------------------------------------------------------------------- - Hotel: Nassau Inn (nassauinn.com): $135pppn + Tax, incl breakfast Booking is under the responsibility of the conference attendees. Please mention "ITP 2012" when making a reservation to obtain the above rate. - Student Dormitory: "Scully Hall": $60pppn incl breakfast. Room reservation is part of conference registration process. Travel (again see conference web page for details): --------------------------------------------------- We strongly recommend flying to/from Newark International Airport (Airport code: EWR). Other airports in the area (JKF, La Guardia, Philadelphia) are possible but significantly less convenient. Conference registration (follow "Registration" link on web page): ------------------------------------------------------------------- Early registration fees (until July 22nd): Workshops only Conference Conference + WS Regular 100$ 350$ 400$ Student 70$ 200$ 250$ Registration after July 22nd: additional USD 50 in each category. The cancellation policy is outlined on the web page. Chairs ------ Andrew Appel, Lennart Beringer, Amy Felty From pierre.clairambault at cl.cam.ac.uk Wed Jun 20 06:02:38 2012 From: pierre.clairambault at cl.cam.ac.uk (Pierre Clairambault) Date: Wed, 20 Jun 2012 11:02:38 +0100 Subject: [TYPES/announce] Post-doctoral position at University of Cambridge Message-ID: <4FE19FBE.9070807@cl.cam.ac.uk> A post-doctoral position is available at the University of Cambridge Computer Laboratory on the European Research Council Advanced Grant ECSYM (Events, Causality and Symmetry---the next generation semantics). The position is initially for one year with the possibility of renewal after that period. The position is for a talented researcher in theoretical computer science or mathematics, with expertise in several of the areas of games and logic, concurrency, category theory, type theory and semantics. Further details on the ECSYM project can be found at http://www.cl.cam.ac.uk/~gw104/ Details on how to apply can be found on http://www.jobs.cam.ac.uk/job/-17842/ Application deadline: *** June 28, 2012 *** From guttman at WPI.EDU Wed Jun 20 11:54:06 2012 From: guttman at WPI.EDU (Joshua D. Guttman) Date: Wed, 20 Jun 2012 11:54:06 -0400 Subject: [TYPES/announce] [cfp] Security track at ACM SAC Message-ID: <86395qq8rl.fsf@GUTTMAN2.CS.WPI.EDU> [ Submissions of full papers and graduate student abstracts are solicited for the ACM SAC security track. 21 Sept deadline. Many of the topics can benefit from language-based and especially types-based approaches. Work of the kind reflected on this mailing list is very welcome. ] SEC at SAC The Security Track at the ACM Symposium on Applied Computing 18-22 March 2013 Coimbra, Portugal For the past twenty-eight years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP http://www.acm.org/sigapp); its proceedings are published by ACM in both printed form and CD-ROM; they are also available on the web through the ACM Digital Library http://www.acm.org/dl. More information about SIGAPP and past editions of SAC can be found at http://www.acm.org/sigapp The Computer Security track (12th edition) The Security Track reaches its twelfth edition this year, thus appearing among the most established tracks in the Symposium. The list of issues remains vast, ranging from protocols to work-flows. Topics of interest include but are not limited to: software security (protocols, operating systems, etc.) hardware security (smartcards, biometric technologies, etc.) mobile security (properties for/from mobile agents, etc.) network security (anti-DoS tools, firewalls, real-time monitoring, mobile networks, sensor networks, etc.) alternatives to cryptography (steganography, etc.) security-specific software development practices (vulnerability testing, fault-injection resilience, etc.) privacy and anonymity (trust management, pseudonymity, identity management, electronic voting, etc.) safety and dependability issues (reliability, survivability, etc.) cyberlaw and cybercrime (copyrights, trademarks, defamation, intellectual property, etc.) security management and usability issues (security configuration, policy management, usability trials etc.) workflow and service security (business processes, web services, etc.) security in cloud computing and virtualised environments Important Dates 21 September 2012, midnight CEST Submission of full papers 10 November 2012 Notification of Acceptance/Rejection 30 November 2012 Camera-Ready copies of accepted papers 18-22 March 2013 SAC 2013 takes place Best Papers The best papers of the 2003 edition are published in a special issue of Concurrency and Computation: Practice and Experience (Wiley) , vol. 16, no.1, 2004. The best papers of the 2004 edition are published in a special issue of the Journal of Computer Security (IOS) , vol. 13, no.5, 2005. The best papers of the 2006 edition are published in a special issue of the Journal of Computer Security (IOS) , vol. 17, no.3, 2009. This practice will be continued on the basis of appropriateness of the submissions. Track Program Chairs Giampaolo BELLA (email: giamp at dmi.unict.it web: http://www.dmi.unict.it/~giamp/) Dipartimento di Matematica e Informatica, Universita' di Catania, Italy. Software Technology Research Laboratory, De Montfort University, UK. Helge JANICKE (email: heljanic at dmu.ac.uk web: http://www.tech.dmu.ac.uk/~heljanic/) Software Technology Research Laboratory, De Montfort University, UK. Graham STEEL (email: graham.steel at lsv.ens-cachan.fr web: http://www.lsv.ens-cachan.fr/~steel/) INRIA, France Program Committee Manuel Barbosa (Universidade do Minho, Portugal) Iliano Cervesato (Carnegie Mellon University, Qatar) David W Chadwick (University of Kent, UK) Steve Chong (Harvard University, USA) Bruce Christianson (University of Hertfordshire, UK) Simon Foley (University College Cork, Ireland) Dieter Gollmann (TU Hamburg, Germany) Stefanos Gritzalis (University of the Aegean, Greece) Joshua Guttmann (Worcester Polytechnic Institute, USA) Lalana Kagal (MIT, USA) Sokratis K Katsikas (University of Piraeus, Greece) Lalana Kagal (MIT, USA) Helmut Kurth (ATSEC, Germany) Gabriele Lenzini (University of Luxembourg) Hannan Lutfiyya (University of Western Ontario, Canada) Jean Martina (Universidade Federal de Santa Catarina, Brasil) John McDermott (Naval Research Lab, USA) Marius Minea (Politehnica University of Timisoara, Romania) Chris Mitchell (Royal Holloway University of London, UK) Dusko Pavlovic (Royal Holloway University of London, UK) Kenneth Radke (Queensland University of Technology, Australia) Alessandro Sorniotti (IBM Research Lab Zurich, Switzerland) Submission Guidelines The submission guidelines must be strictly followed for a paper to be considered. Original papers from the above mentioned or other related areas will be considered. We seek full papers about original and unpublished research. (See also Student research abstracts, below). Parallel submission to other conferences or other tracks of SAC 2013 is forbidden. Each paper must be BLIND in the sense that it must only include its title but not mention anything about its authors. Self-reference must be blind too. All submissions must be formatted using the ACM conference-specific LaTeX style, which can be obtained from the symposium web page. The standard extension of a submission in the stated format is 6 pages. Longer papers (up to 8 pages maximum) will imply an additional charge. All papers must be submitted by 21 September 2012. There is a symposium-wide paper management system for SAC 2013, which authors must use to submit their papers. Review and publication of accepted papers Each paper will be fully refereed and undergo a blind review process by at least three referees. Accepted papers will be published in the ACM SAC 2013 proceedings. Some papers may only be accepted as poster papers, and will be published as extended 2-page abstracts in the proceedings. According to the authors' guidelines, which can be obtained from the symposium web page, at least one author per accepted paper must register before the paper is included in the proceedings. Each accepted paper MUST be presented by an author or a proxy at the venue: this is a requirement for the paper to be part of the ACM/IEEE digital library Student research abstract competition Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. Contact: Giampaolo Bella, giamp at dmi.unict.it -- Joshua D. Guttman WPI, Computer Science From herbert at doc.ic.ac.uk Thu Jun 21 05:05:36 2012 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Thu, 21 Jun 2012 10:05:36 +0100 Subject: [TYPES/announce] CfP: Special Issue of TCS on Quantitative Aspects of Programming Languages, and Systems (QAPL 2011/12) Message-ID: <4FE2E3E0.1090804@doc.ic.ac.uk> [apologies for multiple copies] ------------------------------------------------------------------------- Special Issue of THEORETICAL COMPUTER SCIENCE on Quantitative Aspects of Programming Languages and Systems (QAPL 2011/12) ------------------------------------------------------------------------- ******************************** CALL FOR PAPERS ******************************** We invite the submission of papers on Quantitative Aspects of Programming Languages and Systems for publication in a special issue of the Journal of Theoretical Computer Science (TCS). In particular we welcome papers which are revised versions of the submitted to and presented at the QAPL 2011 Workshop in Saarbruecken and QAPL 2012 in Tallinn. We will additionally also welcome submissions of papers not presented at QAPL, provided they fall into the scope of the call. ------------------------------------------------------------------------- SCOPE ------------------------------------------------------------------------- Quantitative aspects of computation are important and sometimes essential in characterising the behaviour and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, risk and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. This special issue will be devoted to research papers which discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, contributions should focus on * the design of probabilistic and real-time languages and the definition of semantical models for such languages; * the discussion of methodologies for the analysis of probabilistic 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. * the investigation of computational models and paradigms involving quantitative aspects, such as those arising in quantum computation, systems biology, bioinformatics, etc. ------------------------------------------------------------------------- TOPICS ------------------------------------------------------------------------- Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, language expressiveness, quantitative language extension, semantics, logic, verification, automated reasoning, testing, model-checking, program analysis, performance analysis, resource analysis, safety, security and protocol analysis, risk and hazard analysis, for biological systems, quantum languages, information systems, multi-tasking and multi-core systems, time-critical systems, embedded systems, coordination models, scheduling theory, distributed systems, concurrent systems, etc. ------------------------------------------------------------------------- SUBMISSION ------------------------------------------------------------------------- Papers should be 20-25 pages long, including appendices, and should be formatted according to Elsevier's elsart document style used for articles in the Journal of Theoretical Computer Science (see the Guide for Authors at http://ees.elsevier.com/tcs). http://support.elsevier.com/ Submissions are through the Elsevier Editorial System for TCS located at http://ees.elsevier.com/tcs/default.asp. To ensure that all manuscripts are correctly identified for inclusion into the special issue, please make sure you select/specify "SI:TCS_B QAPL 2011/12" when you reach the step in the submission process. ------------------------------------------------------------------------- IMPORTANT DATES ------------------------------------------------------------------------- * Paper submission: 15 August 2012 * Notification: 30 November 2012 ------------------------------------------------------------------------- EDITORS ------------------------------------------------------------------------- Gethin Norman University of Glasgow, UK gethin at dcs.gla.ac.uk Mieke Massink CNR-ISTI, Pisa, Italy mieke.massink at isti.cnr.it Herbert Wiklicky Imperial College London, UK herbert at doc.ic.ac.uk ------------------------------------------------------------------------- Further information at http://www.dcs.gla.ac.uk/qapl11/special_issue.html From pedro.adao at ist.utl.pt Thu Jun 21 09:19:52 2012 From: pedro.adao at ist.utl.pt (=?iso-8859-1?Q?Pedro_Ad=E3o?=) Date: Thu, 21 Jun 2012 14:19:52 +0100 Subject: [TYPES/announce] PostDoc position at Instituto de Telecomunicacoes/IST, Lisboa Message-ID: <41E56937-F70E-4165-AE42-7063194EEC56@ist.utl.pt> (Apologies for multiple copies) Applications are invited for - one PostDoc position (DEADLINE 4/July/2012) within the Security and Quantum Information Group (SQIG) of Instituto de Telecomunicacoes (IT), Lisboa, Portugal. This position is 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 PhD in Mathematic or Computer Science. The ideal candidate will have interests in logics, complexity, and probabilities. This position includes NO teaching duties and the starting date can be as early as August 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 rseba at disi.unitn.it Fri Jun 22 16:08:38 2012 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Fri, 22 Jun 2012 22:08:38 +0200 Subject: [TYPES/announce] Postdoc positions in SAT/SMT-based Verification available in Trento Message-ID: <20120622200838.GA26101@disi.unitn.it> --------------------------------------------------------------------------- [[[ We apologize if you receive multiple copies of this message ]]] --------------------------------------------------------------------------- -------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK INTERESTED. -------------------------------------------------------------- One post-doc position in ICT on the research project "Advanced SMT Techniques for Word-level Formal Verification - (WOLF)" is available in Trento, Italy, under the joint supervision of - Alessandro Cimatti, FBK, Trento, and - Roberto Sebastiani, DISI, University of Trento. The research activity will be carried out jointly within the Embedded Systems (ES) Research Unit of the Center for Scientific and Technological Research of the Fondazione Bruno Kessler (FBK), Trento, and the Software Engineering, Formal Methods & Security Research Program, at Department of Information Engineering and Computer Science (DISI) of University of Trento. Aim and Scope ============= The research activity will aim at investigating and developing novel techniques, methodologies and support tools for Satisfiability Modulo Theories (SMT) for the formal verification of systems. This work will be part of the "Advanced SMT Techniques for Word-level Formal Verification - (WOLF)" project, a three-year research project supported by SRC/GRC (http://www.src.org/compete/s201113/), in strict collaboration with the Formal Verification Group at Intel, Haifa, and other major HW companies. The ultimate goal of the WOLF project is to provide a comprehensive SMT package to support effective formal verification of systems ranging from RTL circuits all the way up to high-level hardware description languages (e.g. SystemC) and software. The package will be implemented on top of the MathSAT SMT platform (http://mathsat.fbk.eu/), and provided as an API. Candidate Profile ================= The ideal candidate should have an PhD in computer science or related discipline, and combine solid theoretical background and excellent software development skills (in particular C/C++). A solid background knowledge and/or previous experience on Satisfiability Modulo Theory (SMT) and/or Propositional Satisfiability (SAT) is required. Previous experience in the following areas will also be considered favourably: Model Checking, Automated Reasoning, Constraint Solving and Optimization, Embedded Systems Design Languages (e.g. Verilog, VHDL). The candidate should be able to work in a collaborative environment, with a strong committment to reaching research excellence and achieving assigned objectives. Terms and dates =============== The position will start as soon as possible, and will have to be renewed yearly, for a maximum of three years. The expected salary will range from about 2200 to 2400 euros net income, and the gross will include previdential (social security) contributions. Facilities for meals at the local canteen can be provided. Applications and Inquiries ========================== Interested candidates should inquire for further information and/or apply by sending email to wolf-recruit at disi.unitn.it, with subject 'POSTDOC ON WOLF PROJECT'. Applications should contain a statement of interest, with a Curriculum Vitae, and the names of reference persons. PDF format is strongly encouraged. It should also indicate an estimated starting date. Contact Persons =============== Dr. ALESSANDRO CIMATTI, Embedded Systems Research Unit, FBK-Irst, via Sommarive 18, I-38123 Povo, Trento, Italy http://sra.fbk.eu/people/cimatti/, Prof. ROBERTO SEBASTIANI Software Engineering, Formal Methods & Security Research Program DISI, University of Trento, via Sommarive 14, I-38123 Povo, Trento, Italy http://disi.unitn.it/~rseba/. ======================================================================= The Embedded Systems Research Unit at FBK ========================================= The Embedded Systems Unit consists of about 15 persons, including researchers, post-Doc, Ph.D. students, and programmers. The Unit carries out research, tool development and technology transfer in the fields of design and verification of embedded systems. Current research directions include: * Satisfiability Modulo Theory, and its application to the verification of hardware, embedded critical software, and hybrid systems (Verilog, SystemC, C/C++, StateFlow/Simulink). * Formal Requirements Analysis based on techniques for temporal logics (consistency checking, vacuity detection, input determinism, cause-effect analysis, realizability and synthesis). * Formal Safety Analysis, based on the integration of traditional techniques (e.g. Fault-tree analysis, FMEA) with symbolic verification techniques. The Embedded Systems Unit is part of Fondazione Bruno Kessler, formerly Istituto Trentino di Cultura, a public research institute of the Autonomous Province of Trento (Italy), founded in 1976. The institute, through its center for the scientific and technological research, is active in the areas of Information Technology, Microsystems, and Physical Chemistry of Surfaces and Interfaces. Today, FBK is an internationally recognized research institute, collaborating with industries, universities, and public and private laboratories in Italy and abroad. The institute's applied and basic research activities aim at resolving real-world problems, driven by the need for technological innovation in society and industry. The SW Engineering, Formal Methods & Security Research Program at DISI ====================================================================== The SW Engineering, Formal Methods & Security R. P. at DISI currently consists on 5 faculties, various post-docs and PhD students. The Unit carries out research, tool development and technology transfer in the fields of Goal-Oriented Requirements Engineering, Agent-oriented SW engineering, Security, and Formal Methods. Referring to formal methods, current research directions include: * Satisfiability Modulo Theory, and its application to the verification of hardware, embedded critical software, and hybrid systems. * Optimization in SMT and its applications. * Advanced Model Checking Techniques for Formal Verification of hardware, embedded critical software, and hybrid systems. The R.P. is part of the Department of Information Engineering and Computer Science, DISI (http://disi.unitn.it/) of University of Trento. University of Trento in the latest years has always been rated among the top-three small&medium-size universities in Italy. DISI currently consists of 50 faculties, 68 research staff and support people, 21 postdocs and 146 Doctoral students, plus administrative and technical staff. DISI covers all the different areas of information technology (computer science, telecommunications, and electronics) and their applications. These disciplines above are studied individually but also with a strong focus on their integration, Location ======== Trento is a lively town of about 100.000 inhabitants, located 130 km south of the border between Italy and Austria. It is well known for the beauty of its mountains and lakes, and it offers the possibility to practice a wide range of sports. Trento enjoys a rich cultural and historical heritage, and it is the ideal starting point for day trips to famous towns such as Venice or Verona, as well as to enjoy great naturalistic journeys. Detailed information about Trento and its region can be found at http://www.trentino.to/home/index.html?_lang=en. From cav2012.publicity.chair at gmail.com Sat Jun 23 08:49:46 2012 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Sat, 23 Jun 2012 08:49:46 -0400 Subject: [TYPES/announce] *** Early Registration Ends Monday 6/25 *** CAV 2012: Call For Participation Message-ID: *** EARLY REGISTRATION ENDS MONDAY 6/25 *** ====== CALL FOR PARTICIPATION ================================================== 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. ** 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) Invited Talks -------------------------------------------------------------------------------- - Wolfgang Thomas, RWTH Aachen University "Synthesis and Some of Its Challenges" - David Dill, Stanford University "Model Checking Cell Biology" - Alex Haldermann, University of Michigan On security of voting machines Invited Tutorials -------------------------------------------------------------------------------- - Rastislav Bodik and Emina Torlak, University of California, Berkeley "Synthesizing Programs with Constraint Solvers" - Aaron Bradley, University of Colorado at Boulder "IC3 and Beyond: Incremental, Inductive Verification" - Chris Myers, University of Utah "Formal Verification of Genetic Circuits" - Micha? Moskal, Microsoft Research, Seattle "From C to infinity and back: Unbounded auto-active verification with VCC" ====== CONFERENCE PROGRAM ====================================================== Saturday July 7 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - LfSA 2012 Logics for System Analysis Co-chairs: Andr? Platzer, Philipp R?mmer Sunday July 8 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - BOOGIE 2012 2nd International Workshop on Intermediate Verification Languages Chair: Zvonimir Rakamaric - REORDER 2012 First International Workshop on Memory Consistency Models Co-chairs: Sela Mador-Haim, Jade Alglave Monday July 9 - INVITED TUTORIALS ---------------------------------------- 8:30 - 10:00: "Synthesizing Programs with Constraint Solvers" (Ras Bodik and Emina Torlak) 10:00 - 10:30: Break 10:30 - 12:00: "IC3 and Beyond: Incremental, Inductive Verification" (Aaron Bradley) 12:00 - 1:30: Break 1:30 - 3:00: "Formal Verification of Genetic Circuits" (Chris Myers) 3:00 - 3:30: Break 3:30 - 5:00: "From C to infinity and back: Unbounded auto-active verification with VCC" (Michal Moskal) Tuesday July 10 ---------------------------------------- 8:30 - 9:00: Welcome 9:00 - 10:00: "Synthesis and Some of Its Challenges" (Wolfgang Thomas - Keynote) 10:00 - 10:30: Break 10:30 - 12:00: AUTOMATA AND SYNTHESIS R1 Jan Kretinsky and Javier Esparza "Deterministic Automata for the (F,G)-fragment of LTL" R2 Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny "Efficient Controller Synthesis for Consumption Games with Multiple Resource Types" R3 R?diger Ehlers "ACTL ? LTL Synthesis" T1 Fran?ois Raskin "Acacia+, a tool for LTL synthesis" T2 Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl and Alois Knoll "MGSyn: Automatic Synthesis for Industrial Automation" 12:00 - 1:30: Break 1:30 - 3:35: INDUCTIVE INFERENCE AND TERMINATION R4 Yu-Fang Chen and Bow-Yaw Wang "Learning Boolean Functions Incrementally" R5 Rahul Sharma, Aditya Nori and Alex Aiken "Interpolants as Classifiers" R6 Wonchan Lee, Bow-Yaw Wang and Kwangkeun Yi "Termination Analysis with Algorithmic Learning" R7 Marc Brockschmidt, Richard Musiol, Carsten Otto and J?rgen Giesl "Automated Termination Proofs for Java Programs with Cyclic Data" R8 Javier Esparza, Andreas Gaiser and Stefan Kiefer "Proving Termination of Probabilistic Programs Using Patterns" 3:35 - 4:00: Break 4:00 - 6:05: ABSTRACTION R9 Arnaud Venet "The Gauge Domain: Scalable Analysis of Linear Inequality Invariants" R10 Josh Berdine, Arlen Cox, Samin Ishtiaq and Christoph Wintersteiger "Diagnosing Abstraction Failure for Separation Logic-based Analyses" R11 Aditya Thakur and Thomas Reps "A Method for Symbolic Computation of Abstract Operations" R12 Simone Fulvio Rollini, Ondrej Sery and Natasha Sharygina "Leveraging Interpolant Strength in Model Checking" T3 Evan Driscoll, Aditya Thakur and Thomas Reps "OpenNWA: A Nested Word Automaton Library" T4 Aws Albarghouthi, Yi Li, Arie Gurfinkel and Marsha Chechik "UFO: A Framework for Abstraction- and Interpolation-Based Verification" T5 Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina "SAFARI: SMT-based Abstraction For Arrays with Interpolants" 6:30 - 8:30: PC dinner Wednesday July 11 ---------------------------------------- 8:35 - 10:35: CONCURRENCY & SOFTWARE VERIFICATION R13 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi and Akash Lal "Detecting Fair Non-Termination in Multithreaded Programs" R14 Vineet Kahlon and Chao Wang "Lock Removal for Concurrent Trace Programs" R15 Gerhard Schellhorn, John Derrick and Heike Wehrheim "How to prove algorithms linearisable" R16 Anthony Widjaja Lin and Matthew Hague "Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters" R17 Alessandro Cimatti and Alberto Griggio "Software Model Checking via IC3" 10:35 - 11:00: Break 11:00 - 12:00: "Model Checking Cell Biology" (David Dill - Keynote) 12:00 - 1:30: Lunch 1:30 - 3:00: BIOLOGY & PROBABILISTIC SYSTEMS R18 Calin Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu and Ali Sezgin "Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits" R19 Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke "Assume-Guarantee Abstraction Refinement for Probabilistic Systems" R20 Cyrille Jegourel, Axel Legay and Sean Sedwards "Cross entropy optimisation of importance sampling parameters for statistical model checking" T6 David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex Taylor and Moshe Vardi "Ripple: Visual Tool for Modeling and Analysis of Biological Networks" T7 Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Bj?rn Wachter and James Worrell "APEX: An analyzer for open probabilistic programs" 3:30 - 4:00: Break 4:00 - 5:30: *EMBEDDED AND CONTROL SYSTEMS* - special track session R21 Adiya Zutshi, Sriram Sankaranarayanan and Ashish Tiwari "Timed Relational Abstractions For Sampled Data Control Systems" R22 Rupak Majumdar and Majid Zamani "Approximately Bisimilar Symbolic Models for Digital Control Systems" R23 Alessandro Cimatti, Raffaele Corvino, Armando Lazzaro, Iman Narasamdya, Tiziana Rizzo, Marco Roveri, Angela Sanseviero and Andrei Tchaltsev "Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System" T8 Philip Armstrong, Joel Ouaknine, Hristina Palikareva and Bill Roscoe "Recent Developments in FDR" T9 Songzheng Song, Jun Sun, Yang Liu and Jin Song Dong "A Model Checker for Hierarchical Probabilistic Real-time Systems" 6:00 - 9:30: Banquet Thursday July 12 ---------------------------------------- 8:30 - 10:00: *SAT/SMT SOLVING AND SMT-BASED VERIFICATION* - special track session R24 Isil Dillig, Thomas Dillig, Kenneth McMillan and Alex Aiken "Minimum Satisfying Assignments for SMT" R25 Cheng-Shen Han and Jie-Hong Roland Jiang "When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way" R26 Akash Lal, Shaz Qadeer and Shuvendu Lahiri "Corral: A Solver for Reachability Modulo Theories" T10 Shuvendu Lahiri, Chris Hawblitzel, Ming Kawaguchi and Henrique Reb?lo "SymDiff: A language-agnostic semantic diff tool" T11 Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout and Fatiha Zaidi "Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems" 10:00 - 10:30: Break 10:30 - 12:00: *TIMED & HYBRID SYSTEMS* - special track session R27 Shibashis Guha, Chinmay Narayan and S. Arun-Kumar "On Decidability of Prebisimulation for Timed Automata" R28 Ichiro Hasuo and Kohei Suenaga "Exercises in Nonstandard Static Analysis of Hybrid Systems" R29 Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle "A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx" T12 Ashish Tiwari "HybridSal Relational Abstracter" T13 Swarat Chaudhuri and Armando Solar-Lezama "Euler: A System for Numerical Optimization of Programs" 12:00 - 1:30: Lunch 1:30 - 2:45: *HARDWARE VERIFICATION* - special track session R30 Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Scott Owens, Jade Alglave, Kayvan Memarian, Rajeev Alur, Milo Martin, Peter Sewell and Derek Williams "An Axiomatic Memory Model for Power Multiprocessors" R31 Flavio M de Paula, Alan Hu and Amir Nahir "nuTAB-BackSpace: Rewriting to Normalize Non-Determinism in Post-Silicon Debug Traces" R32 Zyad Hassan, Aaron Bradley and Fabio Somenzi "Incremental Inductive CTL Model Checking" 2:45 - 3:35: Miscellaneous Tools T14 Rishabh Singh and Armando Solar-Lezama "SPT : Storyboard Programming Tool" T15 Patrick Rondon, Ming Kawaguchi, Alexander Bakst and Ranjit Jhala "CSolve: Verifying C With Liquid Types" T16 Daniel Schwartz-Narbonne, Feng Liu, David August and Sharad Malik "PASSERT: A tool for debugging parallel programs" T17 Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas and Andrew E. Santosa "TRACER: A Symbolic Execution Tool for Verification" T18 Stephan Arlt and Martin Sch?f "Joogie: Infeasible Code Detection for Java" T19 David Hopkins, Andrzej Murawski and Luke Ong "Hector: An Equivalence Checker for a Higher-Order Fragment of ML" T20 Jan Hoffmann, Klaus Aehlig and Martin Hofmann "Resource Aware ML" 3:35 - 4:00: Break 4:00 - 5:30: Tool demo/poster session 5:30 - 6:30: CAV business meeting 6:30 - 9:00: SC dinner Friday July 13 ---------------------------------------- 9:00 - 10:00: On security of voting machines (Alex Haldermann - Invited talk) 10:00 - 10:30: Break 10:30 - 11:45: *SECURITY* - special track session R33 Matt Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassen Saidi and Vinod Yegneswaran "Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement" R34 Boris K?pf, Laurent Mauborgne and Mart?n Ochoa "Automatic Quantification of Cache Side-Channels" R35 William Harris, Somesh Jha and Thomas Reps "Secure Programming via Visibly Pushdown Safety Games" 11:45 - 11:50: Mini-break 11:50 - 1:05: VERIFICATION AND SYNTHESIS R36 Nishant Sinha, Nimit Singhania, Satish Chandra and Manu Sridharan "Alternate and Learn: Finding witnesses without looking all over" R37 Duc Hiep Chu and Joxan Jaffar "A Complete Method for Symmetry Reduction in Safety Verification" R38 Rishabh Singh and Sumit Gulwani "Synthesizing Number Transformations from Input-Output Examples" 1:00 - 1:15: Conference Wrap-up -------------- next part -------------- An HTML attachment was scrubbed... URL: From flaviomoura at unb.br Sun Jun 24 21:58:12 2012 From: flaviomoura at unb.br (Flavio L. C. de Moura) Date: Sun, 24 Jun 2012 22:58:12 -0300 Subject: [TYPES/announce] SCSS 2012 CFP Extended deadline! Message-ID: <26F75F6A-DD52-418E-84EE-034462788D33@unb.br> SCSS 2012 CFP Extended deadline! 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: August 23, 2012: Paper title and abstract deadline August 30, 2012: Full paper deadline (firm) October 30, 2012: Author notification November 30, 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. -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Mon Jun 25 03:14:08 2012 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Mon, 25 Jun 2012 09:14:08 +0200 Subject: [TYPES/announce] ICFP Student Research Competition Message-ID: ===================================================================== Student Research Competition Associated with the The 17th ACM SIGPLAN International Conference on Functional Programming (ICFP 2012) and affiliated events http://www.icfpconference.org/icfp2012/src.html Copenhagen, Denmark, Sep 9-15, 2012 ===================================================================== This year ICFP will host a Student Research Competition where undergraduate and postgraduate students can present posters. The SRC at the ICFP 2012 consists of three rounds: - Extended abstract round: All students are encouraged to submit an extended abstract outlining their research (800 words). - Poster session at ICFP 2012: Based on the abstracts, a panel of judges will select the most promising entrants to participate in the poster session which will take place at ICFP. Students who make it to this round will be supported to attend the conference, to a maximum of $500 for travel and housing. If your total costs are higher than these $500 your conference fee may be waived too. In the poster session, students will have the opportunity to present their work to the judges, who will select three finalists in each category* (graduate/undergraduate) to advance to the next round. - ICFP presentation: The next round consists of an oral presentation at the ICFP to compete for the final awards in each category. ** Prizes ** Both the top three graduate and the top three undergraduate contestants will receive prizes of $500, $300, and $200, respectively. All six winners will receive award medals and a two-year complimentary ACM student membership, including a subscription to ACM?s Digital Library. The names of the winners will be posted on the SRC web site. The winners in each category will be invited to participate in the ACM SRC Grand Finals, an on-line round of competitions among the winners of other conference-hosted SRCs. Grand Finalists and their advisors will be invited to the Annual ACM Awards Banquet for an all-expenses-paid trip, where they will be recognized for their accomplishments along with other prestigious ACM award winners, including the winner of the Turing Award (also known as the Nobel Prize of Computing). The top three graduate Grand Finalists will receive an additional $500, $300, and $200. Likewise, the top three undergraduate Grand Finalists will receive an additional $500, $300, and $200. All six Grand Finalists will receive Grand Finalist certificates. ** Eligibility ** The SRC is open to both undergraduate and graduate students. Upon submission, entrants must be enrolled as a student at their university. The abstract must describe the student?s individual research and must be authored solely by the student. If the work is collaborative with others and/or part of a larger group project, the abstract should make clear what the student?s role was and should focus on that portion of the work. The extended abstract must not exceed 800 words and must not be longer than 2 pages. The reference list does not count towards these limits. To submit an abstract, please register through the submission page and follow the instructions. Abstracts submitted after the deadline may be considered at the committee's discretion, but only after decisions have been made on all abstracts submitted before the deadline. If you have any problems, don't hesitate to contact the competition chair. More information about the submission process can be found online at: http://www.icfpconference.org/icfp2012/src.html ** Important Dates ** Deadline for submission: June 29th Notification of acceptance: July 8th ** Selection Committee ** Koen Claessen, Chalmers University of Technology Robby Findler (ICFP Program chair), Northwestern University Ken Friis Larsen, IT University of Copenhangen Jacques Garrigue, Nagoya University Doaitse Swierstra (Chair), Utrecht University From sslf12 at info.uaic.ro Tue Jun 26 14:34:45 2012 From: sslf12 at info.uaic.ro (SSLF 2012) Date: Tue, 26 Jun 2012 13:34:45 -0500 Subject: [TYPES/announce] Programming Language Frameworks Message-ID: <201206261834.q5QIVq1W020147@fsl3.cs.uiuc.edu> Summer School on Language Frameworks Sinaia, Romania, July 23-31, 2012. https://fmse.info.uaic.ro/events/SSLF12/ This nine-day summer school is dedicated to investigating six state-of-the-art programming language definitional frameworks, at a relaxed pace, by means of tutorials, hands-on projects, and plenty of discussions in a picturesque place in the Carpathian Mountains (alphabetically): K (http://k-framework.org/) Presenter: Grigore Rosu (http://fsl.cs.uiuc.edu/~grosu) Maude (http://maude.cs.uiuc.edu/) Presenter: Jose Meseguer (http://formal.cs.uiuc.edu/meseguer/) PLanCompS (http://www.plancomps.org/) Presenter: Peter Mosses (http://www.cs.swan.ac.uk/~cspdm/) Rascal (http://www.rascal-mpl.org/) Presenter: Paul Klint (http://www.rascal-mpl.org/) Redex (http://redex.racket-lang.org/) Presenter: Robby Findler (http://www.eecs.northwestern.edu/~robby/) Spoofax (http://spoofax.org/) Presenters: Eelco Visser (http://swerl.tudelft.nl/bin/view/EelcoVisser) Guido Wachsmuth (http://www.linkedin.com/in/guidowachsmuth) Please visit https://fmse.info.uaic.ro/events/SSLF12/ for details and registration. The number of participants is limited. From mehrs at cs.ox.ac.uk Tue Jun 26 17:14:14 2012 From: mehrs at cs.ox.ac.uk (Mehrnoosh Sadrzadeh) Date: Tue, 26 Jun 2012 22:14:14 +0100 Subject: [TYPES/announce] advertising a logic-application postdoc at CS Oxford In-Reply-To: References: Message-ID: > Postdoctoral Research Assistant - Logic for Autonomous Systems > Department of Computer Science, University of Oxford > > Salary in range ?29,249-?35,938 per annum (grade 7) > > The Department of Computer Science of University of Oxford seeks a > postdoctoral researcher to work on a 3-year EPSRC project entitled > `New Foundational Structures for Engineering Multi-UAV Protocols'. > > This interdisciplinary project aims to verify autonomous Unmanned > Aerial Vehicles (UAV's) that not only navigate, but also communicate > with each other. The project aims to span the full verification > lifecycle: from high-level logical specifications, to oracle-based > test-set reasoning through a bounded model checker, to low-level code > on our four Pelican UAVs. > > The position requires a researcher with a proven track record of > high-quality research in logic and its applications - of particular > relevance are formalisms such as: > > - Modal and Epistemic Logics > - Dynamic Program Logics > - Probabilistic and Fuzzy logics > > Preference will be given to researchers with experience in modelling > and reasoning about epistemic properties of protocols of communicative > Multi-Agent Systems. > > The researcher will work closely with Dr Mehrnoosh Sadrzadeh and > Professor Michael Wooldridge, and will also be expected to interact > with Professor Daniel Kroening and his team working on the UAV and > verification aspects of the project in order to derive requirements > and case studies. > > Informal enquiries are welcome, and should be directed to > Dr Sadrzadeh (mailto:Mehrnoosh.Sadrzadeh at cs.ox.ac.uk). > > This post is a full-time appointment, and is available for up to 3 > years. > > Closing date for applications: **12 noon on Monday 30 July 2012** -------------- next part -------------- An HTML attachment was scrubbed... URL: From Maribel.Fernandez at kcl.ac.uk Wed Jun 27 03:15:19 2012 From: Maribel.Fernandez at kcl.ac.uk (Maribel Fernandez) Date: Wed, 27 Jun 2012 08:15:19 +0100 Subject: [TYPES/announce] positions at King's College London Message-ID: <4FEAB307.9050602@kcl.ac.uk> Dear All, there are several vacancies at King's College London (lectureships and professorships). Some of them are in the area of "Software Modelling and Applied Logic", and might be of interest to members of this list. More details can be found at http://www.kcl.ac.uk/nms/depts/informatics/people/vacancies.aspx Thanks, and best wishes Maribel -- Professor Maribel Fernandez King's College London Department of Informatics Software Modelling and Applied Logic group www.dcs.kcl.ac.uk/staff/maribel From Gethin.Norman at glasgow.ac.uk Wed Jun 27 04:39:32 2012 From: Gethin.Norman at glasgow.ac.uk (Gethin Norman) Date: Wed, 27 Jun 2012 09:39:32 +0100 Subject: [TYPES/announce] Call for Participation & Posters - Joint Workshop on Compositional Modelling & Analysis of Quantitative Systems Message-ID: <219438BB-D5B7-4233-80FF-8FECCB7D3BFC@glasgow.ac.uk> ************ CALL FOR PARTICIPATION AND POSTERS ************ Joint Workshop on Compositional Modelling and Analysis of Quantitative Systems University of Edinburgh, 8 September 2012 http://workshops.inf.ed.ac.uk/mlqa2012/ The workshop combines - the fourth annual meeting of the ERCIM Working Group on Models and Logics for Quantitative Analysis (MLQA) http://wiki.ercim.eu/wg/MLQA - a SICSA Modelling and Abstraction Theme event http://www.sicsa.ac.uk/themes/modelling-and-abstraction The theme of the workshop is Compositional Modelling and Analysis of Quantitative Systems. Compositionality is a key concept in both the modeling and analysis of computer systems. It is only by decomposing large complex system into smaller pieces, we can build and analyse these systems. The aim of the workshop is to bring together researchers working on quantitative modelling and analysis of computer systems focusing on research using compositional techniques. The workshop hopes to encourage interaction and collaboration between the attendees in developing compositional approaches. The workshop will bring together MLQA participants from across Europe with contributors to the SICSA theme of 'Modelling and Abstraction'. However, participation from outside MLQA and the SICSA theme are also welcome. The workshop will take place immediately following the CONCUR International Conference taking place in Newcastle-upon-Tyne 4-7th September 2012. (Edinburgh is approximately 90 minutes from Newcastle by train.) INVITED SPEAKERS - Pedro D'Argenio, FaMAF, Universidad Nacional de Cordoba Security analysis in probabilistic distributed protocols via bounded reachability - Andrea Marin, Universita di Venezia Compositional model specifications and analyses via product-forms - Jaco van de Pol, University of Twente Symbolic Manipulation of Markov Automata - Mirco Tribastone, Ludwig-Maximilians-Universit?t M?nchen Exact Aggregation for Fluid Process Algebra Models POSTERS We invited posters under two categories: - presentation of recent or on-going work in relation to the themes of MLQA: - overview of the recent research activities of a research group related to the themes of MLQA. We equally encourage submissions from both research leaders, junior researchers and PhD students. Posters should be printed by the participants in their preferred size. Notification of your intention to submit, along with a title and short description of the poster, should be sent by August 31 to gethin.norman at glasgow.ac.uk. ORGANISERS Jane Hilston, University of Edinburgh Gethin Norman, University of Glasgow REGISTRATION, ACCOMMODATION and TRAVEL Registration will be at a cost of ?25. Registration is free for members of SICSA institutions. Further details are available from the workshop website: http://workshops.inf.ed.ac.uk/mlqa2012/ The University of Glasgow, charity number SC004401 From alastair.donaldson at imperial.ac.uk Wed Jun 27 07:52:50 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Wed, 27 Jun 2012 12:52:50 +0100 Subject: [TYPES/announce] Call for Participation: SPIN 2012 - 19th International SPIN Workshop on Model Checking Software In-Reply-To: <4FC28A77.6050208@imperial.ac.uk> References: <4F057DD1.5090601@imperial.ac.uk> <4F4E4F58.7090102@imperial.ac.uk> <4F69BA5E.5080100@imperial.ac.uk> <4FC28A77.6050208@imperial.ac.uk> Message-ID: <4FEAF412.1040507@imperial.ac.uk> Apologies for multiple copies. 19th International SPIN Workshop on Model Checking of Software Oxford, 23-24 July 2012 ================ For the full programme, and to register, visit: http://qav.cs.ox.ac.uk/spin2012 EARLY REGISTRATION closes 22 June ================ Invited speakers ================ * Tom Ball, Microsoft Research, Redmond. Beyond First-order Satisfaction: Fixed points, Interpolants, Automata and Polynomials. * Andrey Rybalchenko, TU Munich. Towards Automatic Synthesis of Software Verification Tools * Andreas Zeller, Saarland University. Mining Models ================ Invited tutorial ================ * Cristian Cadar, Imperial College London. How to Crash Your Code using Dynamic Symbolic Execution ============== Regular papers ============== * Gerard Holzmann. Parallelizing the Spin Model Checker * Ethan Burns and Rong Zhou. Parallel Model Checking using Abstraction * Alexander Ditter, Milan Ceska and Gerald L?ttgen. On Parallel Software Verification using Boolean Equation Systems * Anton J. Wijs and Dragan Bosnacki. Improving GPU Sparse Matrix-Vector Multiplication for Probabilistic Model Checking * Stefan Leue and Mitra Tabaei Befrouei. Counterexample Explanation by Anomaly Detection * Sami Evangelista and Lars Kristensen. Combining the Sweep-Line Method with the use of an External-memory Priority Queue * Hao Zheng, Emmanuel Rodriguez, Yingying Zhang and Chris Myers. A compositional Minimization Approach for Large Asynchronous Design Verification * Theo Ruys and Pim Kars. Gossiping Girls Are All Alike * Shravan Garlapati and Sandeep Shukla. Formal Verification of Hierarchically Distributed Agent Based Protection Scheme in Smart Grid * Reng Zeng, Zhuo Sun, Su Liu and Xudong He. McPatom: A Predictive Analysis Tool for Atomicity Violation using Model Checking * Divjyot Sethi, Murali Talupur, Sharad Malik and Daniel Schwartz-Narbonne. Parameterized Model Checking of Fine Grained Concurrency =========== Tool papers =========== * Jonathan Bogdoll, Alexandre David, Arnd Hartmanns and Holger Hermanns. mctau: Bridging the Gap between Modest and UPPAAL * Heinz Riener and Goerschwin Fey. FAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation * Martin Sulzmann and Axel Zechner. Model Checking DSL-Generated C Source Code * Juergen Christ, Jochen Hoenicke and Alexander Nutz. SMTInterpol ? An Interpolating SMT Solver * Yong Jiang and Zongyan Qiu. S2N: Model Transformation from SPIN to NuSMV ======== Sponsors ======== * ARM (http://www.arm.com) * Codeplay Software (http://www.codeplay.com) * Microsoft Research (http://research.microsoft.com/en-us) * Monoidics (http://www.monoidics.com) -------------- next part -------------- An HTML attachment was scrubbed... URL: From deligu at di.unito.it Wed Jun 27 11:48:08 2012 From: deligu at di.unito.it (Ugo de' Liguoro) Date: Wed, 27 Jun 2012 17:48:08 +0200 Subject: [TYPES/announce] CL&C 2012 - Call for participation Message-ID: <4FEB2B38.5060209@di.unito.it> ************ CALL FOR PARTICIPATION ************ CL&C'12 - ICALP'12 Workshop Fourth International Workshop on Classical Logic and Computation July 8, 2012, Warwick - England http://www.doc.ic.ac.uk/~svb/CLaC12/ 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. The fact that classical mathematical proofs of simply existential statements can be read as programs was established by Goedel and Kreisel half a century ago. But the possibility of extracting useful computational content from classical proofs was taken seriously only from the 1990s on when it was discovered that proof interpretations based on Goedel's and Kreisel's ideas can provide new nontrivial algorithms and numerical results, and the Curry-Howard correspondence can be extended to classical logic via programming concepts such as continuations and control operators. CL&C is focused on 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. Contributed papers: F. Aschieri, M. Zorzi: "Eliminating Skolem functions in Pano arithmetic with interactive realizability" R. Krebbers: "A call-by-value lambda-calculus with lists and control" K. Nakazawa, S.-Y. Katsumata: "Extensional Models of Untyped Lambda-Mu Calculus" T. Powel: "Applying Goedel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma" Short presentations: G. Birolo: "A simple geometric example of interactive realizability" H. Eades: "Hereditary Substitution for the Lambda-Mu Calculus" S. Sanders: "Nonstandard Analysis: a New Vay to Compute (Constructively)" Invited speaker: Paulo Oliva -------------- next part -------------- An HTML attachment was scrubbed... URL: From frederic.loulergue at univ-orleans.fr Wed Jun 27 13:38:31 2012 From: frederic.loulergue at univ-orleans.fr (=?ISO-8859-1?Q?Fr=E9d=E9ric_Loulergue?=) Date: Wed, 27 Jun 2012 19:38:31 +0200 Subject: [TYPES/announce] Post-Doctoral Researcher Position at LIFO, Orleans, France Message-ID: <4FEB4517.5050700@univ-orleans.fr> One postdoctoral researcher position in the "Parallel Program Development with Algorithmic Skeletons" (PaPDAS) is available at the Computer Science Laboratory of Orl?ans (LIFO, Orleans, France). Closing Date: 09-Jul-2012 Duration: 12 months Salary: around 2400 euro/month (gross salary) Full details and further contact information: http://frederic.loulergue.eu/ftp/postdoctoral_researcher.pdf From viktor at mpi-sws.org Thu Jun 28 06:08:34 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Thu, 28 Jun 2012 12:08:34 +0200 Subject: [TYPES/announce] POPL 2013: Final call for papers Message-ID: <9CF7DC36-5476-4089-9709-75BD773D7076@mpi-sws.org> ****************** POPL 2013: Final call for papers ********************** 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Paper registration: 6 July 2012, 11:59pm American Samoa time (UTC-11h) Paper submission: 10 July 2012, 11:59pm American Samoa time (UTC-11h) Author response: 10-13 September 2012 Notification: 1 October 2012 POPL dates: 23-25 January 2013 Co-located events: 20-22, 26 January 2013 Location: Rome, Italy Submission URL: https://popl2013.di.ens.fr/ (NOW OPEN) For more information and submission guidelines: WEB: http://popl.mpi-sws.org/2013/ Twitter: http://twitter.com/POPL2013 From alexandre.chapoutot at ensta-paristech.fr Fri Jun 29 03:10:51 2012 From: alexandre.chapoutot at ensta-paristech.fr (Alexandre Chapoutot) Date: Fri, 29 Jun 2012 09:10:51 +0200 Subject: [TYPES/announce] PhD thesis position at ENSTA ParisTech: Static analysis of Hybrid Systems Message-ID: Dear all, A PhD thesis position is available at ENSTA ParisTech co-jointly with Univerist? Paris-Sud and CEA LIST laboratory. Title: Static Analysis of Executable Models of Hybrid Systems Duration: 3 years full time Salary: 1450 Euros net per month Best regards A. Chapoutot --------- Alexandre Chapoutot -- Assistant professor Address: ENSTA ParisTech Unit? d'Electronique et d'Informatique 32 boulevard Victor 75739 Paris cedex 15 Phone: +33 1 45 52 49 62 Fax: +33 1 45 52 83 27 Mail: alexandre.chapoutot at ensta-paristech.fr Web: http://www.ensta.fr/~chapoutot/index.html -------------- next part -------------- A non-text attachment was scrubbed... Name: these-asthme-en.pdf Type: application/pdf Size: 128739 bytes Desc: not available URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: these-asthme-fr.pdf Type: application/pdf Size: 193639 bytes Desc: not available URL: From Stefano.Guerrini at univ-paris13.fr Fri Jun 29 09:46:02 2012 From: Stefano.Guerrini at univ-paris13.fr (Stefano Guerrini) Date: Fri, 29 Jun 2012 15:46:02 +0200 Subject: [TYPES/announce] Computing with lambda-terms: a Festschrift dedicated to Corrado Bohm Message-ID: <427CBADD-73D3-4D3F-8AB2-344E7BF54897@univ-paris13.fr> ====================================================================== Computing with lambda-terms A special issue dedicated to Corrado Bohm for his 90th birthdays http://www.lipn.univ-paris13.fr/~guerrini/bohm90/ ====================================================================== In honor of Corrado Bohm at the occasion of his 90th birthday, a Festschrift will be published as a special issue of Mathematical Structures in Computer Science. The Festschrift will be presented during a special event in honor of Corrado Bohm at ETAPS 2013, 16-24 March 2013, Rome, Italy. SCOPE ===== We invite submissions on all the topics covered by Corrado Bohm's research and in particular new contributions on syntax and semantics of lambda-calculus, logic and type systems, functional programming. We also welcome surveys or position papers on current and future directions of research on the above topics. A more detailed, but not exclusive, list of topics of interest for submissions include: Lambda-calculus and higher-order rewriting systems: properties of reductions, reduction strategies, combinatory logic, Bohm-out and Bohm-trees, variants and extensions of lambda-calculus, term and graph rewriting systems, higher-order reduction. Semantics of lambda-calculus: Bohm-trees, models and theories of lambda-calculus, realizability. Logic and types: type systems, linear logic, types and logics for resources, implicit computational complexity. Functional programming: foundational aspects of functional programming, Curry-Howard isomorphism, applications and implementations of functional programming. New and alternative approaches to computing: quantum calculi, biologically inspired models and calculi. Submitted papers should stay within the scope of MSCS. SUBMISSION ========== The results must be unpublished and not submitted for publication elsewhere. Submissions will be refereed according to the usual high standards of MSCS. Submissions should not exceed 20 pages of content (excluding references and appendices). Submissions exceeding 25 pages (including references and appendices) will require a specific justification and the agreement of the editors. Further information and instructions about submission will be available at http://www.lipn.univ-paris13.fr/~guerrini/bohm90/ PLANNED SCHEDULE ================ Title and short abstract submission: 1 september 2012 Deadline for submission: 15 september 2012 (STRICT!) First referee report: 15 december 2012 Revised version: 15 january 2013 Notification: 1 march 2013 Final version: 1 june 2013 GUEST EDITORS ============= Henk Barendregt (henk at cs.ru.nl) Stefano Guerrini (guerrini at univ-paris13.fr) Adolfo Piperno (piperno at di.uniroma1.it) From icfp.publicity at googlemail.com Mon Jul 2 07:50:06 2012 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Mon, 2 Jul 2012 13:50:06 +0200 Subject: [TYPES/announce] ICFP 2012: Call for participation Message-ID: ===================================================================== Call for Participation The 17th ACM SIGPLAN International Conference on Functional Programming (ICFP 2012) and affiliated events http://www.icfpconference.org/icfp2012/ Copenhagen, Denmark, Sep 9-15, 2012 ===================================================================== ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. A full week dedicated to functional programming: 1 conference, 1 symposium, 9 workshops, 8 tutorials, programming contest results, student research contest * Accepted Papers: http://www.icfpconference.org/icfp2012/accepted.html * Local arrangements (including travel and accommodation): http://icfpconference.org/icfp2012/local.html Conference hotel reservation cutoff: July 9, 2012 * Registration is available via: http://icfpconference.org/icfp2012/ Electronic registration will open shortly. * Follow @icfp_conference on twitter for the latest news: http://twitter.com/#!/icfp_conference There are several events affiliated with ICFP: September 9 Workshop on Cross-paradigm Language Design and Implementation Workshop on Generic Programming Workshop on Higher-Order Programming with Effects Workshop on Logical Frameworks and Meta-languages: Theory and Practice September 10-12 ICFP - main conference September 13 Commercial Users of Functional Programming ? Day 1 (CUFP Tutorials) Haskell Symposium Workshop on ML September 14 Commercial Users of Functional Programming ? Day 2 (CUFP Tutorials) Erlang Workshop Haskell Implementors' Workshop OCaml Users and Developers Workshop September 15 Commercial Users of Functional Programming ? Day 3 (CUFP Talks) Workshop on Functional High-Performance Computing Tutorial on Compiler Construction in Haskell Tutorial on the Grammatical Framework Conference organizers: * General Chair: Peter Thiemann, University of Freiburg * Program Chair: Robby Findler, Northwestern University * Local Arrangements Chair: Fritz Henglein, University of Copenhagen * Industrial Relations Chair: Andy Adams-Moran, Galois * Workshop Co-Chairs: Patrik Jansson, Chalmers University of Technology Gabriele Keller, University of New South Wales * Programming Contest Chair: Edwin Brady, University of St. Andrews Kevin Hammond, University of St. Andrews * Publicity Chair: Wouter Swierstra, Utrecht University * Video Chair: Malcolm Wallace, Standard Chartered Bank * Student Research Competition Chair: Doaitse Swierstra, Utrecht University ===================================================================== From J.T.Jeuring at uu.nl Mon Jul 2 10:21:37 2012 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Mon, 2 Jul 2012 16:21:37 +0200 Subject: [TYPES/announce] CICM 2012: Programme details on-line, last call for participation In-Reply-To: <03D64256-3F12-4BFD-8B5C-FE925F6AD84E@uu.nl> References: <644A89D2-93DF-4918-B68C-CC5145DBE6D8@uu.nl> <03D64256-3F12-4BFD-8B5C-FE925F6AD84E@uu.nl> Message-ID: <823A7078-4322-4EBF-B1E4-F1C23A9AFC82@uu.nl> The detailed programme of CICM 2012 is now on-line. http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=detailed-programme If you want to attend CICM 2012, and haven't registered yet, please do so as soon as possible: http://www.informatik.uni-bremen.de/cicm2012/cicm.php?event=&menu=registration Johan Jeuring General program chair for CICM 2012 From gorel at cs.lth.se Tue Jul 3 05:42:01 2012 From: gorel at cs.lth.se (=?iso-8859-1?Q?G=F6rel_Hedin?=) Date: Tue, 3 Jul 2012 11:42:01 +0200 Subject: [TYPES/announce] Last Call for Submissions: SLE 2012 Poster Track and Doctoral Symposium Message-ID: <9DA375F3-ABFD-4AF6-A6D5-7B78C635526D@cs.lth.se> LAST CALL FOR SUBMISSIONS to Poster Track and Doctoral Symposium Fifth International Conference on Software Language Engineering (SLE 2012) Sept 25-28, 2012, Dresden, Germany General chair: Uwe Assmann http://planet-sl.org/sle2012 SLE is co-located with GPCE, FOSD, and ITSLE. Call for submissions to Poster Track and the Doctoral Symposium closes July 10. Call for papers to the main track is closed. The 5th International Conference on Software Language Engineering (SLE) is devoted to topics related to artificial languages in software engineering. SLE encourages communication among communities that have traditionally looked at software languages from different and yet complementary perspectives. Of particular relevance to SLE are technologies, methods, experiments, and case studies on software languages from modelware, grammarware and ontologyware perspectives. ============================================================ POSTER TRACK On-line proceedings Submission deadline: July 10 For the poster track, we solicit short papers of length between 5 and 6 pages in topics of interest to the SLE community, and we encourage authors to report on early work and applications. Poster papers will be evaluated based on novelty and clearness of presentation. Submitted papers must not have been previously published or currently be submitted for publication elsewhere. Authors of accepted short papers will present their posters during a poster session at the conference. Poster track co-chairs: - Dimitris Kolovos, University of York - Anya Helene Bagge, University of Bergen Poster track program committee: - Emilie Balland, INRIA - Laurence Tratt, Middlesex University - Alessandro Rossini, University of Bergen - Pieter Van Gorp, Eindhoven University of Technology - Anne Etien, LIFL - University of Lille 1 - Antonio Cicchetti, M?lardalen University - Louis Rose, University of York - Zinovy Diskin, McMaster University / University of Waterloo ============================================================ DOCTORAL SYMPOSIUM On-line proceedings Submission deadline: July 10 The International Conference on Software Language Engineering (SLE) aims to bring together the different sub-communities of the software-language-engineering community to foster cross-fertilisation and to strengthen research overall. Within this context the Doctoral Symposium at SLE 2012 contributes towards these goals by providing a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice from researchers both in and out of their particular research area. The main objectives of this event are: - to provide PhD students with an opportunity to write about and present their research - to provide PhD students with constructive feedback on their work from their peers and from established researchers in their own and in different SLE sub-communities - to build bridges for potential research collaboration - to foster integrated thinking about SLE challenges crossing the boundaries between sub-communities - to encourage discussion about research methodology Besides research topics as mentioned in the SLE conference positioning, we explicitly solicit papers that address - unusual cross-domain aspects of software languages, - practical application of software language engineering concepts in real world examples, commercial or non-commercial, or - usage and usability aspects of software languages for non-IT and non-research audience as well. Furthermore, we encourage PhD students to submit papers about research aspects of and connected to software language engineering, even if not explicitly mentioned in the positioning of SLE and doctoral symposium in order to start exchange of such research ideas in the community. Doctoral Symposium co-chairs: - Prof. Dr. Ulrich W. Eisenecker, University of Leipzig - Christian Bucholdt, Credit Suisse AG, Z?rich Doctoral Symposium program committee: - Roberto Lopez Herrejon, Johannes Kepler University of Linz, AT - Michael Haupt, Oracle - Rick Rabiser, Johannes Kepler University of Linz, AT - Zoltan Porkolab, E?tv?s Lor?nd University, HU - Valentino Vranic, University of Technology Bratislava, SK - Sebastian G?nther, Vrije University Brussels, BE - Gunther Saake, University of Magdeburg, DE - Ulrich Breymann, University of Applied Sciences Bremen, DE - Johannes M?ller, University of Leipzig, DE - Christian K?stner, University of Marburg, DE - Mark van den Brand, Eindhoven University of Technology, NL - J?rg Liebig, University of Passau, DE - Jaako J?rvi, Texas A&M University, College Station, USA - Arnaud Hubaux, University of Namur, BE - Steffen Becker, University of Paderborn, DE - Heike Wehrheim, University of Paderborn, DE - David Benavides, University of Seville, ES - Oscar Nierstrasz, University of Bern, CH - Michal Valenta, University of Technology Prague, CZ - Jaroslav Poruban, Technical University of Kosice, SK ============================================================ SLE TOPICS OF INTEREST 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. For further information, see http://planet-sl.org/sle2012 From carsten at itu.dk Tue Jul 3 15:39:46 2012 From: carsten at itu.dk (=?iso-8859-1?Q?Carsten_Sch=FCrmann?=) Date: Tue, 3 Jul 2012 15:39:46 -0400 Subject: [TYPES/announce] Several open Postdoc Positions at the IT University of Copenhagen/DemTech Message-ID: <696D3196-7B3A-4C21-AA0B-16BA0EDE9745@itu.dk> The IT University of Copenhagen invites applications for several postdoctoral fellow positions on trustworthy electronic election technology. The positions are part of a larger effort to prove that it is possible to modernize the democratic process without losing the trust of the voters. We are looking for experts in epistemic logical framework technology and cryptographic methods, such as full homomorphic encryption. The research will be conducted under the supervision of Profs. Joseph Kiniry and Carsten Sch?rmann. A successful applicant will be hired initially for one year with the option to renew. The start date is flexible. Candidates are also encouraged to explore research ideas beyond the project description. The positions provide significant opportunities for professional development. Postdoctoral candidates should have a Ph.D. in Computer Science or Mathematics and an established research record in one or more of the following fields: applied formal methods cryptography electronic voting systems (of primary importance) rigorous software engineering trust and trustworthiness logic and semantics logical frameworks and type theory proof theory and higher-order theorem proving program verification Early expressions of interest are encouraged: Carsten Schuermann ( carsten at itu.dk), Joseph Kiniry (kiniry at itu.dk). The application deadline May 15. 2011. Please follow this link https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=116151&DepartmentId=5237&MediaId=5 to file your application. Best regards, -- Carsten Schuermann and Joseph Kiniry -------------- next part -------------- An HTML attachment was scrubbed... URL: From Pieter.Philippaerts at CS.KULEUVEN.BE Wed Jul 4 11:44:16 2012 From: Pieter.Philippaerts at CS.KULEUVEN.BE (Pieter Philippaerts) Date: Wed, 4 Jul 2012 17:44:16 +0200 Subject: [TYPES/announce] Fifth International Symposium on Engineering Secure Software and Systems (ESSoS) - Call for Papers Message-ID: <006801cd59fb$de7f4b00$9b7de100$@cs.kuleuven.be> Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos/2013/ February 27 - March 1, 2013, Paris, France In cooperation with (pending): ACM SIGSAC and SIGSOFT and IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Hostile, networked environments, like the Internet, can allow vulnerabilities in software to be exploited from anywhere. To address this, high-quality security building blocks (e.g., cryptographic components) are necessary, but insufficient. Indeed, the construction of secure software is challenging because of the complexity of modern applications, the growing sophistication of security requirements, the multitude of available software technologies and the progress of attack vectors. Clearly, a strong need exists for engineering techniques that scale well and that demonstrably improve the software's security properties. GOAL AND SETUP The goal of this symposium, which will be the fifth in the series, is to bring together researchers and practitioners to advance the states of the art and practice in secure software engineering. Being one of the few conference-level events dedicated to this topic, it explicitly aims to bridge the software engineering and security engineering communities, and promote cross-fertilization. The symposium will feature two days of technical program, and is also open to proposals for both tutorials and workshops. In addition to academic papers, the symposium encourages submission of high-quality, informative experience papers about successes and failures in security software engineering and the lessons learned. Furthermore, the symposium also accepts short idea papers that crisply describe a promising direction, approach, or insight. TOPICS The Symposium seeks submissions on subjects related to its goals. This includes a diversity of topics including (but not limited to): - scalable techniques for threat modeling and analysis of vulnerabilities - specification and management of security requirements and policies - security architecture and design for software and systems - model checking for security - specification formalisms for security artifacts - verification techniques for security properties - systematic support for security best practices - security testing - security assurance cases - programming paradigms, models and DLS's for security - program rewriting techniques - processes for the development of secure software and systems - security-oriented software reconfiguration and evolution - security measurement - automated development - trade-off between security and other non-functional requirements (in particular economic considerations) - support for assurance, certification and accreditation - empirical secure software engineering SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag (pending) in the Lecture Notes in Computer Science Series (http://www.springer.com/lncs). Submissions should follow the formatting instructions of Springer LNCS. Submitted papers must present original, non-published work of high quality. For selected papers, there will be an invitation to submit extended versions to a special issue in the International Journal of Information Security. Two types of papers will be accepted: Full papers (max 14 pages without bibliography/appendices) - May describe original technical research with a solid foundation, such as formal analysis or experimental results, with acceptance determined mostly based on novelty and validation. Or, may describe case studies applying existing techniques or analysis methods in industrial settings, with acceptance determined mostly by the general applicability of techniques and the completeness of the technical presentation details. Idea papers (max 8 pages with bibliography) - May crisply describe a novel idea that is both feasible and interesting, where the idea may range from a variant of an existing technique all the way to a vision for the future of security technology. Idea papers allow authors to introduce ideas to the field and get feedback, while allowing for later publication of complete, fully-developed results. Submissions will be judged primarily on novelty, excitement, and exposition, but feasibility is required, and acceptance will be unlikely without some basic, principled validation (e.g., extrapolation from limited experiments or simple formal analysis). In the proceedings, idea papers will clearly identified by means of the "Idea" tag in the title. Proposals for both tutorials and workshops are welcome. Further guidelines will appear on the website of the symposium. IMPORTANT DATES Paper submission: September 30, 2012 Author notification: November 22, 2012 Camera-ready: December 13, 2012 PROGRAM COMMITTEE PC Co-Chairs Jan J?rjens, TU Dortmund and Fraunhofer ISST Ben Livshits, Microsoft Research PC Davide Balzarotti, EURECOM, France Ruth Breu, University of Innsbruck, Austria Cristian Cadar, Imperial College, UK Julian Dolby, IBM Research, US Matt Fredrikson, University of Wisconsin, US Dieter Gollmann, TU Hamburg-Harburg, Germany Maritta Heisel, U. Duisburg Essen, Germany Peter Herrmann, NTNU, Trondheim, Norway Thorsten Holz, U. Ruhr Bochum, Germany Sergio Maffeis, Imperial College, UK Heiko Mantel, TU Darmstadt, Germany Anders M?ller, Aarhus University, Denmark Haris Mouratidis, University of East London, UK Zachary Peterson, Naval Postgraduate School, US Frank Piessens, KU Leuven, Belgium Erik Poll, RU Nijmegen, NL Alexander Pretschner, TU Munich, Germany Wolfgang Reif, University of Augsburg, Germany Jianying Zhou, Institute for Infocomm Research, Singapore Mohammad Zulkernine, Queens University, Canada Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From jjb at microsoft.com Wed Jul 4 13:25:54 2012 From: jjb at microsoft.com (Josh Berdine) Date: Wed, 4 Jul 2012 17:25:54 +0000 Subject: [TYPES/announce] VMCAI 2013: Call for Papers Message-ID: VMCAI 2013 CALL FOR PAPERS 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) http://vmcai13.di.univr.it January 20-22, 2013, Rome, Italy Co-located with POPL 2013 (http://popl.mpi-sws.org/2013/) 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages SCOPE VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. The program of VMCAI'13 will consist of refereed research papers and tool demonstrations, as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyberphysical systems. Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Proceedings are published by Springer-Verlag as volumes in the Lecture Notes in Computer Science series. IMPORTANT DATES Abstract Submission: August 17, 2012 Paper Submission: August 24, 2012 Acceptance Notification: October 12, 2012 Conference: January 20-22, 2013 (right before POPL) The submission system is now open and early submissions are welcome. The deadlines are strict and will not be changed. SUBMISSION INSTRUCTIONS The VMCAI 2013 proceedings will be published as a volume in Springer's Lecture Notes in Computer Science series. The page limit for submissions is: 15 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at http://www.springer.de/comp/lncs/authors.html. Submissions deviating from these guidelines risk summary rejection. Please prepare your submission in accordance with the rules described above and submit a pdf file via: http://www.easychair.org/conferences/?conf=vmcai2013 PROGRAM COMMITTEE Program Chairs: Roberto Giacobazzi (Chair) Josh Berdine (Co_Chair) Isabella Mastroeni (Co_chair) Program Committee: Josh Berdine (MSR, UK & Co_Chair) Nikolaj Bjorner, (MSR, USA) Sandrine Blazy (U. Rennes, France) Agostino Cortesi (U. Venezia, Italy) Mad Dams (KTH, Sweden) Michael Emmi (U. Paris Diderot, France) Azadeh Farzan (U. Toronto, Canada) Pierre Ganty (IMDEA, Spain) Samir Genaim (U. Complutense, Spain) Roberto Giacobazzi (U. Verona, Italy & Chair) Orna Grumberg (Technion, Israel) Klaus Havelund (JPL, USA) Jochen Hoenicke (U. Freiburg, Germany) Sebastian Hunt (City U. London, UK) Limin Jia, (CMU, USA) Andy King (Kent, UK) Arun Lakhotia (U. Louisiana, USA) Akash Lal (MSR, India) Rupak Majumdar (MPI-SWS, Germany) Matthieu Martel (U. Perpignan, France) Isabella Mastroeni (U. Verona, Italy & Co_chair) Ganesan Ramalingam (MSR, India) Roberto Sebastiani (FBK, Italy) Saurabh Srivastava (Berkeley, USA) Greta Yorsh (ARM, UK) Enea Zaffanella (U. Parma, Italy) VMCAI STEERING COMMITTEE Agostino Cortesi, Universita' Ca' Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France E. Allen Emerson, University of Texas at Austin, USA Andreas Podelski, University of Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA ADDITIONAL INFORMATION Please consult: http://vmcai13.di.univr.it or contact PC chairs. From P.B.Levy at cs.bham.ac.uk Thu Jul 5 07:24:35 2012 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Thu, 5 Jul 2012 12:24:35 +0100 Subject: [TYPES/announce] 15th Wessex theory seminar on 19 July in Birmingham Message-ID: Dear all, The 15th Wessex theory seminar will take place on Thursday 19 July at the University of Birmingham. The Wessex Theory Seminars are a series of workshops focused on theoretical computer science, and in particular mathematical foundations of programming languages. It is designed to be a joint seminar of Mathematics and Computer Science departments, and industrial collaborators. As you can see from the preliminary programme, the talks include proof theory, category theory, semantics, automata, security, complexity and logic. Truly something for everybody if not quite a few things. If you plan to attend please reply to this message so I can put you on the attendance list. As usual there is funding available to reimburse travel expenses etc. Further information, including abstracts, can be found at the website: https://wiki.bath.ac.uk/display/wessex/15th+Wessex+Theory+Seminar regards, Paul --- PRELIMINARY PROGRAMME 11:15 coffee 11:45 Umberto Rivieccio (Birmingham). Logics for partial and inconsistent information 12:30 Anupam Das (Bath). Finer notions of analyticity for proofs 13:15 lunch 14:15 Julian Rathke (Southampton). Local memory via layout randomisation 15:00 Steve Vickers (Birmingham). Arithmetic universes as generalized spaces 15:45 coffee 16:15 Dusko Pavlovic (Royal Holloway). Monoidal computer: towards cryptography in pictures 17:00 Andrzej Murawski(Leicester). Algorithmic games for full ground references 17:45 pub/dinner -- Paul Blain Levy School of Computer Science, University of Birmingham +44 (0)121 414 4792 http://www.cs.bham.ac.uk/~pbl From guoqingx at ics.uci.edu Thu Jul 5 13:09:38 2012 From: guoqingx at ics.uci.edu (Harry Xu) Date: Thu, 5 Jul 2012 10:09:38 -0700 Subject: [TYPES/announce] PPoPP'13 (Shenzhen, China) Call for Workshop/Tutorial Proposals Message-ID: <017101cd5ad0$f66c6a10$e3453e30$@ics.uci.edu> 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2013 ) February 23-27, 2013, Shenzhen, China Call for Workshops and Tutorials Proposal submission deadline: September 1, 2012 Notification of acceptance: September 30, 2012 Please send all proposals to the workshops/tutorials chair, Harry Xu, at harry.g.xu at uci.edu and include "PPoPP 2013" in the subject line. The ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) 2013 is seeking proposals for workshops and tutorials to accompany the conference. Workshops and tutorials will be held on Saturday-Sunday, February 23-24, 2013 and may be a half day or a full day in length. We encourage members of the community to consider submitting proposals for workshops that bring together researchers and practitioners working on research topics of significant current interest, as well as workshops that bring together researchers and practitioners working in particular areas. Specific topics of interest include (but are not limited to): * Parallel programming theory and models * Formal analysis and verification * Middleware for parallel systems * Parallel programming languages * Compilers and runtime systems * Automatic parallelization * Parallel libraries or application frameworks * Performance analysis, debugging and optimization * Development, analysis, or management tools * Parallel algorithms * Parallel applications * Concurrent data structures * Synchronization and concurrency control * Software engineering for parallel programs * Fault tolerance for parallel systems * Software issues for multicore and multithreaded processors * Software for accelerators and hybrid systems * Task mapping and scheduling * Parallelism in non-scientific workloads: web servers, search, analytics Workshop proposals should include: * The workshop title * The organizers and their affiliations * A one-page description of the workshop and/or a proposed call for participation or papers * The proposed length of the workshop (half day or full day; if half day, planned length in hours) * If the workshop was previously held, the number of attendees at the last workshop and the number of presentations or papers given at the workshop. Tutorial proposals should include: * The tutorial title * Organizers, presenters, and their affiliations * A one-page description of the tutorial * The proposed length of the tutorial (half day or full day; if half day, planned length in hours) * If the tutorial has been given previously, the location, date, and number of attendees at the last tutorial Committee Information Workshops and Tutorials Chair: Harry Xu, University of California, Irvine General Chairs: Alex Nicolau, University of California, Irvine Xiaowei Shen, IBM Research, China Program Chair: Saman Amarasinghe, MIT Richard Vuduc, Georgia Tech -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at itu.dk Thu Jul 5 15:39:14 2012 From: carsten at itu.dk (=?iso-8859-1?Q?Carsten_Sch=FCrmann?=) Date: Thu, 5 Jul 2012 15:39:14 -0400 Subject: [TYPES/announce] Several open Postdoc Positions at the IT University of Copenhagen/DemTech Message-ID: Apologies for reposting: The correct application deadline is 23. July 2012. Best regards, -- Carsten Schuermann The IT University of Copenhagen invites applications for several postdoctoral fellow positions on trustworthy electronic election technology. The positions are part of a larger effort to prove that it is possible to modernize the democratic process without losing the trust of the voters. We are looking for experts in epistemic logical framework technology and cryptographic methods, such as full homomorphic encryption. The research will be conducted under the supervision of Profs. Joseph Kiniry and Carsten Sch?rmann. A successful applicant will be hired initially for one year with the option to renew. The start date is flexible. Candidates are also encouraged to explore research ideas beyond the project description. The positions provide significant opportunities for professional development. Postdoctoral candidates should have a Ph.D. in Computer Science or Mathematics and an established research record in one or more of the following fields: applied formal methods cryptography electronic voting systems (of primary importance) rigorous software engineering trust and trustworthiness logic and semantics logical frameworks and type theory proof theory and higher-order theorem proving program verification Early expressions of interest are encouraged: Carsten Schuermann ( carsten at itu.dk), Joseph Kiniry (kiniry at itu.dk). The application deadline July 23, 2012. Please follow this link https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=116151&DepartmentId=5237&MediaId=5 to file your application. Best regards, -- Carsten Schuermann and Joseph Kiniry -------------- next part -------------- An HTML attachment was scrubbed... URL: From Stephan.Merz at loria.fr Thu Jul 5 15:41:49 2012 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Thu, 5 Jul 2012 21:41:49 +0200 Subject: [TYPES/announce] Summer School VTSA 2012 Message-ID: Some of the courses at this summer school should be of interest to readers of the TYPES mailing list. Apologies for multiple copies. Best regards, Stephan Merz ------------------------------------------------------------------------------ VTSA 2012 - Summer School on Verification Technology, Systems & Applications Max Planck Institute for Informatics, Saarbruecken, Germany September 03-07, 2012 http://www.mpi-inf.mpg.de/VTSA12/ Call for Participation ------------------------------------------------------------------------------ The summer school on verification technology, systems and applications happens this year at the Max Planck Institute for Informatics. The school will take place from September 3rd to 7th, 2012. The following speakers have accepted to give courses: - Armin Biere: Understanding Modern SAT Solvers - J?rgen Giesl: Automated Termination Analysis - David Monniaux: Abstract Interpretation - Ahmed Bouajjani: Verification of Concurrent Programs under Weak Memory Models - Carsten Sch?rmann: Logical Frameworks - The Art of Representation Participation is free (except for travel and accommodation costs) and open to anybody holding at least a Bachelor degree (or equivalent) in computer science. The number of participants is limited. Please apply electronically by *July 20th, 2012* by sending - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, - a copy of your bachelor certificate (or equivalent or higher) to lamotte at mpi-inf.mpg.de For details please see the Web page of the school. General Organization: - Bernard Boigelot (boigelot at montefiore.ulg.ac.be) - Stephan Merz (Stephan.Merz at loria.fr) - Jun Pang (jun.pang at uni.lu) - Christoph Weidenbach (weidenbach at mpi-inf.mpg.de) Local Organization - Manuel Lamotte-Schubert (lamotte at mpi-inf.mpg.de) - Jennifer M?ller (jmueller at mpi-inf.mpg.de) From gc at pps.jussieu.fr Fri Jul 6 04:36:46 2012 From: gc at pps.jussieu.fr (Giuseppe Castagna) Date: Fri, 06 Jul 2012 10:36:46 +0200 Subject: [TYPES/announce] Post-doc position at Paris 7 on polymorphic functional languages Message-ID: <4FF6A39E.30003@pps.jussieu.fr> Post-doc position available at PPS - Univ Paris Diderot / Paris 7 on Polymorphic functional languages for semi-structured data. Applications are invited for a postdoctoral position at PPS - Universit? of Paris Diderot / Paris 7. http://pps.univ-paris-diderot.fr The selected candidate will have to conduct research on the design and implementation of polymorphic functional languages for semi-structured data. The research will take place in the context of the ANR project Typex: Typeful and Certified XML: http://typex.lri.fr/index.html Starting date is negotiable (tentatively September 2012). Profile: -------- Candidates must have or be soon to have a PhD in Computer Science with strong background in type theory, functional programming, programming language design and implementation. Skills in an additional areas of computer science (such as proof theory, interactive theorem provers, etc.) are very welcome. Application: ------------ To apply, send a resume, a brief statement of interest, and names of at least two references to: Giuseppe.Castagna at univ-paris-diderot.fr Topic of research: ------------------ The goal of this postdoc position is to study the design and implementation of polymorphic functional languages for semi-structured data. Using recent advancements in the theory of polymorphism [1,2] for semantic subtyping [3] the recruited person will have to define polymorphic extensions of XML processing languages such as CDuce [4] and/or XQuery [5,6] and study their compilation into typed virtual machines. References: ---------- [1] G. Castagna and Z. Xu: Set-theoretic Foundation of Parametric Polymorphism and Subtyping. In ICFP?'11: 16th ACM-SIGPLAN International Conference on Functional Programming, pag.?94-106, September, 2011. [2] G. Castagna, K. Nguyen, Z. Xu, and S. Lenglet. Polymorphic functions with set-theoretic types. Unpublished manuscript. 2012 [3] A. Frisch, G. Castagna, and V. Benzaken: Semantic Subtyping: dealing set-theoretically with function, union, intersection, and negation types. Journal of the ACM, vol.?55, n.?4, pag.?1?64, 2008. [4] http://www.cduce.org [5] http://www.w3.org/TR/xquery-30/ [6] http://www.w3.org/TR/xquery-semantics/ -- [ NEW E-MAIL: Giuseppe.Castagna at univ-paris-diderot.fr ] [ From June, old "pps.jussieu.fr" will no longer work ] [ Please update your addressbook if needed. ] From jv at informatik.uni-bonn.de Fri Jul 6 16:33:01 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Fri, 06 Jul 2012 22:33:01 +0200 Subject: [TYPES/announce] CFP: First Workshop on Programming the Semantic Web - PSW 2012 Message-ID: <4FF74B7D.9050104@informatik.uni-bonn.de> [CALL FOR PAPERS] First Workshop on Programming the Semantic Web - PSW'12 co-located with ISWC'12, 11th International Semantic Web Conference (ISWC 2012), 11-15 November, Boston, USA Workshop website: http://www.inf.puc-rio.br/~psw12 Contact: psw12 at inf.puc-rio.br IMPORTANT DATES =============== Abstract submission deadline: *July 24, 2012* Paper submission deadline: *July 31, 2012* Notification of acceptance: August 21, 2012 Camera ready papers: September 10, 2012 Workshop date: November 11 or 12, 2012 GOALS AND TOPICS ================ The Web of Data is growing at an enormous pace. However, the development of dedicated software applications, capable to deal efficiently in information-rich spaces, of which the Semantic Web is one dimension, is not yet mainstream. Reasons for that include one (or more) of the following research issues: lack of integrated development environments (IDEs, such as Visual Studio and Eclipse), poor programming language support, lack of standard testbeds and/or benchmarks, inadequate training, and perhaps the need for curricula revision. Properly addressing these issues requires interdisciplinary skills, and the collaboration between academia and industry. The First Workshop on Programming the Semantic Web invites submissions that explore the gap between today's data management challenges, particularly the ones related to dealing with large amounts of semantically rich data, and the lack of adequate tools. We are looking for contributions that discuss, promote and further advance the programming facet of the Semantic Web, including the development of new languages, extension of existing ones, and the inclusion of semantic enabled capabilities into existing IDEs. Papers submitted to PSW'12 should explore open research problems, and must not have been accepted for publication elsewhere or be under review for another workshop or conference. All papers will be peer-reviewed by at least three PC members. Topics of interest include, but are not limited to: * Languages, tools, and methodologies for representing and managing Information-rich data * Novel programming paradigms aimed at the Semantic Web/ linked data /Information-rich spaces in general * Impact of specific application areas (e.g. e-science, e-gov, sensors) on Information-rich application design * Data Visualization * Programming Patterns for data handling * Evaluation of data quality * Plugins and IDE?s for information rich application development * Ontologies, Schemata, Taxonomies and Types interplay * query, integration, and analysis of Semantic Web data * Cleaning and provenance of Semantic Web data, services, and processes * Mashing up data and processes SUBMISSION GUIDELINES AND PROCEEDINGS ------------------------------------- Papers submitted to *PSW 2012* should explore open research problems, and must not have been accepted for publication elsewhere or be under review for another workshop or conference. All papers will be peer-reviewed by at least three PC members. The workshop will accept: * Full research and experience papers (maximum length: 12 pages) * Position and demonstration Papers (maximum length: 4 pages) Submissions must be formatted in the style of the Springer Publications format for Lecture Notes in Computer Science (LNCS) (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). Papers should be submitted electronically, in PDF format, via EasyChair. All submissions will be peer-reviewed by members of the international program committee. Paper acceptance will be based on originality, significance, technical soundness, and clarity of presentation. Submission link coming soon! * Best papers will have the opportunity to be published in a book on Data Driven Programming, to be published by Springer fall 2013.* At least one author per accepted paper must register and participate in the workshop. Registration is subject to the terms, conditions and procedure of the main ISWC conference to be found on their website. ORGANIZING COMMITTEE -------------------- Karin Breitman, EMC Research Center Evelyne Viegas, Microsoft Research Steffen Staab, Universtity of Koblenz-Landau Jan Vitek, Purdue University Contact: psw12 at inf.puc-rio.br PROGRAM COMMITTEE ----------------- Alexander Paar, TWT Science and Innovation Andy Gordon, Microsoft Research Axel Polleres, Siemens Daniel Oberle, SAP Don Syme, Microsoft Research Gerd Gr?ner, University of Koblenz-Landau Haym Hirsh, Rutgers University Janis Voigtl?nder, University of Bonn Jeff Pan, University of Aberdeen Judith Bishop, Microsoft Research Manfred Hauswirth, DERI Nigel Hoorspool, University of Victoria Peter Fox, Rensselaer Polytechnic Institute Ralf L?mmel, University of Koblenz-Landau Ralf M?ller, TU Harburg S?ren Auer, University of Leipzig Tim Finin, University of Maryland Tomas Petricek, Cambridge University From zerny at cs.au.dk Mon Jul 9 11:11:14 2012 From: zerny at cs.au.dk (Ian Zerny) Date: Mon, 09 Jul 2012 17:11:14 +0200 (CEST) Subject: [TYPES/announce] SFP 2012: Call for Papers Message-ID: <20120709.171114.266102357.ian@zerny.dk> Call for Papers 2012 Workshop on Scheme and Functional Programming Copenhagen, Denmark Sunday 9 September 2012 http://users-cs.au.dk/danvy/sfp12 Important Dates --------------- Submission: 13 August 2012 Notification: 30 August 2012 Camera-ready: 7 August 2012 All deadlines are at 23:59 UTC (7:59 PM EDT, 6:59 PM CDT, 5:59 PM MDT, and 4:59 PM PDT). Scope ----- The 2012 Workshop on Scheme and Functional Programming is a forum for discussing experience with and future development of the Scheme programming language. Papers are invited concerning all aspects of the design, implementation, theory, and application of Scheme. Some example areas include (but are not limited to): - History, evolution and standardization of Scheme - Applications, experience and industrial uses of Scheme - Program-development environments, debugging, testing - Implementation (interpreters, compilers, tools, benchmarks, etc) - Distributed computing, concurrency, parallelism - Interoperability with other languages, FFIs - Continuations, macros, modules, object systems, types - Theory, formal semantics, correctness - Education - Scheme pearls (elegant, instructive uses of Scheme) Program Committee ----------------- Michael Adams, PSU Olivier Danvy, Aarhus University (chair) Julia L. Lawall, INRIA Florian Loitsch, Google Jay McCarthy, Brigham Young University Kurt N?rmark, Aalborg University Morten Rhiger, Roskilde University Ulrik Pagh Schultz, University of Southern Denmark Jens Axel S?gaard, Vestjysk Gymnasium Tarm Eric Tanter, University of Chile Publicity Chair Ian Zerny, Aarhus University ACM SIGLAN sponsorship pending. From Bertrand.Meyer at inf.ethz.ch Tue Jul 10 02:07:59 2012 From: Bertrand.Meyer at inf.ethz.ch (Bertrand Meyer) Date: Tue, 10 Jul 2012 08:07:59 +0200 Subject: [TYPES/announce] Positions at ETH in concurrency and verification (ERC advanced investigator grant) In-Reply-To: <03ab01cd5da7$cb615e50$62241af0$@inf.ethz.ch> References: <03ab01cd5da7$cb615e50$62241af0$@inf.ethz.ch> Message-ID: <063f01cd5e62$5c0ec450$142c4cf0$@inf.ethz.ch> We have postdoc and PhD positions at the Chair of Software Engineering in connection with a recent Advanced Investigator Grant to Bertrand Meyer from the ERC. We are building advanced practical solutions for "Concurrency Made Easy" and a verification-aware IDE. Positions are available at both the PhD and Postdoc levels in my group at ETH Zurich, the Chair of Software Engineering. We recently received an Advanced Investigator Grant from the European Research Council (5 years, 2.5 million euros); the project description is at http://se.inf.ethz.ch/research/scoop/CME.pdf. In addition to this project (Concurrency Made Easy) we are recruiting for our effort of building an advanced verification environment around Eiffel, "Verification As a Matter of Course" (see e.g. the slides at http://se.ethz.ch/~meyer/publications/methodology/programming-10years-sierre.pdf , although the details are no longer up to date). Requirements: . + Excellent background in verification . + For the concurrency project, excellent background in concurrency . + Good publications on relevant topics (particularly for the postdoc positions) . + Excellent mastery of object-oriented programming, including Eiffel concepts & Design by Contract . + Mix of theoretical and practical (software development) talents . + Passion for research and determination to advance the state of software engineering. The positions are available immediately. Please send a CV to se-open-positions at lists.inf.ethz.ch; also include a position statement describing (briefly, half a page to two pages) on what topics you would like to work and what you think you can contribute. Obviously you should take some time to become familiar with our work at http://se.ethz.ch, especially the Research pages. -- Bertrand Meyer -------------- next part -------------- An HTML attachment was scrubbed... URL: From a.ricci at unibo.it Tue Jul 10 12:01:26 2012 From: a.ricci at unibo.it (Alessandro Ricci) Date: Tue, 10 Jul 2012 16:01:26 +0000 Subject: [TYPES/announce] 2nd CFP: AGERE! @ SPLASH 2012 - Programming based on Actors, Agents & Decentralized Control Message-ID: 2nd CALL FOR PAPERS AGERE! @ SPLASH 2012 2nd Int. Workshop on Programming based on Actors, Agents, and Decentralized Control Workshop held at the ACM SPLASH Conference 2012 Tucson, Arizona (US) October 21-22, 2012 http://agere2012.apice.unibo.it Deadlines: Abstracts: August 5, 2012 Papers: August 12, 2012 + special issue on Science of Computer Programming ?go ?go, ?gis, egi, actum, ?g?re latin verb meaning to act, to lead, to do, common root for actors and agents The fundamental turn of software into concurrency and distribution is not only a matter of performance, but also of design and abstraction. It calls for programming paradigms that, compared to current mainstream paradigms, would allow us to more naturally think about, design, develop, execute, debug, and profile systems exhibiting different degrees of concurrency, autonomy, decentralization of control, and physical distribution. The AGERE! workshop is dedicated to focusing on and developing the research on programming systems, languages and applications based on actors, agents and any related programming paradigm promoting a decentralized control mindset in solving problems and in developing systems to implement such solutions. The workshop is designed to cover both the theory and the practice of design and programming, bringing together researchers working on the models, languages and technologies, and practitioners developing real-world systems and applications. The first edition of AGERE! was organized in SPLASH 2011, drawing significant interest and attendance (see program at http://agere2011.apice.unibo.it). The workshop is now scheduled to take place also at SPLASH 2012 and, related to this event, a special issue on the journal Science of Computer Programming is scheduled for the end of the year. === Organizers Gul Agha, University of Illinois at Urbana-Champaign, USA Rafael H. Bordini, FACIN?PUCRS, Brazil Assaf Marron, Weizmann Institute of Science, Israel Alessandro Ricci, University of Bologna, Italy (ref: a.ricci at unibo.it) === Program Committee (partial list, other names are to be confirmed) Gul Agha, University of Illinois at Urbana-Champaign, USA Joe Armstrong, SICS / Ericsson, Sweden Saddek Bensalem, Verimag, France Rafael H. Bordini, FACIN?PUCRS, Brazil Gilad Braha, Google, USA Rem Collier, UCD, Dublin Tom Van Cutsem, Vrije Universiteit, Brussel, Belgium Amal El Fallah Seghrouchni, LIP6 - Univ. P and M. Curie, Paris, France Philipp Haller, Typesafe, Switzerland Jurgen Dix, Technical University of Clausthal, Germany Tom Holvoet, Dept. Computer Science K.U.Leuven, Belgium Einar Broch Johnsen, University of Oslo, Norway Assaf Marron, Weizmann Institute of Science, Israel Mark Miller, Google, USA Olaf Owe, University of Oslo, Norway Jens Palsberg, UCLA, Los Angeles, USA Ravi Pandya, Microsoft, USA Arnd Poetzsch-Heffter, University of Kaiserslautern, Germany Alessandro Ricci, University of Bologna, Italy Birna van Riemsdijk, Delft University of Technology, The Netherlands Giovanni Rimassa, Whitestein Technologies, Switzerland Munindar Singh, North Carolina State University, USA Gera Weiss, Ben Gurion University, Israel Guy Wiener, HP, Israel Akinori Yonezawa, University of Tokyo, Japan University, Japan ... === Main topics The topics of interest for the workshop include: - Programming languages and frameworks + theory and practice about languages and frameworks based on agents, actors, and decentralized control. - Foundations + ideas, concepts, formalization of the computation and programming models for agents, actors and decentralized control. - Design + design principles underlying the paradigms and bridging the gap between design to programming - Validation and verification + theory and tools about testing, debugging, profiling, verifying and validating software systems based on such paradigms - Applications + design and development of real-world applications - Teaching + experiences and reflections about using these paradigms in teaching (concurrent and distributed) programming === Contributions & deadlines AGERE! welcomes three kinds of contributions: - full-papers + length up to 10 pages; covering new research, per the above topics, not previously published. - short-papers & position papers + length up to 4 pages, these papers are meant to introduce a contribution (an idea, a viewpoint, an argument, work in progress...) which may be in its initial stage and not fully developed but which is worth to be presented given its relevance to the AGERE! topics, triggering discussions and interactions. - reviews & surveys + up to 10 pages, these papers are meant to provide a good synthesis & reflections about some aspect (specific or general) which is relevant for the workshop, contributing then to workshop discussions on the state of the art and open issues - demo + length up to 4 pages, these contributions are about a technology/system that will be demonstrated during the workshop. Deadlines: Abstracts August 5, 2012 Papers (*) August 12, 2012 Papers can be submitted here https://www.easychair.org/conferences/?conf=ageresplash2012 in PDF format. Submissions should use the ACM format, following the guidelines in http://www.sigplan.org/authorInformation.htm. (*) including full-papers, short/position papers, reviews & surveys, demo === Publication channels Accepted papers (full, short/position, surveys/reviews, demo) will be included in the ACM DL proceedings after the conference. Besides, a selected set of papers will be invited to be extended and included in a special issue which is being organized for the end of the year in the journal Science of Computer Programming. The special issue will be about actor-oriented and agent-oriented programming, and - more generally - on programming systems, languages, and applications based on actors, agents, and decentralized control abstractions. Read more on AGERE! web site: http://agere2012.apice.unibo.it === SELECTED BIBLIOGRAPHY * To ?set the frequency? [1] Actors and Agents as Programming Paradigms - An Overview. AGERE! 2011 introductory talk. A. Ricci. http://apice.unibo.it/xwiki/bin/download/AGERE/WebHome/opening.pdf [2] H. Sutter and J. Larus. Software and the concurrency revolution. ACM Queue: Tomorrow?s Computing Today, 3(7):54?62, Sept. 2005. [3] M. Resnick. Turtles, Termites and Traffic Jams. Explorations in Massively Parallel Microworlds. MIT Press, 1994. [4] A. Kay. Programming and programming languages, 2010. VPRI Research Note RN-2010-001. [5] Howell R. Jordan, Goetz Botterweck, Marc-Philippe Huget, Rem Collier: A feature model of actor, agent, and object programming languages. SPLASH Workshops 2011: 147-158 * Actors & OO Concurrent Programming approaches [1] G. Agha. Actors: a model of concurrent computation in distributed systems. MIT Press, Cambridge, MA, USA, 1986. [2] C. Hewitt. Viewing control structures as patterns of passing messages. Artif. Intell., 8(3):323?364, 1977. [3] G. Agha, I. A. Mason, S. Smith, and C. Talcott. A Foundation for Actor Computation. Journal of Functional Programming, 7(01):1?72, 1997. [4] J.P. Briot, R. Guerraoui, and K.P. Lohr. Concurrency and distribution in object-oriented programming. ACM Comput. Surv., 30(3):291?329, 1998. [5] G. Agha. Concurrent object-oriented programming. In in Communications of the ACM, Association for Computing Machinery, vol. 33, no. 9, pp 125-141, September, 1990. [6] G. Agha, P. Wegner, and A. Yonezawa, editors. Research directions in concurrent object-oriented programming. MIT Press, Cambridge, MA, USA, 1993. [7] R. K. Karmani, A. Shali, and G. Agha. Actor frameworks for the JVM platform: a comparative analysis. In PPPJ ?09: Proceedings of the 7th International Conference on Principles and Practice of Programming in Java, pages 11?20, New York, NY, USA, 2009. ACM. [8] A. Yonezawa, editor. ABCL: an object-oriented concurrent system. MIT Press, Cambridge, MA, USA, 1990. [9] J. Armstrong. Erlang. Commun. ACM, 53(9):68?75, 2010. [10] J. Schafer and A. Poetzsch-Heffter. Jcobox: generalizing ?active objects to concurrent components. In Proceedings of the 24th European conference on Object-oriented programming, ECOOP?10, pages 275?299, Berlin, Heidelberg, 2010. Springer-Verlag. [11] P. Haller and M. Odersky. Scala actors: Unifying thread-based and event-based programming. Theoretical Computer Science, 2008. [12] T. Van Cutsem: AmbientTalk: modern actors for modern networks. SPLASH Workshops 2011: 227-230 [13] M. S. Miller, Eric Dean Tribble, Jonathan S. Shapiro: Concurrency Among Strangers. TGC 2005: 195-229 * Agents and Agent-Oriented Programming [1] J. J. Odell. Objects and agents compared. Journal of Object Technology, 1(1):41?53, 2002. [2] N. R. Jennings. An agent-based approach for building complex software systems. Commun. ACM, 44(4):35?41, 2001. [3] Y. Shoham. Agent-oriented programming. Artificial Intelligence, 60(1):51?92, 1993. [4] R. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors. Multi-Agent Programming Languages, Platforms and Applications. Volume 1 (2005) and 2 (2009). Springer. [5] A. Ricci, A. Santi. Designing a General-Purpose Programming Language based on Agent-Oriented Abstractions: The simpAL Project. SPLASH Workshops 2011: 159-170 [6] M. D. Travers. Programming with Agents: New metaphors for thinking about computation. Massachusetts Institute of Technology, 1996. [7] R. Bordini, J. Hubner, and M. Wooldridge. Programming Multi-Agent Systems in AgentSpeak Using Jason. John Wiley & Sons, Ltd, 2007. [8] M. Dastani. 2apl: a practical agent programming language. Autonomous Agents and Multi-Agent Systems, 16(3):214?248, 2008. [9] K. V. Hindriks. Programming rational agents in GOAL. In R. H. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors, Multi-Agent Programming: Languages, Platforms and Applications (2nd volume), pages 3?37. Springer-Verlag, 2009. [10] F. Bellifemine, G. Caire, A. Poggi, G. Rimassa: JADE: A software framework for developing multi-agent applications. Lessons learned. Information & Software Technology 50(1-2): 10-21 (2008) [11] N. Howden, R. Ronnquist, A. Hodgson, and A. Lucas. JACK intelligent agentsTM ? summary of an agent infrastructure. In Proceedings of Second International Workshop on Infras- tructure for Agents, MAS, and Scalable MAS, held with the Fifth International Conference on Autonomous Agents (Agents 2001), 2001. [12] Sean Edward Russell, Howell R. Jordan, Gregory M. P. O'Hare, Rem W. Collier: Agent Factory: A Framework for Prototyping Logic-Based AOP Languages. MATES 2011: 125-136 [13] A. Pokahr, L. Braubach, Kai Jander: Unifying Agent and Component Concepts: Jadex Active Components. MATES 2010: 100-112 * Other Decentralized Control Programming Approaches [1] D. Harel, Assaf Marron, Gera Weiss: Programming Coordinated Behavior in Java. ECOOP 2010: 250-274 [2] S. Bliudze and J. Sifakis. A notion of glue expressiveness for component-based systems. CONCUR, 2008. [3] D. Harel, Assaf Marron, Guy Wiener, Gera Weiss: Behavioral programming, decentralized control, and multiple time scales. AGERE! @ SPLASH Workshops 2011: 171-182 LA RICERCA C?? E SI VEDE: 5 per mille all'Universit? di Bologna - C.F.: 80007010376 http://www.unibo.it/5permille Questa informativa ? inserita in automatico dal sistema al fine esclusivo della realizzazione dei fini istituzionali dell?ente. From pmt6sbc at maths.leeds.ac.uk Wed Jul 11 19:53:53 2012 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Thu, 12 Jul 2012 00:53:53 +0100 (BST) Subject: [TYPES/announce] Turing Centenary Research Project "Mind, Mechanism and Mathematics" Message-ID: We are very happy to announce that the 8 Turing Fellows and Scholars have been chosen to work on the 3-year Turing Centenary Research Project "Mind, Mechanism and Mathematics". The details of the lucky winners can be found at: http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?704 There were no less than 92 proposals for these grants (provided by the John Templeton Foundation), generally of very high quality, which gave the Judging Panel a great deal of work to do. We would like to congratulate the 8 worthy winners, and to encourage the other 91% of applicants to not be discouraged, but to keep looking for funding opportunities, with the expectation of eventual success. We will be looking for a continuation of the "Mind, Mechanism and Mathematics" programme in 2015. Best, Barry __________________________________________________________________________ Prof S Barry Cooper Tel: UK: (0113) 343 5165, Int: +44 113 343 5165 School of Mathematics Fax: UK: (0113) 343 5090, Int: +44 113 3435090 University of Leeds Email: pmt6sbc at leeds.ac.uk, Mobile: 07590602104 Leeds LS2 9JT Home tel: (0113) 278 2586, Int: +44 113 2782586 U.K. WWW: http://www.amsta.leeds.ac.uk/~pmt6sbc _________________ The ALAN TURING YEAR http://www.turingcentenary.eu and its new journal COMPUTABILITY http://www.computability.de/journal ************************************** Apologies, the ATY email overload is increasingly severe - if my reply is delayed, I can only apologise, and hope you understand the unusual circumstances arising from this remarkable year. Only essential replies, please. ************************************** From s.p.luttik at TUE.nl Fri Jul 13 08:12:51 2012 From: s.p.luttik at TUE.nl (Luttik, S.P.) Date: Fri, 13 Jul 2012 14:12:51 +0200 Subject: [TYPES/announce] TRENDS 2012: call for participation Message-ID: ------------------------------------------------------------------ IFIP WG 1.8 Workshop on Trends in Concurrency Theory (TRENDS 2012) Saturday September 8, 2012 (9:00-13:00), Newcastle upon Tyne (UK) Affiliated with CONCUR 2012 and The Newcastle Connection http://www.win.tue.nl/trends12/ ------------------------------------------------------------------ TRENDS 2012 is an event organised by IFIP WG 1.8 on Concurrency Theory. It aims at bringing together researchers interested in concurrency theory and its applications to discuss recent trends, exchange ideas and discuss open problems. The event will take place in the morning of September 8, 2012 and will consist of talks by the following invited speakers: Silvia Crafa (Universit? di Padova, Italy) Ursula Goltz (TU Braunschweig, Germany) Kohei Honda (Queen Mary & Westfield College, United Kingdom) Bill Roscoe (University of Oxford, United Kingdom) For a detailed programme with titles and abstracts of talks we refer to http://www.win.tue.nl/trends12. PARTICIPATION: Please register for TRENDS 2012 via the registration page of The Newcastle Connection 2012: http://conferences.ncl.ac.uk/concur-2012/registration.html. Note that the deadline for early registration is August 3, 2012. ORGANISERS: Jos Baeten (CWI, NL) Bas Luttik (Eindhoven University of Technology, NL) IFIP WG 1.8: The aims of IFIP WG 1.8 on Concurrency Theory are: - To develop theoretical foundations of concurrency, exploring frontiers of existing theoretical models like process algebra and process calculi, so as to obtain a deeper theoretical understanding of concurrent and parallel systems. - To promote and coordinate the exchange of information on concurrency theory, exchanging ideas, discussing open problems, and identifying future directions of research in the area. The activities of this WG encompass all aspects of concurrency theory and its applications. From barbara.kordy at uni.lu Sat Jul 14 03:39:37 2012 From: barbara.kordy at uni.lu (Barbara KORDY) Date: Sat, 14 Jul 2012 07:39:37 +0000 Subject: [TYPES/announce] Post-Doc Position in Computer Security at University of Luxembourg Message-ID: <51604CA7384E4C4A97AD9EE83BC440C11DA7696D@hoshi.uni.lux> ***********Post-Doc Position in Computer Security*********** The University of Luxembourg seeks to hire an outstanding post-doctoral researcher at its Interdisciplinary Centre for Security, Reliability and Trust (SnT) (http://wwwen.uni.lu/snt). The successful candidate will participate in the activities of the SaToSS research group (http://satoss.uni.lu/) led by Prof. Dr. Sjouke Mauw. The post-doc will be working on formalizing and applying formal reasoning to real-world security problems and trust issues. The research topics will include: security protocols, security modeling, formal methods for security, socio-technical aspects of security, risk management, privacy, verification, etc. The position will be partially funded by an EU project focusing on socio-technical aspects of security. The candidate is expected to have: * A Ph.D. degree in computer science or mathematics * A proven interest in security * Strong background in formal methods and logics * Excellent written and oral English skills The university offers an initial two year employment that may be extended up to five years. The successful candidate will be working in an exciting, international and multicultural environment. The university offers highly competitive salaries and is an equal opportunity employer. Applications should be written in English and include the following documents: * Curriculum Vitae (including your contact address, work experience, list of publications) * Cover letter indicating the research area of interest and your motivation * A research statement addressing one or more research topics mentioned above (max 1 page) * Transcript of grades from all master courses taken * A short description of your Ph.D. work (max 1 page) * Contact information for 3 referees Applications should be submitted electronically via the University of Luxembourg's recruitment portal http://emea3.mrted.ly/1h9r Deadline for applications: August 31, 2012 For further inquiries please contact: Prof. Dr. Sjouke Mauw (sjouke.mauw at uni.lu) or Dr. Barbara Kordy (barbara.kordy at uni.lu) -------------- next part -------------- An HTML attachment was scrubbed... URL: From vladimir at ias.edu Sat Jul 14 06:39:37 2012 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Sat, 14 Jul 2012 06:39:37 -0400 Subject: [TYPES/announce] Participants of the Univalent Foundations program In-Reply-To: References: <7D234453-D612-41B5-94F9-B90BAB4BCA78@cmu.edu> <4FD89551.5000409@math.ias.edu> <273CD60A-9795-48F6-8E65-625D13F49AFD@cmu.edu> Message-ID: <13BEEAAA-E5EA-4674-9C74-B8CFB31E13B1@ias.edu> The list of participants in the next year program on the Univalent Foundations at the IAS, Princeton, NJ is now posted at http://www.math.ias.edu/sp/univalent/participants It will be updated as more info becomes available. Vladimir. From asperti at cs.unibo.it Tue Jul 17 05:47:35 2012 From: asperti at cs.unibo.it (Andrea Asperti) Date: Tue, 17 Jul 2012 11:47:35 +0200 Subject: [TYPES/announce] Matita Web Interface Message-ID: <500534B7.9050105@cs.unibo.it> We are pleased to announce the first release of the Matita Web Interface: http://matita.cs.unibo.it/matitaweb.shtml Matita is a light-weight implementation of the Calculus of Inductive Construction akin, for many respects, to the recent SSreflect dialect. The web inteface provides full on-line access to most system functionalities. There is nothing to install: you can immediately start playing with the prover. The release comprises a first version of the Matita Online Tutorial, covering basic Matita usage, constructive logic, and core topics in the theory of formal languages. The novelty is that not only the course is completely formalized, but it is also immediately executable. -- Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen From rlaemmel at gmail.com Tue Jul 17 20:15:19 2012 From: rlaemmel at gmail.com (Ralf Laemmel) Date: Wed, 18 Jul 2012 02:15:19 +0200 Subject: [TYPES/announce] Call for Participation: SoTeSoLa, 19-23 Aug, Koblenz In-Reply-To: References: Message-ID: Dear typists, A noteworthy subset of the TYPES community may be interested in this school as the school will address technological spaces in a sense that the type systems and semantic models of the various spaces play a role (including the mapping problems between them). Also, data management, metamodeling, and megamodeling is of much interest at the school, and these are essentially disciplines that benefit from or perhaps even require TYPES skills and methods. Please have a look. Regards, Ralf ---------------------------------------------------------------- The summer school SoTeSoLa 2012 is a highly discussion- and result-oriented Research 2.0 event on software technologies and software languages. http://planet-sl.org/sotesola2012 SoTeSoLa 2012 takes place in Koblenz 19-23 August 2012. SoTeSoLa brings together senior and junior researchers and technologists interested in software science, specifically the foundations of software technologies and the notion of technological spaces as linking together software languages, technologies, and various resources adding up to a technological and community context. SoTeSoLa also hosts this time the SATToSE 2012 seminar on "Advanced Techniques & Tools for Software Evolution". Key topics at the school are these: - Generic language technology - Co-evolution of software artifacts - Multi-language, multi-technology problems - Research 2.0 applied to software engineering - Technological spaces: past, present, and future - eLearning for language engineers & technologists - Models of knowledge resources for software developers - Model-driven engineering beyond software development - Software re/reverse/engineering in the Semantic Web Era SoTeSoLa aims at exercising a new format for a software language/technology forum, i.e., a more Research 2.0-based approach so that much focus is on understanding each others context, integrating knowledge, automation thereof, and organizing future research and work of the participants. To this end, regular lectures are de-emphasized, but a more discussion- and result-oriented format will be exercised. The event maxes out at 42 participants. SoTeSoLa 2012 is supported by the ADAPT research focus at the University of Koblenz-Landau as part of Rhineland Palatinate's Research Initiative 2008--2013. SoTeSoLa 2012 is also supported by RainCode. SoTeSoLa is hosted by the Software Languages Team in Koblenz. Deadlines: - Registration deadline: 4 August 2012 - Hotel reservation deadline: 1 August 2012 - Deadline for SATToSE presentation proposals: 25 July 2012 - Deadline for student grant applications: 25 July 2012 - Deadline for hackathon and working-group proposals: none and ASAP - Notification for SATToSE presentation proposals: 29 July 2012 - Summer school: 19 August (afternoon) - 23 August 2012 (noon) From ddino at eecs.qmul.ac.uk Wed Jul 18 11:26:27 2012 From: ddino at eecs.qmul.ac.uk (Dino Distefano) Date: Wed, 18 Jul 2012 16:26:27 +0100 Subject: [TYPES/announce] Lecturer positions in Theoretical Computer Science at Queen Mary, University of London Message-ID: <6A2AD0BA-FB44-43B1-ABAC-61C935BF5A58@eecs.qmul.ac.uk> The School of Electronic Engineering and Computer Science (EECS) is looking to recruit up to three Lecturers within the research area of Theoretical Computer Science as part of the on-going strategic investment by Queen Mary, University of London. The Theoretical Computer Science group has a reputation for work that combines leading research on fundamental mathematical and logical techniques for reasoning about computational systems with the ability to apply those techniques to practical problems, particularly in the software domain. We seek to appoint staff whose research fits with the current remit of the group and who will complement our existing expertise in areas such as verification, programming languages, program analysis, security and wide-area systems or extend it by introducing new mathematical expertise. Candidates should have a doctoral degree or equivalent and have a publication record that supports international recognition for their research. Experience of undergraduate and postgraduate teaching is highly desirable; applicants must be able to demonstrate the ability to teach at any level within the area of expertise and across a range of subjects at a more introductory level, showing enthusiasm and commitment to the process of teaching. Some overseas teaching may be required as part of the School's wide-ranging programmes of study. The School of EECS is an exciting and dynamic environment with a research grant portfolio of ?39m, of which ?29m is from EPSRC including three Platform grants, two Programme grants and a Doctoral Training Centre. In the RAE2008, 75% of the School's Computer Science submitted staff were rated 3* or 4*, with 50% for the corresponding Electronic Engineering submitted staff. The School has in excess of 60 research active academic staff, over 50 post-doctoral researchers and more than 200 PhD students, with 8 School members holding prestigious research fellowships. The posts are full time and permanent and are available from October 2012. Starting salary will be in the range ?37,819 - ?47,088 per annum. Benefits include 30 days annual leave, defined benefits pension scheme and an interest-free season ticket loan. Informal enquiries should be addressed to Professor Mark Sandler at head at eecs.qmul.ac.uk. Details about the School can be found at www.eecs.qmul.ac.uk. The closing date for applications is Tuesday 4th September 2012. Applications received after this time will not be considered. Interviews are expected to be held on Monday 8th and Tuesday 9th October 2012. For further info: http://webapps.qmul.ac.uk/hr/vacancies/jobs.php?id=3218 Valuing Diversity & Committed to Equality ---- Dino Distefano Department of Computer Science Queen Mary University of London Mile End Road, London E1 4NS United Kingdom Phone: +44(0)20 7882 8794 -- Fax: +44 (0)20 8980 6533 email: ddino at dcs.qmul.ac.uk -- http://www.dcs.qmul.ac.uk/~ddino -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Wed Jul 18 16:17:54 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Wed, 18 Jul 2012 22:17:54 +0200 Subject: [TYPES/announce] Haskell Symposium 2012 - Call for Participation (early registration closes 9th August) Message-ID: <500719F2.2080606@informatik.uni-bonn.de> ==================================================================== CALL FOR PARTICIPATION ACM SIGPLAN Haskell Symposium 2012 Copenhagen, Denmark 13th September, 2012 (directly after ICFP) http://www.haskell.org/haskell-symposium/2012/ ==================================================================== The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Accepted papers and programme: ============================== * http://haskell.org/haskell-symposium/2012/#schedule REGISTRATION IS NOW OPEN: ========================= * http://www.icfpconference.org/icfp2012/registration.html * Early registration deadline: 9th August, 2012 Local arrangements (including travel and accommodation): ======================================================== * http://www.icfpconference.org/icfp2012/local.html See you in Copenhagen, Janis Voigtlaender Haskell 2012 Programme Chair ==================================================================== From scm-ml at iis.sinica.edu.tw Thu Jul 19 02:44:51 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml) Date: Thu, 19 Jul 2012 14:44:51 +0800 Subject: [TYPES/announce] PEPM 2013: Second Call for Papers Message-ID: <6B32B092-783E-4260-9088-815D2BA47848@iis.sinica.edu.tw> C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ==================================================================== NEWS - Submission deadline: September 28 (abstract) and October 2 (paper) - Invited speakers: Zhenjiang Hu and Peter Thiemann - Special issue of Science of Computer Programming (SCP) (5-Year Impact Factor of SCP: 1.304) ==================================================================== SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of 'short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. IMPORTANT DATES Abstract submission: September 25, 2012 Paper submission: October 2, 2012 Notification: November 6, 2012 Camera ready: November 14, 2012 SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France) From Dejan.Nickovic at ait.ac.at Thu Jul 19 10:50:07 2012 From: Dejan.Nickovic at ait.ac.at (Nickovic Dejan) Date: Thu, 19 Jul 2012 16:50:07 +0200 Subject: [TYPES/announce] FORMATS 2012 - Call for Participation Message-ID: <7E6452B3D693BB45A4C92F20A9331B5A78842C2DD2@MAILBOX.arc.local> -------------------------------------------------------------------------------- Call for Participation 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). -------------------------------------------------------------------------------- Invited Speakers Moshe Vardi, Rice University Title: Compositional Temporal Synthesis Twan Basten, Eindhoven University of Technology Title: Model-Driven Design-Space Exploration for Software-Intensive Embedded Systems Kim G. Larsen, Aalborg University Statistical Model Checking, Refinement Checking, Optimization... for Stochastic Hybrid Automata -------------------------------------------------------------------------------- Program The program for FORMATS and QEST is available on the FORMATS homepage: http://go.warwick.ac.uk/formats2012/program/ -------------------------------------------------------------------------------- Registration The registration page is available on the FORMATS homepage: http://go.warwick.ac.uk/formats2012/registration/ -------------------------------------------------------------------------------- Organizers PC Chairs Marcin Jurdzinski, University of Warwick Dejan Nickovic, Austrian Institute of Technology Local Arrangements Chair Anton Stefanek, Imperial College London From dallago at cs.unibo.it Mon Jul 23 06:30:11 2012 From: dallago at cs.unibo.it (Ugo Dal Lago) Date: Mon, 23 Jul 2012 12:30:11 +0200 Subject: [TYPES/announce] Special Issue TCS: Implicit Computational Complexity Message-ID: <500D27B3.7090502@cs.unibo.it> [Apologies if you receive multiple copies of this message] THEORETICAL COMPUTER SCIENCE Special Issue on Implicit Computational Complexity Deadline: October 1st 2012 Guest Editors: Ugo Dal Lago and Guillaume Bonfante CALL FOR PAPERS --------------- The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to delineate complexity-bounded computation (e.g. polynomial time, polynomial space 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/computational principles implying complexity properties. Contributions on various aspects of ICC including (but not exclusively) are welcome : - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - complexity analysis, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). This special issue is a post-conference publication of DICE 2012 workshop. The first DICE workshop was held in 2010 in Paphos, Cyprus, the second in Saarbrucken in 2011, and the third one in Tallinn in 2012 (http://dice2012.cs.unibo.it/), all of them as satellite events of ETAPS. SUBMISSIONS ----------- Submissions, in pdf format, must be sent to dallago at cs.unibo.it and no later than OCTOBER 15th, 2012. Papers will be processed as soon as they are submitted. We encourage to look at http://projects.csail.mit.edu/iandc/info.html and the use of Elsevier's elsarticle.cls latex macro package, that can be retrieved from http://www.elsevier.com/wps/find/authorsview.authors/elsarticle See also : http://dice12.cs.unibo.it for updated information. For any further information, please contact Ugo Dal Lago (dallago at cs.unibo.it). TENTATIVE CALENDAR ------------------ Submission: October 15th, 2012 Notification of acceptance/rejection: March/April 2013 Submission of final version: June/July 2013. From c.grelck at uva.nl Mon Jul 23 09:45:43 2012 From: c.grelck at uva.nl (Clemens Grelck) Date: Mon, 23 Jul 2012 15:45:43 +0200 Subject: [TYPES/announce] FHPC 2012: ACM SIGPLAN Workshop on Functional High Performance Computing Message-ID: <500D5587.6080202@uva.nl> ====================================================================== CALL FOR PARTICIPATION FHPC 2012 ACM SIGPLAN Workshop on Functional High Performance Computing Copenhagen, Denmark September 15th, 2012 http://www.hiperfit.dk/fhpc12/ Co-located with the International Conference on Functional Programming (ICFP 2012) ====================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative, high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the workshop is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. The 2012 FHPC workshop comes with a particular theme motivated by geographic co-location with the newly established HIPERFIT Research Centre for Functional High-Performance Computing for Financial Information Technology (www.hiperfit.dk) at the University of Copenhagen. Hence, we particularly encouragedsubmissions with a background in computational finance. Notwithstanding, the workshop welcomed submissions from other application domains as much as general-purpose work on the theory and practice of declarative approaches to high-performance computing. ====================================================================== ACCEPTED PAPERS AND PROGRAMME: * http://www.hiperfit.dk/fhpc12/ ====================================================================== REGISTRATION IS NOW OPEN: * http://www.icfpconference.org/icfp2012/registration.html * Early registration deadline: August 9th, 2012 ====================================================================== LOCAL ARRANGEMENTS: * http://www.icfpconference.org/icfp2012/local.html ====================================================================== Looking forward to seeing you in Copenhagen, Andrzej Filinksi and Clemens Grelck FHPC 2012 Chairs ====================================================================== -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From alain at frisch.fr Mon Jul 23 12:29:33 2012 From: alain at frisch.fr (Alain Frisch) Date: Mon, 23 Jul 2012 18:29:33 +0200 Subject: [TYPES/announce] ML workshop 2012: call for participation Message-ID: <500D7BED.5050709@frisch.fr> ======================================================================= CALL FOR PARTICIPATION ACM SIGPLAN Workshop on ML Thursday, September 13, 2012, Copenhagen, Denmark (co-located with ICFP) http://www.lexifi.com/ml2012 ======================================================================= The ML workshop is the annual event where users, developers and researchers of ML languages (SML, OCaml, F#) can interact and discuss ongoing research, open problems and innovative applications. ML2012 will be held in Copenhagen on September 13, just after the ICFP conference, and close to other exciting events, like OUD (OCaml Users and Developers), CUFP (Commercial users of Functional Programming), and more. Program: http://www.lexifi.com/ml2012 Registration (early registration deadline: August 9!): http://icfpconference.org/icfp2012/registration.html From albertolluch at gmail.com Tue Jul 24 06:27:41 2012 From: albertolluch at gmail.com (Alberto Lluch Lafuente) Date: Tue, 24 Jul 2012 12:27:41 +0200 Subject: [TYPES/announce] PhD positions in Computer Science at IMT Lucca (Italy) - Deadline September 26, 2012 Message-ID: (Apologies for multiple posting) The Institute for Advanced Studies IMT Lucca - Italy ( http://www.imtlucca.it/) announces 36 PhD scholarships providing about ?13,600 EUR gross yearly plus accommodation and full board. Deadline for application is September 26, 2012. IMT Lucca (Italy) is an Institute for Advanced Studies and an International Graduate School that acts as a research university with the aim of forming human capital in disciplines characterized by their high potential for concrete application. IMT strives to reach the fusion of theoretical comprehension and practical relevance. PhD programs are taught exclusively in English. The PhD Program includes a Track in Computer, Decision and Systems Science with a specific Curriculum in Computer Science. The track is coordinated by Rocco De Nicola and aims at preparing researchers and professionals with a wide knowledge of the theoretical foundations of computer science and informatics, control systems and optimization, image analysis, and management science. The curriculum in Computer Science focuses on languages, models, algorithms, and verification methods for modern distributed systems. PhD students following the curriculum in Computer Science will perform their activities in collaboration with the SysMA research unit ( http://sysma.lab.imtlucca.it/) on system modelling and analysis. This research unit focuses on formal languages, models, methodologies and tools to support the development of correct software systems with high quality in terms of predictability, security, efficiency, usability, re-usability, maintainability, and modularity. We hope that you might consider applying http://www.imtlucca.it/phd/call_for_applications/ If you are not personally interested, please help us signaling these opportunities to colleagues and collaborators. For further information please contact the sender of this mail. -- Alberto Lluch Lafuente Assistant Professor @ IMT Lucca albertolluch at gmail.com; alberto.lluch at imtlucca.it http://www.albertolluch.com http://www.linkedin.com/in/albertolluch http://www.imtlucca.it/alberto.lluch+lafuente skype/albertolluch +39 3334186635; +39 05834326594 -------------- next part -------------- An HTML attachment was scrubbed... URL: From lutz at lix.polytechnique.fr Tue Jul 24 12:02:59 2012 From: lutz at lix.polytechnique.fr (Lutz Strassburger) Date: Tue, 24 Jul 2012 18:02:59 +0200 (CEST) Subject: [TYPES/announce] Postdoc Position at LIX/Ecole Polytechnique Message-ID: There is a 12 month postdoc position available at LIX, Ecole Polytechnique, within the PARSIFAL team. http://team.inria.fr/parsifal/ The selected candidate will have to conduct research on one of the topics currently studied in the Parsifal team, in particular within the projects - STRUCTURAL (http://www.lix.polytechnique.fr/~lutz/orgs/structural.html), - ProofCert (http://team.inria.fr/parsifal/proofcert/), and - RAPT (http://www.lix.polytechnique.fr/~kaustuv/rapt/) Starting date should be between September and December 2012. Profile: -------- Candidates must have a PhD in Computer Science with strong background in proof theory, declarative programming, and related fields. Application: ------------ Applicants should send their application, consisting of a CV, a research statement of 1-2 pages, explaining how they would integrate in the Parsifal team, and two recommendation letters (or names of at least two references) to: Lutz Strassburger Deadline: August 24, 2012 From andreas.abel at ifi.lmu.de Wed Jul 25 09:52:18 2012 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Wed, 25 Jul 2012 15:52:18 +0200 Subject: [TYPES/announce] PLPV 2013 First Call for Papers Message-ID: <500FFA12.9060102@ifi.lmu.de> The Seventh ACM SIGPLAN Workshop on Programming Languages meets Program Verification (PLPV 2013) http://plpv.tcs.ifi.lmu.de/ 22nd January, 2013 Rome, Italy (Affiliated with POPL 2013) Call for Papers Overview The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. One example are dependently typed programming languages, which leverage a language's type system to specify and check rich specifications. Another example are extended static checking systems which incorporate contracts with either static or dynamic contract checking. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage interaction between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (based on types, Hoare-logic, abstract interpretation, etc), target different kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc). Important Dates Submission 8th October, 2012 (Monday) Notification 1st November, 2012 (Thursday) Final Version 8th November, 2012 (Thursday) Workshop 22nd January, 2013 (Tuesday) Submissions We seek submissions of up to 12 pages related to the above topics; shorter submissions are also welcome. Submissions may describe new work, propose new challenge problems for language-based verification techniques, or present a known idea in an elegant way (i.e., a pearl). Submissions should be prepared with SIGPLAN two-column conference format. Submitted papers must adhere to the SIGPLAN republication policy. Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. To submit a paper, access the online submission site at http://www.easychair.org/conferences/?conf=plpv2013. Publication Accepted papers will be published by the ACM and will appear in the ACM Digital library. Program Committee Andreas Abel Ludwig-Maximilians-University Munich (co-chair) Robert Atkey University of Strathclyde Harley Eades The University of Iowa Chung-Kil Hur Max Planck Institute for Software Systems Brigitte Pientka McGill University Andrew Pitts University of Cambridge Fran?ois Pottier INRIA Tim Sheard Portland State University (co-chair) Makoto Takeyama Advanced Industrial Science and Technology -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich Oettingenstr. 67, D-80538 Munich, GERMANY andreas.abel at ifi.lmu.de http://www2.tcs.ifi.lmu.de/~abel/ From james.cheney at gmail.com Wed Jul 25 11:08:35 2012 From: james.cheney at gmail.com (James Cheney) Date: Wed, 25 Jul 2012 16:08:35 +0100 Subject: [TYPES/announce] XLDI 2012: Cross-Model Language Design and Implementation (Call for Participation) Message-ID: CALL FOR PARTICIPATION 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) You need an ICFP Sunday pass to participate in XLDI 2012. Early registration ends August 1, 2012. For details on ICFP registration please see http://icfpconference.org/icfp2012/registration.html XLDI 2012 focuses on the foundations, design, implementation, and applications of languages that smoothly integrate different execution or data models. We have assembled an interesting program of 7 presentations, covering software-defined networks, Haskell DSLs for interactive web services, typing of massive JSON datasets, rewrite optimization of dataflow programs, and languages designed to build domain-specific runtimes. INVITED SPEAKERS: - Fritz Henglein (DIKU, University of Copenhagen) - Christopher Re (University of Wisconsin) SCIENTIFIC PROGRAMME: - Naga Praveen Katta, Jennifer Rexford, David Walker: Logic Programming for Software Defined Networks - Andrew Farmer, Andy Gill: Haskell DSLs for Interactive Web Services - Dario Colazzo, Giorgio Ghelli, Carlo Sartiani: Typing Massive JSON Datasets - Fabian Hueske, Aljoscha Krettek, Kostas Tzoumas: Enabling Rewrite Optimizations of Data Flow Programs Through Static Code Analysis - Panchapakesan Shyamshankar, Zachary Palmer, Yanif Ahmad: K3: Language Design for Building Multi-Platform, Domain-Specific Runtimes SPONSORS: XLDI 2012 is sponsored by ACM SIGPLAN and LogicBlox. We are looking forward to see you in Copenhagen, --James Cheney, Torsten Grust (XLDI co-chairs) More information about XLDI 2012: http://workshops.inf.ed.ac.uk/xldi2012/ More information about ICFP 2012: http://icfpconference.org/icfp2012/ From james.cheney at gmail.com Wed Jul 25 12:22:07 2012 From: james.cheney at gmail.com (James Cheney) Date: Wed, 25 Jul 2012 17:22:07 +0100 Subject: [TYPES/announce] XLDI 2012: Cross-Model Language Design and Implementation (Call for Participation) In-Reply-To: References: Message-ID: A correction: The early registration in the above announcement is August 9, the same as for all ICFP-affiliated events, not August 1. Sorry! (and thanks to Adam Chlipala for noticing.) --James On Wed, Jul 25, 2012 at 4:08 PM, James Cheney wrote: > CALL FOR PARTICIPATION > > 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) > > > You need an ICFP Sunday pass to participate in XLDI 2012. > Early registration ends August 1, 2012. For details on > ICFP registration please see > > http://icfpconference.org/icfp2012/registration.html > > > XLDI 2012 focuses on the foundations, design, implementation, > and applications of languages that smoothly integrate different > execution or data models. > > We have assembled an interesting program of 7 presentations, covering > software-defined networks, Haskell DSLs for interactive web services, > typing of massive JSON datasets, rewrite optimization of dataflow > programs, and languages designed to build domain-specific runtimes. > > INVITED SPEAKERS: > > - Fritz Henglein (DIKU, University of Copenhagen) > - Christopher Re (University of Wisconsin) > > > SCIENTIFIC PROGRAMME: > > - Naga Praveen Katta, Jennifer Rexford, David Walker: > Logic Programming for Software Defined Networks > > - Andrew Farmer, Andy Gill: > Haskell DSLs for Interactive Web Services > > - Dario Colazzo, Giorgio Ghelli, Carlo Sartiani: > Typing Massive JSON Datasets > > - Fabian Hueske, Aljoscha Krettek, Kostas Tzoumas: > Enabling Rewrite Optimizations of Data Flow Programs > Through Static Code Analysis > > - Panchapakesan Shyamshankar, Zachary Palmer, Yanif Ahmad: > K3: Language Design for Building Multi-Platform, > Domain-Specific Runtimes > > > SPONSORS: > > XLDI 2012 is sponsored by ACM SIGPLAN and LogicBlox. > > > We are looking forward to see you in Copenhagen, > > --James Cheney, Torsten Grust > (XLDI co-chairs) > > > > More information about XLDI 2012: > http://workshops.inf.ed.ac.uk/xldi2012/ > > More information about ICFP 2012: > http://icfpconference.org/icfp2012/ From tobias.wrigstad at it.uu.se Fri Jul 27 06:24:42 2012 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Fri, 27 Jul 2012 12:24:42 +0200 Subject: [TYPES/announce] Associate professor position in computer science at Uppsala University Message-ID: SENIOR LECTURER (ASSOCIATE PROFESSOR) POSITION IN COMPUTER SCIENCE at Uppsala university, department of Information Technology. http://www.uu.se/jobb/teacher/annonsvisning?languageId=1&tarContentId=198073 While the text for the position reads pretty generic, it is oriented towards programming. The application deadline is August 31st, but it is common practise that applicants short on time, can submit a pro forma application and complete it with the required appendices later. The Department of Information Technology has a staff of 250, including 30 full professors, 70 other senior academic staff and 100 Ph.D. students and has a leading position in research and teaching. Sweden has several competitive grant schemes for funding basic, applied and strategic research in parallel with EU funding. Applicants should not be put off by the Swedish *formal* teacher training requirements, which are pretty steep on an International scale. Applicants with past teaching experience can be employed on the condition of meeting the formal requirements in the first year of their employment. ------------------------------------------------------------ Tobias Wrigstad, associate professor (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 smaragd at di.uoa.gr Fri Jul 27 12:02:37 2012 From: smaragd at di.uoa.gr (Yannis Smaragdakis) Date: Fri, 27 Jul 2012 12:02:37 -0400 Subject: [TYPES/announce] Postdoc positions -- Athens Message-ID: <5012BB9D.80100@di.uoa.gr> There are openings for postdoctoral research associates at the University of Athens, to work with Yannis Smaragdakis (http://smaragd.org) on program analysis and on programming language design. The position has long-term funding (for 3-5 years, initially on a shorter contract) and a competitive salary. There are two separate projects covered by this ad: One is on program analysis algorithms, expressed declaratively. The other is on designing new language features for type-safe separation of concerns, extending past work on "class morphing". The University of Athens is the oldest university in Greece and arguably the most prestigious arts and sciences school in the country. The Department of Informatics is often included in top-100 international rankings of research quality and hosts several world-visible scientists (including two ACM/IEEE Fellows, one Goedel prize recipient, 4 ERC award recipients, and more). The department is located on the main campus, and is within 2km of the town center, 3km from the very heart of Athens (http://g.co/maps/jcqex). Athens is a vibrant town with a very intense cultural life and moderate cost of living. The department features excellent graduate students and you will have the opportunity to collaborate with several of them in the context of these projects. The working language at the University of Athens is Greek but applicants fluent in English will have no problems in the context of the group or greater environment. For more information, please contact smaragd at di.uoa.gr and include some background on your work. -------------- next part -------------- An HTML attachment was scrubbed... URL: From jnfoster at cs.cornell.edu Fri Jul 27 15:53:27 2012 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Fri, 27 Jul 2012 15:53:27 -0400 Subject: [TYPES/announce] WRiPE '12: deadline extended Message-ID: Due to several requests we've decided to push the submission deadline back a few days to August 3rd (anywhere in the world). We look forward to receiving your submissions. The 2nd International Workshop on Rigorous Protocol Engineering http://www.cs.cornell.edu/conferences/wripe2012 Austin, Texas, USA 30 October 2012 co-located with ICNP 2012 OVERVIEW The increased performance and maturity of verification techniques, including the use of tools such as model checkers, theorem provers, and SAT/SMT solvers, provides a rich set of techniques that could be applied to the area of networking. Unfortunately these techniques are rarely used in practice. WRiPE is an inter-disciplinary workshop that seeks to bring together researchers from the networking, formal methods, and programming languages communities to discuss current research on rigorous network protocol design and implementation. The goal of the workshop is to reinvigorate and revitalize the application of formal methods to the design, analysis, and implementation of protocols. SCOPE We include under the heading of verification any rigorous method of synthesizing an implementation, demonstrating that an existing implementation satisfies a given specification, or showing how reliable conclusions can be extracted from measurements. Under network protocols we include the traditional IP stack, emerging software router platforms such as OpenFlow, as well as routing, transport, application overlays, wireless protocols for carrier, enterprise, and data center networks. We are also interested in rigorous methods for establishing security properties of protocols. Specific topics of interest include (but are not limited to) the following: * Correct-by-construction methods for developing protocols. * Applications of model checkers, theorem provers, SAT/SMT solvers, and so on to network protocols. * Techniques for synthesizing protocol implementations and configurations. * Domain specific languages for describing protocols. * Run-time techniques for formally verifying and testing the correctness of protocols. IMPORTANT DATES Submission: 3 August 2012 anywhere in the world (extended from 31 July) Notification: 3 September 2012 Camera-ready: 20 September 2012 WRiPE 2012: 30 October 2012 ORGANIZERS Nate Foster (Cornell University, co-chair) Alexander Gurney (University of Pennsylvania, co-chair) Anja Feldmann (Deutsche Telekom Laboratories/TU Berlin) Limin Jia (Carnegie Mellon University) Peyman Kazemian (Stanford University) Dejan Kostic (Ecole Polytechnique Federale de Lausanne) Hung Nguyen (University of Adelaide) Olaf Maennel (Loughborough University) Robbert van Renesse (Cornell University) Michael Schapira (Hebrew University of Jerusalem) Jonathan Sobel (Cisco Systems) Stefano Vissicchio (Universite Catholique de Louvain) David Walker (Princeton University) Pamela Zave (AT&T Research) Wenchao Zhou (Georgetown University) AUTHOR GUIDELINES Prospective authors are invited to submit papers in English presenting original research. Submissions to WRiPE must not be concurrent with a substantially similar submission to a conference or workshop, including condensed versions of work that has been submitted and is currently under review. Please do not submit abbreviated versions of journal or conference papers. Reviewing will not be blind. We encourage submissions of work-in-progress based on novel and interesting ideas and tool demonstrations. All submitted papers must be no longer than six (6) pages in double-column format with standard margins (i.e., at least one inch all around) and at least a 10 point font. Longer submissions will not be reviewed. We suggest using the IEEE Transactions Style: http://www.ieee.org/publications_standards/publications/authors/authors_journals.html PROCEEDINGS Accepted papers will be published by the IEEE Press. From kos at informatik.uni-marburg.de Mon Jul 30 10:43:33 2012 From: kos at informatik.uni-marburg.de (Klaus Ostermann) Date: Mon, 30 Jul 2012 16:43:33 +0200 Subject: [TYPES/announce] Open PhD and Postdoc positions at the University of Marburg Message-ID: <50169D95.70603@informatik.uni-marburg.de> Dear all, we are happy to announce that we have new openings at the PhD and PostDoc level. The Programming Language and Software Technology Group, headed by Klaus Ostermann, conducts research dedicated to developing new technologies that help to construct high-quality software in a productive way. We use and develop an exciting set of technologies involving functional, object-oriented, domain-specific and aspect-oriented programming languages, software product lines, parser technology, language-integrated queries, static and dynamic software analysis, type systems, and many other topics. For more information consult http://www.uni-marburg.de/fb12/ps/ We offer positions with a lot of freedom to choose and develop research topics, few obligations, collaboration with a very strong group of researchers, competitive salary, and opportunities to develop a strong academic career path. We expect PhD applicants to have demonstrated the potential for scientific excellence in areas related to our own research, and applicants for Postdoc positions to have published in high-quality venues related to our research domains. Knowledge of German is a plus but not required; the default communication language in our group is English. Marburg is an attractive small "student town" right in the center of Germany. We are only an hour ride away from Frankfurt Airport, which will bring you to many destinations worldwide in a single hop. To apply for a position, please send informal inquiries to Klaus Ostermann (contact data can be found on our website, or reply to this email). We are flexible with regard to the starting date, but generally the sooner the better. We are looking forward to hearing from you. Klaus Ostermann From icfp.publicity at gmail.com Tue Jul 31 07:13:06 2012 From: icfp.publicity at gmail.com (Wouter Swierstra) Date: Tue, 31 Jul 2012 13:13:06 +0200 Subject: [TYPES/announce] ICFP 2012: Second call for participation Message-ID: ===================================================================== Second Call for Participation The 17th ACM SIGPLAN International Conference on Functional Programming (ICFP 2012) and affiliated events http://www.icfpconference.org/icfp2012/ Copenhagen, Denmark, Sep 9-15, 2012 ===================================================================== There are less than ten days left until the early registration expires! ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. A full week dedicated to functional programming: 1 conference, 1 symposium, 9 workshops, 8 tutorials, programming contest results, student research contest * Program: http://icfpconference.org/icfp2012/program.html * Local arrangements (including travel and accommodation): http://icfpconference.org/icfp2012/local.html * Registration is available via: http://icfpconference.org/icfp2012/registration.html * Follow @icfp_conference on twitter for the latest news: http://twitter.com/#!/icfp_conference There are several events affiliated with ICFP: September 9 Workshop on Cross-paradigm Language Design and Implementation Workshop on Generic Programming Workshop on Higher-Order Programming with Effects Workshop on Logical Frameworks and Meta-languages: Theory and Practice September 10-12 ICFP - main conference September 13 Commercial Users of Functional Programming ? Day 1 (CUFP Tutorials) Haskell Symposium Workshop on ML September 14 Commercial Users of Functional Programming ? Day 2 (CUFP Tutorials) Erlang Workshop Haskell Implementors' Workshop OCaml Users and Developers Workshop September 15 Commercial Users of Functional Programming ? Day 3 (CUFP Talks) Workshop on Functional High-Performance Computing Tutorial on Compiler Construction in Haskell Tutorial on the Grammatical Framework Conference organizers: * General Chair: Peter Thiemann, University of Freiburg * Program Chair: Robby Findler, Northwestern University * Local Arrangements Chair: Fritz Henglein, University of Copenhagen * Industrial Relations Chair: Andy Adams-Moran, Galois * Workshop Co-Chairs: Patrik Jansson, Chalmers University of Technology Gabriele Keller, University of New South Wales * Programming Contest Chair: Edwin Brady, University of St. Andrews Kevin Hammond, University of St. Andrews * Publicity Chair: Wouter Swierstra, Utrecht University * Video Chair: Malcolm Wallace, Standard Chartered Bank * Student Research Competition Chair: Doaitse Swierstra, Utrecht University ===================================================================== From rduncan at ulb.ac.be Tue Jul 31 09:25:54 2012 From: rduncan at ulb.ac.be (Ross Duncan) Date: Tue, 31 Jul 2012 15:25:54 +0200 Subject: [TYPES/announce] cfp: QPL 2012 - Brussels 10-12 October 2012 Message-ID: <456F4FE4-03A7-44DE-8825-298DD4956AA6@ulb.ac.be> ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Universit? Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== We invite contributions to QPL 2012! The DEADLINE IS SOON. The 9th workshop on Quantum Physics and Logic will bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science techniques for the study of physical behaviour in general. There will be full programme of contributed talks, and invited lectures from: - Stefaan Caenepeel (Vrije Universiteit Brussel) - Jens Eisert (Frei Universit?t Berlin) [TBC] - Serge Massar (Universit? Libre de Bruxelles - Paul-Andr? Melli?s (Universit? Paris Diderot - Paris 7) There will be a workshop dinner on Thursday night. There are funds available to enable the participation of students. Please see the webpage for details. SUBMISSION OF PAPERS Prospective speakers are invited to submit a contribution to the worksshop. We are considering two kinds of contributions. - Short contributions consisting of a 3 page description of the work, and a link to a paper published elsewhere. - Longer original contributions consisting of a 5-12 page extended abstract which provides sufficient evidence of results of genuine interest and provides sufficient detail to allow the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Submissions should be prepared using LaTeX, and must be submitted in PDF format and can be done via easy chair. Extended versions of accepted original research contributions will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the workshop. IMPORTANT DATES All deadlines are at 9am Brussels time (i.e. CEST, UTC+2). - 20 August: Submission of paper - 10 September: Notification of authors - 24 September: Camera-ready version due Programme Committee - Dan Browne - Giulio Chiribella - Bob Coecke - Andreas Doering - Ross Duncan (co-chair) - Simon Gay - Prakash Panangaden (co-chair) - Robert Raussendorf - Mehrnoosh Sadrzadeh - Peter Selinger - Bas Spitters Steering Committeee - Bob Coecke - Prakash Panangaden - Peter Selinger Local Organisation Ross Duncan - Email : rduncan at ulb.ac.be - Telephone : +32 2 650 5512 ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Universit? Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== From hidaka at nii.ac.jp Thu Aug 2 00:57:56 2012 From: hidaka at nii.ac.jp (Soichiro Hidaka) Date: Thu, 02 Aug 2012 13:57:56 +0900 Subject: [TYPES/announce] NII Shonan Meetings - Call for seminar proposals Message-ID: <20120802135756V.hidaka@nii.ac.jp> <<< This is the fourth post. Proposals are received throughout the year, but the next deadline is September 15th, i.e., opportunities increased from twice to three times a year. >>> 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 (Position/First Name/Middle Name/Last Name/Affiliation/Email/Gender/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, September 15th and 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: 8,000 Yen/day - Participants from industry: 15,000 Yen/day - Accompanied persons to participants: 7,500 Yen/day (Meal charge is not included.) (5) Organization Organization Committee: Yoh'ichi Tohkura (NII): Chair Zhenjiang Hu (NII) Akiko Aizawa (NII) Hiroshi Hosobe (NII) Hiroyuki Kato (NII) Soichiro Hidaka (NII) Academic Committee: Zhenjiang Hu (NII): Chair Akiko Aizawa (NII) Ken?ichi Kawarabayashi (NII) Masaru Kitsuregawa (Univ. of Tokyo) Jeff Kramer (Imperial College London) Katsumi Inoue (NII) Kae Nemoto(NII) Bashar Nuesibeh (Lero/Open Univ.) Yoichi Sato (Univ. of Tokyo) Shin?ichi Satoh (NII) Satoshi Sekine (New York Univ./Rakuten Inst. of Tech.) Akihiko Takano (NII) (6) Inquiry Should you have any questions, please feel free to contact us by sending an email to shonan at nii.ac.jp More information about NII Shonan Meetings is available at the following website: http://www.nii.ac.jp/shonan/ ============================================================ Soichiro Hidaka, Ph.D Assistant Professor National Institute of Informatics E-mail: hidaka at nii.ac.jp URL : http://research.nii.ac.jp/~hidaka ============================================================ From lengrand at lix.polytechnique.fr Thu Aug 2 11:21:03 2012 From: lengrand at lix.polytechnique.fr (Stephane Graham-Lengrand (Work)) Date: Thu, 02 Aug 2012 17:21:03 +0200 Subject: [TYPES/announce] CfP: JLC Special Issue on Computational Logic, in honour of Roy Dyckhoff In-Reply-To: <501A9A2F.9040200@lix.polytechnique.fr> References: <501A9A2F.9040200@lix.polytechnique.fr> Message-ID: <501A9ADF.3030601@lix.polytechnique.fr> **************************************************************************** Call for Papers JOURNAL OF LOGIC AND COMPUTATION Special Issue on Computational Logic, in honour of Roy Dyckhoff *** Submission deadline: December 1st, 2012 *** **************************************************************************** AIMS AND SCOPE This special issue of the Journal of Logic and Computation (JLC) is devoted to Roy Dyckhoff's broad research interests, as illustrated during the workshop that was held in his honour in November 2011 in St Andrews: http://www.lix.polytechnique.fr/~lengrand/Events/Dyckhoff/ Covered under the title of Computational Logic, the topics include, but are not limited to: - automated reasoning - category theory - constructivity - explicit substitution calculi - functional programming - Gentzen systems (and Beyond) - intuitionistic logic - lambda calculus - linear logic - logic programming - non-classical logics - machine-assisted meta-theory - modal logics - proof-theoretic semantics - proof search - proof theory - provability logic - sequent calculi - tableaux methods - term rewriting - type theory SUBMISSION Submission should be in English, using (at first) the PDF format, and sent to either of the guest editors below. We expect submissions to present original contributions of the highest quality, that have not been previously published in, or submitted to, another journal. Each submission will be subject to two reviewers. IMPORTANT DATES Submission of papers: December 1st, 2012 Expected publication: Spring 2013 GUEST EDITORS Didier Galmiche, Universit? de Lorraine - LORIA (Didier.Galmiche at loria.fr) St?phane Graham-Lengrand, CNRS - Ecole Polytechnique (graham-lengrand at lix.polytechnique.fr) From tiezzi at dsi.unifi.it Thu Aug 2 11:29:53 2012 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Thu, 2 Aug 2012 17:29:53 +0200 Subject: [TYPES/announce] 2nd CfP: JLAP Special Issue on Automated Specification and Verification of Web Systems Message-ID: <61E00AB9-59EF-402B-B70B-89FFEED95048@dsi.unifi.it> [Apologies for multiple copies] **************************************************************************** Second Call for Papers JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING Special Issue on Automated Specification and Verification of Web Systems http://rap.dsi.unifi.it/wwv2011/jlap-wwv.html **************************************************************************** IMPORTANT DATES Submission of papers: August 27, 2012 First review decision: November 26, 2012 Revision due: January 14, 2013 Acceptance notification: February 25, 2013 Final manuscript due: March 25, 2013 Expected publication: Summer 2013 AIMS AND SCOPE This special issue of the Journal of Logic and Algebraic Programming (JLAP, http://www.journals.elsevier.com/the-journal-of-logic-and-algebraic-programming/) is devoted to the topics of: - the 7th International Workshop on Automated Specification and Verification of Web Systems (WWV 2011, http://rap.dsi.unifi.it/wwv2011/), which took place on June 2011 in Reykjavik, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2011); - the 8th International Workshop on Automated Specification and Verification of Web Systems (WWV 2012, http://users.dsic.upv.es/~jsilva/wwv2012/), which took place on June 2012 in Stockholm, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2012). This is however an open call for papers, therefore both participants of the workshops and other authors are encouraged to submit contributions. The aim of this special issue is to provide 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 have 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. We solicit original papers on topics of either theoretical or applied interest, which 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. SUBMISSION We expect original articles (typically 20-30 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published in another journal and that must not be simultaneously submitted for publication elsewhere. Each paper will undergo a thorough evaluation by at least two reviewers. The authors will have about 50 days to incorporate the comments of the reviewers and submit a revised version of their papers, which will be evaluated again by the reviewers to make a final decision. Contributions should be in PDF format and must comply with JLAP's author guidelines, which can be retrieved from http://www.elsevier.com/wps/find/journaldescription.cws_home/621520/authorinstructions. The manuscripts must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are handled using the Elsevier Editorial System and can be uploaded using the following link: http://ees.elsevier.com/jlap/default.asp In the submission process, the authors must select the article type 'Special Issue:WWV 2011'. GUEST EDITORS Laura Kovacs (lkovacs at complang.tuwien.ac.at) Vienna University of Technology, Austria Rosario Pugliese (rosario.pugliese at unifi.it) University of Florence, Italy Josep Silva (jsilva at dsic.upv.es) Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi (francesco.tiezzi at imtlucca.it) IMT Advanced Studies Lucca, Italy From rxg at cs.cmu.edu Thu Aug 2 15:59:47 2012 From: rxg at cs.cmu.edu (Ronald Garcia) Date: Thu, 2 Aug 2012 12:59:47 -0700 Subject: [TYPES/announce] WGP 2012 Call for Participation Message-ID: <5A866189-FAE4-4F0A-8AAF-0E390ACC785F@cs.cmu.edu> ====================================================================== CALL FOR PARTICIPATION 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. Accepted papers and preliminary schedule: ----------------------------------------- 09:00 Welcome 09:10 Nicolas Frisby, Andy Gill and Perry Alexander. A Pattern for Almost Homomorphic Functions 09:50 Jos? Pedro Magalh?es. The Right Kind of Generic Programming 10:30 Break 11:00 Jaakko J?rvi, Magne Haveraaen, John Freeman and Mat Marcus. Expressing Multi-Way Data-Flow Constraint Systems as a Commutative Monoid Makes Many of their Properties Obvious 11:40 Seyed Hossein Haeri, Sibylle Schupp and Jonathan H?ser. Using Functional Languages to Facilitate C++ Metaprogramming 12:20 Lunch 14:00 Sam Lindley. Embedding F 14:40 Steven Keuchel and Johan T. Jeuring. Generic conversions of abstract syntax representations 15:20 Break 16:00 Ralf Hinze, Daniel James, Thomas Harper, Nicolas Wu and Jos? Pedro Magalh?es. Sorting with Bialgebras and Distributive Laws 16:40 Discussion 17:30 End See also: http://www.wgp-sigplan.org/2012 REGISTRATION IS NOW OPEN: ------------------------- * http://www.icfpconference.org/icfp2012/registration.html * EARLY REGISTRATION DEADLINE: 9th August, 2012 Local arrangements (including travel and accommodation): -------------------------------------------------------- * http://www.icfpconference.org/icfp2012/local.html Andres L?h and Ronald Garcia WGP 2012 Program Co-Chairs -------------------------------------------------------------------- From sacerdot at cs.unibo.it Thu Aug 2 23:10:24 2012 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Fri, 03 Aug 2012 05:10:24 +0200 Subject: [TYPES/announce] Postdoc position in the FP7 CerCo Project Message-ID: <1343963424.3889.45.camel@zenone> New postdoc position in the FP7 CerCo Project Job description: We are currently looking for a one year (or less) Post-Doc position at the Department of Computer Science, University of Bologna, to work on the CerCo FET-Open EU Project (see description below). The candidate can either contribute to the formal verification (in Matita) of the CerCo complexity preserving compiler or he can study the application to more complex scenarios of the technique employed to provide exact cost estimation of the execution time of programs. The gross salary is 26174 euros per year. Only a mimal amount of taxes are due on it (net salary about 1900 euros per month). The tentative starting date is the middle of September 2012. The University of Bologna is the oldest western university and the Department of Computer Science (http://www.cs.unibo.it/en/), located in the historic city center, has strong expertise in theoretical computer science and logic and it participates to several national and international projects. The Post-Doc will join the HELM team, leaded by Prof. Asperti, whose members work in the domains of Type Theory and Mathematical Knowledge Management. The CerCo project is headed by Dr. Sacerdoti Coen. The candidate will benefit from exchange opportunity with the other project participants (University Paris-Diderot, Paris, and University of Edinburgh, Edinburgh). The candidate will not have any teaching duties. Requirements: Candidates should have a Ph.D. in Computer Science and previous experience in either Type Theory (in particular Interactive Theorem Proving) or Compiler Development, and being proficient in functional programming languages. Candidates who have not defended their Ph.D. yet but are supposed to do that soon will also be considered. Project description: The CerCo FET-Open EU Project (http://cerco.cs.unibo.it) is aimed at producing the first _formally_ _verified_ _complexity_preserving_ compiler for a subset of C to the object code for a microprocessor used in embedded systems. The output of the compilation process will be the object code and a copy of the source code annotated with _exact_ computational complexities for each program slice in O(1). The exact computational complexities (expressed in clock cycles and parametric in the program input) can then be used to formally reason on the overall code complexity. The source code of the compiler will be formally verified using the Matita Interactive Theorem Prover (http://matita.cs.unibo.it), based on a variant of the Calculus of (Co)Inductive Constructions. Application details: To apply some forms in Italian only must be filled in, signed, and sent by courier. They must arrive before the 10th of September. The candidates should contact in advance Claudio Sacerdot Coen (in CC Paolo Tranquilli ) for further informations and assistance in the compilation of the forms. -- ---------------------------------------------------------------- Claudio Sacerdoti Coen Doctor in Computer Science, University of Bologna E-mail: sacerdot at cs.unibo.it http://www.cs.unibo.it/~sacerdot ---------------------------------------------------------------- From francesco.zappa_nardelli at inria.fr Fri Aug 3 04:48:00 2012 From: francesco.zappa_nardelli at inria.fr (Francesco Zappa Nardelli) Date: Fri, 3 Aug 2012 10:48:00 +0200 Subject: [TYPES/announce] PostDoc position in Paris, France on weak-memory concurrency and compilation References: Message-ID: <41A06C17-E982-4622-85DA-356F58F6C5B5@inria.fr> *** PostDoc Position in the Parkas team, ENS Paris, France *** We are seeking applicants for a post-doctoral position to join a group working on the broad area of concurrency and compilation in the Parkas team (ENS -- INRIA, Paris, France): http://www.di.ens.fr/ParkasTeam.html Recent work has focussed on the relaxed-memory concurrency that real systems exhibit, including work on the memory models of multiprocessors (x86, Power, ARM), 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.di.ens.fr/~zappa/projects/weakmemory/ We now plan to continue some of the above, and design and implement compilation techniques for efficiently exploit the model parallel hardware, including non-coherent many-core architectures as Tilera and Kalray, and investigate parallel compilation of synchronous languages. Applicants must have a PhD 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. Starting date is negotiable (tentatively October 2012). A keen interest in programming languages, concurrency, and compilation is essential, ideally with a strong background in one or more of the following: * Programming Language Semantics and Type Systems * Compilers * Concurrency * Program Verification * Static and Dynamic Analysis * Automated Reasoning Tools * Operating Systems The position is funded by the ANR WMC project http://www.di.ens.fr/~zappa/projects/wmc/ led by Francesco Zappa Nardelli http://www.di.ens.fr/~zappa/ Applications should include: * a curriculum vitae * a brief statement of the particular contribution you would like to make to the project * the names and contact details (postal and e-mail addresses) of two referees. Applications and enquiries should be sent to francesco.zappa_nardelli (@) inria.fr From flaviomoura at unb.br Sat Aug 4 14:34:10 2012 From: flaviomoura at unb.br (Flavio L. C. de Moura) Date: Sat, 4 Aug 2012 15:34:10 -0300 Subject: [TYPES/announce] SCSS 2012 CFP Extended deadline! In-Reply-To: <47A0B7D9-4512-4C30-902C-32B81B2D2A4C@unb.br> References: <26F75F6A-DD52-418E-84EE-034462788D33@unb.br> <47A0B7D9-4512-4C30-902C-32B81B2D2A4C@unb.br> Message-ID: <8DC231AF-70FD-4E09-B973-6044EA4371BC@unb.br> SCSS 2012 CFP Extended deadline! http://www.cedar-forest.org/forest/events/scss2012/call.html International Symposium on Symbolic Computation in Software Science, December 15-17 2012 Gammarth, Tunisia Call for Papers 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 fromhttp://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 August 23, and the full paper by August 30 (firm date). Notifications are expected by October 30, and final papers for the proceedings will be due by November 30 (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) Title: Eilenberg machines revisited as a general paradigm for relational programming. Abstract: click here Kazuhiro Yokoyama (Japan) Title: Quantifier Elimination for Solving Real Engineering Problems. Abstract: click here Important Dates August 23, 2012: Paper title and abstract deadline August 30, 2012: Full paper deadline (firm) October 30, 2012: Author notification November 30, 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 El Fatmi (Tunisia) Sylvia Ghilezan (Serbia) Ahmed Hadj Kacem (Tunisia) Therese Hardin (France) Mohamed Jmail (Tunisia) Tudor Jebelean (Austria) Fairouz Kamareddine (UK) (chair) Helene Kirchner (France) Temur Kutsia (Austria) Pierre Lescanne (France) Manuel Maarek (France) Mohammed Mezghiche (Algeria) Greg Michaelson (UK) Aart Middeldorp (Austria) Ali Mili (USA) Yasuhiko Minamide (Japan) Mohammed Mosbah (France) Flavio de Moura (Brazil) Valeria de Paiva (USA) David Plaisted (USA) Riadh Robbana (Tunisia) Michael Rusinowitch (France) Amr Sabry (USA) Mahmoud Al-Saheb (Palestine) Masahiko Sato (Japan) Yahya Slimani (Tunisia) Sofiene Tahar (Canada) Martin Wirsing (Germany) Local Organising Committee Ryma Abassi (Tunisia) Mohamed Becha Kaaniche (Tunisia) (chair) Nizar Ben Neji (Tunisia) Nihel Ben Youssef (Tunisia) Hanen Boussi (Tunisia) Wahida Boutabba (Tunisia) Fadoua Ghourabi (Japan) Faten Labbene Ayachi (Tunisia) Lilia Maalej Frikha (Tunisia) Oussama Mahjoub (Tunisia) We look forward to seeing you in beautiful Tunisia. -------------- next part -------------- An HTML attachment was scrubbed... URL: From murano at na.infn.it Sat Aug 4 16:46:02 2012 From: murano at na.infn.it (Nello Murano) Date: Sat, 4 Aug 2012 22:46:02 +0200 (CEST) Subject: [TYPES/announce] GAMES 2012 -- Call for participation -- Message-ID: <39419.2.226.21.88.1344113162.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ================================================================ GAMES 2012 - CALL FOR PARTICIPATION Annual Workshop of the ESF Networking Programme on Games for Design and Verification 7th - 12th September 2012 - Napoli, Italy http://www.games.unina.it/ ================================================================ The ESF Networking Programme on Games for Design and Verification is a European Network pursuing research and training on the design and verification of computing systems. This network proposes a research and training programme for the design and verification of computing systems, using a methodological framework that is based on the interplay of finite and infinite games, mathematical logic and automata theory. For details, see www.games.rwth-aachen.de/ GAMES is the annual workshop of the Network and this year edition is the concluding one. GAMES 2012 will be held at Universita' di Napoli Federico II, Italy. SCOPE: The scope of the workshop includes the mathematical and algorithmic analysis of finite and infinite games, the interplay of games with automata theory and logic, and applications of games, automata, and logic to the design and verification of computing systems. REGISTRATION: There is not a registration fee. However, for organizational matters, you must fill the registration form available at the workshop web page. The registration deadline is August 10th 2012. PROGRAMME: As in previous years, GAMES 2012 will be an informal workshop, without proceedings. Its programme consists of 10 invited talks, and 36 contributed talks. Contributed talks have been selected by the programme committee on the basis of submitted abstracts. For the detailed program of GAMES 2012, please have a look at: http://www.games.unina.it/program/ INVITED SPEAKERS: - Mikolaj Bojanczyk (Warsaw University, Poland) - Krishnendu Chatterjee (IST Vienna, Austria) - Thomas Colcombet (CNRS Paris, France) - Olivier Friedman (University of Munich, Germany) - Hugo Gimbert (CNRS, France) - Joseph Halpern (Cornell University, USA) - Damian Niwinski (Warsaw University, Poland) - Luke Ong (Oxford University, UK) - Jean-Fran?ois Raskin (Universit? Libre de Bruxelles, Belgium) - Wolfgang Thomas (RWTH Aachen University, Germany) LOCATION: The workshop will be held at the Centro Congressi Ateneo Federico II, Via Partenope 36, Napoli, located on a wonderful seafront promenade, close to the historical center and the Castel dell'Ovo. The location is just in front of the baia that hosted last America's Cup World Competition. PROGRAMME COMMITTEE: - Krzysztof Apt, CWI and University of Amsterdam, The Netherlands - Dietmar Berwanger, CNRS and ENS Cachan, France - Erich Gr?del, RWTH Aachen University, Germany - Christof L?ding, RWTH Aachen University, Germany - Angelo Montanari, University of Udine, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy (Main Organizer) - Mimmo Parente, Univerit? di Salerno, Italy - Sven Shewe, University of Liverpool, UK - Igor Walukiewicz, Universit? Bordeaux 1, France CO-LOCATED EVENT: GandALF 2012 - Third International Symposium on Games, Automata, Logics, and Formal Verification - www.gandalf.unina.it/ - September 6th-8th, 2012 INFO: Please visit the workshop website (http://www.games.unina.it) for more information. From cbraga at ic.uff.br Sun Aug 5 11:53:18 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Sun, 5 Aug 2012 12:53:18 -0300 Subject: [TYPES/announce] Proof Theory: Linear Logic, Ludics and Geometry of Interaction & Transcendental Syntax: The conditions of Possibility of Language Message-ID: [Apologies for multiple postings.] ============================ Paraty 2012 http://www.tecmf.inf.puc-rio.br/ProofTheory2012 Logic School: Proof Theory: Linear Logic, Ludics and Geometry of Interaction Conference: Transcendental Syntax: The conditions of Possibility of Language Paraty, Rio de Janeiro-RJ, Brazil, August, 27th - September, 1st 2012 Contents 1. Paraty 2012 1. Scientific Commitee 2. Organizational Commitee 2. School Main Topics 3. Program 4. Financial help for participants Scientific Commitee ? Jean-Yves GIRARD CNRS, Institut de math?matiques de Luminy, ?quipe Logique de la programmation ? Jean-Baptiste JOINET University Panth?on-Sorbonne, UFR de Philosophie, Centre International de Recherche: Philosophie, Lettres, Savoirs ? Luiz Carlos PEREIRA PUC-Rio, Departamento de Filosofia, Instituto de L?gica e Filosofia da Linguagem ? Elaine PIMENTEL Federal University of Minais Gerais (Brazil) & Univalle (Colombia), Departamento de Matematica Organizational Commitee ? Luiz Carlos Pereira ? Jean??Baptiste Joinet ? Hermann Haeusler ? Bruno Lopes ? Alexandre Rademaker School Main Topics ? Linear logic ? Ludics ? Geometry of interaction Program ? School Lectures ? Conference Lectures Financial help for participants A limited number of modest travel grants will be available for participants who would not otherwise have resources to attend ProofTheory2012, and whose attendance would benefit both the applicant and the event. Applicants should note that a grant is limited, and that costs in excess of the grant will not be reimbursed. Grants will be awarded based on the grant committee's assessment of the applicant's genuine financial need, the potential benefit to the applicant's education and research, and the potential benefit to ProofTheory2012. Applications: should explain briefly (limited to 2000 characters) ? the current status of the applicant ? the kind of participation of the applicant in the school ? a breakdown of the estimated amount needed Applications should be send by July, 15th to the following email address . The following should also be sent with the application: ? a letter of the PhD supervisor (for students) ? a letter of recommendation (for researchers without position) -------------- next part -------------- A non-text attachment was scrubbed... Name: cartaz final.pdf Type: application/pdf Size: 696245 bytes Desc: not available URL: -------------- next part -------------- From Michael.Lipaczewski at ovgu.de Mon Aug 6 08:56:01 2012 From: Michael.Lipaczewski at ovgu.de (Lipaczewski, Michael) Date: Mon, 6 Aug 2012 12:56:01 +0000 Subject: [TYPES/announce] SAFECOMP 2012 Call for Participation Message-ID: ----------------------------------------------------------------------------- 31th International Conference on Computer Safety, Reliability and Security Safecomp 2012 September 25th-28th 2012 Magdeburg, Germany (http://www.ovgu.de/safecomp) ----------------------------------------------------------------------------- Call for Participation We like to take the opportunity to inform you about the upcoming 31th International Conference on Computer Safety, Reliability and Security (SAFECOMP), which will be held this year in Magdeburg, Germany from September 25th to September 28th in historic Herrenkrug Hotel. 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 by the European Workshop on Industrial Computer Systems, Technical Committee 7 on Reliability, Safety and Security (EWICS TC7), 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". Besides interesting keynote lectures from Prof. J?rgen Leohold (CTO of Volkswagen), Prof. Marta Kwiatkowska (Oxford University) and Prof. Hans Hansson (M?rladen University), SAFECOMP 2012 offers five different workshops in several safety-related domains as well as a T?V Tutorial for FMEDA methodology in the context of ISO26262 certification. Enclosed with this letter you will find more details about the upcoming conference. You might also want to visit the website (www.ovgu.de/safecomp) for program information and registration. We hope to see you at the SAFECOMP 2012 in Magdeburg Frank Ortmeier ----------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From amal at ccs.neu.edu Mon Aug 6 14:27:53 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Mon, 6 Aug 2012 14:27:53 -0400 Subject: [TYPES/announce] Call for Participation: HOPE 2012 Message-ID: <125B27C7-7383-4C29-97BE-4C4FE0525B6D@ccs.neu.edu> ********************************************************************* CALL FOR PARTICIPATION HOPE 2012 The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects Sunday, September 9, 2012 Copenhagen, Denmark To be held in conjunction with ICFP 2012 http://hope2012.mpi-sws.org ********************************************************************* IMPORTANT DATES Early registration deadline: August 9, 2012 *** only days away! *** Hotel reservation deadline: August 9, 2012 (for most hotels) VENUE HOPE 2012 and all ICFP'12 affiliated events will take place at DGI-byen's conference center - CPH Conference, Tietgensgade 65, DK 1704 Copenhagen V. More information at: http://icfpconference.org/icfp2012/local.html HOPE 2012 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. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all. There were 21 talk submissions, of extraordinarily high quality. As the workshop is only one day long, we were only able to accept 13 of them for presentation at the workshop. So there will be 13 contributed talks, but no invited talks or other sessions. We expect this to be a very high-octane workshop! PROGRAM The program is included at the end of this email; it can also be found here: http://hope2012.mpi-sws.org/ PROGRAM 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) PRELIMINARY PROGRAM SUNDAY, September 9, 2012 Session 1: Verification 9:00 Modular Specification and Verification of Delegation with SMT Solvers Ioannis Kassios, Peter M?ller 9:30 On Higher-Order Separation Logic for Higher-Order Concurrent Imperative Programs Kasper Svendsen, Lars Birkedal, Matthew Parkinson 10:00 Verifying an Open Compiler from ML to Assembly James T. Perconti, Amal Ahmed 10:30 BREAK Session 2: Monads and More 11:00 Handlers in Action Ohad Kammar, Sam Lindley, Nicolas Oury 11:30 Contract Monitoring as an Effect Zachary Owens 12:00 HOPE for a Type-Theoretic Understanding of Zero-Knowledge Noam Zeilberger 12:30 LUNCH Session 3: Types and Effects 2:00 Koka: A Language with Row-Polymorphic Effect Inference Daan Leijen 2:30 Effects for Funargs Jeremy Siek, Michael Vitousek, Jonathan Turner 3:00 Generative Names and Dependent Types Andrew Pitts 3:30 BREAK Session 4: Logical Relations and Parametricity 4:00 Logical Relations for Fine-Grained Concurrency Aaron Turon, Jacob Thamsborg, Amal Ahmed, Lars Birkedal, Derek Dreyer 4:30 Logical Relations for a Manifest Calculus, Fixed Taro Sekiyama, Atsushi Igarashi 5:00 Proof-Relevant Logical Relations Nick Benton, Martin Hofmann, Andrew Kennedy, Vivek Nigam 5:30 Two Theories of Information Hiding Uday Reddy From jose.proenca at cs.kuleuven.be Tue Aug 7 08:10:42 2012 From: jose.proenca at cs.kuleuven.be (=?iso-8859-1?Q?Jos=E9_Proen=E7a?=) Date: Tue, 7 Aug 2012 14:10:42 +0200 Subject: [TYPES/announce] FOCLASA'12: Call for Participation References: <3EA61513-6C5A-4505-B5DA-E075444AA33B@cs.kuleuven.be> Message-ID: <4742BFE5-2346-4EE6-9701-82FA89C34651@cs.kuleuven.be> Call for Participation 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 IMPORTANT DATES Early registration deadline: August 10th, 2012 *only 3 days away!* Workshop: September 8th, 2012 FOCLASA 2012 FOCLASA 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. PROGRAM 09:00 Opening -- Invited talk -- 09:15 Controller Synthesis for Architecture Level Adaptation Sebastian Uchitel, Imperial College London 10:30 Coffee break -- Self-Adaptation and coordination -- 11:00 Blackboard Rules for Coordinating Context-aware Jean-Marie Jacquet, Isabelle Linden and Mihail-Octavian Staicu 11:30 A multi-level model for self-adaptive systems Emanuela Merelli, Nicola Paoletti and Luca Tesei 12:00 A Case Study on Formal Verification of Self-Adaptive Behaviors in a Decentralized System Usman Iftikhar and Danny Weyns 12:30 Lunch break -- Type systems -- 14:00 Parameterized Concurrent Multi-Party Session Types Minas Charalambides, Peter Dinges and Gul Agha 14:30 A Type-Safe Model of Adaptive Object Groups Joakim Bj?rk, Dave Clarke, Einar Broch Johnsen and Olaf Owe 15:00 - Coffee break -- Processes and coordination -- 15:30 A Procedure for Splitting Processes and its Application to Coordination Sung-Shik T.Q. Jongmans, Dave Clarke and Jos? Proen?a 16:00 Communicating Processes with Data for Supervisory Coordination Jasen Markovski 16:30 A Provenance Tracking Model for Data Update Gabriel Ciobanu and Ross Horne 17:00 - Closing 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 Mohammad Reza Mousavi, Eindhoven University of Technology, The Netherlands Jos? Proen?a, Katholieke Universiteit Leuven, Belgium (publicity chair) Pascal Poizat, University of Evry, France 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 jjb at microsoft.com Tue Aug 7 13:10:17 2012 From: jjb at microsoft.com (Josh Berdine) Date: Tue, 7 Aug 2012 17:10:17 +0000 Subject: [TYPES/announce] VMCAI 2013: Call for papers Message-ID: VMCAI 2013 CALL FOR PAPERS 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) http://vmcai13.di.univr.it January 20-22, 2013, Rome, Italy Co-located with POPL 2013 (http://popl.mpi-sws.org/2013/) 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages SCOPE VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. The program of VMCAI'13 will consist of refereed research papers and tool demonstrations, as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyberphysical systems. Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Proceedings are published by Springer-Verlag as volumes in the Lecture Notes in Computer Science series. IMPORTANT DATES Abstract Submission: August 17, 2012 Paper Submission: August 24, 2012 Acceptance Notification: October 12, 2012 Conference: January 20-22, 2013 (right before POPL) The submission system is now open and early submissions are welcome. The deadlines are strict and will not be changed. SUBMISSION INSTRUCTIONS The VMCAI 2013 proceedings will be published as a volume in Springer's Lecture Notes in Computer Science series. The page limit for submissions is: 15 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at http://www.springer.de/comp/lncs/authors.html. Submissions deviating from these guidelines risk summary rejection. Please prepare your submission in accordance with the rules described above and submit a pdf file via: http://www.easychair.org/conferences/?conf=vmcai2013 PROGRAM COMMITTEE Program Chairs: Roberto Giacobazzi (Chair) Josh Berdine (Co_Chair) Isabella Mastroeni (Co_chair) Program Committee: Josh Berdine (MSR, UK & Co_Chair) Nikolaj Bjorner, (MSR, USA) Sandrine Blazy (U. Rennes, France) Agostino Cortesi (U. Venezia, Italy) Mads Dam (KTH, Sweden) Michael Emmi (U. Paris Diderot, France) Azadeh Farzan (U. Toronto, Canada) Pierre Ganty (IMDEA, Spain) Samir Genaim (U. Complutense, Spain) Roberto Giacobazzi (U. Verona, Italy & Chair) Orna Grumberg (Technion, Israel) Klaus Havelund (JPL, USA) Jochen Hoenicke (U. Freiburg, Germany) Sebastian Hunt (City U. London, UK) Limin Jia, (CMU, USA) Andy King (Kent, UK) Arun Lakhotia (U. Louisiana, USA) Akash Lal (MSR, India) Rupak Majumdar (MPI-SWS, Germany) Matthieu Martel (U. Perpignan, France) Isabella Mastroeni (U. Verona, Italy & Co_chair) Ganesan Ramalingam (MSR, India) Roberto Sebastiani (FBK, Italy) Saurabh Srivastava (Berkeley, USA) Greta Yorsh (ARM, UK) Enea Zaffanella (U. Parma, Italy) VMCAI STEERING COMMITTEE Agostino Cortesi, Universita' Ca' Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France E. Allen Emerson, University of Texas at Austin, USA Andreas Podelski, University of Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA ADDITIONAL INFORMATION Please consult: http://vmcai13.di.univr.it or contact PC chairs. From pangjun at gmail.com Wed Aug 8 04:21:52 2012 From: pangjun at gmail.com (Jun PANG) Date: Wed, 8 Aug 2012 10:21:52 +0200 Subject: [TYPES/announce] ICTAC 2012 - Call for Participation Message-ID: Apologies, in case you receive multiple copies of this Call for Participation. Kindly forward to anybody who may be interested. CALL FOR PARTICIPATION ====================== 9th International Colloquium on Theoretical Aspects of Computing (ICTAC) 2012 24--27 September 2012, Bangalore, India http://www.iiitb.ac.in/ictac/ ICTAC 2012 will be the 9th version of the International Colloquium on Theoretical Aspects of Computing, a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2012 will bring together researchers from academia and industry who are working on challenges in theoretical aspects of computing, including using of theory for devising and developing systems. The conference will also act as a forum for interaction and cooperation in education and research between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. Plans for events as a part of ICTAC 2012 include a school on Software Engineering, involving extensive participation from students and researchers from academia and industry, tutorials and workshops, along with invited and research paper presentations. 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 has been marked as Industry Day. Registration ------------ Registration for ICTAC 2012 is now open. Please visit http://www.iiitb.ac.in/ictac/registration.html To take advantage of early registration, kindly register before August 24, 2012. Keynotes --------------------------- ICTAC 2012 will feature three invited talks. These are by Luke Ong (University of Oxford) - Day 1 Gernot Heiser (UNSW and NICTA Australia) - Day 2 G. Ramalingam (MSR India) - Day 3 Program ------- Monday September 24 : School on Software Engineering Tuesday September 25 - Day 1 of Main Conference Wednesday September 26 - Day 2 of conference [Industry Day] Thursday September 27 - Day 3 of conference Conference program appears at http://www.iiitb.ac.in/ictac/program Details about School on Software Engineering appears at http://www.iiitb.ac.in/ictac/School-on-Software-Engineering.html ------------------------------------------------------- Conference Committees ------------------------------------------------------- Program Chair: Abhik Roychoudhury, National University of Singapore General Chair: Meenakshi D'Souza, IIIT Bangalore Industry Day Chairs: Satish Chandra, IBM Research Sriram Rajamani, Microsoft Research India Organizing Committee: Meenakshi D'Souza, IIIT Bangalore Jun Pang, University of Luxembourg Deepak D'Souza, Indian Institute of Science Sumesh Divakaran, Indian Institute of Science Publicity Chair: Jun Pang, University of Luxembourg Program Committee members: 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 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 Institute, India Kedar Namjoshi, Bell Labs, USA Jun Pang, University of Luxemborg 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 -------------------------------------------------------------------------- From adamc at csail.mit.edu Wed Aug 8 08:51:23 2012 From: adamc at csail.mit.edu (Adam Chlipala) Date: Wed, 08 Aug 2012 08:51:23 -0400 Subject: [TYPES/announce] Call for Participation: LFMTP'12 Message-ID: <502260CB.40305@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 PARTICIPATION ------------------------------------------------------------- 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. ------------------------------------------------------------- INVITED TALKS Brigitte Pientka, title TBD. Nicolas Pouillard, From de Bruijn to nowadays: The evolution of libraries for binding representation. Robert J. Simmons, A Walk in the Substructural Park. Stephanie Weirich, A POPLmark retrospective: Using proof assistants in programming language research. CONTRIBUTED PAPER TALKS Alberto Momigliano, A supposedly fun thing I may have to do again: A HOAS encoding of Howe's method. Chris Martens and Karl Crary, LF in LF: Mechanizing the Metatheory of LF in Twelf. Furio Honsell, Marina Lenisa, Liquori Luigi, Petar Maksimovic and Ivan Scagnetto, LFP ? A Logical Framework with External Predicates. Iliano Cervesato, Frank Pfenning, Jorge Luis Sacchini, Carsten Sch?rmann and Robert J. Simmons, Trace Matching in a Concurrent Logical Framework. Other details concerning the workshop can be found on 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 zerny at cs.au.dk Wed Aug 8 14:07:17 2012 From: zerny at cs.au.dk (Ian Zerny) Date: Wed, 08 Aug 2012 20:07:17 +0200 (CEST) Subject: [TYPES/announce] SFP 2012: Final Call for Papers Message-ID: <20120808.200717.125274835.ian@zerny.dk> Final Call for Papers 2012 Workshop on Scheme and Functional Programming Copenhagen, Denmark Sunday 9 September 2012 http://users-cs.au.dk/danvy/sfp12 Important Dates --------------- Submission: 13 August 2012 Notification: 30 August 2012 Camera-ready: 7 September 2012 All deadlines are at 23:59 UTC (7:59 PM EDT, 6:59 PM CDT, 5:59 PM MDT, and 4:59 PM PDT). Scope ----- The 2012 Workshop on Scheme and Functional Programming is a forum for discussing experience with and future development of the Scheme programming language. Papers are invited concerning all aspects of the design, implementation, theory, and application of Scheme. Some example areas include (but are not limited to): - History, evolution and standardization of Scheme - Applications, experience and industrial uses of Scheme - Program-development environments, debugging, testing - Implementation (interpreters, compilers, tools, benchmarks, etc) - Distributed computing, concurrency, parallelism - Interoperability with other languages, FFIs - Continuations, macros, modules, object systems, types - Theory, formal semantics, correctness - Education - Scheme pearls (elegant, instructive uses of Scheme) Program Committee ----------------- Michael Adams, PSU Olivier Danvy, Aarhus University (Chair) St?phane Ducasse, INRIA Lille Nord Europe Christopher Dutchyn, University of Saskatchewan Suresh Jagannathan, Purdue University Julia L. Lawall, INRIA Florian Loitsch, Google Jay McCarthy, Brigham Young University Kurt N?rmark, Aalborg University Julian Padget, University of Bath Morten Rhiger, Roskilde University Ulrik Pagh Schultz, University of Southern Denmark Eijiro Sumii, Tohoku University Jens Axel S?gaard, Vestjysk Gymnasium Tarm Eric Tanter, University of Chile Publicity Chair Ian Zerny, Aarhus University Sponsored by ACM SIGLAN. From murano at na.infn.it Thu Aug 9 03:32:48 2012 From: murano at na.infn.it (Nello Murano) Date: Thu, 9 Aug 2012 09:32:48 +0200 (CEST) Subject: [TYPES/announce] GandALF 2012 -- Call for participation -- Message-ID: <39488.87.6.252.123.1344497568.squirrel@imap-lp.na.infn.it> ***************************************************************** ------ GandALF 2012 ----- ***************************************************************** Third International Symposium on Games, Automata, Logics, and Formal Verification Napoli, Italy, September 6th-8th, 2012 http://www.gandalf.unina.it ************************************************ | CALL FOR PARTICIPATION | ************************************************ 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. Authors have been invited to submit original research or tool papers on any relevant topic in the following areas: LIST OF TOPICS 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 PROGRAMME Programme of GandALF 2012 consists of 19 contributed talks (for the list of accepted papers, please have a look at http://www.gandalf.unina.it//accepted.php) that have been selected by the programme committee on the basis of submitted papers. For the detailed program of GandALF 2010, please have a look at http://www.gandalf.unina.it//program.php REGISTRATION GandALF 2012 has two registration periods (early and normal). Early registration applies up to August 9th, 2012. On site registration fee can be paid only in cash. Since September is considered high season in Napoli, we suggest to book your hotel as soon as possible. Registration fee: Full: 300 euro (early registration) - 350 euro (normal registration) CO-LOCATED EVENT GAMES 2012, Annual Workshop of the ESF Networking Programme on Games for Design and Verification (http://www.games.unina.it/). INVITED SPEAKERS Alberto Policriti (University of Udine, Italy). Moreover, we have the following three joint invited speakers with the co-located GAMES meeting: - Joseph Halpern, Cornell University, USA - Damian Niwinski, Warsaw University, Poland - Jean-Fran?ois Raskin, Universit? Libre de Bruxelles, Belgium 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) From cbraga at ic.uff.br Thu Aug 9 04:14:01 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Thu, 9 Aug 2012 05:14:01 -0300 Subject: [TYPES/announce] LSFA 2012 - Call for participation In-Reply-To: References: Message-ID: <7BDEF768-851C-4CB0-9BC8-DAB578D37581@ic.uff.br> ====================================================================== [ please distribute - apologies for multiple copies ] ====================================================================== LSFA 2012 - Call For Participation 7th Workshop on Logical and Semantic Frameworks, with Applications Rio de Janeiro, Brazil September 29-30, 2012 http://www.uff.br/lsfa/ 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 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. Together with this edition it will be held a celebration of the 50th birthday of Professor Professor Edward Hermann Haeusler on Saturday September 29th, 2012. Important Dates Early registration deadline: September 10th, 2012 Conference: September 29-30, 2012 Invited talks * Torben Brauner (Roskilde University, Denmark) Hybrid Logic and its Proof-Theory Hybrid logic is an extension of ordinary modal logic which allows explicit reference to individual points in a model (where the points represent times, possible worlds, states in a computer, or something else). This additional expressive power is useful for many applications, for example when reasoning about time one often wants to formulate a series of statements about what happens at specific times. There is little consensus about proof-theory for ordinary modal logic. Many modal-logical proof systems lack important properties and the relationships between proof systems for different modal logics are often unclear. In my talk I will demonstrate that these deficiencies are remedied by hybrid-logical proof-theory. In my talk I first give a brief introduction to hybrid logic and its origin in Arthur Prior's temporal logic. I then describe essential proof-theoretical results for a natural deduction formulation of hybrid logic. The natural deduction system is extended with additional inference rules corresponding to conditions on the model expressed by what are called geometric theories. Thus, I give natural deduction systems in a uniform way for a wide class of hybrid logics. * Maribel Fern?ndez (King's College London, UK) A framework to specify access control policies in distributed environments. In this talk, we present a meta-model for access control that takes into account the requirements of distributed environments, where resources and access control policies may be distributed across several sites. This framework extends the ideas underlying Barker's category-based meta-model. We use term rewriting to give an operational semantics to the distributed meta-model, and then show how various distributed access control models (e.g., MAC, DAC, RBAC, Bell-Lapadula) can be derived.can be as instances of the meta model. Based on work done jointly with Clara Bertolissi. * Edward Hermann Haeusler (PUC-Rio, Brazil) A proof-theoretical discussion on the mechanization of propositional logics The computational complexity of SAT and TAUT for purely implicational propositional logic is known to be PSPACE-complete. Intuitionistic Propositional Logic is also known to be PSPACE-complete, while Classical Propositional Logic is CONP-complete for Tautology checking and NP-complete for Satisfiability checking. We show how proof-theoretical results on Natural Deduction help analysing the Purely Implicational Propositional Logic complexity regarded its polynomial relationship to Intuitionistic and Classical Propositional Logics. The main feature in this analysis is the sub-formula principle property. We extended the polynomial reduction of purely implicational logic to any propositional logic satisfying the sub-formula principle. Hence, any propositional logic satisfying the sub-formula principle is in PSPACE. We conclude that some well-known logics, such as Propositional Dynamic Logic and S5C (n = 2), for example, hardly satisfy the sub-formula property. On the other hand, these logics have proof procedures. They are told to be mechanizable despite being EXPTIME-complete. We point out some facts and discuss some questions on how the sub-formula property is related to the mechanization of theorem proving for propositional logics. The relationship between feasible interpolants and the sub-formula property is discussed. Some examples remind us that the relationship between normalization of proofs and the sub-formula property is weak. Finally we discuss some alternative criteria to consider a logic to be mechanizable. This discussion is strongly influenced by A. Carbone analysis on propositional proof complexity. Our purpose is to show how structural proof theory can help us in analysing hard relationships on propositional logic systems. * Alexandre Miquel (ENS de Lyon, France) A survey of classical realizability The theory of classical realizability was introduced by Krivine in the middle of the 90's in order to analyze the computational contents of classical proofs, following the connection between classical reasoning and control operators discovered by Griffin. More than an extension of the theory of intuitionistic realizability, classical realizability is a complete reformulation of the very principles of realizability based on a combination of Kleene's realizability with Friedman's A-translation. One of the most interesting aspects of the theory is that it is highly modular: although it was originally developed for second order arithmetic, classical realizability naturally extends to more expressive frameworks such as Zermelo-Fraenkel set theory or the calculus of constructions with universes. Moreover, the underlying language of realizers can be freely enriched with new instructions in order to realize extra reasoning principles, such as the axiom of dependent choices. More recently, Krivine proposed an ambitious research programme, whose aim is to unify the methods of classical realizability with Cohen's forcing in order to extract programs from proofs obtained by the forcing technique. In this talk, I shall survey the methods and the main results of classical realizability, while presenting some of its specific problems, such as the specification problem. I shall also discuss the perspectives of combining classical realizability with the technique of forcing, showing that this combination is not only interesting from a pure model theoretic point of view, but that it can also bring new insights about a possible widening of the proofs-as-programs correspondence beyond the limits of pure functional programming. 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) (co-chair) * Luiz Carlos Pereira (PUC-Rio, UFRJ) * Mauricio Ayala-Rincon (UnB) (co-chair) ====================================================================== From pangjun at gmail.com Thu Aug 9 07:34:37 2012 From: pangjun at gmail.com (Jun PANG) Date: Thu, 9 Aug 2012 13:34:37 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at ACM SAC 2013: 2nd CfP Message-ID: ================================================== 28th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 18 - 22, 2013, Coimbra, Portugal (Proceedings published by ACM, Selected papers invited to a special issue of Science of Computer Programming) More information: http://www.win.tue.nl/sacsvt13/ and http://www.acm.org/conferences/sac/sac2013/ =================================================== Important dates --------------- * September 21st 2012: Submission deadline * November 10th 2012: Notification of acceptance/rejection * November 30th 2012: Camera-ready versions due ACM Symposium on Applied Computing ---------------------------------- The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-seven years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2013 is sponsored by SIGAPP and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra, Coimbra, Portugal. Software Verification and Testing Track --------------------------------------- We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - refinement and correct by construction development - model-based testing - verification-based testing - run-time verification - symbolic execution and partial evaluation - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines ---------------------- Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/c/sac2013/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Accepted papers will be published in the ACM SAC 2013 proceedings. For accepted papers, registration for the conference is required and allows accepted papers to be printed in the conference proceedings. The accepted paper MUST be presented by an author or a proxy. This is a requirement for the paper to be part of the ACM/IEEE digital library. A special issue of Science of Computer Programming (SCP) has been confirmed. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of SCP. Program committee ----------------- Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Sarfraz Khurshid, University of Texas at Austin, USA Ramtin Khosravi, University of Tehran, Iran Keqin Li, SAP Research, France Yang Liu, National University of Singapore, Singapore Delphine Longuet, Universite Paris-Sud 11, France Yves Le Traon, University of Luxembourg, Luxembourg MohammadReza Mousavi (co-chair), Eindhoven University of Technology, The Netherlands Mercedes Merayo, Universidad Complutense de Madrid, Spain Stephan Merz, INRIA Nancy, France Markus Mueller-Olm, University of Muenster, Germany Jun Pang (co-chair), University of Luxembourg, Luxembourg Dave Parker, University of Birmingham, UK Hongyang Qu, Oxford University, UK Martin Steffen, University of Oslo, Norway Tim Willemse, Eindhoven University of Technology, The Netherlands From rduncan at ulb.ac.be Fri Aug 10 09:17:37 2012 From: rduncan at ulb.ac.be (Ross Duncan) Date: Fri, 10 Aug 2012 15:17:37 +0200 Subject: [TYPES/announce] 2nd cfp: QPL 2012 - Brussels 10-12 October 2012 In-Reply-To: <456F4FE4-03A7-44DE-8825-298DD4956AA6@ulb.ac.be> References: <456F4FE4-03A7-44DE-8825-298DD4956AA6@ulb.ac.be> Message-ID: We invite contributions to QPL 2012! The DEADLINE IS IN 10 DAYS. ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Universit? Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== The 9th workshop on Quantum Physics and Logic will bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science techniques for the study of physical behaviour in general. There will be full programme of contributed talks, and invited lectures from: - Stefaan Caenepeel (Vrije Universiteit Brussel) - Jens Eisert (Frei Universit?t Berlin) - Serge Massar (Universit? Libre de Bruxelles - Paul-Andr? Melli?s (Universit? Paris Diderot - Paris 7) There will be a workshop dinner on Thursday night. There are funds available to enable the participation of students. Please see the webpage for details. SUBMISSION OF PAPERS Prospective speakers are invited to submit a contribution to the worksshop. We are considering two kinds of contributions. - Short contributions consisting of a 3 page description of the work, and a link to a paper published elsewhere. - Longer original contributions consisting of a 5-12 page extended abstract which provides sufficient evidence of results of genuine interest and provides sufficient detail to allow the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Submissions should be prepared using LaTeX, and must be submitted in PDF format and can be done via easy chair. Extended versions of accepted original research contributions will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the workshop. IMPORTANT DATES All deadlines are at 9am Brussels time (i.e. CEST, UTC+2). - 20 August: Submission of paper - 10 September: Notification of authors - 24 September: Camera-ready version due Programme Committee - Dan Browne - Giulio Chiribella - Bob Coecke - Andreas Doering - Ross Duncan (co-chair) - Simon Gay - Bart Jacobs - Prakash Panangaden (co-chair) - Simon Perdrix - Robert Raussendorf - Mehrnoosh Sadrzadeh - Peter Selinger - Robert Spekkens - Bas Spitters Steering Committeee - Bob Coecke - Prakash Panangaden - Peter Selinger Local Organisation Ross Duncan - Email : rduncan at ulb.ac.be - Telephone : +32 2 650 5512 ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Universit? Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== ================================= Ross Duncan Laboratoire d'Information Quantique CP 225 // Universit? Libre de Bruxelles rduncan at ulb.ac.be // +32 2 650 5512 // skype: dr.ross.duncan http://homepages.ulb.ac.be/~rduncan/ From cristina.pereira at informatics-europe.org Fri Aug 10 10:43:18 2012 From: cristina.pereira at informatics-europe.org (Cristina Pereira) Date: Fri, 10 Aug 2012 16:43:18 +0200 Subject: [TYPES/announce] ECSS 2012 - Last week to submit your contribution! Message-ID: <50251E06.4090004@informatics-europe.org> */8th European Computer Science Summit - ECSS 2012/* *//* */What makes a good PhD in Informatics?/* 20-21 November 2012, Barcelona, Spain With Pre-Summit Workshops on 19 November 2012 (see below) Deadline for Submissions: *August 15, 2012* Deadline for Early Registration: *September 20, 2012* - *Register Now! * The program of the 8th European Computer Science Summit, ECSS 2012, with the theme "What makes a good PhD in Informatics?" is now online. As for the previous Summits, the program consists of special invited talks, workshops, panels and other interactive sessions devoted to common issues, problems and proposals in the area of Informatics (Computer Science/Computing/ICT). Special features of the 2012 Summit are as follows: * Special focus on "What makes a good PhD in Informatics?" * Pre-summit Workshop for Deans, Department Chairs and Research Directors on November 19, 2012 (see details below) * Pre-summit Workshop on Experimentation in Computer Science: Scope, Method and Relevance on November 19, 2012 (see details below) * Invited talks from key players in the field (see details below) * Submitted talks by colleagues from all over Europe and beyond The Summit is devoted to important and timely strategic issues and trends regarding all aspects of informatics: education, research, funding, entrepreneurship, management, career development, and policies. The speakers are an impressive group of world-class computer scientists who will present their latest advances and debate the future of the field. *Manfred Nagl*'s talk "*Doctoral Dissertations in Informatics in Europe - Some Facts and Figures*" and *K.M. (Kees) van Hee*'s talk "*Engineering Doctorates: the Bridge between Science an Industry*" open the conference in the special session addressing the main conference theme. The session includes also the panel "*What Makes a Good PhD in Informatics?*" joining in the table key players from academy and industry to discuss current aspects and issues regarding PhD thesis in Informatics. Research funding is the focus of another important session of the conference. The talks of *Danny Dolev*, European Research Council, "*The Promise in Computer Science Research Activities*" and *Farnam Jahanian*, US National Science Foundation, "*Pillars of Societal Innovation: Research and Education in Computer Science and Informatics*" bring the perspectives of both Europe and USA on a topic of key relevance to all researcher in the field. *Diomidis Spinellis*, Athens University of Economics and Business, with his talk "T*heory Meets Reality: Managing IT Systems at the Greek Ministry of Finance*" bring his unique insider's perspective of the information technology systems at the Greek Ministry of Finance and its role in one of the gravest crisis Europe ever faced. *Walter Gander* addresses in his talk "*Informatics in Schools? - Urgently Needed!*" one of the currently most important and worldwide debated topic of Informatics education. The talk will discuss the preliminary results and future plans of the working group established in the topic by a joint action of Informatics Europe and ACM Europe. *Natalia Juristo*'s keynote "*Applying the Experimental Paradigm to Software Engineering*" opens a special session of the conference on the topic "Experiments in Computer Science". Her talk will be followed by the discussion panel "Experiments in Computer Science: Are Traditional Experimental Principles Enough?". The topic is also the central focus of a Pre-Summit workshop on November 19 (see details below). Beyond this exciting group of speakers and discussions, the conference includes also a session with presentations selected from contributed papers (to submit your contribution see the call for submissions bellow) and the Award Ceremony of the 2012 Informatics Europe Curriculum Award. Informatics Europe Members are specially invited to participate in the Informatics Europe General Assembly and Informatics Europe Initiatives Session (on November 20, afternoon) where important aspects of the association activities and administration will be presented and discussed, as well as plans for future activities and development. *Call for Participation/Submissions* ECSS 2012 is soliciting contributions on topics of interest to the ECSS audience throughout Europe: heads (or deans, chairs, etc.) of informatics/computer science/IT departments (schools, faculties); research directors and managers of research centers and laboratories in industry or in public institutions; as well as senior faculty and senior researchers from both academia and industry. Like its predecessors, the 8th European Computer Science Summit, is a unique opportunity to meet some of the leading decision makers in informatics research and education, and discuss the critical issues of the discipline. The conference will be held in Barcelona, Spain, one of the most exciting cities in the world, filled with culture, art, and innovation. In addition to the general topics of interest, every Summit has a particular theme, and the particular theme of ECSS 2012 is "What makes a good PhD in Informatics?" Thus, ECSS 2012 will enable educators, researchers, managers and other experts in the field to assess and discuss issues such as the best ways of designing and running PhD programs in our field, what the focus of such programs should be, what both academia and industry expect nowadays from a recent PhD graduate, career paths, PhD program evaluation, and any other related issues with a focus on how PhD education in Europe can help informatics make its best possible contribution to the progress of society. *Topics for Contributions* ECSS 2012 is soliciting contributions on all topics of interest to its intended audience, including (but not limited to) the following: * Major trends in informatics research and education. * Relationship of informatics researchers and educators with governments. * Research funding: issues, experience reports, policy. * Image of the discipline, student enrolment. * Infrastructure to support informatics research and education. * Issues in research and education policy. * Experience reports on educational techniques for informatics. * Role and relevance of experimentation in informatics. * Research organization for informatics. * Research careers in informatics, researcher evaluation. * Issues in informatics-related publishing practices. Contributions are encouraged in the focus theme of ECSS 2012: "What makes a good PhD in Informatics?." In particular, submissions related to proposals, experiences, best practices, etc. related to the organization, focus, objectives, etc. of PhD programs in the field of informatics. *Submitting Contributions* To contribute to the Informatics Europe 2012 Summit program, please submit an extended abstract of your position paper by *August 15, 2012*. Submissions will be evaluated and selected by the ECSS 2012 program committee on the basis of relevance to (and capacity of) the program. Proposals may aim at a 20 minutes presentation or demonstration, and should consist of an abstract containing: * A header with the title of your contribution, your name, position, and affiliation. * A clear description of your contribution. The abstract should contain at least, but is not restricted to, one A4 page. *Format guidelines: A4 format, 11-pt Arial font type, single-space, one-column and 2 cm margins. Pages should not be numbered.* Authors of accepted abstracts will be given the opportunity to submit longer position papers. All contributions should be submitted in PDF format at the Easy Chair ECSS 2012 conference submission site: *https://www.easychair.org/account/signin.cgi?conf=ecss2012* * *Deadline for submissions: August 15, 2012.* * *Author Notification: September 15, 2012.* All accepted abstracts and position papers will be made available to the conference attendees and on the Informatics Europe site (http://www.informatics-europe.org).** *Registrations* Registration to the conference is now open. Register early to benefit from the discounted fees. The deadline for early registration is 20 September 2012. To register follow the instructions in the conference registration page . For details on the fees and current offers visit the conference website: http://www.informatics-europe.org/ecss/ecss-2012/registration-2012.html* * ------------------------------------------------------------------------ * Workshop for Deans, Department Chairs and Research Directors* */Faculty Promotion Policies and Procedure: tenure, tenure track, or?/* Workshop chair: Prof. Mehdi Jazayeri, Faculty of Informatics, University of Lugano Technical and societal changes are all around us and universities in Europe are undergoing fundamental changes. Department chairs at informatics groups face ever-increasing challenges. The goal of the workshop is to provide a networking opportunity for department chairs, old and new, to share experiences, common challenges, and best practices. It provides a forum for strengthening your leadership and management competencies by exchanging best practices and by building relationships among department heads at European Informatics research institutions. This year's meeting focuses on an issue that is changing across Europe: faculty promotions. The US tenure-track system is well-known and almost treated as a standard. But there are many systems used across Europe and they are undergoing major changes. The workshop will be a mixture of discussions/knowledge sharing in smaller groups. Please bring the issues you are facing and approaches you have found to work. The workshop focuses on current procedures and practices for faculty promotion. Both new and experienced department heads are invited for an exchange of best practices, new ideas and common challenges. Benefits for participants include: * Learning best practices from heads of European Informatics departments and research labs * Offering a networking platform for heads of European Informatics departments and research labs * Inspiration for improving department processes *Speakers:* * Anthony Finkelstein, University College London, UK * Mehdi Jazayeri, University of Lugano, Switzerland * Axel van Lamsweerde, Universit? Catholique de Louvain, Belgium * Leszek Pacholski, Wroclaw University, Poland To see the detailed program and register, please visit the workshop page at the ECSS 2012 website . ------------------------------------------------------------------------ * Workshop on Experimentation in Computer Science: Scope, Method and Relevance* *Workshop coordinator: Viola Schiaffonati, Politecnico di Milano* *Workshop Chairs: Jan Van Leeuwen (University of Utrecht) and Fabio A. Schreiber, Francesco Bruschi, Letizia Tanca (Politecnico di Milano)* *A trend has recently emerged toward making the experimental scientific method take center stage in computer science and engineering. Unfortunately, computer scientists do not seem to agree on how experimental methods are supposed to impact their theory and practice. This workshop is intended to give a home to interests in, and concerns about, the role and relevance of experimentation in informatics.* *Among the questions that will be discussed are the following:* *- Does it make sense to 'import' traditional experimental principles (such ad comparison, reproducibility, repeatability, justification, explanation) from traditional scientific disciplines into computer science and engineering? On the one side, the application of these principles allows for a more rigorous approach to experiments within computer science and engineering; on the other side, these principles are valid for disciplines (such as physics and biology) that aim at understanding and explaining natural phenomena, whereas computer science and engineering realize artifacts.* *- Computer science and engineering are composed of very heterogeneous subfields: is it possible to single out some common features characterizing "good experiments" across these subfields?* *- What does it mean to make experiments in computer science and engineering? Is it possible to ask this question in general terms or does it need to be specifically declined for each subfield?* *- Stimulating a deeper discussion on experiments in computer science and engineering can help promote a more scientific approach to the discipline: is this a possible way to look at the current debate on the relationship between computing and science?* *Speakers (partial list):* * ***K.M. (Kees) van Hee, Eindhoven University of Technology (TU/e) - The Netherlands* * ***Viola Schiaffonati, Politecnico di Milano - Italy* * ***Matti Tedre, University of Eastern Finland - Finland* *Contributions on the theme of the workshop are encouraged. They will be evaluated and selected by the ECSS 2012 program committee on the basis of relevance to (and capacity of) the program. Selected papers will be scheduled for presentation as part of the workshop, or in the main conference on November 21.* To see the detailed program and register, please visit the workshop page at the ECSS 2012 website . ** ------------------------------------------------------------------------ ------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From manuel.mazzara at newcastle.ac.uk Mon Aug 13 06:51:19 2012 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Mon, 13 Aug 2012 10:51:19 +0000 Subject: [TYPES/announce] SOAP track CfP In-Reply-To: <24CC3C1352CEA84EA16D392E6AED42C70A900E6F@EXMBDB01.campus.ncl.ac.uk> References: <24CC3C1352CEA84EA16D392E6AED42C70A900DF7@EXMBDB01.campus.ncl.ac.uk>, <24CC3C1352CEA84EA16D392E6AED42C70A900E07@EXMBDB01.campus.ncl.ac.uk>, <24CC3C1352CEA84EA16D392E6AED42C70A900E12@EXMBDB01.campus.ncl.ac.uk>, <24CC3C1352CEA84EA16D392E6AED42C70A900E23@EXMBDB01.campus.ncl.ac.uk>, <24CC3C1352CEA84EA16D392E6AED42C70A900E6F@EXMBDB01.campus.ncl.ac.uk> Message-ID: <24CC3C1352CEA84EA16D392E6AED42C70A900E7F@EXMBDB01.campus.ncl.ac.uk> Call for Papers Service-Oriented Architectures and Programming track of the 28th Symposium On Applied Computing http://www.itu.dk/acmsac2013-soap/ ACM SAC 2013 For the past twenty-eight years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is held at the Institute of Engineering of the Polytechnic Institute of Coimbra(ISEC-IPC). SOAP TRACK: CALL FOR PAPERS Service-Oriented Programming (SOP) is quickly changing our vision of the Web, bringing a paradigmatic shift in the methodologies followed by programmers when designing and implementing distributed systems. Originally, the Web was mainly seen as a means of presenting information to a wide spectrum of people, but SOP is triggering a radical transformation of the Web towards a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be discovered by other services and then invoked, abstracting from their actual implementation. Research on SOP is giving strong impetus to the development of new technologies and tools for creating and deploying distributed software. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of SOP needs to be clarified on many aspects, both from the engineering and from the foundational points of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modelling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, OWL, ...) and the syntactic one (WSDL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrate only on a few features of Service-Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service-Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming SOP into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what SOP still needs in order to achieve its original goal. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service-Oriented Computing - Methodologies and tools for Service-Oriented application design - Service-Oriented Middlewares - Service-Oriented Programming languages - Test methodologies for Service-Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service-Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service-Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service-Oriented Computing IMPORTANT DATES (strict) September 21, 2012: Paper submissions November 10, 2012: Author notification November 30, 2012: Camera-Ready Copy March 18-22, 2013: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will double-blindly review submissions. Accepted papers will be published in the annual conference proceedings. SOAP track chairs will not submit to the track. Submissions from SOAP PC members and from PC members and track chairs of other SAC tracks are welcome. Submission guidelines can be found on SAC 2013 Website: http://www.acm.org/conferences/sac/sac2013/ Prospective papers should be submitted to the track using the provided automated submission system. Please pay attention to ensure anonymity of your submitted manuscript as detailed in the submission page so to allow for double-blind review. Papers not satisfying this constraint will be automatically rejected. The maximum length for papers is 8 pages. Accepted papers whose camera-ready version will exceed 6 pages will have to pay an extra charge. For each accepted paper, an author or a proxy attending SAC MUST present the paper. This is a requirement for the paper to be included in the ACM/IEEE digital library. SPECIAL ISSUE Authors of best papers will be invited to submit an extended and revised version of their work to a special issue of Science of Computer Programming. STUDENT RESEARCH COMPETITION PROGRAM Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts will have the opportunity to give poster presentations of their work and compete for three top-winning places. The Student Research Competition committee will evaluate and select First-, Second-, and Third- place winners. The winners will receive cash awards and SIGAPP recognition certificates during the conference banquet. Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Luis Barbosa, Universidade do Minho - Braga (Portugal) Jesper Bengtson, IT University of Copenhagen (Denmark) Laura Bocchi, University of Leicester (UK) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Ettore Ferranti, ABB Switzerland Ltd Corporate Research (Switzerland) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. - Bologna (Italy) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Antonio Ravara, New University of Lisbon (Portugal) Gwen Sala?n, INRIA Grenoble (France) Martin Sch?f, UNU-IIST (Macao) Francesco Tiezzi, IMT Lucca (Italy) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) Huibiao Zhu, East China Normal University - Shanghai (China) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk UNU-IIST, Macao / School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italiana -------------- next part -------------- An HTML attachment was scrubbed... URL: From hongseok00 at gmail.com Mon Aug 13 08:52:46 2012 From: hongseok00 at gmail.com (Hongseok Yang) Date: Mon, 13 Aug 2012 13:52:46 +0100 Subject: [TYPES/announce] 2-year postdoc position on static analysis in the University of Oxford Message-ID: Postdoc position on program analysis Department of Computer Science, University of Oxford Project "Resource Reasoning" Grade 07S Postdoctoral Research Assistant Posted: 9th August 2012 The Department of Computer Science of University of Oxford has a vacancy for a postdoctoral research assistant to work in the area of program analysis under the direction of Dr Hongseok Yang. The post is funded by the EPSRC Programme Grant "Resource Reasoning" (http://www.resourcereasoning.com), which is split among Oxford, UCL, and Imperial. The post is available from October 2012, and will be of two years duration. The successful applicant will join the on-going collaboration between the research group of Dr Yang at Oxford and that of Prof Mayur Naik at Georgia Institute of Technology, USA. In the past two years, these two groups have combined results and insights from a variety of disciplines (in particular, machine learning, systems, and testing) to address key challenges in static program analysis and automatic software verification. The successful candidate will be able to develop her or his own ideas building on the results of this collaboration, which include the analysis infrastructures Chord and SpaceInvader. Also, the candidate will interact with the other partners of the Programme Grant, such as Prof Peter O'Hearn and Prof Byron Cook at UCL and Prof Philippa Gardner at Imperial. The successful candidate would be expected to develop research questions within a specific context, to undertake original individual research, and to prepare research papers. Applicants should have, or expect shortly to obtain, a PhD in computer science or some other relevant discipline, and should have experience in program analysis, testing, systems, decision procedures or machine learning. We especially encourage candidates to apply for this post if they have experiences of building real-world program analysis tools or have experience in machine learning and are interested in bringing data-driven statistical approaches of machine learning to the area of program analysis and automated software verification, where logic has played a crucial role so far. The post is a full time appointment, offered on a fixed term contract basis of up to 24 months, and has a salary on the University grade 7 currently ?29,249 - ?35,938 p.a. The closing date for applications is 12 noon on 10th September 2012. For further details see documents below and to apply please visit: https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.jobspec?p_id=104026 For informal enquiries, please contact: Hongseok Yang (hongseok.yang at cs.ox.ac.uk) -------------- next part -------------- An HTML attachment was scrubbed... URL: From gkuan at cs.uchicago.edu Mon Aug 13 10:05:12 2012 From: gkuan at cs.uchicago.edu (George Kuan) Date: Mon, 13 Aug 2012 07:05:12 -0700 Subject: [TYPES/announce] Postdoc Opening at HRL Labs Message-ID: We are currently seeking applicants for a post-doc position in the Cybersecurity group at HRL Laboratories (http://www.hrl.com) in Malibu, California, to work on research in language-based security, formal methods, and verification. For more information, please contact George Kuan (gkuan at [hrl dot com]). Apply via the website www.hrl.com (click on Careers, Current Openings, and 1221.04). Note: U.S. citizenship or permanent resident status required. ==== About the Position ==== Education Desired: Ph.D. in Computer Science, Applied Math, EE or related fields Essential Job Functions: Primary job function is to apply modern computer science and mathematical theory, analysis, and modeling techniques to problems and applications in secure computation, applied cryptography, software verification, information security, computer security and network security. Tasks will include the development, simulation, evaluation and implementation of modeling techniques, models and algorithms. Additional job functions include solving customer problems, writing invention disclosures, publishing papers, briefing customers, and assisting in marketing HRL expertise. Experience Desired: Research experience in one or more of the following areas: secure computation, homomorphic encryption, multiparty computation, applied cryptography, software verification, software reliability, programming language based security, formal methods, information security, software security, network security, computer security, secure operating systems, intrusion detection, and security threat assessment. Experience developing innovative solutions based upon the application of relevant research results from a wide variety of sources. Knowledge Desired: Background in one or more of the following areas: secure computation, homomorphic encryption, multiparty computation, applied cryptography, software verification, software reliability, formal methods, programming language based security, reliable software design software, network, operating system, or computer security, intrusion detection, and security threat assessment. Essential Physical/ Mental Requirements: Good communication (verbal and written) skills, active participation in R & D team activities is required. Able and willing to occasionally travel. SPECIAL REQUIREMENTS: U.S. citizenship or permanent resident status required. We are proud to be an EEO/AA employer M/F/D/V. We maintain a drug-free workplace and perform pre-employment substance abuse testing. ==== About HRL Laboratories ==== For more than 60 years, HRL's scientists and engineers have been on the leading edge of technology, conducting pioneering research, providing real-world technology solutions, and advancing the state of the art. We continue to be recognized as one of the world's premier physical science and engineering research laboratories. Our research collaborations with our LLC Member companies (Boeing and General Motors), government, commercial and academic institutions are realizing groundbreaking advances in ultra-high-performance circuitry, robust computing and communications, automated data extraction, and innovative architected materials. Our technologies operate in space, on aircraft, in automobiles, and in a variety of consumer products. These technologies make us safer, support our national security and improve our quality of life. Our success is the result of our collaborative team of researchers, many of whom are the leading experts in their fields. Through their insights in support for our customers, we are finding the unique opportunities in technology. As we look to the future, the technologies we are enabling today will be integral to a prosperous, secure, sustainable world. From jjb at microsoft.com Mon Aug 13 16:46:05 2012 From: jjb at microsoft.com (Josh Berdine) Date: Mon, 13 Aug 2012 20:46:05 +0000 Subject: [TYPES/announce] VMCAI 2013: Final call for papers (page limit extended) Message-ID: ATTENTION: Abstracts are due this Friday Papers are due next Friday The page limit for submissions has been increased to 20 pages. VMCAI 2013 CALL FOR PAPERS 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) http://vmcai13.di.univr.it January 20-22, 2013, Rome, Italy Co-located with POPL 2013 (http://popl.mpi-sws.org/2013/) 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages SCOPE VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. The program of VMCAI'13 will consist of refereed research papers and tool demonstrations, as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyberphysical systems. Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Proceedings are published by Springer-Verlag as volumes in the Lecture Notes in Computer Science series. IMPORTANT DATES Abstract Submission: August 17, 2012 Paper Submission: August 24, 2012 Acceptance Notification: October 12, 2012 Conference: January 20-22, 2013 (right before POPL) The submission system is now open and early submissions are welcome. The deadlines are strict and will not be changed. SUBMISSION INSTRUCTIONS The VMCAI 2013 proceedings will be published as a volume in Springer's Lecture Notes in Computer Science series. The page limit for submissions is: 20 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Tool demonstration are welcome provided that they include a scientific advance in the field. Formatting style files and further guidelines for formatting can be found at http://www.springer.de/comp/lncs/authors.html. Submissions deviating from these guidelines risk summary rejection. Please prepare your submission in accordance with the rules described above and submit a pdf file via: http://www.easychair.org/conferences/?conf=vmcai2013 PROGRAM COMMITTEE Program Chairs: Roberto Giacobazzi (Chair) Josh Berdine (Co_Chair) Isabella Mastroeni (Co_chair) Program Committee: Josh Berdine (MSR, UK & Co_Chair) Nikolaj Bjorner, (MSR, USA) Sandrine Blazy (U. Rennes, France) Agostino Cortesi (U. Venezia, Italy) Mads Dam (KTH, Sweden) Michael Emmi (U. Paris Diderot, France) Azadeh Farzan (U. Toronto, Canada) Pierre Ganty (IMDEA, Spain) Samir Genaim (U. Complutense, Spain) Roberto Giacobazzi (U. Verona, Italy & Chair) Orna Grumberg (Technion, Israel) Klaus Havelund (JPL, USA) Jochen Hoenicke (U. Freiburg, Germany) Sebastian Hunt (City U. London, UK) Limin Jia, (CMU, USA) Andy King (Kent, UK) Arun Lakhotia (U. Louisiana, USA) Akash Lal (MSR, India) Rupak Majumdar (MPI-SWS, Germany) Matthieu Martel (U. Perpignan, France) Isabella Mastroeni (U. Verona, Italy & Co_chair) Ganesan Ramalingam (MSR, India) Roberto Sebastiani (FBK, Italy) Saurabh Srivastava (Berkeley, USA) Greta Yorsh (ARM, UK) Enea Zaffanella (U. Parma, Italy) VMCAI STEERING COMMITTEE Agostino Cortesi, Universita' Ca' Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France E. Allen Emerson, University of Texas at Austin, USA Andreas Podelski, University of Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA ADDITIONAL INFORMATION Please consult: http://vmcai13.di.univr.it or contact PC chairs. From gerwin.klein at nicta.com.au Mon Aug 13 18:29:46 2012 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Mon, 13 Aug 2012 18:29:46 -0400 Subject: [TYPES/announce] CFP: Systems Software Verification (SSV'12) Message-ID: <8D1302F5-643C-4EBA-B682-B37A35E4BB79@nicta.com.au> [Note: Submission Deadline is 19 September 2012] 7th Systems Software Verification Conference (SSV 2012) November 28--30, 2012 Sydney, Australia http://www.ssv-conference.org/ *Scope Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, and static analysis techniques, as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions that are invalidated by complex embedded systems software such as operating system kernels, low-level device drivers, or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry who are facing real software and real problems with the goal of finding real, applicable solutions. By ?real? we mean problems such as time-to-market or reliability that the industry is facing. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic, toy version of it. In this workshop we will discuss software analysis and development techniques and tools; this forum will serve as a platform to discuss open problems and future challenges in dealing with existing and upcoming systems-level code. Topics include, but are not restricted to: ? Model checking ? Automated and interactive theorem proving ? Static analysis ? Automated testing ? Model-driven development ? Embedded systems development ? Programming languages ? Verifying compilers ? Software certification ? Software tools ? Experience reports *Submissions Submissions must be made electronically through the EasyChair system (https://www.easychair.org/conferences/?conf=ssv2012) until September 19th, 2012. Papers should be up to 15 pages in pdf format and formatted in EPTCS style. Additional details may be included in a clearly marked appendix, which will be read at the discretion of the program committee. All will be subject to peer review under normal conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Submissions which are based or discuss a non-trivial piece of software are required to make all those non-standard software parts available, which a referee may need, in order to check the claims of the submission. Submitted papers must not have previously appeared in a journal or conference with published proceedings and must not be concurrently submitted to any other peer-reviewed workshop, symposium, conference or archival journal. Any partial overlap with any such published or concurrently submitted paper must be clearly indicated. *Publication The proceedings will be published with EPTCS (http://eptcs.org). *Important Dates Abstract Submission: September 14, 2012 Paper Submission: September 19, 2012 Notification: October 19, 2012 Conference: November 28?30, 2012 *Location The workshop will be held in Sydney, Australia at NICTA NRL Laboratory. *Organization Organizing Committee and PC Chairs ? F. Cassez, NICTA, Sydney, Australia ? R. Huuck, NICTA and UNSW, Sydney, Australia ? G. Klein, NICTA and UNSW, Sydney, Australia ? B. Schlich, ABB Corporate Research, Ladenburg, Germany Program Committee ? Cyrille Artho, AIST, RISEC, Japan ? Stefan Berghofer, Secunet, Germany ? Fr?d?ric Boniol, ONERA, France ? Alessandro Coglio, Kestrel, USA ? Joe Hurd, Intel, USA ? Stefan Kowalewski, RWTH Aachen University, Germany ? Thomas Kropf, Robert Bosch GmbH & U. of T?bingen, Germany ? Kim G. Larsen, CISS, Aalborg University, Denmark ? Toby Murray, NICTA, Sydney, Australia ? Jan Peleska, Verified Systems International GmbH and University of Bremen, Germany ? John Regehr, University of Utah, USA ? Natarajan Shankar, SRI, USA ? Zhong Shao, Yale, USA ? Konrad Slind, Rockwell Collins, USA ? Jun Sun, National University of Singapore, Singapore From herbert at doc.ic.ac.uk Wed Aug 15 06:25:30 2012 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Wed, 15 Aug 2012 11:25:30 +0100 Subject: [TYPES/announce] CfP: Special Issue of TCS on QAPL 2011/12 - EXTENDED Deadline Message-ID: <502B791A.6030807@doc.ic.ac.uk> [apologies for multiple copies] Due to several requests the deadline for this special issue has been extended until beginning of September (see below). Authors intending to submit a paper should however contact the guest editors (see below) as soon as possible and provide a title and abstract. ------------------------------------------------------------------------- Special Issue of THEORETICAL COMPUTER SCIENCE on Quantitative Aspects of Programming Languages and Systems (QAPL 2011/12) ------------------------------------------------------------------------- ******************************** CALL FOR PAPERS ******************************** We invite the submission of papers on Quantitative Aspects of Programming Languages and Systems for publication in a special issue of the Journal of Theoretical Computer Science (TCS). In particular we welcome papers which are revised versions of the submitted to and presented at the QAPL 2011 Workshop in Saarbruecken and QAPL 2012 in Tallinn. We will additionally also welcome submissions of papers not presented at QAPL, provided they fall into the scope of the call. ------------------------------------------------------------------------- SCOPE ------------------------------------------------------------------------- Quantitative aspects of computation are important and sometimes essential in characterising the behaviour and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, risk and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. This special issue will be devoted to research papers which discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, contributions should focus on * the design of probabilistic and real-time languages and the definition of semantical models for such languages; * the discussion of methodologies for the analysis of probabilistic 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. * the investigation of computational models and paradigms involving quantitative aspects, such as those arising in quantum computation, systems biology, bioinformatics, etc. ------------------------------------------------------------------------- TOPICS ------------------------------------------------------------------------- Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, language expressiveness, quantitative language extension, semantics, logic, verification, automated reasoning, testing, model-checking, program analysis, performance analysis, resource analysis, safety, security and protocol analysis, risk and hazard analysis, for biological systems, quantum languages, information systems, multi-tasking and multi-core systems, time-critical systems, embedded systems, coordination models, scheduling theory, distributed systems, concurrent systems, etc. ------------------------------------------------------------------------- SUBMISSION ------------------------------------------------------------------------- Papers should be 20-25 pages long, including appendices, and should be formatted according to Elsevier's elsarticle.cls document style used for articles in the Journal of Theoretical Computer Science (see the Guide for Authors at http://ees.elsevier.com/tcs). http://support.elsevier.com/ Submissions are through the Elsevier Editorial System for TCS located at http://ees.elsevier.com/tcs/default.asp. To ensure that all manuscripts are correctly identified for inclusion into the special issue, please make sure you select/specify "SI:TCS_B QAPL 2011/12" when you reach the step in the submission process. ------------------------------------------------------------------------- IMPORTANT DATES ------------------------------------------------------------------------- * Paper submission: 3 September 2012 [Extended] * Notification: 30 November 2012 ------------------------------------------------------------------------- EDITORS ------------------------------------------------------------------------- Gethin Norman University of Glasgow, UK gethin at dcs.gla.ac.uk Mieke Massink CNR-ISTI, Pisa, Italy mieke.massink at isti.cnr.it Herbert Wiklicky Imperial College London, UK herbert at doc.ic.ac.uk ------------------------------------------------------------------------- Further information at http://www.dcs.gla.ac.uk/qapl11/special_issue.html From gtan at cse.lehigh.edu Wed Aug 15 13:42:19 2012 From: gtan at cse.lehigh.edu (Gang Tan) Date: Wed, 15 Aug 2012 13:42:19 -0400 Subject: [TYPES/announce] Postdoc position at Lehigh and Harvard Message-ID: <502BDF7B.9030005@cse.lehigh.edu> [Sorry if you receive multiple copies of this] Applications are invited for a full-time postdoctoral researcher position in GoNative, a joint project between Lehigh University and Harvard University. The project explores low-overhead techniques to sandbox machine code. Formal methods are leveraged to verify the security guarantees provided by the techniques. Ongoing efforts in GoNative include the building of high-fidelity models of widely-used machines (e.g., x86 and ARM), and the use of those models in security applications. Information about the project can be found at the following website: http://sos.cse.lehigh.edu/gonative An ideal applicant should have strong background and research interests in programming languages or software security. Familiarity with interactive theorem provers such as Coq will be a plus. The postdoc will be provided with competitive salary and employment benefits. The postdoc will split his/her time between Lehigh and Harvard to coordinate the research. The initial appointment will be for one year, with an option to renew for a second year. Inquiries about the position should be directed to Gang Tan (gtan at cse.lehigh.edu) and Greg Morrisett (greg at eecs.harvard.edu). Applicants should send a resume with at least two names of references. Applications will be reviewed until the position is filled; preference will be given to candidates who applied before Oct 15th, 2012. Lehigh University is an affirmative action/equal opportunity employer. Harvard University is an Equal Opportunity/Affirmative Action employer and applications from women and minority candidates are strongly encouraged. From gorel at cs.lth.se Wed Aug 15 16:37:32 2012 From: gorel at cs.lth.se (=?iso-8859-1?Q?G=F6rel_Hedin?=) Date: Wed, 15 Aug 2012 22:37:32 +0200 Subject: [TYPES/announce] CALL FOR PARTICIPATION in SLE/GPCE/FOSD 2012 Message-ID: <430D27EE-0BDC-4B22-94E4-4705C270A000@cs.lth.se> *********************************************************************************** CALL FOR PARTICIPATION in SLE/GPCE/FOSD 2012 Main Conferences, Keynotes, Workshops/Industrial Track, Doctoral Symposium, Poster Sessions Sept. 24th - Oct. 28th, 2012 Technische Universit?t Dresden/GERMANY SLE: http://planet-sl.org/sle2012 GPCE: http://program-transformation.org/GPCE12/ FOSD: http://planet-sl.org/fosd2012 *********************************************************************************** The 5th International Conference on Software Language Engineering (SLE 2012) is devoted to topics related to artificial languages in software engineering. Of particular relevance are technologies, methods, experiments, and case studies on software languages from modelware, grammarware and ontologyware perspectives. The 11th International Conference on Generative Programming and Component Engineering (GPCE 2012) is a venue for researchers and practitioners interested in techniques that use advanced programming languages, programming techniques, and program generators to improve the structure and modularity of programs. The 4th International Workshop on Feature-Oriented Software Development (FOSD) is to be aimed at the collaboration between the researchers who work in the field of FOSD or in the related fields of software product lines, service-oriented architecture, model-driven engineering and feature interactions. The SLE/GPCE/FOSD program overview is here to find: http://planet-sl.org/sle2012/index.php?option=com_content&view=article&id=10:program&catid=9:presentation REGISTRATION ============ Register online at http://planet-sl.org/sle2012/index.php?option=com_content&view=article&id=17:registration&catid=9:presentation until 24th August to take advantage of the early bird registration rates! We encourage you to reserve your hotel rooms using the conference registration site. SLE/GPCE KEYNOTES ================= SLE and GPCE have three keynote speakers: - ?ric Tanter (University of Chile): Taming Aspects - Oege de Moor (University of Oxford): Analysing Contributions - Margaret-Anne Storey (University of Victoria): Addressing Cognitive and Social Challenges in Using and Reusing Ontologies FOSD has two keynote speakers: - Mira Mezini (Darmstadt University of Technology): Programming Language Concepts for Feature-Oriented Software Development - Salvador Trujillo (IKERLAN Research Centre): FOSD-Engineering beyond Code: Experiences from Offshore Wind Power and Railways SLE/GPCE SCIENTIFIC PROGRAM =========================== 20 SLE and 15 GPCE presentations have been selected for presentation in altogether 12 sessions. Moreover, we have an SLE doctoral symposium with an own keynote and 12 presentations, 2 SLE poster sessions and 3 SLE minitutorials on metamodeling, grammarware, and ontologies. SLE INDUSTRIAL TRACK (ITSLE) ============================= On the 25th of September ITSLE12 will feature an industrial track: http://planet-sl.org/itsle2012/index.php?option=com_content&view=article&id=136&Itemid=319 This workshop brings together people from industry and academia working on domain specific languages and model driven software engineering. -------------- next part -------------- An HTML attachment was scrubbed... URL: From rlaemmel at gmail.com Wed Aug 15 22:27:36 2012 From: rlaemmel at gmail.com (Ralf Laemmel) Date: Thu, 16 Aug 2012 04:27:36 +0200 Subject: [TYPES/announce] Call for Remote Hackathon Participation at SoTeSoLa In-Reply-To: References: Message-ID: The hackathon on software mining, software reverse/re-engineering should also benefit from some (remote) participants who care about types and related areas such as static and dynamic software analysis. Please have a look and join us for this fun-oriented research event this summer, in fact, next week. Thanks and regards, Ralf L?mmel Call for Remote Hackathon Participation at SoTeSoLa http://planet-sl.org/sotesola2012-hackathon On 20 and 22 Aug, starting 5:55pm, CEST, SoTeSoLa will run an open Hackathon on software mining and reverse/re-engineering, for which remote participation is endorsed. Context Reverse and Re-engineering are established areas in software engineering and computer science. Reverse engineering is meant in a broad sense to include software mining, fact extraction, software visualization, vocabulary mining, analysis of language usage, architecture recovery, etc. Re-engineering is also meant in a broad sense to include, for example, program refactoring, wrapping, dead-code elimination, language migration, database re-engineering, and other forms of software evolution. There exist numerous methods and tools out there. There have been various efforts to integrate the related body of knowledge in textbooks, online resources, and otherwise. At SoTeSoLa, such integration will be continued in the form of a hackathon with on-site and remote participation. Objective During the hackathon, the participants exercise methods and tools of interest in reverse/re-engineering/software mining experiments. In order to focus efforts, to enable diverse experiments, and to stimulate synergies, the experiments target the software chrestomathy of the 101companies project, which is available as a git repository 101repo of source code and as dumps and resources 101data of extracted facts. The participants will typically target specific 101implementations or sets thereof, specific technologies (such as EF, JAXB, Hibernate, Ant, or Make), and specific languages (such as Java, Haskell, or C#). Such selection should help in demonstrating efficiently the methods and tools of interest. The expectation is that the hackathon produces a corpus of samples, which may be useful, for example, in teaching software mining, reverse and re-engineering, or as a benchmark or a point of reference in these areas of research. Some ilustrations and various helpful pointers are available (see the resource section of the website). Logistics On Monday, 20 Aug, the focus is on reverse engineering and specifically software mining; on Wedneday, 22 Aug, the focus is on re-engineering, hackathonists are welcome to reverse/re-engineer/mine software at all times, though. At the beginning of the hackathon, Vadim Zaytsev gives a presentation to explain the hackathon concept. This presentation will be recorded and broadcasted for remote participants. Remote participants can connect with on-site participants via Google Hangout and Skype. Hackathon teams with interesting results can give a short presentation in a designated session on the next day of the SoTeSoLa program. Checklist 1. Register through Hackathon web site. http://planet-sl.org/sotesola2012-hackathon 2. Receive Hackathon latest instructions before hackathon onsite, via Google Hangout, or YouTube. 3. Join in over Google Hangout or Skype during the hackathon. 4. Submit code and documentation, e.g., via GitHub. 5. Optionally, present during a designated SoTeSoLa session next day. Award All registered teams compete for the SoTeSoLa Hackathon award funded by Google. The winner will be selected by a committee that is formed at the school drawing from speakers and other senior community members present at the school. The presentation at the beginning of the hackathon provides advice on how to compete for the award. SoTeSoLa is a fun-oriented research event. Regards, Jean-Marie Favre (Research 2.0 Chair) Ralf Laemmel (General Chair, SoTeSoLa) Vadim Zaytsev (Hackathon Coordination) -------------- next part -------------- An HTML attachment was scrubbed... URL: From peterol at ifi.uio.no Fri Aug 17 10:02:30 2012 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Fri, 17 Aug 2012 16:02:30 +0200 Subject: [TYPES/announce] Final CfP: Formal Techniques for Safety-Critical Systems (FTSCS 2012) Message-ID: <9E65D159-7607-4EB7-B149-18243D310D78@ifi.uio.no> --------------------------------------------------------------------- Call for Papers FTSCS 2012 1st International Workshop on Formal Techniques for Safety-Critical Systems Kyoto, Japan, November 12, 2012 (satellite workshop of ICFEM 2012) http://www.ftscs12.org --------------------------------------------------------------------- *** Science of Computer Programming special issue *** *** EPTCS proceedings *** Aims and Scope: There is an increasing demand in industry to use formal methods to achieve software-independent verification and validation of safety-critical systems, e.g., in fields such as avionics, automotive, medical, and other cyber-physical systems. Newer standards, such as DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for formal methods and model-based development, speeding up the adaptation of such methods in industry. The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. In particular, FTSCS strives strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. Specific topics include, but are not limited to: * case studies and experience reports on the use of formal methods for analyzing safety-critical systems, including avionics, automotive, medical, and other kinds of safety-critical and QoS-critical systems * methods, techniques and tools to support automated analysis, certification, debugging, etc., of complex safety/QoS-critical systems * analysis methods that address the limitations of formal methods in industry (usability, scalability, etc.) * formal analysis support for modeling languages used in industry, such as AADL, Ptolemy, SysML, SCADE, Modelica, etc. * code generation from validated models. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. Invited speaker: TBA Submission: We solicit submissions reporting on: A- original research contributions (16 pages max, EPTCS format); B- applications and experiences (16 pages max, EPTCS format); C- surveys, comparisons, and state-of-the-art reports (16 pages max, EPTCS format); D- tool papers (4 pages max, EPTCS format); E- position papers and work in progress (4 pages max, EPTCS format) related to the topics mentioned above. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission will be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2012. The final version of the paper must be prepared in LaTeX, adhering to the EPTCS format available at http://style.eptcs.org/. Note, in particular, that EPTCS requires that you include the doi of each reference in the bibliography. Publication: All accepted papers will appear in the pre-proceedings of FTSCS 2012. Accepted papers in the categories A-D above will appear in the workshop proceedings that will be published as a volume in Electronic Proceedings in Theoretical Computer Science. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to appear in a special issue of the Science of Computer Programming journal. Important dates: Submission deadline: September 2, 2012 Notification of acceptance: October 1, 2012 Workshop: November 12, 2012 Venue: Kyoto, Japan Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Erika Abraham RWTH Aachen University, Germany Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia Farhad Arbab Leiden University and CWI, The Netherlands Cyrille Artho AIST, Japan Armin Biere Johannes Kepler University, Austria Saddek Bensalem Verimag, France Peter Bokor Technical University Darmstadt, Germany Santiago Escobar Universidad Politecnica de Valencia, Spain Bernd Fischer University of Southampton, UK Klaus Havelund NASA JPL, USA Marieke Huisman University of Twente, The Netherlands Ralf Huuck NICTA/UNSW, Sydney, Australia Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Yang Liu NUS, Singapore Steven P. Miller Rockwell Collins, USA Tang Nguyen AIST, Japan Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Grigore Rosu University of Illinois at Urbana-Champaign, USA Neha Rungta NASA Ames, USA Carolyn Talcott SRI International, USA Tatsuhiro Tsuchiya Osaka University, Japan Contact: (web) http://www.ftscs12.org (email) peterol at ifi.uio.no c.artho at aist.go.jp -------------- next part -------------- An HTML attachment was scrubbed... URL: From gopalan at cs.umn.edu Mon Aug 20 14:57:32 2012 From: gopalan at cs.umn.edu (Gopalan Nadathur) Date: Mon, 20 Aug 2012 13:57:32 -0500 Subject: [TYPES/announce] Postdoctoral Position at the University of Minnesota Message-ID: Applications are invited for a one-year postdoctoral position at the University of Minnesota related to an NSF-funded project entitled "Reasoning about Specifications of Computations." The position is available immediately: to guarantee consideration, applications must be received before September 7, 2012. The project within which the appointment is to be made concerns the areas of computational logic and programming languages. To be suitable for the position, the candidate should be broadly conversant with the issues in these areas and should have the mathematical and programming skills necessary for conducting research in them. Moreover, with suitable mentoring, he/she should be capable of developing an independent research agenda that encompasses some of the following topics: * the design of logics for specifying computational systems and for reasoning about such specifications, * the implementation of systems embodying such logics, and * the use of the implemented systems in constructing actual specifications and reasoning about them. Facility with proof assistants and logical frameworks such as Coq, Isabelle and Twelf, an understanding of proof theoretic treatments of aspects such as induction and co-induction and familiarity with issues related to proof search in sequent calculi and related logical systems would be needed for participating in the research at the appropriate level. A specific focus for the project is the Abella system (see http://abella.cs.umn.edu), developed originally at the University of Minnesota and currently also the subject of work within the Parsifal project at Ecole Polytechnique and INRIA, Saclay. The ideal candidate would have an interest in further developing the capabilities of this system and its applications during the appointment period. To apply for this position, go to the U of M Employment System at https://employment.umn.edu/ and search postings with req#: 179943. The online application process will require you to submit a current CV and a brief research statement that should describe past research and future plans in a way that addresses appropriateness for the position advertised. Please also provide names, phone numbers and email addresses of two or three references as part of this material; these references may be contacted as part of the application review process. Note that a prerequisite for employment is a doctoral degree in Computer Science or closely related field. Interested individuals are encouraged to contact Gopalan Nadathur at gopalan at cs.umn.edu for more information towards assessing the suitability of an application. From t.kitamura at aist.go.jp Tue Aug 21 02:48:46 2012 From: t.kitamura at aist.go.jp (Takashi KITAMURA) Date: Tue, 21 Aug 2012 15:48:46 +0900 Subject: [TYPES/announce] Call for Participation : ICFEM 2012 (12-16th Nov. 2012, Kyoto) Message-ID: ************************************************************ ICFEM 2012: 14th International Conference on Formal Engineering Methods 12th-16th, November, 2012 Kyoto Research Park, Kyoto, Japan URL: http://www.jaist.ac.jp/icfem2012 ************************************************************ CALL FOR PARTICIPATION REGISTRATION ------------ Registration for ICFEM 2012 is now open. Please visit http://www.jaist.ac.jp/icfem2012/registration/index.html. To take advantage of early registration, kindly register before August 31, 2012. We encourage you to reserve your hotel rooms ASAP, since it is a peak season in Kyoto for brilliant autumn leaves! This year's ICFEM has four affiliated workshops and a tutorial, and three prominent invited speakers. The program will be announced at the conference web site shortly. CO-LOCATED EVENTS ----------------- - FTSCS 2012 : First International Workshop on Formal Techniques for Safety-Critical Systems, http://www.ftscs12.org/ - WSOFL 2012 : 2nd Workshop on SOFL, http://icfem-fema.org/sofl/ - Event-B 2012 : DS-Event-B-2012: Workshop on the experience of and advances in developing dependable systems in Event-B, http://research.nii.ac.jp/eventb2012/ - Japanese Workshop on Industrial Applications of Formal Methods - CbC-Depend: Correct-by-Construction Development of Dependable Systems, Tutorial, http://www.rodintools.org/tutorial.html INVITED SPEAKERS ---------------- - Darren Cofer (Rockwell Collins, USA), "Formal Methods in the Aerospace Industry: Follow the Money" - Robert Shostak (Vocera Communications, Inc., USA), "Applying Term Rewriting to Speech Recognition of Numbers" - Mario Tokoro (Sony Computer Science Laboratories, Inc., Japan), "Toward Practical Application of Formal Methods in Software Lifecycle Processes" ACCEPTED PAPERS --------------- The list of accepted papers may be found at: http://www.jaist.ac.jp/icfem2012/acceptedPapers/index.html 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 -- Takashi KITAMURA Ph.D. t.kitamura at aist.go.jp Research Institute for Secure Systems (RISEC) 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 viktor at mpi-sws.org Wed Aug 22 02:34:21 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Wed, 22 Aug 2012 08:34:21 +0200 Subject: [TYPES/announce] CFP: Practical Aspects of Declarative Languages (PADL 2013) Message-ID: Call for Papers =============== 15th International Symposium on Practical Aspects of Declarative Languages (PADL 2013) http://www.it.uu.se/conf/padl2013/ Rome, Italy, January 21-22, 2013 Co-located with ACM POPL 2013 Conference Description ====================== Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raise numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include, but are not limited to: * Innovative applications of declarative languages * Declarative domain-specific languages and applications * Practical applications of theoretical results * New language developments and their impact on applications * Declarative languages and software engineering * Evaluation of implementation techniques on practical applications * Practical experiences and industrial applications * Novel uses of declarative languages in the classroom * Practical extensions such as constraint-based, probabilistic, and reactive languages. PADL 2013 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. In this occasion PADL is co-located, as traditionally, with ACM POPL, which will be held immediately following PADL. The symposium will be held in beautiful Rome, Italy. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2012 Paper Submission: September 17, 2012 Notification: October 28, 2012 Camera-ready: November 12, 2012 Symposium: January 21-22, 2013 Authors should submit an electronic copy of the full paper in PDF using the Springer LNCS format. The submission will be done through EasyChair conference system. If electronic submission is impossible, please contact the program chair long in advance for information on how to submit hard copies. All submissions must be original work written in English. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted but the authors should notify the program chair about the place on which it has previously appeared. PADL 2013 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 16 pages in Springer LNCS format. * Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers will be published in the Springer-Verlag conference proceedings, and will be presented in a separate session. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. The limit for application papers is 6 pages in Springer LNCS format but such papers can also point to sites with supplemental information about the application or the system that they describe. Program Committee ================= Elvira Albert, Complutense University of Madrid, Spain Maria Garcia de la Banda, Monash University, Australia Adam Chlipala, Massachusetts Institute of Technology, U.S.A. Bart Demoen, K.U. Leuven, Belgium Maurizio Gabbrielli, University of Bologna, Italy Jurriaan Hage, Utrecht University, The Netherlands Kevin Hammond, University of St. Andrews, U.K. Ralf Hinze, University of Oxford, U.K. Jacob Howe, City University London, U.K. Joxan Jaffar, National University of Singapore, Singapore Gabriele Keller, University of New South Wales, Australia Naoki Kobayashi, University of Tokyo, Japan Kim Nguyen, LRI, Universit? Paris-Sud, France Norman Ramsey, Tufts University, U.S.A. Kostis Sagonas, Uppsala University, Sweden; NTUA, Greece (chair) Vitor Santos Costa, University of Porto, Portugal Terrance Swift, Univ. Nova de Lisboa, Portugal; Johns Hopkins Univ., USA Dimitrios Vytiniotis, Microsoft Research, U.K Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Kostis Sagonas Uppsala University, Sweden Email: kostis it uu se From tiezzi at dsi.unifi.it Mon Aug 27 13:01:24 2012 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Mon, 27 Aug 2012 19:01:24 +0200 Subject: [TYPES/announce] JLAP Special Issue on Automated Specification and Verification of Web Systems - EXTENDED Deadline (Paper submission: September 7, 2012 Message-ID: [Apologies for multiple copies] **************************************************************************** Deadline for paper submission to the JLAP Special Issue on Automated Specification and Verification of Web Systems has been extended: Paper submission (new date): September 7, 2012 **************************************************************************** **************************************************************************** Call for Papers JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING Special Issue on Automated Specification and Verification of Web Systems http://rap.dsi.unifi.it/wwv2011/jlap-wwv.html **************************************************************************** IMPORTANT DATES Submission of papers: September 7, 2012 (EXTENDED) First review decision: November 26, 2012 Revision due: January 14, 2013 Acceptance notification: February 25, 2013 Final manuscript due: March 25, 2013 Expected publication: Summer 2013 AIMS AND SCOPE This special issue of the Journal of Logic and Algebraic Programming (JLAP, http://www.journals.elsevier.com/the-journal-of-logic-and-algebraic-programming/) is devoted to the topics of: - the 7th International Workshop on Automated Specification and Verification of Web Systems (WWV 2011, http://rap.dsi.unifi.it/wwv2011/), which took place on June 2011 in Reykjavik, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2011); - the 8th International Workshop on Automated Specification and Verification of Web Systems (WWV 2012, http://users.dsic.upv.es/~jsilva/wwv2012/), which will take place on June 2012 in Stockholm, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2012). This is however an open call for papers, therefore both participants of the workshop and other authors are encouraged to submit contributions. The aim of this special issue is to provide 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 have 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. We solicit original papers on topics of either theoretical or applied interest, which 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. SUBMISSION We expect original articles (typically 20-30 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published in another journal and that must not be simultaneously submitted for publication elsewhere. Each paper will undergo a thorough evaluation by at least two reviewers. The authors will have about 50 days to incorporate the comments of the reviewers and submit a revised version of their papers, which will be evaluated again by the reviewers to make a final decision. Contributions should be in PDF format and must comply with JLAP's author guidelines, which can be retrieved from http://www.elsevier.com/wps/find/journaldescription.cws_home/621520/authorinstructions. The manuscripts must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are handled using the Elsevier Editorial System and can be uploaded using the following link: http://ees.elsevier.com/jlap/default.asp In the submission process, the authors must select the article type 'Special Issue:WWV 2011'. GUEST EDITORS Laura Kovacs (lkovacs at complang.tuwien.ac.at) Vienna University of Technology, Austria Rosario Pugliese (rosario.pugliese at unifi.it) University of Florence, Italy Josep Silva (jsilva at dsic.upv.es) Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi (francesco.tiezzi at imtlucca.it) IMT Advanced Studies Lucca, Italy From peterol at ifi.uio.no Wed Aug 29 07:17:23 2012 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Wed, 29 Aug 2012 13:17:23 +0200 Subject: [TYPES/announce] Deadline extension: Formal Techniques for Safety-Critical Systems (FTSCS 2012) Message-ID: --------------------------------------------------------------------- Call for Papers FTSCS 2012 1st International Workshop on Formal Techniques for Safety-Critical Systems Kyoto, Japan, November 12, 2012 (satellite workshop of ICFEM 2012) http://www.ftscs12.org --------------------------------------------------------------------- *** Extended submission deadline: September 8, 2012 *** *** Science of Computer Programming special issue *** *** EPTCS proceedings *** Aims and Scope: There is an increasing demand in industry to use formal methods to achieve software-independent verification and validation of safety-critical systems, e.g., in fields such as avionics, automotive, medical, and other cyber-physical systems. Newer standards, such as DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for formal methods and model-based development, speeding up the adaptation of such methods in industry. The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. In particular, FTSCS strives strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. Specific topics include, but are not limited to: * case studies and experience reports on the use of formal methods for analyzing safety-critical systems, including avionics, automotive, medical, and other kinds of safety-critical and QoS-critical systems * methods, techniques and tools to support automated analysis, certification, debugging, etc., of complex safety/QoS-critical systems * analysis methods that address the limitations of formal methods in industry (usability, scalability, etc.) * formal analysis support for modeling languages used in industry, such as AADL, Ptolemy, SysML, SCADE, Modelica, etc. * code generation from validated models. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. Invited speaker: TBA Submission: We solicit submissions reporting on: A- original research contributions (16 pages max, EPTCS format); B- applications and experiences (16 pages max, EPTCS format); C- surveys, comparisons, and state-of-the-art reports (16 pages max, EPTCS format); D- tool papers (4 pages max, EPTCS format); E- position papers and work in progress (4 pages max, EPTCS format) related to the topics mentioned above. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission will be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2012. The final version of the paper must be prepared in LaTeX, adhering to the EPTCS format available at http://style.eptcs.org/. Note, in particular, that EPTCS requires that you include the doi of each reference in the bibliography. Publication: All accepted papers will appear in the pre-proceedings of FTSCS 2012. Accepted papers in the categories A-D above will appear in the workshop proceedings that will be published as a volume in Electronic Proceedings in Theoretical Computer Science. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to appear in a special issue of the Science of Computer Programming journal. Important dates: Submission deadline: September 8, 2012 Notification of acceptance: October 1, 2012 Workshop: November 12, 2012 Venue: Kyoto, Japan Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Erika Abraham RWTH Aachen University, Germany Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia Farhad Arbab Leiden University and CWI, The Netherlands Cyrille Artho AIST, Japan Armin Biere Johannes Kepler University, Austria Saddek Bensalem Verimag, France Peter Bokor Technical University Darmstadt, Germany Santiago Escobar Universidad Politecnica de Valencia, Spain Bernd Fischer University of Southampton, UK Klaus Havelund NASA JPL, USA Marieke Huisman University of Twente, The Netherlands Ralf Huuck NICTA/UNSW, Sydney, Australia Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Yang Liu NUS, Singapore Steven P. Miller Rockwell Collins, USA Tang Nguyen AIST, Japan Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Grigore Rosu University of Illinois at Urbana-Champaign, USA Neha Rungta NASA Ames, USA Carolyn Talcott SRI International, USA Tatsuhiro Tsuchiya Osaka University, Japan Contact: (web) http://www.ftscs12.org (email) peterol at ifi.uio.no c.artho at aist.go.jp -------------- next part -------------- An HTML attachment was scrubbed... URL: From vladimir at ias.edu Thu Aug 30 14:20:24 2012 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Thu, 30 Aug 2012 14:20:24 -0400 Subject: [TYPES/announce] IAS program wiki Message-ID: <7AEC09CA-4281-42AB-97BF-62458A82AA55@ias.edu> Hello, I have created a wiki for the forthcoming special year on Univalent Foundations at IAS. The wiki is in a very rudimentary stage yet but it will eventually get more content. It is here: uf-ias-2012.wikispaces.com Vladimir. From davide at disi.unige.it Sun Sep 2 17:12:56 2012 From: davide at disi.unige.it (Davide Ancona) Date: Sun, 02 Sep 2012 23:12:56 +0200 Subject: [TYPES/announce] OOPS track at SAC 2013: Final Call for Papers Message-ID: <5043CBD8.9080303@disi.unige.it> The list of PC members is now available. OOPS 2013 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS13 Special Track at the 28th ACM Symposium on Applied Computing, SAC 2013 http://www.acm.org/conferences/sac/sac2013 Institute of Engineering of the Polytechnic Institute of Coimbra, Portugal March 18-22, 2013 - Important Dates (deadlines are strict) Regular papers: September 21, 2012 Paper submission November 10, 2012 Author notification November 30, 2012 Camera-ready copies March 18-22, 2013 SAC 2013 Student Research Abstracts: October 31, 2012 Research Abstracts November 30, 2012 Author Notification March 19, 2013 Presentations - Track Chair Davide Ancona (davide at disi.unige.it) DIBRIS, University of Genova, Italy - Program Committee Alexandre Bergel, University of Chile, Chile Bruno Cabral, Universidade de Coimbra, Portugal Walter Cazzola, Universit? di Milano, Italy Wei-Ngan Chin, National University of Singapore, Singapore Ferruccio Damiani, Universit? di Torino, Italy Frank de Boer, CWI Amsterdam, The Netherlands Roland Ducournau, LIRMM, Montpellier - France Erik Ernst, Aarhus University, Denmark Yossi Gil, Technion - Israel Institute of Technology, Israel Robert Hirschfeld, Hasso-Plattner-Institut, University of Potsdam, Germany Jaakko J?rvi, Texas A&M University, USA Doug Lea, Suny Oswego, USA Rosemary Monahan, National University of Ireland Maynooth, Ireland David Pearce, Victoria University of Wellington, New Zealand Arnd Poetzsch-Heffter, TU Kaiserslautern, Germany Antonio Ravara, Universidade Nova de Lisboa, Portugal Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea Joao Seco, Universidade Nova de Lisboa, Portugal - SAC 2013 For the past twenty-seven years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Polytechnic Institute of Coimbra, Coimbra, Portugal, Institute of Systems and Robotics, University of Coimbra, Coimbra, Portugal Mathematical and Computer Sciences Institute, University of Sao Paulo, Sao Paulo, Brazil, and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra. - Call For Student Research Abstracts (New to SAC): Graduate students seeking feedback from the scientific community on their research ideas are invited to submit abstracts of their original un-published and in-progress research work in areas of experimental computing and application development related to SAC 2013 Tracks. - OOPS Track Object-oriented programming (OOP) has become the mainstream programming paradigm for developing complex software systems in most application domains. However, existing OO languages and platforms need to evolve to meet the continuous demand for new abstractions, features, and tools able to reduce the time, effort, and cost of creating object-oriented software systems, and improving their performance, quality and usability. To this aim, OOPS is seeking for research advances bringing benefits in all those typical aspects of software development, such as modeling, prototyping, design, implementation, concurrency and distribution, code generation, analysis, verification, testing, evaluation, deployment, maintenance, reuse, and software evolution and adaptation. The specific OO related topics of interest for the OOPS track include, but are not limited to, the following: * Aspects and components * Code generation, and optimization, just-in-time compilation * Distribution and concurrency * Dynamic and scripting languages * Evaluation * Formal verification * Integration with databases, object persistence * Integration with other paradigms * Interoperability, versioning and software evolution and adaptation * Language design and implementation * Modular and generic programming * Reflection, meta-programming * Software product lines * Static analysis * Type systems and type inference * Virtual machines OOPS offers a great opportunity to the OOP community to gain visibility, and to exploit the inter-disciplinary nature of SAC. - Submission Instructions Prospective papers should be submitted in pdf format using the provided automated submission system. All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The format of the paper must adhere to the sig-alternate style. The paper must not exceed 8 pages according to the above style; please note that this is the same page limit as for the final version. However, for camera-ready papers exceeding 6 pages each additional page will be charged 80 USD. Papers that fail to comply with length limitations risk rejection. All papers must be submitted by September 21, 2012. For more information please visit the SAC 2013 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as 2-3 pages extended abstracts in the same proceedings (the additional third page will be charged 80 USD). Please note that full registration is required for papers and posters to be included in the conference proceedings and CD. Papers and posters NOT presented at conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, depending on the quality and the overall number of accepted papers, authors of selected papers will be invited to submit an extended version for a journal special issue, after the conference. From hammer at cs.uni-saarland.de Mon Sep 3 08:12:36 2012 From: hammer at cs.uni-saarland.de (Christian Hammer) Date: Mon, 3 Sep 2012 14:12:36 +0200 Subject: [TYPES/announce] Call for Extended Abstract: ID Workshop 2013 References: <50448A3E.1010707@cs.ucl.ac.uk> Message-ID: CALL FOR EXTENDED ABSTRACTS ID 2013 - 1st International Workshop on Interference and Dependence 2013 21 January, 2013, Rome, Italy (Co-located with POPL 2013) ------------------------------------------------------------ Important Dates ------------------------------------------------------------ Extended Abstract deadline: October 5th, 2012 Author notification: November 7th, 2012 URL: https://sites.google.com/site/idworkshop2013/ Interference and dependence are closely related concepts, the first being the observational phenomenon connected to the second. Interference refers to the behaviour of some parts of a system influencing the behaviour of another part of the system. Dependence specifies the relation which determines those parts of the system that influence the computation of another part of the system. Both interference and dependence analysis underpin many activities of computer science, including program analysis, debugging, traceability, refinement (longitudinal dependence) that can raise issues in testing, analysing software for security properties, testing software, reverse engineering, slicing, model checking software and specifications. This workshop will bring together researchers working on interference and dependence from both the modelling and programming research communities to discuss connections and challenges. ID 2013 solicits abstracts on the following topics, but are not limited to these: -Security against unwanted interference and dependence -Models and theories of program interference -Algorithms for reducing or removing interference or for ameliorating its effects -Theory and foundations of program slicing and related dependence analyses -Resource declassification theories -Semantics of dependence and interference -Analyses based on interference and dependence -Abstract interpretation for dependence and interference -Dependence and interference in specifications -Slicing models and specifications -Interaction between dependence and refinement ---------------------- Submission ---------------------- The workshop welcomes contributions of on-going work and ideas in the field of interference and dependence. Those who are interested in having a talk at the workshop and/or discussing issues related with these subjects are invited to send your extended abstract to Kelly Androutsopoulos (K.Androutsopoulos at cs.ucl.ac.uk) before the 5th October 2012. Submitted extended abstracts should be of at most 10 pages LNCS-style. All the workshop contributions will be displayed on the workshop web-page and be included in the workshop technical report. Extended Abstract deadline: October 5th, 2012 Author notification: November 7th, 2012 ---------------------- Organising Committee ---------------------- Kelly Androutsopoulos, University College London, UK David Clark, University College London, UK Tony Clark, Middlesex University, UK Christian Hammer, CISPA, Saarland University, Germany ---------------------- Program Committee ---------------------- Torben Amtoft, Kansas State University, USA Kelly Androutsopoulos, University College London, UK Anindya Banerjee, IMDEA Software Institute, Spain David Clark, University College London, UK Tony Clark, Middlesex University, UK Sebastian Danicic, Goldsmiths College, UK Christian Hammer, CISPA, Saarland University, Germany Mark Harman, University College London, UK Sebastian Hunt, City University London, UK Kevin Lano, King's College London, UK Pasquale Malacaria, Queen Mary University of London, UK Dave Sands, Chalmers University of Technology Gothenburg, Sweden Andrea Zisman, University College London, UK -------------- 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 viktor at mpi-sws.org Tue Sep 4 05:22:25 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Tue, 4 Sep 2012 11:22:25 +0200 Subject: [TYPES/announce] CFP: Practical Aspects of Declarative Languages (PADL 2013) Message-ID: <1B2DBBA0-7CF8-43E7-8FE8-77E67F9EDC01@mpi-sws.org> Call for Papers =============== 15th International Symposium on Practical Aspects of Declarative Languages (PADL 2013) http://www.it.uu.se/conf/padl2013/ Rome, Italy, January 21-22, 2013 Co-located with ACM POPL 2013 Conference Description ====================== Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raise numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include, but are not limited to: * Innovative applications of declarative languages * Declarative domain-specific languages and applications * Practical applications of theoretical results * New language developments and their impact on applications * Declarative languages and software engineering * Evaluation of implementation techniques on practical applications * Practical experiences and industrial applications * Novel uses of declarative languages in the classroom * Practical extensions such as constraint-based, probabilistic, and reactive languages. PADL 2013 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. In this occasion PADL is co-located, as traditionally, with ACM POPL, which will be held immediately following PADL. The symposium will be held in beautiful Rome, Italy. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2012 Paper Submission: September 17, 2012 Notification: October 28, 2012 Camera-ready: November 12, 2012 Symposium: January 21-22, 2013 Authors should submit an electronic copy of the full paper in PDF using the Springer LNCS format. The submission will be done through EasyChair conference system. If electronic submission is impossible, please contact the program chair long in advance for information on how to submit hard copies. All submissions must be original work written in English. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted but the authors should notify the program chair about the place on which it has previously appeared. PADL 2013 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 16 pages in Springer LNCS format. * Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers will be published in the Springer-Verlag conference proceedings, and will be presented in a separate session. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. The limit for application papers is 6 pages in Springer LNCS format but such papers can also point to sites with supplemental information about the application or the system that they describe. Program Committee ================= Elvira Albert, Complutense University of Madrid, Spain Maria Garcia de la Banda, Monash University, Australia Adam Chlipala, Massachusetts Institute of Technology, U.S.A. Bart Demoen, K.U. Leuven, Belgium Maurizio Gabbrielli, University of Bologna, Italy Jurriaan Hage, Utrecht University, The Netherlands Kevin Hammond, University of St. Andrews, U.K. Ralf Hinze, University of Oxford, U.K. Jacob Howe, City University London, U.K. Joxan Jaffar, National University of Singapore, Singapore Gabriele Keller, University of New South Wales, Australia Naoki Kobayashi, University of Tokyo, Japan Kim Nguyen, LRI, Universit? Paris-Sud, France Norman Ramsey, Tufts University, U.S.A. Kostis Sagonas, Uppsala University, Sweden; NTUA, Greece (chair) Vitor Santos Costa, University of Porto, Portugal Terrance Swift, Univ. Nova de Lisboa, Portugal; Johns Hopkins Univ., USA Dimitrios Vytiniotis, Microsoft Research, U.K Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Kostis Sagonas Uppsala University, Sweden Email: kostis it uu se From paolini at di.unito.it Tue Sep 4 05:32:14 2012 From: paolini at di.unito.it (Luca Paolini) Date: Tue, 04 Sep 2012 11:32:14 +0200 Subject: [TYPES/announce] TLCA 2013 First Call for Papers Message-ID: <5045CA9E.7010105@di.unito.it> ================================================================ TLCA 2013 First Call for Papers 11th International Conference on Typed Lambda Calculi and Applications Eindhoven, 23-28 June 2013 co-located with RTA 2013 as part of RDP 2013 RDP 2013 webpage: http://www.win.tue.nl/rdp2013/ ================================================================ The 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: * Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models * Types: subtypes, dependent types, polymorphism, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants * Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, flow analysis of higher-type computation, program equivalence, program transformation and optimization IMPORTANT DATES * Paper Registration (titles & short abstracts): 25 January 2013 * Full Paper Submission: 1 February 2013 * Author Notification: 22 March 2013 * Camera-Ready Paper for the Proceedings: 12 April 2013 SUBMISSION GUIDELINES We solicit submissions of research papers, which must: * be in English and not exceed 15 pages (including figures and bibliography). Additional material intended for the reviewers but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers will be told that they may choose to ignore the appendix. * present original research which is unpublished and not submitted elsewhere (conferences, journals, books, etc.) * use the Springer-Verlag LNCS style. * be submitted electronically in PDF via the EasyChair TLCA 2013 Submission Webpage (will open nearer the deadline) https://www.easychair.org/conferences/?conf=tlca2013 . Submissions deviating from these instructions may be rejected without review. A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. The proceedings will be published as a volume in the ARCoSS subline series of Springer-Verlag Lecture Notes in Computer Science. Final papers will be in the format specified by Springer-Verlag. Any questions regarding the submission guidelines should be directed to the Programme Committee Chair (Masahito Hasegawa ) prior to submitting. COLOCATED EVENTS TLCA 2013 is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the International Conference on Rewriting Techniques and Applications (RTA 2013) and several related events. Details on workshops affiliated with RDP 2013 will be available at the web site in due course. CONFERENCE CHAIR Herman Geuvers (Radboud University Nijmegen, Netherlands) PROGRAMME COMMITTEE CHAIR Masahito Hasegawa (Kyoto University, Japan) PROGRAMME COMMITTEE Andreas Abel (LMU Munchen, Germany) Patrick Baillot (CNRS and ENS Lyon, France) Nick Benton (Microsoft Cambridge, UK) Lars Birkedal (IT University of Copenhagen, Denmark) Herman Geuvers (Radboud University Nijmegen, Netherlands) Masahito Hasegawa (Kyoto University, Japan) (PC chair) Naoki Kobayashi (University of Tokyo, Japan) Paul-Andre Mellies (CNRS and Universite Paris Diderot, France) Thomas Streicher (TU Darmstadt, Germany) Lorenzo Tortora de Falco (Universita Roma Tre, Italy) Stephanie Weirich (University of Pennsylvania, US) TLCA STEERING COMMITTEE Samson Abramsky (University of Oxford, UK) Henk Barendregt (Radboud University Nijmegen, Netherlands) Pierre-Louis Curien (CNRS and Universite Paris Diderot, France) Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy) Martin Hofmann (LMU Munchen, Germany) Luke Ong (University of Oxford, UK) Simona Ronchi Della Rocca (Universita di Torino, Italy) Pawel Urzyczyn (University of Warsaw, Poland) TLCA HONORARY ADVISOR Roger Hindley (Swansea University) TLCA PUBLICITY CHAIR Luca Paolini (Universita di Torino, Italy) From amoeller at cs.au.dk Wed Sep 5 09:04:20 2012 From: amoeller at cs.au.dk (=?ISO-8859-1?Q?Anders_M=F8ller?=) Date: Wed, 05 Sep 2012 15:04:20 +0200 Subject: [TYPES/announce] Postdoc and PhD positions - Center for Advanced Software Analysis Message-ID: <50474DD4.50208@cs.au.dk> Several postdoc positions and PhD stipends are available in the Center for Advanced Software Analysis (CASA) at Aarhus University, Denmark, funded by the Danish Research Council for Technology and Production Sciences and the Danish Council for Independent Research, with additional support from IBM Research and Google. The CASA center covers research in program analysis, type systems, testing, language design and programming tools for web application development, with a particular focus on dynamic scripting languages for the web. Our current work involves static analysis and automated testing for JavaScript and Java web applications, but we wish to expand toward other programming languages and techniques. The postdoc positions are at the level of Research Assistant Professor of Computer Science and are initially for 1.5 years, but they can be extended to 3 years by mutual consent. We welcome researchers with clearly demonstrated experience and skills in one or more of the research areas mentioned above. The PhD positions are administered through the Aarhus Graduate School of Science and include full tuition waiver and a very competitive scholarship. Applications are welcomed from students with at least three years of full-time study. Students with a strong background in Programming Languages will be preferred. For more information, see http://cs.au.dk/CASA/ or contact Associate Professor Anders M?ller . Interested candidates should send an email containing a brief letter of interest and a CV. Applications will be considered until the positions are filled. From might at cs.utah.edu Wed Sep 5 17:03:56 2012 From: might at cs.utah.edu (Matt Might) Date: Wed, 5 Sep 2012 15:03:56 -0600 Subject: [TYPES/announce] PLDI 2013: First call for papers Message-ID: *** IMPORTANT DATES *** Paper submission: 11 November 2012 Rebuttal period: 15-17 January 2013 Notification: 5 February 2013 URL: http://pldi2013.ucombinator.org/ *** INFORMATION *** PLDI is a forum for the exchange of information on programming languages, their design, implementation, development, and use. PLDI emphasizes innovative and creative approaches to compile-time and runtime technology, novel language designs and features, and results from implementations. Papers are solicited on, but not limited to, the following topics: + Language designs and extensions + Static and dynamic analysis of programs + Domain-specific languages and tools + Type systems and program logics + Program transformation and optimization + Checking or improving the security or correctness of programs + Memory management + Parallelism, both implicit and explicit + Performance analysis, evaluation, and tools + Novel programming models + Debugging techniques and tools + Program understanding + Interaction of compilers/runtimes with underlying systems + Program synthesis Submissions must be in ACM SIGPLAN proceedings format, 9-point type, and may not exceed 10 pages (all inclusive). Submissions should be written to allow for double-blind reviewing. For full submission guidelines, please refer to the web page: http://pldi2013.ucombinator.org/ TOPLAS session This year's PLDI will include a session presenting recent TOPLAS papers. Original papers submitted to TOPLAS before October 1, 2012 can be considered for presentation at PLDI 2013; authors should put a note in their cover letter to indicate interest. These papers will not appear in the PLDI proceedings. For more information, see http://compilers.cs.ucla.edu/toplas/index.html On behalf of the PLDI 2013 organizers, Hans Boehm (General Chair) Cormac Flanagan (Program Chair) From c.grelck at uva.nl Thu Sep 6 05:40:34 2012 From: c.grelck at uva.nl (Clemens Grelck) Date: Thu, 06 Sep 2012 11:40:34 +0200 Subject: [TYPES/announce] Call for papers: HiPEAC Workshop FD-COMA 2013 Message-ID: <50486F92.7020407@uva.nl> =========================================================================== Call for Papers 2nd Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures FD-COMA 2013 Jan 22, 2013 8th HiPEAC Conference Berlin, Germany Jan 21-23, 2013 http://www.project-advance.eu/2012/07/fd-coma-workshop-2013/ http://www.hipeac.net/conference =========================================================================== FD-COMA is a half-day workshop during the 8th HiPEAC Conference in Berlin, January 21-23, 2013. The workshop is loosely connected to the FP-7 project Advance, but we particularly welcome contributions from outside the project consortium. =========================================================================== Mission: Feedback driven optimizations have long proven to be powerful instruments for achieving better hardware utilization, but the on-going multi-core and many-core revolution opens up a whole new realm of possible applications and variations of feedback-directed compiler optimization. The increasing hardware diversity of execution platforms and the likewise increasing hardware heterogeneity of individual execution platforms make compile time resource planning less and less feasible. Dynamic compilation techniques are required, instead, that adapt application programs to the actual hardware they are running on to make best use of it. Furthermore, the abundance of compute cores allows us to run feedback-directed compiler optimizations in parallel with an application itself and, thus, to adapt a running application to the hardware it is running on or to the data it is processing, to name just a few opportunities. This workshop aims at bringing people together that share an interest in the novel opportunities for feedback directed optimisations in the context of the emerging heterogeneous architectures. =========================================================================== Main topics: + Feedback directed compiler optimization for multi-core architectures + Data representation for runtime feedback information + Performance modelling for feedback, including statistical and constraint-based techniques + Performance measurement techniques suitable for dynamic feedback + Exploiting feedback for improved scheduling and improved mapping + Adaptive, feedback-controlled runtime systems for multi-core architectures + Exploiting feedback information for energy savings =========================================================================== FD-COMA welcomes submission of papers describing: + Experimental work + Industrial experience + Theoretical work + Software and hardware platforms + Work in progress all with respect to the above workshop topics =========================================================================== Paper submission: Submitted papers must not have been published or simultaneously submitted elsewhere. The full manuscript should be at most 8 pages in ACM SIGPLAN double column format. Submit a PDF copy of your manuscript via EasyChair: https://www.easychair.org/conferences/?conf=fdcoma2013 . Each paper will receive a minimum of two reviews. Papers will be selected based on their originality, relevance, technical clarity and presentation. Authors of accepted papers must guarantee that their papers will be registered and presented at the workshop. Accepted papers will be made available in printed form during the shop as well as in electronic form on the workshop homepage and as part of the HiPEAC conference materials. =========================================================================== Important dates: Submission deadline: 12/10/2012 Notification of acceptance: 12/11/2012 Final version due: 8/12/2012 =========================================================================== Workshop organizers: Clemens Grelck, University of Amsterdam, Netherlands Kevin Hammond, University of St Andrews, United Kingdom Sven-Bodo Scholz, Heriot-Watt University, United Kingdom =========================================================================== -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From hans at cs.aau.dk Thu Sep 6 14:29:21 2012 From: hans at cs.aau.dk (=?Windows-1252?Q?Hans_H=FCttel?=) Date: Thu, 6 Sep 2012 18:29:21 +0000 Subject: [TYPES/announce] BEAT'13 - First Call for Papers Message-ID: CALL FOR PAPERS BEAT'13 ? 1st International Workshop on Behavioural Types http://beat13.cs.aau.dk January 22, 2013, Rome, Italy Collocated with POPL 2013, 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (http://popl.mpi-sws.org/2013/) ------------------------------------------------------------------------------------ SCOPE Behavioural type systems in general, and in particular those based on typestate, are attracting a lot of attention as these are able to ensure more than the usual safety guarantees of static program analyses. In the last ten years the idea of "types-as-processes" has been explored in several directions, providing dedicated type algebras for particular properties, ranging from protocol compatibility to race-freedom or activeness, as well as general type systems for a wide range of properties. The approaches include those of session types, generic type systems and behavioural ontracts as well as other type-theoretic notions, e.g. intersection types, that can be used to specify the behaviour of systems. These approaches have given rise to several important results. This workshop aims to present contributions on the theory and applications of behavioural types and to foster discussion on the pros and cons of different approaches and on new directions and challenges in the area. Topics include, but are not limited to ? The theoretical foundations of behavioural types ? Relationships between different approaches ? Applications to language design and implementation ? Applications to security ? Applications to composition ? Applications to code generation ? New applications of behavioural types ------------------------------------------------------------------------------------ SUBMISSIONS All accepted papers will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal, workshop or conference with refereed proceedings. Submissions can be up to 12 pages long and must use the ACM SIGPLAN format. The SIGPLAN template can be found at http://www.sigplan.org/authorInformation.htm All submissions must be contributed as PDF files via the EasyChair page. http://www.easychair.org/conferences/?conf=beat13 ------------------------------------------------------------------------------------ IMPORTANT DATES Submission deadline: 8 October 2012 Notification: 8 November 2012 Camera-ready cope due: 12 November 2012 -- On behalf of the BEAT'13 organizers Hans H?ttel (Program Chair) From might at cs.utah.edu Thu Sep 6 14:56:29 2012 From: might at cs.utah.edu (Matt Might) Date: Thu, 6 Sep 2012 12:56:29 -0600 Subject: [TYPES/announce] Postdoc position in static analysis Message-ID: The U Combinator research group at the University of Utah has an open postdoc position in static analysis. ?The position, funded by a joint project between the University of Utah and Northeastern University, brings the opportunity direct and engage a vibrant laboratory of graduate students. Top candidates will exhibit strength in all of the following areas, but candidates with expertise in at least two areas are encouraged to apply: (1) static analysis, (2) functional programming, and (3) security. The aim of the underlying project is to develop precise and scalable security-oriented static analyses for Android applications. ?At the same time, the project requires deep foundational thrusts in static analysis of higher-order programs. The position will be annually renewable by mutual consent for up to three years, subject to the availability of funding. To apply, please send a CV and a brief statement of interest to Matt Might (might at cs.utah.edu). From guoqingx at ics.uci.edu Thu Sep 6 15:49:41 2012 From: guoqingx at ics.uci.edu (Harry Xu) Date: Thu, 6 Sep 2012 12:49:41 -0700 Subject: [TYPES/announce] PPoPP'13 workshop/tutorial deadline extended to Sept. 15 Message-ID: <00b001cd8c68$c3049fc0$490ddf40$@ics.uci.edu> [Apologize for any duplicated posts] 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2013 ) February 23-27, 2013, Shenzhen, China Call for Workshops and Tutorials Proposal submission deadline: September 1, 2012 (extended to September 15, 2012) Notification of acceptance: September 30, 2012 Please send all proposals to the workshops/tutorials chair, Harry Xu, at harry.g.xu at uci.edu and include "PPoPP 2013" in the subject line. The ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) 2013 is seeking proposals for workshops and tutorials to accompany the conference. Workshops and tutorials will be held on Saturday-Sunday, February 23-24, 2013 and may be a half day or a full day in length. We encourage members of the community to consider submitting proposals for workshops that bring together researchers and practitioners working on research topics of significant current interest, as well as workshops that bring together researchers and practitioners working in particular areas. Specific topics of interest include (but are not limited to): * Parallel programming theory and models * Formal analysis and verification * Middleware for parallel systems * Parallel programming languages * Compilers and runtime systems * Automatic parallelization * Parallel libraries or application frameworks * Performance analysis, debugging and optimization * Development, analysis, or management tools * Parallel algorithms * Parallel applications * Concurrent data structures * Synchronization and concurrency control * Software engineering for parallel programs * Fault tolerance for parallel systems * Software issues for multicore and multithreaded processors * Software for accelerators and hybrid systems * Task mapping and scheduling * Parallelism in non-scientific workloads: web servers, search, analytics Workshop proposals should include: * The workshop title * The organizers and their affiliations * A one-page description of the workshop and/or a proposed call for participation or papers * The proposed length of the workshop (half day or full day; if half day, planned length in hours) * If the workshop was previously held, the number of attendees at the last workshop and the number of presentations or papers given at the workshop. Tutorial proposals should include: * The tutorial title * Organizers, presenters, and their affiliations * A one-page description of the tutorial * The proposed length of the tutorial (half day or full day; if half day, planned length in hours) * If the tutorial has been given previously, the location, date, and number of attendees at the last tutorial Committee Information Workshops and Tutorials Chair: Harry Xu, University of California, Irvine General Chairs: Alex Nicolau, University of California, Irvine Xiaowei Shen, IBM Research, China Program Chair: Saman Amarasinghe, MIT Richard Vuduc, Georgia Tech -------------- next part -------------- An HTML attachment was scrubbed... URL: From ksuenaga at fos.kuis.kyoto-u.ac.jp Fri Sep 7 01:43:41 2012 From: ksuenaga at fos.kuis.kyoto-u.ac.jp (Kohei SUENAGA) Date: Fri, 7 Sep 2012 14:43:41 +0900 Subject: [TYPES/announce] APLAS 2012: Call for Posters and Demos Message-ID: (Apologies for multiple copies.) 10th Asian Symposium on Programming Languages and Systems (APLAS 2012) Call for Poster and Demos APLAS 2012 will include a poster and demo session during the conference. The poster session aims to give students and professionals an opportunity to present technical materials to the research community, and to get responses from other researchers in the field. This year, accepted posters will be presented in the main hall so that presenters have much opportunity of discussion during breaks. Standing by the poster on each break is not mandatory, though. * Scope Poster and demo contributions are sought in all areas of programming languages and systems, including the following topics: - semantics, logics, foundational theory; - design of languages and foundational calculi; - type systems; - compilers, interpreters, abstract machines; - program derivation and transformation; - program analysis, verification, model-checking, software security; - concurrency, constraints, domain-specific languages; - tools for programming, verification, implementation. * Format of Posters A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. AC Power outlet of 100V will be also provided during the poster & demo session. If you need more space and facilities, contact the poster chair (aplas2012-poster AT fos.kuis.kyoto-u.ac.jp). * Submission Each presenter should e-mail a 1-2 page abstract in PDF to the poster chair (Kohei Suenaga: aplas2012-poster AT fos.kuis.kyoto-u.ac.jp) by October 5th 2012. The abstract should include the title, author(s), affiliation(s) and summary of the work. The program of the poster session will be announced by October 29th, 2012. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. * Important Dates Submission deadline: October 5th, 2012 Notification: October 29th, 2012 * Contact Poster chair: Kohei Suenaga (aplas2012-poster AT fos.kuis.kyoto-u.ac.jp) From pangjun at gmail.com Fri Sep 7 05:16:41 2012 From: pangjun at gmail.com (Jun PANG) Date: Fri, 7 Sep 2012 11:16:41 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at ACM SAC 2013: last CfP Message-ID: ================================================== 28th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 18 - 22, 2013, Coimbra, Portugal (Proceedings published by ACM, Selected papers invited to a special issue of Science of Computer Programming) More information: http://www.win.tue.nl/sacsvt13/ and http://www.acm.org/conferences/sac/sac2013/ =================================================== Important dates --------------- * September 21st 2012: Submission deadline * November 10th 2012: Notification of acceptance/rejection * November 30th 2012: Camera-ready versions due ACM Symposium on Applied Computing ---------------------------------- The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-seven years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2013 is sponsored by SIGAPP and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra, Coimbra, Portugal. Software Verification and Testing Track --------------------------------------- We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - refinement and correct by construction development - model-based testing - verification-based testing - run-time verification - symbolic execution and partial evaluation - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines ---------------------- Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/c/sac2013/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Accepted papers will be published in the ACM SAC 2013 proceedings. For accepted papers, registration for the conference is required and allows accepted papers to be printed in the conference proceedings. The accepted paper MUST be presented by an author or a proxy. This is a requirement for the paper to be part of the ACM/IEEE digital library. A special issue of Science of Computer Programming (SCP) has been confirmed. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of SCP. (New for SAC 2013) Student Research Competition (SRC) Program: Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts will have the opportunity to give poster presentations of their work and compete for three top-winning places. The SRC committee will evaluate and select First-, Second-, and Third- place winners. The winners will receive cash awards and SIGAPP recognition certificates during the conference banquet. Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support. Program committee ----------------- Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Sarfraz Khurshid, University of Texas at Austin, USA Ramtin Khosravi, University of Tehran, Iran Keqin Li, SAP Research, France Yang Liu, National University of Singapore, Singapore Delphine Longuet, Universite Paris-Sud 11, France Yves Le Traon, University of Luxembourg, Luxembourg MohammadReza Mousavi (co-chair), Eindhoven University of Technology, The Netherlands Mercedes Merayo, Universidad Complutense de Madrid, Spain Stephan Merz, INRIA Nancy, France Markus Mueller-Olm, University of Muenster, Germany Jun Pang (co-chair), University of Luxembourg, Luxembourg Dave Parker, University of Birmingham, UK Hongyang Qu, Oxford University, UK Martin Steffen, University of Oslo, Norway Tim Willemse, Eindhoven University of Technology, The Netherlands From sweirich at cis.upenn.edu Fri Sep 7 14:32:44 2012 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Fri, 7 Sep 2012 14:32:44 -0400 Subject: [TYPES/announce] Postdoc position at University of Pennsylvania Message-ID: We are currently seeking applicants for a post-doctoral position at the University of Pennsylvania with skills in programming language theory, proof assistants (Coq in particular), certified compilers such as CompCert, and logics for reasoning about low level programming languages. This position is part of the DARPA funded project: SPARCS: SYNTHESIS OF PLATFORM-AWARE ATTACK-RESILIENT CONTROL SYSTEMS The goals of the SPARCS project include: * Design of control algorithms resilient to sensor and network attack * Synthesis of control software and proofs to guarantee the correctness of the system * Integration with certified operating system services This position will focus on the latter two bullets and will involve using the Coq proof assistant for certified compilation of control software. The goal of SPARCS is to develop tools and techniques to ensure that a vehicle or systems of vehicles maintain a degree of control even when the system is under cyberattack. The particular focus of the Penn team is ground vehicles, including the Black-I Robotics Landshark and the GM Cadillac. This project is part of the HACMS program. More information at http://www.darpa.mil/Our_Work/I2O/Programs/High-Assurance_Cyber_Military_Systems_(HACMS).aspx This project is a joint collaboration between the Penn programming language group (http://www.cis.upenn.edu/~plclub/) and the Penn PRECISE center for research in Embedded Computing and Integrated Systems (http://precise.seas.upenn.edu). For more information contact Stephanie Weirich at sweirich at cis.upenn.edu. From klaus.havelund at jpl.nasa.gov Fri Sep 7 15:06:50 2012 From: klaus.havelund at jpl.nasa.gov (Klaus Havelund) Date: Fri, 7 Sep 2012 12:06:50 -0700 Subject: [TYPES/announce] [fm-announcements] RV 2012 - call for participation Message-ID: <1037DAAB-6DE8-4F33-A439-5A9C5D904D3C@jpl.nasa.gov> 3rd International Conference on Runtime Verification (RV 2012) September 25-28, 2012 Koc University Research Center for Anatolian Civilizations in Pera Istanbul, Turkey http://rv2012.ku.edu.tr RV 2012 is the third conference in a series dedicated to the advancement of monitoring and analysis techniques for software and hardware system executions. Application areas of runtime verification include safety-critical systems ranging from enterprise and systems software, to autonomous and reactive control systems, to health management and diagnosis systems, to security. In addition to paper presentations, the program also comprises two invited tutorials and three invited talks. This year, we have an open tool demonstration session. All conference attendees will have the opportunity to demonstrate tools they are developing. To register, visit the conference website: http://rv2012.ku.edu.tr Program highlights: ------------------------------------------------------------------------------------ Invited tutorials: Dynamic analyses for data-race detection John Erickson, Madan Musuvathi, and Stephen Freund Symbolic execution Cristian Cadar and Koushik Sen Invited talks: It's the end of the world as we know it (and I feel fine) Jim Larus Malware riding badware: challenges in analyzing (malicious/benign) web applications Giovanni Vigna From runtime verification to runtime intervention and adaptation Martin Rinard ------------------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From gopalan at cs.umn.edu Fri Sep 7 16:35:42 2012 From: gopalan at cs.umn.edu (Gopalan Nadathur) Date: Fri, 7 Sep 2012 15:35:42 -0500 Subject: [TYPES/announce] Book Announcement Message-ID: Dale Miller and I are happy to announce the recent publication of our book entitled "Programming with Higher-Order Logic" by Cambridge University Press. The table of contents and other details about the book can be found at https://sites.google.com/site/proghol/. The book argues for using higher-order intuitionistic logic as the foundations of logic programming. In elaborating this argument, the book presents - a sequent calculus based characterization of logic programming; - a proof search approach to computation; - higher-order logic programming; - polymorphic typing; - modular programming and abstract data types; and - simply-typed lambda-terms and their unification. The book also emphasizes the practical application of higher-order logic programming by showing that it can be used to provide elegant formalizations and implementations of computations that manipulate bindings in syntax. In addition to a general exposition of this approach, individual chapters present extended examples relating to - implementing proof systems, - computing with functional programs, and - encoding the pi-calculus. The lambda Prolog language is used to illustrate the underlying computation-related ideas and their applications. The website for the book provides all the lambda Prolog code used in the book. The reader can experiment with this code using the Teyjus system available from http://teyjus.cs.umn.edu/. From Frank.Ortmeier at ovgu.de Mon Sep 10 03:22:24 2012 From: Frank.Ortmeier at ovgu.de (Ortmeier, Frank, Prof.) Date: Mon, 10 Sep 2012 07:22:24 +0000 Subject: [TYPES/announce] FIVE vacancies for Software&Systems Engineering PhD/Post-Doc Message-ID: Vacancy Notice with the reference number 183/2012 The Computer Systems in Engineering group (head: Frank Ortmeier) at Otto-von-Guericke-University Magdeburg is seeking up to ==================================================================== FIVE fulltime researchers on PhD and PostDoc-level focus: Model-based Software Engineering for technical applications ==================================================================== Starting date of the positions is November 1st, 2012 or sooner. All positions are full-time employees with a salary according to the German civil service TV-L E13/E14 scale, which corresponds to approx. 40,000-45,000 EUR income per year (plus holiday allowance and end-of-year bonus). Support for PhD thesis or habilitation will be given. The Computer Systems in Engineering group focuses on making achievements of modern software engineering applicable to engineering applications. The current openings are part of a 1.8 million Euro project, which focuses on making model-based analysis techniques applicable in an industrial context. In particular, tight collaboration with major industrial companies, certification authorities and academic partners is required. Your main tasks will be in the domain of requirements engineering, software design, implementation of prototypical solutions and evaluation on real-world case studies. You will be working at the boarder of modern Software Engineering and "classical/technical" engineering disciplines. So inter-disciplinary skills and interests are very welcome. The project offers very good opportunities for building/extending a personal network with major, international industrial partners as well as the possibility of taking responsibility and becoming a co-founder of a spin-off company. Required profile: You must hold a Master's degree or equivalent in computer science or a closely related discipline. You should have outstanding scores and solid programming experiences. A strong background in formal methods (e.g. model checking, formal semantics, stochastic analysis) is very helpful. In any case, you be keen on translating real world problems into mathematical questions and implement high quality solutions according to modern Soft-ware Engineering standards. As the long-term goal is to bring the methods actual industrial practice, you are especially invited if you are interested in entrepreneurship and bring good social skills. You should have interest in performing original, highly competitive scientific research, publishing the results in top international conferences and scientific journals. Self-motivation and the ability to work both independently and as a team player are expected. Fluency in English is required; proficiency in German is helpful. What we offer The CSE group is very dynamic group, which offers a young, agile and open-minded environment, the possibility to participate in highly competitive research as well as solid software development and requirements engineering challenges. Support for PhD thesis or habilitation will be given. Further information: ==================== Enquiries about the PhD positions may be directed to: frank.ortmeier at ovgu.de How to apply: ============= Applications by women are especially welcome. Applicants with a severe disability will receive preferential treatment if their qualifications and experience are equal to those of the other candidates. Please send your complete application (a cover letter explaining your specific research interests and qualifications; a detailed curriculum vitae, a list of all courses + grades, and a paragraph describing your Diploma/MSc/PhD thesis project) quoting reference number 183/2012 by October 5th, 2012 (date of receipt of application) to the address below: Otto-von-Guericke-Universit?t Magdeburg Dezernat Personalwesen Postfach 4120, 39016 Magdeburg, Germany __________________________________________________________ ___ __ __ Jun.-Prof. Dr. Frank Ortmeier / __\/ _\ /__\ Computer Systems in Engineering / / \ \ /_\ Otto-von-Guericke Universitaet Magdeburg / /___ _\ \//__ Geb?ude 29 - Raum 116 \____/ \__/\__/ Tel.: 0391 / 67-52804 Fax.: 0391 / 67-52020 __________________________________________________________ -------------- next part -------------- An HTML attachment was scrubbed... URL: From hammer at cs.uni-saarland.de Mon Sep 10 05:34:20 2012 From: hammer at cs.uni-saarland.de (Christian Hammer) Date: Mon, 10 Sep 2012 11:34:20 +0200 Subject: [TYPES/announce] Open PhD position in Browser or Mobile Security In-Reply-To: <8FCE800A-1BF2-4C9E-A0B7-6BF2398A53F6@me.com> References: <8FCE800A-1BF2-4C9E-A0B7-6BF2398A53F6@me.com> Message-ID: <79CAF554-7A30-42A6-A5E0-98C5BA76F1F3@cs.uni-saarland.de> Open PhD position in Browser or Mobile Security The Cyber Security Lab in the Computer Science Department of Saarland University is currently offering a PhD position. The CSL group is part of the newly established Center for IT-Security, Privacy and Accountability (CISPA). CISPA actively supports collaborations with other research centers worldwide, and offers young researchers an ideal working environment. The close connection of CISPA to the department of computer science, the Max-Planck-Institute (MPI) for Informatics, the MPI for Software Systems, the German Research Center for Artificial Intelligence (DFKI), the Cluster of Excellence on Multimodal Computing and Interaction (MMCI), the Saarbruecken Graduate School of Computer Science and the Intel Visual Computing Institute (IVCI) is crucial for the success of the location. All of these institutes are in close proximity on the campus. The CSL group conducts research in various aspects of mobile and browser security. Topics of particular interest include, but are not limited to information flow control, inline reference monitoring as well as foundational and applied research. Applicants are required to have completed (or be close to completing) a Bachelor, Master, or Diplom with outstanding grades in Computer Science or closely related areas. Top candidates will exhibit knowledge in all of the following areas, but candidates with expertise in at least two areas are encouraged to apply: (1) security (2) program analysis, (3) semantics, (4) interactive theorem provers, or (5) compiler technology Please note that PhD applications are possible and welcome immediately after obtaining a Bachelor degree, as part of the Saarbruecken Graduate School of Computer Science. The working and teaching language is English. Please send your application to Christian Hammer via e-mail (hammer at cs.uni-saarland.de). Applications should contain a CV, copies of transcripts and certificates, and (if possible) names of references. Applications will be accepted until the position has been filled. -- Christian Hammer Juniorprofessor (Assistant Professor) WWW: http://csl.cs.uni-saarland.de/people/hammer/ -------------- 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 Damien.Pous at ens-lyon.fr Mon Sep 10 11:57:30 2012 From: Damien.Pous at ens-lyon.fr (Damien Pous) Date: Mon, 10 Sep 2012 17:57:30 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?Appel_=E0_communication=2C_JFLA_2?= =?iso-8859-1?q?013?= Message-ID: * Merci de faire circuler : second appel ? communication * * date limite de soumission : 12 octobre 2012 * JFLA'2013 (http://jfla.inria.fr/2013/) Journ?es Francophones des Langages Applicatifs Organis?es par l'INRIA, ? Aussois, du 3 f?vrier au 6 f?vrier 2013 Les JFLA r?unissent concepteurs, utilisateurs et th?oriciens ; elles ont pour ambition de couvrir les domaines des langages applicatifs, de la preuve formelle, et des objets math?matiques qui sous-tendent ces outils. Ces domaines doivent ?tre pris au sens large : nous souhaitons avant tout favoriser les ponts entre les diff?rentes th?matiques : . Langages fonctionnels et applicatifs : s?mantique, compilation, optimisation, typage, mesures, extensions par d'autres paradigmes. . Assistants de preuve : impl?mentation, nouvelles tactiques, d?veloppements pr?sentant un int?r?t technique ou m?thodologique. . Logique, correspondance de Curry-Howard, r?alisabilit?, extraction de programmes, mod?les. . Sp?cification, prototypage, d?veloppements formels d'algorithmes. . Utilisation industrielle des langages fonctionnels et applicatifs, ou des m?thodes issues des preuves formelles, outils pour le web. Les articles soumis aux JFLA sont relus par au moins deux personnes s'ils sont accept?s, trois personnes s'ils sont rejet?s. Les critiques des relecteurs sont toujours bienveillantes et la plupart du temps encourageantes et constructives, m?me en cas de rejet. Il n'y a donc pas de raison de ne pas soumettre aux JFLA ! Nous accepterons cette ann?e deux types de soumissions : . article de recherche de quinze pages au plus, portant sur des travaux originaux. Nous accepterons volontier des travaux en cours (pour lesquels l'aspect recherche n'est pas enti?rement termin?) ; dans tous les cas, la forme de l'article devra ?tre soign?e. Les articles s?lectionn?s seront publi?s dans les actes de la conf?rence, les auteurs seront invit?s ? faire une pr?sentation en vingt-cinq minutes lors des journ?es. . proposition d'expos? court (dix minutes) pour d?crire prototype, faire une d?monstration d'un outil, reparler d'un article d?j? publi?, rechercher de l'aide pour r?soudre un probl?me particulier. Dans ce cas, nous vous demandons seulement de soumettre un r?sum? de deux ? trois pages, qui nous permettra de s?lectionner les orateurs en cas de forte affluence. Comit? de programme ------------------- Damien Pous, Pr?sident (CNRS -- ENS Lyon) Christine Tasson, Vice pr?sidente (PPS -- Universit? Paris Diderot) Jade Alglave (University of Oxford) David Baelde (ITU Copenhague) Pierre-Malo Deni?lou (Royal Holloway, University of London) Pascal Fradet (INRIA Rh?ne-Alpes) Samuel Mimram (CEA Saclay) Yann R?gis-Gianas (Universit? Paris VII) Matthieu Sozeau (INRIA Paris -- Rocquencourt) Nicolas Tabareau (INRIA Nantes) Enrico Tassi (LIX -- ?cole Polytechnique) Lionel Vaux (IML -- Universit? de la M?diterran?e) Soumission ---------- Date limite de soumission : 12 octobre 2012 Les soumissions doivent ?tre d?pos?es sur Easychair, ? l'adresse suivante : https://www.easychair.org/conferences/?conf=jfla2013 Elles peuvent ?tre r?dig?es en anglais, mais elles sont limit?es ? 15 pages A4 et le style LaTeX est impos? : http://jfla.inria.fr/2013/actes.sty Merci de signaler vos intentions de soumissions au plus t?t, par email au pr?sident du comit? de programme. Dates importantes ----------------- 12 octobre 2012 : Date limite de soumission 16 novembre 2012 : Notification aux auteurs 7 d?cembre 2012 : Remise des articles d?finitifs 10 janvier 2013 : Date limite d'inscription aux journ?es 3 f?vrier au 6 f?vrier 2013 : Journ?es Pour tout renseignement d'ordre administratif, contacter -------------------------------------------------------- Dani?le Herzog INRIA Rh?ne-Alpes, Bureau des cours et colloques 655 Avenue de l'Europe, Montbonnot 38 334 St Ismier Cedex - France Tel : +33 (0)4 76 61 52 23 - Fax : +33 (0)4 56 52 71 90 email : colloques at inrialpes.fr http://jfla.inria.fr/2013/ From fmontesi at italianasoftware.com Tue Sep 11 09:59:10 2012 From: fmontesi at italianasoftware.com (Fabrizio Montesi) Date: Tue, 11 Sep 2012 15:59:10 +0200 Subject: [TYPES/announce] ACM SAC 2013 - SOAP Track: Final CfP Message-ID: SOAP track CfP Call for Papers Service-Oriented Architectures and Programming track of the 28th Symposium On Applied Computing http://www.itu.dk/acmsac2013-soap/ ACM SAC 2013 For the past twenty-eight years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is held at the Institute of Engineering of the Polytechnic Institute of Coimbra (ISEC-IPC). SOAP TRACK: CALL FOR PAPERS Service-Oriented Programming (SOP) is quickly changing our vision of the Web, bringing a paradigmatic shift in the methodologies followed by programmers when designing and implementing distributed systems. Originally, the Web was mainly seen as a means of presenting information to a wide spectrum of people, but SOP is triggering a radical transformation of the Web towards a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be discovered by other services and then invoked, abstracting from their actual implementation. Research on SOP is giving strong impetus to the development of new technologies and tools for creating and deploying distributed software. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of SOP needs to be clarified on many aspects, both from the engineering and from the foundational points of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modelling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, OWL, ...) and the syntactic one (WSDL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrate only on a few features of Service-Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service-Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming SOP into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what SOP still needs in order to achieve its original goal. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service-Oriented Computing - Methodologies and tools for Service-Oriented application design - Service-Oriented Middlewares - Service-Oriented Programming languages - Test methodologies for Service-Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service-Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service-Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service-Oriented Computing IMPORTANT DATES (strict) September 21, 2012: Paper submissions November 10, 2012: Author notification November 30, 2012: Camera-Ready Copy March 18-22, 2013: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will double-blindly review submissions. Accepted papers will be published in the annual conference proceedings. SOAP track chairs will not submit to the track. Submissions from SOAP PC members and from PC members and track chairs of other SAC tracks are welcome. Submission guidelines can be found on SAC 2013 Website: http://www.acm.org/conferences/sac/sac2013/ Prospective papers should be submitted to the track using the provided automated submission system. Please pay attention to ensure anonimity of your submitted manuscript as detailed in the submission page so to allow for double-blind review. Papers not satisfying this constraint will be automatically rejected. The maximum length for papers is 8 pages. Accepted papers whose camera-ready version will exceed 6 pages will have to pay an extra charge. For each accepted paper, an author or a proxy attending SAC MUST present the paper. This is a requirement for the paper to be included in the ACM/IEEE digital library. SPECIAL ISSUE Authors of best papers will be invited to submit an extended and revised version of their work to a special issue of Science of Computer Programming. STUDENT RESEARCH COMPETITION PROGRAM Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts will have the opportunity to give poster presentations of their work and compete for three top-winning places. The Student Research Competition committee will evaluate and select First-, Second-, and Third- place winners. The winners will receive cash awards and SIGAPP recognition certificates during the conference banquet. Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Luis Barbosa, Universidade do Minho - Braga (Portugal) Jesper Bengtson, IT University of Copenhagen (Denmark) Laura Bocchi, University of Leicester (UK) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Ettore Ferranti, ABB Switzerland Ltd Corporate Research (Switzerland) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. - Bologna (Italy) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Antonio Ravara, New University of Lisbon (Portugal) Gwen Sala?n, INRIA Grenoble (France) Martin Sch?f, UNU-IIST (Macao) Francesco Tiezzi, IMT Lucca (Italy) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) Huibiao Zhu, East China Normal University - Shanghai (China) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk UNU-IIST, Macao / School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From nikost at eecs.qmul.ac.uk Wed Sep 12 14:41:27 2012 From: nikost at eecs.qmul.ac.uk (Nikos Tzevelekos) Date: Wed, 12 Sep 2012 19:41:27 +0100 Subject: [TYPES/announce] 17th Wessex theory seminar - Call for Participation Message-ID: <5050D757.4080109@eecs.qmul.ac.uk> [Apologies for multiple postings.] The 17th Wessex theory seminar will take place on Thursday 20 September at Queen Mary, University of London. As usual there is some funding available from the London Mathematical Society to support attendance. There is no registration fee, but it would be useful if you contacted us if planning to attend. Confirmed speakers are: - Nobuko Yoshida (Imperial), Multiparty Session Automata and their application in large distributed systems. - Stefan Kiefer (Oxford), On the equivalence problem for probabilistic automata. - Tony Tan (Edinburgh/Warsaw), An Automata Model for Trees with Ordered Data Values. - Radu Grigore (Queen Mary), Register Automata and Java. - Jules Villard (UCL), The Ramifications of Sharing in Data Structures. Further information on location, schedule, speakers, etc. can be found at the website: http://wiki.bath.ac.uk/display/wessex/17th+Wessex+Theory+Seminar Best wishes, Nikos Tzevelekos Edmund Robinson From davide at disi.unige.it Fri Sep 14 16:23:41 2012 From: davide at disi.unige.it (Davide Ancona) Date: Fri, 14 Sep 2012 22:23:41 +0200 Subject: [TYPES/announce] OOPS track at SAC 2013: deadline extension Message-ID: <5053924D.9020401@disi.unige.it> *** Extended paper submission deadline: September 28, 2012 *** OOPS 2013 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS13 Special Track at the 28th ACM Symposium on Applied Computing, SAC 2013 http://www.acm.org/conferences/sac/sac2013 Institute of Engineering of the Polytechnic Institute of Coimbra, Portugal March 18-22, 2013 - Important Dates (deadlines are strict) Regular papers: September 28, 2012 *** deadline extension *** Paper submission November 10, 2012 Author notification November 30, 2012 Camera-ready copies March 18-22, 2013 SAC 2013 Student Research Abstracts: October 31, 2012 Research Abstracts November 30, 2012 Author Notification March 19, 2013 Presentations - Track Chair Davide Ancona (davide at disi.unige.it) DIBRIS, University of Genova, Italy - Program Committee Alexandre Bergel, University of Chile, Chile Bruno Cabral, Universidade de Coimbra, Portugal Walter Cazzola, Universit? di Milano, Italy Wei-Ngan Chin, National University of Singapore, Singapore Ferruccio Damiani, Universit? di Torino, Italy Frank de Boer, CWI Amsterdam, The Netherlands Roland Ducournau, LIRMM, Montpellier - France Erik Ernst, Aarhus University, Denmark Yossi Gil, Technion - Israel Institute of Technology, Israel Robert Hirschfeld, Hasso-Plattner-Institut, University of Potsdam, Germany Jaakko J?rvi, Texas A&M University, USA Doug Lea, Suny Oswego, USA Rosemary Monahan, National University of Ireland Maynooth, Ireland David Pearce, Victoria University of Wellington, New Zealand Arnd Poetzsch-Heffter, TU Kaiserslautern, Germany Antonio Ravara, Universidade Nova de Lisboa, Portugal Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea Joao Seco, Universidade Nova de Lisboa, Portugal - SAC 2013 For the past twenty-seven years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Polytechnic Institute of Coimbra, Coimbra, Portugal, Institute of Systems and Robotics, University of Coimbra, Coimbra, Portugal Mathematical and Computer Sciences Institute, University of Sao Paulo, Sao Paulo, Brazil, and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra. - Call For Student Research Abstracts (New to SAC): Graduate students seeking feedback from the scientific community on their research ideas are invited to submit abstracts of their original un-published and in-progress research work in areas of experimental computing and application development related to SAC 2013 Tracks. - OOPS Track Object-oriented programming (OOP) has become the mainstream programming paradigm for developing complex software systems in most application domains. However, existing OO languages and platforms need to evolve to meet the continuous demand for new abstractions, features, and tools able to reduce the time, effort, and cost of creating object-oriented software systems, and improving their performance, quality and usability. To this aim, OOPS is seeking for research advances bringing benefits in all those typical aspects of software development, such as modeling, prototyping, design, implementation, concurrency and distribution, code generation, analysis, verification, testing, evaluation, deployment, maintenance, reuse, and software evolution and adaptation. The specific OO related topics of interest for the OOPS track include, but are not limited to, the following: * Aspects and components * Code generation, and optimization, just-in-time compilation * Distribution and concurrency * Dynamic and scripting languages * Evaluation * Formal verification * Integration with databases, object persistence * Integration with other paradigms * Interoperability, versioning and software evolution and adaptation * Language design and implementation * Modular and generic programming * Reflection, meta-programming * Software product lines * Static analysis * Type systems and type inference * Virtual machines OOPS offers a great opportunity to the OOP community to gain visibility, and to exploit the inter-disciplinary nature of SAC. - Submission Instructions Prospective papers should be submitted in pdf format using the provided automated submission system. All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The format of the paper must adhere to the sig-alternate style. The paper must not exceed 8 pages according to the above style; please note that this is the same page limit as for the final version. However, for camera-ready papers exceeding 6 pages each additional page will be charged 80 USD. Papers that fail to comply with length limitations risk rejection. All papers must be submitted by September 21, 2012. For more information please visit the SAC 2013 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as 2-3 pages extended abstracts in the same proceedings (the additional third page will be charged 80 USD). Please note that full registration is required for papers and posters to be included in the conference proceedings and CD. Papers and posters NOT presented at conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, depending on the quality and the overall number of accepted papers, authors of selected papers will be invited to submit an extended version for a journal special issue, after the conference. From Gabriele.Lenzini at uni.lu Fri Sep 14 17:20:45 2012 From: Gabriele.Lenzini at uni.lu (Gabriele LENZINI) Date: Fri, 14 Sep 2012 21:20:45 +0000 Subject: [TYPES/announce] 2 PhD Positions in Computer Security - Univ. Luxembourg. Message-ID: ****2 Ph.D. Positions in Computer Security**** --------------------------------------------------------------- The University of Luxembourg has two open Ph.D. positions at its Interdisciplinary Centre for Security, Reliability and Trust (SnT) (http://wwwen.uni.lu/snt). We are seeking Ph.D. candidates to participate in the activities of the SaToSS (http://satoss.uni.lu/) and of the ApSIA (http://apsia.gforge.uni.lu/) research groups. Project description: -------------------------- The main objective of the Ph.D. project is to develop a formal framework supporting modeling and analysis of socio-technical components of information systems. We aim to develop strategies and tools to detect and prevent attacks involving human, physical and digital elements. One of the goals is to extend current methodology for security protocol analysis, by taking human behavior and properties of physical objects into account. This goal includes a necessity of defining appropriate adversary models and identifying the security properties relevant in a socio-technical context. Research environment: ------------------------------ Both Ph.D. students will collaborate with the research groups SaToSS (Security and Trust of Software Systems) led by Prof. Dr. S. Mauw and APSIA (Applied Security and Information Assurance) led by Prof. Dr. P.Y.A. Ryan. This position is part of a national research project "Socio-Technical Analysis of Security and Trust" funded by the National Research Fund in Luxembourg. The University of Luxembourg offers a three years appointment (extension up to 4 years in total is possible) in an international and multicultural environment. The University is an equal opportunity employer. Applicant's profile: ------------------------ * MSc in Computer Science or Mathematics * A proven interest in security * Strong background in formal methods or logics * Good written and oral English skills Start date: -------------- As soon as possible Applications: ----------------- Applications, written in English, should be submitted electronically via the University of Luxembourg's recruitment portal http://emea3.mrted.ly/2oja Applications should include: * Curriculum Vitae (including your contact address, work experience and list of publications) * Cover letter explaining your motivation * Transcript of all courses and grades for your Bachelor and Master program * A short description of your Master's work (max 1 page) * Contact information for at least one referee Deadline for applications: ---------------------------------- October 15th, 2012 For further inquiries please contact: ----------------------------------------------- Prof. Dr. Sjouke Mauw (sjouke.mauw at uni.lu), Prof. Dr. Peter Ryan (peter.ryan at uni.lu), Dr. Barbara Kordy (barbara.kordy at uni.lu), or Dr. Gabriele Lenzini (gabriele.lenzini at uni.lu) -------------------------------------------------------------------- Dr. G. Lenzini Interdisciplinary Centre for Security, Reliability and Trust (SnT) --------------------------------------------------------------------- University of Luxembourg 4 rue Alphonse Weicker L-2721 Luxembourg-Kirchberg --------------------------------------------------------------------- T.: +352 466 644 5778?? -?F.: +352 466644 5669 Gabriele.Lenzini at Uni.Lu -------------------------------------------------------------------- From wasowski at itu.dk Sat Sep 15 15:09:49 2012 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Sat, 15 Sep 2012 21:09:49 +0200 Subject: [TYPES/announce] Several PhD positions in Model Driven Development of Safety Critical Systems, Verification and Software Product Lines Message-ID: <5054D27D.8040503@itu.dk> [Classical background in semantics and types, with applications to program verification is within the scope of interest of this list. Thus some readers may find the announcement relevant] **Several PhD positions in Model Driven Development of Safety Critical Systems, Verification and Software Product Lines ** IT University of Copenhagen VARIES, MT-LAB and related projects seek several excellent PhD students to work on modeling and analysis of variability in safety-critical Embedded Systems. Opportunities range from applied engineering projects to theoretical verification projects. Applied projects allow you to be involved in international standardization of variability modelling languages (the upcoming OMG CVL language) and work on analysis of variability models created in these languages. The objective is to support consistent, integrated and continuous variability management over the entire product life cycle. More theoretically inclined project require development of software model checking technology, and program analysis technologies to analyse software involving variability, code generation and model transformation. Ideal applicants have background in several of the following areas: reasoning with propositional or first order logics, model checking, static analysis, model based testing, domain specific languages, semantics. You also share our commitment to solving hard problems that real engineering projects face. VARIES is a consortium of about 20 European partners, a mixture of high profile academic partners, research labs and companies developing safety-critical embedded or modeling tools. VARIES is funded by European Commission and national governments via the ARTEMIS Joint Undertaking (http://www.varies.eu). MTLAB is a basic research centre devoted to modelling of IT systems, a joint initiative of IT University, Technical University of Denmark, and Aalborg University (http://www.mt-lab.dk). Deadline for application is October 31 at noon, Copenhagen time. Positions are based in Copenhagen Denmark within the modern and lively research environment of IT University of Copenhagen (http://www.itu.dk). Prospective starting date is as soon as possible until Spring/Summer 2013. Duration of the scholarship is 3 or 4 years. The scholarship includes full time salary, and budget for carrying the research project. Please see the conditions of the call at https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=120483&DepartmentId=5236&MediaId=1282 All applicants are highly encouraged to contact the potential superviso Andrzej Wasowski (http://www.itu.dk/people/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 dimitris at microsoft.com Sun Sep 16 15:47:38 2012 From: dimitris at microsoft.com (Dimitrios Vytiniotis) Date: Sun, 16 Sep 2012 19:47:38 +0000 Subject: [TYPES/announce] PADL 2013: Last CFP and deadline extension Message-ID: ================================= PADL 2013: Last CFP and deadline extension Due to major events of the community in the last two weeks, the submission deadlines for papers to PADL'2013 have been slightly extended. New submission deadlines: Abstract submission: September 19, 2012 Full paper submission: September 24, 2012 (strict) More information can be found at: http://www.it.uu.se/conf/padl2013/ From scm-ml at iis.sinica.edu.tw Sun Sep 16 21:42:48 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml) Date: Mon, 17 Sep 2012 09:42:48 +0800 Subject: [TYPES/announce] PEPM 2013: Final Call for Papers Message-ID: F I N A L C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ==================================================================== NEWS - Invited talks: Zhenjiang Hu: Practical Aspets of Bidirectional Graph Transformations Peter Thiemann: Partially Static Operations REMINDER - Important Dates: Abstract submission: September 28, 2012 Paper submission: October 2, 2012 Notification: November 6, 2012 - Selected papers will be invited to a Special issue of Science of Computer Programming (SCP) (5-Year Impact Factor of SCP: 1.304) ==================================================================== SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of 'short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. IMPORTANT DATES Abstract submission: September 28, 2012 Paper submission: October 2, 2012 Notification: November 6, 2012 Camera ready: November 14, 2012 SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. INVITED SPEAKERS We are proud to present the following two invited talks: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspets of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations See the workshop web site homepage for abstracts. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France) From andrzej.murawski at leicester.ac.uk Mon Sep 17 04:51:29 2012 From: andrzej.murawski at leicester.ac.uk (Andrzej Murawski) Date: Mon, 17 Sep 2012 09:51:29 +0100 Subject: [TYPES/announce] LICS 2013 - Call for Papers Message-ID: CALL FOR PAPERS Twenty-Eighth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2013) June 25-28, 2013, New Orleans, USA http://www2.informatik.hu-berlin.de/lics/lics13/ LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA, from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13 (23-25 June) and CSF13 (28-30 June). 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, theory of automatic structures, 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: 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. Titles & Short Abstracts Due : January 7, 2013 Extended Abstracts Due : January 14, 2013 Author Notification (approximate) : March 22, 2013 Final Versions Due for Proceedings: April 26, 2013 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://easychair.org/conferences/?conf=lics2013. 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 will be 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. Papers selection will be merit-based, with no a priori limit on the number of accepted papers. 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 will be posted on the LICS website. 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. 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. Program Chair: Orna Kupferman, Hebrew University Program Committee: Parosh A. Abdulla, Uppsala University Amal Ahmed, Northeastern Universtiy Sergei Artemov, City University of New York Andrei Bulatov, Simon Fraser University Yijia Chen, Shanghai Jiao Tong University Veronique Cortier, CNRS, Loria Mariangiola Dezani-Ciancaglini, Univ. di Torino Thomas Ehrhard, CNRS, Universite Paris Diderot Javier Esparza, Technische Universitaet Muenchen Kousha Etessami, University of Edinburgh Maribel Fernandez, King?s College London Santiago Figueira, University of Buenos Aires Simon Gay, University of Glasgow Martin Grohe, Humboldt-Universitaet zu Berlin Martin Hofmann, LMU Munich Petr Jancar, Technical University Ostrava Barbara Jobstmann, CNRS, Verimag and Jasper DA Patricia Johann, University of Strathclyde Bakhadyr Khoussainov, The University of Auckland Antonina Kolokolova, University of Newfoundland Victor Marek, University of Kentucky Angelo Morzenti, Politecnico di Milano Lawrence Moss, Indiana University Madhavan Mukund, Chennai Math. Institute Anca Muscholl, Universite Bordeaux Mogens Nielsen, Aarhus University Catuscia Palamidessi, INRIA, Ecole Polytechnique Luc Segoufin, INRIA, ENS Cachan Natarajan Shankar, SRI International Alexandra Silva, Radboud University Nijmegen Balder ten Cate, UC Santa Cruz Kazushige Terui, Kyoto University Ron van der Meyden, Univ. of New South Wales Jeannette M. Wing, Carnegie Mellon University Nobuko Yoshida, Imperial College London Conference Chair: Mike Mislove, Tulane University Workshop Chair: Patricia Bouyer-Decitre, CNRS, ENS Cachan Publicity Chair: Andrzej Murawski, Univ. of Leicester General Chair: Luke Ong, University of Oxford Organizing Committee: Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame, Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman, Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys, Matt Valeriote Advisory Board: Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller, John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin, Moshe Vardi, Glynn Winskel From pangjun at gmail.com Wed Sep 19 04:48:29 2012 From: pangjun at gmail.com (Jun PANG) Date: Wed, 19 Sep 2012 10:48:29 +0200 Subject: [TYPES/announce] Extended deadline -- Software Verification and Testing Track at ACM SAC 2013 Message-ID: ================================================== 28th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 18 - 22, 2013, Coimbra, Portugal ** Extended paper submission deadline: September 28, 2012 ** (Proceedings published by ACM, Selected papers invited to a special issue of Science of Computer Programming) More information: http://www.win.tue.nl/sacsvt13/ and http://www.acm.org/conferences/sac/sac2013/ =================================================== Important dates --------------- * September 28th 2012: Extended submission deadline * November 10th 2012: Notification of acceptance/rejection * November 30th 2012: Camera-ready versions due ACM Symposium on Applied Computing ---------------------------------- The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-seven years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2013 is sponsored by SIGAPP and will be held at the Institute of Engineering of the Polytechnic Institute of Coimbra, Coimbra, Portugal. Software Verification and Testing Track --------------------------------------- We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - refinement and correct by construction development - model-based testing - verification-based testing - run-time verification - symbolic execution and partial evaluation - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines ---------------------- Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/c/sac2013/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Accepted papers will be published in the ACM SAC 2013 proceedings. For accepted papers, registration for the conference is required and allows accepted papers to be printed in the conference proceedings. The accepted paper MUST be presented by an author or a proxy. This is a requirement for the paper to be part of the ACM/IEEE digital library. A special issue of Science of Computer Programming (SCP) has been confirmed. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of SCP. (NEW for SAC 2013) Student Research Competition (SRC) Program: Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts will have the opportunity to give poster presentations of their work and compete for three top-winning places. The SRC committee will evaluate and select First-, Second-, and Third- place winners. The winners will receive cash awards and SIGAPP recognition certificates during the conference banquet. Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support. Program committee ----------------- Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Sarfraz Khurshid, University of Texas at Austin, USA Ramtin Khosravi, University of Tehran, Iran Keqin Li, SAP Research, France Yang Liu, National University of Singapore, Singapore Delphine Longuet, Universite Paris-Sud 11, France Yves Le Traon, University of Luxembourg, Luxembourg MohammadReza Mousavi (co-chair), Eindhoven University of Technology, The Netherlands Mercedes Merayo, Universidad Complutense de Madrid, Spain Stephan Merz, INRIA Nancy, France Markus Mueller-Olm, University of Muenster, Germany Jun Pang (co-chair), University of Luxembourg, Luxembourg Dave Parker, University of Birmingham, UK Hongyang Qu, Oxford University, UK Martin Steffen, University of Oslo, Norway Tim Willemse, Eindhoven University of Technology, The Netherlands From carbonem at itu.dk Wed Sep 19 05:00:43 2012 From: carbonem at itu.dk (Marco Carbone) Date: Wed, 19 Sep 2012 11:00:43 +0200 Subject: [TYPES/announce] Associate/Assistant Professorship(s) of Computer Science at the IT University of Copenhagen Message-ID: Associate or Assistant Professorships in Computer Science at the IT University of Copenhagen, Denmark. We are inviting applications for Associate / Assistant Professorships in Computer Science at the IT University of Copenhagen, in particular in the areas of information security, cryptography, programming languages, and concurrency. Application deadline is September 24, 2012 at 23:59 CEST. Please see https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=119314&DepartmentId=3439&MediaId=1282 for the official annoucement. Best Regards, Marco Carbone carbonem at itu.dk -------------- next part -------------- An HTML attachment was scrubbed... URL: From hans at cs.aau.dk Thu Sep 20 09:16:09 2012 From: hans at cs.aau.dk (=?utf-8?B?SGFucyBIw7x0dGVs?=) Date: Thu, 20 Sep 2012 13:16:09 +0000 Subject: [TYPES/announce] Second Call for Papers: BEAT'13 - 1st International Workshop on Behavioural Types Message-ID: <6CC0CB11-970C-4479-A20F-0F2454B56CD8@cs.aau.dk> 1stInternational Workshop on Behavioural Types http://beat13.cs.aau.dk January 22, 2013, Rome, Italy Collocated with POPL 2013, 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Second Call for papers Scope Behavioural type systems in general, and in particular those based on typestate, are attracting a lot of attention as these are able to ensure more than the usual safety guarantees of static program analyses. In the last ten years the idea of "types-as-processes" has been explored in several directions, providing dedicated type algebras for particular properties, ranging from protocol compatibility to race-freedom or activeness, as well as general type systems for a wide range of properties. The approaches include those of session types, generic type systems and behavioural ontracts as well as other type-theoretic notions, e.g. intersection types, that can be used to specify the behaviour of systems. These approaches have given rise to several important results. This workshop aims to present contributions on the theory and applications of behavioural types and to foster discussion on the pros and cons of different approaches and on new directions and challenges in the area. Topics include, but are not limited to ? The theoretical foundations of behavioural types ? Relationships between different approaches ? Applications to language design and implementation ? Applications to security ? Applications to composition ? Applications to code generation ? New applications of behavioural types Organizing committee Mario Bravetti Mariangiola Dezani-Ciancaglini Hans H?ttel Ant?nio Ravara Program committee Mario Bravetti Mariangiola Dezani-Ciancaglini Sophia Drossopoulou Simon Gay Hans H?ttel Naoki Kobayashi Ant?nio Rav?ra Jakob Rehof --- Submissions All accepted papers will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal, workshop or conference with refereed proceedings. Submissions can be up to 12 pages long and must use the ACM SIGPLAN format. The SIGPLAN template can be found at http://www.sigplan.org/authorInformation.htm All submissions must be contributed as PDF files via the EasyChair page. http://www.easychair.org/conferences/?conf=beat13 Important dates Submission deadline: 8 October 2012 Notification: 8 November 2012 Camera-ready cope due: 12 November 2012 From Pieter.Philippaerts at cs.kuleuven.be Thu Sep 20 14:47:12 2012 From: Pieter.Philippaerts at cs.kuleuven.be (Pieter Philippaerts) Date: Thu, 20 Sep 2012 20:47:12 +0200 Subject: [TYPES/announce] Last Mile: ESSoS 2013 || February 27 - March 1 - Paris, France Message-ID: <001601cd9760$5901b0b0$0b051210$@cs.kuleuven.be> INVITATION: ================= Note that we are entering the last days before the submission deadline of September 30, 2012. Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ESSoS 2013. ================= ============== ESSoS 2013 | Call for Papers =============== Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos/2013/ February 27 - March 1, 2013, Paris, France In cooperation with (pending): ACM SIGSAC and SIGSOFT and IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Hostile, networked environments, like the Internet, can allow vulnerabilities in software to be exploited from anywhere. To address this, high-quality security building blocks (e.g., cryptographic components) are necessary, but insufficient. Indeed, the construction of secure software is challenging because of the complexity of modern applications, the growing sophistication of security requirements, the multitude of available software technologies and the progress of attack vectors. Clearly, a strong need exists for engineering techniques that scale well and that demonstrably improve the software's security properties. GOAL AND SETUP The goal of this symposium, which will be the fifth in the series, is to bring together researchers and practitioners to advance the states of the art and practice in secure software engineering. Being one of the few conference-level events dedicated to this topic, it explicitly aims to bridge the software engineering and security engineering communities, and promote cross-fertilization. The symposium will feature two days of technical program, and is also open to proposals for both tutorials and workshops. In addition to academic papers, the symposium encourages submission of high-quality, informative experience papers about successes and failures in security software engineering and the lessons learned. Furthermore, the symposium also accepts short idea papers that crisply describe a promising direction, approach, or insight. TOPICS The Symposium seeks submissions on subjects related to its goals. This includes a diversity of topics including (but not limited to): - scalable techniques for threat modeling and analysis of vulnerabilities - specification and management of security requirements and policies - security architecture and design for software and systems - model checking for security - specification formalisms for security artifacts - verification techniques for security properties - systematic support for security best practices - security testing - security assurance cases - programming paradigms, models and DLS's for security - program rewriting techniques - processes for the development of secure software and systems - security-oriented software reconfiguration and evolution - security measurement - automated development - trade-off between security and other non-functional requirements (in particular economic considerations) - support for assurance, certification and accreditation - empirical secure software engineering SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag (pending) in the Lecture Notes in Computer Science Series (http://www.springer.com/lncs). Submissions should follow the formatting instructions of Springer LNCS. Submitted papers must present original, non-published work of high quality. For selected papers, there will be an invitation to submit extended versions to a special issue in the International Journal of Information Security. Two types of papers will be accepted: Full papers (max 14 pages without bibliography/appendices) - May describe original technical research with a solid foundation, such as formal analysis or experimental results, with acceptance determined mostly based on novelty and validation. Or, may describe case studies applying existing techniques or analysis methods in industrial settings, with acceptance determined mostly by the general applicability of techniques and the completeness of the technical presentation details. Idea papers (max 8 pages with bibliography) - May crisply describe a novel idea that is both feasible and interesting, where the idea may range from a variant of an existing technique all the way to a vision for the future of security technology. Idea papers allow authors to introduce ideas to the field and get feedback, while allowing for later publication of complete, fully-developed results. Submissions will be judged primarily on novelty, excitement, and exposition, but feasibility is required, and acceptance will be unlikely without some basic, principled validation (e.g., extrapolation from limited experiments or simple formal analysis). In the proceedings, idea papers will clearly identified by means of the "Idea" tag in the title. Proposals for both tutorials and workshops are welcome. Further guidelines will appear on the website of the symposium. IMPORTANT DATES Paper submission: September 30, 2012 Author notification: November 22, 2012 Camera-ready: December 13, 2012 PROGRAM COMMITTEE PC Co-Chairs Jan J?rjens, TU Dortmund and Fraunhofer ISST Ben Livshits, Microsoft Research PC Davide Balzarotti, EURECOM, France Ruth Breu, University of Innsbruck, Austria Cristian Cadar, Imperial College, UK Julian Dolby, IBM Research, US Matt Fredrikson, University of Wisconsin, US Dieter Gollmann, TU Hamburg-Harburg, Germany Maritta Heisel, U. Duisburg Essen, Germany Peter Herrmann, NTNU, Trondheim, Norway Thorsten Holz, U. Ruhr Bochum, Germany Sergio Maffeis, Imperial College, UK Heiko Mantel, TU Darmstadt, Germany Anders M?ller, Aarhus University, Denmark Haris Mouratidis, University of East London, UK Zachary Peterson, Naval Postgraduate School, US Frank Piessens, KU Leuven, Belgium Erik Poll, RU Nijmegen, NL Alexander Pretschner, TU Munich, Germany Wolfgang Reif, University of Augsburg, Germany Jianying Zhou, Institute for Infocomm Research, Singapore Mohammad Zulkernine, Queens University, Canada Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From lanese at cs.unibo.it Fri Sep 21 04:41:00 2012 From: lanese at cs.unibo.it (Ivan Lanese) Date: Fri, 21 Sep 2012 10:41:00 +0200 (CEST) Subject: [TYPES/announce] SOAP track new deadline: September 28 Message-ID: Service-Oriented Architectures and Programming track of the 28th Symposium On Applied Computing http://www.itu.dk/acmsac2013-soap/ New deadline: September 28, 2012 ACM SAC 2013 For the past twenty-eight years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2013 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is held at the Institute of Engineering of the Polytechnic Institute of Coimbra (ISEC-IPC). SOAP TRACK: CALL FOR PAPERS Service-Oriented Programming (SOP) is quickly changing our vision of the Web, bringing a paradigmatic shift in the methodologies followed by programmers when designing and implementing distributed systems. Originally, the Web was mainly seen as a means of presenting information to a wide spectrum of people, but SOP is triggering a radical transformation of the Web towards a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be discovered by other services and then invoked, abstracting from their actual implementation. Research on SOP is giving strong impetus to the development of new technologies and tools for creating and deploying distributed software. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of SOP needs to be clarified on many aspects, both from the engineering and from the foundational points of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modelling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, OWL, ...) and the syntactic one (WSDL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrate only on a few features of Service-Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service-Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming SOP into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what SOP still needs in order to achieve its original goal. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service-Oriented Computing - Methodologies and tools for Service-Oriented application design - Service-Oriented Middlewares - Service-Oriented Programming languages - Test methodologies for Service-Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service-Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service-Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service-Oriented Computing IMPORTANT DATES (strict) September 28, 2012: Paper submissions November 10, 2012: Author notification November 30, 2012: Camera-Ready Copy March 18-22, 2013: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will double-blindly review submissions. Accepted papers will be published in the annual conference proceedings. SOAP track chairs will not submit to the track. Submissions from SOAP PC members and from PC members and track chairs of other SAC tracks are welcome. Submission guidelines can be found on SAC 2013 Website: http://www.acm.org/conferences/sac/sac2013/ Prospective papers should be submitted to the track using the provided automated submission system. Please pay attention to ensure anonimity of your submitted manuscript as detailed in the submission page so to allow for double-blind review. Papers not satisfying this constraint will be automatically rejected. The maximum length for papers is 8 pages. Accepted papers whose camera-ready version will exceed 6 pages will have to pay an extra charge. For each accepted paper, an author or a proxy attending SAC MUST present the paper. This is a requirement for the paper to be included in the ACM/IEEE digital library. SPECIAL ISSUE Authors of best papers will be invited to submit an extended and revised version of their work to a special issue of Science of Computer Programming. STUDENT RESEARCH COMPETITION PROGRAM Graduate students are invited to submit research abstracts (minimum of 2-page and maximum of 4-page) following the instructions published at SAC 2013 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts will have the opportunity to give poster presentations of their work and compete for three top-winning places. The Student Research Competition committee will evaluate and select First-, Second-, and Third- place winners. The winners will receive cash awards and SIGAPP recognition certificates during the conference banquet. Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Luis Barbosa, Universidade do Minho - Braga (Portugal) Jesper Bengtson, IT University of Copenhagen (Denmark) Laura Bocchi, University of Leicester (UK) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Ettore Ferranti, ABB Switzerland Ltd Corporate Research (Switzerland) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. - Bologna (Italy) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Antonio Ravara, New University of Lisbon (Portugal) Gwen Sala?n, INRIA Grenoble (France) Martin Sch?f, UNU-IIST (Macao) Francesco Tiezzi, IMT Lucca (Italy) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) Huibiao Zhu, East China Normal University - Shanghai (China) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk UNU-IIST, Macao / School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy From bpientka at cs.mcgill.ca Sat Sep 22 09:46:43 2012 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Sat, 22 Sep 2012 09:46:43 -0400 Subject: [TYPES/announce] Beluga release: programming with proofs Message-ID: Dear all, we'd like to announce the second release of Belgua. Beluga is a dependently-typed programming and proof development environment which uses a two-level approach: it supports specifying formal systems within the logical framework LF and on top of LF, it provides a dependently-typed functional language that supports manipulating and analyzing contextual LF objects (i.e. LF objects in context) via pattern matching. Most recently, we added indexed recursive types drawn from contextual LF. The implementation is based on previous theoretical ideas presented in [Pientka:POPL08], [PientkaDunfield:PPDP08], and [CavePientka:POPL12]. Recent additions to Beluga are - Indexed recursive types as described in [CavePientka:POPL12] - Revised uniform source syntax for declaring LF types. indexed recursive types, and contextual objects - Pattern matching on contexts and contextual objects - Basic support to program with holes in programs - Type definitions - Coverage checking for contextual LF objects - A logic programming interpreter for LF - More robust error handling - Interactive interpreter for Beluga Our examples include - PROOFS: such as Church-Rosser, Cut-elimination, mechanized development of Ch 3, Ch 6, and Ch 14 from "Types and Programming Languages" by B. Pierce. - PROGRAMS: Normalization by evaluation, Translating between HOAS and deBruijn representation, Closure conversion, Certifying type checker To get a feel for Belgua, you can download our recent prototype together with many examples from http://complogic.cs.mcgill.ca/beluga/ Comments, questions, and bugs should be directed to beluga-developers mailing list. You can subscribe to it at: http://mailman.cs.mcgill.ca/mailman/listinfo/beluga-dev Best, Beluga-Developers Brigitte Pientka, Mathieu Boespflug, Costin Badescu, Olivier Savary Belanger, Stefan Monnier From maffei at cs.uni-saarland.de Mon Sep 24 04:35:53 2012 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Mon, 24 Sep 2012 10:35:53 +0200 Subject: [TYPES/announce] CSF 2013 Call for Workshops Message-ID: ***************************************************** CSF 2013 Call for Workshops 26th IEEE Computer Security Foundations Symposium http://csf2013.seas.harvard.edu/ June 26 - 28, 2013 Tulane University, New Orleans, Louisiana, USA ***************************************************** The Computer Security Foundations Symposium is an annual conference for researchers in computer security, to examine current formal models of security, and techniques for verifying security. In 2013, CSF will be collocated with LICS and MFPS, in New Orleans, Louisiana, USA, June 26-28. Possible dates for CSF workshops are Saturday June 29 and Sunday June 30. ***************************************************** WORKSHOP PROPOSALS The Computer Security Foundations Symposium welcomes co-located workshops on subject related to CSF and of interest for the CSF audience. Organizational support is provided in terms of room booking, meals, audio-visual equipment, etc. CSF does not provide support for proceedings publication. Workshops may be affiliated to several of the co-located conferences (LICS, MFPS, and CSF). In that case, workshop proposals should be submitted to the workshop call of each conference, indicating that multiple affiliation is desired. Workshop proposals are due November 26th, 2012. Proposals (about 2-3 pages) should be submitted by email to the program chairs. See the CSF 2013 website for contact information. Proposals should include the following information. - The workshop name and acronym. - The names and contact information of the organizers. - A short scientific summary and justification of the proposed topic, including a discussion of the particular benefits to the CSF community. - A brief description of the workshop for later use in publicity material. - The expected number of attendees, and the history of the workshop, where applicable. - Summary of procedures for selecting participants and papers. - Your preferred dates. - Indication of whether multiple affiliation is desired (i.e., also affiliated with LICS or MFPS). - Plans for dissemination (e.g., informal proceedings distributed at the workshop, formal proceedings, special issue of journal). ***************************************************** IMPORTANT DATES Workshop proposal due: November 26th, 2012 Notification: by December 20th, 2012 CSF 2013: June 26 - 28, 2013 CSF Co-located workshops: June 29 - 30, 2013 ***************************************************** CSF 2013 PC Chairs Veronique Cortier, CNRS Nancy, France Anupam Datta, Carnegie Mellon University, USA CSF 2013 General Chair Stephen Chong, Harvard University, USA -------------- next part -------------- An HTML attachment was scrubbed... URL: From sophia_katrenko at gmx.de Mon Sep 24 06:06:56 2012 From: sophia_katrenko at gmx.de (Sophia Katrenko) Date: Mon, 24 Sep 2012 12:06:56 +0200 Subject: [TYPES/announce] Call for Bids: ESSLLI 2014 In-Reply-To: References: Message-ID: <20120924100656.115080@gmx.net> Call for Bids to Host the 26-th ESSLLI, 2014 --Please distribute/apologies for multiple postings.-- The Association for Logic, Language and Information (FoLLI) and the ESSLLI Standing Committee invite proposals to host the 26-th European Summer School in Logic, Language, and Information (ESSLLI), to be held in August 2014. * The ESSLLI Summer School * ESSLLI is a summer school which takes place two weeks in the summer, every year since 1989. The school hosts approximately 50 courses at both introductory and advanced level, and convokes around 500 participants each year from all over the world. The main focus of the program of the summer schools is the interface between linguistics, logic and computation. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited lectures. Detailed information about the ESSLLI organization can be found in the ESSLLI general guide, and the organizing and program committee guides. The guides can be obtained via the Standing Committee secretary. * Submission Procedure * At this time we seek draft proposals from prospective bidders. Based on an evaluation of the draft proposals, promising bidders will be asked to provide additional information for the final selection procedure. The ESSLLI Standing Committee (SC), in consultation with the management board of FoLLI, will finally select the site, the organizing committee, and the program committee, and supervise the subsequent organization. * Draft Proposals * Draft proposals should identify a target site, date and organizing team with a chair who will be responsible for the overal organization. The organization committee is responsible for all matters having to do with the practical organization. Draft proposals should at least include information on: - Location (accessibility; school venue; accommodation and facilities) - Proposed dates and organizing team - Endorsement by hosting organization - Local Language, Logic, and Computation community - Meeting and accommodation venues; audiovisual equipment - Catering and reception facilities; social program opportunities - Budget estimates * Proposal Assessment * Proposals will be evaluated according to the following criteria (unordered): - Experience of organizing team, involvement in previous ESSLLIs - Local endorsement - Appropriateness of proposed dates - Accessibility and attractiveness of proposed site - Adequacy of campus facilities for the anticipated number of registrants - Adequacy of residence accommodations and food services in an appropriate range of price categories and close to the conference facilities - Adequacy of budget projections - Geographical and national balance with regard to meetings in the decade prior to 2012: Nancy (2004), Edinburgh (2005), Malaga (2006), Dublin (2007), Hamburg (2008), Bordeaux (2009), Copenhagen (2010), Ljubljana (2011), Opole 2012, Duesseldorf (2013). * Important Dates * - October 15, 2012, draft proposal due - October/November, 2012, SC provides feedback - December 31, 2012, final proposal due - January 28, 2013, bid selected at ESSLLI SC meeting - August 10, 2013, OC and PC progress report - August, 2014, 26-th ESSLLI Information about FoLLI and ESSLLI can be found at: http://www.folli.org. If you want to consult the ESSLLI guidelines, or have any other queries about drafting your bid, please contact Sophia Katrenko or Paul Dekker. Draft proposals should be sent to: Paul Dekker ILLC/Department of Philosophy Universiteit van Amsterdam The Netherlands +31 (0)20 5254541 p.j.e.dekker at uva.nl Sophia Katrenko UiL/OTS Utrecht University The Netherlands sophia at katrenko.com From matthias at ccs.neu.edu Mon Sep 24 09:52:31 2012 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Mon, 24 Sep 2012 09:52:31 -0400 Subject: [TYPES/announce] CfP: ESOP 2013 Message-ID: <4F85FBA5-24DC-4F31-86C4-C410CDF8B712@ccs.neu.edu> Call for Papers ESOP 2013: The European Symposium on Programming http://www.ccs.neu.edu/esop2013/ Affiliated with ETAPS'13 Rome, Italy, 16-24 March 2013 DESCRIPTION AND TOPICS ESOP is an annual conference devoted to fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. ESOP seeks contributions on all aspects of programming language research including, but not limited to, the following areas: * Programming paradigms and styles: functional programming, object-oriented programming, aspect-oriented programming, logic programming, constraint programming, extensible programming languages, domain-specific languages, synchronous and real-time programming languages; * Methods and tools to write and specify programs and languages: programming techniques, logical foundations, denotational semantics, operational semantics, meta programming, module systems, language-based security; * Methods and tools for reasoning about programs: type systems, abstract interpretation, program verification, testing; * Methods and tools for implementation: program transformations, rewriting systems, partial evaluation, experimental evaluations, virtual machines, intermediate languages, run-time environments; * Concurrency and distribution: process algebras, concurrency theory, parallel programming, service-oriented computing, distributed and mobile languages. Contributions bridging the gap between theory and practice are particularly welcome. IMPORTANT DATES 7 October 2012: Submission deadline for abstracts 14 October 2012: Submission deadline for full papers 28 November 2012: Beginning of author response period 14 December 2012: Notification of decision 8 January 2013: Camera-ready versions due 16-24 March 2013: Presentations in Rome, Italy INFORMATION For additional information, point your browser at http://www.ccs.neu.edu/esop2013/ From jhala at cs.ucsd.edu Mon Sep 24 11:22:59 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Mon, 24 Sep 2012 08:22:59 -0700 Subject: [TYPES/announce] Call for Papers: OBT 2013 Message-ID: <68B7008E-025D-4485-A1A1-E8A938BA9320@cs.ucsd.edu> Off the Beaten Track: New Frontiers for Programming Languages Research ====================================================================== http://goto.ucsd.edu/~rjhala/OBT2013/ (Co-located With POPL 2013: Rome, Italy) Important Dates --------------- * Paper Submission : Nov 5, 2012 (Monday) * Notification : Dec 3, 2012 (Monday) * Workshop : Jan 26, 2013 (Saturday) Background ---------- Programming language researchers have the principles, tools, algorithms and abstractions to solve all kinds of problems, in all areas of computer science. However, identifying and evaluating new problems, particularly those that lie outside the typical core PL problems we all know and love, can be a significant challenge. Hence, the goal of this workshop is to identify and discuss problems that do not often show up in our top conferences, but where programming language researchers can make a substantial impact. The hope is that by holding such a forum and associating it directly with a top conference like POPL, we can slowly start to increase the diversity of problems that are studied by PL researchers and that by doing so we will increase the impact that our community has on the world. While many workshops associated with POPL have become more like mini-conferences themselves, this is not our goal. Instead, the workshop will be informal and structured to encourage discussion. It will also be centered around problems and problem areas as opposed to fully-formed solutions. Topics ------ A good submission is one that outlines a new problem or an interesting, underrepresented problem domain. Good submissions may also remind the PL community of problems that were once in vogue but have not recently been seen in top PL conferences. Good submissions do not need to propose complete or even partial solutions, though there should be some reason to believe that programming languages researchers have the tools necessary to search for solutions in the area at hand. Submissions that seem likely to stimulate discussion about the direction of programming language research are encouraged. Possible topics include any of the following. + Biology, chemistry, or other natural sciences + Art, music, graphics and animation + Networking, cloud computing, systems programming + Linguistics + Economics, law, politics or other social sciences + Web programming, social computing + Algorithms and complexity + Mathematics, statistics + Machine learning or artificial intelligence + Education + Unusual compilers; underrepresented programming languages + **Surprise us!** We certainly hope to see submissions on topics not mentioned above. The goal of the workshop is to be inclusive, not exclusive. Submissions are evaluated on the basis of creativity, novelty, clarity, possible impact and potential for stimulating discussion. Authors concerned about the appropriateness of a topic are strongly encouraged to consult the Program Chair prior to submission. Submission Information ---------------------- There are two kinds of submissions. In either case, authors should not assume that reviewers will be experts in the particular area of the submission -- indeed, they will most likely *not* be. Hence, all submissions should be accessible to a wide range of PL researchers. All submissions should be in PDF in at least 10pt font, printable on US Letter paper. Authors are free to include links to multimedia content such as youtube videos or online demos. Reviewers may or may not view linked documents (it is up to authors to convince them to do so in their submission. + **Submissions for 5-minute talks:** Authors will submit a **1-page** PDF document. 5-minute talks will be followed by 5-15 minutes of discussion. + **Submissions for longer talks:** Authors will submit at most a **2-page** PDF document. Put the words *"Full Presentation"* in the title of your submission if you would like a longer talk. By default, we will assume a short, 5-minute presentation if the title does not contain these words and is 1 PDF page or less. Longer talks may be up to 1/2 an hour in length. The length will depend on the submissions received and how the program committee decides to assemble the program. Longer talks will be followed by 5-15 minutes of discussion. Submission will be handled through EasyChair. http://www.easychair.org/conferences/?conf=obt2013 Organizers ---------- **General Chair** David Walker, Princeton Univ. **Program Chair** Ranjit Jhala, Univ. of California, San Diego **Program Committee** * Emery Berger, *Univ. of Massachusetts, Amherst* * Kathleen Fisher, *Tufts Univ.* * Kunle Olokutun, *Stanford Univ.* * Kostis Sagonas, *Natl. Tech. Univ. Athens* * Peter Thiemann, *Univ. Freiburg* * Dimitrios Vytiniotis, *Microsoft Research* From alexandre.chapoutot at ensta-paristech.fr Mon Sep 24 15:18:43 2012 From: alexandre.chapoutot at ensta-paristech.fr (Alexandre Chapoutot) Date: Mon, 24 Sep 2012 21:18:43 +0200 Subject: [TYPES/announce] Open Position in Formal Methods at ENSTA ParisTech Message-ID: <025E9C17-C463-4623-9E9D-42A1996FA183@ensta-paristech.fr> Dear all, The departement of Computer Science and System Engineering of ENSTA ParisTech, headed by Bruno Monsuez, is seeking candidates for one faculty position (associate professor) in Computer Science. The research activity of the applicant should be in adequacy with the research themes developed in the team Safety and Dependability of Systems, headed by Michel Mauny. The research activity is focused on the formal verification of embedded systems taking into account heterogeneity of their components like the study of software/hardware interactions or software/physical environment interactions. The applicants must have a PhD degree in Computer Science and they must have some knowledge but not limited in abstract interpretation, model checking, test generation, type systems, system modeling. More details is given in the attached file. The application form can be downloaded at http://uei.ensta-paristech.fr/assets/divers/form_candid.rtf IMPORTANT DATES The application form must be sent by mail to Bruno Monsuez (bruno.monsuez at ensta-paristech.fr) before: November 4th 2012 Best regards A. Chapoutot --------- Alexandre Chapoutot -- Assistant professor Address: ENSTA ParisTech Unit? d'Informatique et d'Ing?nierie des Syst?mes 828 boulevard des mar?chaux 91762 Palaiseau Phone: +33 1 81 87 20 71 Mail: alexandre.chapoutot at ensta-paristech.fr Web: http://www.ensta.fr/~chapoutot/index.html -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: profil_surete_en_2012.pdf Type: application/pdf Size: 82741 bytes Desc: not available URL: -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei at chalmers.se Tue Sep 25 05:33:27 2012 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Tue, 25 Sep 2012 11:33:27 +0200 Subject: [TYPES/announce] 4 PhD Positions at Chalmers Message-ID: <50617A67.7020503@chalmers.se> 4 PhD Positions at Chalmers University of Technology, Gothenburg, Sweden Deadline: October 31, 2012 The Department of Computer Science and Engineering ( http://www.chalmers.se/cse/EN ) has about 70 faculty members and enrolls about 70 PhD students from more than 30 countries. The research spans the whole spectrum from theoretical foundations to applied systems development. There is extensive national and international collaboration with academia and industry all around the world. We particularly encourage applicants with interests in: -Programming language-based security (up to 2 positions): http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL=VacDetail%2Easpx%3FCommAdSeqNo%3D805 or contact Andrei Sabelfeld (andrei at chalmers.se) -Parallel algorithms and data structures in heterogeneous multi-core systems: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL=VacDetail%2Easpx%3FCommAdSeqNo%3D798 or contact Philippas Tsigas (tsigas at chalmers.se) -Privacy through language-based security and formal methods: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL=VacDetail%2Easpx%3FCommAdSeqNo%3D807 or contact Gerardo Schneider (gerardo.schneider at ituniv.se) Information on how to apply can be found via the URL?s above. Applicants shall have a Master?s Degree or corresponding in Computer Science, Computer Engineering, or in a related discipline. A genuine interest and curiosity in the subject matter and excellent analytical and communication skills, orally as well as literally, are needed. The employment is expected to start early 2013 (deviations are negotiable). As a Ph.D. student you are employed by Chalmers and will receive a salary according to current salary agreements (starting salary at present: approx. 25000SEK before taxes). A maximum of 20% of your time will be devoted to other duties at the department, mainly teaching. The remaining time will be devoted to your own courses and research within the project and you are expected to obtain a Ph.D. within a maximum of 5 years. You may apply even though you might not have completed your degree yet, but expect to do so before the position starts. Knowledge of Swedish is not a prerequisite for application. English is our working language for research and education at Master level. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students are native Swedes; the rest come from more than 30 different countries. Live in Gothenburg: http://youtu.be/sbwVIQeGcdY Study in Gothenburg: http://youtu.be/0WrlGlSyS1c From herbert at doc.ic.ac.uk Wed Sep 26 05:39:25 2012 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Wed, 26 Sep 2012 11:39:25 +0200 Subject: [TYPES/announce] QAPL 2013 - first call for papers Message-ID: <5062CD4D.8060209@doc.ic.ac.uk> [Apologies for multiple copies] ******************************************************************************** FIRST CALL FOR PAPERS Eleventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2013) Affiliated with ETAPS 2013 March 23 - 24, 2013, Rome, Italy http://qapl2013.units.it qapl2013 at units.it ******************************************************************************** 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 quantitative analysis of systems, for instance probabilistic and timing properties (e.g. security, safety, schedulability) and other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements); * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Cyber-physical systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Alessandra Di Pierro, University of Verona, Italy Topic: To be announced * Paolo Zuliani, University of Newcastle, UK Topic: To be announced Other invited speakers will be shared with MLQA (http://wiki.ercim.eu/wg/MLQA/index.php/MLQA_2013) SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits two types of submissions - regular papers and presentation reports: 1. Regular paper submissions must be original work, and must not have been previously published, nor be under consideration for publication elsewhere. Regular paper submission must not exceed 15 pages, possibly followed by a clearly marked appendix which will be removed for the proceedings and contains technical material for the reviewers. 2. Presentation reports concern recent or ongoing work on relevant topics and ideas, for timely discussion and feedback at the workshop. There is no restriction as for previous/future publication of the contents of a presentation. Typically, a presentation is based on a paper which recently appeared (or which is going to appear) in the proceedings of another recognized conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 4 pages. All submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: http://www.easychair.org/conferences/?conf=qapl13 The workshop PC will review all regular paper submissions to select appropriate ones, ones for acceptance in each category, based on their relevance, merit, originality, and technical content. Presentation reports will receive a light weight review to establish their relevance for the workshop. The authors of accepted submissions of both types are expected to present and discuss their work at the workshop. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue concerning the QAPL editions of 2011 and 2012 is in preparation and a further special issues related to the QAPL editions of 2013 and 2014 will be considered. IMPORTANT DATES: For regular papers: Abstract (optional): December 16, 2012 Submission (regular paper): December 20, 2012 Notification: January 20, 2013 Final version (ETAPS proceedings): February 3, 2013 Workshop: March 23-24, 2013 Final version (EPTCS post proceedings): TBA For presentation reports: Submission: January 23, 2013 Notification: January 25, 2013 ORGANIZATION: PC Chairs: * Luca Bortolussi, University of Trieste, Italy * Herbert Wiklicky, Imperial College London, UK Program Committee: * Alessandro Aldini, University of Urbino, Italy * Christel Baier, Technical University of Dresden, Germany * Ezio Bartocci, TU Wien, Austria * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, INRIA Rennes, France * Luca Bortolussi, University of Trieste, Italy * Tomas Brazdil, Masaryk University, Czech Republic * Kostas Chatzikokolakis, CNRS, France * Pedro D'Argenio, University of Cordoba, Argentina * Alessandra Di Pierro, University of Verona, Italy * Vashti Galpin, University of Edinburgh, UK * Joost-Pieter Katoen, RWTH Aachen, Germany * Richard Hayden, Imperial College London, UK * Holger Hermanns, University of Saarland, Germany * Mieke Massink, CNR-ISTI, Pisa, Italy * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Birmingham, UK * Anne Remke, University of Twente, the Netherlands * Jeremy Sproston, University of Torino, Italy * Mirco Tribastone, LMU Munich, Germany * Franck Van Breugel, York University, Canada * Herbert Wiklicky, Imperial College London, UK * Verena Wolf, University of Saarland, Germany From ksuenaga at fos.kuis.kyoto-u.ac.jp Thu Sep 27 04:10:23 2012 From: ksuenaga at fos.kuis.kyoto-u.ac.jp (Kohei SUENAGA) Date: Thu, 27 Sep 2012 17:10:23 +0900 Subject: [TYPES/announce] APLAS 2012: Final Call for Posters and Demos Message-ID: (Apologies for multiple copies.) 10th Asian Symposium on Programming Languages and Systems (APLAS 2012) December 11-13, 2012, Kyoto, Japan (Co-located with CPP 2012) http://aplas12.kuis.kyoto-u.ac.jp/ Call for Poster and Demos APLAS 2012 will include a poster and demo session during the conference. The poster session aims to give students and professionals an opportunity to present technical materials to the research community, and to get responses from other researchers in the field. This year, accepted posters will be presented in the main hall so that presenters have much opportunity of discussion during breaks. Standing by the poster on each break is not mandatory, though. * Scope Poster and demo contributions are sought in all areas of programming languages and systems, including the following topics: - semantics, logics, foundational theory; - design of languages and foundational calculi; - type systems; - compilers, interpreters, abstract machines; - program derivation and transformation; - program analysis, verification, model-checking, software security; - concurrency, constraints, domain-specific languages; - tools for programming, verification, implementation. * Format of Posters A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. AC Power outlet of 100V will be also provided during the poster & demo session. If you need more space and facilities, contact the poster chair (aplas2012-poster AT fos.kuis.kyoto-u.ac.jp). * Submission Each presenter should e-mail a 1-2 page abstract in PDF to the poster chair (Kohei Suenaga: aplas2012-poster AT fos.kuis.kyoto-u.ac.jp) by October 5th 2012. The abstract should include the title, author(s), affiliation(s) and summary of the work. The program of the poster session will be announced by October 29th, 2012. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. * Important Dates Submission deadline: October 5th, 2012 Notification: October 29th, 2012 * Contact Poster chair: Kohei Suenaga (aplas2012-poster AT fos.kuis.kyoto-u.ac.jp) -- Kohei Suenaga ksuenaga AT fos.kuis.kyoto-u.ac.jp From rduncan at ulb.ac.be Sun Sep 30 17:01:24 2012 From: rduncan at ulb.ac.be (Ross Duncan) Date: Sun, 30 Sep 2012 23:01:24 +0200 Subject: [TYPES/announce] call for participation: QPL 2012 - Brussels 10-12 October 2012 Message-ID: ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Universit? Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== We invite your participation in QPL 2012! The 9th workshop on Quantum Physics and Logic will bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science techniques for the study of physical behaviour in general. There will be full programme of contributed talks, and invited lectures from: - Stefaan Caenepeel (Vrije Universiteit Brussel) - Jens Eisert (Frei Universit?t Berlin) - Serge Massar (Universit? Libre de Bruxelles - Paul-Andr? Melli?s (Universit? Paris Diderot - Paris 7) There will be a workshop dinner on Thursday night. The schedule and list of accepted contributions can be found on the webpage, as well as local information and registration details. Best wishes and hope to see you in Brussels. Ross Duncan - QPL 2012 local organiser ========================================== QUANTUM PHYSICS AND LOGIC (QPL2012) 10-12 October 2012 Universit? Libre de Bruxelles, Brussels, Belgium http://homepages.ulb.ac.be/~rduncan/qpl.html ========================================== From fp at cs.cmu.edu Mon Oct 1 09:12:02 2012 From: fp at cs.cmu.edu (Frank Pfenning) Date: Mon, 1 Oct 2012 09:12:02 -0400 Subject: [TYPES/announce] Call for Papers: FoSSaCS 2013 Message-ID: Call for Papers International Conference on Foundations of Software Science and Computation Structures FoSSaCS 2013 http://www.etaps.org/2013/fossacs13 Affiliated with ETAPS'13 Rome, Italy, March 16-24, 2013 FoSSaCS is an annual conference seeking original papers on foundational research with a clear significance for software science. The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformaton, and verification of programs and software systems. Important dates: 7 October 2012: Abstract submission 14 October 2012: Paper submission 6-7 December 2012: Author response period 14 December 2012: Author notification 8 January 2013: Final versions of accepted papers Submission: 15 pages in LNCS format via EasyChair at https://www.easychair.org/conferences/?conf=fossacs2013 For details, consult http://www.etaps.org/2013/important-dates13 Topics: o Categorical models and logics o Language theory, automata, and games o Modal, spatial, and temporal logics o Type theory and proof theory o Concurrency theory o Rewriting theory o Semantics of programming languages o Program analysis, correctness, transformation, and verification o Logics of programming o Software specification and refinement o Models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems o Process calculi o Emerging models of computation o Logical aspects of computational complexity o Fundamentals of software security o Logical foundations of databases Program Committee: Andreas Abel (LMU Munich, Germany) Umut Acar (Max Planck Institute for Software Systems, Germany) Jiri Adamek (Techn. Univ. of Braunschweig, Germany) Rajeev Alur (University of Pennsylvania, USA) Eugene Asarin (Universite Paris Diderot, France) Nick Benton (MSR Cambridge, UK) Krishnendu Chatterjee (IST Austria) Swarat Chaudhuri (Rice University, USA) Adam Chlipala (MIT, USA) Ugo Dal Lago (University of Bologna, Italy) Giorgio Delzanno (University of Genova, Italy) Dan Ghica (University of Birmingham, UK) Jean Goubault-Larrecq (ENS Cachan, France) Bart Jacobs (Radboud Univ. of Nijmegen, Netherlands) Radha Jagadeesan (DePaul University, Chicago, USA) Patricia Johann (University of Strathclyde, Glasgow, UK) Naoki Kobayashi (Tohoku University, Japan) Stephane Lengrand (Ecole Polytechnique, France) Aart Middeldorp (University of Innsbruck, Austria) Catuscia Palamidessi (INRIA Saclay and LIX, France) Frank Pfenning, Chair (Carnegie Mellon University, USA) Ashish Tiwari (SRI International, Menlo Park, USA) Pawel Urzyczyn (University of Warsaw, Poland) Kwangkeun Yi (Seoul National University, Korea) -------------- next part -------------- An HTML attachment was scrubbed... URL: From hans at cs.aau.dk Mon Oct 1 09:55:59 2012 From: hans at cs.aau.dk (=?Windows-1252?Q?Hans_H=FCttel?=) Date: Mon, 1 Oct 2012 13:55:59 +0000 Subject: [TYPES/announce] Third Call for Papers (DEADLINE EXTENDED): BEAT'13 - 1st International Workshop on Behavioural Types Message-ID: <836526A9-76A1-4A41-BF3F-BFA4AC841ABD@cs.aau.dk> NOTE - DEADLINE EXTENDED TO 20 OCTOBER 2012 1stInternational Workshop on Behavioural Types http://beat13.cs.aau.dk January 22, 2013, Rome, Italy Collocated with POPL 2013, 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Second Call for papers Scope Behavioural type systems in general, and in particular those based on typestate, are attracting a lot of attention as these are able to ensure more than the usual safety guarantees of static program analyses. In the last ten years the idea of "types-as-processes" has been explored in several directions, providing dedicated type algebras for particular properties, ranging from protocol compatibility to race-freedom or activeness, as well as general type systems for a wide range of properties. The approaches include those of session types, generic type systems and behavioural ontracts as well as other type-theoretic notions, e.g. intersection types, that can be used to specify the behaviour of systems. These approaches have given rise to several important results. This workshop aims to present contributions on the theory and applications of behavioural types and to foster discussion on the pros and cons of different approaches and on new directions and challenges in the area. Topics include, but are not limited to ? The theoretical foundations of behavioural types ? Relationships between different approaches ? Applications to language design and implementation ? Applications to security ? Applications to composition ? Applications to code generation ? New applications of behavioural types Organizing committee Mario Bravetti Mariangiola Dezani-Ciancaglini Hans H?ttel Ant?nio Ravara Program committee Mario Bravetti Mariangiola Dezani-Ciancaglini Sophia Drossopoulou Simon Gay Hans H?ttel Naoki Kobayashi Ant?nio Rav?ra Jakob Rehof --- Submissions All accepted papers will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal, workshop or conference with refereed proceedings. Submissions can be up to 12 pages long (but short papers are also welcome) and must use the ACM SIGPLAN format. The SIGPLAN template can be found at http://www.sigplan.org/authorInformation.htm All submissions must be contributed as PDF files via the EasyChair page. http://www.easychair.org/conferences/?conf=beat13 Important dates Submission deadline: 20 October 2012 Notification: 8 November 2012 Camera-ready cope due: 12 November 2012 -------------- next part -------------- An HTML attachment was scrubbed... URL: From andreas.abel at ifi.lmu.de Mon Oct 1 11:16:14 2012 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Mon, 01 Oct 2012 17:16:14 +0200 Subject: [TYPES/announce] PLPV 2013 Last Call for Papers Message-ID: <5069B3BE.7050707@ifi.lmu.de> The Seventh ACM SIGPLAN Workshop on Programming Languages meets Program Verification (PLPV 2013) http://plpv.tcs.ifi.lmu.de/ 22nd January, 2013 Rome, Italy (Affiliated with POPL 2013) Call for Papers Overview The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. One example are dependently typed programming languages, which leverage a language's type system to specify and check rich specifications. Another example are extended static checking systems which incorporate contracts with either static or dynamic contract checking. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage interaction between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (based on types, Hoare-logic, abstract interpretation, etc), target different kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc). Important Dates Submission 8th October, 2012 (Monday) Notification 1st November, 2012 (Thursday) Final Version 8th November, 2012 (Thursday) Workshop 22nd January, 2013 (Tuesday) Submissions We seek submissions of up to 12 pages related to the above topics; shorter submissions are also welcome. Submissions may describe new work, propose new challenge problems for language-based verification techniques, or present a known idea in an elegant way (i.e., a pearl). Submissions should be prepared with SIGPLAN two-column conference format. Submitted papers must adhere to the SIGPLAN republication policy. Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. To submit a paper, access the online submission site at http://www.easychair.org/conferences/?conf=plpv2013. Publication Accepted papers will be published by the ACM and will appear in the ACM Digital library. Program Committee Andreas Abel Ludwig-Maximilians-University Munich (co-chair) Robert Atkey University of Strathclyde Harley Eades The University of Iowa Chung-Kil Hur Max Planck Institute for Software Systems Brigitte Pientka McGill University Andrew Pitts University of Cambridge Fran?ois Pottier INRIA Tim Sheard Portland State University (co-chair) Makoto Takeyama Advanced Industrial Science and Technology -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich Oettingenstr. 67, D-80538 Munich, GERMANY andreas.abel at ifi.lmu.de http://www2.tcs.ifi.lmu.de/~abel/ From einarj at ifi.uio.no Mon Oct 1 13:39:15 2012 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Mon, 1 Oct 2012 19:39:15 +0200 Subject: [TYPES/announce] integrated Formal Methods 2013, Turku, Finland - First Call for Papers Message-ID: (Apologies for duplicates) CALL FOR PAPERS ********************************************************************** 10th International Conference on integrated Formal Methods (iFM 2013) June 10 - 14, 2013 - Turku, Finland http://www.it.abo.fi/iFM2013/ ********************************************************************** OBJECTIVES AND SCOPE Applying formal methods may involve the modeling of different aspects of a system that are expressed through different paradigms. Correspondingly, different analysis techniques will be used to examine differently modeled system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into hybrid approaches to formal modeling and analysis; i.e., the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Formal and semiformal modelling notations; - Integration of formal methods into software engineering practice; - Refinement; - Theorem proving; - Tools; - Logics; - Model checking; - Model transformations; - Semantics; - Static Analysis; - Type Systems; - Verification; - Case Studies; - Experience reports SUBMISSION GUIDELINES iFM 2013 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. The conference proceedings will be published by Springer Lecture Notes in Computer Science series. All papers must be original, unpublished, and not submitted for publication elsewhere. All submissions must be in PDF format, using the Springer LNCS style files; we suggest to use the LaTeX2e package (the llncs.cls class file, available in llncs2e.zip and the typeinst.dem available in typeinst.zip as a template for your contribution). Submissions should be made using the iFM 2013 Easychair web site. Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. All accepted papers must be presented at the conference. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by the early date indicated by the organizers, and present the paper. IMPORTANT DATES Abstract Submission: January 10, 2013 Paper submission: January 17, 2013 Paper notification: March 11, 2013 Final version paper: March 31, 2013 To celebrate the 10th edition of the iFM conference, we will extend the event in the following two directions: - We are currently negotiating the publishing of extended versions of the best papers in a formal methods journal, after the conference. This will mark the maturity and significance of the conference theme. - The iFM conference will be accompanied by two days of workshops and tutorials. The conference will take place during 12-14.6.2013 and the tutorials and workshops right before it, during 10-11.6.2013. INVITED SPEAKERS TBA iFM PROGRAMME COMMITTEE CHAIRS: Einar Broch Johnsen, University of Oslo, Norway Luigia Petre, ?bo Akademi University, Finland iFM 2013 TUTORIALS and WORKSHOPS CHAIR Pontus Bostr?m, ?bo Akademi University, Finland Tutorial and Workshop proposal deadline: December 1, 2012 iFM 2013 ORGANIZING COMMITTEE CHAIR Luigia Petre, ?bo Akademi University, Finland PROGRAM COMMITTEE - Erika Abraham, RWTH Aachen University, Germany; - Elvira Albert, Complutense University of Madrid, Spain; - Marcello Bonsangue, Leiden University, the Netherlands; - Phillip J Brooke, Teesside University, UK; - Ana Cavalcanti, University of York, UK; - Dave Clarke, Catholic University of Leuven, Belgium; - John Derrick, Unversity of Sheffield, UK; - Kerstin Eder, University of Bristol, UK; - John Fitzgerald, Newcastle University, UK; - Andy Galloway, University of York, UK; - Marieke Huisman, University of Twente, the Netherlands; - Reiner Haehnle, Technical University of Darmstadt, Germany; - Einar Broch Johnsen, University of Oslo, Norway; - Peter Gorm Larsen, Aarhus University, Denmark; - Diego Latella, ISTI-CNR, Pisa, Italy; - Michael Leuschel, University of Duesseldorf, Germany; - Shaoying Liu, Hosei University, Japan; - Michele Loreti, University of Florence, Italy; - Dominique Mery, LORIA and University of Lorraine, France; - Stephan Merz, INRIA Lorraine, France; - Richard Paige, University of York, UK; - Luigia Petre, ?bo Akademi University, Finland; - Kristin Yvonne Rozier, NASA Ames Research Center, USA; - Philipp Ruemmer, Uppsala University, Sweden; - Thomas Santen, European Microsoft Innovation Center, Germany; - Ina Schaefer, Technical University of Braunschweig, Germany; - Steve Schneider, University of Surrey, UK; - Emil Sekerinski, McMaster University, Canada; - Kaisa Sere, Abo Akademi University, Finland; - Graeme Smith, University of Queensland, Australia; - Colin Snook, University of Southampton, UK; - Kenji Taguchi, AIST, Japan; - Helen Treharne, University of Surrey, UK; - Heike Wehrheim, University of Paderborn, Germany; - Herbert Wiklicky, Imperial College, UK; - Gianluigi Zavattaro, University of Bologna, Italy ********************************************************************** This call for papers and additional information about the conference can be found at http://www.it.abo.fi/iFM2013 For information regarding the conference you can contact: ifm2013 at easychair.org From scm-ml at iis.sinica.edu.tw Mon Oct 1 14:14:21 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml) Date: Tue, 2 Oct 2012 02:14:21 +0800 Subject: [TYPES/announce] PEPM 2013: Deadline Extension Message-ID: <52E1479E-9C40-4779-8EC0-7D4AA67F1CE7@iis.sinica.edu.tw> F I N A L C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ==================================================================== DEADLINE EXTENSION - Important Dates: Abstract submission: October 2, 2012 Paper submission: October 7, 2012 Notification: November 6, 2012 - Selected papers will be invited to a Special issue of Science of Computer Programming (SCP) (5-Year Impact Factor of SCP: 1.304) ==================================================================== SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of 'short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. IMPORTANT DATES Abstract submission: October 2, 2012 Paper submission: October 7, 2012 Notification: November 6, 2012 Camera ready: November 14, 2012 SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers and short papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. INVITED SPEAKERS We are proud to present the following two invited talks: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations See the workshop web site homepage for abstracts. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France) From Pieter.Philippaerts at CS.KULEUVEN.BE Mon Oct 1 16:11:39 2012 From: Pieter.Philippaerts at CS.KULEUVEN.BE (Pieter Philippaerts) Date: Mon, 1 Oct 2012 22:11:39 +0200 Subject: [TYPES/announce] Deadline Extension: ESSoS'13 Message-ID: <011701cda010$f76b2ed0$e6418c70$@cs.kuleuven.be> Due to numerous requests, the organizing committee of the International Symposium on Engineering Secure Software and Systems (ESSoS) has decided to extend the paper submission deadline to October 14th 2012. Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to ESSoS 2013. ============== ESSoS 2013 | Call for Papers =============== Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos/2013/ February 27 - March 1, 2013, Paris, France In cooperation with (pending): ACM SIGSAC and SIGSOFT and IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Hostile, networked environments, like the Internet, can allow vulnerabilities in software to be exploited from anywhere. To address this, high-quality security building blocks (e.g., cryptographic components) are necessary, but insufficient. Indeed, the construction of secure software is challenging because of the complexity of modern applications, the growing sophistication of security requirements, the multitude of available software technologies and the progress of attack vectors. Clearly, a strong need exists for engineering techniques that scale well and that demonstrably improve the software's security properties. GOAL AND SETUP The goal of this symposium, which will be the fifth in the series, is to bring together researchers and practitioners to advance the states of the art and practice in secure software engineering. Being one of the few conference-level events dedicated to this topic, it explicitly aims to bridge the software engineering and security engineering communities, and promote cross-fertilization. The symposium will feature two days of technical program, and is also open to proposals for both tutorials and workshops. In addition to academic papers, the symposium encourages submission of high-quality, informative experience papers about successes and failures in security software engineering and the lessons learned. Furthermore, the symposium also accepts short idea papers that crisply describe a promising direction, approach, or insight. TOPICS The Symposium seeks submissions on subjects related to its goals. This includes a diversity of topics including (but not limited to): - scalable techniques for threat modeling and analysis of vulnerabilities - specification and management of security requirements and policies - security architecture and design for software and systems - model checking for security - specification formalisms for security artifacts - verification techniques for security properties - systematic support for security best practices - security testing - security assurance cases - programming paradigms, models and DLS's for security - program rewriting techniques - processes for the development of secure software and systems - security-oriented software reconfiguration and evolution - security measurement - automated development - trade-off between security and other non-functional requirements (in particular economic considerations) - support for assurance, certification and accreditation - empirical secure software engineering SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag (pending) in the Lecture Notes in Computer Science Series (http://www.springer.com/lncs). Submissions should follow the formatting instructions of Springer LNCS. Submitted papers must present original, non-published work of high quality. For selected papers, there will be an invitation to submit extended versions to a special issue in the International Journal of Information Security. Two types of papers will be accepted: Full papers (max 14 pages without bibliography/appendices) - May describe original technical research with a solid foundation, such as formal analysis or experimental results, with acceptance determined mostly based on novelty and validation. Or, may describe case studies applying existing techniques or analysis methods in industrial settings, with acceptance determined mostly by the general applicability of techniques and the completeness of the technical presentation details. Idea papers (max 8 pages with bibliography) - May crisply describe a novel idea that is both feasible and interesting, where the idea may range from a variant of an existing technique all the way to a vision for the future of security technology. Idea papers allow authors to introduce ideas to the field and get feedback, while allowing for later publication of complete, fully-developed results. Submissions will be judged primarily on novelty, excitement, and exposition, but feasibility is required, and acceptance will be unlikely without some basic, principled validation (e.g., extrapolation from limited experiments or simple formal analysis). In the proceedings, idea papers will clearly identified by means of the "Idea" tag in the title. Proposals for both tutorials and workshops are welcome. Further guidelines will appear on the website of the symposium. IMPORTANT DATES Paper submission: October 14, 2012 Author notification: November 22, 2012 Camera-ready: December 13, 2012 PROGRAM COMMITTEE PC Co-Chairs Jan J?rjens, TU Dortmund and Fraunhofer ISST Ben Livshits, Microsoft Research PC Davide Balzarotti, EURECOM, France Ruth Breu, University of Innsbruck, Austria Cristian Cadar, Imperial College, UK Julian Dolby, IBM Research, US Matt Fredrikson, University of Wisconsin, US Dieter Gollmann, TU Hamburg-Harburg, Germany Maritta Heisel, U. Duisburg Essen, Germany Peter Herrmann, NTNU, Trondheim, Norway Thorsten Holz, U. Ruhr Bochum, Germany Sergio Maffeis, Imperial College, UK Heiko Mantel, TU Darmstadt, Germany Anders M?ller, Aarhus University, Denmark Haris Mouratidis, University of East London, UK Zachary Peterson, Naval Postgraduate School, US Frank Piessens, KU Leuven, Belgium Erik Poll, RU Nijmegen, NL Alexander Pretschner, TU Munich, Germany Wolfgang Reif, University of Augsburg, Germany Jianying Zhou, Institute for Infocomm Research, Singapore Mohammad Zulkernine, Queens University, Canada Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm -------------- next part -------------- An HTML attachment was scrubbed... URL: From sophie.tison at lifl.fr Tue Oct 2 02:57:15 2012 From: sophie.tison at lifl.fr (Sophie Tison) Date: Tue, 2 Oct 2012 08:57:15 +0200 Subject: [TYPES/announce] RTA 2013: First Call for Papers Message-ID: ************************************************************************* RTA 2013: FIRST CALL FOR PAPERS 24th International Conference on Rewriting Techniques and Applications June 24 - 26, 2013 Eindhoven, The Netherlands collocated with TLCA 2013 as part of RDP 2013 http://www.win.tue.nl/rdp2013/ ************************************************************************* abstract submission February 1 2013 paper submission February 5 2013 rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 ************************************************************************* The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. *** TOPICS OF INTEREST *** RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. *** PUBLICATION *** The proceedings of RTA 2013 will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: *** SUBMISSION GUIDELINES *** Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: , - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: . The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. *** PROGRAMME COMMITTEE CHAIR *** Femke van Raamsdonk (VU University Amsterdam, The Netherlands) *** PROGRAMME COMMITTEE *** Eduardo Bonelli, National University of Quilmes Byron Cook, Microsoft Research Cambridge Stephanie Delaune, ENS Cachan Gilles Dowek, Inria Paris-Rocquencourt Maribel Fernandez, King's College London Nao Hirokawa, JAIST Ishikawa Delia Kesner, University Paris-Diderot Helene Kirchner, Inria Paris-Rocquencourt Barbara Koenig, University Duisburg Essen Temur Kutsia, Johannes Kepler University Linz Aart Middeldorp, University of Innsbruck Vincent van Oostrom, Utrecht University Femke van Raamsdonk, VU University Amsterdam Kristoffer Rose, IBM Research New York Manfred Schmidt-Schauss, Goethe University Frankfurt Peter Selinger, Dalhousie University Paula Severi, University of Leicester Aaron Stump, The University of Iowa Tarmo Uustalu, Institute of Cybernetics Tallinn Roel de Vrijer, VU University Amsterdam Johannes Waldmann, HTWK Leipzig Hans Zantema, Eindhoven University of Technology *** CONFERENCE CHAIR *** Hans Zantema (Eindhoven University of Technology, The Netherlands) *** STEERING COMMITTEE *** Mauricio Ayala-Rincon, Brasilia University Frederic Blanqui, INRIA Tsinghua University Beijing Salvador Lucas, Technical University of Valencia Georg Moser, University of Innsbruck Masahiko Sakai, Nagoya University Sophie Tison, University of Lille *** FURTHER INFORMATION *** Questions related to submission, reviewing, and programme should be sent to the programme committee chair Femke van Raamsdonk, email femke at few.vu.nl. -------------- next part -------------- An HTML attachment was scrubbed... URL: From cezarykaliszyk at gmail.com Tue Oct 2 03:34:25 2012 From: cezarykaliszyk at gmail.com (Cezary Kaliszyk) Date: Tue, 2 Oct 2012 09:34:25 +0200 Subject: [TYPES/announce] UITP'12 Post-Proceedings - Call for Papers Message-ID: [Apologies if you receive multiple copies] ------------------------------------------ --- Call for Papers --- Post-Proceedings of the 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/ 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. UITP 2012 has taken place in Bremen on July 11th, 2012. For the forthcoming post-proceedings, we invite contributions -- in addition to accepted presentations at the workshop -- 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, and must be prepared in LaTeX using the EPTCS macro package which can be downloaded from the workshop web page. There is no strict page limit. Authors are asked to consult the author information at http://info.eptcs.org/ with regards to content, format and metadata. Submission will be via EasyChair at the previous adress (see link from the web page). All submissions will be peer reviewed by members of the programme committee, and accepted papers will appear in an EPTCS volume. The workshop web page at http://www.informatik.uni-bremen.de/uitp12/ contains all needed information and links. Important Dates Submission deadline: 15.12.2012 Acceptance notification: 15.02.2013 Final version: 01.04.2013 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 http://www.uitp-ig.org. From elaine at mat.ufmg.br Tue Oct 2 15:32:18 2012 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Tue, 2 Oct 2012 14:32:18 -0500 Subject: [TYPES/announce] IMLA 2013 - 1st call for papers. Message-ID: 6th Workshop on Intuitionistic Modal Logic and Applications https://sites.google.com/site/imodallogic2013/ Affiliated with the 4th World Congress on Universal Logic [UNILOG 2013] http://uni-log.org/start4.html Rio de Janeiro, Brazil April 3-7, 2013 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications of constructive modal logics are in type disciplines for programming languages, meta-logics for reasoning about a variety of computational phenomena and explanatory frameworks in philosophical logic. The workshop aims at developing and explaining theoretical and methodological issues centered around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question of which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. In its sixth edition, the Workshop on Intuitionistic Modal Logic and Applications will take place in Rio de Janeiro at the feet of the Sugar Loaf at the military school EsCEME. Previous editions of this conference were held: as part of the 14th Congress of Logic, Methdology and Philosophy of Science, Nancy, France, 25 July, 2011, as part of LiCS2008, Pittsburgh, USA, as part of LiCS2005, Chicago, USA, of FLoC2002, Copenhagen, Denmark and as part of FLoC1999, Trento, Italy. Topics of interest to this forum include, but are not limited to: * Modal Logics * Logical frameworks * Proof theory * Type theory * Automated deduction * Formal semantics of languages and systems * Applications IMLA 2013 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions Contributions should be written in English and submitted in the form of full papers (with a maximum of 12 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 IMLA 2013 page at Easychair https://www.easychair.org/conferences/?conf=imla2013 until the submission deadline in December 1st, by midnight, Central European Standard Time (GMT+1). The workshop pre-proceedings will be handed-out at workshop registration. At least one of the authors should register at the conference. The paper presentation should be in English. Important Dates Paper submission deadline: December 1st, 2012 Author notification: January 15th, 2013 Scientific and Organizing Committee * Valeria de Paiva (School of Computer Science, University of Birmingham, UK) * Mario Benevides (COPPE-IM, UFRJ) * Elaine Pimentel (DMAT, UFMG) * Vivek Nigam (DI, UFPb) * Natasha Alechina (School of Computer Science, University of Nottingham) The workshop occurs within the scope of the Marie Curie IRSES project GeTFun ("Generalizations of Truth-Functionality"). -- Elaine. ------------------------------------------------- Elaine Pimentel - DMat/UFMG Address: Departamento de Matematica Universidade Federal de Minas Gerais Av Antonio Carlos, 6627 - C.P. 702 Pampulha - CEP 30.161-970 Belo Horizonte - Minas Gerais - Brazil Phone: 55 31 3409-5970/3409-5994 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Pierre-Loic.Garoche at onera.fr Thu Oct 4 02:03:35 2012 From: Pierre-Loic.Garoche at onera.fr (=?iso-8859-1?Q?Pierre-Lo=EFc?= Garoche) Date: Thu, 4 Oct 2012 08:03:35 +0200 Subject: [TYPES/announce] NASA Formal Methods - NFM 2013, Call for Papers Message-ID: <20121004060334.GA17813@damazan> Sorry for multiple posting, pl ================================================================== 5th NASA Formal Methods Symposium (NFM) 2013 NASA Ames Research Center Moffett Field, CA, USA May 14-16, 2013 http://ti.arc.nasa.gov/events/nfm-2013/ ================================================================== Theme of the Conference: 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. We encourage submissions on cross-cutting approaches that bring together formal methods and techniques from other domains such as probabilistic reasoning, machine learning, control theory, robotics, and quantum computing among others. Topics of Interest Topics of Interest: * Formal verification, including theorem proving, model checking, and static analysis * Techniques and algorithms for scaling formal methods, including but not restricted to abstraction and symbolic methods, compositional techniques, as well as parallel and distributed techniques * Use of formal methods in automated software engineering and testing Model-based development * Formal program synthesis * Runtime monitoring and verification * Formal approaches to fault tolerance * Formal analysis of cyber-physical systems, including hybrid and embedded systems * Formal methods in systems engineering, modeling, requirements and specifications * Applications of formal methods to aerospace systems * Use of formal methods in safety cases * Use of formal methods in human-machine interaction analysis * Formal methods for multi-core, GPU-based implementations * Application of formal methods to emerging technologies, e.g., mobile applications, autonomous systems, web-based application Important Dates Dec 7, 2012 Paper Submission Deadline Jan 28 - Feb 1, 2013 Rebuttal phase Feb 15, 2013 Acceptance Notification March 15, 2013 Camera-Ready Version Submission May 13 - 16, 2013 NFM Symposium Submission There are two categories of submissions: * Regular papers describing fully developed work and complete results (15 pages). * Short papers describing tools, experience reports, or descriptions of work in progress with preliminary results (6 pages) All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the program committee. Papers must use Springer?s Lecture Notes in Computer Science (LNCS) style and be put in PDF format, as the papers will appear as a volume in Lecture Notes of Computer Science. Submissions are now open through easychair. easychair.org/conferences/?conf=nfm2013 Registration: NFM 2013 will be held at NASA Ames Research Center, Moffett Field, CA on May 14 to 16, 2013. 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. Details coming soon on Registration. Program Chairs Chairs: Guillaume Brat, CMU/NASA Ames Research Center, USA Neha Rungta, SGT Inc/NASA Ames Research Center, USA Arnaud Venet, CMU/NASA Ames Research Center, USA Program Committee: Julia Badger, NASA, USA Thomas Ball, Microsoft Research, USA Ricky Butler, NASA Langley Research Center, USA Patrice Chalin, Kansas State University, USA Darren Cofer, Rockwell Collins, USA Radhia Cousot, CNRS/?cole Normale Sup?rieure, France Leonardo De Moura, Microsoft Research, USA Ewen Denney, SGT Inc./NASA Ames, USA Ben Di Vito, NASA Langley Research Center, USA Jim Disbrow, NASA, USA Gilles Dowek, INRIA, France Matt Dwyer, University of Nebraska, USA Eric Feron, Georgia Institute of Technology, USA Jean-Christophe Filliatre, CNRS, France Kathleen Fisher, Tufts University, USA Pierre-Loic Garoche, ONERA, France Eric Goubault, CEA/Saclay, France Orna Grumberg, Technion, Israel Klaus Havelund, JPL, USA Gerard Holzmann, JPL, USA JoeHurd, Galois, Inc., USA Ranjit Jhala, University of California, San Diego, USA Hadas Kress-Gazit, Cornell University, USA Daniel Kroening, Oxford University, UK Tiziana Margaria, Univ. Potsdam, Germany C?lia Martinie, University Paul Sabatier, France Eric Mercer, Brigham Young University, USA Paul Miner, NASA Langley Research Center, USA Cesar Munoz, NASA Langley Research Center, USA Natasha Neogi, National Institute of Aerospace, USA Ganesh Pai, SGT/NASA Ames Research Center, USA Corina Pasareanu CMU/NASA Ames Research Center, USA Charles Pecheur, UC Louvain, Belgium Suzette Person, NASA Langley Research Center, USA Franco Raimondi, Middlesex University, UK John Regehr, University of Utah, USA Kristin Yvonne Rozier, NASA Ames, USA Sriram Sankaranarayanan, University of Colorado, USA Stephen F. Siegel, University of Delaware, USA Radu Siminiceanu, National Institute of Aerospace, USA Henny Sipma, Kestrel Technology, France Sarah Thompson, SGT Inc./NASA Ames Research Center, USA Cesare Tinelli, University of Iowa, USA Oksana Tkachuk, SGT Inc./NASA Ames Research Center, USA Helmut Veith, Vienna University of Technology, Austria Willem Visser, Stellenbosch University, South Africa Michael Whalen, University of Minnesota, USA Virginie Wiels, ONERA/DTIM, France Reinhard Wilhelm Saarland University, Germany -- Pierre-Lo?c Garoche Research Scientist @ ONERA pierre-loic.garoche at onera.fr - pierre-loic-garoche at uiowa.edu http://www.onera.fr/staff/pierre-loic-garoche/ -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 198 bytes Desc: Digital signature URL: From jhala at cs.ucsd.edu Thu Oct 4 03:53:44 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Thu, 4 Oct 2012 00:53:44 -0700 Subject: [TYPES/announce] CC 2013: Call For Papers Message-ID: <20EC6871-4F3C-49DD-BFF5-BCF0569E0F8B@cs.ucsd.edu> (Apologies for multiple copies...) ****Abstract submission deadline in a couple of days!**** Call For Papers 22nd International Conference on Compiler Construction (CC 2013) ================================================================ Rome, Italy, March 16-24, 2013 (Part of ETAPS 2013) http://www.etaps.org/2013/cc13 http://cc2013.elis.ugent.be Important Dates --------------- * Abstract Deadline : Oct 7, 2012 (Sunday) * Submission Deadline : Oct 14, 2012 (Sunday) * Notification : Dec 14, 2012 (Friday) * Camera-Ready : Jan 8, 2013 (Tuesday) * Conference : Mar 16-24, 2013 Background ---------- The Conference on Compiler Construction (CC) seeks submissions describing research pertaining to all aspects of the construction, analysis and execution of software. This includes classical compilation topics such as parsing, type checking and code generation, as well as recent areas like run-time systems, memory management, virtual machines, debuggers, domain specific languages, and programmer productivity tools like static checkers, refactoring editors. CC 2013 is the 22nd edition of the conference. CC is a member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS), which is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS 2013 is the 16th joint conference in this series. The 2013 conference will be held on March 16-24 in Rome, Italy. Topics ------ The conference is devoted to research pertaining to all aspects of the construction, analysis and execution of software. Papers are solicited on, but not limited to, the following topics: + compilation and interpretation techniques, including program representation and analysis, code generation and code optimization; + run-time techniques, including memory management, virtual machines, and dynamic and just-in-time compilation; + programming tools, including refactoring editors, checkers, compilers, and debuggers; + techniques for specific domains, including secure, parallel, distributed, embedded or mobile environments; + design of novel language constructs and their implementation. CC 2013 is not limited to topics discussed in previous editions. Papers identifying future directions for compilers, runtimes, and execution environments, broadly construed, especially those addressing the rapid changes of the underlying computing platforms are especially welcome. Submission Information ---------------------- The conference proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science series. Submissions and final versions of papers must be in the format (http://www.springer.de/comp/lncs/authors.html) A condition of submission is that, if the submission is accepted, one of the authors must attend the conference to present the paper. The submissions must adhere to the strict page limit of 20 pages (LNCS format). The above limit includes bibliography and figures. Submissions that are clearly too long may be rejected immediately. Papers should be submitted electronically via the EasyChair submission (http://www.easychair.org/conferences/?conf=cc2013). Submitted papers must be unpublished and not be submitted for publication elsewhere. Papers must be written in English and be submitted in pdf-format. Organizers ---------- Program Chairs - Koen De Bosschere (Ghent University, Belgium) - Ranjit Jhala (University of California, San Diego, US) Program Committee - Umut Acar (Carnegie Mellon University, USA) - Gogul Balakrishnan (NEC, Princeton, USA) - Francois Bodin (CAPS entreprise, France) - George Necula (University of California, Berkeley, USA) - Albert Cohen (?cole Normale Sup?rieure, Paris, France) - Bj?rn Franke (University of Edinburgh, UK) - Grigori Fursin (INRIA, France) - Andreas Gal (Mozilla, USA) - Mary Hall (University of Utah, USA) - Ben Hardekopf (University of California, Santa Barbara, USA) - Jurgen Vinju (CWI Amsterdam, Netherlands) - Christian Lengauer (University of Passau, Germany) - Matt Might (University of Utah, USA) - Alan Mycroft (Cambridge University, UK) - Keshav Pingali (University of Texas, Austin, USA) - Eelco Visser (TU Delft, Netherlands) - Greta Yorsh (ARM, UK) - Bern Zorn (Microsoft Research, USA) From jay.mccarthy at gmail.com Thu Oct 4 11:57:38 2012 From: jay.mccarthy at gmail.com (Jay McCarthy) Date: Thu, 4 Oct 2012 09:57:38 -0600 Subject: [TYPES/announce] Trends in Functional Programming 2013: 1st Call for Papers Message-ID: CALL FOR PAPERS 14th International Symposium Trends in Functional Programming 2013 Brigham Young University, Utah, U.S.A. May 14-16, 2013 http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . Functional programming in education . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2013 program chair, Jay McCarthy, at tfp2013 at easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2013 website. Paper submission is done through TFP13's EasyChair page: https://www.easychair.org/conferences/?conf=tfp2013 Important dates (2013): Full papers/extended abstracts submission: March 2nd to April 2nd, 2013 Notification of acceptance for presentation: Submission + one week Early registration deadline: Tuesday, April 16th, 2013 Late registration deadline: TBA, 2013 Camera ready for draft proceeding: Monday, April 29th, 2013 The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2013): TFP 2013 Symposium: Tuesday, May 14th, 2013 -- Thursday May 16, 2013 Student papers feedback: Friday, May 24th, 2013 Submission for formal review: Friday, June 21st, 2013 Notification of acceptance for LNCS: Friday, August 30th, 2013 Camera ready paper: Friday, September 27th, 2013 REGISTRATION Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline. TBA TFP 2013 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Symposium Organization Chair: Jay McCarthy, Brigham Young University, Utah, U.S.A Local Arrangements: Jay McCarthy, Brigham Young University, Utah, U.S.A TFP 2013 PROGRAMME COMMITTEE Chair: Jay McCarthy from Brigham Young University Andy Gill from the University of Kansas Arjun Guha from Cornell University Clara Segura from Complutense University of Madrid Danny Yoo from the University of Utah Henrik Nilsson from University of Nottingham James Caldwell from the University of Wyoming John Clements from California Polytechnic State University Jurriaan Hage from Universiteit Utrecht Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen Nikhil Swamy from Microsoft Research Rita Loogen from Philipps-Universit?t Marburg Sergio Antoy from Portland State University Suresh Jagannathan from Purdue University Tom Shrijvers from Ghent University Vikt?ria Zs?k from E?tv?s Lor?nd University, Budapest Wolfgang De Meuter from Vrije Universiteit Brussel SPONSORS TFP 2013 is sponsored by the Brigham Young University Computer Science department. INVITED SPEAKER In this instance of TFP, an invited talk will be given by Jeremy Siek, Assistant Professor at University of Colorado at Boulder. Prof Siek will be talking on the gradual typing approach to mixing static and dynamic typing. LINKS Main TFP13 page: http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp2013 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: TBA -- Jay McCarthy Assistant Professor / Brigham Young University http://faculty.cs.byu.edu/~jay "The glory of God is Intelligence" - D&C 93 From andrzej.murawski at leicester.ac.uk Fri Oct 5 06:44:57 2012 From: andrzej.murawski at leicester.ac.uk (Andrzej Murawski) Date: Fri, 5 Oct 2012 11:44:57 +0100 Subject: [TYPES/announce] LICS 2013 - Call for Workshop Proposals Message-ID: Call for Workshop Proposals LICS 2013 28th ACM/IEEE Symposium on Logic In Computer Science http://www2.informatik.hu-berlin.de/lics/lics13/ The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science (LICS 2013) will be held in New Orleans, USA, 25--28 June 2013. It will be colocated with MFPS (Mathematical Foundations of Programming Semantics) and CSF (IEEE Computer Security Foundations). Possible dates for workshops are Monday 24 June, Friday 28 June afternoon, and Saturday 29 June. Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - A discussion of the proposed format and agenda. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Your preferred dates. This is important! - Let us know if you would like your workshop to be a joint workshop with CSF. In that case you should submit to both. - Procedures for selecting participants and papers. - Expected number of participants. This is important! - Potential invited speakers. - Plans for dissemination (for example, special issues of journals). Proposals should be submitted via Easychair at https://www.easychair.org/conferences/?conf=licsworkshops2013 Important dates: Submission deadline: November 26, 2012 Notification: December 20, 2012 Program of the workshops ready: April 30, 2013 Workshops: June 24, 2013 or June 28-29, 2013 LICS conference: June 25-28, 2013 The workshops selection committee consists of the LICS General Chair, LICS Workshops Chair, LICS 2013 PC Chair and LICS 2013 Conference Chair. From a.ricci at unibo.it Fri Oct 5 07:49:41 2012 From: a.ricci at unibo.it (Alessandro Ricci) Date: Fri, 5 Oct 2012 11:49:41 +0000 Subject: [TYPES/announce] [Call for Participation] AGERE! @ SPLASH 2012 Message-ID: <0828E85A-1B53-4892-9D1F-183011BBF6A0@unibo.it> =============================================================== AGERE! @ SPLASH 2012 Programming based on Actors, Agents, and Decentralized Control SPLASH workshop sponsored by ACM SIGPLAN and Typesafe 21-22 October 2012 - Tucson, Arizona, USA http://agere2012.apice.unibo.it ================================================================ **Registration: http://splashcon.org/2012/attending/registering** The 2nd int. workshop AGERE! held at the ACM SPLASH 2012 conference will bring together researchers and practitioners interested in programming using actors, agents and all computing paradigms promoting a decentralized-control mindset in solving problems and developing software - concurrent and distributed in particular. This year AGERE! is a 2-days workshop, including three invited lectures from: - Akinori Yonezawa (University of Tokyo, Japan) "Agents, Concurrent Objects, and High Performance Computing" - Philipp Haller (Typesafe) "On the integration of the actor model in mainstream technologies: The Scala perspective" - Birna van Riemsdijk (Delft University of Technology The Netherlands) "20 years of Agent-Oriented Programming in Distributed AI: History and Outlook" and research paper sessions with 9 full papers, 4 short/position, and 1 demo. An important part of AGERE! are discussions that we hope will be generated around new ideas and directions. More details about the full programme can be found on the website. Local information and registration details can be found directly on the SPLASH website: http://splashcon.org/2012. AGERE! is an ACM SIGPLAN workshop and is supported by Typesafe (http://typesafe.com) The Organizing Committee of AGERE! 2012 is comprised of: - Gul Agha, University of Illinois at Urbana-Champaign, USA - Rafael H. Bordini, FACIN?PUCRS, Brazil - Assaf Marron, Weizmann Institute of Science, Israel - Alessandro Ricci, University of Bologna, Italy =============================================================== AGERE! @ SPLASH 2012 Programming based on Actors, Agents, and Decentralized Control SPLASH workshop sponsored by ACM SIGPLAN and Typesafe 21-22 October 2012 - Tucson, Arizona, USA http://agere2012.apice.unibo.it ================================================================ From christian.retore at labri.fr Fri Oct 5 14:01:17 2012 From: christian.retore at labri.fr (retore) Date: Fri, 5 Oct 2012 20:01:17 +0200 Subject: [TYPES/announce] book: the logic of categorial grammars Message-ID: <63201364-F7DB-4913-9956-C83566F2A6CF@labri.fr> The logic of categorial grammars: a deductive account of natural language syntax and semantics (R. Moot & Ch. Retor?) This book is a contemporary and comprehensive introduction to categorial grammars in the logical tradition initiated by the work of Lambek. It guides students and researchers through the fundamental results in the field, providing modern proofs of many classic theorems, as well as original recent advances. Numerous examples and exercises illustrate the motivations and applications of these results from a linguistic, computational and logical point of view. The Lambek calculus and its variants, and the corresponding grammars, are at the heart of these lecture notes. A chapter is devoted to a key feature of these categorial grammars: their very elegant syntax- semantic interface. In addition, we adapt linear logic proof nets to these calculi since they provide efficient parsing algorithms as exemplified in the Grail parser. This book shows how categorial grammars weave together converging ideas from formal linguistics, typed lambda calculus, Montague semantics, proof theory and linear logic, thus yielding a coherent and formally elegant framework for natural language syntax and semantics. http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-31554-1 -- Christian Retor? http://www.labri.fr/perso/retore From murano at na.infn.it Sat Oct 6 04:12:43 2012 From: murano at na.infn.it (Nello Murano) Date: Sat, 6 Oct 2012 10:12:43 +0200 (CEST) Subject: [TYPES/announce] SR 2013 - Preliminary call for contributions Message-ID: <40231.2.226.21.88.1349511163.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ***************************************************************** ------ SR 2013 ----- ***************************************************************** First International Workshop on Strategic Reasoning Rome, Italy, March 16th-17th, 2013 http://www.strategicreasoning.net/ ********************************************************** | PRELIMINARY CALL FOR CONTRIBUTIONS | ********************************************************** OBJECTIVES Strategic reasoning is one of the most active research area in multi-agent system domain. The literature in this field is extensive and provides a plethora of logics for modeling strategic ability. Theoretical results are now being used in many exciting domains, including software tools for information system security, robot teams with sophisticated adaptive strategies, and automatic players capable of beating expert human adversary, just to cite a few. All these examples share the challenge of developing novel theories and tools for agent strategies that take into account the likely behavior of adversaries. The SR international workshop aims to bring together researchers working on different aspects of strategic reasoning in computer science, both from a theoretical and a practical point of view. LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: - Logics for reasoning about strategic abilities - Logics for multi-agent mechanism design, verification, and synthesis - Logical foundations of decision theory for multi-agent systems - Strategic reasoning in formal verification - Automata theory for strategy synthesis - Strategic reasoning under perfect and imperfect information - Applications and tools for cooperative and adversarial reasoning - Robust planning and optimization in multi-agent systems - Risk and uncertainty in multi-agent systems - Quantitative aspects in strategic reasonings CO-LOCATED EVENT SR 2013 is an ETAPS 2013 workshop. ETAPS 2013 will be held on March 16th-24th, 2013. INVITED SPEAKERS - Krishnendu Chatterjee (IST Austria) - Alessio R. Lomuscio (Imperial College London) - Jean-Francois Raskin (Universit? Libre de Bruxelles) - Michael Wooldridge (University of Oxford) PAPER SUBMISSION Submitted papers should not exceed five pages using EPTCS format (http://style.eptcs.org). If necessary, the paper may be supplemented with a clearly marked appendix, which will be consulted at the discretion of the programme committee. Submissions must be in PDF format and will be handled via EasyChair ( https://www.easychair.org/conferences/?conf=sr2013 ). Two types of submission are invited: - Papers reporting on novel research, and - Expository papers reporting on published work. Each submission should be clearly identified as belonging to one category or the other. In both categories, strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and all papers should be written so that they are accessible to such an audience. Novel research abstracts will be held to the usual high standards of novel research publications. In particular, they should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the significance of the work its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Expository abstracts, which will be held to similarly high standards, may survey an area or report on a more specific previously published work; the submission should make clear the relevance to the strategic reasoning audience. Papers accepted for presentation (in both categories) will be collected as an EPTCS volume. Submissions from PC members are also allowed. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. IMPORTANT DATES Abstract submission: December 15, 2012 Paper submission: December 20, 2012 Acceptance notification: January 17, 2013 Final version: January 31, 2013 Workshop: March 16-17, 2013 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 workshop papers is also under consideration. PROGRAM CO-CHAIRS Fabio Mogavero, Universit? di Napoli Federico II, Italy Aniello Murano, Universit? di Napoli Federico II, Italy Moshe Y. Vardi, Rice University, Texas, USA PROGRAM COMMITTEE - Thomas Agotnes, University of Bergen, Norway - Dietmar Berwanger, RWTH Aachen, Germany - Valenting Goranko, Technical University of Denmark, Denmark - Joseph Y. Halpern, Cornell University, New York, USA - Wojtek Jamroga, University of Luxembourg, Luxembourg - Orna Kupferman, Hebrew University, Israel - Nicolas Markey, CNRS de Cachan, France - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Ramaswamy Ramanujam, Institute of Mathematical Sciences, India - Wolfgang Thomas, RWTH Aachen, Germany - Moshe Y. Vardi, Rice University, Texas, USA ORGANIZING COMMITTEE - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Giuseppe Perelli, Universit? di Napoli Federico II, Italy - Loredana Sorrentino, Universit? di Napoli Federico II, Italy INFO Please visit the conference website (http://www.strategicreasoning.net/) for more information. From giorgidze at gmail.com Tue Oct 9 03:52:25 2012 From: giorgidze at gmail.com (George Giorgidze) Date: Tue, 9 Oct 2012 09:52:25 +0200 Subject: [TYPES/announce] Deadline Extension for DDFP 2013 (co-located with POPL 2013) Message-ID: ------------------------------------------------ Data-Driven Functional Programming Workshop 2013 ------------------------------------------------ Co-Located with POPL 2013 January 22, 2013 | Rome, Italy http://research.microsoft.com/DDFP2013 NEW: Submission Date: October 15, 2012 We are very pleased to announce DDFP 2013, an exciting new workshop at POPL. This workshop is for anyone who loves the application of functional programming (and indeed other programming paradigms as well) to data-rich domains. Please consider submitting to the workshop. Whatever your flavor of data, whatever your flavor of functional programming. We want this to be a great event that opens up opportunities at the intersection of data and programming. Functional programming techniques are becoming increasingly important in data-centric programming: languages like Haskell, Scala, and C# draw heavily on a range of functional techniques and find application in numerous data-driven domains; functional paradigms like map/reduce and its extensions lie at the core of modern scalable data processing; and ?information-rich? languages like Ur, F#, and Gosu use meta-programming to integrate type-safe queries, web-based APIs, and scalable data sources?along with associated semantically-rich metadata?into the programming language. In principle, the expressiveness, strong typing, and core functional paradigm of these languages make them an ideal choice for expressing robust and scalable data-centric programming. However, many challenges remain. -------------- Workshop Goals -------------- The first Data Driven Functional Programming Workshop will examine data-centric programming in the light of today?s data challenges, with a particular focus on the application of functional programming and meta-programming techniques. In this forum, we will discuss, promote, and advance the use of functional programming in information-rich data spaces?including the development of new programming and data-manipulation systems and the extension of existing ones By devising methods for handling data from the programming level, we can promote the research and development of better functional programming technologies as a whole, as well as facilitate the shift towards both principled and effective data-centric computing. ----------------- Paper Submissions ----------------- We invite submissions in any area related to the connection between programming and data, including, but not limited to: * Formal systems that capture the essential theoretical elements of data-centric programming * Experimental systems that demonstrate novel data-centric programming techniques * Technology that demonstrates correctness, scalability, productivity, robustness, or maintainability of data-centric programs * Schema evolution, schema-type mapping, query languages, probabilistic programming, network-connected programming, or semi-structured data * Programming-related aspects of knowledge representation techniques including the database theory, ontology techniques, and linked data. --------------- Important Dates --------------- * New! Paper submissions due: Oct. 15, 2012 * Author notification: Oct. 30, 2012 * Camera ready: Nov. 10, 2012 * Workshop: Jan. 22, 2013 ------------- General Chair ------------- Evelyne Viegas, Microsoft Research, Redmond -------------- Program Chairs -------------- * Karin Breitman, EMC Labs, Brazil * Judith Bishop, Microsoft Research, United States ----------------- Program Committee ----------------- * Soren Auer, University of Leipzig, Germany * Guy Blelloch, Carnegie Mellon University, United States * Adam Chlipala, Massachusetts Institute of Technology, United States * Sophia Drossopolou, Imperial College, United Kingdom * Tim Finin, University of Maryland, United States * Kathleen Fisher, Tufts University, United States * Nate Foster, Cornell University, United States * George Giorgidze, University of T?bingen, Germany * Jim Hendler, Rensselaer Polytechnic Institute, United States * Steffen Staab, University of Koblenz, Germany * Don Syme, Microsoft Research Cambridge, United Kingdom * Jan Vitek, Purdue University, United States From Damien.Pous at ens-lyon.fr Tue Oct 9 04:45:02 2012 From: Damien.Pous at ens-lyon.fr (Damien Pous) Date: Tue, 9 Oct 2012 10:45:02 +0200 Subject: [TYPES/announce] Extension de deadline : JFLA 2013 Message-ID: * Dernier appel ? contributions * * date limite de soumission repouss?e au 19 octobre 2012 * JFLA'2013 (http://jfla.inria.fr/2013/) Journ?es Francophones des Langages Applicatifs Organis?es par Inria, ? Aussois, du 3 f?vrier au 6 f?vrier 2013 Les JFLA r?unissent concepteurs, utilisateurs et th?oriciens ; elles ont pour ambition de couvrir les domaines des langages applicatifs, de la preuve formelle, et des objets math?matiques qui sous-tendent ces outils. Ces domaines doivent ?tre pris au sens large : nous souhaitons avant tout favoriser les ponts entre les diff?rentes th?matiques : . Langages fonctionnels et applicatifs : s?mantique, compilation, optimisation, typage, mesures, extensions par d'autres paradigmes. . Assistants de preuve : impl?mentation, nouvelles tactiques, d?veloppements pr?sentant un int?r?t technique ou m?thodologique. . Logique, correspondance de Curry-Howard, r?alisabilit?, extraction de programmes, mod?les. . Sp?cification, prototypage, d?veloppements formels d'algorithmes. . Utilisation industrielle des langages fonctionnels et applicatifs, ou des m?thodes issues des preuves formelles, outils pour le web. Les articles soumis aux JFLA sont relus par au moins deux personnes s'ils sont accept?s, trois personnes s'ils sont rejet?s. Les critiques des relecteurs sont toujours bienveillantes et la plupart du temps encourageantes et constructives, m?me en cas de rejet. Il n'y a donc pas de raison de ne pas soumettre aux JFLA ! Nous accepterons cette ann?e deux types de soumissions : . article de recherche de quinze pages au plus, portant sur des travaux originaux. Nous accepterons volontier des travaux en cours (pour lesquels l'aspect recherche n'est pas enti?rement termin?) ; dans tous les cas, la forme de l'article devra ?tre soign?e. Les articles s?lectionn?s seront publi?s dans les actes de la conf?rence, les auteurs seront invit?s ? faire une pr?sentation en vingt-cinq minutes lors des journ?es. . proposition d'expos? court (dix minutes) pour d?crire prototype, faire une d?monstration d'un outil, reparler d'un article d?j? publi?, rechercher de l'aide pour r?soudre un probl?me particulier. Dans ce cas, nous vous demandons seulement de soumettre un r?sum? de deux ? trois pages, qui nous permettra de s?lectionner les orateurs en cas de forte affluence. Comit? de programme ------------------- Damien Pous, Pr?sident (CNRS -- ENS Lyon) Christine Tasson, Vice pr?sidente (PPS -- Universit? Paris Diderot) Jade Alglave (University of Oxford) David Baelde (ITU Copenhague) Pierre-Malo Deni?lou (Royal Holloway, University of London) Pascal Fradet (Inria Grenoble Rh?ne-Alpes) Samuel Mimram (CEA Saclay) Yann R?gis-Gianas (Universit? Paris VII) Matthieu Sozeau (Inria Paris -- Rocquencourt) Nicolas Tabareau (Inria Nantes) Enrico Tassi (LIX -- ?cole Polytechnique) Lionel Vaux (IML -- Universit? de la M?diterran?e) Soumission ---------- Date limite de soumission : 19 octobre 2012 Les soumissions doivent ?tre d?pos?es sur Easychair, ? l'adresse suivante : https://www.easychair.org/conferences/?conf=jfla2013 Elles peuvent ?tre r?dig?es en anglais, mais elles sont limit?es ? 15 pages A4 et le style LaTeX est impos? : http://jfla.inria.fr/2013/actes.sty Merci de signaler vos intentions de soumissions au plus t?t, par email au pr?sident du comit? de programme. Dates importantes ----------------- 19 octobre 2012 : Date limite de soumission 16 novembre 2012 : Notification aux auteurs 7 d?cembre 2012 : Remise des articles d?finitifs 10 janvier 2013 : Date limite d'inscription aux journ?es 3 f?vrier au 6 f?vrier 2013 : Journ?es Pour tout renseignement d'ordre administratif, contacter -------------------------------------------------------- Dani?le Herzog Inria Grenoble Rh?ne-Alpes, Bureau des cours et colloques 655 Avenue de l'Europe, Montbonnot 38 334 St Ismier Cedex - France Tel : +33 (0)4 76 61 52 23 - Fax : +33 (0)4 56 52 71 90 email : colloques at inrialpes.fr http://jfla.inria.fr/2013/ From alastair.donaldson at imperial.ac.uk Tue Oct 9 11:50:20 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Tue, 09 Oct 2012 16:50:20 +0100 Subject: [TYPES/announce] CfP: VSSE 2013 - Second Workshop on Validation Strategies for Software Evolution (VSSE) 2013 In-Reply-To: <4F057DD1.5090601@imperial.ac.uk> References: <4F057DD1.5090601@imperial.ac.uk> Message-ID: <507447BC.9040000@imperial.ac.uk> ============================================================== We apologize if you receive multiple copies of this CFP. Please distribute to anyone who may be interested. ============================================================== First Call for Papers ********************************************************* Second Workshop on Validation Strategies for Software Evolution (VSSE) 2013 http://sysrun.haifa.il.ibm.com/hrl/vsse2013/ Rome, Italy, Saturday March 16th, 2013 Affiliated with ETAPS 2013: http://www.etaps.org/2013/workshops13 ********************************************************* VSSE focuses on the verification and testing of software changes and upgrades. Software is usually not written all at once, but is built incrementally for several reasons: - Maintenance - fixing errors and flaws, hardware changes, etc. - Enhancements - new functionality, improved efficiency, extension, new regulations, etc. Changes are done frequently during the lifetime of most systems and can introduce software errors that were not present in the old version or expose errors that were present before but did not get exercised. In addition, upgrades are done gradually, so the old and new versions have to co-exist in the same system. This workshop addresses the issue of efficient and reliable verification of system changes and upgrades by means of formal verification, analysis and testing techniques. The first VSSE took place in Tallinn, Estonia, in 2012, affiliated with ETAPS 2012. The program of VSSE 2012 consisted of invited talks by experts in this area. Following the success of VSSE 2012, we decided to invite submissions to VSSE 2013. The workshop proceedings will be published in Electronic Notes in Theoretical Computer Science series (ENTCS). We encourage submission of work that addresses all aspects of formal verification, analysis, and testing of evolving software. Paper submission: All submitted papers should be in ENTCS format. For details, see: http://www.entcs.org/prelim.html There are two categories of submissions: A. Regular papers. Regular paper submissions should describe original and unpublished work. Simultaneous submission to other conferences with proceedings or submission of previously published material is strictly forbidden. Regular papers should not exceed twelve (12) pages in ENTCS format ? please see the instructions at http://www.entcs.org/preliminary.html . Submissions are accepted in electronic form (pdf), via the easychair at https://www.easychair.org/conferences/?conf=vsse2013 B. Presentation only. Presentation-Only submissions can describe a previously published work or a preliminary idea. Presentation-only submissions will be given a presentation slot in the workshop, but will not be published in the proceedings. This is an opportunity to present an already published relevant work, or to describe an interesting idea not yet ready for publication. Presentation will not be considered as a publication, so submission of already published or submitted results is allowed and encouraged. If you are working on the validation of changes and upgrades and plan to attend ETAPS, please consider submitting your presentation to the workshop. Presentation-only submissions can be either a two-pages abstract (pdf), or a presentation (PowerPoint or pdf). ---------------------------------------------------------------- Important dates: Submission deadline: December 20, 2012 Author notification: January 20, 2013 Camera-read version: January 30, 2013 Workshop: March 16, 2013 ---------------------------------------------------------------- Workshop chair: Hana Chockler (hanac at il.ibm.com) Organizing committee: Hana Chockler, IBM Research Daniel Kroening, Oxford Natasha Sharygina, USI Leonardo Mariani, UniMiB Giovanni Denaro, UniMiB Program committee: Hana Chockler, IBM Research Giovanni Denaro, University of Milano Bicocca Alastair Donaldson, Imperial College, London Daniel Kroening, Oxford Shuvendu Lahiri, Microsoft Research Leonardo Mariani, University of Milano Bicocca Fabio Massacci, University of Trento Ali Muhammad, VTT Technical Research Centre of Finland Manuel Oriol, ABB Corporate Research Alessandro Orso, Georgia Institute of Technology Bastian Schlich, ABB Corporate Research Ondrej Sery, Charles University in Prague Natasha Sharygina, University of Lugano Ofer Strichman, Technion Tanja Vos, Universidad Politecnica de Valencia Michael Wahler, ABB Corporate Research From hirokawa at jaist.ac.jp Thu Oct 11 00:45:33 2012 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Thu, 11 Oct 2012 13:45:33 +0900 Subject: [TYPES/announce] assistant professor position in JAIST Message-ID: <20121011134533.a3b34889a9d96cfbad054101@jaist.ac.jp> Dear all, The School of Information Science at JAIST is currently seeking applicants for an assistant professor position with skills in software verification. Detail information is described below. See also: http://www.jaist.ac.jp/jimu/syomu/koubo/pdf/is_20121010-e.pdf Best regards, Nao Hirokawa (JAIST) ---------------------------------------------------------- FACULTY POSITION JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY (JAIST) ---------------------------------------------------------- Position Title: a five-year term assistant professor Job Description: The successful candidate is expected: - to conduct active research in the field of Software Verification; - to supervise students in master's and doctoral programs of School of Information Science; and - to give introductory courses in School of Information Science. Qualifications: The successful candidate is expected: - to possess a Ph.D in a related field by the time of contract; - to possess a strong enthusiasm for research and education; - to be competent in conducting research in the area of software verification, especially bridging the gap between theory (e.g., mathematical logic, formal languages) and practice (including tool implementation); - to be capable of taking international research initiatives and collaboration; - to be fluent in English. Foreigners and women are encouraged to apply for the position. Starting Date: April 1st, 2013 Application Documents: (1) Curriculum Vitae and copies of degree certificates; (2) A list of research activities and accomplishments in reverse chronological order categorized into: international journal publications, reviewed international conference papers, domestic journal and conference publications, books, and others; (3) Hard copies of three (3) most significant publications; (4) 1500-word summary of main research activities; (5) Other related activities including information concerning successful funding, prizes, patents, activities in academic societies such as organization and membership of conference program committee of international meetings, editorship of international/domestic journals; (6) 1500-word research plan during the term; (7) 1000-word description of your aspiration for educational activities; (8) Contact address, e-mail, phone number and fax number; (9) Two (2) letters of recommendation or the contact information of two (2) references including names, mailing addresses, e-mail addresses, phone and fax numbers. Application Due: November 30th, 2012 Send the application materials to: Attention to: Dean, Professor Tetsuo Asano School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa, 923-1292 JAPAN * Write "Application documents for assistant professor for Software Science" in red ink on an envelope containing the documents, and send these documents by registered mail (priority mail). * It should be noted that documents submitted via e-mail are not accepted. For more information, contact: School of Information Science (Graduate School Secretarial Service Department) E-mail: is-dean at jaist.ac.jp Tel: +81-761-51-1155, Fax: +81-761-51-1149 More detailed information about Japan Advanced Institute of Science and Technology, and School of Information Science is available at: http://www.jaist.ac.jp/index-e.html From Assia.Mahboubi at inria.fr Sat Oct 13 18:00:23 2012 From: Assia.Mahboubi at inria.fr (Assia Mahboubi) Date: Sat, 13 Oct 2012 18:00:23 -0400 Subject: [TYPES/announce] A proof of the Feit Thompson theorem in Coq Message-ID: <5079E477.9060401@inria.fr> It is our great pleasure to announce that the proof of the Odd Order Theorem (due to Walter Feit and John G. Thompson) has now been completely machine-checked using the Coq proof assistant. This concludes a 6 year effort by the Mathematical Components team lead by Georges Gonthier (MSR Cambridge) at the Inria Microsoft Research Joint Centre. For more information, see: http://www.msr-inria.inria.fr/Projects/math-components/feit-thompson The Mathematical Components Team From garrigue at math.nagoya-u.ac.jp Sun Oct 14 20:46:59 2012 From: garrigue at math.nagoya-u.ac.jp (Jacques Garrigue) Date: Mon, 15 Oct 2012 09:46:59 +0900 (JST) Subject: [TYPES/announce] APLAS and CPP 2012: call for participation Message-ID: <20121015.094659.39189719.garrigue@math.nagoya-u.ac.jp> CALL FOR PARTICIPATION The 10th Asian Symposium on Programming Languages and Systems (APLAS2012) and The Second International Conference on Certified Programs and Proofs (CPP2012) Kyoto, Japan December 11-15, 2012 http://aplas12.kuis.kyoto-u.ac.jp/ (APLAS) http://cpp12.kuis.kyoto-u.ac.jp/ (CPP) 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. CPP is a new international forum on theoretical and practical topics in all areas, including computer science, mathematics and education, that consider certification as a essential paradigm for their work. The 10th APLAS and 2nd CPP will be held together in Kyoto, Japan from December 11 to 15, 2012. The five-day event includes, five invited talks, and two conferences. The common registration site for both conferences is now open at: https://v3.apollon.nta.co.jp/aplas12_cpp12/ Early Registration (until November 10, 2012) Regular | Student -----------------------+----------- APLAS+CPP: JPY 54000 | JPY 36000 APLAS only: JPY 31000 | JPY 22000 CPP only: JPY 31000 | JPY 22000 Venue APLAS and CPP will take place at the Kyoto International Community House, nearby the touristic area of Okazaki, inside Kyoto. Kyoto International Community House 2-1 Torii-cho, Awataguchi, Sakyo-ku, Kyoto 606-8536 Invited Speakers o Jan Vitek (Purdue University) "Planet Dynamic or: How I Learned to Stop Worrying and Love Reflection" o Greg Morrisett (Harvard University) ?Scalable Formal Machine Models? o Xavier Leroy (INRIA) ?Mechanized Semantics for Compiler Verification? o Gilles Barthe (IMDEA) "Automation in computer-aided cryptography: proofs, attacks and designs" o Naoki Kobayashi (University of Tokyo) "Program Certification by Higher-Order Model Checking" For detailed conference programs, see - http://aplas12.kuis.kyoto-u.ac.jp/program.html - http://cpp12.kuis.kyoto-u.ac.jp/program.html From mattpark at microsoft.com Mon Oct 15 03:34:29 2012 From: mattpark at microsoft.com (Matthew Parkinson) Date: Mon, 15 Oct 2012 07:34:29 +0000 Subject: [TYPES/announce] MSRC Researcher and Postdoc positions Message-ID: <29F26E4C3FA8704EACDF6E85B3D4CB8403A7EAA9@TK5EX14MBXC301.redmond.corp.microsoft.com> The following advertisement might be of interested to readers of the TYPES mailing list. Matt -- Open Research Positions MSR-Cambridge is seeking candidates from all areas of Computer Science, including theoretical foundations, systems, networking, programming languages, and machine learning. We are also interested in candidates doing research at the frontiers of Computer Science with other disciplines (such as finance, biology). We give higher priority to the overall originality and promise of the candidate's work than to the candidate's sub-area of specialization. We have both researcher positions (with no end date) as well as 2 year postdoctoral researcher positions. We will be reviewing applications on February 1, 2013, thus candidates are strongly encouraged to submit applications by that date; however, applications will be considered. To learn more, please read http://research.microsoft.com/en-us/jobs/fulltime/researcher.aspx Apply here: http://research.microsoft.com/en-us/jobs/fulltime/apply_researcher.aspx From Vasileios.Koutavas at scss.tcd.ie Mon Oct 15 08:19:58 2012 From: Vasileios.Koutavas at scss.tcd.ie (Vasileios Koutavas) Date: Mon, 15 Oct 2012 13:19:58 +0100 Subject: [TYPES/announce] OCCP 2013: Call for Papers Message-ID: ---------------------------------------------------------------- CALL FOR PAPERS OCCP 2013 1st Workshop on Optimistic Cooperation in Concurrent Programming Rome, Italy, March 16th, 2013 (collocated with ETAPS 2013) http://www.scss.tcd.ie/Vasileios.Koutavas/occp-workshop/ ---------------------------------------------------------------- * DESCRIPTION Optimistic concurrency has long been accepted as a convenient method for programming systems where there is contention for resources. Traditionally in database systems and more recently in software transactional memory systems, optimistic concurrency is realized in the form of transactions, which the programmer can assume run isolated from their environment, thereby alleviating the need for explicit programming of locking schemes. Recent research on concurrent programming models have lead to the realization in both academia and industry that optimistic concurrency can also be advantageous in programming systems where concurrent processes need to cooperate to perform a desired task. In such systems transactional isolation needs to be abandoned. This brings forward numerous challenges in 1) the design and implementation of such systems, 2) the invention of appropriate programming language support for optimistic process cooperation, 3) the semantics, theory and verification of these systems. This workshop aims to bring together researchers and practitioners from academia and industry who work on aspects of optimistic process cooperation. It also aims to connect the different research communities pertinent to this field. These include the programming language community, the systems community and the concurrent calculi community. * SCOPE Topics of interest include, but are not limited to: - Programming language support for optimistic process cooperation. - Semantics and theory of optimistic process cooperation. - Compilation techniques and runtime systems. - Calculi for modelling optimistic process cooperation in concurrent and distributed computing. - Use of optimistic cooperation in the modelling of service-oriented and biological systems. - Reversible computation. - Static analysis and verification of systems employing optimistic process cooperation. - Programming idioms for optimistic process cooperation. - Applications where optimistic process cooperation can provide a significant benefit to the programmer. - Experience reports of existing systems and prototypes employing forms of optimistic cooperation. * INVITED SPEAKERS - Suresh Jagannathan (Purdue University) - Victor Luchangco (Oracle Labs) * TUTORIALS - Matthew Fluet (Rochester Institute of Technology) Transactional Events - Vasileios Koutavas (Trinity College Dublin) Theory of Optimistic Cooperation * PAPER SUBMISSION AND PUBLICATION Submitted papers should contain previously unpublished complete work, work in progress, or experience reports. Submissions should be in PDF format, prepared using the EPTCS style (http://style.eptcs.org/), and should be from 7 to 15 pages long, including references. Papers must be submitted through the Easychair page of the workshop: http://www.easychair.org/conferences/?conf=occp2013 Accepted papers will be distributed in electronic preliminary proceedings at the workshop. Subsequently, selected papers will be invited for publication in a post-workshop refereed proceedings in Electronic Proceedings in Theoretical Computer Science. * DATES Abstract submission deadline: 17 December 2012 Paper submission deadline: 21 December 2012 Notification: 18 January 2013 Camera ready deadline: 22 February 2013 * ORGANISERS Nick Benton (Mircosoft Research) Matthew Fluet (Rochester Institute of Technology) Matthew Hennessy (Trinity College Dublin) Vasileios Koutavas (Trinity College Dublin) Jens Palsberg (UCLA) From naumann at cs.stevens.edu Tue Oct 16 14:36:24 2012 From: naumann at cs.stevens.edu (David Naumann) Date: Tue, 16 Oct 2012 14:36:24 -0400 (EDT) Subject: [TYPES/announce] PhD positions in Language-based Security Message-ID: *----------------------------------------------------------* | PhD Studentships in Programming Languages-Based Security | *----------------------------------------------------------* Research assistantships for Ph.D. students are available at Stevens Institute of Technology in the areas of policy specification and program analysis tools for security. The research group of Prof David Naumann is investigating how to specify information flow policies for mobile apps, web applications, and embedded systems, and to enforce policies using static analysis, dynamic monitoring, and formal verification. The group has extensive international collaborations with industry and academia. The PhD positions are funded by the National Science Foundation and the Department of Homeland Security. More at http://www.cs.stevens.edu/~naumann/ Candidates must hold a degree in computer science or a closely related discipline, with strong background in at least some of these areas: programming languages, compilers or program analysis, security, logic or formal methods. You should have interest in performing original scientific research, presenting the results in top conferences and scientific journals, and collaborating with other students and researchers. You are self-motivated and are able to work both independently and as a team player. Stevens is conveniently located just across the river from mid-town Manhattan NYC, within commuting distance of several of the top universities and research labs in the US. Stevens has strong research groups in related areas including mobile and embedded systems, software assurance, cryptography, privacy-preserving data mining, botnets and malware, artificial intelligence and bioinformatics. Positions are available starting Spring 2013 or later. Full financial support is provided. There are no teaching duties in the first two years. Inquiries should be sent to naumann at cs.stevens.edu. General information about the PhD program may be found at http://www.stevens.edu/compsci/graduate/phd/ From chong at seas.harvard.edu Tue Oct 16 14:52:52 2012 From: chong at seas.harvard.edu (Stephen Chong) Date: Tue, 16 Oct 2012 14:52:52 -0400 Subject: [TYPES/announce] Call for Applications: Harvard CRCS 2013-14 Postdoctoral Fellows and Visiting Scholars Message-ID: <507DAD04.5050806@seas.harvard.edu> (Please note that Language-based Security is one of the ongoing projects at Harvard CRCS, and applications from TYPES readers in this area would be great.) ------ The Harvard Center for Research on Computation and Society (CRCS) solicits applications for its Postdoctoral Fellows and Visiting Scholars Programs for the 2013-2014 academic year. Postdoctoral Fellows are given an annual salary of approximately $60,000 for one year (with the possibility of renewal) to engage in a program of original research, and are provided with additional funds for travel and research support. Visiting Scholars often come with their own support, but CRCS can occasionally offer supplemental funding. We seek researchers who wish to interact with both computer scientists and colleagues from other disciplines, and have a demonstrated interest in connecting their research agenda with societal issues. We are particularly interested in candidates with interests in Economics and Computer Science, Health Care Informatics, Privacy & Security, and/or Technology & Accessibility, and those who may be interested in engaging in one of our ongoing/upcoming projects: - Intelligent, Adaptive Systems for Health Care Informatics - Language-Based Security - Personalized Accessibility - Privacy and Security in Targeted Advertising - Privacy Tools for Sharing Research Data - Trustworthy Crowdsourcing Harvard University is an Affirmative Action/Equal Opportunity Employer. We are particularly interested in attracting women and underrepresented groups to participate in CRCS. For further information about the Center and its activities, see http://crcs.seas.harvard.edu/. Application Procedure A cover letter, CV, research statement, copies of up to three research papers, and up to three letters of reference should be sent to: Postdoctoral Fellows and Visiting Scholars Programs Center for Research on Computation and Society crcs-apply at seas.harvard.edu References for postdoctoral fellows should send their letters directly, and Visiting Scholar applicants may provide a list of references rather than having letters sent. The application deadline for full consideration is December 16, 2012. From brucker at spamfence.net Wed Oct 17 03:24:15 2012 From: brucker at spamfence.net (Achim D. Brucker) Date: Wed, 17 Oct 2012 09:24:15 +0200 Subject: [TYPES/announce] Call for Papers: Only Two Months Left - STVR Special Issue on Tests and Proofs Message-ID: <20121017072415.GA6241@shinanogawa.brucker.ch> Apologies for duplicates. ************************************************* **** Two months until the deadline for *** **** submitting a paper to the *** **** STVR special issue on Tests and Proofs *** ************************************************* 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 AG, 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 AG, SAP Research Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe, Phone: +49 6227 7-52595 http://www.brucker.ch From james.cheney at gmail.com Wed Oct 17 05:39:36 2012 From: james.cheney at gmail.com (James Cheney) Date: Wed, 17 Oct 2012 10:39:36 +0100 Subject: [TYPES/announce] Three lecturerships in computer science/informatics at the University of Edinburgh Message-ID: [the search areas for these positions include security and databases, topics with well-established connections to types and programming languages] The University of Edinburgh School of Informatics plans to hire three lecturers. (In the UK, "lecturer" refers to an entry-level, permanent faculty position, roughly comparable to "assistant professor" in US terminology.) Applications from researchers in any area will be considered; specific search areas of interest to TYPES list readers may include: * Cyber-security, reinforcing our security-related research and connecting to our strengths in databases, programming languages and verification. * Data management, reinforcing our world leading database group. * Synthetic biology, developing efficient methods for designing biological systems using computational principles and techniques. Readers of this list will know that the Laboratory for Foundations of Computer Science, founded by Robin Milner, Gordon Plotkin, Rod Burstall, and Matthew Hennessy in 1986, has a strong tradition of research in subjects related to Types. We welcome applications by excellent candidates in this area. Please feel free to contact me, Phil Wadler, or others in LFCS if you are interested in applying. To apply, visit the University's (recently upgraded) jobs website: http://www.vacancies.ed.ac.uk/ and enter vacancy reference 005085. The closing date for the positions is November 1, 2012. --James From ronchi at di.unito.it Fri Oct 19 10:16:27 2012 From: ronchi at di.unito.it (Ronchi Della Rocca Simona) Date: Fri, 19 Oct 2012 16:16:27 +0200 Subject: [TYPES/announce] DICE 2013 call for papers Message-ID: <6C254EC2-09DC-4130-BBEE-8EA160F7F010@di.unito.it> ???????????????????????????????? DICE 2013 ?????????????????????????????????? (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY) http://dice2013.di.unito.it/index.html Roma, March 16,17 2013 satellite event of ETAPS 2013 call for papers IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 INVITED: ? Jean-Yves Marion (Loria - INPL Nancy) ? Marko van Eekelen (Open University - Radboud University Nijmegen) ? Paul-Andr? Melli?s (PPS, Paris) SCOPE: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity-bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). SUBMISSIONS: Authors are invited to submit an extended abstract, up to 5 pages. Abstracts should be written in English, in the form of a PDF file uploaded to DICE 13 page at Easychair . Submissions of abstracts by PC members are allowed and encouraged. We plan on not having pre-proceedings; an open call for post-proceedings, hopefully as special issue of a journal, will follow. PROGRAM COMMITTEE: ? Roberto Amadio (Paris-Diderot) ? Harry Mairson (Brandeis) ? Virgile Mogbil (Paris 13) ? Simona Ronchi Della Rocca (Torino) (Chair) ? Luca Roversi (Torino) ? Olha Shkaravska (Nijmegen) ? Ulrich Sch?pp (LMU) ? Aleksy Shubert (Warsaw) ? Jakob G. Simonsen (DIKU) STEERING COMMITTEE: ? Patrick Baillot (ENS Lyon, CNRS) ? Ugo Dal Lago (Universit? degli Studi di Bologna) ? Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) ? Jean-Yves Marion (Loria - INPL Nancy) ? Simona Ronchi Della Rocca (Universit? degli Studi di Torino)) -------------- next part -------------- An HTML attachment was scrubbed... URL: From pangjun at gmail.com Tue Oct 23 03:53:34 2012 From: pangjun at gmail.com (Jun PANG) Date: Tue, 23 Oct 2012 09:53:34 +0200 Subject: [TYPES/announce] ICECCS 2013 in Singapore -- 1st Call for Papers Message-ID: =================================================== CALL FOR PAPERS The Eighteenth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2013) 17-19 July 2013 National University of Singapore, Singapore http://www.comp.nus.edu.sg/~pat/iceccs2013 =================================================== IMPORTANT DATES --------------------------- Abstract submission: February 1, 2013 Paper submission deadline: February 15, 2013 Workshop proposal submission: February 15, 2013 Notification of acceptance: March 30, 2013 Camera-ready material for publication: April 20, 2013 Checking for Production: April 30, 2013 Conference date: July 17-19, 2013 Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts, from a variety of user domains and software disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools, existing complex systems, and commercially available tools. SCOPE AND TOPICS --------------------------- Authors are invited to submit papers describing original, unpublished research results, case studies and toolset research results, case studies and tools. Papers are solicited in all areas related to complex computer-based systems, including the causes of complexity and means of avoiding, controlling, or coping with complexity. Topic areas include, but are not limited to: Requirement specification and analysis Verification and validation Security and privacy of complex systems Model-driven development Reverse engineering and refactoring Architecture software Big Data Management Ambient intelligence, pervasive computing Ubiquitous computing, context awareness, sensor networks Design by contract Agile methods Safety-critical & fault-tolerant architectures Adaptive, self-managing and multi-agent systems Real-time, hybrid and embedded systems Systems of systems Tools and tool integration Industrial case studies SUBMISSION --------------------------- Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic and culminate panels to discuss relationships between industrial and academic research. Papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and industrial experience reports should describe practical projects carried out in industry, and reflect on the lessons learnt from them. FULL PAPERS Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. POSTER PAPERS Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedings. PAPER SUBMISSION Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All submissions should be made through the Easychair Website: https://www.easychair.org/account/signin.cgi?conf=iceccs2013 ORGANIZING COMMITTEES --------------------------- General Co-Chairs Jin Song Dong, National University of Singapore, Singapore Jun Sun, Singapore University of Technology and Design, Singapore Program Committee Co-Chairs Yang Liu, Nanyang Technological University, Singapore Andrew Martin, Oxford University, UK Workshop Chair Zhenjiang Hu, National Institute of Informatics, Japan Yuan-Fang Li, Monash University, Australia Publicity Chair Jun Pang, University of Luxembourg, Luxembourg Tutorial Chair Isabelle Perseil, INSERM Research, France Local Chair Shangwei Lin, National University of Singapore, Singapore Manchun Zheng, Singapore University of Technology and Design, Singapore Doctoral Symposium Chair Zhengchang Xin, Nanyang Technological University, Singapore Registration Chair ShaoJie Zhang, Singapore University of Technology and Design, Singapore Web Chair Jianqi Shi, National University of Singapore, Singapore PROGRAMME COMMITTEES --------------------------- Marc Aiguier, Ecole Centrale Paris, France Yamine Ait Ameur, LISI/ENSMA, France Luis Almeida, da Universidade do Porto, Portugal Etienne Andre, Universit? Paris 13, France Luciano Baresi, DEI - Politecnico di Milano, Italy Karin Breitman, PUC-RJ, Brazil Phillip J Brooke, Teesside University, United Kingdom Jean-Michel Bruel, IRIT, France Radu Calinescu, University of York, United Kingdom Corina Cirstea, University of Southampton, United Kingdom Felicita Di Giandomenico, ISTI-CNR, Italy Gilles Dowek, INRIA, France Kerstin Eder, University of Bristol, United Kingdom Carlo Alberto Furia, ETH Zurich, Switzerland Sebastien Gerard, CEA LIST, France Mark Grechanik, University of Illinois at Chicago, United States Lindsay Groves, Victoria University of Wellington, New Zealand Lars Grunske, Swinburne University of Technology, Australia Esther Guerra, Universidad Aut?noma de Madrid, Spain Fei He, Tsinghua University, China Moonzoo Kim, KAIST, South Korea Joseph Kiniry, IT University of Copenhagen, Denmark Daniel Kroening, Oxford University, United Kingdom Ralf Laemmel, Universit?t Koblenz-Landau, Germany Regine Laleau, Paris Est Creteil University, France Phillip Laplante, Pennsylvania State University, United States Kung-Kiu Lau, The University of Manchester, United Kingdom Yuan-Fang Li, Monash University, Australia Xiaohong Li, Tianjin University, China Peter Lindsay, The University of Queensland, Australia Yang Liu, Nanyang Technological University, Singapore Gerald Luettgen, University of Bamberg, Germany Tiziana Margaria, University of Potsdam, Germany Andrew Martin, University of Oxford, United Kingdom Julie Mccann, Imperial College, United Kingdom Dominique Mery, Universit? de Lorraine, LORIA Raffaela Mirandola, Politecnico di Milano, Italy Jun Pang, University of Luxembourg, Luxembourg Isabelle Perseil, Inserm, France Robert Pettit, The Aerospace Corporation, USA Bernhard Rumpe, RWTH Aachen University, Germany Ricardo Sanz, Universidad Politecnica de Madrid, Spain Cristina Seceleanu, M?lardalen University, V?ster?s, SWEDEN Janet Smart, University of Oxford, United Kingdom Volker Stolz, University of Oslo, Norway Jing Sun, University of Auckland, New Zealand Clemens Szyperski, Microsoft Research, United States Kenji Taguchi, AIST, Japan Dalila Tamzalit LINA Laboratory, University of Nantes, France Tullio Vardanega University of Padua, Italy Xinyu Wang, Zhejiang University, China Chao Wang, Virginia Tech, United States Hai H. Wang, University of Aston, United Kingdom Bow-Yaw Wang, Academia Sinica, Taiwan Bechir Zalila, ReDCAD Laboratory, University of Sfax, Tunisia Naijun Zhan, Chinese Academy of Sciences, China Huibiao Zhu, East China Normal University, China Steffen Zschaler, King's College London, United Kingdom From HANAC at il.ibm.com Tue Oct 23 13:13:58 2012 From: HANAC at il.ibm.com (Hana Chockler) Date: Tue, 23 Oct 2012 19:13:58 +0200 Subject: [TYPES/announce] CAV 2013 - Call for Papers Message-ID: ====== CALL FOR PAPERS ===== 25th International Conference on Computer Aided Verification (CAV 2013) July 13-19, 2013 St. Petersburg, Russia Program Chairs: Natasha Sharygina and Helmut Veith Website: http://cav2013.forsyte.at/ Aims and Scope ------------------- The conference on Computer Aided Verification (CAV), 2013, is the 25th 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 - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Verification methods for parallel and concurrent hardware/software systems - Testing and runtime analysis based on verification technology - Applications and case studies in verification - Decision procedures and solvers for verification - Mathematical and logical foundations of practical verification tools - Verification in industrial practice - Algorithms and tools for system synthesis - Hybrid systems and embedded systems verification - Verification techniques for security - Formal models and methods for biological systems Following the example of 2012, CAV will again have *special tracks* in four areas: 1. Hardware Verification (track chair: Armin Biere) 2. Computer Security (track chair: Somesh Jha) 3. SAT and SMT (track chair: Nikolaj Bjoerner) 4. Biology (track chair: Jasmin Fisher) 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. In addition, CAV 2013 will also have a track chair for tool papers: 5. Tool Papers (track chair: Roderick Bloem) Events --------- The conference will include the following events: * Pre-conference workshops on July 13-14. * The main conference will take place July 15th-19th: * Invited tutorials on July 15th. * Technical sessions on July 16-19. 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. 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. B. Tool Presentations: Submissions, not exceeding six (6) pages using Springer's LNCS format, should describe the implemented tool, its novel features, and possibly an experimental evaluation. 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. We strongly encourage authors to make their tools and benchmarks available with their submission. Papers exceeding the stated maximum length run the risk of rejection without review. 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 should not contain information necessary to the understanding and the evaluation of the presented work. Note that the page limit for submissions has been increased to 16 pages including references. 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://cav2013.forsyte.at Important Dates - Abstract submission: January 3, 2013 - Paper submission (firm): January 7, 2013 anywhere on earth - Author feedback/rebuttal period: February 20-22, 2013 - Notification of acceptance/rejection: March 6, 2013 - Final version due: April 6, 2013 Program Chairs ------------------ Natasha Sharygina, University of Lugano, Switzerland Helmut Veith, Vienna University of Technology, Austria Program Committee --------------------- Rajeev Alur (Univ. Pennsylvania) Domagoj Babic (UC Berkeley) Armin Biere (JKU Linz) Nikolaj Bjorner (Microsoft Research) Roderick Bloem (TU Graz) Ahmed Bouajjani (LIAFA, Univ. of Paris 7) Aaron Bradley (CU Boulder) Hana Chockler (IBM) Byron Cook (Microsoft Research, Univ. College London) Vincent Danos (The University of Edinburgh) Anupam Datta (Carnegie Mellon Univ.) Javier Esparza (TU Munich) Azadeh Farzan (Univ. of Toronto) Bernd Finkbeiner (Saarland Univ.) Jasmin Fisher (Microsoft Research) Radu Grosu (TU Vienna) Ari Gurfinkel (Carnegie Mellon Univ.) William Hung (Synopsys Inc) Susmit Jha (Intel) Somesh Jha (Univ. of Wisconsin) Barbara Jobstmann (CNRS, Verimag, Jasper DA) Bengt Jonsson (Uppsala Univ.) Rajeev Joshi (NASA JPL) Joost-Pieter Katoen (RWTH Aachen) Robert P. Kurshan (Cadence Design Systems) Benjamin Livshits (Microsoft Research) Rupak Majumdar (Max Planck Institute) Ken Mcmillan (Microsoft Research) Kedar Namjoshi (Bell Labs) Joel Ouaknine (Oxford Univ.) Madhusudan Parthasarathy (Univ. of Illinois at Urbana-Champaign) Corina Pasareanu (Carnegie Mellon Univ., NASA Ames) Andreas Podelski (Univ. of Freiburg) Natasha Sharygina (Univ. of Lugano) Nishant Sinha (IBM) Anna Slobodova (Centaur Technology) Murali Talupur (Intel) Stavros Tripakis (UC Berkeley) Helmut Veith (TU Vienna) Mahesh Viswanathan (Univ. of Illinois at Urbana-Champaign) Thomas Wahl (Northeastern Univ.) Georg Weissenbacher (TU Vienna) Eran Yahav (Technion) 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 2013 CAV Award Committee consists of Rajeev Alur (Chair) Marta Kwiatkowska Aarti Gupta Ahmed Bouajjani The nominations should be sent to Rajeev Alur at alur at seas.upenn.edu. Nominations must be received by January 7, 2013. From rbocchin at cs.cmu.edu Tue Oct 23 15:40:32 2012 From: rbocchin at cs.cmu.edu (Robert Bocchino) Date: Tue, 23 Oct 2012 15:40:32 -0400 Subject: [TYPES/announce] WoDet 2013: Call for Papers Message-ID: <24C6BCB5-940F-4D89-8630-9D6D50091F4C@cs.cmu.edu> WODET 2013 Fourth Workshop on Determinism and Correctness in Parallel Programming wodet.cs.washington.edu Houston, Texas, 17 March 2013 Co-located with ASPLOS 2013 Call for Papers IMPORTANT DATES Submission: Monday, 17 December 2012 Notification: Tuesday, 29 January 2013 Final Version Due: Friday, 1 March 2013 DESCRIPTION There is a growing consensus that parallel programming can benefit from safety properties such as determinism and race freedom, but the debate over which properties to provide, and how to provide them, is far from settled. Many open questions remain: What are the performance and programmability trade-offs for providing a particular safety property? Which properties strike the right balance between eliminating or identifying bugs and restricting the programmer? How can we support code that needs to violate safety properties for performance or expressivity reasons? How can each layer of the system stack contribute to these goals? These questions are increasingly urgent as more and more computing goes parallel, from cell phones to data centers. The Workshop on Determinism and Correctness in Parallel Programming (WoDet) is an across-the-stack forum to discuss the role of a wide range of correctness properties in parallel and concurrent programming. While determinism is an important theme, the scope of the workshop includes other correctness properties for parallel programs and systems. The workshop will be a full day event with invited talks and technical sessions for short peer-reviewed papers discussing ideas, positions, or preliminary research results. SCOPE In addition to answers to the questions above, topics of interest include: Language support for disciplined parallel programming Architecture, operating system, runtime system and compiler support for parallel program correctness Concurrency debugging techniques New properties of parallel programs Limit studies and empirical studies of the cost of safety properties Studies of the applicability of correctness properties in parallel programs and algorithms Concurrency bug avoidance techniques Real-world experience with safe parallel programming models, systems, or tools SUBMISSION Authors are invited to submit original and unpublished work that exposes a new problem, advocates a specific solution, or reports on actual experience. Papers should be submitted using the standard two-column ACM SIG proceedings or SIG alternate template, and are limited to 6 pages (including figures, tables and references). Final papers will be made available to participants electronically at the meeting, but to facilitate resubmission to more formal venues, no archival proceedings will be published, and papers will not be sent to the ACM Digital Library. Authors will be given the option of having their final paper accessible from the workshop website. ORGANIZERS Robert Bocchino, Carnegie Mellon University Joseph Devietti, University of Pennsylvania PROGRAM COMMITTEE Vikram Adve, UIUC Lars Birkedal, IT University of Copenhagen Robert Bocchino, Carnegie Mellon University Sebastian Burckhardt, MSR Luis Ceze, University of Washington Joseph Devietti, University of Pennsylvania Steven Freund, Williams College Ranjit Jhala, UCSD Satish Narayanasamy, University of Michigan Kunle Olokutun, Stanford University Josep Torellas, UIUC Edwin Westbrook, Rice University -------------- next part -------------- An HTML attachment was scrubbed... URL: From ndanner at wesleyan.edu Tue Oct 23 21:06:26 2012 From: ndanner at wesleyan.edu (Norman Danner) Date: Tue, 23 Oct 2012 21:06:26 -0400 Subject: [TYPES/announce] Assistant professor position at Wesleyan University Message-ID: <50873F12.4080807@wesleyan.edu> [ The targeted areas for this position includes databases, and we would be happy to have candidates with strong backgrounds in types and programming languages. Please feel free to contact me (Norman Danner) if you have any questions about the position. ] The Department of Mathematics and Computer Science at Wesleyan University invites applications for a tenure track assistant professorship in Computer Science to begin in the academic year 2013-2014. Candidates must possess, or be close to completing, a Ph.D.degree, and must have strong records in both research and teaching. We encourage candidates in all areas of Computer Science to apply, but especially encourage candidates in databases, machine learning, and computer graphics. Teaching duties will be three courses per year. To ensure full consideration applications must be received by December 1, 2012, and include a cover letter, curriculum vitae, research statement, teaching statement and at least three letters of recommendation, one of which discusses teaching. Applications must be submitted online at academicjobsonline.org. Other correspondence regarding this position may be sent by email to csjob at wesleyan.edu or to Computer Science Search Committee, Department of Mathematics and Computer Science, Wesleyan University, Middletown, CT 06459. For more information about the Department please visit http://www.wesleyan.edu/mathcs/. Wesleyan University is an equal opportunity employer who welcomes applications from women and historically underrepresented minority groups. Inquiries regarding Title IX, Section 504, or any other non-discrimination policies should be directed to: Sonia Manjon, PhD, Chief Diversity Officer, smanjon at wesleyan.edu. -- Norman Danner - ndanner at wesleyan.edu - http://ndanner.web.wesleyan.edu Department of Mathematics and Computer Science - Wesleyan University From jonathan at yorku.ca Tue Oct 23 21:21:05 2012 From: jonathan at yorku.ca (Jonathan S. Ostroff) Date: Tue, 23 Oct 2012 21:21:05 -0400 Subject: [TYPES/announce] Faculty position in Software Engineering at York University Message-ID: Faculty Opening in Software Engineering York University, Toronto, Canada seeks an outstanding candidate in Software Engineering to commence on July 1, 2013. The position calls for research excellence in Software Engineering with an emphasis on mission critical systems, dependable safety critical systems, industrial strength formal methods for software systems, high assurance business and mobile systems, and rigorous methods for verifying, validating and certifying software systems. Outstanding candidates in all areas of software engineering are invited to apply. The rank is open and commensurate with experience. This position will play a key role in the development of the software engineering program within the Lassonde School of Engineering. York University offers a world-class, modern, interdisciplinary academic experience in Toronto, Canada?s most multicultural city. York is at the centre of innovation, with a thriving community of 62,000 students, faculty and staff, as well as over 250,000 alumni worldwide. York?s 11 Faculties and 28 research centres are committed to providing an engaged learning and research environment that cuts across traditional academic boundaries. The Lassonde School of Engineering currently offers fully accredited and innovative programs in Computer Engineering, Geomatics Engineering, and Space Engineering. We are currently expanding with new programs in Software Engineering, Electrical Engineering, Mechanical Engineering, Civil Engineering, and Chemical Engineering. The Software Engineering position will be in York?s Department of Computer Science and Engineering (to be renamed Department of Electrical Engineering and Computer Science) which is a leading academic and research department in Canada with 45 research-active faculty members, offering a range of undergraduate programs in Computer Science, Computer Engineering, Software Engineering, Digital Media, and Computer Security, as well as research intensive MSc and PhD degrees in Computer Science and Engineering. Applications must be received by November 15, 2012 along with a CV, statement of contribution to research, teaching, and curriculum development, and three reference letters at: Chair, Search Committee for Software Engineering, Lassonde School of Engineering, York University, 4700 Keele Street, Toronto, ON, Canada M3J 1P3, Tel: (416) 650-8135, Email: eng at yorku.ca. For further details, please visit the URL http://www.yorku.ca/acadjobs. http://www.cse.yorku.ca/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From tase2013 at aston.ac.uk Thu Oct 25 07:29:16 2012 From: tase2013 at aston.ac.uk (TASE 2013) Date: Thu, 25 Oct 2012 11:29:16 +0000 Subject: [TYPES/announce] 2nd CFP for TASE 13, 1 - 3 July 2013, Birmingham, UK Message-ID: The 7th International Symposium on Theoretical Aspects of Software Engineering - TASE 2013 1st - 3rd July 2013, Aston University Conference Centre, Birmingham, UK 2nd Call for Papers Dear Colleagues, On behalf of the organizing committee, we are pleased to invite you to submit papers to the 7th International Symposium on Theoretical Aspects of Software Engineering (TASE 2013). We apologise for any eventual cross-posting and we cordially encourage you to forward this call for papers to all of your colleagues and students who might be interested. Overview Software engineering is at the heart of many state of the art tools designed to simplify and improve our lives, including cloud computing applications, the semantic web and self-configuring systems. As these instruments are involved in fields of vital importance, by providing customised solutions for education, businesses, government and health care, the role played by the theory behind their working principles bears an undeniable weight. In this context, the TASE International Symposium strives to provide top scientists with a framework for communicating their latest and most valuable theoretical results in the field of software engineering. Subject Areas We invite contributions concerning the theoretical aspects of the following areas (please note that this is not an exhaustive list): * model driven software engineering * component based software engineering * service oriented and cloud computing * semantic web and web services * software security, reliability, simulation and verification * probabilistic fundamentals of software engineering * embedded and real time software systems * program logics and underlying mathematical issues * aspect, rule and object oriented software design * self-configuring software systems * reverse engineering Paper Submission System We invite all prospective authors to submit their manuscripts via the TASE13 portal, hosted on Easychair at: https://www.easychair.org/conferences/?conf=tase2013 Further instructions for authors (e.g. paper format and length) will be communicated at a later date. Important Dates Title and abstract submission: 18 January 2013 Paper submission: 25 January 2013 Acceptance/rejection notification: 22 March 2013 Camera-ready version submission: 26 April 2013 Contact tase2013 at aston.ac.uk www.aston.ac.uk/tase2013 Alternative Formats A PDF version of this CFP is available on the symposium website or by following this link: http://www1.aston.ac.uk/EasySiteWeb/GatewayLink.aspx?alId=128755 We are looking forward to receiving your submissions. Hai Wang Richard Banach Program Chairs, TASE 2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: From might at cs.utah.edu Thu Oct 25 20:19:08 2012 From: might at cs.utah.edu (Matt Might) Date: Thu, 25 Oct 2012 18:19:08 -0600 Subject: [TYPES/announce] PLDI 2013: Final Call for Papers Message-ID: *** IMPORTANT DATES *** Paper submission: 11 November 2012 (16 days away!) Rebuttal period: 15-17 January 2013 Notification: 5 February 2013 URL: http://pldi2013.ucombinator.org/ *** INFORMATION *** PLDI is a forum for the exchange of information on programming languages, their design, implementation, development, and use. PLDI emphasizes innovative and creative approaches to compile-time and runtime technology, novel language designs and features, and results from implementations. Papers are solicited on, but not limited to, the following topics: + Language designs and extensions + Static and dynamic analysis of programs + Domain-specific languages and tools + Type systems and program logics + Program transformation and optimization + Checking or improving the security or correctness of programs + Memory management + Parallelism, both implicit and explicit + Performance analysis, evaluation, and tools + Novel programming models + Debugging techniques and tools + Program understanding + Interaction of compilers/runtimes with underlying systems + Program synthesis Submissions must be in ACM SIGPLAN proceedings format, 9-point type, and may not exceed 10 pages (all inclusive). Submissions should be written to allow for double-blind reviewing. For full submission guidelines, please refer to the web page: http://pldi2013.ucombinator.org/ TOPLAS session This year's PLDI will include a session presenting recent TOPLAS papers. Original papers submitted to TOPLAS before October 1, 2012 can be considered for presentation at PLDI 2013; authors should put a note in their cover letter to indicate interest. These papers will not appear in the PLDI proceedings. For more information, see http://compilers.cs.ucla.edu/toplas/index.html On behalf of the PLDI 2013 organizers, Hans Boehm (General Chair) Cormac Flanagan (Program Chair) From bpientka at cs.mcgill.ca Thu Oct 25 22:34:22 2012 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Thu, 25 Oct 2012 22:34:22 -0400 Subject: [TYPES/announce] Postdoc/Research Associate in logical frameworks Message-ID: ================================================== POSTDOC/RESEARCH ASSOCIATE IN LOGICAL FRAMEWORKS School of Computer Science McGill University, Montreal, Canada ================================================= We have a one year postdoc/research associate position (possible extension for a second year) 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. We in particular are looking for applicants who will actively participate in the implementation and development of the Beluga language, a dependently typed programming and proof environment. The position is funded through the Canadian and the Quebec government at the same levels as the federal and provincial scholarships and are part of two related project: * Proofware: establishing trustworthy computing through programming with proofs * Promis : Th?orie des preuves ? la pratique de la d?monstration automatique The postdoc/research associate position is available immediately and we are looking to fill it by 1 Feb, 2013. 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 agout graduate and postgraduate studies: http://www.cs.mcgill.ca/prospective-students/graduate/GeneralInfo http://www.mcgill.ca/gps/postdocs If interested, send a brief research statement, CV to Brigitte Pientka (bpientka at cs.mcgill.ca) by 15 Nov, 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 ups at upb.de Fri Oct 26 03:57:16 2012 From: ups at upb.de (Ulf-Peter Schroeder) Date: Fri, 26 Oct 2012 09:57:16 +0200 Subject: [TYPES/announce] CfN for the EATCS Award 2013 Message-ID: <508A425C.1040002@upb.de> ************************************************ * Call for Nominations * * The EATCS Award 2013 * ************************************************ The European Association for Theoretical Computer Science (EATCS) annually honours a respected scientist from our community with the prestigious EATCS Distinguished Achievement Award. The award is given to acknowledge extensive and widely recognized contributions to theoretical computer science over a life long scientific career. For the EATCS Award 2013, candidates may be nominated to the Award Committee consisting of: Leslie Ann Goldberg (University of Liverpool) Vladimiro Sassone (University of Southampton) Friedhelm Meyer auf der Heide (University of Paderborn) The deadline for nominations is December 31, 2012. Nominations will be kept strictly confidential. They should include supporting justification and be sent by e-mail to the chairman of the EATCS Award Committee: Friedhelm Meyer auf der Heide University of Paderborn F?rstenallee 11 33102 Paderborn, Germany Email: fmadh at upb.de Previous recipients of the EATCS Award are R.M. Karp (2000) C. B?hm (2001) M. Nivat (2002) G. Rozenberg (2003) A. Salomaa (2004) R. Milner (2005) M. Paterson (2006) D.S. Scott (2007) L.G. Valiant (2008) G. Huet (2009) K. Mehlhorn (2010) B. Trakhtenbrot (2011) M.Y. Vardi (2012) The next award will be presented during ICALP 2013 in Riga, Latvia. From bmuller at glam.ac.uk Sat Oct 27 18:21:48 2012 From: bmuller at glam.ac.uk (Muller B (AT)) Date: Sat, 27 Oct 2012 22:21:48 +0000 Subject: [TYPES/announce] 1st CfP Logics, Agents, and Mobility (LAM'13) Message-ID: <889BB507-1427-4782-809E-DE8A5D0FD1BC@glam.ac.uk> *** 1st CALL FOR PAPERS *** 6th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM?13), 2?5 April 2013, University of Exeter, United Kingdom organised as symposium at the AISB Annual Convention 2013 (http://emps.exeter.ac.uk/computer-science/research/aisb/) Organisers: Berndt ?Bertie? M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://lam2013.wordpress.com * Workshop Purpose * The aim of this series of workshops is to bring together active researchers in the areas of logics and other formal frameworks on the one hand, and mobile systems on the other hand. The main focus is on the field of applications of logics and calculi for mobile agents, smart intelligent solutions and multi-agent systems. Many notions used in the theory of agents are derived from philosophy, logic, and linguistics (belief, desire, intention, speech act, etc.), and interdisciplinary discourse has proved fruitful for the advance of this domain. Outside of academia, the deployment of large-scale pervasive infrastructures (mobile ad-hoc networks, mobile devices, RFIDs, etc.) is becoming a reality. This raises a number of scientific and technological challenges for the software modelling and programming models for such large-scale, open and highly-dynamic distributed systems. The agent and multi-agent systems approach seems particularly adapted to tackle this challenge, but there are many issues remaining to be investigated. For instance, the agents must be location-aware since the actual services available to them may depend on their (physical or virtual) location. The quality and quantity of resources at their disposal is also largely fluctuant, and the agents must be able to adapt to such highly dynamic environments. Moreover, mobility itself raises a large number of difficult issues related to safety and security, which require the ability to reason about the software (e.g. for analysis or verification). Logics and type systems with temporal or other kinds of modalities (relating to location, resource and/or security-awareness) play a central role in the semantic characterisation and then verification of properties about mobile agent systems. There are still many open problems and research questions in the theory of such systems. The workshop is intended to showcase results and current work being undertaken in these areas with a focus on logics for specification and verification of dynamic, mobile systems. The topics of interest lie in the area of logics and concurrent systems with a focus on the special application domain of mobile systems and (multi-)agent-based systems, such as: * Applications of logics and/or multi-agent systems * Smart/intelligent solutions * Models of concurrency * Models of resource-bounded systems * Models of location-based reasoning * Logics for concurrency with a perspective on mobility * Models of mobile systems * Verification and analysis techniques * Related programming models Scopes of Interest * applications of MAS * logics for specification and reasoning about agents, MAS, and mobile systems * treatment of location and resources in logics * security (e.g., in ad-hoc networks) * temporal logics and model checking * type systems and static analysis * logic programming * concurrency theory with a focus on mobility or dynamics in agent systems. * Previous Workshops * LAM?08: 4?8 August 2008 at ESSLI in Hamburg, Germany LAM?09: 10 August 2009 at LICS in Los Angeles, USA LAM?10: 15 July 2010 at LICS in Edinburgh, Scotland, UK LAM?11: 10 September 2011 at CONCUR in Aachen, Germany LAM?12: 25 June 2012 at Petri Nets 2012, Hamburg, Germany * Format of the Workshop * The workshop will be held as a one day of the convention. There will be a short introduction and brief survey of the field by the organisers as an introduction to the workshop. The workshop will contain invited talks, contributed talks, and will offer opportunities for discussion. The latter will give the participants a chance to discuss informally research directions, open problems, and possible co-operations. * Invited Speakers * [To be announced.] * Submission details * Authors are invited to submit a full paper of original work in the areas mentioned above. The workshop chair should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper will be expected to present it at the LAM?13 workshop. 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=lam13 The submissions will be reviewed by the workshop?s program committee and additional reviewers. Accepted papers will appear in electronic proceedings and authors will be encouraged to re-submit papers to formal proceedings to be published as a separate publication, e.g. as a special journal issue. * Important Dates * Submission Deadline: 14th January 2013 Notification of acceptance/rejection: 11 February 2013 Final version of papers due: 4 March 2013 Workshop: 2?5 April 2013 (one-day workshop) From stoller at cs.stonybrook.edu Sun Oct 28 11:30:13 2012 From: stoller at cs.stonybrook.edu (Scott Stoller) Date: Sun, 28 Oct 2012 15:30:13 +0000 Subject: [TYPES/announce] SPIN 2013 CFP Message-ID: <6F9CEB53469FAC479C4864C7DE38F14A49B5D1CD@mail2.cs.stonybrook.edu> International SPIN Symposium on Model Checking of Software - SPIN 2013 Stony Brook, NY, USA, July 8-9 2013 Marking the 20th Anniversary of the International SPIN Workshop http://spin2013.cs.sunysb.edu/ IMPORTANT DATES Submission of abstracts: 4 March 2013 AoE (Anywhere on Earth) Submission of full papers: 8 March 2013 AoE (Anywhere on Earth) Notification of acceptance/rejection: 15 April 2013 Final version due: 24 April 2013 Symposium: 8-9 July 2013 AIMS AND SCOPE The SPIN Symposium is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. Theoretical techniques and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker, or other tools or techniques based on the combination of explicit representations with other representations, are the focus of this symposium. We particularly welcome papers describing the development and application of state space exploration techniques in testing and verifying embedded software, security-critical software, enterprise and web applications, and other interesting software platforms. The symposium aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: Formal verification techniques for automated analysis of software Algorithms and storage methods for explicit-state model checking Theoretical and algorithmic foundations of model checking Model checking for programming languages and code analysis Directed model checking using heuristics Parallel or distributed model checking Verification of timed and probabilistic systems Model checking techniques for biological systems Formal verification techniques for concurrent software Formal verification techniques for embedded software Abstraction and symbolic execution techniques in relation to software verification Static analysis for state space reduction Combinations of enumerative and symbolic techniques Analysis for modeling languages, such as UML/state charts Property specification languages, including temporal logics Automated testing using state space and/or path exploration Derivation of specifications, test cases, or other useful material from state spaces Combination of model checking techniques with other analyses Modular and compositional verification techniques Case studies of interesting systems or with interesting results Engineering and implementation of software verification tools Benchmark and comparative studies for formal verification tools Insightful surveys or historical accounts on topics of relevance to the symposium BEST PAPER AWARD The Program Committee of SPIN 2013 will give this year a best paper award. The Best Paper Award recipient is given public recognition and will receive one high-end NVIDIA K20 GPU coprocessor, donated by NVIDIA. INVITED SPEAKER Dirk Beyer (University of Passau, Germany), Conditional Model Checking INVITED TUTORIAL Gerard Holzmann (NASA/JPL, USA), Automatic Model Extraction from C Code PAPER SUBMISSION AND PUBLICATION The proceedings of SPIN will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series. Authors of selected papers will be invited to submit an extended version to appear in a special issue of the International Journal on Software Tools for Technology Transfer (STTT). With the exception of survey and history papers, the papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 We solicit two kinds of papers: Technical Papers: At most 18 pages in LNCS format. All accepted technical papers will be included in the proceedings. Tool Presentations: This kind of submission should consist of two parts: the first part is at most a 5 page description of the tool. If accepted, this part will be published in the symposium proceedings. The second part should describe an informal plan for an oral presentation of the tool. This part will not be included in the proceedings. For submission instructions, please see the symposium website: http://spin2013.cs.sunysb.edu/ At least one author of each accepted paper must attend the symposium and present the paper. ORGANIZATION General chair Scott A. Smolka (Stony Brook University, USA) Program chairs Ezio Bartocci (Vienna University of Technology, Austria) C. R. Ramakrishnan (Stony Brook University, USA) Publicity chair Scott D. Stoller (Stony Brook University, USA) Program Committee Gogul Balakrishnan (NEC Labs, USA) Paolo Ballarini (Ecole Centrale Paris, France) Ezio Bartocci (TU Wien, Austria) [PC co-chair] Armin Biere (Johannes Kepler University, Austria) Marsha Chechik (University of Toronto, Canada) Hana Chockler (IBM, Israel) Giorgio Delzanno (University of Genova, Italy) Alastair Donaldson (Imperial College London, UK) Dimitra Giannakopoulou (NASA Ames, USA) Patrice Godefroid (Microsoft Research, USA) Radu Grosu (TU Wien, Austria) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Stefan Leue (University of Konstanz, Germany) Madanlal Musuvathi (Microsoft Research, Redmond, USA) David Parker (University of Birmingham, UK) C. R. Ramakrishnan (Stony Brook University, USA) [PC co-chair] S Ramesh (General Motors Global R&D, India) Stefan Schwoon (ENS Cachan, France) Scott A. Smolka (Stony Brook University, USA) [General Chair] Oleg Sokolsky (University of Pennsylvania, USA) Scott D. Stoller (Stony Brook University, USA) Stravos Tripakis (UC Berkley, USA) Helmuth Veith (TU Wien, Austria) Farn Wang (National Taiwan University, Taiwan) Lenore D. Zuck (University of Illinois at Chicago, USA) Steering Committee Dragan Bosnacki (Eindhoven University of Technology, Netherlands) Susanne Graf (CNRS/VERIMAG, France) Gerard Holzmann (chair) (NASA/JPL, USA) Stefan Leue (University of Konstanz, Germany) Willem Visser (University of Stellenbosch, South Africa) From konnov at forsyte.tuwien.ac.at Mon Oct 29 08:30:58 2012 From: konnov at forsyte.tuwien.ac.at (Igor Konnov) Date: Mon, 29 Oct 2012 13:30:58 +0100 Subject: [TYPES/announce] Call for workshop proposals at CAV13 Message-ID: <508E7702.4040105@forsyte.tuwien.ac.at> [ Our apologies if you receive multiple copies of this call ] ***** CALL FOR WORKSHOP PROPOSALS ***** 25th International Conference on Computer Aided Verification (CAV 2013) July 13-19, 2013, Saint Petersburg, Russia Website: http://cav2013.forsyte.at/ The 2013 Computer-Aided Verification (CAV) Workshops provide an opportunity for participants to discuss topics in the broader verification related domains. CAV 2013 Workshops will be held before the main conference on July 13 and 14. Workshop proposals will be reviewed by the workshop chair along with the program chairs and members of the steering committee. Proposals must consist of the following two parts: -- Part I: Technical Information -- A short (about 1 page) scientific justification of the proposed topic, its significance and relevance to CAV, and the particular benefits of the workshop to the verification community, as well as a list of previous or related workshops (if relevant). -- Part II: Organizational Information -- - contact information of the workshop organizers - identifying a main contact for the workshop (i.e. a workshop chair) - the desired length of the workshop, (one or two days) - estimate of the audience size - proposed format and agenda (for example, demo sessions, tutorials, etc.) - potential invited speakers - procedures for selecting papers and participants - plans for dissemination, if any (for example, special issues of journals) - special technical, AV, or USB stick needs - links to a preliminary website of the workshop and call for papers (if possible) - information if workshop has been previously held Important Dates: Proposals are due by Nov 23, 2012 by email to the workshop chair. Organizers will be notified by Nov 30, 2012. The workshop proposals will be reviewed and evaluated on the following criteria: * Potential to advance state of the art in verification technologies, especially ability to break new ground. * Relevance to CAV. * Overlap of topics with other proposed workshops. * Past-successes of the workshop and association with previous CAV conferences. * Organizers' ability and experience to lead a successful workshop. All accepted workshops will be asked to provide a webpage, call for papers, and list of invited speakers. The workshop participants will be required to register for the workshop through the CAV main registration page. The registration rates for workshops will be set by CAV organizers in consultation with the workshop organizers, following rate structures similar to (but not the same as) those followed in the past. The workshop organizers are strongly encouraged to seek external funding and sponsorships. For further enquiries or information, please contact: Igor Konnov (CAV2013 Workshop Chair) Vienna University of Technology, Institute of Information Systems 184 Favoritenstrasse 9-11, 1040 Vienna, Austria email: konnov AT forsyte.at http: http://forsyte.tuwien.ac.at/people/konnov/ Phone: +43-158801-184807 From pangjun at gmail.com Mon Oct 29 08:49:24 2012 From: pangjun at gmail.com (Jun PANG) Date: Mon, 29 Oct 2012 13:49:24 +0100 Subject: [TYPES/announce] ESSS workshop 2013 -- 1st Call for Papers Message-ID: ================================================== 2nd International Workshop on Engineering Safety and Security Systems March 18, 2013, Luxembourg Co-located with ICST 2013 in Luxembourg, March 18-22, 2013 More information: http://www.comp.nus.edu.sg/~pat/esss2013/ =================================================== Important dates ----------------- * December 21st 2012: Submission deadline * January 28th 2013: Notification of acceptance/rejection * March 18th 2013: Workshop Introduction of the Workshop ----------------- The International Workshop on Engineering Safety and Security Systems (ESSS) aims at contributing to the challenge of constructing reliable and secure systems. The workshop covers areas such as formal specification, (extended) type checking, model checking, program analysis/transformation, model-based testing and model-driven software construction. The workshop will bring together researchers and industry R&D expertise together to exchange their knowledge, discuss their research findings, and explore potential collaborations. Theme of the Workshop ----------------- The main theme of the workshop is methods and techniques for constructing large reliable and secure systems. The goal of the workshop is to establish a platform for the exchange of ideas, discussion, cross-fertilization, inspiration, co-operation, and dissemination. The topics of the workshop include, but are not limited to: -- methods, techniques and tools for system safety and security -- methods, techniques and tools for analysis, certification, and debugging of complex safety and security systems -- model-based and verification-based testing -- emerging application domains such as cloud computing and cyber-physical systems -- case studies and experience reports on the use of formal methods for analyzing safety and security systems Submissions guidelines ----------------- Paper submissions must be original, unpublished work. Submissions should be in made via the Easychair site: https://www.easychair.org/conferences/?conf=esss2013. Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html). Papers should not exceed 6 pages for full papers and 2 pages for short papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All workshop papers will be published in the IEEE Digital Library in the form of a post-proceedings. A pre-workshop version of the papers will be available on the workshop website prior. Publication of accepted articles requires the commitment of one of the authors to register for the workshop and present the paper. General chair ----------------- Sjouke Mauw, University of Luxembourg, Luxembourg Program chairs ----------------- Yang Liu, Nanyang Technological University, Singapore Jun Pang, University of Luxembourg, Luxembourg Program committee ----------------- Etienne Andre, Universite Paris 13, France Cyrille Artho, AIST, Japan Marieke Huisma, University of Twente, The Netherlands Weiqiang Kong, Kyushu University, Japan Keqin Li, SAP Research, France Yang Liu, Nanyang Technological University, Singapore Zhiming Liu, UNU/IIST Macao, China Sjouke Mauw, University of Luxembourg, Luxembourg Jun Pang, University of Luxembourg, Luxembourg Geguang Pu, East China Normal University, China Mohammad Torabi Dashti, ETH Zurich, Switzerland Anton Wijs, Eindhoven University of Technology Yoriyuki Yamagata, AIST, Japan From jhala at cs.ucsd.edu Mon Oct 29 11:26:22 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Mon, 29 Oct 2012 08:26:22 -0700 Subject: [TYPES/announce] Call For Papers: OBT 2013 Message-ID: <6F2ADC36-AC34-48FF-8DC0-C9079FF4E4B8@cs.ucsd.edu> (Apologies for multiple copies. Deadline next week, submit!) Off the Beaten Track: New Frontiers for Programming Languages Research ====================================================================== http://goto.ucsd.edu/~rjhala/OBT2013/ (Co-located With POPL 2013: Rome, Italy) Important Dates --------------- * Paper Submission : Nov 5, 2012 (Monday) * Notification : Dec 3, 2012 (Monday) * Workshop : Jan 26, 2013 (Saturday) Background ---------- Programming language researchers have the principles, tools, algorithms and abstractions to solve all kinds of problems, in all areas of computer science. However, identifying and evaluating new problems, particularly those that lie outside the typical core PL problems we all know and love, can be a significant challenge. Hence, the goal of this workshop is to identify and discuss problems that do not often show up in our top conferences, but where programming language researchers can make a substantial impact. The hope is that by holding such a forum and associating it directly with a top conference like POPL, we can slowly start to increase the diversity of problems that are studied by PL researchers and that by doing so we will increase the impact that our community has on the world. While many workshops associated with POPL have become more like mini-conferences themselves, this is not our goal. Instead, the workshop will be informal and structured to encourage discussion. It will also be centered around problems and problem areas as opposed to fully-formed solutions. Topics ------ A good submission is one that outlines a new problem or an interesting, underrepresented problem domain. Good submissions may also remind the PL community of problems that were once in vogue but have not recently been seen in top PL conferences. Good submissions do not need to propose complete or even partial solutions, though there should be some reason to believe that programming languages researchers have the tools necessary to search for solutions in the area at hand. Submissions that seem likely to stimulate discussion about the direction of programming language research are encouraged. Possible topics include any of the following. + Biology, chemistry, or other natural sciences + Art, music, graphics and animation + Networking, cloud computing, systems programming + Linguistics + Economics, law, politics or other social sciences + Web programming, social computing + Algorithms and complexity + Mathematics, statistics + Machine learning or artificial intelligence + Education + Unusual compilers; underrepresented programming languages + **Surprise us!** We certainly hope to see submissions on topics not mentioned above. The goal of the workshop is to be inclusive, not exclusive. Submissions are evaluated on the basis of creativity, novelty, clarity, possible impact and potential for stimulating discussion. Authors concerned about the appropriateness of a topic are strongly encouraged to consult the Program Chair prior to submission. Submission Information ---------------------- There are two kinds of submissions. In either case, authors should not assume that reviewers will be experts in the particular area of the submission -- indeed, they will most likely *not* be. Hence, all submissions should be accessible to a wide range of PL researchers. All submissions should be in PDF in at least 10pt font, printable on US Letter paper. Authors are free to include links to multimedia content such as youtube videos or online demos. Reviewers may or may not view linked documents (it is up to authors to convince them to do so in their submission. + **Submissions for 5-minute talks:** Authors will submit a **1-page** PDF document. 5-minute talks will be followed by 5-15 minutes of discussion. + **Submissions for longer talks:** Authors will submit at most a **2-page** PDF document. Put the words *"Full Presentation"* in the title of your submission if you would like a longer talk. By default, we will assume a short, 5-minute presentation if the title does not contain these words and is 1 PDF page or less. Longer talks may be up to 1/2 an hour in length. The length will depend on the submissions received and how the program committee decides to assemble the program. Longer talks will be followed by 5-15 minutes of discussion. Submission will be handled through EasyChair. http://www.easychair.org/conferences/?conf=obt2013 Organizers ---------- **General Chair** David Walker, Princeton Univ. **Program Chair** Ranjit Jhala, Univ. of California, San Diego **Program Committee** * Emery Berger, *Univ. of Massachusetts, Amherst* * Kathleen Fisher, *Tufts Univ.* * Kunle Olokutun, *Stanford Univ.* * Kostis Sagonas, *Natl. Tech. Univ. Athens* * Peter Thiemann, *Univ. Freiburg* * Dimitrios Vytiniotis, *Microsoft Research* From icfp.publicity at googlemail.com Mon Oct 29 20:21:15 2012 From: icfp.publicity at googlemail.com (David Van Horn) Date: Mon, 29 Oct 2012 20:21:15 -0400 Subject: [TYPES/announce] ICFP 2013: Call for workshops and co-located events Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2013 18th ACM SIGPLAN International Conference on Functional Programming September 22 - 28, 2013 Boston, Massachusetts, USA http://icfpconference.org/icfp2013/ The 18th ACM SIGPLAN International Conference on Functional Programming will be held in Boston, Massachusetts on September 22-28, 2013. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2013 and sponsored by SIGPLAN. These events should be more informal and focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 22-24 (the three days before ICFP) and September 28 (the day after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: December 7, 2012 Notification of acceptance: January 7, 2013 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2013 workshop co-chairs (Patrik Jansson and Sam Tobin-Hochstadt), via email to icfp13-workshops at ccs.neu.edu by December 7, 2012. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by January 7, 2013, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2013/icfp13-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2013 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Patrik Jansson (Chalmers University of Technology) Workshop Co-Chair: Sam Tobin-Hochstadt (Northeastern University) General Chair : Greg Morrisett (Harvard University) Program Chair: Tarmo Uustalu (Tallinn University of Technology) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Patrik Jansson and Sam Tobin-Hochstadt), via email to icfp13-workshops at ccs.neu.edu From brucker at spamfence.net Tue Oct 30 03:09:24 2012 From: brucker at spamfence.net (Achim D. Brucker) Date: Tue, 30 Oct 2012 08:09:24 +0100 Subject: [TYPES/announce] TAP 2013: 1st Call for Papers Message-ID: <20121030070924.GA9145@shinanogawa.brucker.ch> (Apologies if you receive this announcement multiple times. We also apologize for resending the first call for papers, the original announcement contained an incorrect URL to easychair.) **************************************************** *** *** *** TAP 2013 *** *** *** *** Abstract submission: January 25, 2013 *** *** Paper submission: February 1, 2013 *** **************************************************** *** TAP 2013 solicits both full papers and *** *** (industrial) experience/tool papers *** *** in combining proofs and (security) testing *** **************************************************** CALL FOR PAPERS 7th INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) http://www.spacios.eu/TAP2013 Budapest, Hungary, June 17-21, 2013 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security Important Dates: ================ Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 Program Chairs: =============== Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) Program Committee: ================== TBA Submission: =========== Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 (submission page to be opened in due time) TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Subject to final approval by Springer, accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP AG, SAP Research Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe, Phone: +49 6227 7-52595 http://www.brucker.ch From G.Grov at hw.ac.uk Wed Oct 31 04:41:00 2012 From: G.Grov at hw.ac.uk (Grov, Gudmund) Date: Wed, 31 Oct 2012 08:41:00 -0000 Subject: [TYPES/announce] SCP Special Issue on Invariant Generation - Call for Papers Message-ID: <7568D4DEC64B6F429303A520377444C801387E9D@ex10.mail.win.hw.ac.uk> (Apologies if you receive multiple copies of this announcement) ------------------------------------------------------------ Science of Computer Programming Special Issue on Invariant Generation -- CALL FOR PAPERS -- ------------------------------------------------------------ This special issue is devoted to the 4th international Workshop on Invariant Generation (WING 2012) http://cs.nyu.edu/acsys/wing2012/ which was held on June 30 2012 in Manchester as a satellite event of IJCAR 2012. The scope of the workshop is the automation of extracting and synthesising auxiliary properties of programs, in particular providing, debugging, and verifying auxiliary invariant annotations. This should be seen in a broad sense and relevant topics include (but are not limited to) the following: * Program analysis and verification * Inductive assertion generation * Inductive proofs for reasoning about loops * Applications to assertion generation using: - abstract interpretation, - static analysis, - model checking, - theorem proving, - theory formation, - algebraic techniques * Tools for inductive assertion generation and verification * Alternative techniques for reasoning about loops Submission to this special issue is completely open. We expect original articles (typically not more than 30 pages) that present high-quality contributions and must not be simultaneously submitted for publication elsewhere. Submission of extended versions of previously published papers is possible as long as the extension is significant, i.e., the submission can be considered a new paper, the previous paper is referenced, and the new material is clearly marked. Submissions must comply with SCP's author guidelines http://www.elsevier.com/wps/find/journaldescription.cws_home/505623/authorinstructions and be written in English. Submission is over the SCP website: http://ees.elsevier.com/scico/default.asp which you will have to register for if you do not have an account. When submitting your paper please choose the article type "Special issue: WING 2012". IMPORTANT DATES --------------- * Submission of papers: February 11, 2013. * Notification: April 26, 2013. GUEST EDITORS -------------- * Gudmund Grov (Heriot-Watt University, UK) * Thomas Wies (New York University, USA) CONTACT -------------- Please send any queries you may have to: wing2012 at easychair.org ----- Sunday Times Scottish University of the Year 2011-2013 Top in the UK for student experience Fourth university in the UK and top in Scotland (National Student Survey 2012) We invite research leaders and ambitious early career researchers to join us in leading and driving research in key inter-disciplinary themes. Please see www.hw.ac.uk/researchleaders for further information and how to apply. Heriot-Watt University is a Scottish charity registered under charity number SC000278. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Alexey.Gotsman at imdea.org Thu Nov 1 11:46:34 2012 From: Alexey.Gotsman at imdea.org (Alexey Gotsman) Date: Thu, 1 Nov 2012 16:46:34 +0100 Subject: [TYPES/announce] Postdoc position in verification at IMDEA Software Institute, Madrid Message-ID: <9639490D-B4EC-4DCF-8ED4-A0135B5294F1@imdea.org> Applications are invited for a postdoctoral position at the IMDEA Software Institute (www.software.imdea.org) in Madrid, Spain. The postdoc will work under supervision of Alexey Gotsman (www.software.imdea.org/~gotsman) in the area of systems software verification, with an emphasis on concurrent and distributed systems. The post is available from April 2013 (possibly earlier) for the duration of three years. The candidate should have, or expect shortly to obtain, a PhD in Computer Science, preferably with expertise in verification or programming languages. He or she would be expected to develop research questions within a specific context, to undertake original individual research, and to prepare research papers. The post is funded by a collaborative project on architecture-driven verification of systems software, which also involves the Max Planck Institute for Software Systems (Viktor Vafeiadis), KU Leuven (Bart Jacobs) and Tel-Aviv University (Noam Rinetzky). The successful candidate will be able to interact with these research groups, as well as with collaborators at the University of Oxford (Hongseok Yang) and Microsoft Research Redmond (Sebastian Burckhardt and Madan Musuvathi). The IMDEA Software Institute is located in the vibrant area of Madrid, Spain. It offers an ideal working environment, where researchers can focus on developing new ideas and projects. Salaries at the Institute are internationally competitive. Interested applicants are encouraged to contact Alexey Gotsman with inquires (alexey dot gotsman at imdea dot org). Formal applications should be submitted over the web. Please select the "Postdoc researcher" option at https://www.imdea.org/internationalcall/Default.aspx?IdInstitute=17 and mention the above project in your research statement. Review of applications will begin immediately. From curien at pps.jussieu.fr Fri Nov 2 14:56:36 2012 From: curien at pps.jussieu.fr (curien at pps.jussieu.fr) Date: Fri, 2 Nov 2012 19:56:36 +0100 Subject: [TYPES/announce] An important 3 months event in 2014 and two close deadlines Message-ID: <52e91e35c3446358734c9bc7d02669f7.squirrel@webmail.pps.jussieu.fr> In this message, we want to give a preliminary announcement about the following event: ***************************** IHP thematic trimester (in Paris) (http://www.ihp.fr/en/activities/quarters/ceb) "Semantics of proofs and certified mathematics" (see below for an overall description of the scope) which will be held from April 7 to July 11, 2014. ****************************** We shall very soon create a specific web page for this event (wait for the second announcement!), with a preregistration interface. All kinds of attendance are imaginable for these trimesters: - attendance to a single workshop (see below for the list of the workshops planned), or to a thematic course, - longer stays, up to the whole duration of the trimester (a number of offices are at the disposal of the participants), - even longer stays (6 months or one/two years) including the period of the trimester. In particular, we want to draw the attention of potential applicants -- and of colleagues who may have good ideas for encouraging applications -- on the following two programs (open to mathematical sciences in the large), with *** rather short deadlines! *** 1) The annual postdoctoral programme of the Foundation "Sciences Math?matiques de Paris", of which the organisers of the trimester are members. ** Deadline 2 december 2012 ** (This programme offers 1 year or 2 years postdoctoral positions) http://www.sciencesmaths-paris.fr/en/postdoctoral-programmes-247.htm 2) A new joint programme of the IHP and IHES that is specially devoted to supporting IHP trimesters: ** Deadline 12 december 2012 ** http://www.ihes.fr/jsp/site/Portal.jsp?document_id=2953&portlet_id=1043 (This programme offers 6 months visiting researcher positions and 1 years postdoctoral positions) Both programs are highly competitive, but highly worth trying! If you intend to apply, or if you are determined to stay at least a month during the trimester (there are various other schemes that we can use for this) please contact beforehand any of the organisers of the IHP trimester: Pierre-Louis Curien Hugo Herbelin Paul-Andre Mellies ********** SEMANTICS OF PROOFS AND CERTIFIED MATHEMATICS ******** After years of steady development, the technology of proof assistants is currently coming to a mature state. As a matter of fact, it is possible today to formalize a non trivial mathematical proof inside a computer, and to check its correctness automatically. This ``tour de force'' has been recently achieved for the four color theorem, and a certified proof of the classification of finite groups and of the Kepler conjecture are on the way. These achievements would not have been possible without the rich and active mathematics of formal proofs which emerged in the 1970s at the frontier of logic and computer science, along the Curry-Howard correspondence. This seminal correspondence enables us to understand a logical proof (of a given formula) as a well-behaved program (of a given type). Besides this by now traditional connection between logic and computer science, a number of unexpected connections are currently emerging with other fields of mathematics -- this including homotopy theory, higher dimensional algebra, quantum topology, topos theory, functional analysis and operator algebra. Finally, proof assistants have been successfully applied to certify properties of programs written in high-level languages as well as low-level languages, to implement certified compilers, or to establish important security properties of protocols. The purpose of this thematic trimester is to provide a forum for the extended community of researchers and students in mathematics and in computer science interested in proof assistants, and more generally, in the mathematics of formal proofs. Much care will be devoted during the trimester to train the mathematicians interested to learn and to use the current proof assistants in their work. Besides various courses, spontaneous working groups, individual collaborations, etc..., the programme will host five thematic workshops: ** Formalization of mathematics in proof assistants ** Constructive mathematics and models of type theory ** Semantics of proofs and programs ** Abstraction and verification in semantics ** Certification of high-level and low-level programs} *********************************** From HANAC at il.ibm.com Sun Nov 4 14:41:29 2012 From: HANAC at il.ibm.com (Hana Chockler) Date: Sun, 4 Nov 2012 21:41:29 +0200 Subject: [TYPES/announce] VSSE 2013 - Call for Papers Message-ID: ============================================================== We apologize if you receive multiple copies of this CFP. Please distribute to anyone who may be interested. ============================================================== Call for Papers ********************************************************* Second Workshop on Validation Strategies for Software Evolution (VSSE) 2013 http://sysrun.haifa.il.ibm.com/hrl/vsse2013/ Rome, Italy, Saturday March 16th, 2013 Affiliated with ETAPS 2013: http://www.etaps.org/2013/workshops13 ********************************************************* VSSE focuses on the verification and testing of software changes and upgrades. Software is usually not written all at once, but is built incrementally for several reasons: - Maintenance - fixing errors and flaws, hardware changes, etc. - Enhancements - new functionality, improved efficiency, extension, new regulations, etc. Changes are done frequently during the lifetime of most systems and can introduce software errors that were not present in the old version or expose errors that were present before but did not get exercised. In addition, upgrades are done gradually, so the old and new versions have to co-exist in the same system. This workshop addresses the issue of efficient and reliable verification of system changes and upgrades by means of formal verification, analysis and testing techniques. The first VSSE took place in Tallinn, Estonia, in 2012, affiliated with ETAPS 2012. The program of VSSE 2012 consisted of invited talks by experts in this area. Following the success of VSSE 2012, we decided to invite submissions to VSSE 2013. The workshop proceedings will be published in Electronic Notes in Theoretical Computer Science series (ENTCS). We encourage submission of work that addresses all aspects of formal verification, analysis, and testing of evolving software. Paper submission: All submitted papers should be in ENTCS format. For details, see: http://www.entcs.org/prelim.html There are two categories of submissions: A. Regular papers. Regular paper submissions should describe original and unpublished work. Simultaneous submission to other conferences with proceedings or submission of previously published material is strictly forbidden. Regular papers should not exceed twelve (12) pages in ENTCS format ? please see the instructions at http://www.entcs.org/preliminary.html . Submissions are accepted in electronic form (pdf), via the easychair at https://www.easychair.org/conferences/?conf=vsse2013 B. Presentation only. Presentation-Only submissions can describe a previously published work or a preliminary idea. Presentation-only submissions will be given a presentation slot in the workshop, but will not be published in the proceedings. This is an opportunity to present an already published relevant work, or to describe an interesting idea not yet ready for publication. Presentation will not be considered as a publication, so submission of already published or submitted results is allowed and encouraged. If you are working on the validation of changes and upgrades and plan to attend ETAPS, please consider submitting your presentation to the workshop. Presentation-only submissions can be either a two-pages abstract (pdf), or a presentation (PowerPoint or pdf). ---------------------------------------------------------------- Important dates: Submission deadline: December 20, 2012 Author notification: January 20, 2013 Camera-read version: January 30, 2013 Workshop: March 16, 2013 ---------------------------------------------------------------- Workshop chair: Hana Chockler (hanac at il.ibm.com) Organizing committee: Hana Chockler, IBM Research Daniel Kroening, Oxford Natasha Sharygina, USI Leonardo Mariani, UniMiB Giovanni Denaro, UniMiB Program committee: Hana Chockler, IBM Research Giovanni Denaro, University of Milano Bicocca Alastair Donaldson, Imperial College, London Daniel Kroening, Oxford Shuvendu Lahiri, Microsoft Research Leonardo Mariani, University of Milano Bicocca Fabio Massacci, University of Trento Ali Muhammad, VTT Technical Research Centre of Finland Manuel Oriol, ABB Corporate Research Alessandro Orso, Georgia Institute of Technology Bastian Schlich, ABB Corporate Research Ondrej Sery, Charles University in Prague Natasha Sharygina, University of Lugano Ofer Strichman, Technion Tanja Vos, Universidad Politecnica de Valencia Michael Wahler, ABB Corporate Research From jhala at cs.ucsd.edu Mon Nov 5 10:15:58 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Mon, 5 Nov 2012 07:15:58 -0800 Subject: [TYPES/announce] OBT 2013: Deadline Extended to Nov 9 (Fri) Message-ID: *Due to the disruption caused by Sandy, we've pushed the deadline a few days till Fri Nov 9. * Off the Beaten Track: New Frontiers for Programming Languages Research ====================================================================== http://goto.ucsd.edu/~rjhala/OBT2013/ (Co-located With POPL 2013: Rome, Italy) Important Dates --------------- * Paper Submission : Nov 9, 2012 (Monday) * Notification : Dec 3, 2012 (Monday) * Workshop : Jan 26, 2013 (Saturday) Background ---------- Programming language researchers have the principles, tools, algorithms and abstractions to solve all kinds of problems, in all areas of computer science. However, identifying and evaluating new problems, particularly those that lie outside the typical core PL problems we all know and love, can be a significant challenge. Hence, the goal of this workshop is to identify and discuss problems that do not often show up in our top conferences, but where programming language researchers can make a substantial impact. The hope is that by holding such a forum and associating it directly with a top conference like POPL, we can slowly start to increase the diversity of problems that are studied by PL researchers and that by doing so we will increase the impact that our community has on the world. While many workshops associated with POPL have become more like mini-conferences themselves, this is not our goal. Instead, the workshop will be informal and structured to encourage discussion. It will also be centered around problems and problem areas as opposed to fully-formed solutions. Topics ------ A good submission is one that outlines a new problem or an interesting, underrepresented problem domain. Good submissions may also remind the PL community of problems that were once in vogue but have not recently been seen in top PL conferences. Good submissions do not need to propose complete or even partial solutions, though there should be some reason to believe that programming languages researchers have the tools necessary to search for solutions in the area at hand. Submissions that seem likely to stimulate discussion about the direction of programming language research are encouraged. Possible topics include any of the following. + Biology, chemistry, or other natural sciences + Art, music, graphics and animation + Networking, cloud computing, systems programming + Linguistics + Economics, law, politics or other social sciences + Web programming, social computing + Algorithms and complexity + Mathematics, statistics + Machine learning or artificial intelligence + Education + Unusual compilers; underrepresented programming languages + **Surprise us!** We certainly hope to see submissions on topics not mentioned above. The goal of the workshop is to be inclusive, not exclusive. Submissions are evaluated on the basis of creativity, novelty, clarity, possible impact and potential for stimulating discussion. Authors concerned about the appropriateness of a topic are strongly encouraged to consult the Program Chair prior to submission. Submission Information ---------------------- There are two kinds of submissions. In either case, authors should not assume that reviewers will be experts in the particular area of the submission -- indeed, they will most likely *not* be. Hence, all submissions should be accessible to a wide range of PL researchers. All submissions should be in PDF in at least 10pt font, printable on US Letter paper. Authors are free to include links to multimedia content such as youtube videos or online demos. Reviewers may or may not view linked documents (it is up to authors to convince them to do so in their submission. + **Submissions for 5-minute talks:** Authors will submit a **1-page** PDF document. 5-minute talks will be followed by 5-15 minutes of discussion. + **Submissions for longer talks:** Authors will submit at most a **2-page** PDF document. Put the words *"Full Presentation"* in the title of your submission if you would like a longer talk. By default, we will assume a short, 5-minute presentation if the title does not contain these words and is 1 PDF page or less. Longer talks may be up to 1/2 an hour in length. The length will depend on the submissions received and how the program committee decides to assemble the program. Longer talks will be followed by 5-15 minutes of discussion. Submission will be handled through EasyChair. http://www.easychair.org/conferences/?conf=obt2013 Organizers ---------- **General Chair** David Walker, Princeton Univ. **Program Chair** Ranjit Jhala, Univ. of California, San Diego **Program Committee** * Emery Berger, *Univ. of Massachusetts, Amherst* * Kathleen Fisher, *Tufts Univ.* * Kunle Olokutun, *Stanford Univ.* * Kostis Sagonas, *Natl. Tech. Univ. Athens* * Peter Thiemann, *Univ. Freiburg* * Dimitrios Vytiniotis, *Microsoft Research* -------------- next part -------------- An HTML attachment was scrubbed... URL: From emmanuel.fleury at labri.fr Tue Nov 6 04:33:57 2012 From: emmanuel.fleury at labri.fr (Emmanuel Fleury) Date: Tue, 06 Nov 2012 10:33:57 +0100 Subject: [TYPES/announce] PostDoc on Static Analysis of Binary Program in LaBRI (Bordeaux) Message-ID: <5098D985.8040500@labri.fr> We open a one year postdoc position at LaBRI, Bordeaux 1 University, funded by the MARSHAL+ project (trac.marshalproject.org), on static analysis of binary programs. The candidate is expected to experiment new analyses within the Insight framework (insight.labri.fr), which we develop in Bordeaux. Ideally, the candidate should have an interest in formal methods (especially abstract-interpretation) and software security (reverse-engineering and obfuscation techniques). Application deadline: Monday, 10 December, 2012 Starting date: January, 2013 ==== The MARSHAL+ Project ==== The main outcome of the MARSHAL+ project is the design and realization of a prototype for a portable security product (e.g. a smart card) that resists all forms of reverse-engineering attacks. The prototype will be conceived for providing secure access control to digital content, but the proposed solutions must be portable to further security services (banking authentication, e-wallet, ?). The prototype will include a module for access control management with a deciphering unit based on the AES block-cipher, as well as a data decompression module. It will enable to decipher and read some protected digital content available on the Internet. The prototype will have to withstand two types of attacks. First, it will resist reverse-engineering attacks against the access control module that aim to recover the deciphering keys. Namely, the data stored in the device must remain confidential even for an attacker who is able to recover the memory content as well as the disassembled instructions running on the device. Secondly, the prototype will be secure against reverse-engineering attacks that aim to recover the design of the data decompression module, in a consideration for protection of the intellectual property. ==== Job Description ==== The postdoc candidate will investigate new techniques of memory structure reconstruction and CFG recovery from binary program, or might also take a look on automatic (de-)obfuscation techniques. On a more practical side, the postdoc candidate will be integrated in the Insight development team and will be asked to develop several parts of it (Sparc assembly support, various techniques of analysis and IR-recovery of binaries). An ideal candidate for this job has a good knowledge of abstract- interpretation, SMT-solvers, C/C++ programming, low-level code (assembly language), reverse engineering, team development (contributions to Open Source projects), and a few publications in the field of formal methods would help (preferably in abstract- interpretation: SAS, VMCAI, CC, ?). The PostDoc will last one year, starting in January 2013 and ending on December 2013 (start and end date can be negotiated). The monthly net salary will be between 1800 and 2100 euros depending on the experience of candidate. ==== How to Apply ==== The candidate must send: * A CV. * A cover letter. * At least two reference letters. * A list of publications (if any). To (regular mail): Emmanuel Fleury Univ. Bordeaux, LaBRI, Building A30, Domaine Universitaire 351, Cours de la Lib?ration 33405 Talence Cedex, France To (electronic/scanned version): Emmanuel Fleury (emmanuel.fleury(at)labri.fr) Application deadline: Monday, 10 December, 2012 Full offer: http://essv.labri.fr/2012/11/postdoc-on-binary-program-analysis-labri-bordeaux-france/ Regards -- Emmanuel Fleury Associate Professor, | Room: 261 Univ. Bordeaux, LaBRI, | Phone: +33 (0)5 40 00 69 34 Building A30, Domaine Universitaire | Fax: +33 (0)5 4000 66 69 351, Cours de la Lib?ration | Email: emmanuel.fleury at labri.fr 33405 Talence Cedex, France | Web: http://www.labri.fr/~fleury From jared at cs.utexas.edu Tue Nov 6 10:07:17 2012 From: jared at cs.utexas.edu (Jared C. Davis) Date: Tue, 6 Nov 2012 09:07:17 -0600 Subject: [TYPES/announce] ACL2 2013 - Call For Papers Message-ID: ACL2 2013 International Workshop on the ACL2 Theorem Prover and its Applications May 30-31, 2013 in Laramie, Wyoming, USA http://www.cs.uwyo.edu/~ruben/acl2-13 CALL FOR PAPERS IMPORTANT DATES Abstract submission: February 8, 2013 Paper submission: February 15, 2013 Acceptance Notification: March 15, 2013 Final Version Due: April 15, 2013 WORKSHOP SCOPE ACL2 2013 is the major technical forum for users of the ACL2 theorem proving system to present research related to the ACL2 theorem prover and its applications. ACL2 2013 is the eleventh in the series of ACL2 workshops, which occur approximately every 18 months. ACL2 is an industrial-strength automated reasoning system, the latest in the Boyer-Moore family of theorem provers. The 2005 ACM Software System Award was awarded to Boyer, Kaufmann, and Moore for their work in ACL2 and the other theorem provers in the Boyer-Moore family. ACL2 2013 is a two-day workshop to be held in Laramie, WY, USA on May 30-31, 2013. The workshop will feature technical papers, invited talks, and rump sessions discussing ongoing research. We invite submissions of papers on any topic related to ACL2 and its applications, and we strongly encourage submissions related to other theorem provers or formal methods that are of interest to the ACL2 community. Suggested topics include but are not limited to the following: * software or hardware verification with ACL2, * formalizations of mathematics in ACL2, * new libraries, tools, and interfaces for ACL2, * novel uses of ACL2, * experiences with ACL2 in the classroom, * reports of and proposals for improvements of ACL2, * comparisons with other theorem provers, * comparisons with other programming or specification languages, * challenge problems and their solutions, * foundational issues related to ACL2, and * implementations connecting ACL2 with other systems. PAPER SUBMISSIONS Submissions must be made electronically in PDF format, as directed in the ACL2 2013 website. Submissions should be prepared in the EPTCS templates, available from http://style.eptcs.org. The ACL2 Workshop accepts both long papers (up to sixteen pages) and extended abstracts (up to two pages). Both categories of papers will be fully refereed, but only long papers will be included in the final workshop proceedings. At least one author of each accepted papers must register for the workshop and give a presentation summarizing the paper's results. Authors of long papers will have more time to present their work at the workshop. One of the main advantages of the ACL2 Workshop is that attendees are already knowledgeable about ACL2, its syntax, its basic commands, and the art of writing models in it. So authors may assume that readers have this familiarity. The workshop proceedings will be published as a volume of Electronic Proceedings in Theoretical Computer Science (EPTCS). Many papers presented at the workshop will describe interactions with the theorem prover. We strongly encourage authors of such papers to provide ACL2 script files (aka "books") along with instructions for using these books in ACL2. Such supporting materials should follow the guidelines at http://www.cs.utexas.edu/users/moore/acl2/books/index.html. For accepted papers, these books will be mirrored on the ACL2 home page and included in the ACL2 book repository. The workshop will also feature ``rump sessions'', in which participants can describe ongoing research related to ACL2. Proposals for rump session presentations, including a title and short abstract, will be accepted until the workshop. ORGANIZATION Chairs * Ruben Gamboa, University of Wyoming, USA * Jared Davis, Centaur, USA Program Committee * Carl Eastlund, Northeastern University, USA * David Greve, Rockwell Collins, USA * Warren Hunt, University of Texas, USA * Matt Kaufmann, University of Texas, USA * Hanbing Liu, AMD, USA * Panagiotis Manolios, Northeastern University, USA * Magnus Myreen, University of Cambridge, UK * David Rager, Battelle Memorial Institute, USA * Sandip Ray, Intel, USA * Jose Luis Ruiz Reina, University of Seville, Spain * David Russinoff, Intel, USA * Jun Sawada, IBM, USA * Julien Schmaltz, Open University of the Netherlands, The Netherlands * Konrad Slind, Rockwell Collins, USA * Sol Swords, Centaur, USA * Laurent Thery, INRIA, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From s.eisenbach at imperial.ac.uk Tue Nov 6 17:14:42 2012 From: s.eisenbach at imperial.ac.uk (Eisenbach, Susan) Date: Tue, 6 Nov 2012 22:14:42 +0000 Subject: [TYPES/announce] Sigplan Outstanding Doctoral Dissertation Message-ID: I would like to draw your attention to the Sigplan Outstanding Doctoral Dissertation Award http://www.sigplan.org/Awards/Dissertation/Description. If you are either a recent PhD graduate or a supervisor of such a graduate can I suggest you consider applying? Obtaining such an award makes a person stand out when applying for academic positions. Outstanding Doctoral Dissertation Award Presented annually to the author of the outstanding doctoral dissertation in the area of Programming Languages. The award includes a prize of $1,000. The winner can choose to receive the award at ICFP, OOPSLA, POPL, or PLDI. Selection Committee The chair of the selection committee is a member of the EC appointed by the SIGPLAN chair. Other committee members are selected by the chair of the selection committee with approval of the SIGPLAN chair. The SIGPLAN Chair is an ex officio member of the committee and shall adjudicate conflicts of interest, appointing substitutes to the committee as necessary. Nominations Nominations must be submitted to the secretary of SIGPLAN by January 3rd to be considered for that year's award. The nominated dissertation must be available in an English language version to facilitate evaluation by the selection committee. A nomination should consist of the following items: ? Name, address, phone number, and email address of the person making the nomination (the nominator). ? Name, address, phone number, and email address of the candidate for whom an award is recommended (the nominee). ? A short statement (200-500 words) explaining why the nominee deserves the award in question. ? Supporting statements from up to two people in addition to the nominator. -- Professor Susan Eisenbach Head, Department of Computing Imperial College London London SW7 2AZ, U.K. www.doc.ic.ac.uk/~susan/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From jnfoster at cs.cornell.edu Wed Nov 7 09:52:50 2012 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Wed, 7 Nov 2012 09:52:50 -0500 Subject: [TYPES/announce] BX'13 Call for Papers Message-ID: CALL FOR PAPERS Second International Workshop on Bidirectional Transformations (BX 2013) http://bx-community.wikidot.com/bx2013:home Sunday March 17th, 2013 Rome, Italy colocated with ETAPS 2013 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. Following the success of BX'12, BX'13 is a dedicated venue for bx in all relevant areas. The methodologies used for bx range from classical program transformation to graph transformation techniques, from ad-hoc techniques for data synchronization to the development of domain-specific languages and their integration. We also solicit papers on model/metamodel co-evolution, which is a different yet closely related subject. Aims and Topics The aim of the workshop is to bring together researchers, established and new, interested in bidirectional transformations from different perspectives, such as: language-based approaches, software/model transformations, and data/schema co-evolution. Topics of interest for BX'13 include, but are not limited to: * software-model synchronization * data-schema co-evolution and data synchronization * consistency analysis * (coupled) software/model transformations * language-based approaches * analysis/classification of requirements for bx technologies * case studies and tool support * efficiency of algorithms and benchmarks * comparison of bx technologies Submissions can be: * research papers providing new concepts and results * position papers and research perspectives * papers that apply bx in new domains * papers closing gaps between formal concepts and application scenarios Submitted papers must be 6-15 pages in length, otherwise they will be rejected without review. Preliminary proceedings, including all the papers selected for the workshop, will be available electronically at the workshop. Post-proceedings of the workshop will appear as a volume of EC-EASST. Workshop papers that were shorter than 11 pages will require extension and a second round of reviewing, if their authors wish them to appear in the post-proceedings. We specifically welcome short papers that may be extended to full papers, perhaps with extra authors, following discussion at the workshop. Perdita Stevens (University of Edinburgh, UK) James Terwilliger (Microsoft, USA) Paper submission: 18 December 2012 Notification: 22 January 2013 Camera ready: 3 February 2013 Dates: Sunday March 17th, 2013 Website: http://bx-community.wikidot.com/bx2013:home From murano at na.infn.it Fri Nov 9 08:16:44 2012 From: murano at na.infn.it (Nello Murano) Date: Fri, 9 Nov 2012 14:16:44 +0100 (CET) Subject: [TYPES/announce] SR 2013 - Call for contributions Message-ID: <52694.172.16.4.15.1352467004.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ***************************************************************** ------ SR 2013 ----- ***************************************************************** First International Workshop on Strategic Reasoning Rome, Italy, March 16th-17th, 2013 http://www.strategicreasoning.net/ ********************************************************** | CALL FOR CONTRIBUTIONS | ********************************************************** OBJECTIVES Strategic reasoning is one of the most active research area in multi-agent system domain. The literature in this field is extensive and provides a plethora of logics for modeling strategic ability. Theoretical results are now being used in many exciting domains, including software tools for information system security, robot teams with sophisticated adaptive strategies, and automatic players capable of beating expert human adversary, just to cite a few. All these examples share the challenge of developing novel theories and tools for agent strategies that take into account the likely behavior of adversaries. The SR international workshop aims to bring together researchers working on different aspects of strategic reasoning in computer science, both from a theoretical and a practical point of view. LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: - Logics for reasoning about strategic abilities - Logics for multi-agent mechanism design, verification, and synthesis - Logical foundations of decision theory for multi-agent systems - Strategic reasoning in formal verification - Automata theory for strategy synthesis - Strategic reasoning under perfect and imperfect information - Applications and tools for cooperative and adversarial reasoning - Robust planning and optimization in multi-agent systems - Risk and uncertainty in multi-agent systems - Quantitative aspects in strategic reasonings CO-LOCATED EVENT SR 2013 is an ETAPS 2013 workshop. ETAPS 2013 will be held on March 16th-24th, 2013. INVITED SPEAKERS - Krishnendu Chatterjee (IST Austria) - Alessio R. Lomuscio (Imperial College London) - Jean-Francois Raskin (Universit? Libre de Bruxelles) - Michael Wooldridge (University of Oxford) PAPER SUBMISSION Submitted papers should not exceed five pages using EPTCS format (http://style.eptcs.org). If necessary, the paper may be supplemented with a clearly marked appendix, which will be consulted at the discretion of the programme committee. Submissions must be in PDF format and will be handled via EasyChair ( https://www.easychair.org/conferences/?conf=sr2013 ). Two types of submission are invited: - Papers reporting on novel research, and - Expository papers reporting on published work. Each submission should be clearly identified as belonging to one category or the other. In both categories, strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and all papers should be written so that they are accessible to such an audience. Novel research abstracts will be held to the usual high standards of novel research publications. In particular, they should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the significance of the work its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Expository abstracts, which will be held to similarly high standards, may survey an area or report on a more specific previously published work; the submission should make clear the relevance to the strategic reasoning audience. Papers accepted for presentation (in both categories) will be collected as an EPTCS volume. Submissions from PC members are also allowed. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. IMPORTANT DATES Abstract submission: December 15, 2012 Paper submission: December 20, 2012 Acceptance notification: January 17, 2013 Final version: January 31, 2013 Workshop: March 16-17, 2013 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 workshop papers is also under consideration. PROGRAM CO-CHAIRS Fabio Mogavero, Universit? di Napoli Federico II, Italy Aniello Murano, Universit? di Napoli Federico II, Italy Moshe Y. Vardi, Rice University, Texas, USA PROGRAM COMMITTEE - Thomas Agotnes, University of Bergen, Norway - Dietmar Berwanger, RWTH Aachen, Germany - Valenting Goranko, Technical University of Denmark, Denmark - Joseph Y. Halpern, Cornell University, New York, USA - Wojtek Jamroga, University of Luxembourg, Luxembourg - Orna Kupferman, Hebrew University, Israel - Nicolas Markey, CNRS de Cachan, France - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Ramaswamy Ramanujam, Institute of Mathematical Sciences, India - Wolfgang Thomas, RWTH Aachen, Germany - Moshe Y. Vardi, Rice University, Texas, USA ORGANIZING COMMITTEE - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Giuseppe Perelli, Universit? di Napoli Federico II, Italy - Loredana Sorrentino, Universit? di Napoli Federico II, Italy INFO Please visit the conference website (http://www.strategicreasoning.net/) for more information. From patrick.baillot at ens-lyon.fr Fri Nov 9 09:47:58 2012 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Fri, 09 Nov 2012 15:47:58 +0100 Subject: [TYPES/announce] Post-doc position in Lyon Message-ID: <20121109154758.92272y51wzwm0z32@webmail.ens-lyon.fr> Please find below a call for application for postdoc positions in Lyon (24months, possibly extendable to a third year). Applications of candidates from the Types community are welcome, concerning the Plume team of Laboratoire d'Informatique du Parall?lisme (http://www.ens-lyon.fr/LIP/PLUME/), ENS Lyon. Potential candidates are invited to contact the member of the team who is closer to their research interest. ========================================== Post-doc positions Mathematics and Computer Science in Lyon (labex MILYON) ========================================== See: http://milyon.universite-lyon.fr/offres-de-post-docs/2-post-doctoral-positions-in-mathematics-and-or-computer-science--170911.kjsp?RH=MILYON-FR Offer: MILYON (the Laboratoire d'Excellence "Math?matiques et Informatique ? Lyon") offers two post-doctoral positions in mathematics and/or computer science for the academic year 2013-2014, to be held at the Unit? de Math?matiques Pures et Appliqu?es or at the Laboratoire de l'Informatique du Parall?lisme (?cole Normale Sup?rieure de Lyon), or at the Institut Camille Jordan (Universit? Claude Bernard Lyon 1). These are research-only appointments (without teaching). They are typically for two years, with possible renewal for a third year subject to review. The salary will be 2100 euros per month, with benefits including health insurance and social coverage. Funds will also be provided for traveling and inviting collaborators. Full description: More information can be found on the website of MILYON which contains links to the above three departments. It is requested to contact the colleagues in Lyon who are closest to your specialty. Eligibility: For holders of a Ph.D in mathematics or computer science obtained before October 1st, 2013. Deadline: Applications must be complete (including all reference letters) by : Tuesday, January 15th, 2013, at 17:00 (Lyon local time) How to apply? Applications must be submitted via the online form: http://math.univ-lyon1.fr/limesurvey/index.php?sid=27441&lang=en Requested items: - a curriculum vitae; - a list of publications; - a scientific project (around two pages) specifying members of MILYON with whom you plan to interact primarily; - two detailed recommendation letters by scientists not members of MILYON; - a letter from your thesis adviser. Contact: Scientific contact : Francis FILBET Administrative contact : Carine SEVESTRE ----- Fin du message transf?r? ----- -- Patrick Baillot LIP (UMR 5668 CNRS) ENS de Lyon http://perso.ens-lyon.fr/patrick.baillot/ Tel (new!): (+33) 4 37 28 76 46 Fax: (+33) 4 72 72 80 80 From herman at cs.ru.nl Fri Nov 9 17:00:42 2012 From: herman at cs.ru.nl (Herman Geuvers) Date: Fri, 09 Nov 2012 23:00:42 +0100 Subject: [TYPES/announce] Call for Workshops RDP 2013: RTA + TLCA Message-ID: <509D7D0A.2070805@cs.ru.nl> Call for Workshops RDP 2013: RTA + TLCA June 23 to June 28, 2013, Eindhoven, The Netherlands RDP 2013 http://www.win.tue.nl/rdp2013/ is the seventh edition of the International Conference on Rewriting, Deduction, and Programming, consisting of two main conferences RTA (Rewriting Techniques and Applications), June 24-26, and TLCA (Typed Lambda Calculi and Applications), June 26-28. Workshop proposals for RDP 2013 are solicited for the days June 24 (Monday), June 25 (Tuesday), June 27 (Thursday) and June 28 (Friday). Both well-established workshops and newer ones are encouraged. Also system competition proposals are solicited. Due to the overlap with the conferences, workshops most related to TLCA are expected to be on June 24 and 25, and workshops most related to RTA are expected to be on June 27 and 28. If you want to organize a workshop, please send the following information to Hans Zantema h.zantema at tue.nl, no later than December 1, 2012: * Workshop title and description of the topic, * Names and affiliations of the organizers, and * Proposed workshop duration (from half a day to two days). Notification date: December 20. _________________________________________________________ Prof Dr Hans Zantema Technische Universiteit Eindhoven / Radboud Universiteit Nijmegen Primary address: Department of Computer Science P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail: H.Zantema at tue.nl, homepage: www.win.tue.nl/~hzantema office: Metaforum room 7.067, tel: (040)2472749 From eernst at cs.au.dk Sun Nov 11 18:17:10 2012 From: eernst at cs.au.dk (Erik Ernst) Date: Sun, 11 Nov 2012 23:17:10 +0000 Subject: [TYPES/announce] CFP: Foundations of Aspect-Oriented Languages (FOAL) 2013 Message-ID: <5236AF453495154F9AF8B307F6783A5F0105E924@SRVUNIMBX05.uni.au.dk> [Apologies if you receive multiple copies of this CFP] *** CALL FOR PAPERS: Foundations of Aspect-Oriented Languages *** FOAL is a one day workshop affiliated with MODULARITY: aosd 2013 conference in the Fukuoka International Congress Center, Japan, on March 26, 2013. Papers are due January 7, 2013, at 23:00 GMT. Themes and Goals FOAL is a forum for research in foundations of aspect-oriented and other advanced separation of concern mechanisms. Areas of interest include but are not limited to: * Semantics of advanced separation of concern mechanisms * Specification and verification for languages with such mechanisms * Type systems * Static analysis * Theory of testing * Theory of composition * Theory of translation (compilation) and rewriting * Comparison of different advanced modularization and separation of concern mechanisms The workshop aims to foster work in foundations, including formal studies, promote the exchange of ideas, and encourage workers in the semantics and formal methods communities to consider advanced separation of concern mechanisms. All theoretical and foundational studies of this topic are welcome. Even though the workshop title contains the term "aspect-oriented", the workshop is not limited to aspect-oriented programming languages, but welcomes topics on other advanced separation of concern mechanisms such as feature-oriented or context-oriented programming. The goals of FOAL are to: * Make progress on the foundations of aspect-oriented and other advanced separation of concern mechanisms. * Exchange ideas about semantics and formal methods for aspect-oriented and other languages with advanced separation of concerns. * Foster interest within the programming language theory and types communities in languages with advanced separation of concerns. * Foster interest within the formal methods community in aspect-oriented programming and other advanced separation of concern mechanisms, and the problems of reasoning about them. Workshop Format The planned workshop format is primarily presentation of papers and group discussion. Talks will come in two categories: regular (25 minutes plus 5 minutes of discussion) and short (7 minutes plus 3 minutes of discussion). The short talks will allow for presentations of topics for which results are not yet available, perhaps for researchers who are seeking feedback on ideas or seek collaborations. We also plan to ensure sufficient time for discussion of each presentation by limiting the overall number of talks. Submissions Invitation to the workshop will be based on papers selected by the program committee; those wishing to attend but not having a paper to submit should contact the organizers directly to see if there is sufficient space in the workshop. FOAL solicits regular and short papers on all areas of formal foundations of advanced separation of concern mechanisms. Submissions will be read by the program committee and designated reviewers. Papers will be selected for regular and short presentation at the workshop based on their length, scientific merit, innovation, readability, and relevance. Papers previously published or already being reviewed by another conference are not eligible. Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than their paper length would otherwise command. We will limit the length of paper presentations and the number of papers presented to make sure that there is enough time for discussion. Five page papers presented at the workshop can be included in the ACM Digital Library, at the discretion of the authors. Authors of accepted papers who wish to have their papers in the ACM Digital Library will be asked to transfer copyright to the ACM. However, as FOAL is a workshop, publication of extended versions of the papers in other venues will remain possible. We will also investigate having a special issue of a journal for revisions of selected papers after the workshop. Authors should note the following details: * Submissions are due no later than 23:00 GMT, 7 January 2013 * Regular papers must not exceed 5 pages in length, and short papers must not exceed 3 pages in length * We encourage use of the ACM Conference format for submissions, as this will be required for accepted papers * You must add page numbers (which are not part of the standard format) to your submissions, to make adding comments easier * Submissions are to be made at the following URL: https://www.easychair.org/conferences/?conf=foal2013 We will notify the corresponding author of papers that are selected for presentation at the workshop by 28 January 2013. Early registration for MODULARITY: aosd (you must register for the conference to attend the workshop) shortly follows that date. Final versions of 5 page papers for the ACM digital library will be due on 4 February 2013. For more information, please visit the FOAL Workshop home page (at http://www.eecs.ucf.edu/FOAL). Important Dates Paper Submission Deadline - January 7, 2013, 23:00 GMT Notification of Acceptance - January 28, 2013 Final version and 5 page version due - February 4, 2013 Workshop - March 26, 2013 Program Committee * Erik Ernst (Program Committee Chair) -- University of Aarhus * Sven Apel -- University of Passau * Don Batory -- University of Texas, Austin * Eric Bodden -- European Center for Security and Privacy by Design, Center for Advanced Security Research Darmstadt * John Tang Boyland -- University of Wisconsin, Milwaukee * Sophia Drossopoulou -- Imperial College * Matthew Flatt -- University of Utah * Atsushi Igarashi -- Kyoto University * Radha Jagadeesan -- DePaul University * Todd Millstein -- University of California, Los Angeles * Bruno C. d. S. Oliveira -- National University of Singapore * Klaus Ostermann -- University of Marburg * Nicolas Tabareau -- Ecole des Mines de Nantes / INRIA * Elena Zucca -- University of Genoa Organizers * Gary T. Leavens -- University of Central Florida * Hidehiko Masuhara -- University of Tokyo * Hridesh Rajan -- Iowa State University * Mario Sudholt -- Ecole des Mines de Nantes -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From n.yoshida at imperial.ac.uk Mon Nov 12 10:52:54 2012 From: n.yoshida at imperial.ac.uk (Yoshida, Nobuko) Date: Mon, 12 Nov 2012 15:52:54 +0000 Subject: [TYPES/announce] PLACES'13 Call for Papers Message-ID: <3E2DE459E494E340A242A4851471E28113449575@icexch-m4.ic.ac.uk> CALL FOR PAPERS PLACES'13 Programming Language Approaches to Concurrency and Communication-cEntric Software 23rd March 2013, Rome, Italy (affiliated with ETAPS 2013) http://places13.di.fc.ul.pt/ Applications today are built using numerous interacting services; soon off-the-shelf CPUs will host thousands of cores, and sensor networks will be composed from a large number of processing units. Many applications need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems is inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. ** Topics of Interest ** Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: * language design and implementations for communications and/or concurrency, * session types, * multicore programming, * use of message passing in systems software, * interface languages for communication and distribution, * concurrent objects and actors, * concurrent data types, * program analysis, * web services, * novel programming methodologies for sensor networks, * integration of sequential and concurrent programming, * high-level programming abstractions for security concerns in concurrent, distributed programming, * runtime architectures for concurrency, * scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Submission Guidelines ** Authors should submit a title and an abstract by Wednesday 14th December 2012. Papers of up to *five pages* in length should be submitted in PDF format by Wednesday 21st December 2012 using the EasyChair proceedings template available at: http://www.easychair.org/easychair.zip Abstracts and papers should be submitted using EasyChair: http://www.easychair.org/conferences/?conf=places2013 Preliminary proceedings will be available at the workshop. The post proceeding will be published as an EPTCS volume. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. Enquiries can be sent to the PC co-chairs. ** Important Dates ** Abstract (title & abstract): 14th December 2012 Paper Submission (up to 5 pages): 21st December 2012 Paper Notification: 23rd January 2012 Final versions of papers: 4th February 2012 ** Program Committee ** Alastair Beresford, University of Cambridge, UK Viviana Bono, Universita di Torino, Italy Alastair Donaldson, Imperial College London, UK Dan Ghica, University of Birmingham, UK Joshua Guttman, Worcester Polytechnic Institute, MA, US Thomas Hildebrandt, University of Copenhagen, Denmark Paul Keir, Codeplay Ltd, UK Hans-Wolfgang Loidl, Heriot-Watt University, UK Conor McBride, University of Strathclyde, UK Jeremy Singer, University of Glasgow, UK Sven-Bodo Scholz, Heriot-Watt University, UK Nikhil Swamy, Microsoft Research, US Wim Vanderbauwhede (co-chair), University of Glasgow, UK Hugo Torres Vieira, Universidade de Lisboa, Portugal Nobuko Yoshida (co-chair), Imperial College London, UK ** Organizing Committee ** Alastair Beresford, University of Cambridge, UK 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 -------------- next part -------------- An HTML attachment was scrubbed... URL: From patrick.baillot at ens-lyon.fr Mon Nov 12 17:09:19 2012 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Mon, 12 Nov 2012 23:09:19 +0100 Subject: [TYPES/announce] Computer Science Symposium in Russia (CSR 2013) - Call for papers Message-ID: <20121112230919.19053szkia89m07j@webmail.ens-lyon.fr> ******************************************************************************* First Call for Papers 8th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2013) June 25-29, 2013, Ekaterinburg, Russia http://csr2013.urfu.ru/ ******************************************************************************* CSR 2013 intends to reflect the broad scope of international cooperation in computer science. It is the eighth conference in a series of regular events previously held in St.Petersburg (2006), Ekaterinburg (2007), Moscow (2008), Novosibirsk (2009), Kazan (2010), St.Petersburg (2011), and Nizhny Novgorod (2012). The proceedings are published in Springer LNCS. IMPORTANT DATES Deadline for submissions: December 11, 2012 Notification of acceptance: February 13, 2013 Conference dates: June 25-29, 2013 As it has become a tradition, there will be YANDEX AWARDs for the best paper and for the best student paper! VENUE Ekaterinburg is a large city in the heart of Russia, 1600 km (a 2 hour flight) east from Moscow. It is the capital city as well as the main financial, cultural, and scientific centre of the Ural region. Ekaterinburg is accessible by direct regular flights of a number of international airlines including Lufthansa, Aeroflot, Finnair, Czech Airlines, Turkish Airlines, and FlyDubai. Ural Federal University is the largest Russian university outside Moscow. TOPICS include, but are not limited to: * algorithms and data structures * automata and formal languages * combinatorial optimization * constraint solving * computational complexity * cryptography * combinatorics in computer science * computational models and concepts * algorithms for concurrent and distributed systems, networks * proof theory and applications of logic to computer science * model checking * automated reasoning * deductive methods CONFIRMED INVITED SPEAKERS * Mario Szegedy (Rutgers) will give an opening lecture * Thomas Colcombet (CNRS) * Gilles Dowek (INRIA) * Alexandr Kostochka (University of Illinois at Urbana-Champaign / Novosibirsk State University) * Nicole Schweikardt (Goethe University) * Jeffrey Shallit (University of Waterloo) * Ryan Williams (Stanford University) PROGRAM COMMITTEE * Max Alekseyev (University of South Carolina) * Andris Ambainis (University of Latvia) * Maxim Babenko (Higher School of Economics, Moscow) * Patrick Baillot (ENS Lyon) * Glencora Borradaile (Oregon State University) * Andrei Bulatov (Simon Fraser University) Chair * Yijia Chen (Shanghai Jiao Tong University) * Victor Dalmau (University Pompeu Fabra) * Yevgeniy Dodis (Courant Institute of Mathematical Sciences) * Manfred Droste (University Leipzig) * Anna Frid (Sobolev Institute of Mathematics) * Hamed Hatami (McGill University) * Tero Harju (University of Turku) * Michal Koucky (Mathematical Institute of Czech Academy of Sciences) * Stephan Kreutzer (Tecnical University of Berlin) * Alexander Kulikov (Steklov Institute of Mathematics at St. Petersburg) * Konstantin Makarychev (Microsoft Research at Redmond) * Simone Martini (University of Bologna) * Jaroslav Nesetril (Charles University) * Jean-Eric Pin (University Paris 7) * Harald Raecke (University of Munich) * Alexander Razborov (University of Chicago and Steklov Mathematical Institute) * Mikhail Volkov (Ural Federal University) ORGANIZERS B.N.Yeltsin Ural Federal University, Ekaterinburg, Russia CONFERENCE CHAIR Arseny Shur (Ural Federal University) SUBMISSIONS Authors are invited to submit an extended abstract or a full paper of at most 12 pages in the LNCS format (LaTeX, as pdf; final version with source), in English; instructions can be found at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. Proofs and other material omitted due to space constraints are to be put into a clearly marked appendix to be read at discretion of the referees. Papers must present original (and not previously published) research. Simultaneous submission to journals or to other conferences with published proceedings is not allowed. The proceedings of the symposium will be published in Springer's LNCS series. Accepted papers MUST be presented at the symposium. Submissions should be uploaded to the EasyChair Conference system: http://www.easychair.org/conferences/?conf=csr2013 FURTHER INFORMATION AND CONTACTS Web: http://csr2013.urfu.ru/ Email: csr2013 at urfu.ru From lunjin.lu at gmail.com Tue Nov 13 09:52:25 2012 From: lunjin.lu at gmail.com (Lunjin Lu) Date: Tue, 13 Nov 2012 09:52:25 -0500 Subject: [TYPES/announce] Tenure Track Faculty Positions Message-ID: OAKLAND UNIVERSITY COMPUTER SCIENCE AND ENGINEERING DEPARTMENT Tenure-track Faculty Positions The Department of Computer Science and Engineering invites applications for two tenure-track positions to begin in Fall 2013. We are primarily seeking candidates at the Assistant Professor level but exceptional candidates at the Associate Professor level will be considered. Applicants must have completed a Ph.D. degree in Computer Science, Information Technology, or a closely related field by the appointment date. Candidates must show exceptional promise in both research and teaching. Desired areas of interest include theory of computation, algorithms, software engineering, and high performance computing. Only applicants whose research and teaching interests fall under these or very closely related areas will be considered. Applications should be submitted by December 1, 2012. Application package should include a letter of intent, a statement of research, a statement of teaching, curriculum vitae, and information of three references. The package should be submitted at https://academicjobs.oakland.edu/postings/483. The teaching statement should include a list of undergraduate and graduate courses that the applicant will be willing to teach and outlines of two courses that the applicant would like to introduce. Information about the current courses offered by the department is available on departmental website at http://www.cse.secs.oakland.edu. Oakland University is a public institute located in southeastern Michigan with over 19,000 students. The department is currently offering BSc. Degrees in Computer Science and in Information Technology, MSc. degrees in Computer Science and in Software Engineering and Information Technology, and a Ph.D. in Computer Science and Informatics. For information about the department and Oakland University, please visit the respective homepages. Oakland University is an equal opportunity employer. From viktor at mpi-sws.org Thu Nov 15 06:35:21 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Thu, 15 Nov 2012 12:35:21 +0100 Subject: [TYPES/announce] ACM POPL 2013: Call for participation Message-ID: <6470DEF2-A41F-417E-9F4E-8CD3F91DB2E8@mpi-sws.org> ** CALL FOR PARTICIPATION ** ACM POPL 2013 & Co-located Events ************************************************** You can now register to the 40th ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL 2013) and co-located events!! POPL: Principles of Programming Languages Hotel Parco dei Principi Rome, Italy 23-25 January, 2013 Main web site: http://popl.mpi-sws.org/2013/ Registration site: https://regmaster3.com/2013conf/POPL13/register.php Deadline for early registration: **December 31, 2012** Conference & Hotel logistics: http://popl13.di.univr.it The POPL week January 20-26, 2013: - VMCAI: Verification, Model Checking, and Abstract Interpretation (20-22 January) - PADL: International Symposium on Practical Aspects of Declarative Languages (21-22 January) - PEPM: Partial Evaluation and Program Manipulation (21-22 January) - ID: Interference and Dependence (21 January) - SVARM: Workshop on Synthesis, Verification, and Analysis of Rich Models - Meeting of COST Action IC0109 Rich Model Toolkit (21 January) - BEAT: Workshop on Behaviors and Types (22 January) - DDFP: Workshop on Data Driven Functional Programming (22 January) - PLPV: Programming Languages meets Program Verification (22 January) - PLMW: Programming Language Mentoring Workshop (22 January) - POPL: Principles of Programming Languages (23-25 January) - PPREW: Program Protection and Reverse Engineering Workshop (26 January) - OBT: Off The Beaten Track: Underrepresented Problems for Programming Language Researchers (26 January) Follow POPL2013 on Twitter: https://twitter.com/POPL2013 From murano at na.infn.it Fri Nov 16 05:09:57 2012 From: murano at na.infn.it (Nello Murano) Date: Fri, 16 Nov 2012 11:09:57 +0100 (CET) Subject: [TYPES/announce] SR 2013 - Call for contributions Message-ID: <38917.172.16.4.15.1353060597.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ***************************************************************** ------ SR 2013 ----- ***************************************************************** First International Workshop on Strategic Reasoning Rome, Italy, March 16th-17th, 2013 http://www.strategicreasoning.net/ ********************************************************** | CALL FOR CONTRIBUTIONS | ********************************************************** OBJECTIVES Strategic reasoning is one of the most active research area in multi-agent system domain. The literature in this field is extensive and provides a plethora of logics for modeling strategic ability. Theoretical results are now being used in many exciting domains, including software tools for information system security, robot teams with sophisticated adaptive strategies, and automatic players capable of beating expert human adversary, just to cite a few. All these examples share the challenge of developing novel theories and tools for agent strategies that take into account the likely behavior of adversaries. The SR international workshop aims to bring together researchers working on different aspects of strategic reasoning in computer science, both from a theoretical and a practical point of view. LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: - Logics for reasoning about strategic abilities - Logics for multi-agent mechanism design, verification, and synthesis - Logical foundations of decision theory for multi-agent systems - Strategic reasoning in formal verification - Automata theory for strategy synthesis - Strategic reasoning under perfect and imperfect information - Applications and tools for cooperative and adversarial reasoning - Robust planning and optimization in multi-agent systems - Risk and uncertainty in multi-agent systems - Quantitative aspects in strategic reasonings CO-LOCATED EVENT SR 2013 is an ETAPS 2013 workshop. ETAPS 2013 will be held on March 16th-24th, 2013. INVITED SPEAKERS - Krishnendu Chatterjee (IST Austria) - Alessio R. Lomuscio (Imperial College London) - Jean-Francois Raskin (Universit? Libre de Bruxelles) - Michael Wooldridge (University of Oxford) PAPER SUBMISSION Submitted papers should not exceed five pages using EPTCS format (http://style.eptcs.org). If necessary, the paper may be supplemented with a clearly marked appendix, which will be consulted at the discretion of the programme committee. Submissions must be in PDF format and will be handled via EasyChair ( https://www.easychair.org/conferences/?conf=sr2013 ). Two types of submission are invited: - Papers reporting on novel research, and - Expository papers reporting on published work. Each submission should be clearly identified as belonging to one category or the other. In both categories, strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and all papers should be written so that they are accessible to such an audience. Novel research abstracts will be held to the usual high standards of novel research publications. In particular, they should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the significance of the work its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Expository abstracts, which will be held to similarly high standards, may survey an area or report on a more specific previously published work; the submission should make clear the relevance to the strategic reasoning audience. Papers accepted for presentation (in both categories) will be collected as an EPTCS volume. Submissions from PC members are also allowed. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. IMPORTANT DATES Abstract submission: December 15, 2012 Paper submission: December 20, 2012 Acceptance notification: January 17, 2013 Final version: January 31, 2013 Workshop: March 16-17, 2013 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 workshop papers is also under consideration. PROGRAM CO-CHAIRS Fabio Mogavero, Universit? di Napoli Federico II, Italy Aniello Murano, Universit? di Napoli Federico II, Italy Moshe Y. Vardi, Rice University, Texas, USA PROGRAM COMMITTEE - Thomas Agotnes, University of Bergen, Norway - Dietmar Berwanger, RWTH Aachen, Germany - Valenting Goranko, Technical University of Denmark, Denmark - Joseph Y. Halpern, Cornell University, New York, USA - Wojtek Jamroga, University of Luxembourg, Luxembourg - Orna Kupferman, Hebrew University, Israel - Nicolas Markey, CNRS de Cachan, France - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Ramaswamy Ramanujam, Institute of Mathematical Sciences, India - Wolfgang Thomas, RWTH Aachen, Germany - Moshe Y. Vardi, Rice University, Texas, USA ORGANIZING COMMITTEE - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Giuseppe Perelli, Universit? di Napoli Federico II, Italy - Loredana Sorrentino, Universit? di Napoli Federico II, Italy INFO Please visit the conference website (http://www.strategicreasoning.net/) for more information. From gareth at totherme.org Mon Nov 19 09:04:22 2012 From: gareth at totherme.org (Gareth Smith) Date: Mon, 19 Nov 2012 14:04:22 +0000 (GMT) Subject: [TYPES/announce] PLMW: Mentoring at POPL Message-ID: <20121119.140422.1405021423450463212.gareth@totherme.org> CALL FOR PARTICIPATION SIGPLAN Programming Languages Mentoring Workshop, Rome Tuesday January 22, 2013 Co-located with POPL 2013 PLMW web page: http://www.doc.ic.ac.uk/~gds/PLMW/index.html After the resounding success of the first Programming Languages Mentoring Workshop at POPL 2012, we proudly announce the 2nd SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2013 and organised by Nate Foster, Philippa Gardner, Alan Schmitt, Gareth Smith, Peter Thieman and Tobias Wrigstad. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will provide technical sessions on cutting-edge research in programming languages, and mentoring sessions on how to prepare for a research career. We will bring together leaders in programming language research from academia and industry to give talks on their research areas. The workshop will engage students in a process of imagining how they might contribute to our research community. We especially encourage women and underrepresented minority students to attend PLMW. Since PLMW will be in Rome this year, we particularly look forward to seeing Eastern European students at the workshop. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay through the entire conference, and will also attend the POPL tutorials on Monday 21st January which are free to PLMW registered attendees. Through the generous donation of our sponsors, we are able to provide scholarships to fund student participation. These scholarships will cover reasonable expenses (airfare, hotel and registration fees) for attendance at both the workshop and the POPL conference. Students attending this year will get one year free student membership of SIGPLAN The workshop registration is open to all. Students with alternative sources of funding are welcome. APPLICATION for PLMW scholarship: The scholarship application can be accessed from the workshop web site (http://www.doc.ic.ac.uk/~gds/PLMW/index.html). The deadline for full consideration of funding is 9th December, 2012. Selected participants will be notified from Friday 14th December, and will need to register for the workshop by December 24th. SPONSORS: Imperial College London Jane Street Monoidics NSF Resource Reasoning SIGPLAN vmware From hans at cs.aau.dk Mon Nov 19 10:47:15 2012 From: hans at cs.aau.dk (=?iso-8859-1?Q?Hans_H=FCttel?=) Date: Mon, 19 Nov 2012 15:47:15 +0000 Subject: [TYPES/announce] Call for Participation: BEAT'13 Message-ID: CALL FOR PARTICIPATION 1st International Workshop on Behavioural Types Tuesday January 22, 2013 Co-located with POPL 2013 BEAT'13 web page: http://beat13.cs.aau.dk Behavioural type systems in general, and in particular those based on typestate, are attracting a lot of attention as these are able to ensure more than the usual safety guarantees of static program analyses. In the last ten years the idea of "types-as-processes" has been explored in several directions, providing dedicated type algebras for particular properties, ranging from protocol compatibility to race-freedom or activeness, as well as general type systems for a wide range of properties. The approaches include those of session types, generic type systems and behavioural ontracts as well as other type-theoretic notions, e.g. intersection types, that can be used to specify the behaviour of systems. These approaches have given rise to several important results. This workshop aims to present contributions on the theory and applications of behavioural types and to foster discussion on the pros and cons of different approaches and on new directions and challenges in the area. Program: ------------- 9:00 David Pearce: A Calculus for Constraint-Based Flow Typing 9:30 Mario Coppo, Mariangiola Dezani-Ciancaglini, Luca Padovani, Nobuko Yoshida: Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions 10:00-10:30: Break 10:30 Thomas Hildebrandt, Marco Carbone: TBA (Types for Behavioural Analysis) 11:15 Naoki Kobayashi: TBA (Types for Behavioural Analysis) 12:00 Lunch 2:30 Massimo Bartoletti, Alceste Scalas, Emilio Tuosto, Roberto Zunino: Honesty by Typing 3:00 Vasco Vasconcelos: TBA (Types for Behavioural Analysis) 3:45 Jakob Rehof: TBA (Types for Behavioural Analysis) 4:30: End of Workshop -- Hans H?ttel (hans at cs.aau.dk) Department of Computer Science Aalborg University Denmark -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.ohearn at ucl.ac.uk Mon Nov 19 15:26:53 2012 From: p.ohearn at ucl.ac.uk (O'Hearn, Peter) Date: Mon, 19 Nov 2012 20:26:53 +0000 Subject: [TYPES/announce] Lectureship at University College London Message-ID: <85AE53BB-AD1C-486F-9EB5-29D0CC3D1D78@live.ucl.ac.uk> -------- Lectureship at University College London, with focus on Programming Languages and Verification --------- A faculty position is available at UCL in the Programming Principles, Logic and Verification research group http://pplv.cs.ucl.ac.uk/ Our interests span theory and practice, and applicants will be considered across the range of work in programming languages and verification, including in semantics, program analysis, language design, compilation, and theorem proving. The appointment will be made at the rank of Lecturer or, where warranted, Senior Lecturer (analogous to Assistant Professor, and junior Associate Professor, respectively, in the US system). The closing date for applications is 11 Jan 2013. Further information, including how to apply, can be found on https://atsv7.wcn.co.uk/search_engine/jobs.cgi?owner=5041178&ownertype=fair&jcode=1294859 Peter O'Hearn From herbert at doc.ic.ac.uk Tue Nov 20 11:33:45 2012 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Tue, 20 Nov 2012 16:33:45 +0000 Subject: [TYPES/announce] QAPL 2013 - second call for papers [New: Invited talks] Message-ID: <50ABB0E9.4020005@doc.ic.ac.uk> [Apologies for multiple copies] ******************************************************************************** SECOND CALL FOR PAPERS Eleventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2013) Affiliated with ETAPS 2013 March 23 - 24, 2013, Rome, Italy http://qapl2013.units.it qapl2013 at units.it [New: Titles for invited talks] ******************************************************************************** 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 quantitative analysis of systems, for instance probabilistic and timing properties (e.g. security, safety, schedulability) and other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements); * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Cyber-physical systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Alessandra Di Pierro, University of Verona, Italy Probabilistic static analysis and security trade-offs * Paolo Zuliani, University of Newcastle, UK Statistical Model Checking for Cyber-Physical Systems Other invited speakers will be shared with MLQA (http://wiki.ercim.eu/wg/MLQA/index.php/MLQA_2013) SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits two types of submissions - regular papers and presentation reports: 1. Regular paper submissions must be original work, and must not have been previously published, nor be under consideration for publication elsewhere. Regular paper submission must not exceed 15 pages, possibly followed by a clearly marked appendix which will be removed for the proceedings and contains technical material for the reviewers. 2. Presentation reports concern recent or ongoing work on relevant topics and ideas, for timely discussion and feedback at the workshop. There is no restriction as for previous/future publication of the contents of a presentation. Typically, a presentation is based on a paper which recently appeared (or which is going to appear) in the proceedings of another recognized conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 4 pages. All submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: http://www.easychair.org/conferences/?conf=qapl13 The workshop PC will review all regular paper submissions to select appropriate ones, ones for acceptance in each category, based on their relevance, merit, originality, and technical content. Presentation reports will receive a light weight review to establish their relevance for the workshop. The authors of accepted submissions of both types are expected to present and discuss their work at the workshop. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue concerning the QAPL editions of 2011 and 2012 is in preparation and a further special issues related to the QAPL editions of 2013 and 2014 will be considered. IMPORTANT DATES: For regular papers: Abstract (optional): December 16, 2012 Submission (regular paper): December 20, 2012 Notification: January 20, 2013 Final version (ETAPS proceedings): February 3, 2013 Workshop: March 23-24, 2013 Final version (EPTCS post proceedings): TBA For presentation reports: Submission: January 23, 2013 Notification: January 25, 2013 ORGANIZATION: PC Chairs: * Luca Bortolussi, University of Trieste, Italy * Herbert Wiklicky, Imperial College London, UK Program Committee: * Alessandro Aldini, University of Urbino, Italy * Christel Baier, Technical University of Dresden, Germany * Ezio Bartocci, TU Wien, Austria * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, INRIA Rennes, France * Luca Bortolussi, University of Trieste, Italy * Tomas Brazdil, Masaryk University, Czech Republic * Kostas Chatzikokolakis, CNRS, France * Pedro D'Argenio, University of Cordoba, Argentina * Alessandra Di Pierro, University of Verona, Italy * Vashti Galpin, University of Edinburgh, UK * Joost-Pieter Katoen, RWTH Aachen, Germany * Richard Hayden, Imperial College London, UK * Holger Hermanns, University of Saarland, Germany * Mieke Massink, CNR-ISTI, Pisa, Italy * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Birmingham, UK * Anne Remke, University of Twente, the Netherlands * Jeremy Sproston, University of Torino, Italy * Mirco Tribastone, LMU Munich, Germany * Franck Van Breugel, York University, Canada * Herbert Wiklicky, Imperial College London, UK * Verena Wolf, University of Saarland, Germany From stephen.kell at usi.ch Tue Nov 20 12:23:19 2012 From: stephen.kell at usi.ch (Stephen Kell) Date: Tue, 20 Nov 2012 18:23:19 +0100 Subject: [TYPES/announce] CfP: Software Composition 2013 Message-ID: <20121120182319.353ecd19@ernest-5> [Type systems feature prominently in various approaches to software composition. The following call for papers may therefore be of interest to many list members.] 12th International Conference on Software Composition (SC 2013) June 19--20 2013, Budapest, Hungary http://sc2013.ec-spride.de/ The International Conference on Software Composition (SC) is the leading venue that addresses challenges of how composition of software parts may be used to build and maintain large software systems. Software Composition 2013 will be the 12th edition in the series, and we invite researchers and practitioners to submit high-quality papers. Submissions that relate theory and practice of software composition are particularly welcome. Software Composition 2013 takes place in Budapest on June 19--20 2013, as part of the TOOLS 2013 Federated Conferences (happening over June 17--21). Topics of Interest: The SC 2013 program committee seeks original, high-quality papers related to software composition, including but not limited to the following topics: * Component-based software engineering * Composition and adaptation techniques * Composition algebras, calculi and type systems * Feature-oriented software development * Aspect-oriented software development * Model-driven composition * Models of computation * Verification, validation and testing * Dynamic composition and reconfiguration * Large-scale component-based systems * Cloud, service-oriented architectures * Business process orchestration * Visual composition environments * Performance optimization of composite systems We solicit high-quality submissions on research results and/or experience (up to 16 pages, LNCS format, including bibliography and figures) describing a technical contribution in depth. Short and position papers are also welcome for the work in progress session (up to 8 pages, LNCS format, including bibliography and figures). Short submissions must concisely capture ongoing work, new ideas, and experiences. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. Submitted papers must be unpublished and not submitted for publication elsewhere. As in previous years, the proceedings of the conference will be published as a volume in Springer's Lecture Notes in Computer Science. Conference Web Site: Important Dates: Abstract submission: January 20, 2013 (optional) Paper submission: January 25, 2013 (23:59 anywhere on earth) Acceptance notification: March 10, 2013 Camera-ready copy: March 22, 2013 General Chair: Welf L?we, Linnaeus University, Sweden Program Chairs: Walter Binder, University of Lugano, Switzerland Eric Bodden, Technische Universit?t Darmstadt, Germany Publicity Chair: Stephen Kell, University of Lugano, Switzerland Program Committee: Danilo Ansaloni, University of Lugano, Switzerland Sven Apel, University of Passau, Germany Olivier Barais, University of Rennes 1, France Alexandre Bergel, University of Chile, Chile Domenico Bianculli, University of Luxembourg, Luxembourg Daniele Bonetta, University of Lugano, Switzerland Lubom?r Bulej, Charles University, Czech Republic Shigeru Chiba, University of Tokyo, Japan Ion Constantinescu, Google, USA Schahram Dustdar, Vienna University of Technology, Austria Erik Ernst, University of Aarhus, Denmark Bernd Freisleben, University of Marburg, Germany Thomas Gschwind, IBM Zurich Research Lab, Switzerland Michael Haupt, Oracle Labs, Germany Christian K?stner, Carnegie Mellon University, USA Doug Lea, State University of New York at Oswego, USA Karl Lieberherr, Northeastern University, USA David Lorenz, The Open University, Israel Hidehiko Masuhara, University of Tokyo, Japan Oscar Nierstrasz, University of Bern, Switzerland Jacques Noy?, Ecole des Mines de Nantes, France Ina Schaefer, Technische Universit?t Braunschweig, Germany Andreas Sewe, Technische Universit?t Darmstadt, Germany Mario S?dholt, Ecole des Mines de Nantes, France Clemens Szyperski, Microsoft Research, USA Immanuel Trummer, EPFL, Switzerland Alex Villaz?n, Universidad Privada Boliviana, Bolivia Eric Wohlstadter, University of British Columbia, Canada Thomas W?rthinger, Oracle Labs, Austria Cheng Zhang, Shanghai Jiao Tong University, China From David.Pichardie at irisa.fr Wed Nov 21 09:00:50 2012 From: David.Pichardie at irisa.fr (David Pichardie) Date: Wed, 21 Nov 2012 15:00:50 +0100 Subject: [TYPES/announce] ITP 2013: Call for workshop proposals Message-ID: ITP 2013: Fourth Conference on Interactive Theorem Proving Rennes, France, July 23 - 26, 2013 http://itp2013.inria.fr THE ITP CONFERENCE SERIES SCOPE AND ORGANIZATION OF WORKSHOPS The ITP conference series is concerned with all topics related to Interactive Theorem Proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and formalization of mathematics. The fourth ITP conference, ITP 2013, will be held in Rennes, France, between July 23th and July 26th, 2013. Similar to previous iterations of the conference, researchers and practitioners are invited to submit proposals for colocated workshops on topics relating to interactive theorem proving. Workshops can target the ITP community in general, focus on a particular ITP system, or highlight more specific issues or recent developments.Proposals for in-depth tutorials or tool introductions are also welcome. All colocated events will precede the main conference, and will be held in the Inria Rennes research center. Conference facilities (meeting rooms, standard technical equipment) are offered free of charge to the organizers; workshop-only attendees will enjoy a significantly reduced registration fee. Detailed organizational matters such as paper submission and review process, or publication of proceedings, are up to the organizers of individual workshops. All accepted workshops will be expected to have the program ready by May 1st 2013. FORMAT OF PROPOSALS Proposals for workshops should contain at least the following pieces of information. ? name and contact details of the main organizer(s) ? names of additional organizers (optional) ? title and organizational style of workshop (tutorial, public workshop, project workshop, etc) ? preferred length of workshop (half day, full day etc) ? estimated number of attendees ? short (up to 1 page) description of topic ? (if applicable) pointers to previous editions of the workshop, or to similar events SUBMISSION AND NOTIFICATION DETAILS Proposals are invited to be submitted by email to itp2013 at easychair.org, no later than December 20th, 2012. Selected workshops will be notified by January 9th, 2013. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Christophe.Ringeissen at loria.fr Wed Nov 21 11:15:29 2012 From: Christophe.Ringeissen at loria.fr (Christophe Ringeissen) Date: Wed, 21 Nov 2012 17:15:29 +0100 Subject: [TYPES/announce] FroCoS 2013 First Call for Papers Message-ID: [Apologies for multiple copies] FIRST CALL FOR PAPERS FroCoS 2013 9th International Symposium on Frontiers of Combining Systems Nancy, France September 18-20, 2013 Submission Deadlines: 15 Apr 2013 (Abs.), 22 Apr 2013 (Paper) http://frocos2013.loria.fr/ GENERAL INFORMATION The 9th International Symposium on Frontiers of Combining Systems will be held in Nancy, France, from 18-20 September 2013. The aim of the conference is to publish and promote progress in research areas requiring the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. FroCos 2013 will be co-located with the 22nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2013) held 16-19 September 2013. A joint invited speaker and joint session is planned. SCOPE OF CONFERENCE: In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference mechanisms for special tasks. To be usable in practice, these specialized systems must be combined with each other, and must be integrated into general purpose systems. This has led in many research areas to the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. The International Symposium on Frontiers of Combining Systems (FroCoS) traditionally focusses on these types of research questions and activities. Like its predecessors, FroCoS 2013 seeks to offer a common forum for research in the general area of combination, modularization and integration of systems, with emphasis on logic-based ones, and of their practical use. Typical topics of interest include (but are not limited to): * combinations of logics such as combined higher-order, first-order, temporal, modal, or other non-classical logics; * combinations and modularity in ontologies; * combination of decision procedures, of satisfiability procedures, of constraint solving techniques or of logical frameworks; * combination and integration methods in SAT and SMT solving; * combinations and modularity in term rewriting; * integration of equational and other theories into deductive systems; * combination of deduction systems and computer algebra; * integration of data structures into constraint logic programming and deduction; * hybrid methods for deduction, resolution and constraint propagation; * hybrid systems in knowledge representation and natural language semantics; * combined logics for distributed and multi-agent systems; * logical aspects of combining and modularizing programs and specifications. PUBLICATION DETAILS: It is planned that the proceedings of FroCoS 2013 will be published in the Springer LNCS/LNAI Series. PAPER SUBMISSIONS The program committee seeks high-quality submissions describing original work, written and to be presented in English, not substantially overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://www.easychair.org/conferences/?conf=frocos2013. For each accepted paper, at least one author is required to attend the symposium to present the work. Prospective authors must register a title and an abstract a week before the paper submission deadline. Further information about paper submissions will be available at the conference website. IMPORTANT DATES 15 Apr 2013 Abstract submission 22 Apr 2013 Paper submission 6 Jun 2013 Notification of paper decisions 4 Jul 2013 Camera-ready papers due 18-20 Sep 2013 FroCoS Conference PROGRAM COMMITTEE Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina Alessandro Artale, Free University of Bolzano-Bozen, Italy Franz Baader, TU Dresden, Germany Clark Barrett, New York University, USA Peter Baumgartner, National ICT Australia, Canberra, Australia Christoph Benzmueller, Free University Berlin, Germany Jasmin Christian Blanchette, TU Muenchen, Germany Thomas Bolander, Technical University of Denmark Clare Dixon, University of Liverpool, UK Francois Fages, INRIA Rocquencourt, France Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Vijay Ganesh, University of Waterloo, Canada Silvio Ghilardi, Universita degli Studi di Milano, Italy Guido Governatori, National ICT Australia, Queensland, Australia Bernhard Gramlich, Technische Universitaet Wien, Austria Katsumi Inoue, National Institute of Informatics, Japan Sava Krstic, Intel, USA Alessio Lomuscio, Imperial College London, UK Till Mossakowski, DFKI & University of Bremen, Germany Silvio Ranise, Fondazione Bruno Kessler, Italy Christophe Ringeissen, LORIA, INRIA, France Philipp Ruemmer, Uppsala University, Sweden Renate Schmidt, The University of Manchester, UK Roberto Sebastiani, DISI, University of Trento, Italy Viorica Sofronie-Stokkermans, University Koblenz-Landau, Germany Andrzej Szalas, Linkoepings Universitet, Sweden & University of Warsaw, Poland Rene Thiemann, University of Innsbruck, Austria Ashish Tiwari, SRI, USA Josef Urban, Radboud University, The Netherlands Christoph Weidenbach, Max-Planck-Institut fuer Informatik, Germany Frank Wolter, University of Liverpool, UK CONFERENCE CHAIR Christophe Ringeissen, LORIA, INRIA, France PC CHAIRS Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Renate A. Schmidt, The University of Manchester, UK From james.cheney at gmail.com Wed Nov 21 13:24:20 2012 From: james.cheney at gmail.com (James Cheney) Date: Wed, 21 Nov 2012 18:24:20 +0000 Subject: [TYPES/announce] PhD opportunities at the University of Edinburgh Message-ID: Hi, I am recruiting for at least one funded PhD studentship at the University of Edinburgh, working with me on one of the following topics (with further details given at the associated links). * Nominal logic, automated reasoning and type theory ( http://wcms.inf.ed.ac.uk/lfcs/study/nominal-logic-automated-reasoning-and-type-theory ) * Provenance, programming languages, and security ( http://wcms.inf.ed.ac.uk/lfcs/study/provenance-programming-languages-and-security ) * XML query/update languages and static analysis ( http://wcms.inf.ed.ac.uk/lfcs/study/xquery-update-static-analysis) * Provenance, curation, and archiving for scientific data ( http://wcms.inf.ed.ac.uk/lfcs/study/provenance-curation-and-archiving-for-scientific-data ) Projects in other areas related to programming languages, data management, or their intersection are also possible; prospective applicants are encouraged to contact James Cheney (jcheney at inf.ed.ac.uk), Stratis Viglas ( sviglas at inf.ed.ac.uk), Peter Buneman (opb at inf.ed.ac.uk) or Paul Anderson ( dcspaul at ed.ac.uk) to discuss potential project ideas. Possible research topics with others in LFCS are listed at http://wcms.inf.ed.ac.uk/lfcs/study/research-topics along with contact information for prospective supervisors. Available funding can cover full fees and a stipend for a 3-year PhD project for a student from the UK or EU. Additional studentships on similar terms may be available contingent on funding decisions. For students from other countries, the School provides assistance identifying and applying for appropriate sources of funding to cover additional applicable fees. To apply, please follow the instructions at: http://www.ed.ac.uk/schools-departments/informatics/postgraduate/apply/ and apply to the LFCS PhD program (or just jump directly to http://www.ed.ac.uk/studying/postgraduate/degrees?id=493&cw_xml=details.php). The first deadline for applications is *December 14*; applications received by this date will receive full consideration for available funding sources. Please get in touch early in case of questions about the application process, project ideas or study in the UK or Edinburgh. --James -------------- next part -------------- An HTML attachment was scrubbed... URL: From Didier.Galmiche at loria.fr Thu Nov 22 08:41:54 2012 From: Didier.Galmiche at loria.fr (Didier.Galmiche at loria.fr) Date: Thu, 22 Nov 2012 14:41:54 +0100 Subject: [TYPES/announce] Last CFP - JLC Special Issue on Computational Logic, in honour of Roy Dyckhoff Message-ID: <50AE2BA2.2010407@loria.fr> **************************************************************************** Last Call for Papers JOURNAL OF LOGIC AND COMPUTATION Special Issue on Computational Logic, in honour of Roy Dyckhoff *** Extended deadline: December 22nd, 2012 *** **************************************************************************** AIMS AND SCOPE This special issue of the Journal of Logic and Computation (JLC) is devoted to Roy Dyckhoff's broad research interests, as illustrated during the workshop that was held in his honour in November 2011 in St Andrews: http://www.lix.polytechnique.fr/~lengrand/Events/Dyckhoff/ Covered under the title of Computational Logic, the topics include, but are not limited to: - automated reasoning - category theory - constructivity - explicit substitution calculi - functional programming - Gentzen systems (and Beyond) - intuitionistic logic - lambda calculus - linear logic - logic programming - non-classical logics - machine-assisted meta-theory - modal logics - proof-theoretic semantics - proof search - proof theory - provability logic - sequent calculi - tableaux methods - term rewriting - type theory SUBMISSION Submission should be in English, using (at first) the PDF format, and sent to either of the guest editors below. We expect submissions to present original contributions of the highest quality, that have not been previously published in, or submitted to, another journal. Each submission will be subject to two reviewers. IMPORTANT DATES Submission of papers: December 22nd, 2012 Expected publication: Spring 2013 GUEST EDITORS Didier Galmiche, Universit? de Lorraine - LORIA (Didier.Galmiche at loria.fr) St?phane Graham-Lengrand, CNRS - Ecole Polytechnique (graham-lengrand at lix.polytechnique.fr) From pmt6sbc at maths.leeds.ac.uk Fri Nov 23 04:45:21 2012 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Fri, 23 Nov 2012 09:45:21 +0000 (GMT) Subject: [TYPES/announce] Legacy of Reuben Goodstein, Friday 14th December, 2012 Message-ID: _______________________________________________________________________ THE LEGACY OF REUBEN GOODSTEIN His Centennial and the Wittgenstein Connection Friday 14th December 2012, University of Leicester 2012 is the Centenary of the birth of Reuben Louis Goodstein, the first holder of a UK university chair in Mathematical Logic. In honour of Goodstein and his legacy, we are organizing a day recognizing his impact on the development of Mathematical Logic, worldwide, in the UK and at Leicester. The list of distinguished speakers includes: Harvey Rose (Bristol), Jan von Plato (Helsinki), Stanley Wainer (Leeds), Mathieu Marion/Mitsuhiro Okada (Montreal/Keio, Japan), Mike Price (Leicester), Mary Walmsley (Leicester). Topics will include: * Goodstein's theorem in the light of the Bernays-Goodstein correspondence * Goodstein sequences and independence of Peano arithmetic * Goodstein and Wittgenstein * Goodstein and the Mathematical Association * We are also hoping to have a panel discussion entitled 'Goodstein * 'Remembered', where any delegate can share memories and thoughts of Goodstein. We anticipate there will be a number of ex-colleagues and students of Goodstein, and members of the Goodstein family in attendance, and a small evening dinner for speakers and organisers, and guests. The meeting is supported by the London Mathematical Society, and there are a number of bursaries available to UK research students to enable them to attend the meeting. Registration is free. To register, and for details of the programme, please go to the meeting webpage: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein Download a copy of the conference poster: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein/Goodstein.pdf __________________________ Organisers: S. Barry Cooper (Leeds), Jeremy Levesley (Leicester), Rick Thomas (Leicester), Paul Williams (LSE) From rensink at cs.utwente.nl Fri Nov 23 06:52:17 2012 From: rensink at cs.utwente.nl (Arend Rensink) Date: Fri, 23 Nov 2012 12:52:17 +0100 Subject: [TYPES/announce] EAPLS PhD Award 2012: Call for Nominations Message-ID: <50AF6371.8060603@cs.utwente.nl> EAPLS PhD Award 2012: Call for Nominations ========================================== URL: http://eapls.org/pages/phd_award/ The European Association for Programming Languages and Systems has established a Best Dissertation Award in the international research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. Eligibility ----------- Eligible for the award are those who successfully defended their PhD * at an academic institution in Europe * in the field of Programming Languages and Systems * in the period from 1 November 2011 ? 1 November 2012 Nominations ----------- Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the thesis to http://www.easychair.org/conferences/?conf=eaplsphd2012. The nomination must be accompanied by (a zip file containing) * a letter from the supervisor describing why the thesis should be considered for the award; * a report from an independent researcher who has acted as examiner of the thesis at its defense. The theses will be evaluated with respect to originality, influence, relevance to the field and (to a lesser degree) quality of writing. Procedure --------- The nominations will be evaluated and compared by an international committee of experts from across Europe. The procedure to be followed is analogous to the review phase of a conference. The justification by the supervisor and the external report will play an important role in the evaluation. Members of the expert committee are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner to have received the EAPLS PhD award 2012. The supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, as for instance the ETAPS conference. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding, and will not be subject to discussion. Important dates --------------- 31 December 2012: Deadline for nominations 21 March 2013: Announcement of the award winner Expert committee ---------------- The Expert committee consists of the following members: * Mark van den Brand, Universiteit Eindhoven, The Netherlands * Giorgio Ghelli, University of Pisa, Italy * Paul Klint, CWI and University of Amsterdam, The Netherlands * Jens Knoop, Technische Universit?t Wien, Austria * Greg Michaelson, Heriot-Watt University , Edinburgh, U.K. * Arend Rensink, Universiteit Twente, The Netherlands * Peter Van Roy, Universit? Catholique de Louvain, Belgium Further members will be confirmed shortly. From flaviomoura at unb.br Fri Nov 23 07:31:03 2012 From: flaviomoura at unb.br (Flavio L. C. de Moura) Date: Fri, 23 Nov 2012 10:31:03 -0200 Subject: [TYPES/announce] SCSS 2012 - call for participation Message-ID: <6980647E-521E-4D40-8AED-872F71995EF0@unb.br> Call for Participation 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. 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. Invited Speakers Gerad Huet (France) Title: Eilenberg machines revisited as a general paradigm for relational programming. Abstract: click here Kazuhiro Yokoyama (Japan) Title: Quantifier Elimination for Solving Real Engineering Problems. Abstract: click here Registration for Non Residents in Tunisia Early Registration fee* Late Registration fee** Hotel Supplement*** Authors: 350 Euros Authors: 450 Euros 250 Euros Academic: 400 Euros Academic: 500 Euros 250 Euros Industry: 450 Euros Industry: 550 Euros 250 Euros Registration for Residents in Tunisia Early Registration fee* Late Registration fee** Hotel Supplement*** Authors: 700 TND Authors: 800 TND 500 TND Visitors: 400 TND Visitors: 500 TND 500 TND * Registration includes: Admission to all technical sessions, refreshment breaks, two lunches, one dinner party and one e-copy of the proceedings. The registration fee does not cover the cost of accommodation or transport, which must be borne by the participant. For authors, registration fees are due for each accepted paper. ** Early registration is open until November 30, 2012. After this date, the late registration fees will be applicable. *** This includes accommodation in the symposium's hotel (Five stars hotel at Gammarth) for three nights (check in: December 14, 2012 and check out: December 17, 2012), three breakfasts and two Dinners. Cancellation An administration fee of 200 Euros will be deducted from any refund issued. Payment Information and How to Register Registration for the conference will only be effective once all fees have been paid. Payment should be made by bank transfer to the following account: Account Holder: Association Tunisienne de la Securite Numerique (ATSN) Bank: La Poste Tunisienne - Bureau Montplaisir RIB: 17 001 0000000 776960 24 IBAN: TN59 1700 1000 0000 7769 6024 Code BIC/SWIFT: LPTNTNTT Questions Questions should be sent to Adel BOUHOULA. email: bouhoula at gmail.com 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) We look forward to seeing you in beautiful Tunisia. -------------- next part -------------- An HTML attachment was scrubbed... URL: From grosu at illinois.edu Fri Nov 23 10:54:13 2012 From: grosu at illinois.edu (Rosu, Grigore) Date: Fri, 23 Nov 2012 15:54:13 +0000 Subject: [TYPES/announce] Postdoc position at UIUC in programming languages In-Reply-To: <0A9D1F138D97BC4F9ACD513FCDC4001735D77A6D@CITESMBX4.ad.uillinois.edu> References: <0A9D1F138D97BC4F9ACD513FCDC4001735D77A4B@CITESMBX4.ad.uillinois.edu>, <0A9D1F138D97BC4F9ACD513FCDC4001735D77A6D@CITESMBX4.ad.uillinois.edu> Message-ID: <0A9D1F138D97BC4F9ACD513FCDC4001735D77C8D@CITESMBX4.ad.uillinois.edu> Disclaimer: This message does NOT include the word "types" in it, as requested on the types list webpage, but the successful candidate will also need to define a static semantics of C/LLVM. -------------------------------------------------------------------------------------------- The Formal Systems Laboratory at UIUC is looking for an excellent postdoc or researcher to work on the formal K semantics of C/LLVM and/or other low-level languages. The semantics will then be used for program analysis and verification, using the novel matching logic approach and mechanical translations of K into Coq/Isabelle/ACL2. If interested, please contact Grigore Rosu (grosu at illinois.edu). Here are links to related projects and background papers: K project (http://k-framework.org); Matching logic (http://matching-logic.org); Existing C semantics (http://code.google.com/p/c-semantics); Existing LLVM semantics (https://github.com/davidlazar/llvm-semantics); popl'12 paper (http://fsl.cs.uiuc.edu/index.php/An_Executable_Formal_Semantics_of_C_with_Applications); oopsla'12 paper: (http://fsl.cs.uiuc.edu/index.php/Checking_Reachability_using_Matching_Logic) Grigore Rosu Department of Computer Science, University of Illinois at Urbana-Champaign Email: grosu at illinois.edu, WWW: http://fsl.cs.uiuc.edu/~grosu From scm-ml at iis.sinica.edu.tw Sat Nov 24 04:03:03 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml at iis.sinica.edu.tw) Date: Sat, 24 Nov 2012 17:03:03 +0800 Subject: [TYPES/announce] PEPM 2013: Call for Participation Message-ID: <20121124170303.73212s7a5jhh1g7b@webmail.iis.sinica.edu.tw> === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 21-22, 2013 Rome, Italy (Affiliated with POPL 2013) CALL FOR PARTICIPATION IMPORTANT DATES * Hotel reservation deadline: December 15, 2012 * Early registration deadline: December 31, 2012 VENUE PEPM'13 and all POPL'13 affiliated events will take place at the Parco dei Principi Hotel in Rome, Italy SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. INVITED TALKS: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations PROGRAM CHAIRS: Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PROGRAM COMMITTEE: * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia and IMDEA Software Institute, Spain)) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Beira Interior, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen, Germany) * Julia Lawall (Inria, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy G. Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden, and Rice University, USA) * Tarmo Uustalu (Institute of Cybernetics, Tallinn, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (Inria, France) PRELIMINARY PROGRAM Monday, January 21, 2013 Program Chairs' Report and Best Paper Award Announcement: 8:45 - 9:00 Invited Talk: 9:00 - 10:00 Session Chair: Shin-Cheng Mu * Zhenjiang Hu: Practical Aspects of Bidirectional Graph Transformations Coffee break 10:30 - 12:30 Session Chair: Samir Genaim * Jeroen Weijers, Jurriaan Hage and Stefan Holdermans: Security Type Error Diagnosis for Higher-Order, Polymorphic Languages * Axel Simon: Deriving a Complete Type Inference for Hindley-Milner and Vector Sizes using Expansion * Francisco Javier L?pez-Fraguas and Enrique Martin-Martin: Typing as Functional-Logic Evaluation * Kostis Sagonas, Josep Silva and Salvador Tamarit: Precise Explanation of Success Typing Errors 14:30 - 16:00 Session Chair: Jeremy Siek * Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti: Verifying Programs via Iterated Specialization * Ryosuke Sato, Hiroshi Unno and Naoki Kobayashi: Towards a Scalable Software Model Checker for Higher-Order Programs * Michael Carbin, Deokhwan Kim, Sasa Misailovic and Martin Rinard: Verified Integrity Properties for Safe Approximate Program Transformations Coffee break 16:30 - 17:30 Session Chair: Bruno Oliveira * Marco Comini and Luca Torella: TRSynth: a Tool for Automatic Inference of Term Equivalence in Left-linear Term Rewriting Systems * Martin Sulzmann, J?rgen Nicklisch and Axel Zechner: Traceability and Correctness of EDSL Abstractions Tuesday, January 22, 2013 Invited Talk: 9:00 - 10:00 Session Chair: Elvira Albert * Peter Thiemann: Partially Static Operations Coffee break 10:30 - 12:30 Session Chair: Kazutaka Matsuda * Bruno Martinez, Marcos Viera and Alberto Pardo: Just Do It While Compiling!: Fast Extensible Records in Haskell * Bruno Oliveira and Andres Loh: Abstract Syntax Graphs for Domain Specific Languages * Dominique Devriese, Ilya Sergey, Dave Clarke and Frank Piessens: Fixing Idioms - A Recursion Primitive for Applicative DSLs * ?lvaro Garc?a-P?rez and Pablo Nogueira: A Syntactic and Functional Correspondence between Reduction Semantics and Reduction-Free Full Normalisers 14:30 - 16:00 Session Chair: Roberto Giacobazzi * Marco Servetto and Elena Zucca: A Meta-Circular Language for Active Libraries * Mar?a Alpuente, Marco A. Feli? and Alicia Villanueva: Automatic Inference of Specifications using Matching Logic * Qiang Sun, Yuting Chen and Jianjun Zhao: Constraint-Based Locality Analysis for X10 Programs Coffee break 16:30 - 17:00 Session Chair: Jurriaan Hage * Baris Aktemur, Yukiyoshi Kameyama, Oleg Kiselyov and Chung‐ chieh Shan: Shonan Challenge for Generative Programming ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From elaine at mat.ufmg.br Sat Nov 24 08:33:32 2012 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Sat, 24 Nov 2012 08:33:32 -0500 Subject: [TYPES/announce] IMLA 2013 -- Last call for papers Message-ID: 6th Workshop on Intuitionistic Modal Logic and Applications https://sites.google.com/site/imodallogic2013/ April 7, 2013 Affiliated with the 4th World Congress on Universal Logic [UNILOG 2013] http://uni-log.org/start4.html Rio de Janeiro, Brazil April 3-7, 2013 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications of constructive modal logics are in type disciplines for programming languages, meta-logics for reasoning about a variety of computational phenomena and explanatory frameworks in philosophical logic. The workshop aims at developing and explaining theoretical and methodological issues centered around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question of which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. In its sixth edition, the Workshop on Intuitionistic Modal Logic and Applications will take place in Rio de Janeiro at the feet of the Sugar Loaf at the military school EsCEME. Previous editions of this conference were held: as part of the 14th Congress of Logic, Methdology and Philosophy of Science, Nancy, France, 25 July, 2011, as part of LiCS2008, Pittsburgh, USA, as part of LiCS2005, Chicago, USA, of FLoC2002, Copenhagen, Denmark and as part of FLoC1999, Trento, Italy. Topics of interest to this forum include, but are not limited to: * Modal Logics * Logical frameworks * Proof theory * Type theory * Automated deduction * Formal semantics of languages and systems * Applications IMLA 2013 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions Contributions should be written in English and submitted in the form of full papers (with a maximum of 12 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 IMLA 2013 page at Easychair https://www.easychair.org/conferences/?conf=imla2013 until the submission deadline in December 1st, by midnight, Central European Standard Time (GMT+1). The workshop pre-proceedings will be handed-out at workshop registration. At least one of the authors should register at the conference. The paper presentation should be in English. Important Dates Paper submission deadline: December 1st, 2012 Author notification: January 15th, 2013 Workshop: April 7th, 2013 Scientific and Organizing Committee * Valeria de Paiva (School of Computer Science, University of Birmingham, UK) * Mario Benevides (COPPE-IM, UFRJ) * Elaine Pimentel (DMAT, UFMG) * Vivek Nigam (DI, UFPb) * Natasha Alechina (School of Computer Science, University of Nottingham) * Gavin Bierman (Microsoft Research, UK) * Frank Pfenning (Carnegie Mellon University, US) * Michael Mendler (University of Bamberg, Germany) The workshop occurs within the scope of the Marie Curie IRSES project GeTFun ("Generalizations of Truth-Functionality"). -- Elaine. ------------------------------------------------- Elaine Pimentel - DMat/UFMG Address: Departamento de Matematica Universidade Federal de Minas Gerais Av Antonio Carlos, 6627 - C.P. 702 Pampulha - CEP 30.161-970 Belo Horizonte - Minas Gerais - Brazil Phone: 55 31 3409-5970/3409-5994 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From ronchi at di.unito.it Sat Nov 24 09:34:36 2012 From: ronchi at di.unito.it (Simona Ronchi della Rocca) Date: Sat, 24 Nov 2012 15:34:36 +0100 Subject: [TYPES/announce] DICE 2013, second call for papers Message-ID: ???????????????????????????????? DICE 2013 ?????????????????????????????????? (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY) http://dice2013.di.unito.it/index.html Roma, March 16,17 2013 satellite event of ETAPS 2013 call for papers IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 INVITED: ? Jean-Yves Marion (Loria - INPL Nancy) ? Marko van Eekelen (Open University - Radboud University Nijmegen) ? Paul-Andr? Melli?s (PPS, Paris) SCOPE: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity-bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). SUBMISSIONS: Authors are invited to submit an extended abstract, up to 5 pages. Abstracts should be written in English, in the form of a PDF file uploaded to DICE 13 page at Easychair . Submissions of abstracts by PC members are allowed and encouraged. We plan on not having pre-proceedings. POST-PROCEEDINGS: An open call for post-proceedings, as special issue of INFORMATION & COMPUTATION will follow. PROGRAM COMMITTEE: ? Roberto Amadio (Paris-Diderot) ? Harry Mairson (Brandeis) ? Virgile Mogbil (Paris 13) ? Simona Ronchi Della Rocca (Torino) (Chair) ? Luca Roversi (Torino) ? Olha Shkaravska (Nijmegen) ? Ulrich Sch?pp (LMU) ? Aleksy Shubert (Warsaw) ? Jakob G. Simonsen (DIKU) STEERING COMMITTEE: ? Patrick Baillot (ENS Lyon, CNRS) ? Ugo Dal Lago (Universit? degli Studi di Bologna) ? Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) ? Jean-Yves Marion (Loria - INPL Nancy) ? Simona Ronchi Della Rocca (Universit? degli Studi di Torino)) -------------- next part -------------- An HTML attachment was scrubbed... URL: From viktor at mpi-sws.org Mon Nov 26 08:26:42 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Mon, 26 Nov 2012 14:26:42 +0100 Subject: [TYPES/announce] Call for short student talks @ POPL 2013 Message-ID: =================================================================================== POPL 2013: 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Rome, Italy January 23-25, 2013 http://popl.mpi-sws.org/2013/ =================================================================================== ** Student Short Talk Session at POPL'13 ** Following prior years, POPL'13 will have two sessions devoted entirely to short student talks, with a best talk award determined by popular vote. All students attending POPL are strongly encouraged to participate, and our goal is to allow as many students as possible to present themselves and their work to the community. Suitable topics for short talks are descriptions of work in progress, thesis projects, honours projects and relevant research being or to be published elsewhere. The best talk will be determined by popular vote and announced at the end of POPL. Short presentations should fit in 10 minute slots and we will have a few minutes after each slot for questions. Submission instructions are found here: http://wrigstad.com/popl13/ Important Dates: * Talk proposal submission deadline: 2012-12-21 (23:59 GMT) * Notification of acceptance: 2012-12-31 * Student session: 2013-01-23 and 2013-01-25 Questions may be directed to Tobias Wrigstad (tobias.wrigstad at it.uu.se). Acceptance Criteria We strive to give as many students as possible a chance to present short talks at POPL'13. If we cannot accept all interested participants due to space or time constraints, we will primarily use seniority criteria rather than quality judgments to make decision about participation, and favour students not already presenting at POPL'13 or a co-located event over those who are. From David.Pichardie at irisa.fr Mon Nov 26 14:25:56 2012 From: David.Pichardie at irisa.fr (David Pichardie) Date: Mon, 26 Nov 2012 14:25:56 -0500 Subject: [TYPES/announce] ITP 2013: First Call for Papers Message-ID: <88C25021-5301-4157-9FAA-E39B568C04B7@irisa.fr> ITP 2013: 4th International Conference on Interactive Theorem Proving 23-26 July 2013, Rennes, France http://itp2013.inria.fr ITP is the premier international conference for researchers from all areas of interactive theorem proving and its applications. The inaugural meeting of ITP was held in July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC), the second meeting took place in Nijmegen, The Netherlands, in August 2011 and the third meeting was held in Princeton, New Jersey, in August 2012. ITP 2013 will take place in Rennes, France on 23-26 July 2013 with workshops preceding the main conference. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The program committee welcomes submissions on all aspects of interactive theorem proving and its applications. Examples of typical topics include formal aspects of hardware or software (specification, verification, semantics, synthesis, refinement, compilation, etc.); formalization of significant bodies of mathematics; advances in theorem prover technology (automation, decision procedures, induction, combinations of systems and tools, etc.); other topics including those relating to user interfaces, education, comparisons of systems, and mechanizable logics; and concise and elegant worked examples ("Proof Pearls"). Submission details: All papers must be submitted electronically, via EasyChair: https://www.easychair.org/conferences/?conf=itp2013 Papers may be no longer than 16 pages and are to be submitted in PDF using the Springer "llncs" format. Instructions may be found at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/instruct/authors/typeinst.pdf with Latex source file typeinst.tex in the same directory. Submissions must describe original unpublished work not submitted for publication elsewhere, presented in a way that users of other systems can understand. The proceedings will be published as a volume in the Springer Lecture Notes in Computer Science series and will be available to participants at the conference. In addition to regular submissions, described above, there will be a "rough diamonds" section. Rough diamond submissions are limited to six pages and may consist of an extended abstract. They will be refereed: they will be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings, and will be presented as short talks. Both regular and rough diamond submissions require an abstract of 70 to 150 words to be submitted electronically at the above address one week before the full submission. All submissions must be written in English. Submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Details on how to submit will be forthcoming. Authors who have strong reasons (e.g. of commercial/legal nature) for violating this policy should contact the PC chairs in advance. At the time of abstract submission, proof assistants and other tools necessary for evaluating the submission should be indicated using the Keywords section of the web interface. Authors of accepted papers are expected to present their papers at the conference, and will be required to sign copyright release forms. All submissions must be written in English. Important dates: Abstract submission deadline: 28 January 2013 Paper submission deadline: 1st February 2013 Notification of paper decisions: 28 March 2013 Final versions due from authors: 22 April 2013 Conference dates: 23-26 July 2013 Web page: http://itp2013.inria.fr Program Committee: Wolfgang Ahrendt, Chalmers University, Sweden Jeremy Avigad, Carnegie Mellon University, USA Nick Benton, Microsoft Research, UK Lennart Beringer, Princeton University, USA Sandrine Blazy, University of Rennes, France (co-chair) Adam Chlipala, MIT, USA Thierry Coquand, Chalmers University, Sweden Amy Felty, University of Ottawa, Canada Ruben Gamboa, University of Wyoming, USA Herman Geuvers, Radboud University Nijmegen, The Netherlands Elsa Gunter, University of Illinois at Urbana-Champaign, USA David Hardin, Rockwell Collins, Inc., USA John Harrison, Intel Corporation, USA Gerwin Klein, NICTA and UNSW, Australia Assia Mahboubi, INRIA - ?cole polytechnique, France Panagiotis Manolios, Northeastern University, USA Conor Mcbride, University of Strathclyde, UK C?sar Mu?oz, NASA, USA Magnus O. Myreen, University of Cambridge, UK Tobias Nipkow, TU M?nchen, Germany Michael Norrish, NICTA and ANU, Australia Sam Owre, SRI International, USA Christine Paulin-Mohring, Universit? Paris-Sud 11, France (co-chair) Lawrence Paulson, University of Cambridge, UK David Pichardie, Inria Rennes/Harvard University, France (co-chair) Brigitte Pientka, McGill University, Canada Laurence Pierre, TIMA, France Lee Pike, Galois, Inc., USA Claudio Sacerdoti Coen, University of Bologna, Italy Julien Schmaltz, Open University of the Netherlands, The Netherlands Makoto Takeyama, AIST/COVS, Japan Laurent Th?ry, Inria Sophia-Antipolis, France Ren? Thiemann, University of Innsbruck, Austria Makarius Wenzel, Universit? Paris-Sud 11, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From pmt6sbc at maths.leeds.ac.uk Mon Nov 26 18:24:17 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 26 Nov 2012 23:24:17 GMT Subject: [TYPES/announce] 10th Annual Conference on Theory and Applications of Models of Computation (TAMC13) Message-ID: <201211262324.qAQNOHmg007506@maths.leeds.ac.uk> FIRST CALL FOR PAPERS: TAMC 2013 The 10th annual conference on Theory and Applications of Models of Computation University of Hong Kong, Pokfulam, Hong Kong Important Dates Submission deadline : 11:59 pm EST January 11, 2013 Notification of authors : late February or early March, 2013 Final versions deadline : to be announced soon The TAMC proceedings will be published in the Lecture Notes in Computer Science Series by Springer (http://www.springer.com/lncs). Authors of accepted papers are expected to present their work at the conference. Post Conference Publications Special issues of the journals Theoretical Computer Science and Mathematical Structures in Computer Science devoted to a selected set of accepted papers of the conference are planned. Aims and Scope TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. The main themes of the conference are computability, complexity, and algorithms. Typical but not exclusive topics of interest include: * algebraic computation * algorithmic coding theory * algorithmic number theory * approximation algorithms * automata theory * circuit complexity * computability * computational biology, and biological computing * computational complexity * computational game theory * computational logic * computational geometry * continuous and real computation * cryptography * data structures * design and analysis of algorithms * distributed algorithms * fixed parameter tractability * graph algorithms * information and communication complexity * learning theory * natural computation * network algorithms, networks in nature and society * online algorithms * optimization * parallel algorithms * privacy and security * property testing * proof complexity * quantum computing * randomness, pseudo-randomness * randomized algorithms * streaming algorithms http://www.cs.hku.hk/tamc2013/call.htm From gc at pps.univ-paris-diderot.fr Tue Nov 27 10:34:11 2012 From: gc at pps.univ-paris-diderot.fr (Giuseppe Castagna) Date: Tue, 27 Nov 2012 16:34:11 +0100 Subject: [TYPES/announce] ECOOP 2013: Final Call for Papers Message-ID: <50B4DD73.1060806@pps.univ-paris-diderot.fr> ---------------------------- *** IMPORTANT DATES *** - Submission: 18 Dec 2012, 23:00 American Samoa time (19 Dec, 11:00 Paris time) - Rebuttal: 09 February 2013 - Acceptance: 08 March 2013 - To submit: http://cyberchairpro.borbala.net/ecooppapers/submit/ - Conference: 1-5 July 2013, Montpellier, France - Info: http://www.lirmm.fr/ecoop13/ ---------------------------- *** INFORMATION *** The European Conference on Object-Oriented Programming (ECOOP) is the premium international conference covering all areas of object technology and related software development technologies. ECOOP 2013 will take place from the 1st to the 5th of July, 2013 in Montpellier, France. The 2013 edition will be the 27th of the ECOOP conferences series and will embrace a broad range of topics related to object-orientation, including: - Aspects, components, modularity, and reflection - Concurrent and parallel systems - Databases and object persistence - Distributed and cloud computing, mobile systems - Programming environments, virtualization - Versioning, refactoring, software evolution - Language definition and design - Language implementation, execution environments, compiler construction - Testing, profiling, and performance analysis - Metrics and empirical studies - Software modeling, meta-modelling - Memory management, garbage collection - Object ownership - Design methods and design patterns - Real-time systems - Security - Frameworks, product lines, and software architectures - Specification, verification, model checking, program synthesis - Theoretical foundations, program analysis, and type systems - Service-oriented and Web programming Submissions will be carried out electronically via CyberChair. Papers must be written in English, and be no longer than 25 pages, including references, appendices and figures, and written using the LNCS style. For full submission guidelines, please refer to the page: http://info-web.lirmm.fr/ecoop13/index.php/conference-papers ---------------------------- *** Artifact Evaluation *** To reward creation of artifacts and replication of experiments, authors of accepted research papers can have their artifacts (tools, data, models, videos...) evaluated by an Artifact Evaluation Committee. Artifacts that pass muster will be recognized formally, and be fast-tracked for additional presentation. Artifacts that are deemed especially meritorious will be singled out for special recognition in the proceedings and at the conference. For more information about artifact evaluation, please follow this link: http://ecoop13-aec.cs.brown.edu/ From Text_Assistant at press.princeton.edu Tue Nov 27 10:51:10 2012 From: Text_Assistant at press.princeton.edu (Text_Assistant) Date: Tue, 27 Nov 2012 10:51:10 -0500 Subject: [TYPES/announce] New Book from Princeton University Press: Alan Turing's Systems of Logic Message-ID: <0AE399FD59128348BF9AFCFF5678C39E0FAE97@pupmail.press.princeton.edu> NEW BOOK FROM PRINCETON UNIVERSITY PRESS: Alan Turing's Systems of Logic Below you will find a brief description of a new title published by Princeton University Press. We hope that you will find this title of interest to your members and would be delighted if you post our message to your discussion list. Alan Turing's Systems of Logic: The Princeton Thesis Edited and introduced by Andrew W. Appel http://press.princeton.edu/titles/9780.html Cloth | 2012 | $24.95 / ?16.95 | ISBN: 9780691155746 160 pp. | 7 x 10 A work of philosophy as well as mathematics, Turing's thesis envisions a practical goal--a logical system to formalize mathematical proofs so they can be checked mechanically. If every step of a theorem could be verified mechanically, the burden on intuition would be limited to the axioms. Turing's point, as Appel writes, is that "mathematical reasoning can be done, and should be done, in mechanizable formal logic." Turing's vision of "constructive systems of logic for practical use" has become reality: in the twenty-first century, automated "formal methods" are now routine. Presented here in its original form, this fascinating thesis is one of the key documents in the history of mathematics and computer science. "For me, this is the most interesting of Alan Turing's writings, and it is a real delight to see a facsimile of the original typescript here. The work is packed with ideas that have turned out to be significant for all sorts of current research areas in computer science and mathematics."--Barry Cooper, University of Leeds Read a sample chapter online, click here: http://press.princeton.edu/chapters/s9780.pdf Thank you for your time. Emily Witkowski Text Promotions Intern Princeton University Press http://press.princeton.edu -------------- next part -------------- An HTML attachment was scrubbed... URL: From francesco.tiezzi at imtlucca.it Tue Nov 27 11:04:06 2012 From: francesco.tiezzi at imtlucca.it (Francesco Tiezzi) Date: Tue, 27 Nov 2012 17:04:06 +0100 Subject: [TYPES/announce] DisCoTec 2013: Call for Papers and Workshop Proposals Message-ID: [We apologize for multiple copies] ====================================================================== Call for Papers and Workshop Proposals DisCoTec 2013 8th International Federated Conference on Distributed Computing Techniques http://www.discotec.org/ Firenze, Italy, June 3-6 2013 ====================================================================== The DisCoTec series of federated conferences is one of the major events sponsored by the International Federation for Information processing (IFIP). The main conferences are: ---------------------------------------------------------------------- COORDINATION 15th International Conference on Coordination Models and Languages http://coordination.discotec.org/ * Co-Chairs * Rocco De Nicola (IMT Lucca, Italy) Christine Julien (Univ. of Texas, USA) * Contribution types * Research papers: 15 pages maximum Experience reports: 15 pages maximum Visions in progress papers: 8 pages maximum ---------------------------------------------------------------------- DAIS 13th IFIP International Conference on Distributed Applications and Interoperable Systems http://dais.discotec.org/ * Co-Chairs * Jim Dowling (KTH / SICS, Sweden) Francois Taiani (Univ. de Rennes 1 / IRISA, France) * Contribution types * Research papers: 14 pages maximum Practical experience reports: 14 pages maximum Work-in-progress papers: 6 pages maximum ---------------------------------------------------------------------- FORTE/FMOODS IFIP Joint International Conference on Formal Techniques for Distributed Systems 33rd Formal Techniques for Networked and Distributed Systems 15th Formal Methods for Open Object-Based Distributed Systems http://forte13.sosy-lab.org/ * Co-Chairs * Dirk Beyer (Univ. of Passau, Germany) Michele Boreale (Univ. of Firenze, Italy) * Contribution types * Research papers: 15 pages maximum Experience reports: 15 pages maximum Tool or system description papers: 15 pages maximum ====================================================================== Important Dates and Submissions ====================================================================== All conferences share the same deadlines: February 4, 2013 Abstract submission February 11, 2013 Paper submission March 18, 2013 Notification of acceptance March 25, 2013 Camera-ready version April 25, 2013 Early registration June 3-6 2013 Conference and workshops Each paper will undergo a thorough process of review and all conference proceedings will be published by Springer in the LNCS series. ====================================================================== DisCoTec 2013 Call for Workshop Proposals ====================================================================== DisCoTec 2013 invites proposals for one-day workshops to be part of the joint event. DisCoTec 2013 hosts conferences in the area of coordination languages, distributed systems and formal methods for distributed systems, ranging from practice to theory. We invite workshops in these areas to provide a forum for presentations of preliminary research results and ongoing work as well as presentations of research work to a focused audience. DisCoTec workshops provide a vivid and open forum for discussions. One-day workshops will be held in conjunction with the main events. Prospective workshop organizers are requested to follow the guidelines below and are encouraged to contact the workshops chair (Rosario Pugliese) if any questions arise. * Important Dates * January 8, 2013 Workshop proposal deadline January 15, 2013 Workshop proposal notification June 3-5, 2013 Main conferences June 6, 2013 Workshops Submission and notification deadlines of the workshops are at the discretion of the individual workshop organizers, however notification must be no later than the early registration deadline for DisCoTec. * Proposal Submission Guidelines * Workshop proposals must be written in English, not exceed 5 pages with reasonable font and margin, and be submitted in PDF format via email to * Rosario Pugliese (rosario.pugliese AT unifi.it). Proposals should include the following information: * The title, theme, and goals of the workshop. * The targeted audience and the expected number of participants. We prefer that workshops remain open to participation from any members of the community, but by-invitation-only workshops will also be considered. Please explicitly state your preference. * The publicity strategy that will be used by the workshop organizers to promote the workshop. * The participant solicitation and selection process. * Publication plan. Each workshop is responsible for managing its own publication (e.g., pre- and/or post- proceedings), if any is desired. * Approximate budget proposal (see Budget section below for details). * A preliminary version of the call for papers, which must include important dates (e.g. submission, notification, and camera-ready deadlines). * The equipment and any other resource necessary for the organization of the workshop. * A brief description of the organizer's background, including relevant past experience on organizing workshops and contact information. * Review Process * Workshop proposals will be reviewed by the following committee: * Michele Loreti, Univ. of Firenze, Italy (general chair) * Rosario Pugliese, Univ. of Firenze, Italy (workshops chair) * Francesco Tiezzi, IMT Lucca, Italy (publicity chair) Acceptance is based on an evaluation of the workshop's potential for generating useful results, the timeliness and expected interest in the topics, the organizer's ability to lead a successful workshop, and potential for attracting sufficient number of participants. * Workshop Publicity * Workshop publicity is responsibility of the workshop organizers. In particular they are in charge of 1. Providing a workshop description (200 words) for inclusion on the DisCoTec website. 2. Hosting and maintaining web pages either on the DisCoTec website or linked from it. 3. Editing workshop proceedings, if any. 4. Publicising the event. * Budget * DisCoTec will provide registration and organizational support for the workshops. Registration fees must be paid for all participants, including organizers and invited guests. To cover lunches, coffee breaks and basic organizational expenses, all workshops will be required to charge a minimum participation fee (the precise amount is still to be determined). Each workshop may increase this fee to cover additional expenses such as publication charges, student scholarships, costs for invited speakers, etc. All fees will be collected by the DisCoTec organizers as part of the registration and will be used to cover the expenses of each workshop as agreed with the workshop organizers. * Contact Information * Rosario Pugliese (rosario.pugliese AT unifi.it) ==================================================================== DisCoTec 2013 Committees ==================================================================== * General Chair * Michele Loreti (Univ. of Firenze, Italy) * Workshops Chair * Rosario Pugliese (Univ. of Firenze, Italy) * Publicity Chair * Francesco Tiezzi (IMT Lucca, Italy) * Local Organizing Committee * * Luca Cesari * Andrea Margheri * Massimiliano Masi * Simona Rinaldi * Betti Venneri * Steering Committee * * Farhad Arbab (CWI, Netherlands) * Frank de Boer (CWI, Netherlands) * Rocco De Nicola (IMT Lucca, Italy) * Jim Dowling (KTH, Sweden) * Kurt Geihs (Univ. of Kassel, Germany) * Elie Najm (Chair) (Telecom-ParisTech, France) * Rui Oliveira (Univ. of Minho, Portugal) * Marjan Sirjani (Univ. of Reykjavik, Iceland) * Jean-Bernard Stefani (INRIA, France) From Jeremy.Gibbons at cs.ox.ac.uk Tue Nov 27 12:16:28 2012 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Tue, 27 Nov 2012 17:16:28 +0000 Subject: [TYPES/announce] University Lectureship in Computer Science (Software Engineering) at Oxford Message-ID: <201211271716.qARHGT1n020445@linux1.cs.ox.ac.uk> University of Oxford Department of Computer Science in association with Kellogg College, Oxford UNIVERSITY LECTURER IN COMPUTER SCIENCE (SOFTWARE ENGINEERING) The Department of Computer Science proposes to appoint a University Lecturer in Computer Science from 1st March 2013 and no later than 1st October 2013. The successful candidate will be offered a Non-Tutorial Fellowship at Kellogg College under arrangements described in Further Particulars. The salary will be on a scale currently up to ?57,581 per annum. Applicants should hold a relevant PhD and have experience in any area which broadens the activities of the Software Engineering Programme (http://www.softeng.ox.ac.uk/). Full details of the qualifications required and the duties of the post can be found in the Further Particulars (http://www.cs.ox.ac.uk/files/5161/SEP_UL_FPs.pdf). The closing date for applications is Thursday 27th December, 2012. Queries about the post should be addressed in the first instance to Elizabeth Walsh at elizabeth.walsh at cs.ox.ac.uk or telephone: +44 (0) 1865 283503. Applications are particularly welcome from women and black and minority ethnic candidates, who are under-represented in academic posts in Oxford. The University is an Equal Opportunities Employer. From P.B.Levy at cs.bham.ac.uk Tue Nov 27 13:29:53 2012 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Tue, 27 Nov 2012 18:29:53 +0000 Subject: [TYPES/announce] PhD opportunities in the Computer Science theory group at Birmingham Message-ID: Dear all, We invite applications for PhD study at the University of Birmingham. We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in computation and programming language semantics. This often involves profound and surprising connections between different areas of computer science and mathematics. From category theory to ?-calculus and computational effects, from topology to constructive mathematics, from game semantics to program compilation, this is a diverse field of research that continues to provide new insight and underlying structure. See our webpage, with links to individual researchers, here: http://www.cs.bham.ac.uk/research/groupings/theory/ Information about PhD applications may be found here: http://www.cs.bham.ac.uk/admissions/postgraduate-research/ If you are considering applying, please contact any of us. We will be very happy to discuss the opportunities available. Best regards, the Birmingham CS theory group Mart?n Escard? (Topology, computation with infinite objects, constructive mathematics, intuitionistic type theory) Dan Ghica (Game semantics, heterogeneous computing, model checking) Achim Jung (Mathematical structures in the foundations of computing: logic, topology, order) Paul Levy (Denotational semantics, ?-calculus with effects, nondeterminism, category theory, game semantics) Uday Reddy (Semantics of state, separation logic) Eike Ritter (Security protocol verification) Hayo Thielecke (Abstract machines, concurrent and functional programming, software security) Steve Vickers Constructive mathematics and topology, category theory and toposes -- Paul Blain Levy School of Computer Science, University of Birmingham +44 121 414 4792 http://www.cs.bham.ac.uk/~pbl From paolini at di.unito.it Thu Nov 29 03:29:29 2012 From: paolini at di.unito.it (Luca Paolini) Date: Thu, 29 Nov 2012 09:29:29 +0100 Subject: [TYPES/announce] TLCA 2013 Second Call for Papers Message-ID: <50B71CE9.30905@di.unito.it> ================================================================ TLCA 2013 Second Call for Papers 11th International Conference on Typed Lambda Calculi and Applications Eindhoven, 23-28 June 2013 co-located with RTA 2013 as part of RDP 2013 TLCA 2013 webpage: http://www.kurims.kyoto-u.ac.jp/tlca2013/ RDP 2013 webpage: http://www.win.tue.nl/rdp2013/ [NEW: Invited Speakers Confirmed] ================================================================ The 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: * Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models * Types: subtypes, dependent types, polymorphism, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants * Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, flow analysis of higher-type computation, program equivalence, program transformation and optimization INVITED SPEAKERS * Simon Peyton-Jones (Microsoft Cambridge, UK) Joint invited speaker for RTA+TLCA 2013 * Hugo Herbelin (INRIA, France) invited speaker for TLCA 2013 * Damiano Mazza (Universite Paris-Nord, France) invited speaker for TLCA 2013 IMPORTANT DATES * Paper Registration (titles & short abstracts): 25 January 2013 * Full Paper Submission: 1 February 2013 * Author Notification: 22 March 2013 * Camera-Ready Paper for the Proceedings: 12 April 2013 SUBMISSION GUIDELINES We solicit submissions of research papers, which must: * be in English and not exceed 15 pages (including figures and bibliography). Additional material intended for the reviewers but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers will be told that they may choose to ignore the appendix. * present original research which is unpublished and not submitted elsewhere (conferences, journals, books, etc.) * use the Springer-Verlag LNCS style. * be submitted electronically in PDF via the EasyChair TLCA 2013 Submission Webpage https://www.easychair.org/conferences/?conf=tlca2013 . Submissions deviating from these instructions may be rejected without review. A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. The proceedings will be published as a volume in the ARCoSS subline series of Springer-Verlag Lecture Notes in Computer Science. Final papers will be in the format specified by Springer-Verlag. Any questions regarding the submission guidelines should be directed to the Programme Committee Chair (Masahito Hasegawa ) prior to submitting. COLOCATED EVENTS TLCA 2013 is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the International Conference on Rewriting Techniques and Applications (RTA 2013) and several related events. Details on workshops affiliated with RDP 2013 will be available at the web site in due course. CONFERENCE CHAIR Herman Geuvers (Radboud University Nijmegen, Netherlands) PROGRAMME COMMITTEE CHAIR Masahito Hasegawa (Kyoto University, Japan) PROGRAMME COMMITTEE Andreas Abel (LMU Munchen, Germany) Patrick Baillot (CNRS and ENS Lyon, France) Nick Benton (Microsoft Cambridge, UK) Lars Birkedal (IT University of Copenhagen, Denmark) Herman Geuvers (Radboud University Nijmegen, Netherlands) Masahito Hasegawa (Kyoto University, Japan) (PC chair) Naoki Kobayashi (University of Tokyo, Japan) Paul-Andre Mellies (CNRS and Universite Paris Diderot, France) Thomas Streicher (TU Darmstadt, Germany) Lorenzo Tortora de Falco (Universita Roma Tre, Italy) Stephanie Weirich (University of Pennsylvania, US) TLCA STEERING COMMITTEE Samson Abramsky (University of Oxford, UK) Henk Barendregt (Radboud University Nijmegen, Netherlands) Pierre-Louis Curien (CNRS and Universite Paris Diderot, France) Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy) Martin Hofmann (LMU Munchen, Germany) Luke Ong (University of Oxford, UK) Simona Ronchi Della Rocca (Universita di Torino, Italy) Pawel Urzyczyn (University of Warsaw, Poland) TLCA HONORARY ADVISOR Roger Hindley (Swansea University) TLCA PUBLICITY CHAIR Luca Paolini (Universita di Torino, Italy) From andru at cs.cornell.edu Thu Nov 29 06:55:06 2012 From: andru at cs.cornell.edu (Andrew Myers) Date: Thu, 29 Nov 2012 06:55:06 -0500 Subject: [TYPES/announce] Polyglot 2.5.1 extensible Java compiler Message-ID: <50B74D1A.1010304@cs.cornell.edu> People thinking about trying out their language ideas in a Java context should be interested to know that we have released a new version (2.5.1) of the Polyglot extensible Java compiler. It adds some important new features: * Support for many more Java language features: generics, autoboxing, enums, enhanced for-loops, and more. * Faster compilation. * Better support for modular AST translation between different Polyglot extensions. This new version of Polyglot is compatible with previous Polyglot 2.x releases. It continues to support modular extension of Java terms and types, and new program analyses. It's at the Polyglot web site, http://www.cs.cornell.edu/Projects/polyglot This new version of Polyglot brought to you primarily by: Owen Arden (Cornell) Steve Chong (Harvard) Scott Moore (Harvard) Samarth Lad (Cornell) Jed Liu (Cornell) -- Andrew Myers -------------- next part -------------- A non-text attachment was scrubbed... Name: andru.vcf Type: text/x-vcard Size: 247 bytes Desc: not available URL: From maffei at cs.uni-saarland.de Thu Nov 29 09:17:48 2012 From: maffei at cs.uni-saarland.de (maffei at cs.uni-saarland.de) Date: Thu, 29 Nov 2012 15:17:48 +0100 Subject: [TYPES/announce] CSF 2013: Second Call for Papers and Panels Message-ID: ***************************************************** CSF 2013 Second Call for Papers and Panels 26th IEEE Computer Security Foundations Symposium http://csf2013.seas.harvard.edu/ June 26 - 28, 2013 Tulane University, New Orleans Louisiana, USA Invited Speakers: - Joseph Halpern (Cornell University), joint invited talk with LICS - Markus Jakobsson (PayPal) - Benjamin Pierce (University of Pennsylvania) ***************************************************** The Computer Security Foundations Symposium is an annual conference for researchers in computer security. CSF seeks papers on foundational aspects of computer security, e.g., formal security models, relationships between security properties and defenses, principled techniques and tools for design and analysis of security mechanisms as well as their application to practice. While CSF welcomes submissions beyond the topics listed below, the main focus of CSF is foundational security: submissions that lack foundational aspects risk rejection. Topics ------ New theoretical results in computer security are welcome. Possible topics include, but are not limited to: Access control, Accountability, Anonymity and Privacy, Authentication, Data and system integrity, Database security, Data provenance, Decidability and complexity, Distributed systems security, Electronic voting, Executable content, Formal methods for security, Game Theory and Decision Theory, Hardware-based security, Information flow, Intrusion detection, Language-based security, Network security, Resource usage control, Security for mobile computing, Security models, Security protocols, Socio-technical security*, Trust and trust management. *Socio-technical security: concepts, models and techniques to analyse the role of humans in [information] security Challenges and Vision Papers: ----------------------------- We particularly encourage challenge/vision papers, which may describe open questions and raise fundamental concerns about practical security. Challenges and/or vision papers should typically identify a real world security problem, argue why it raises foundational issues, explain why the currently available and relevant foundational techniques are inadequate for addressing it, and identify foundational challenges that have to be addressed to solve the problem. These papers will appear in the CSF proceedings and will be presented at the conference without any distinction from papers that present new technical results. Proceedings, published by the IEEE Computer Society Press, will be available at the symposium, and selected papers will be invited for submission to the Journal of Computer Security. ***************************************************** IMPORTANT DATES Abstract due: January 30, 2013, 11:59pm Eastern Standard Time Papers due: February 6, 2013, 11:59pm Eastern Standard Time Panel proposals due: March 15, 2013 Notification: April 5, 2013 Camera ready: April 25, 2013 Symposium: June 26 - 28, 2013 Colocated workshops: June 29 - 30, 2013 ***************************************************** PROGRAM COMMITTEE Gilles Barthe, IMDEA Software Institute, Spain David Basin, ETH Zurich, Switzerland Giampaolo Bella, University of Catania, Italy James Cheney, University of Edinburgh, UK Veronique Cortier, Loria, CNRS, France Anupam Datta, Carnegie Mellon University, USA Stephanie Delaune, CNRS, France Riccardo Focardi, Ca' Foscari University of Venice, Italy Joshua Guttman, Worcester Polytechnic Institute, USA Limin Jia, Carnegie Mellon University, USA Ralf Kuesters, University of Trier, Germany Boris Koepf, IMDEA Software Institute, Spain Matteo Maffei, Saarland University, Germany Catuscia Palamidessi, INRIA Saclay, France Rafael Pass, Cornell University, USA Frank Pfenning, Carnegie Mellon University, USA Peter Ryan, University of Luxembourg, Luxembourg Andre Scedrov, University of Pennsylvania, USA Graham Steel, INRIA, France ***************************************************** PAPER SUBMISSION INSTRUCTIONS Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with published proceedings. Failure to clearly identify any duplication or overlap with other published or submitted papers is ground for rejection without full review. Papers should be submitted in Portable Document Format (PDF). Papers submitted in a proprietary word processor format such as Microsoft Word cannot be considered. At least one coauthor of each accepted paper is required to attend CSF to present the paper. Papers must be submitted using the two-column IEEE Proceedings style available for various document preparation systems at the IEEE Conference Publishing Services page. Regular papers should be at most 12 pages long, not counting bibliography and well-marked appendices. Challenge/vision papers should be clearly identified and should follow the same format requirements as regular paper. Committee members are not required to read appendices, and so the paper must be intelligible without them. Papers not adhering to the page limits will be rejected without consideration of their merits. Papers should be submitted using the CSF 2013 submission site. The full paper submission deadline is February 6th, 2013. The preliminary submission of an abstract is mandatory and the deadline is January 30th, 2013. https://www.easychair.org/conferences/?conf=csf2013 ***************************************************** PANEL PROPOSALS Proposals for panels are welcome. They should be no more than three pages in length, and should include the names of possible panelists and an indication of which of those panelists have confirmed a desire to participate. They should be submitted by email to the program chairs. ***************************************************** PC Chairs Veronique Cortier, Loria, CNRS, France Anupam Datta, Carnegie Mellon University, USA General Chair Stephen Chong, Harvard University, USA Publications Chair Deepak Garg, Max Planck Institute for Software Systems, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From pmt6sbc at maths.leeds.ac.uk Thu Nov 29 17:29:28 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Thu, 29 Nov 2012 22:29:28 GMT Subject: [TYPES/announce] CiE 2013: The Nature of Computation, Milan, Italy, July 1-5, 2013 Message-ID: <201211292229.qATMTSs7024281@maths.leeds.ac.uk> ************************************************************************ CALL FOR PAPERS: CiE 2013: The Nature of Computation Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications. CiE 2013 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. Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: * Gerard Alberts (Amsterdam) * Luis Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans) * Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) 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 using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ From HANAC at il.ibm.com Thu Nov 29 17:55:38 2012 From: HANAC at il.ibm.com (Hana Chockler) Date: Fri, 30 Nov 2012 00:55:38 +0200 Subject: [TYPES/announce] CAV 2013 - Second Call for Papers Message-ID: ============================================================== We apologize if you receive multiple copies of this CFP. Please distribute to anyone who may be interested. ============================================================== ====== SECOND CALL FOR PAPERS ===== 25th International Conference on Computer Aided Verification (CAV 2013) July 13-19, 2013 St. Petersburg, Russia Program Chairs: Natasha Sharygina and Helmut Veith Website: http://cav2013.forsyte.at/ Aims and Scope ------------------- The conference on Computer Aided Verification (CAV), 2013, is the 25th 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 - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Verification methods for parallel and concurrent hardware/software systems - Testing and runtime analysis based on verification technology - Applications and case studies in verification - Decision procedures and solvers for verification - Mathematical and logical foundations of practical verification tools - Verification in industrial practice - Algorithms and tools for system synthesis - Hybrid systems and embedded systems verification - Verification techniques for security - Formal models and methods for biological systems Following the example of 2012, CAV will again have *special tracks* in four areas: 1. Hardware Verification (track chair: Armin Biere) 2. Computer Security (track chair: Somesh Jha) 3. SAT and SMT (track chair: Nikolaj Bjoerner) 4. Biology (track chair: Jasmin Fisher) 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. In addition, CAV 2013 will also have a track chair for tool papers: 5. Tool Papers (track chair: Roderick Bloem) Events --------- The conference will include the following events: * Pre-conference workshops on July 13-14. * The main conference will take place July 15th-19th: * Invited tutorials on July 15th. * Technical sessions on July 16-19. 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. 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. B. Tool Presentations: Submissions, not exceeding six (6) pages using Springer's LNCS format, should describe the implemented tool, its novel features, and possibly an experimental evaluation. 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. We strongly encourage authors to make their tools and benchmarks available with their submission. Papers exceeding the stated maximum length run the risk of rejection without review. 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 should not contain information necessary to the understanding and the evaluation of the presented work. Note that the page limit for submissions has been increased to 16 pages including references. 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://cav2013.forsyte.at Important Dates - Abstract submission: January 3, 2013 - Paper submission (firm): January 7, 2013 anywhere on earth - Author feedback/rebuttal period: February 20-22, 2013 - Notification of acceptance/rejection: March 6, 2013 - Final version due: April 6, 2013 Program Chairs ------------------ Natasha Sharygina, University of Lugano, Switzerland Helmut Veith, Vienna University of Technology, Austria Program Committee --------------------- Rajeev Alur (Univ. Pennsylvania) Domagoj Babic (UC Berkeley) Armin Biere (JKU Linz) Nikolaj Bjorner (Microsoft Research) Roderick Bloem (TU Graz) Ahmed Bouajjani (LIAFA, Univ. of Paris 7) Aaron Bradley (CU Boulder) Hana Chockler (IBM) Byron Cook (Microsoft Research, Univ. College London) Vincent Danos (The University of Edinburgh) Anupam Datta (Carnegie Mellon Univ.) Javier Esparza (TU Munich) Azadeh Farzan (Univ. of Toronto) Bernd Finkbeiner (Saarland Univ.) Jasmin Fisher (Microsoft Research) Radu Grosu (TU Vienna) Ari Gurfinkel (Carnegie Mellon Univ.) William Hung (Synopsys Inc) Susmit Jha (Intel) Somesh Jha (Univ. of Wisconsin) Barbara Jobstmann (CNRS, Verimag, Jasper DA) Bengt Jonsson (Uppsala Univ.) Rajeev Joshi (NASA JPL) Joost-Pieter Katoen (RWTH Aachen) Robert P. Kurshan (Cadence Design Systems) Benjamin Livshits (Microsoft Research) Rupak Majumdar (Max Planck Institute) Ken Mcmillan (Microsoft Research) Kedar Namjoshi (Bell Labs) Joel Ouaknine (Oxford Univ.) Madhusudan Parthasarathy (Univ. of Illinois at Urbana-Champaign) Corina Pasareanu (Carnegie Mellon Univ., NASA Ames) Andreas Podelski (Univ. of Freiburg) Natasha Sharygina (Univ. of Lugano) Nishant Sinha (IBM) Anna Slobodova (Centaur Technology) Murali Talupur (Intel) Stavros Tripakis (UC Berkeley) Helmut Veith (TU Vienna) Mahesh Viswanathan (Univ. of Illinois at Urbana-Champaign) Thomas Wahl (Northeastern Univ.) Georg Weissenbacher (TU Vienna) Eran Yahav (Technion) 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 2013 CAV Award Committee consists of Rajeev Alur (Chair) Marta Kwiatkowska Aarti Gupta Ahmed Bouajjani The nominations should be sent to Rajeev Alur at alur at seas.upenn.edu. Nominations must be received by January 7, 2013. From dargenio at famaf.unc.edu.ar Thu Nov 29 21:07:36 2012 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Thu, 29 Nov 2012 23:07:36 -0300 Subject: [TYPES/announce] CONCUR 2013 - First call for papers Message-ID: [We apologise for multiple copies.] ============================================================================ CONCUR 2013 - Call for Papers 24th International Conference on Concurrency Theory August 27 - 30, 2013, Buenos Aires Argentina http://concur-conferences.org/concur2013 ============================================================================ The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications. ================================ INVITED SPEAKERS ================================ - Lorenzo Alvisi (University of Texas Austin, USA) - Joost-Pieter Katoen (RWTH Aachen University, Germany) - Philippe Schnoebelen (LSV, CNRS & ENS de Cachan, France) - Reinhard Wilhelm (Saarland University, Germany) ================================ TOPICS ================================ Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, graph transformation systems and Petri nets; - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics; - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, and type systems; - Related programming models such as distributed, component-based, object-oriented, and web services. ================================ CO-LOCATED EVENTS ================================ 10th Intl. Conference on Quantitative Evaluation of SysTems (QEST 2013) 11th Intl. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS 2013) 8th Intl. Symposium on Trustworthy Global Computing (TGC 2013) There will be co-located workshops, which take place on August 26 and August 31, and tutorials (associated with QEST) which take place on August 26. ================================ PAPER SUBMISSION ================================ CONCUR 2013 solicits high quality papers reporting research results and/or experience reports related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. Contributions should be submitted electronically as PDF, using the Springer LNCS style. Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Papers should be submitted electronically using EasyChair online submission system: https://www.easychair.org/conferences/?conf=concur2013 The CONCUR 2013 proceedings will be published by Springer in the ArCoSS subseries of LNCS. The proceedings will be available at the conference. ================================ IMPORTANT DATES ================================ Abstract Submission: 1st April 2013 Paper Submission: 8th April 2013 Paper Notification: 27th May, 2013 Camera Ready Copy Due: 10t June, 2013 CONCUR 2012: 27th-30th August, 2013 ================================ AFFILIATED WORKSHOPS ================================ Proposal for workshops are expected to be sent to the Workshops Chairs, Eduardo Bonelli (ebonelli at unq.edu.ar) and Diego Garbervetsky ( diegog at dc.uba.ar), by January 14, 2013. ================================ PROGRAM CHAIRS ================================ - Pedro R. D'Argenio (Universidad Nacional de C?rdoba, Argentina) - Hern?n Melgratti (Universidad de Buenos Aires, Argentina) ================================ PROGRAM COMMITTEE ================================ Christel Baier (Technical University of Dresden, DE) Paolo Baldan (Universit? di Padova, IT) Eike Best (Universit?t Oldenburg, DE) Patricia Bouyer (LSV, CNRS & ENS Cachan, FR) Tomas Brazdil (Masaryk University, CZ) Franck van Breugel (York University, CA) Krishnendu Chatterjee (IST, AT) Rance Cleaveland (University of Maryland, US) Wan Fokkink (Vrije Universiteit Amsterdam, NL) Daniele Gorla (University of Rome "La Sapienza", IT) Holger Hermanns (Saarland University, DE) Radha Jagadeesan (DePaul University, US) Bengt Jonsson (Uppsala University, SE) Kim G. Larsen (Aalborg University, DK) Ugo Montanari (Universit? di Pisa, IT) Prakash Panangaden (McGill University, CA) David Parker (University of Birmingham, UK) Frank Pfenning (Carnegie Mellon University, US) Nir Piterman (University of Leicester, UK) Shaz Qadeer (Microsoft Research, US) Jean-Francois Raskin (Universit Libre de Bruxelles, BE) Jan Rutten (CWI, NL) Davide Sangiorgi (University of Bologna, IT) Geoffrey Smith (Florida International University, US) P.S. Thiagarajan (National University of Singapore, SG) Frits Vaandrager (Radboud University Nijmegen, NL) Frank Valencia (CNRS, Ecole Polytechnique de Paris, FR) Rob Van Glabbeek (NICTA, AU) Nobuko Yoshida (Imperial College London, UK) Lijun Zhang (Technical University of Denmark, DK) ================================ STEERING COMMITTEE ================================ Roberto Amadio (PPS, Universite Paris Diderot - Paris 7, France) Jos Baeten (Centrum Wiskunde & Informatica (CWI), The Netherlands) Eike Best (Carl von Ossietzky Universit?t Oldenburg, Germany) Kim Larsen (Aalborg University, Denmark) Ugo Montanari (Universit? di Pisa, Italy) Scott Smolka (SUNY, Stony Brook University, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From dargenio at famaf.unc.edu.ar Thu Nov 29 21:08:05 2012 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Thu, 29 Nov 2012 23:08:05 -0300 Subject: [TYPES/announce] QEST 2013 - First call for papers Message-ID: [We apologise for multiple copies.] -------------------------------------------------------------------------------- Call for Papers 10th International Conference on Quantitative Evaluation of SysTems QEST 2013 http://www.qest.org/qest2013/ August 26th-30th, 2013 - Buenos Aires, Argentina Co-located with CONCUR, FORMATS, and TGC IMPORTANT DATES: Abstract submission 4 March 2013 Paper submission 11 March 2013 Author notification 12 May 2013 Final version 2 June 2013 INVITED SPEAKERS: Lorenzo Alvisi, University of Texas Austin, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Edmundo de Souza e Silva, Federal University of Rio de Janeiro, Brazil SCOPE AND TOPICS: QEST is the leading forum on evaluation and verification of computer systems and networks, through stochastic models and measurements. QEST has a broad range of interests - the common thread is that the evaluation be quantitative. The range of performance metrics of interest spans classical measures involving performance and reliability, as well as quantification of properties that are classically qualitative, such as safety, correctness, and security. QEST welcomes measurement-based studies as well as analytic studies. QEST welcomes diversity in the model formalisms and methodologies employed, as well as development of new formalisms and methodologies. QEST is keenly interested in case studies highlighting the role of quantitative evaluation in the design of systems, where the notion of system is broad. Systems of interest include computer hardware and software architectures, communication systems, embedded systems and biological systems. Moreover, tools for supporting the practical application of research results in all of the above areas are of special interest, and therefore tool papers are sought. In short, QEST aims to create a sound methodological basis for assessing and designing systems using quantitative means. EVALUATION OF PAPERS: All submitted papers will be thoroughly judged by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. QEST considers five types of papers with additional reviewing criteria (in no particular order): 1. Theoretical: advance our understanding, apply to non-trivial problems and be mathematically rigorous. 2. Methodological and technical: describe situations that require the development and proposal of new analysis processes and techniques. Process structure and the individual steps should be clearly described. If the methodology has already been evaluated with applications, a brief description of the lessons learned would be very helpful. 3. Application: describes a novel application, and compares with previous results (if any). 4. Tools: should motivate the development of the new tools and the formalisms they support. Tool papers need neither discuss their theoretical underpinnings nor their algorithms. Instead, they should focus on the software architecture and discuss its practical capabilities with particular reference to the size and type of model it can handle within reasonable time and space limits. 5. Tool demonstration: describe a relevant tool, as well as its features, evaluation, or any other information that may demonstrate the merits of the tool. SUBMISSIONS: We invite submissions of original papers related to the aforementioned topics. Submissions must be in English, Springer LNCS format, and must indicate the above paper type. Papers must be prepared in LaTeX, following Springer's LNCS guidelines. Submitted papers should not exceed 16 pages (4 pages for tool demonstrations). Additional material for the aid of the reviewers (e.g., proofs) can be sent in a clearly marked appendix. Papers must be unpublished and not be submitted for publication elsewhere. PC members, except program co-chairs, may submit papers. All accepted papers (including tool demonstrations) must be presented at the conference by one of the authors. A best-paper award will be presented at the conference. As in previous years, we are planning to publish extended versions of selected papers in a special issue of a journal. TUTORIALS: There will be one day of tutorials at the start of the conference. Tutorial proposals (up to 4 pages Springer LNCS format) should be sent to the Tutorial Chair (Lijun Zhang, zhang at imm.dtu.dk) by 11 March 2013. GENERAL CHAIR: Pedro R. D'Argenio (AR) PC-CHAIRS: Kaustubh Joshi (US) Markus Siegle (DE) Marielle Stoelinga (NL) LOCAL ORGANIZATION CHAIR: Hern?n Melgratti (AR) TOOLS CHAIR: Kai Lampka (SE) TUTORIAL CHAIR: Lijun Zhang (DK) PROCEEDINGS CHAIR: Nicol?s Wolovick (AR) PUBLICITY CHAIR: Dami?n Barsotti (AR) PROGRAM COMMITTEE: Christel Baier (DE) Nathalie Bertrand (FR) Andrea Bobbio (IT) Peter Buchholz (DE) Hector Cancela (UY) Giuliano Casale (GB) Gianfranco Ciardo (US) Yuxin Deng (CN) Derek Eager (CA) Jane Hillston (GB) Andras Horvath (IT) David Jansen (NL) Krishna Kant (US) Peter Kemper (US) Boris Koepf (ES) Marta Kwiatkowska (GB) Kai Lampka (SE) Annabelle McIver (AU) Arif Merchant (US) Aad van Moorsel (GB) Gethin Norman (GB) Anne Remke (NL) William Sanders (US) Roberto Segala (IT) Miklos Telek (HU) Bhuvan Urgaonkar (US) Marco Vieira (PT) Verena Wolf (DE) STEERING COMMITTEE: Holger Hermanns (DE) Nathalie Bertrand (FR) Peter Buchholz (DE) Gethin Norman (UK) Andrew S. Miner (US) Susanna Donatelli (IT) William Knottenbelt (UK) Joost-Pieter Katoen (Chair, DE) Peter Kemper (US) Miklos Telek (HU) Gerardo Rubino (FR) Boudewijn Haverkort (NL) -------------- next part -------------- An HTML attachment was scrubbed... URL: From dargenio at famaf.unc.edu.ar Thu Nov 29 21:08:24 2012 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Thu, 29 Nov 2012 23:08:24 -0300 Subject: [TYPES/announce] CONCUR 2013 - Call for affiliated workshops Message-ID: [We apologise for multiple copies.] -------------------------------------------------------------------------------- * CONCUR 2013 * (http://www.concur-conferences.org/concur2013) Call for affiliated workshops The 24th Conference on Concurrency Theory (CONCUR 2013) will be held from August 26th to August 31st 2013, in Buenos Aires, Argentina. It will be co-located with the 10th International Conference on Quantitative Evaluation of SysTems (QEST), the 11th International Conference on Formal Modeling and Analysis of Timed Systems FORMATS and the 8th International Symposium on Trustworthy Global Computing (TGC). Researchers and practitioners are invited to submit proposals for workshops to be affiliated to CONCUR 2013, on topics related to concurrency theory and its applications. Example topics include: semantics, logics, verification techniques for concurrent systems, cross-fertilization between industry and academia and opportunities for young and prospective researchers. Past CONCUR conferences have been accompanied by successful workshops on a variety of topics, such as formal and foundational methods, models of systems (biological, timed), security issues, semantical issues, and verification methods. See the following links for examples of past workshops: http://conferences.ncl.ac.uk/concur-2012/workshops.html http://concur2011.rwth-aachen.de/workshops http://concur2010.inria.fr/workshops http://concur09.cs.unibo.it/satevents.html The purpose of the workshops is to provide participants with a friendly, interactive atmosphere for presenting novel ideas and discussing their application. The workshops take place on Monday, August 26th and Saturday, August 31st, 2013. Proposals should include: * The name and the preferred date of the proposed workshop. * Proposed workshop duration. * A short scientific summary of the topic, its scope and significance, including a discussion on the relation with CONCUR topics. * If applicable, a description of past versions of the workshop, including dates, organizers, submission and acceptance counts, and attendance. * Procedures for selecting papers and/or talks, plans for dissemination (for example, proceedings and special issues of journals), and the expected number of participants. Important Dates: Workshop proposals due: January 14, 2013 Notification of acceptance: January 21, 2013 Workshops: August 26 and August 3, 2013 Submissions to: Eduardo Bonelli (ebonelli at unq.edu.ar) and Diego Garbervetsky (diegog at dc.uba.ar) The CONCUR organization offers: * Link from the CONCUR web site. * Setup of meeting space, and related equipment. * Coffee-breaks. * Lunches. * On-line and on-site registration to the workshop. * One free workshop registration (for an invited speaker) The main responsibility of organizing a workshop goes to the workshop chairperson(s), including: * Workshop publicity (possibly including call for papers, submission and review process). * Scheduling workshop activities in collaboration with the CONCUR workshop chairs. For more information, please contact us via email ebonelli at unq.edu.ar and diego at dc.uba.ar The CONCUR 2013 workshop chairs, Eduardo Bonelli and Diego Garbervetsky -------------- next part -------------- An HTML attachment was scrubbed... URL: From elaine at mat.ufmg.br Fri Nov 30 11:30:40 2012 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Fri, 30 Nov 2012 11:30:40 -0500 Subject: [TYPES/announce] IMLA 2013 -- EXTENDED DEADLINE Message-ID: 6th Workshop on Intuitionistic Modal Logic and Applications https://sites.google.com/site/imodallogic2013/ April 7, 2013 ** New paper submission deadline: December 10th ** Affiliated with the 4th World Congress on Universal Logic [UNILOG 2013] http://uni-log.org/start4.html Rio de Janeiro, Brazil April 3-7, 2013 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications of constructive modal logics are in type disciplines for programming languages, meta-logics for reasoning about a variety of computational phenomena and explanatory frameworks in philosophical logic. The workshop aims at developing and explaining theoretical and methodological issues centered around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question of which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. In its sixth edition, the Workshop on Intuitionistic Modal Logic and Applications will take place in Rio de Janeiro at the feet of the Sugar Loaf at the military school EsCEME. Previous editions of this conference were held: as part of the 14th Congress of Logic, Methdology and Philosophy of Science, Nancy, France, 25 July, 2011, as part of LiCS2008, Pittsburgh, USA, as part of LiCS2005, Chicago, USA, of FLoC2002, Copenhagen, Denmark and as part of FLoC1999, Trento, Italy. Topics of interest to this forum include, but are not limited to: * Modal Logics * Logical frameworks * Proof theory * Type theory * Automated deduction * Formal semantics of languages and systems * Applications IMLA 2013 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions Contributions should be written in English and submitted in the form of full papers (with a maximum of 12 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 IMLA 2013 page at Easychair https://www.easychair.org/conferences/?conf=imla2013 until the submission deadline in December 10th. The workshop pre-proceedings will be handed-out at workshop registration. At least one of the authors should register at the conference. The paper presentation should be in English. Important Dates Paper submission deadline: December 10th, 2012 Author notification: December 15th, 2013 Workshop: April 7th, 2013 Scientific and Organizing Committee * Valeria de Paiva (School of Computer Science, University of Birmingham, UK) * Mario Benevides (COPPE-IM, UFRJ) * Elaine Pimentel (DMAT, UFMG) * Vivek Nigam (DI, UFPb) * Natasha Alechina (School of Computer Science, University of Nottingham) * Gavin Bierman (Microsoft Research, UK) * Frank Pfenning (Carnegie Mellon University, US) * Michael Mendler (University of Bamberg, Germany) The workshop occurs within the scope of the Marie Curie IRSES project GeTFun ("Generalizations of Truth-Functionality"). -- Elaine. ------------------------------------------------- Elaine Pimentel - DMat/UFMG Address: Departamento de Matematica Universidade Federal de Minas Gerais Av Antonio Carlos, 6627 - C.P. 702 Pampulha - CEP 30.161-970 Belo Horizonte - Minas Gerais - Brazil Phone: 55 31 3409-5970/3409-5994 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Didier.Galmiche at loria.fr Sun Dec 2 06:10:51 2012 From: Didier.Galmiche at loria.fr (Didier Galmiche) Date: Sun, 02 Dec 2012 12:10:51 +0100 Subject: [TYPES/announce] TABLEAUX 2013 - Call for Papers, Tutorials and Workshops Message-ID: <50BB373B.40202@loria.fr> FIRST CALL FOR PAPERS, TUTORIALS and WORKSHOPS TABLEAUX 2013 22nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods Nancy, France September 16-19, 2013 http://tableaux13.loria.fr GENERAL INFORMATION This conference is the 22nd in a series of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods and will be held in Nancy, France, in September 16-19, 2013. See http://tableaux13.loria.fr for more information on TABLEAUX 2013, and http://i12www.ira.uka.de/TABLEAUX for information about the TABLEAUX conference series. TABLEAUX 2013 will be co-located with the 9th International Symposium on Frontiers of Combining Systems (FroCos 2013) held September 18-20, 2013. A joint invited speaker and a joint session are planned. TOPICS Tableaux methods offer a convenient set of formalisms for automating deduction in various non-standard logics as well as in classical logic. Areas of application include verification of software and computer systems, data integration and data access, deductive databases, knowledge representation and its required inference engines, and system diagnosis. The conference intends to bring together researchers interested in all aspects - theoretical foundations, implementation techniques, system developments and applications - of the mechanization of reasoning with tableaux and related methods. Topics of interest include (but are not restricted to): * proof-theory in classical and non-classical logics (modal, temporal, description, intuitionistic, substructural, ...) * analytic tableaux for various logics (theory and applications) * related techniques and concepts, e.g., model checking and BDDs * related methods (model elimination, sequent calculi, connection method, resolution, ...) * new calculi and methods for theorem proving and verification in classical and non-classical logics * systems, tools, implementations and applications (provers, logical frameworks, model checkers, ...) * automated deduction and formal methods applied to logic, mathematics, software development, protocol verification, security, ... TABLEAUX 2013 also welcomes applications of formal methods with automated reasoning to real world examples. Papers including such applications of tableaux and related methods in areas such as, for example, hardware and software verification, knowledge engineering, semantic web, etc. are particularly invited. They should be tailored for the tableaux community and should hence focus on the role of reasoning and logical aspects of the solution. One or more tutorials will be part of the Conference program. PUBLICATION DETAILS It is planned that the proceedings of TABLEAUX 2013 will be published in the Springer LNCS/LNAI Series. SUBMISSIONS The conference will include contributed papers, tutorials, system descriptions and invited lectures. Submissions are invited in three categories: A Research papers (reporting original theoretical and/or experimental research, up to 15 pages) B System descriptions (up to 7 pages) C Tutorials in all areas of analytic tableaux and related methods from academic research to applications (proposals up to 5 pages) Submissions in categories A and B will be reviewed by peers, typically members of the program committee. They must be unpublished and not submitted for publication elsewhere. Accepted papers in these categories will be published in the conference proceedings (within the LNAI series of Springer), which will be available at the conference. For category B submissions a working implementation must exist and be available to the referees. Tutorial submissions (Category C) may be at introductory, intermediate, or advanced levels. Novel topics and topics of broad interest are preferred. The submission should include the title, the author, the topic of the tutorial, its level, its relevance to conference topics, and a description of the interest and the scientific contents of the proposed tutorial, to be presented in a time frame of at most 3 hours. Tutorial proposals will be reviewed by members of the program committee. For each accepted paper, at least one author is required to attend the conference to present the paper. Prospective authors are required to register a title and an abstract a week before the paper submission deadline. Further information and instructions about submissions can be found on the conference website at http://tableaux13.loria.fr. IMPORTANT DATES Tutorial proposal submission deadline: March 23, 2013 Notification of acceptance of tutorials: April 5, 2013 Abstract submission deadline: April 8, 2013 Paper submission deadline: April 15, 2013 Notification of paper decisions: June 1, 2013 Camera-ready papers due: June 14, 2013 Conference: September 16-19, 2013 CALL FOR WORKSHOPS ------------------ Workshop proposals on specialised subjects in the range of the conference topics are welcome. We can accept up to 3 proposals. They can focus on specialized or broader areas and also on theoretical and/or applied topics. The format of a workshop is left to the organizers but typically TABLEAUX workshops feature invited speakers and a number of contributed presentations and the intended schedule is for one-day workshops. The date for TABLEAUX workshops is Monday 16th September, 2013. Proposals should include: - Workshop title - Names and affiliations of the organizers - Brief scientific description of the aims and scopes of the workshop, with an emphasis on the relevance for the Tableaux community. - Presentation of the proposed format and agenda. - Procedure for selecting papers and possibly participants. . - Expected number of participants and the potential invited speakers. - Plans for dissemination (for example, special issues of journals). To submit a workshop proposal, please send a description (up to 3 pages) to the PC chairs by February 22, 2013. The proposals will be reviewed by the members of the PC committee. PROGRAM COMMITTEE Carlos Areces, National University of C?rdoba, Argentina Arnon Avron, Tel-Aviv University, Israel Matthias Baaz, University of Technology, Vienna, Austria Philippe Balbiani, IRIT - CNRS, Toulouse, France Marta Cialdea Mayer, University Roma Tre, Roma, Italy Amy Felty, University of Ottawa, Canada Ulrich Furbach, University of Koblenz-Landau, Germany Didier Galmiche, LORIA - Lorraine University, Nancy, France (Chair) Valentin Goranko, Technical University of Denmark, Denmark Rajeev Gore, Australian National University, Canberra, Australia Reiner H?hnle, Technical University of Darmstadt, Germany Dominique Larchey-Wendling, LORIA - CNRS, Nancy, France (Chair) George Metcalfe, University of Bern, Switzerland Dale Miller, INRIA Saclay - LIX, Palaiseau, France Neil Murray, State University of New York, United States of America Nicola Olivetti, University of Marseille, France Jens Otten, University of Potsdam, Germany Lawrence C Paulson, University of Cambridge, United Kingdom Nicolas Peltier, LIG - CNRS, Grenoble, France Renate Schmidt, University of Manchester, United Kingdom Alex Simpson, University of Edinburgh, Scotland, United Kingdom Viorica Sofronie-Stokkermans, University of Koblenz-Landau, Germany Luca Vigano, University of Verona, Italy Arild Waaler, University of Oslo, Norway CONFERENCE and PC CHAIRS Didier Galmiche, LORIA - Lorraine University, Nancy, France Dominique Larchey-Wendling, LORIA - CNRS, Nancy, France From eernst at cs.au.dk Tue Dec 4 07:02:45 2012 From: eernst at cs.au.dk (Erik Ernst) Date: Tue, 4 Dec 2012 12:02:45 +0000 Subject: [TYPES/announce] CFP: Foundations of Aspect-Oriented Languages (FOAL) 2013 Message-ID: <5236AF453495154F9AF8B307F6783A5F01126035@SRVUNIMBX06.uni.au.dk> [Apologies if you receive multiple copies of this CFP] *** CALL FOR PAPERS: Foundations of Aspect-Oriented Languages *** FOAL is a one day workshop affiliated with MODULARITY: aosd 2013 conference in the Fukuoka International Congress Center, Japan, on March 26, 2013. Papers are due January 7, 2013, at 23:00 GMT. Themes and Goals FOAL is a forum for research in foundations of aspect-oriented and other advanced separation of concern mechanisms. Areas of interest include but are not limited to: * Semantics of advanced separation of concern mechanisms * Specification and verification for languages with such mechanisms * Type systems * Static analysis * Theory of testing * Theory of composition * Theory of translation (compilation) and rewriting * Comparison of different advanced modularization and separation of concern mechanisms The workshop aims to foster work in foundations, including formal studies, promote the exchange of ideas, and encourage workers in the semantics and formal methods communities to consider advanced separation of concern mechanisms. All theoretical and foundational studies of this topic are welcome. Even though the workshop title contains the term "aspect-oriented", the workshop is not limited to aspect-oriented programming languages, but welcomes topics on other advanced separation of concern mechanisms such as feature-oriented or context-oriented programming. The goals of FOAL are to: * Make progress on the foundations of aspect-oriented and other advanced separation of concern mechanisms. * Exchange ideas about semantics and formal methods for aspect-oriented and other languages with advanced separation of concerns. * Foster interest within the programming language theory and types communities in languages with advanced separation of concerns. * Foster interest within the formal methods community in aspect-oriented programming and other advanced separation of concern mechanisms, and the problems of reasoning about them. Workshop Format The planned workshop format is primarily presentation of papers and group discussion. Talks will come in two categories: regular (25 minutes plus 5 minutes of discussion) and short (7 minutes plus 3 minutes of discussion). The short talks will allow for presentations of topics for which results are not yet available, perhaps for researchers who are seeking feedback on ideas or seek collaborations. We also plan to ensure sufficient time for discussion of each presentation by limiting the overall number of talks. Submissions Invitation to the workshop will be based on papers selected by the program committee; those wishing to attend but not having a paper to submit should contact the organizers directly to see if there is sufficient space in the workshop. FOAL solicits regular and short papers on all areas of formal foundations of advanced separation of concern mechanisms. Submissions will be read by the program committee and designated reviewers. Papers will be selected for regular and short presentation at the workshop based on their length, scientific merit, innovation, readability, and relevance. Papers previously published or already being reviewed by another conference are not eligible. Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than their paper length would otherwise command. We will limit the length of paper presentations and the number of papers presented to make sure that there is enough time for discussion. Five page papers presented at the workshop can be included in the ACM Digital Library, at the discretion of the authors. Authors of accepted papers who wish to have their papers in the ACM Digital Library will be asked to transfer copyright to the ACM. However, as FOAL is a workshop, publication of extended versions of the papers in other venues will remain possible. We will also investigate having a special issue of a journal for revisions of selected papers after the workshop. Authors should note the following details: * Submissions are due no later than 23:00 GMT, 7 January 2013 * Regular papers must not exceed 5 pages in length, and short papers must not exceed 3 pages in length * We encourage use of the ACM Conference format for submissions, as this will be required for accepted papers * You must add page numbers (which are not part of the standard format) to your submissions, to make adding comments easier * Submissions are to be made at the following URL: https://www.easychair.org/conferences/?conf=foal2013 We will notify the corresponding author of papers that are selected for presentation at the workshop by 28 January 2013. Early registration for MODULARITY: aosd (you must register for the conference to attend the workshop) shortly follows that date. Final versions of 5 page papers for the ACM digital library will be due on 4 February 2013. For more information, please visit the FOAL Workshop home page (at http://www.eecs.ucf.edu/FOAL). Important Dates Paper Submission Deadline - January 7, 2013, 23:00 GMT Notification of Acceptance - January 28, 2013 Final version and 5 page version due - February 4, 2013 Workshop - March 26, 2013 Program Committee * Erik Ernst (Program Committee Chair) -- University of Aarhus * Sven Apel -- University of Passau * Don Batory -- University of Texas, Austin * Eric Bodden -- European Center for Security and Privacy by Design, Center for Advanced Security Research Darmstadt * John Tang Boyland -- University of Wisconsin, Milwaukee * Sophia Drossopoulou -- Imperial College * Matthew Flatt -- University of Utah * Atsushi Igarashi -- Kyoto University * Radha Jagadeesan -- DePaul University * Todd Millstein -- University of California, Los Angeles * Bruno C. d. S. Oliveira -- National University of Singapore * Klaus Ostermann -- University of Marburg * Nicolas Tabareau -- Ecole des Mines de Nantes / INRIA * Elena Zucca -- University of Genoa Organizers * Gary T. Leavens -- University of Central Florida * Hidehiko Masuhara -- University of Tokyo * Hridesh Rajan -- Iowa State University * Mario Sudholt -- Ecole des Mines de Nantes -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From HANAC at il.ibm.com Tue Dec 4 09:09:37 2012 From: HANAC at il.ibm.com (Hana Chockler) Date: Tue, 4 Dec 2012 16:09:37 +0200 Subject: [TYPES/announce] VSSE 2013 - Last call for papers! Message-ID: ============================================================== We apologize if you receive multiple copies of this CFP. Please distribute to anyone who may be interested. ============================================================== Last Call for Papers! Deadline is December 20, 2012! ********************************************************* Second Workshop on Validation Strategies for Software Evolution (VSSE) 2013 http://sysrun.haifa.il.ibm.com/hrl/vsse2013/ Rome, Italy, Saturday March 16th, 2013 Affiliated with ETAPS 2013: http://www.etaps.org/2013/workshops13 ********************************************************* VSSE focuses on the verification and testing of software changes and upgrades. Software is usually not written all at once, but is built incrementally for several reasons: - Maintenance - fixing errors and flaws, hardware changes, etc. - Enhancements - new functionality, improved efficiency, extension, new regulations, etc. Changes are done frequently during the lifetime of most systems and can introduce software errors that were not present in the old version or expose errors that were present before but did not get exercised. In addition, upgrades are done gradually, so the old and new versions have to co-exist in the same system. This workshop addresses the issue of efficient and reliable verification of system changes and upgrades by means of formal verification, analysis and testing techniques. The first VSSE took place in Tallinn, Estonia, in 2012, affiliated with ETAPS 2012. The program of VSSE 2012 consisted of invited talks by experts in this area. Following the success of VSSE 2012, we decided to invite submissions to VSSE 2013. The workshop proceedings will be published in Electronic Notes in Theoretical Computer Science series (ENTCS). We encourage submission of work that addresses all aspects of formal verification, analysis, and testing of evolving software. Paper submission: All submitted papers should be in ENTCS format. For details, see: http://www.entcs.org/prelim.html There are two categories of submissions: A. Regular papers. Regular paper submissions should describe original and unpublished work. Simultaneous submission to other conferences with proceedings or submission of previously published material is strictly forbidden. Regular papers should not exceed twelve (12) pages in ENTCS format ? please see the instructions at http://www.entcs.org/preliminary.html . Submissions are accepted in electronic form (pdf), via the easychair at https://www.easychair.org/conferences/?conf=vsse2013 B. Presentation only. Presentation-Only submissions can describe a previously published work or a preliminary idea. Presentation-only submissions will be given a presentation slot in the workshop, but will not be published in the proceedings. This is an opportunity to present an already published relevant work, or to describe an interesting idea not yet ready for publication. Presentation will not be considered as a publication, so submission of already published or submitted results is allowed and encouraged. If you are working on the validation of changes and upgrades and plan to attend ETAPS, please consider submitting your presentation to the workshop. Presentation-only submissions can be either a two-pages abstract (pdf), or a presentation (PowerPoint or pdf). ---------------------------------------------------------------- Important dates: Submission deadline: December 20, 2012 Author notification: January 20, 2013 Camera-read version: January 30, 2013 Workshop: March 16, 2013 ---------------------------------------------------------------- Workshop chair: Hana Chockler (hanac at il.ibm.com) Organizing committee: Hana Chockler, IBM Research Daniel Kroening, Oxford Natasha Sharygina, USI Leonardo Mariani, UniMiB Giovanni Denaro, UniMiB Program committee: Hana Chockler, IBM Research Giovanni Denaro, University of Milano Bicocca Alastair Donaldson, Imperial College, London Daniel Kroening, Oxford Shuvendu Lahiri, Microsoft Research Leonardo Mariani, University of Milano Bicocca Fabio Massacci, University of Trento Ali Muhammad, VTT Technical Research Centre of Finland Manuel Oriol, ABB Corporate Research Alessandro Orso, Georgia Institute of Technology Bastian Schlich, ABB Corporate Research Ondrej Sery, Charles University in Prague Natasha Sharygina, University of Lugano Ofer Strichman, Technion Tanja Vos, Universidad Politecnica de Valencia Michael Wahler, ABB Corporate Research From gds at doc.ic.ac.uk Tue Dec 4 11:00:39 2012 From: gds at doc.ic.ac.uk (Gareth Smith) Date: Tue, 04 Dec 2012 16:00:39 +0000 Subject: [TYPES/announce] PLMW: Mentoring at POPL. Second Call for Participation Message-ID: <87d2yp9594.fsf@doc.ic.ac.uk> Students! You have until Sunday to apply for funding to come to both POPL and PLMW! CALL FOR PARTICIPATION SIGPLAN Programming Languages Mentoring Workshop, Rome Tuesday January 22, 2013 Co-located with POPL 2013 PLMW web page: http://www.doc.ic.ac.uk/~gds/PLMW/index.html After the resounding success of the first Programming Languages Mentoring Workshop at POPL 2012, we proudly announce the 2nd SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2013 and organised by Nate Foster, Philippa Gardner, Alan Schmitt, Gareth Smith, Peter Thieman and Tobias Wrigstad. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will provide technical sessions on cutting-edge research in programming languages, and mentoring sessions on how to prepare for a research career. We will bring together leaders in programming language research from academia and industry to give talks on their research areas. The workshop will engage students in a process of imagining how they might contribute to our research community. We especially encourage women and underrepresented minority students to attend PLMW. Since PLMW will be in Rome this year, we particularly look forward to seeing Eastern European students at the workshop. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay through the entire conference, and will also attend the POPL tutorials on Monday 21st January which are free to PLMW registered attendees. Through the generous donation of our sponsors, we are able to provide scholarships to fund student participation. These scholarships will cover reasonable expenses (airfare, hotel and registration fees) for attendance at both the workshop and the POPL conference. Students attending this year will get one year free student membership of SIGPLAN The workshop registration is open to all. Students with alternative sources of funding are welcome. APPLICATION for PLMW scholarship: The scholarship application can be accessed from the workshop web site (http://www.doc.ic.ac.uk/~gds/PLMW/index.html). The deadline for full consideration of funding is 9th December, 2012. Selected participants will be notified from Friday 14th December, and will need to register for the workshop by December 24th. SPONSORS: Google Imperial College London Jane Street Monoidics NSF Resource Reasoning SIGPLAN vmware From Simon.Gay at glasgow.ac.uk Wed Dec 5 10:23:43 2012 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Wed, 5 Dec 2012 15:23:43 +0000 Subject: [TYPES/announce] FINAL CFP PLACES'13 -- Deadline for Abstracts Fri 14 Dec, full papers Fri 21 Dec Message-ID: <50BF66FF.8000906@glasgow.ac.uk> [ The themes of PLACES include types, concurrency and mobility. SG ] FINAL CALL FOR PAPERS PLACES'13 Programming Language Approaches to Concurrency and Communication-cEntric Software 23rd March 2013, Rome, Italy (affiliated with ETAPS 2013) http://places13.di.fc.ul.pt/ ** Important Dates ** Abstract (title & abstract): 14th December 2012 Paper Submission (up to 5 pages): 21st December 2012 Paper Notification: 23rd January 2012 Final versions of papers: 4th February 2012 ** Background ** Applications today are built using numerous interacting services; soon off-the-shelf CPUs will host thousands of cores, and sensor networks will be composed from a large number of processing units. Many applications need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems is inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. ** Topics of Interest ** Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: * language design and implementations for communications and/or concurrency, * session types, * concurrent data types, * concurrent objects and actors, * multicore programming, * use of message passing in systems software, * interface languages for communication and distribution, * program analysis, * web services, * novel programming methodologies for sensor networks, * integration of sequential and concurrent programming, * high-level programming abstractions for security concerns in concurrent, distributed programming, * runtime architectures for concurrency, * scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Submission Guidelines ** Authors should submit a title and an abstract by Wednesday 14th December 2012. Papers of up to*five pages* in length should be submitted in PDF format by Wednesday 21st December 2012 using the EasyChair proceedings template available at: http://www.easychair.org/easychair.zip Abstracts and papers should be submitted using EasyChair: http://www.easychair.org/conferences/?conf=places2013 Preliminary proceedings will be available at the workshop. The post proceeding will be published as an EPTCS volume. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. Enquiries can be sent to the PC co-chairs. ** Program Committee ** Alastair Beresford, University of Cambridge, UK Viviana Bono, Universita di Torino, Italy Alastair Donaldson, Imperial College London, UK Dan Ghica, University of Birmingham, UK Joshua Guttman, Worcester Polytechnic Institute, MA, US Thomas Hildebrandt, University of Copenhagen, Denmark Paul Keir, Codeplay Ltd, UK Hans-Wolfgang Loidl, Heriot-Watt University, UK Conor McBride, University of Strathclyde, UK Jeremy Singer, University of Glasgow, UK Sven-Bodo Scholz, Heriot-Watt University, UK Nikhil Swamy, Microsoft Research, US Wim Vanderbauwhede (co-chair), University of Glasgow, UK Hugo Torres Vieira, Universidade de Lisboa, Portugal Nobuko Yoshida (co-chair), Imperial College London, UK ** Organizing Committee ** Alastair Beresford, University of Cambridge, UK Simon Gay, University of Glasgow, UK Alan Mycroft, University of Cambridge, UK Vasco Vasconcelos, University of Lisbon, Portugal Nobuko Yoshida, Imperial College London, UK _______________________________________________ SPLS mailing list SPLS at mailhost.dcs.gla.ac.uk https://mr1.dcs.gla.ac.uk/mailman/listinfo/spls -------------- next part -------------- An HTML attachment was scrubbed... URL: From german at fi.upm.es Wed Dec 5 10:50:05 2012 From: german at fi.upm.es (German Puebla) Date: Wed, 05 Dec 2012 16:50:05 +0100 Subject: [TYPES/announce] CFP BYTECODE'13 Message-ID: <86624g4hxu.fsf@fi.upm.es> CALL FOR PAPERS BYTECODE 2013 8th Workshop on Bytecode Semantics, Verification, Analysis and Transformation A Satellite workshop of ETAPS 2013 Rome, Italy 23 March 2013 http://costa.ls.fi.upm.es/bytecode13 NEWS ==== * Science of Computer Programming has agreed to publish a special issue on Bytecode 2013 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. No formal proceedings of the workshop will be published, but selected papers might be invited for a special issue of Science of Computer Programming. Important Dates =============== Abstract submission: December 9, 2012 Paper submission: December 16, 2012 Notification: January 21, 2013 Final version: February 8, 2013 Submission information ====================== We solicit extended abstracts and position papers of at most 8 pages, describing work related to semantics, verification, analysis and transformation. In particular, we explicitly welcome tool demonstrations. Submissions may overlap with submissions to other conferences or journals. There will be a light-weight reviewing process, where submissions will be judged on their interest to the workshop audience. There will be no formal proceedings of the workshop. All accepted submissions will be distributed among the workshop participants. After the workshop, presenters of extended abstracts, position papers, tool demos and of invited presentations may be invited to contribute to a special issue of Science of Computer Programming. Invitations will be based on submissions and presentations. Papers can be submitted (as PDF) through easy chair https://www.easychair.org/conferences/?conf=bytecode2013 Organisers ========== Miguel Gomez-Zamalloa, Complutense University of Madrid, Spain German Puebla, Technical University of Madrid, Spain All questions about the workshop can be addressed to them via mail: mzamalloa at fdi.ucm.es german at fi.upm.es Program Committee ================== Richard Bubel, Technische Universitat Darmstadt Andrew Craik, Oracle Labs, Brisbane, Australia J?rgen Giesl, RWTH Aachen Laurent Hubert, Prove&Run Marieke Huisman, University of Twente Francesco Logozzo, Microsoft Research Mark Marron, IMDEA Software Institute Corina Pasareanu, CMU/NASA Ames Research Center Ricardo Pe?a, Complutense University of Madrid David Pichardie, INRIA Rennes - Bretagne Atlantique Fausto Spoto, Dipartimento di Informatica, Verona From Simon.Gay at glasgow.ac.uk Wed Dec 5 11:16:19 2012 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Wed, 5 Dec 2012 16:16:19 +0000 Subject: [TYPES/announce] Kohei Honda Message-ID: <50BF7353.3050309@glasgow.ac.uk> Dear Colleagues, I am very sorry to give you the tragic and shocking news that Kohei Honda has passed away, after suffering a stroke at the weekend. This is a terrible loss for all of us personally; for our field, in which Kohei was so active; and of course especially for Nobuko. Simon Gay -------------------------------------------------------------------- Dr Simon Gay School of Computing Science Senior Lecturer in Sir Alwyn Williams Building Computing Science University of Glasgow Glasgow G12 8QQ, UK Phone: +44 141 330 6035 Fax: +44 141 330 4913 Email: simon at dcs.gla.ac.uk Web: www.dcs.gla.ac.uk/~simon Skype: SimonJGay -------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From tase2013 at aston.ac.uk Wed Dec 5 12:13:01 2012 From: tase2013 at aston.ac.uk (TASE 2013) Date: Wed, 5 Dec 2012 17:13:01 +0000 Subject: [TYPES/announce] 3rd CFP for TASE 13, 1 - 3 July 2013, Birmingham, UK Message-ID: The 7th International Symposium on Theoretical Aspects of Software Engineering ? TASE 2013 1st ? 3rd July 2013, Aston University Conference Centre, Birmingham, UK 3rd Call for Papers Dear Colleagues, On behalf of the organizing committee, we are pleased to invite you to submit papers to the 7th International Symposium on Theoretical Aspects of Software Engineering (TASE 2013). We apologise for any eventual cross-posting and we cordially encourage you to forward this call for papers to all of your colleagues and students who might be interested. Overview Software engineering is at the heart of many state of the art tools designed to simplify and improve our lives, including cloud computing applications, the semantic web and self-configuring systems. As these instruments are involved in fields of vital importance, by providing customised solutions for education, businesses, government and health care, the role played by the theory behind their working principles bears an undeniable weight. In this context, the TASE International Symposium strives to provide top scientists with a framework for communicating their latest and most valuable theoretical results in the field of software engineering. Subject Areas We invite contributions concerning the theoretical aspects of the following areas (please note that this is not an exhaustive list): ? model driven software engineering * component based software engineering * service oriented and cloud computing * semantic web and web services * software security, reliability, simulation and verification * probabilistic fundamentals of software engineering * embedded and real time software systems * program logics and underlying mathematical issues * aspect, rule and object oriented software design * self-configuring software systems ? reverse engineering Paper Submission System We invite all prospective authors to submit their manuscripts via the TASE13 portal, hosted on Easychair at: https://www.easychair.org/conferences/?conf=tase2013 Further instructions for authors (e.g. paper format and length) will be communicated at a later date. Important Dates Title and abstract submission: 18 January 2013 Paper submission: 25 January 2013 Acceptance/rejection notification: 22 March 2013 Camera-ready version submission: 26 April 2013 Contact tase2013 at aston.ac.uk www.aston.ac.uk/tase2013 Alternative Formats A PDF version of this CFP is available on the symposium website or by following this link: http://www1.aston.ac.uk/EasySiteWeb/GatewayLink.aspx?alId=128755 We are looking forward to receiving your submissions. Hai Wang Richard Banach Program Chairs, TASE 2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: TASE13_CFP3.pdf Type: application/pdf Size: 269503 bytes Desc: TASE13_CFP3.pdf URL: From dejan at cs.nyu.edu Wed Dec 5 13:49:37 2012 From: dejan at cs.nyu.edu (=?UTF-8?Q?Dejan_Jovanovi=C4=87?=) Date: Wed, 5 Dec 2012 13:49:37 -0500 Subject: [TYPES/announce] Announcing the release of CVC4, version 1.0 In-Reply-To: References: Message-ID: We are pleased to announce the first public release of CVC4, version 1.0, the open-source flagship SMT solver developed at New York University and the University of Iowa, available at: http://cvc4.cs.nyu.edu CVC4 is the latest in the CVC series of SMT solvers and provides the functionality of its predecessors while dramatically boosting performance. Features include: - support for the native (CVC) language as well as the SMT-LIB standard language - decision procedures for the following theories and their combination: equality with uninterpreted functions, real and integer linear arithmetic, bit-vectors, arrays, tuples, records, and user-defined inductive data types; - support for quantifiers through heuristic instantiation; - an interactive text-based interface; - a rich API for embedding in other systems (available for C++ and Java); - model generation abilities; - source compatibility with much of the CVC3 API via a "compatibility library"; - essentially no limit on the use of source or binaries for research or commercial purposes (details on the license can be found on the web site). We welcome feedback, feature requests, contributions, and collaborations. It is our hope that CVC4 will become a research platform for a broad and diverse set of users and developers. If you are interested in getting involved with the project, please contact a member of the development team: Clark Barrett (NYU, project leader) Cesare Tinelli (U Iowa, project leader) Kshitij Bansal (NYU) Fran?ois Bobot (Paris-Diderot University) Chris Conway (Google) Morgan Deters (NYU) Liana Haderean (NYU) Dejan Jovanovi? (NYU) Tim King (NYU) Andrew Reynolds (U Iowa) The development of CVC4 is supported in part by the following organizations: - The Air Force Office of Scientific Research (award FA9550-09-1-0596) - Intel Corporation - The National Science Foundation (grants 0644299, 0914956, 1049495, 1228765, 1228768) - The Semiconductor Research Corporation (contract 2008-TJ-1850) Downloads, documentation, tutorials, and more information are available at the CVC4 web site: http://cvc4.cs.nyu.edu -The CVC4 team From A.Jung at cs.bham.ac.uk Thu Dec 6 17:35:01 2012 From: A.Jung at cs.bham.ac.uk (Achim Jung) Date: Thu, 6 Dec 2012 22:35:01 +0000 (GMT) Subject: [TYPES/announce] MFPS XXIX Preliminary Announcement Message-ID: MFPS XXIX Preliminary Announcement June 23 - 25, 2013 Tulane University New Orleans, LA Co-located with LICS and CSF The 29th Conference on the Mathematical Foundations of Programming Semantics will take place on the campus of Tulane University, New Orleans, LA USA from June 23 to June 25, 2013. The conference will be co-located with the 2013 Logic in Computer Science Symposium and the 2013 Computer Security Foundations Symposium. MFPS will have a number of invited speakers and special sessions, one of which will be a shared session with LICS celebrating Dana Scott's 80th birthday year. This is a preliminary announcement - details about the conference, including the program committee membership, the invited speakers and the special sessions will be available within the next few weeks. The purpose of this announcement is to alert members of the community about the relevant personnel overseeing the conference and to provide the important dates for the meeting. The Program Committee Chair for MFPS XXIX is Dexter Kozen (Cornell). The local arrangements chair is Michael Mislove (Tulane). The Organizing Committee for MFPS includes Andrej Bauer (Slovenia), Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane), Joel Ouaknine (Oxford) and Prakash Panangaden (McGill). The Important Dates for MFPS XXIX are the following: Deadline for titles and short abstracts: Monday. March 25, 2013 Deadline for full submissions: Tuesday, April 2, 2013 Notification of accepted papers: Monday, April 28, 2013 From pangjun at gmail.com Fri Dec 7 04:19:25 2012 From: pangjun at gmail.com (Jun PANG) Date: Fri, 7 Dec 2012 10:19:25 +0100 Subject: [TYPES/announce] ICECCS 2013 in Singapore -- 2nd Call for Papers Message-ID: =================================================== CALL FOR PAPERS The Eighteenth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2013) 17-19 July 2013 National University of Singapore, Singapore http://www.comp.nus.edu.sg/~pat/iceccs2013 =================================================== IMPORTANT DATES --------------------------- Abstract submission: February 1, 2013 Paper submission deadline: February 15, 2013 Workshop proposal submission: February 15, 2013 Notification of acceptance: March 30, 2013 Camera-ready material for publication: April 20, 2013 Checking for Production: April 30, 2013 Conference date: July 17-19, 2013 Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts, from a variety of user domains and software disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools, existing complex systems, and commercially available tools. SCOPE AND TOPICS --------------------------- Authors are invited to submit papers describing original, unpublished research results, case studies and toolset research results, case studies and tools. Papers are solicited in all areas related to complex computer-based systems, including the causes of complexity and means of avoiding, controlling, or coping with complexity. Topic areas include, but are not limited to: Requirement specification and analysis Verification and validation Security and privacy of complex systems Model-driven development Reverse engineering and refactoring Architecture software Big Data Management Ambient intelligence, pervasive computing Ubiquitous computing, context awareness, sensor networks Design by contract Agile methods Safety-critical & fault-tolerant architectures Adaptive, self-managing and multi-agent systems Real-time, hybrid and embedded systems Systems of systems Tools and tool integration Industrial case studies SUBMISSION --------------------------- Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic and culminate panels to discuss relationships between industrial and academic research. Papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and industrial experience reports should describe practical projects carried out in industry, and reflect on the lessons learnt from them. FULL PAPERS Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. POSTER PAPERS Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedings. PAPER SUBMISSION Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All submissions should be made through the Easychair Website: https://www.easychair.org/account/signin.cgi?conf=iceccs2013 ORGANIZING COMMITTEES --------------------------- General Co-Chairs Jin Song Dong, National University of Singapore, Singapore Jun Sun, Singapore University of Technology and Design, Singapore Program Committee Co-Chairs Yang Liu, Nanyang Technological University, Singapore Andrew Martin, Oxford University, UK Workshop Chair Zhenjiang Hu, National Institute of Informatics, Japan Yuan-Fang Li, Monash University, Australia Publicity Chair Jun Pang, University of Luxembourg, Luxembourg Tutorial Chair Isabelle Perseil, INSERM Research, France Local Chair Shangwei Lin, National University of Singapore, Singapore Manchun Zheng, Singapore University of Technology and Design, Singapore Doctoral Symposium Chair Zhengchang Xin, Nanyang Technological University, Singapore Registration Chair ShaoJie Zhang, Singapore University of Technology and Design, Singapore Web Chair Jianqi Shi, National University of Singapore, Singapore PROGRAMME COMMITTEES --------------------------- Marc Aiguier, Ecole Centrale Paris, France Yamine Ait Ameur, LISI/ENSMA, France Luis Almeida, da Universidade do Porto, Portugal Etienne Andre, Universit? Paris 13, France Luciano Baresi, DEI - Politecnico di Milano, Italy Karin Breitman, PUC-RJ, Brazil Phillip J Brooke, Teesside University, United Kingdom Jean-Michel Bruel, IRIT, France Radu Calinescu, University of York, United Kingdom Corina Cirstea, University of Southampton, United Kingdom Felicita Di Giandomenico, ISTI-CNR, Italy Gilles Dowek, INRIA, France Kerstin Eder, University of Bristol, United Kingdom Carlo Alberto Furia, ETH Zurich, Switzerland Sebastien Gerard, CEA LIST, France Mark Grechanik, University of Illinois at Chicago, United States Lindsay Groves, Victoria University of Wellington, New Zealand Lars Grunske, Swinburne University of Technology, Australia Esther Guerra, Universidad Aut?noma de Madrid, Spain Fei He, Tsinghua University, China Moonzoo Kim, KAIST, South Korea Joseph Kiniry, IT University of Copenhagen, Denmark Daniel Kroening, Oxford University, United Kingdom Ralf Laemmel, Universit?t Koblenz-Landau, Germany Regine Laleau, Paris Est Creteil University, France Phillip Laplante, Pennsylvania State University, United States Kung-Kiu Lau, The University of Manchester, United Kingdom Yuan-Fang Li, Monash University, Australia Xiaohong Li, Tianjin University, China Peter Lindsay, The University of Queensland, Australia Yang Liu, Nanyang Technological University, Singapore Gerald Luettgen, University of Bamberg, Germany Tiziana Margaria, University of Potsdam, Germany Andrew Martin, University of Oxford, United Kingdom Julie Mccann, Imperial College, United Kingdom Dominique Mery, Universit? de Lorraine, LORIA Raffaela Mirandola, Politecnico di Milano, Italy Jun Pang, University of Luxembourg, Luxembourg Isabelle Perseil, Inserm, France Robert Pettit, The Aerospace Corporation, USA Bernhard Rumpe, RWTH Aachen University, Germany Ricardo Sanz, Universidad Politecnica de Madrid, Spain Cristina Seceleanu, M?lardalen University, V?ster?s, SWEDEN Janet Smart, University of Oxford, United Kingdom Volker Stolz, University of Oslo, Norway Jing Sun, University of Auckland, New Zealand Clemens Szyperski, Microsoft Research, United States Kenji Taguchi, AIST, Japan Dalila Tamzalit LINA Laboratory, University of Nantes, France Tullio Vardanega University of Padua, Italy Xinyu Wang, Zhejiang University, China Chao Wang, Virginia Tech, United States Hai H. Wang, University of Aston, United Kingdom Bow-Yaw Wang, Academia Sinica, Taiwan Bechir Zalila, ReDCAD Laboratory, University of Sfax, Tunisia Naijun Zhan, Chinese Academy of Sciences, China Huibiao Zhu, East China Normal University, China Steffen Zschaler, King's College London, United Kingdom -------------- next part -------------- An HTML attachment was scrubbed... URL: From viktor at mpi-sws.org Fri Dec 7 11:32:11 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Fri, 7 Dec 2012 17:32:11 +0100 Subject: [TYPES/announce] ACM POPL 2013: Call for participation (Updated) Message-ID: <7EBDD073-6637-497F-9ABA-A1C9E8097384@mpi-sws.org> *************************************************** * POPL 2013: Principles of Programming Languages * * Hotel Parco dei Principi, Rome, Italy * * 23-25 January, 2013 * *************************************************** Main web site: http://popl.mpi-sws.org/2013/ Twitter: https://twitter.com/POPL2013 Registration: https://regmaster3.com/2013conf/POPL13/register.php Deadline for early registration: **December 31, 2012** Conference & hotel logistics: http://popl13.di.univr.it Conference program: http://popl.mpi-sws.org/2013/program.html ******* Student events ******* - TutorialFest (21 January; free, but registration required) http://wrigstad.com/popl13/tutorialfest.html - PLMW: Programming Language Mentoring Workshop (22 January) http://www.doc.ic.ac.uk/~gds/PLMW/ - Short student talks @ student sessions (23 + 25 January) http://wrigstad.com/popl13/ ****** Other co-located events ****** - VMCAI: Verification, Model Checking, and Abstract Interpretation (20-22 January) - SVARM: Workshop on Synthesis, Verification, and Analysis of Rich Models - Meeting of COST Action IC0109 Rich Model Toolkit (20-21 January) - PADL: International Symposium on Practical Aspects of Declarative Languages (21-22 January) - PEPM: Partial Evaluation and Program Manipulation (21-22 January) - ID: Interference and Dependence (21 January) - BEAT: Workshop on Behaviors and Types (22 January) - DDFP: Workshop on Data Driven Functional Programming (22 January) - PLPV: Programming Languages meets Program Verification (22 January) - PLMW: Programming Language Mentoring Workshop (22 January) - PPREW: Program Protection and Reverse Engineering Workshop (26 January) - OBT: Off The Beaten Track: Underrepresented Problems for Programming Language Researchers (26 January) From pmt6sbc at maths.leeds.ac.uk Sun Dec 9 14:30:11 2012 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Sun, 9 Dec 2012 19:30:11 +0000 (GMT) Subject: [TYPES/announce] Legacy of Reuben Goodstein, Friday 14th December, 2012 - final programme details Message-ID: _______________________________________________________________________ THE LEGACY OF REUBEN GOODSTEIN His Centennial and the Wittgenstein Connection Friday 14th December 2012, University of Leicester http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein For final details of the programme for this Goodstein Centenary Day, see: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein/programme 2012 is the Centenary of the birth of Reuben Louis Goodstein, the first holder of a UK university chair in Mathematical Logic. In honour of Goodstein and his legacy, we are organizing a day recognizing his impact on the development of Mathematical Logic, worldwide, in the UK and at Leicester. The meeting is supported by the London Mathematical Society and the British Logic Colloquium. The list of distinguished speakers includes: Harvey Rose (Bristol), Jan von Plato (Helsinki), Stanley Wainer (Leeds), Mathieu Marion/Mitsuhiro Okada (Montreal/Keio, Japan), Mike Price (Leicester), Mary Walmsley (Leicester). Topics will include: * Goodstein's theorem in the light of the Bernays-Goodstein correspondence * Goodstein sequences and independence of Peano arithmetic * Goodstein and Wittgenstein * Goodstein and the Mathematical Association * We are also hoping to have a panel discussion entitled 'Goodstein * 'Remembered', where any delegate can share memories and thoughts of Goodstein. We anticipate there will be a number of ex-colleagues and students of Goodstein, and members of the Goodstein family in attendance, and a small evening dinner for speakers and organisers, and guests. The support of the London Mathematical Society provides for a number of bursaries available to UK research students to enable them to attend the meeting. Registration is free. To register, and for details of the programme, please go to the meeting webpage: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein Download a copy of the conference poster: http://www2.le.ac.uk/departments/mathematics/legacy-of-goodstein/Goodstein.pdf __________________________ Organisers: S. Barry Cooper (Leeds), Jeremy Levesley (Leicester), Rick Thomas (Leicester), Paul Williams (LSE) From Vasileios.Koutavas at scss.tcd.ie Mon Dec 10 08:25:18 2012 From: Vasileios.Koutavas at scss.tcd.ie (Vasileios Koutavas) Date: Mon, 10 Dec 2012 13:25:18 +0000 Subject: [TYPES/announce] OCCP 2013: Final Call for Papers Message-ID: <698BE59F-55E7-4EBE-BA6C-0DEE14DB53EC@scss.tcd.ie> ---------------------------------------------------------------- FINAL CALL FOR PAPERS OCCP 2013 1st Workshop on Optimistic Cooperation in Concurrent Programming Rome, Italy, March 16th, 2013 (collocated with ETAPS 2013) http://www.scss.tcd.ie/Vasileios.Koutavas/occp-workshop/ ---------------------------------------------------------------- * DESCRIPTION Optimistic concurrency has long been accepted as a convenient method for programming systems where there is contention for resources. Traditionally in database systems and more recently in software transactional memory systems, optimistic concurrency is realized in the form of transactions, which the programmer can assume run isolated from their environment, thereby alleviating the need for explicit programming of locking schemes. Recent research on concurrent programming models have lead to the realization in both academia and industry that optimistic concurrency can also be advantageous in programming systems where concurrent processes need to cooperate to perform a desired task. In such systems transactional isolation needs to be abandoned. This brings forward numerous challenges in 1) the design and implementation of such systems, 2) the invention of appropriate programming language support for optimistic process cooperation, 3) the semantics, theory and verification of these systems. This workshop aims to bring together researchers and practitioners from academia and industry who work on aspects of optimistic process cooperation. It also aims to connect the different research communities pertinent to this field. These include the programming language community, the systems community and the concurrent calculi community. * SCOPE Topics of interest include, but are not limited to: - Programming language support for optimistic process cooperation. - Semantics and theory of optimistic process cooperation. - Compilation techniques and runtime systems. - Calculi for modelling optimistic process cooperation in concurrent and distributed computing. - Use of optimistic cooperation in the modelling of service-oriented and biological systems. - Reversible computation. - Static analysis and verification of systems employing optimistic process cooperation. - Programming idioms for optimistic process cooperation. - Applications where optimistic process cooperation can provide a significant benefit to the programmer. - Experience reports of existing systems and prototypes employing forms of optimistic cooperation. * INVITED SPEAKERS - Suresh Jagannathan (Purdue University) - Victor Luchangco (Oracle Labs) * TUTORIALS - Matthew Fluet (Rochester Institute of Technology) Transactional Events - Vasileios Koutavas (Trinity College Dublin) Theory of Optimistic Cooperation * PAPER SUBMISSION AND PUBLICATION Submitted papers should contain previously unpublished complete work, work in progress, or experience reports. Submissions should be in PDF format, prepared using the EPTCS style (http://style.eptcs.org/), and should be from 7 to 15 pages long, including references. Papers must be submitted through the Easychair page of the workshop: http://www.easychair.org/conferences/?conf=occp2013 Accepted papers will be distributed in electronic preliminary proceedings at the workshop. Subsequently, selected papers will be invited for publication in a post-workshop refereed proceedings in Electronic Proceedings in Theoretical Computer Science. * DATES Abstract submission deadline: 17 December 2012 Paper submission deadline: 21 December 2012 Notification: 18 January 2013 Camera ready deadline: 22 February 2013 * ORGANISERS Nick Benton (Mircosoft Research) Matthew Fluet (Rochester Institute of Technology) Matthew Hennessy (Trinity College Dublin) Vasileios Koutavas (Trinity College Dublin) Jens Palsberg (UCLA) From g.grov at hw.ac.uk Mon Dec 10 12:28:55 2012 From: g.grov at hw.ac.uk (Gudmund Grov) Date: Mon, 10 Dec 2012 17:28:55 +0000 Subject: [TYPES/announce] SCP Special Issue on Invariant Generation - Second Call for Papers [2 months to go] Message-ID: <6C035EC3-0919-443A-9DB0-48402DC72410@hw.ac.uk> (Apologies if you receive multiple copies of this announcement) ------------------------------------------------------------ Science of Computer Programming Special Issue on Invariant Generation -- SECOND CALL FOR PAPERS -- ------------------------------------------------------------ This special issue is devoted to the 4th international Workshop on Invariant Generation (WING 2012) http://cs.nyu.edu/acsys/wing2012/ which was held on June 30 2012 in Manchester as a satellite event of IJCAR 2012. The scope of the workshop is the automation of extracting and synthesising auxiliary properties of programs, in particular providing, debugging, and verifying auxiliary invariant annotations. This should be seen in a broad sense and relevant topics include (but are not limited to) the following: * Program analysis and verification * Inductive assertion generation * Inductive proofs for reasoning about loops * Applications to assertion generation using: - abstract interpretation, - static analysis, - model checking, - theorem proving, - theory formation, - algebraic techniques * Tools for inductive assertion generation and verification * Alternative techniques for reasoning about loops Submission to this special issue is completely open. We expect original articles (typically not more than 30 pages) that present high-quality contributions and must not be simultaneously submitted for publication elsewhere. Submission of extended versions of previously published papers is possible as long as the extension is significant, i.e., the submission can be considered a new paper, the previous paper is referenced, and the new material is clearly marked. Submissions must comply with SCP's author guidelines http://www.elsevier.com/wps/find/journaldescription.cws_home/505623/authorinstructions and be written in English. Submission is over the SCP website: http://ees.elsevier.com/scico/default.asp which you will have to register for if you do not have an account. When submitting your paper please choose the article type "Special issue: WING 2012". IMPORTANT DATES --------------- * Submission of papers: February 11, 2013. * Notification: April 26, 2013. GUEST EDITORS -------------- * Gudmund Grov (Heriot-Watt University, UK) * Thomas Wies (New York University, USA) CONTACT -------------- Please send any queries you may have to: wing2012 at easychair.org ----- Sunday Times Scottish University of the Year 2011-2013 Top in the UK for student experience Fourth university in the UK and top in Scotland (National Student Survey 2012) We invite research leaders and ambitious early career researchers to join us in leading and driving research in key inter-disciplinary themes. Please see www.hw.ac.uk/researchleaders for further information and how to apply. Heriot-Watt University is a Scottish charity registered under charity number SC000278. From pmt6sbc at maths.leeds.ac.uk Mon Dec 10 18:45:49 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 10 Dec 2012 23:45:49 GMT Subject: [TYPES/announce] CiE 2013 in Milan - Awards and 2nd Call for Papers Message-ID: <201212102345.qBANjnwV029711@maths.leeds.ac.uk> ************************************************************************ CiE13 CALL FOR PAPERS AND SPECIAL AWARDS: CiE 2013: The Nature of Computation: Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, biology, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. AWARDS: Springer-Verlag has graciously funded two awards that will be given during the CiE 2013 Conference. Best student paper: This prize will be awarded for the best student paper presented at CiE 2013, as judged by the Program Committee. A prize of 500 euros will be given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). In order to be considered, a paper has to be submitted in the category 'Regular paper (eligible for best student paper award)' on EasyChair. Papers are eligible if all of its authors are full-time students at the time of submission. Best paper on Natural Computing: The prize consists of the four volumes of the Handbook of Natural Computing (see http://cie2013.disco.unimib.it/awards/). This prize will be awarded to the best paper on Natural Computing presented at CiE 2013, as judged by the Program Committee. A paper is eligible if its main topic falls within the scope of Natural Computing, roughly defined as the set of fields studied in the above handbook. The Program Committee is the only judge of the relevance of a paper within the Natural Computing scope. The authors of a paper eligible for the award must indicate this in the submission notes. INVITED SPEAKERS Ulle Endriss (University of Amsterdam) Lance Fortnow (Georgia Institute of Technology) Anna Karlin (University of Washington) Bernard Moret (Ecole Polytechnique Federale de Lausanne) Mariya Soskova (Sofia University) Endre Szemeredi (Hungarian Academy of Sciences, Rutgers University) TUTORIAL SPEAKERS Gilles Brassard (Universite de Montreal) Grzegorz Rozenberg (Leiden Institute of Advanced Computer Science and University of Colorado at Boulder) SPECIAL SESSIONS on Algorithmic Randomness organizers: Mathieu Hoyrup, Andre Nies Data Streams and Compression organizers: Paolo Ferragina, Andrew McGregor Computational Complexity in the Continuous World organizers: Akitoshi Kawamura, Robert Rettinger Computational Molecular Biology organizers: Alessandra Carbone, Jens Stoye Computation in Nature organizers: Mark Delay, Natasha Jonoska History of Computation organizers: Gerard Alberts, Liesbeth De Mol PROGRAM COMMITTEE: * Gerard Alberts (Amsterdam) * Luis Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * S Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans) * Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) 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 using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ From sophie.tison at lifl.fr Tue Dec 11 10:19:36 2012 From: sophie.tison at lifl.fr (Sophie Tison) Date: Tue, 11 Dec 2012 16:19:36 +0100 Subject: [TYPES/announce] RTA 2013: Second Call for Papers Message-ID: RTA 2013: SECOND CALL FOR PAPERS 24th International Conference on Rewriting Techniques and Applications June 24 - 26, 2013 Eindhoven, The Netherlands collocated with TLCA 2013 as part of RDP 2013 http://rta2013.few.vu.nl/ ************************************************************************* abstract submission February 1 2013 paper submission February 5 2013 rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 ************************************************************************* The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. *** INVITED SPEAKERS (NEW) *** - Simon Peyton-Jones (Microsoft Research, UK) joint invited speaker for TLCA+RTA 2013 - Jarkko Kari (University of Turku, Finland) invited speaker for RTA 2013 - Mitsu Okada (Keio University, Japan) invited speaker for RTA 2013 *** TOPICS OF INTEREST *** RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. *** PUBLICATION *** The proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: *** SUBMISSION GUIDELINES *** Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: , - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: . The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. *** PROGRAMME COMMITTEE CHAIR *** Femke van Raamsdonk (VU University Amsterdam, The Netherlands) *** PROGRAMME COMMITTEE *** Eduardo Bonelli National University of Quilmes, Argentina Byron Cook Microsoft Research Cambridge, UK Stephanie Delaune ENS Cachan, France Gilles Dowek Inria Paris-Rocquencourt, France Maribel Fernandez King's College London, UK Nao Hirokawa JAIST Ishikawa, Japan Delia Kesner University Paris-Diderot, France Helene Kirchner Inria Paris-Rocquencourt, France Barbara Koenig University Duisburg Essen, Germany Temur Kutsia Johannes Kepler University Linz, Austria Aart Middeldorp University of Innsbruck, Austria Vincent van Oostrom Utrecht University, The Netherlands Femke van Raamsdonk VU University Amsterdam, The Netherlands Kristoffer Rose IBM Research New York, USA Manfred Schmidt-Schauss Goethe University Frankfurt, Germany Peter Selinger Dalhousie University, Canada Paula Severi University of Leicester, UK Aaron Stump The University of Iowa, USA Tarmo Uustalu Institute of Cybernetics Tallinn, Estonia Roel de Vrijer VU University Amsterdam, The Netherlands Johannes Waldmann HTWK Leipzig, Germany Hans Zantema Eindhoven University of Technology, The Netherlands *** CONFERENCE CHAIR *** Hans Zantema (Eindhoven University of Technology, The Netherlands) *** STEERING COMMITTEE *** Mauricio Ayala-Rincon Brasilia University, Brasilia Frederic Blanqui INRIA Tsinghua University Beijing, China Salvador Lucas Technical University of Valencia, Spain Georg Moser (chair) University of Innsbruck, Austria Masahiko Sakai Nagoya University, Japan Sophie Tison University of Lille, France *** FURTHER INFORMATION *** Questions related to submission, reviewing, and programme should be sent to the programme committee chair Femke van Raamsdonk, email femke at few.vu.nl. Pr. Sophie Tison LIFL - University of Lille- CNRS Cit? Scientifique B?timent M3 59655 Villeneuve d'Ascq Cedex www.lifl.fr/~tison sophie.tison at lifl.fr Phone: (33 | 0)3 28 77 85 42 (M3) (33 | 0)3 59 35 87 14 (Haute-Borne) -------------- next part -------------- An HTML attachment was scrubbed... URL: From german at fi.upm.es Wed Dec 12 05:56:14 2012 From: german at fi.upm.es (German Puebla) Date: Wed, 12 Dec 2012 11:56:14 +0100 Subject: [TYPES/announce] BYTECODE'13 Deadline extended (28 December) Message-ID: <86hanrwnch.fsf@fi.upm.es> DEADLINE EXTENDED CALL FOR PAPERS BYTECODE 2013 8th Workshop on Bytecode Semantics, Verification, Analysis and Transformation A Satellite workshop of ETAPS 2013 Rome, Italy 23 March 2013 http://costa.ls.fi.upm.es/bytecode13 NEWS ==== * Science of Computer Programming has agreed to publish a special issue on Bytecode 2013 * The abstract and paper submission deadlines have been extended resp. to December the 23rd and 28th, 2012. 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. No formal proceedings of the workshop will be published, but selected papers might be invited for a special issue of Science of Computer Programming. Important Dates =============== Abstract submission (extended): December 23, 2012 Paper submission (extended): December 28, 2012 Notification: January 21, 2013 Final version: February 8, 2013 Submission information ====================== We solicit extended abstracts and position papers of at most 8 pages, describing work related to semantics, verification, analysis and transformation. In particular, we explicitly welcome tool demonstrations. Submissions may overlap with submissions to other conferences or journals. There will be a light-weight reviewing process, where submissions will be judged on their interest to the workshop audience. There will be no formal proceedings of the workshop. All accepted submissions will be distributed among the workshop participants. After the workshop, presenters of extended abstracts, position papers, tool demos and of invited presentations may be invited to contribute to a special issue of Science of Computer Programming. Invitations will be based on submissions and presentations. Papers can be submitted (as PDF) through easy chair https://www.easychair.org/conferences/?conf=bytecode2013 Organisers ========== Miguel Gomez-Zamalloa, Complutense University of Madrid, Spain German Puebla, Technical University of Madrid, Spain All questions about the workshop can be addressed to them via mail: mzamalloa at fdi.ucm.es german at fi.upm.es Program Committee ================== Richard Bubel, Technische Universitat Darmstadt Andrew Craik, Oracle Labs, Brisbane, Australia J?rgen Giesl, RWTH Aachen Laurent Hubert, Prove&Run Marieke Huisman, University of Twente Francesco Logozzo, Microsoft Research Mark Marron, IMDEA Software Institute Corina Pasareanu, CMU/NASA Ames Research Center Ricardo Pe?a, Complutense University of Madrid David Pichardie, INRIA Rennes - Bretagne Atlantique Fausto Spoto, Dipartimento di Informatica, Verona From scm-ml at iis.sinica.edu.tw Wed Dec 12 22:12:46 2012 From: scm-ml at iis.sinica.edu.tw (scm-ml at iis.sinica.edu.tw) Date: Thu, 13 Dec 2012 11:12:46 +0800 Subject: [TYPES/announce] PEPM 2013: 2nd Call for Participation Message-ID: <20121213111246.5150482qswk0l0vi@webmail.iis.sinica.edu.tw> === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 21-22, 2013 Rome, Italy (Affiliated with POPL 2013) 2nd CALL FOR PARTICIPATION IMPORTANT DATES * Hotel reservation deadline: December 15, 2012 * Early registration deadline: December 31, 2012 VENUE PEPM'13 and all POPL'13 affiliated events will take place at the Parco dei Principi Hotel in Rome, Italy SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. INVITED TALKS: * Zhenjiang Hu (National Institute of Informatics, Japan): Practical Aspects of Bidirectional Graph Transformations * Peter Thiemann (Institut fur Informatik, Technische Fakultat, Universitat Freiburg, Germany): Partially Static Operations PROGRAM CHAIRS: Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PROGRAM COMMITTEE: * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia and IMDEA Software Institute, Spain)) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Beira Interior, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (Inria, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy G. Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden, and Rice University, USA) * Tarmo Uustalu (Institute of Cybernetics, Tallinn, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (Inria, France) PRELIMINARY PROGRAM Monday, January 21, 2013 Program Chairs' Report and Best Paper Award Announcement: 8:45 - 9:00 Invited Talk: 9:00 - 10:00 Session Chair: Shin-Cheng Mu * Zhenjiang Hu: Practical Aspects of Bidirectional Graph Transformations Coffee break 10:30 - 12:30 Session Chair: Samir Genaim * Jeroen Weijers, Jurriaan Hage and Stefan Holdermans: Security Type Error Diagnosis for Higher-Order, Polymorphic Languages * Axel Simon: Deriving a Complete Type Inference for Hindley-Milner and Vector Sizes using Expansion * Francisco Javier López-Fraguas and Enrique Martin-Martin: Typing as Functional-Logic Evaluation * Kostis Sagonas, Josep Silva and Salvador Tamarit: Precise Explanation of Success Typing Errors 14:30 - 16:00 Session Chair: Jeremy Siek * Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti: Verifying Programs via Iterated Specialization * Ryosuke Sato, Hiroshi Unno and Naoki Kobayashi: Towards a Scalable Software Model Checker for Higher-Order Programs * Michael Carbin, Deokhwan Kim, Sasa Misailovic and Martin Rinard: Verified Integrity Properties for Safe Approximate Program Transformations Coffee break 16:30 - 17:30 Session Chair: Bruno Oliveira * Marco Comini and Luca Torella: TRSynth: a Tool for Automatic Inference of Term Equivalence in Left-linear Term Rewriting Systems * Martin Sulzmann, Jürgen Nicklisch and Axel Zechner: Traceability and Correctness of EDSL Abstractions Tuesday, January 22, 2013 Invited Talk: 9:00 - 10:00 Session Chair: Elvira Albert * Peter Thiemann: Partially Static Operations Coffee break 10:30 - 12:30 Session Chair: Kazutaka Matsuda * Bruno Martinez, Marcos Viera and Alberto Pardo: Just Do It While Compiling!: Fast Extensible Records in Haskell * Bruno Oliveira and Andres Loh: Abstract Syntax Graphs for Domain Specific Languages * Dominique Devriese, Ilya Sergey, Dave Clarke and Frank Piessens: Fixing Idioms - A Recursion Primitive for Applicative DSLs * Álvaro García-Pérez and Pablo Nogueira: A Syntactic and Functional Correspondence between Reduction Semantics and Reduction-Free Full Normalisers 14:30 - 16:00 Session Chair: Roberto Giacobazzi * Marco Servetto and Elena Zucca: A Meta-Circular Language for Active Libraries * María Alpuente, Marco A. Feliú and Alicia Villanueva: Automatic Inference of Specifications using Matching Logic * Qiang Sun, Yuting Chen and Jianjun Zhao: Constraint-Based Locality Analysis for X10 Programs Coffee break 16:30 - 17:00 Session Chair: Jurriaan Hage * Baris Aktemur, Yukiyoshi Kameyama, Oleg Kiselyov and Chung‐ chieh Shan: Shonan Challenge for Generative Programming ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From pangjun at gmail.com Fri Dec 14 03:27:56 2012 From: pangjun at gmail.com (Jun PANG) Date: Fri, 14 Dec 2012 09:27:56 +0100 Subject: [TYPES/announce] ESSS workshop 2013 (co-located with ICST 2013) -- 2nd Call for Papers Message-ID: ================================================== 2nd International Workshop on Engineering Safety and Security Systems March 18, 2013, Luxembourg Co-located with ICST 2013 in Luxembourg, March 18-22, 2013 More information: http://www.comp.nus.edu.sg/~pat/esss2013/ =================================================== Important dates ----------------- * December 21st 2012: Submission deadline * January 28th 2013: Notification of acceptance/rejection * March 18th 2013: Workshop Introduction of the Workshop ----------------- The International Workshop on Engineering Safety and Security Systems (ESSS) aims at contributing to the challenge of constructing reliable and secure systems. The workshop covers areas such as formal specification, (extended) type checking, model checking, program analysis/transformation, model-based testing and model-driven software construction. The workshop will bring together researchers and industry R&D expertise together to exchange their knowledge, discuss their research findings, and explore potential collaborations. Theme of the Workshop ----------------- The main theme of the workshop is methods and techniques for constructing large reliable and secure systems. The goal of the workshop is to establish a platform for the exchange of ideas, discussion, cross-fertilization, inspiration, co-operation, and dissemination. The topics of the workshop include, but are not limited to: -- methods, techniques and tools for system safety and security -- methods, techniques and tools for analysis, certification, and debugging of complex safety and security systems -- model-based and verification-based testing -- emerging application domains such as cloud computing and cyber-physical systems -- case studies and experience reports on the use of formal methods for analyzing safety and security systems Submissions guidelines ----------------- Paper submissions must be original, unpublished work. Submissions should be in made via the Easychair site: https://www.easychair.org/conferences/?conf=esss2013. Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html ). Papers should not exceed 6 pages for full papers and 2 pages for short papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All workshop papers will be published in the IEEE Digital Library in the form of a post-proceedings. A pre-workshop version of the papers will be available on the workshop website prior. Publication of accepted articles requires the commitment of one of the authors to register for the workshop and present the paper. General chair ----------------- Sjouke Mauw, University of Luxembourg, Luxembourg Program chairs ----------------- Yang Liu, Nanyang Technological University, Singapore Jun Pang, University of Luxembourg, Luxembourg Program committee ----------------- Etienne Andre, Universite Paris 13, France Cyrille Artho, AIST, Japan Marieke Huisma, University of Twente, The Netherlands Weiqiang Kong, Kyushu University, Japan Keqin Li, SAP Research, France Yang Liu, Nanyang Technological University, Singapore Zhiming Liu, UNU/IIST Macao, China Sjouke Mauw, University of Luxembourg, Luxembourg Jun Pang, University of Luxembourg, Luxembourg Geguang Pu, East China Normal University, China Mohammad Torabi Dashti, ETH Zurich, Switzerland Anton Wijs, Eindhoven University of Technology Yoriyuki Yamagata, AIST, Japan -------------- next part -------------- An HTML attachment was scrubbed... URL: From rensink at cs.utwente.nl Fri Dec 14 04:48:56 2012 From: rensink at cs.utwente.nl (Arend Rensink) Date: Fri, 14 Dec 2012 10:48:56 +0100 Subject: [TYPES/announce] Reminder: EAPLS PhD Award 2012 - Call for Nominations (deadline 31-12-2012) Message-ID: <50CAF608.1060709@cs.utwente.nl> EAPLS PhD Award 2012: Call for Nominations ========================================== URL: http://eapls.org/pages/phd_award/ The European Association for Programming Languages and Systems has established a Best Dissertation Award in the international research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. Eligibility ----------- Eligible for the award are those who successfully defended their PhD * at an academic institution in Europe * in the field of Programming Languages and Systems * in the period from 1 November 2011 ? 1 November 2012 Nominations ----------- Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the thesis to http://www.easychair.org/conferences/?conf=eaplsphd2012. The nomination must be accompanied by (a zip file containing) * a letter from the supervisor describing why the thesis should be considered for the award; * a report from an independent researcher who has acted as examiner of the thesis at its defense. The theses will be evaluated with respect to originality, influence, relevance to the field and (to a lesser degree) quality of writing. Procedure --------- The nominations will be evaluated and compared by an international committee of experts from across Europe. The procedure to be followed is analogous to the review phase of a conference. The justification by the supervisor and the external report will play an important role in the evaluation. Members of the expert committee are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner to have received the EAPLS PhD award 2012. The supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, as for instance the ETAPS conference. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding, and will not be subject to discussion. Important dates --------------- 31 December 2012: Deadline for nominations 21 March 2013: Announcement of the award winner Expert committee ---------------- The Expert committee consists of the following members: * Mark van den Brand, Universiteit Eindhoven, The Netherlands * Giorgio Ghelli, University of Pisa, Italy * Paul Klint, CWI and University of Amsterdam, The Netherlands * Jens Knoop, Technische Universit?t Wien, Austria * Greg Michaelson, Heriot-Watt University , Edinburgh, U.K. * Arend Rensink, Universiteit Twente, The Netherlands * Peter Van Roy, Universit? Catholique de Louvain, Belgium Further members will be confirmed shortly. From bmuller at glam.ac.uk Fri Dec 14 08:36:27 2012 From: bmuller at glam.ac.uk (Muller B (AT)) Date: Fri, 14 Dec 2012 13:36:27 +0000 Subject: [TYPES/announce] 2nd CfP Logics, Agents, and Mobility (LAM'13) Message-ID: <2BC68F0E-64C7-483F-8CEF-64CACDDA9481@glam.ac.uk> *** 2nd CALL FOR PAPERS *** 6th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM?13), 2?5 April 2013, University of Exeter, United Kingdom organised as symposium at the AISB Annual Convention 2013 (http://emps.exeter.ac.uk/computer-science/research/aisb/) Organisers: Berndt ?Bertie? M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://lam2013.wordpress.com * Workshop Purpose * The aim of this series of workshops is to bring together active researchers in the areas of logics and other formal frameworks on the one hand, and mobile systems on the other hand. The main focus is on the field of applications of logics and calculi for mobile agents, smart intelligent solutions and multi-agent systems. Many notions used in the theory of agents are derived from philosophy, logic, and linguistics (belief, desire, intention, speech act, etc.), and interdisciplinary discourse has proved fruitful for the advance of this domain. Outside of academia, the deployment of large-scale pervasive infrastructures (mobile ad-hoc networks, mobile devices, RFIDs, etc.) is becoming a reality. This raises a number of scientific and technological challenges for the software modelling and programming models for such large-scale, open and highly-dynamic distributed systems. The agent and multi-agent systems approach seems particularly adapted to tackle this challenge, but there are many issues remaining to be investigated. For instance, the agents must be location-aware since the actual services available to them may depend on their (physical or virtual) location. The quality and quantity of resources at their disposal is also largely fluctuant, and the agents must be able to adapt to such highly dynamic environments. Moreover, mobility itself raises a large number of difficult issues related to safety and security, which require the ability to reason about the software (e.g. for analysis or verification). Logics and type systems with temporal or other kinds of modalities (relating to location, resource and/or security-awareness) play a central role in the semantic characterisation and then verification of properties about mobile agent systems. There are still many open problems and research questions in the theory of such systems. The workshop is intended to showcase results and current work being undertaken in these areas with a focus on logics for specification and verification of dynamic, mobile systems. The topics of interest lie in the area of logics and concurrent systems with a focus on the special application domain of mobile systems and (multi-)agent-based systems, such as: * Applications of logics and/or multi-agent systems * Smart/intelligent solutions * Models of concurrency * Models of resource-bounded systems * Models of location-based reasoning * Logics for concurrency with a perspective on mobility * Models of mobile systems * Verification and analysis techniques * Related programming models Scopes of Interest * applications of MAS * logics for specification and reasoning about agents, MAS, and mobile systems * treatment of location and resources in logics * security (e.g., in ad-hoc networks) * temporal logics and model checking * type systems and static analysis * logic programming * concurrency theory with a focus on mobility or dynamics in agent systems. * Previous Workshops * LAM?08: 4?8 August 2008 at ESSLI in Hamburg, Germany LAM?09: 10 August 2009 at LICS in Los Angeles, USA LAM?10: 15 July 2010 at LICS in Edinburgh, Scotland, UK LAM?11: 10 September 2011 at CONCUR in Aachen, Germany LAM?12: 25 June 2012 at Petri Nets 2012, Hamburg, Germany * Format of the Workshop * The workshop will be held as a one day of the convention. There will be a short introduction and brief survey of the field by the organisers as an introduction to the workshop. The workshop will contain invited talks, contributed talks, and will offer opportunities for discussion. The latter will give the participants a chance to discuss informally research directions, open problems, and possible co-operations. * Invited Speakers * [To be announced.] * Submission details * Authors are invited to submit a full paper of original work in the areas mentioned above. The workshop chair should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper will be expected to present it at the LAM?13 workshop. 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=lam13 The submissions will be reviewed by the workshop?s program committee and additional reviewers. Accepted papers will appear in electronic proceedings and authors will be encouraged to re-submit papers to formal proceedings to be published as a separate publication, e.g. as a special journal issue. * Important Dates * Submission Deadline: 14th January 2013 Notification of acceptance/rejection: 11 February 2013 Final version of papers due: 4 March 2013 Workshop: at AISB 2013, 2?5 April 2013 (one-day workshop) -------------- next part -------------- An HTML attachment was scrubbed... URL: From tase2013 at aston.ac.uk Fri Dec 14 11:27:20 2012 From: tase2013 at aston.ac.uk (TASE 2013) Date: Fri, 14 Dec 2012 16:27:20 +0000 Subject: [TYPES/announce] FW: 3rd CFP for TASE 13, 1 - 3 July 2013, Birmingham, UK Message-ID: The 7th International Symposium on Theoretical Aspects of Software Engineering - TASE 2013 1st - 3rd July 2013, Aston University Conference Centre, Birmingham, UK 3rd Call for Papers Dear Colleagues, On behalf of the organizing committee, we are pleased to invite you to submit papers to the 7th International Symposium on Theoretical Aspects of Software Engineering (TASE 2013). We apologise for any eventual cross-posting and we cordially encourage you to forward this call for papers to all of your colleagues and students who might be interested. Overview Software engineering is at the heart of many state of the art tools designed to simplify and improve our lives, including cloud computing applications, the semantic web and self-configuring systems. As these instruments are involved in fields of vital importance, by providing customised solutions for education, businesses, government and health care, the role played by the theory behind their working principles bears an undeniable weight. In this context, the TASE International Symposium strives to provide top scientists with a framework for communicating their latest and most valuable theoretical results in the field of software engineering. Subject Areas We invite contributions concerning the theoretical aspects of the following areas (please note that this is not an exhaustive list): * model driven software engineering * component based software engineering * service oriented and cloud computing * semantic web and web services * software security, reliability, simulation and verification * probabilistic fundamentals of software engineering * embedded and real time software systems * program logics and underlying mathematical issues * aspect, rule and object oriented software design * self-configuring software systems * reverse engineering Paper Submission System We invite all prospective authors to submit their manuscripts via the TASE13 portal, hosted on Easychair at: https://www.easychair.org/conferences/?conf=tase2013 Further instructions for authors (e.g. paper format and length) will be communicated at a later date. Important Dates Title and abstract submission: 18 January 2013 Paper submission: 25 January 2013 Acceptance/rejection notification: 22 March 2013 Camera-ready version submission: 26 April 2013 Contact tase2013 at aston.ac.uk www.aston.ac.uk/tase2013 Alternative Formats A PDF version of this CFP is available on the symposium website or by following this link: http://www1.aston.ac.uk/EasySiteWeb/GatewayLink.aspx?alId=128755 We are looking forward to receiving your submissions. Hai Wang Richard Banach Program Chairs, TASE 2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: From HANAC at il.ibm.com Fri Dec 14 15:27:13 2012 From: HANAC at il.ibm.com (Hana Chockler) Date: Fri, 14 Dec 2012 22:27:13 +0200 Subject: [TYPES/announce] CAV 2013 CFP - submission deadline extended Message-ID: ====== CALL FOR PAPERS ===== 25th International Conference on Computer Aided Verification (CAV 2013) July 13-19, 2013 St. Petersburg, Russia Season?s Greetings! Following multiple requests, we moved the deadline to family friendly January 15. Abstract submission is January 10. Program Chairs: Natasha Sharygina and Helmut Veith Website: http://cav2013.forsyte.at/ Aims and Scope ------------------- The conference on Computer Aided Verification (CAV), 2013, is the 25th 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 - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Verification methods for parallel and concurrent hardware/software systems - Testing and runtime analysis based on verification technology - Applications and case studies in verification - Decision procedures and solvers for verification - Mathematical and logical foundations of practical verification tools - Verification in industrial practice - Algorithms and tools for system synthesis - Hybrid systems and embedded systems verification - Verification techniques for security - Formal models and methods for biological systems Following the example of 2012, CAV will again have *special tracks* in four areas: 1. Hardware Verification (track chair: Armin Biere) 2. Computer Security (track chair: Somesh Jha) 3. SAT and SMT (track chair: Nikolaj Bjoerner) 4. Biology (track chair: Jasmin Fisher) 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. In addition, CAV 2013 will also have a track chair for tool papers: 5. Tool Papers (track chair: Roderick Bloem) Events --------- The conference will include the following events: * Pre-conference workshops on July 13-14. * The main conference will take place July 15th-19th: * Invited tutorials on July 15th. * Technical sessions on July 16-19. 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. 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. B. Tool Presentations: Submissions, not exceeding six (6) pages using Springer's LNCS format, should describe the implemented tool, its novel features, and possibly an experimental evaluation. 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. We strongly encourage authors to make their tools and benchmarks available with their submission. Papers exceeding the stated maximum length run the risk of rejection without review. 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 should not contain information necessary to the understanding and the evaluation of the presented work. Note that the page limit for submissions has been increased to 16 pages including references. 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://cav2013.forsyte.at Important Dates - Abstract submission: January 10, 2013 (extended) - Paper submission (firm): January 15, 2013 anywhere on earth (extended) - Author feedback/rebuttal period: February 20-22, 2013 - Notification of acceptance/rejection: March 6, 2013 - Final version due: April 6, 2013 Program Chairs ------------------ Natasha Sharygina, University of Lugano, Switzerland Helmut Veith, Vienna University of Technology, Austria Program Committee --------------------- Rajeev Alur (Univ. Pennsylvania) Domagoj Babic (UC Berkeley) Armin Biere (JKU Linz) Nikolaj Bjorner (Microsoft Research) Roderick Bloem (TU Graz) Ahmed Bouajjani (LIAFA, Univ. of Paris 7) Aaron Bradley (CU Boulder) Hana Chockler (IBM) Byron Cook (Microsoft Research, Univ. College London) Vincent Danos (The University of Edinburgh) Anupam Datta (Carnegie Mellon Univ.) Javier Esparza (TU Munich) Azadeh Farzan (Univ. of Toronto) Bernd Finkbeiner (Saarland Univ.) Jasmin Fisher (Microsoft Research) Radu Grosu (TU Vienna) Ari Gurfinkel (Carnegie Mellon Univ.) William Hung (Synopsys Inc) Susmit Jha (Intel) Somesh Jha (Univ. of Wisconsin) Barbara Jobstmann (CNRS, Verimag, Jasper DA) Bengt Jonsson (Uppsala Univ.) Rajeev Joshi (NASA JPL) Joost-Pieter Katoen (RWTH Aachen) Robert P. Kurshan (Cadence Design Systems) Benjamin Livshits (Microsoft Research) Rupak Majumdar (Max Planck Institute) Ken Mcmillan (Microsoft Research) Kedar Namjoshi (Bell Labs) Joel Ouaknine (Oxford Univ.) Madhusudan Parthasarathy (Univ. of Illinois at Urbana-Champaign) Corina Pasareanu (Carnegie Mellon Univ., NASA Ames) Andreas Podelski (Univ. of Freiburg) Natasha Sharygina (Univ. of Lugano) Nishant Sinha (IBM) Anna Slobodova (Centaur Technology) Murali Talupur (Intel) Stavros Tripakis (UC Berkeley) Helmut Veith (TU Vienna) Mahesh Viswanathan (Univ. of Illinois at Urbana-Champaign) Thomas Wahl (Northeastern Univ.) Georg Weissenbacher (TU Vienna) Eran Yahav (Technion) 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 2013 CAV Award Committee consists of Rajeev Alur (Chair) Marta Kwiatkowska Aarti Gupta Ahmed Bouajjani The nominations should be sent to Rajeev Alur at alur at seas.upenn.edu. Nominations must be received by January 15, 2013. From murano at na.infn.it Sun Dec 16 12:35:57 2012 From: murano at na.infn.it (Nello Murano) Date: Sun, 16 Dec 2012 18:35:57 +0100 (CET) Subject: [TYPES/announce] SR 2013 - Extended Deadline and Last Call for Contributions Message-ID: <64942.192.133.28.4.1355679357.squirrel@imap-lp.na.infn.it> [We apologize for multiple copies of this message] Due to numerous requests, the submission deadline for SR 2013 contributions has been extended. Please consider to contribute to and/or forward to the appropriate groups the following call for submission of expository and novel contributions to SR 2013. ***************************************************************** ------ SR 2013 ----- ***************************************************************** First International Workshop on Strategic Reasoning Rome, Italy, March 16th-17th, 2013 http://www.strategicreasoning.net/ ****************************************************** | CALL FOR CONTRIBUTIONS (EXTENDED DEADLINE) | ****************************************************** OBJECTIVES Strategic reasoning is one of the most active research area in multi-agent system domain. The literature in this field is extensive and provides a plethora of logics for modeling strategic ability. Theoretical results are now being used in many exciting domains, including software tools for information system security, robot teams with sophisticated adaptive strategies, and automatic players capable of beating expert human adversary, just to cite a few. All these examples share the challenge of developing novel theories and tools for agent strategies that take into account the likely behavior of adversaries. The SR international workshop aims to bring together researchers working on different aspects of strategic reasoning in computer science, both from a theoretical and a practical point of view. LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: - Logics for reasoning about strategic abilities - Logics for multi-agent mechanism design, verification, and synthesis - Logical foundations of decision theory for multi-agent systems - Strategic reasoning in formal verification - Automata theory for strategy synthesis - Strategic reasoning under perfect and imperfect information - Applications and tools for cooperative and adversarial reasoning - Robust planning and optimization in multi-agent systems - Risk and uncertainty in multi-agent systems - Quantitative aspects in strategic reasonings CO-LOCATED EVENT SR 2013 is an ETAPS 2013 workshop. ETAPS 2013 will be held on March 16th-24th, 2013. INVITED SPEAKERS - Krishnendu Chatterjee (IST Austria) - Alessio R. Lomuscio (Imperial College London) - Jean-Francois Raskin (Universit? Libre de Bruxelles) - Michael Wooldridge (University of Oxford) PAPER SUBMISSION Submitted papers should not exceed five pages using EPTCS format (http://style.eptcs.org). If necessary, the paper may be supplemented with a clearly marked appendix, which will be consulted at the discretion of the programme committee. Submissions must be in PDF format and will be handled via EasyChair ( https://www.easychair.org/conferences/?conf=sr2013 ). Two types of submission are invited: - Papers reporting on novel research, and - Expository papers reporting on published work. Each submission should be clearly identified as belonging to one category or the other. In both categories, strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and all papers should be written so that they are accessible to such an audience. Novel research abstracts will be held to the usual high standards of novel research publications. In particular, they should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the significance of the work its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Expository abstracts, which will be held to similarly high standards, may survey an area or report on a more specific previously published work; the submission should make clear the relevance to the strategic reasoning audience. Papers accepted for presentation (in both categories) will be collected as an EPTCS volume. Submissions from PC members are also allowed. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. IMPORTANT DATES (UPDATED) Abstract submission: December 21, 2012 AoE (strict) Paper submission: December 27, 2012 AoE (strict) Acceptance notification: January 23, 2013 Final version: February 4, 2013 Workshop: March 16-17, 2013 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 workshop papers is also under consideration. PROGRAM CO-CHAIRS Fabio Mogavero, Universit? di Napoli Federico II, Italy Aniello Murano, Universit? di Napoli Federico II, Italy Moshe Y. Vardi, Rice University, Texas, USA PROGRAM COMMITTEE - Thomas Agotnes, University of Bergen, Norway - Dietmar Berwanger, RWTH Aachen, Germany - Valenting Goranko, Technical University of Denmark, Denmark - Joseph Y. Halpern, Cornell University, New York, USA - Wojtek Jamroga, University of Luxembourg, Luxembourg - Orna Kupferman, Hebrew University, Israel - Nicolas Markey, CNRS de Cachan, France - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Ramaswamy Ramanujam, Institute of Mathematical Sciences, India - Wolfgang Thomas, RWTH Aachen, Germany - Moshe Y. Vardi, Rice University, Texas, USA ORGANIZING COMMITTEE - Fabio Mogavero, Universit? di Napoli Federico II, Italy - Aniello Murano, Universit? di Napoli Federico II, Italy - Giuseppe Perelli, Universit? di Napoli Federico II, Italy - Loredana Sorrentino, Universit? di Napoli Federico II, Italy INFO Please visit the conference website (http://www.strategicreasoning.net/) for more information. From Simon.Gay at glasgow.ac.uk Mon Dec 17 04:41:07 2012 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 17 Dec 2012 09:41:07 +0000 Subject: [TYPES/announce] PLACES 2013 Deadline Extension and Final CFP Message-ID: <50CEE8B3.5000300@glasgow.ac.uk> [ The themes of PLACES include types, concurrency and mobility. SG ] FINAL CALL FOR PAPERS PLACES'13 Programming Language Approaches to Concurrency and Communication-cEntric Software 23rd March 2013, Rome, Italy (affiliated with ETAPS 2013) http://places13.di.fc.ul.pt/ ** Important Dates ** Note deadline extension! Abstract (title & abstract): 21st December 2012 Paper Submission (up to 5 pages): 28th December 2012 Paper Notification: 23rd January 2012 Final versions of papers: 4th February 2012 ** Background ** Applications today are built using numerous interacting services; soon off-the-shelf CPUs will host thousands of cores, and sensor networks will be composed from a large number of processing units. Many applications need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems is inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. ** Topics of Interest ** Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: * language design and implementations for communications and/or concurrency, * session types, * concurrent data types, * concurrent objects and actors, * multicore programming, * use of message passing in systems software, * interface languages for communication and distribution, * program analysis, * web services, * novel programming methodologies for sensor networks, * integration of sequential and concurrent programming, * high-level programming abstractions for security concerns in concurrent, distributed programming, * runtime architectures for concurrency, * scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Submission Guidelines ** Authors should submit a title and an abstract by Wednesday 14th December 2012. Papers of up to*five pages* in length should be submitted in PDF format by Wednesday 21st December 2012 using the EasyChair proceedings template available at: http://www.easychair.org/easychair.zip Abstracts and papers should be submitted using EasyChair: http://www.easychair.org/conferences/?conf=places2013 Preliminary proceedings will be available at the workshop. The post proceeding will be published as an EPTCS volume. Note that, as we accept short papers, extended versions of the accepted works could be also submitted elsewhere. Enquiries can be sent to the PC co-chairs. ** Program Committee ** Alastair Beresford, University of Cambridge, UK Viviana Bono, Universita di Torino, Italy Alastair Donaldson, Imperial College London, UK Dan Ghica, University of Birmingham, UK Joshua Guttman, Worcester Polytechnic Institute, MA, US Thomas Hildebrandt, University of Copenhagen, Denmark Paul Keir, Codeplay Ltd, UK Hans-Wolfgang Loidl, Heriot-Watt University, UK Conor McBride, University of Strathclyde, UK Jeremy Singer, University of Glasgow, UK Sven-Bodo Scholz, Heriot-Watt University, UK Nikhil Swamy, Microsoft Research, US Wim Vanderbauwhede (co-chair), University of Glasgow, UK Hugo Torres Vieira, Universidade de Lisboa, Portugal Nobuko Yoshida (co-chair), Imperial College London, UK ** Organizing Committee ** Alastair Beresford, University of Cambridge, UK Simon Gay, University of Glasgow, UK Alan Mycroft, University of Cambridge, UK Vasco Vasconcelos, University of Lisbon, Portugal Nobuko Yoshida, Imperial College London, UK _______________________________________________ SPLS mailing list SPLS at mailhost.dcs.gla.ac.uk https://mr1.dcs.gla.ac.uk/mailman/listinfo/spls -------------- next part -------------- An HTML attachment was scrubbed... URL: From ulrik at cs.aau.dk Mon Dec 17 08:04:37 2012 From: ulrik at cs.aau.dk (Ulrik Nyman) Date: Mon, 17 Dec 2012 14:04:37 +0100 Subject: [TYPES/announce] CfP: Advances in Systems of Systems an ETAPS workshop Message-ID: <50CF1865.7030906@cs.aau.dk> AiSoS - Advances in Systems of Systems http://aisos.cs.aau.dk We are delighted to present a new *ETAPS* workshop with a focus on the growing trend of more complex systems of systems. Examples are*smart grid, intelligent buildings, smart cities, transport systems*, etc. There is a need for new modeling formalisms, analysis methods and tools to help make trade-off decisions during design and evolution avoiding leading to sub-optimal design and rework during integration and in service. The workshop should focus on the modeling and analysis of System of Systems. The workshop Advances in Systems of Systems aims to gather people from different communities in order to encourage exchange of methods and views. The workshop welcomes submissions on *new modeling approaches, analysis technique, tools,** **case studies, surveys and tutorials.* Post proceedings will be published in EPTCS. Submission deadline:*January 4*. Best regards AiSoS organizers. - Kim G. Larsen, Axel Legay and Ulrik Nyman -- Ulrik Nyman,http://people.cs.aau.dk/~ulrik, phone +45 9940 9985 Associate Professor, Ph.D. Center for Embedded Software Systems, Department of Computer Science Aalborg University, Selma Lagerl?fs Vej 300, DK-9220 Aalborg East -------------- next part -------------- An HTML attachment was scrubbed... URL: From viktor at mpi-sws.org Mon Dec 17 10:47:50 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Mon, 17 Dec 2012 16:47:50 +0100 Subject: [TYPES/announce] Short student talks @ POPL 2013 (Deadline: 21 December!!!) Message-ID: <2E88B123-81BD-4718-85A2-7DC3259CBA92@mpi-sws.org> =================================================================================== POPL 2013: 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Rome, Italy January 23-25, 2013 http://popl.mpi-sws.org/2013/ =================================================================================== ** Student Short Talk Session at POPL'13 ** Following prior years, POPL'13 will have two sessions devoted entirely to short student talks, with a best talk award determined by popular vote. All students attending POPL are strongly encouraged to participate, and our goal is to allow as many students as possible to present themselves and their work to the community. Suitable topics for short talks are descriptions of work in progress, thesis projects, honours projects and relevant research being or to be published elsewhere. The best talk will be determined by popular vote and announced at the end of POPL. Short presentations should fit in 10 minute slots and we will have a few minutes after each slot for questions. Submission instructions are found here: http://wrigstad.com/popl13/ Important Dates: * Talk proposal submission deadline: 2012-12-21 (23:59 GMT) * Notification of acceptance: 2012-12-31 * Student session: 2013-01-23 and 2013-01-25 Questions may be directed to Tobias Wrigstad (tobias.wrigstad at it.uu.se). Acceptance Criteria We strive to give as many students as possible a chance to present short talks at POPL'13. If we cannot accept all interested participants due to space or time constraints, we will primarily use seniority criteria rather than quality judgments to make decision about participation, and favour students not already presenting at POPL'13 or a co-located event over those who are. From jfoster at cs.umd.edu Mon Dec 17 13:24:55 2012 From: jfoster at cs.umd.edu (Jeff Foster) Date: Mon, 17 Dec 2012 13:24:55 -0500 Subject: [TYPES/announce] Postdoc in PL/SE and security at the University of Maryland, College Park In-Reply-To: References: <3576EE2B-F83F-401A-8A44-D2F5DB8BA2F3@cs.umd.edu> <50BDBF82-3514-47C4-B1EA-6E4560BDCB97@cs.umd.edu> Message-ID: <6ADF2426-FF26-4F11-B59D-27B3B947EFBA@cs.umd.edu> The programming languages group in the Department of Computer Science and UMIACS at the University of Maryland, College Park is offering a post doctoral position. We are looking for a researcher interested in applying programming languages techniques (of all kinds, from systems to theory) to reasoning about security, privacy, and malware on mobile systems, particularly Android. We are interested in behavior of the systems themselves as well as their interactions with the cloud. Prior background with Android 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. ? Applications will be accepted until the position is filled. ? Start date: January 2013 or later ? Duration: 1-3 years, depending on funding availability Interested candidates should send their CV to jfoster at cs.umd.edu and mwh 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 brucker at spamfence.net Tue Dec 18 07:35:51 2012 From: brucker at spamfence.net (Achim D. Brucker) Date: Tue, 18 Dec 2012 13:35:51 +0100 Subject: [TYPES/announce] TAP 2013: 2nd Call for Papers Message-ID: <20121218123551.GA7891@shinanogawa.brucker.ch> (Apologies if you receive this announcement multiple times.) **************************************************** *** *** *** TAP 2013 *** *** *** *** Abstract submission: January 25, 2013 *** *** Paper submission: February 1, 2013 *** **************************************************** *** TAP 2013 solicits both full papers and *** *** (industrial) experience/tool papers *** *** in combining proofs and (security) testing *** **************************************************** CALL FOR PAPERS 7th INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) http://www.spacios.eu/TAP2013 Budapest, Hungary, June 18-19, 2013 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security Important Dates: ================ Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 Program Chairs: =============== Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) Program Committee: ================== Paul Ammann Dirk Beyer Achim D. Brucker Robert Claris? Marco Comini Catherine Dubois Gordon Fraser Angelo Gargantini Christoph Gladisch Martin Gogolla Arnaud Gotlieb Wolfgang Grieskamp Reiner H?hnle Bart Jacobs Thi?rry Jeron Jacques Julliand Gregory Kapfhammer Nikolai Kosmatov Victor Kuliamin Michael Leuschel Karl Meinke Alexandre Petrenko Holger Schlingloff T.H. Tse Margus Veanes (co-chair) Luca Vigan? (co-chair) Burkhart Wolff Fatiha Zaidi Submission: =========== Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Subject to final approval by Springer, accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP AG, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/ From gc at pps.univ-paris-diderot.fr Tue Dec 18 14:33:58 2012 From: gc at pps.univ-paris-diderot.fr (Giuseppe Castagna) Date: Tue, 18 Dec 2012 20:33:58 +0100 Subject: [TYPES/announce] ECOOP '13: DEADLINE Extended of four days Message-ID: <50D0C526.3070207@pps.univ-paris-diderot.fr> ECOOP deadline has been extended of four days. The new deadline is 22 Dec 2012, 23:59 American Samoa time (23 Dec, 11:59 Paris time). ---------------------------- *** IMPORTANT DATES *** - Submission: 22 Dec 2012, 23:59 American Samoa time (19 Dec, 11:59 Paris time) - Rebuttal: 09 February 2013 - Acceptance: 08 March 2013 - To submit: http://cyberchairpro.borbala.net/ecooppapers/submit/ - Conference: 1-5 July 2013, Montpellier, France - Info: http://www.lirmm.fr/ecoop13/ ---------------------------- *** INFORMATION *** The European Conference on Object-Oriented Programming (ECOOP) is the premium international conference covering all areas of object technology and related software development technologies. ECOOP 2013 will take place from the 1st to the 5th of July, 2013 in Montpellier, France. The 2013 edition will be the 27th of the ECOOP conferences series and will embrace a broad range of topics related to object-orientation, including: - Aspects, components, modularity, and reflection - Concurrent and parallel systems - Databases and object persistence - Distributed and cloud computing, mobile systems - Programming environments, virtualization - Versioning, refactoring, software evolution - Language definition and design - Language implementation, execution environments, compiler construction - Testing, profiling, and performance analysis - Metrics and empirical studies - Software modeling, meta-modelling - Memory management, garbage collection - Object ownership - Design methods and design patterns - Real-time systems - Security - Frameworks, product lines, and software architectures - Specification, verification, model checking, program synthesis - Theoretical foundations, program analysis, and type systems - Service-oriented and Web programming Submissions will be carried out electronically via CyberChair. Papers must be written in English, and be no longer than 25 pages, including references, appendices and figures, and written using the LNCS style. For full submission guidelines, please refer to the page: http://info-web.lirmm.fr/ecoop13/index.php/conference-papers ---------------------------- *** Artifact Evaluation *** To reward creation of artifacts and replication of experiments, authors of accepted research papers can have their artifacts (tools, data, models, videos...) evaluated by an Artifact Evaluation Committee. Artifacts that pass muster will be recognized formally, and be fast-tracked for additional presentation. Artifacts that are deemed especially meritorious will be singled out for special recognition in the proceedings and at the conference. For more information about artifact evaluation, please follow this link: http://ecoop13-aec.cs.brown.edu/ From andrzej.murawski at leicester.ac.uk Wed Dec 19 05:38:31 2012 From: andrzej.murawski at leicester.ac.uk (Andrzej Murawski) Date: Wed, 19 Dec 2012 10:38:31 +0000 Subject: [TYPES/announce] LICS 2013 - Last Call for Papers Message-ID: LAST CALL FOR PAPERS Twenty-Eighth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2013) June 25-28, 2013, New Orleans, USA http://lii.rwth-aachen.de/lics/lics13/ LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA, from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13 (23-25 June) and CSF13 (28-30 June). 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, theory of automatic structures, 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: 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. Titles & Short Abstracts Due : January 7, 2013 Extended Abstracts Due : January 14, 2013 Author Notification (approximate) : March 22, 2013 Final Versions Due for Proceedings: April 26, 2013 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://easychair.org/conferences/?conf=lics2013. 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 will be 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. Papers selection will be merit-based, with no a priori limit on the number of accepted papers. 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 will be posted on the LICS website. 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. 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. Program Chair: Orna Kupferman, Hebrew University Program Committee: Parosh A. Abdulla, Uppsala University Amal Ahmed, Northeastern Universtiy Sergei Artemov, City University of New York Andrei Bulatov, Simon Fraser University Yijia Chen, Shanghai Jiao Tong University Veronique Cortier, CNRS, Loria Mariangiola Dezani-Ciancaglini, Univ. di Torino Thomas Ehrhard, CNRS, Universite Paris Diderot Javier Esparza, Technische Universitaet Muenchen Kousha Etessami, University of Edinburgh Maribel Fernandez, King?s College London Santiago Figueira, University of Buenos Aires Simon Gay, University of Glasgow Martin Grohe, Humboldt-Universitaet zu Berlin Martin Hofmann, LMU Munich Petr Jancar, Technical University Ostrava Barbara Jobstmann, CNRS, Verimag and Jasper DA Patricia Johann, University of Strathclyde Bakhadyr Khoussainov, The University of Auckland Antonina Kolokolova, University of Newfoundland Victor Marek, University of Kentucky Angelo Morzenti, Politecnico di Milano Lawrence Moss, Indiana University Madhavan Mukund, Chennai Math. Institute Anca Muscholl, Universite Bordeaux Mogens Nielsen, Aarhus University Catuscia Palamidessi, INRIA, Ecole Polytechnique Luc Segoufin, INRIA, ENS Cachan Natarajan Shankar, SRI International Alexandra Silva, Radboud University Nijmegen Balder ten Cate, UC Santa Cruz Kazushige Terui, Kyoto University Ron van der Meyden, Univ. of New South Wales Jeannette M. Wing, Carnegie Mellon University Nobuko Yoshida, Imperial College London Conference Chair: Mike Mislove, Tulane University Workshop Chair: Patricia Bouyer-Decitre, CNRS, ENS Cachan Publicity Chair: Andrzej Murawski, University of Leicester General Chair: Luke Ong, University of Oxford Organizing Committee: Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame, Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman, Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys, Matt Valeriote Advisory Board: Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller, John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin, Moshe Vardi, Glynn Winskel From andreas.abel at ifi.lmu.de Wed Dec 19 10:59:31 2012 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Wed, 19 Dec 2012 16:59:31 +0100 Subject: [TYPES/announce] PLPV 2013 call for participation Message-ID: <50D1E463.2000502@ifi.lmu.de> You are cordially invited to participate in the Seventh ACM SIGPLAN Workshop on Programming Languages meets Program Verification Date: 22 January 2013 Location: Rome, in conjunction with POPL 2013 Program : http://plpv.tcs.ifi.lmu.de/ Edwin Brady will talk at 10:30am on Idris: General Purpose Programming with Dependent Types Further, we have 7 contributed talks on verification of programming languages, complexity and security, and functional reactive programming. Early registration until 31 December 2012! Best regards, Andreas Abel and Tim Sheard -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich Oettingenstr. 67, D-80538 Munich, GERMANY andreas.abel at ifi.lmu.de http://www2.tcs.ifi.lmu.de/~abel/ From math.semantic.web at gmail.com Wed Dec 19 11:18:37 2012 From: math.semantic.web at gmail.com (Christoph LANGE) Date: Wed, 19 Dec 2012 16:18:37 +0000 Subject: [TYPES/announce] CfP: Conf. Intelligent Computer Mathematics (Bath, UK, 7-12 Jul 2013); Deadline 8 Mar Message-ID: <50D1E8DD.7090509@gmail.com> CICM 2013 - Conference on Intelligent Computer Mathematics July 7-12, 2013 at University of Bath, Bath, UK http://www.cicm-conference.org/2013/cicm.php 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 take place at the University of Bath (U.K.), with James Davenport as the local organiser. It consists of four tracks: Calculemus Chair: Wolfgang Windsteiger Digital Mathematical Libraries (DML) Chair: Petr Sojka Mathematical Knowledge Management (MKM) Chair: David Aspinall Systems and Projects Chair: Christoph Lange As in previous years, there are plans to organise a workshop for presentations by Doctoral students. The overall programme will be organised by the General Program Chair Jacques Carette. ---------------------------------------------------------------- Important dates ---------------------------------------------------------------- Abstract submission: 1 March 2013 Submission deadline: 8 March 2013 Reviews sent to authors: 5 April 2013 Rebuttals due: 8 April 2013 Notification of acceptance: 14 April 2013 Camera ready copies due: 26 April 2013 Conference: 7-12 July 2013 ---------------------------------------------------------------- Tracks ---------------------------------------------------------------- ========== Calculemus ========== Calculemus 2013 invites the submission of original research contributions to be considered for publication and presentation at the conference. Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning like interactive proof assistants (PA) or automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated mathematical assistant systems that will be used routinely by mathematicians, computer scientists and all others who need computer-supported mathematics in their every day business. All topics in the intersection of computer algebra systems and automated reasoning systems are of interest for Calculemus. These include but are not limited to: * Automated theorem proving in computer algebra systems. * Computer algebra in theorem proving systems. * Adding reasoning capabilities to computer algebra systems. * Adding computational capabilities to theorem proving systems. * Theory, design and implementation of interdisciplinary systems for computer mathematics. * Case studies and applications that involve a mix of computation and reasoning. * Case studies in formalization of mathematical theories. * Representation of mathematics in computer algebra systems. * Theory exploration techniques. * Combining methods of symbolic computation and formal deduction. * Input languages, programming languages, types and constraint languages, and modeling languages for mathematical assistant systems. * Homotopy type theory. * Infrastructure for mathematical services. === DML === Mathematicians dream of a digital archive containing all peer-reviewed mathematical literature ever published, properly linked, validated and verified. It is estimated that the entire corpus of mathematical knowledge published over the centuries does not exceed 100,000,000 pages, an amount easily manageable by current information technologies. 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])? === MKM === Mathematical Knowledge Management is an interdisciplinary field of research in the intersection of mathematics, computer science, library science, and scientific publishing. The objective of MKM is to develop new and better ways of managing sophisticated mathematical knowledge, based on innovative technology of computer science, the Internet, and intelligent knowledge processing. MKM is expected to serve mathematicians, scientists, and engineers who produce and use mathematical knowledge; educators and students who teach and learn mathematics; publishers who offer mathematical textbooks and disseminate new mathematical results; and librarians and mathematicians who catalog and organize mathematical knowledge. The conference is concerned with all aspects of mathematical knowledge management. A non-exclusive list of important topics includes: * Representations of mathematical knowledge * Authoring languages and tools * Repositories of formalized mathematics * Deduction systems * Mathematical digital libraries * Diagrammatic representations * Mathematical OCR * Mathematical search and retrieval * Math assistants, tutoring and assessment systems * MathML, OpenMath, and other mathematical content standards * Web presentation of mathematics * Data mining, discovery, theory exploration * Computer algebra systems * Collaboration tools for mathematics * Challenges and solutions for mathematical workflows ==================== Systems and Projects ==================== The Systems and Projects track of the Conferences on Intelligent Computer Mathematics is a forum for presenting available systems and new and ongoing projects in all areas and topics related to the CICM conferences: * Deduction and Computer Algebra (Calculemus) * Digital Mathematical Libraries (DML) * Mathematical Knowledge Management (MKM) * Artificial Intelligence and Symbolic Computation (AISC) The track aims to provide an overview of the latest developments and trends within the CICM community as well as to exchange ideas between developers and introduce systems to an audience of potential users. ---------------------------------------------------------------- Submission Instructions ---------------------------------------------------------------- Submissions to the research tracks must not exceed 15 pages and will be reviewed and evaluated with respect to relevance, clarity, quality, originality, and impact. Shorter papers, e.g., for system descriptions, are welcome. Authors will have an opportunity to respond to their papers' reviews before the programme committee makes a decision. System descriptions and projects descriptions should be 2-4 pages and should present * newly developed systems, * systems that have not previously been presented to the CICM community, or * significant updates to existing systems. Systems must be available for download. Project presentations should describe * projects that are new or about to start, * ongoing projects that have not yet been presented to the CICM community. * significant new developments in ongoing previously presented projects. Presentations of new projects should mention relevant previous work and include a roadmap that outlines concrete steps. All submissions should contain links to demos, downloadable systems, or project websites. Accepted conference submissions from all tracks is intended to be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer. In addition to these formal proceedings, authors are permitted and encouraged to publish the final versions of their papers on arXiv.org. Work-in-progress submissions are intended to provide a forum for the presentation of original work that is not (yet) in a suitable form for submission as a full or system description paper. This includes work in progress and emerging trends. Their size is not limited, but we recommend 5-10 pages. The programme committee may offer authors of rejected formal submissions to publish their contributions as work-in-progress papers instead. Depending on the number of work-in-progress papers accepted, they will be presented at the conference either as short talks or as posters. The work-in-progress proceedings will be published as a technical report, as well as online with CEUR-WS.org. All papers should be prepared in LaTeX and formatted according to the requirements of Springer's LNCS series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html). By submitting a paper the authors agree that if it is accepted at least one of the authors will attend the conference to present it. Electronic submission is done through easychair http://www.easychair.org/conferences/?conf=cicm2013 ---------------------------------------------------------------- Programme Committee ---------------------------------------------------------------- Jacques Carette, McMaster University, Canada Wolfgang Windsteiger, RISC Institute, JKU Linz, Austria Petr Sojka, Masaryk University, Faculty of Informatics, Czech Republic David Aspinall, University of Edinburgh, UK Christoph Lange, University of Birmingham, UK Till Mossakowski, DFKI Lab Bremen, Germany J?nathan Heras, University of Dundee, UK Josef Urban, Radboud University, Netherlands Deyan Ginev, Jacobs University Bremen, Germany Rob Arthan, Queen Mary University of London, UK Makarius Wenzel, Universit? Paris-Sud 11, France Hendrik Tews, TU Dresden, Germany Simon Colton, Department of Computing, Imperial College, London, UK Paul Libbrecht, Martin Luther University Halle-Wittenberg, Germany Cezary Kaliszyk, University of Innsbruck, Austria Andrea Kohlhase, Jacobs University Bremen, Germany Yannis Haralambous, T?l?com Bretagne, France Florian Rabe, Jacobs University Bremen, Germany Akiko Aizawa, NII, The University of Tokyo, Japan Carsten Schuermann, IT University of Copenhagen, Denmark Magnus O. Myreen, University of Cambridge, UK Janka Chlebikova, School of Computing, University of Portsmouth, UK Richard Zanibbi, Rochester Institute of Technology, US Michael Kohlhase, Jacobs University Bremen, Germany Adam Kilgarriff, Lexical Computing Ltd, UK Leo Freitas, Newcastle University, UK Frank Tompa, University of Waterloo, Canada Gudmund Grov, University of Edinburgh, UK Jeremy Avigad, Carnegie Mellon University, US Stephen Watt, University of Western Ontario, Canada Temur Kutsia, RISC Institute, JKU Linz, Austria Manfred Kerber, University of Birmingham, UK Hoon Hong, North Carolina State University, US Christoph L?th, DFKI Lab Bremen, Germany Thierry Bouche, Universit? Joseph Fourier (Grenoble), France Andrea Asperti, University of Bologna, Italy Jesse Alama, CENTRIA, FCT, Universidade Nova de Lisboa, Portugal (more names will be added as confirmations arrive) -- Christoph Lange, School of Computer Science, University of Birmingham http://cs.bham.ac.uk/~langec/, Skype duke4701 ? Enabling Domain Experts to use Formalised Reasoning @ AISB 2013 2?5 April 2013, Exeter, UK. Deadline 14 Jan http://cs.bham.ac.uk/research/projects/formare/events/aisb2013/ ? Intelligent Computer Mathematics, 7?12 Jul 2013, Bath, UK; Deadline 8 Mar http://cicm-conference.org/2013/ From math.semantic.web at gmail.com Wed Dec 19 11:21:12 2012 From: math.semantic.web at gmail.com (Christoph LANGE) Date: Wed, 19 Dec 2012 16:21:12 +0000 Subject: [TYPES/announce] CfP: Stage 2 of Enabling Domain Experts to use Formalised Reasoning@AISB 2013 (Exeter, UK, 2-3 Apr 2013); Deadline 14 Jan Message-ID: <50D1E978.4090404@gmail.com> Dear type theory community, I'm sure type theory is of interest for verification in a number of application domains, including domains beyond engineering. We are running a workshop with the goal of enabling domain experts (possibly without a strong computer science background) to use mechanised reasoning tools, including tools such as type checkers. Cheers, Christoph --- %< --- %< --- %< --- %< --- %< --- %< --- %< --- %< --- %< --- %< --- Do-Form: Enabling Domain Experts to use Formalised Reasoning http://cs.bham.ac.uk/research/projects/formare/events/aisb2013 CALL FOR CONTRIBUTIONS Symposium at the annual convention of the AISB (Society for the Study of Artificial Intelligence and Simulation of Behaviour; http://www.aisb.org.uk) University of Exeter, UK 2-5 April 2013 http://emps.exeter.ac.uk/computer-science/research/aisb/ SPECIAL SESSIONS with * Utku ?nver (market design and matching problems) * Peter Cramton (auctions) * Neels Vosloo (finance markets regulation) SUBMISSION DEADLINE: 14 January This symposium is motivated by the long-term VISION of making information systems dependable. In the past even mis-represented units of measurements caused fatal ENGINEERING disasters. In ECONOMICS, the subtlety of issues involved in good auction design may have led to low revenues in auctions of public goods such as the 3G radio spectra. Similarly, banks' value-at-risk (VaR) models ? the leading method of financial risk measurement ? are too large and change too quickly to be thoroughly vetted by hand, the current state of the art; in the London Whale incident of 2012, JP Morgan claimed that its exposures were $67mn under one of its VaR models, and $129 under another one. Verifying a model's properties requires formally specifying them; for VaR models, any work would have to start with this most basic step, as regulators' current desiderata are subjective and ambiguous. We believe that these problems can be addressed by representing the knowledge underlying such models and mechanisms in a formal, explicit, machine-verifiable way. Contemporary computer science offers a wide choice of knowledge representation languages well supported by verification tools. Such tools have been successfully applied, e.g., for verifying software that controls commuter rail or payment systems (cf. the symposium homepage for further background). Still, DOMAIN EXPERTS without a strong computer science background find it challenging to choose the right tools and to use them. This symposium aims at investigating ways to support them. Some problems can be addressed now, others will bring new challenges to computer science. General TOPICS of interest include: * for DOMAIN EXPERTS: what problems in application domains could benefit from better verification and knowledge management facilities? Possible fields include: * Example 1 (economics): auctions, VaR, trading algorithms, market design * Example 2 (engineering): system interoperability, manufacturing processes, product classification * for COMPUTER SCIENTISTS: how to provide the right knowledge management and verification tools to domain experts without a computer science background? * wikis and blogs for informal, semantic, semiformal, and formal mathematical knowledge; * general techniques and tools for online collaborative mathematics; * tools for collaboratively producing, presenting, publishing, and interacting with online mathematics; * automation and computer-human interaction aspects of mathematical wikis; * ontologies and knowledge bases designed to support knowledge management and verification in application domains; * practical experiences, usability aspects, feasibility studies; * evaluation of existing tools and experiments; * requirements, user scenarios and goals. We particularly invite submissions that address the problems or that apply the tools presented in the papers submitted for stage 1 (see "submission" below). THE SYMPOSIUM is designed to bring domain experts and formalisers into close and fruitful contact with each other: domain experts will be able to present their fields and problems to formalisers; formalisers will be exposed to new and challenging problem areas. We will combine talks and hands-on sessions to ensure close interaction among participants from both sides. World-class economists will offer dedicated HANDS-ON SESSIONS on the following topics: * Market design and matching problems (Utku ?nver, Boston College): These include matching students to schools, interns to hospitals, and kidney donors to recipients. See the documentation for the 2012 Nobel Memorial Prize in Economic Sciences for more background information (http://www.nobelprize.org/nobel_prizes/economics/laureates/2012/). * Auctions (Peter Cramton, University of Maryland): Peter works on auctions for ICANN (the ?knock out? domain name auctions), Ofcom UK (4G spectrum auction), the UK Department of the Environment and Climate Change, and others. * Finance (Neels Vosloo, Financial Services Authority UK): It is currently impossible for regulators to properly inspect either risk management models, or algorithmic trading platforms. To what extent can techniques from mechanised reasoning automate some of the inspection process? SUBMISSIONS We solicit submissions on any of the TOPICS outlined initially but prefer submissions that specifically address topics identified in the earlier submission Stage 1. In Stage 1 we had solicited * from DOMAIN EXPERTS descriptions of "nails": canonical models and problems in their domain that might benefit from better verification and knowledge management facilities. Descriptions should focus on aspects of these models that domain users find particularly problematic, and suspect might be aided by formalisation tools * from COMPUTER SCIENTISTS descriptions of "hammers": formalisation, verification and knowledge management tools, with an emphasis on how they could be applied in a concrete real-world setting, or tailored to such application domains. Commented versions of these submissions are now online at http://www.cs.bham.ac.uk/research/projects/formare/events/aisb2013/stage1.php. A tool whose description is submitted to Stage 2 could, e.g., be motivated with a Stage 1 problem, and sketch how the tool could, or will, be applied in this domain. Each submission will be refereed by three PC members on average. Submissions will be judged based on the PC's views of the likelihood of contributing to a better matching of hammers (formalisation and verification tools) to nails (domain problems). At this stage we accept PDF submissions in any layout but count 1200 words as one page for fair comparison. We invite research and position papers, as well as tool and system descriptions, from 3 to 10 pages. Besides PDFs we invite the submission of formalised knowledge representations with human-readable annotations. To submit a paper, please go to the Do-Form EasyChair page (http://www.easychair.org/conferences/?conf=doform2013) and follow the instructions for Stage 2 there. FINAL VERSIONS Final versions should be prepared in LaTeX according to the AISB formatting guidelines linked from the symposium homepage. For the final version, non-PDF submissions should be accompanied by a PDF abstract of 2 to 4 pages. Electronic proceedings (with an ISBN) will be made available to the convention delegates on a memory stick, and on the AISB website. Given a sufficient number of high-quality submissions, we will invite authors to submit revised and extended versions to a SPECIAL ISSUE of a relevant JOURNAL. (E.g., co-chair Manfred Kerber is on the editorial board of Mathematics in Computer Science.) IMPORTANT DATES * Submission (Stage 2): 14 January 2013 * Notification: 11 February 2013 * Final versions due: 4 March 2013 * Symposium: 2-3 April 2013 (most likely) * AISB Convention: 2-5 April 2013 PROGRAMME COMMITTEE 1. Bill Andersen, Highfleet, US 2. Rob Arthan, Lemma 1, Reading, UK 3. Christoph Benzm?ller, Free University of Berlin, Germany 4. Peter Cramton, University of Maryland, US 5. James Davenport, University of Bath, UK 6. Michael Gr?ninger, University of Toronto, Canada 7. Manfred Kerber, University of Birmingham, UK (co-chair) 8. Michael Kohlhase, Jacobs University Bremen, Germany 9. Christoph Lange, University of Birmingham, UK (co-chair) 10. Till Mossakowski, University of Bremen, Germany 11. Colin Rowat, University of Birmingham, UK (co-chair) 12. Todd Schneider, Raytheon, US 13. Richard Steinberg, London School of Economics, UK 14. Geoff Sutcliffe, University of Miami, US 15. Theodore L Turocy, Centre for Behavioural and Experimental Social Science, University of East Anglia, UK 16. Makarius Wenzel, University of Paris Sud, France 17. Wolfgang Windsteiger, RISC / JKU Linz, Austria COMMENTS/QUESTIONS/ENQUIRIES to be sent to DoForm2013 at easychair.org From ak155 at mcs.le.ac.uk Wed Dec 19 12:32:34 2012 From: ak155 at mcs.le.ac.uk (Alexander Kurz) Date: Wed, 19 Dec 2012 17:32:34 +0000 Subject: [TYPES/announce] TACL 2013, first call for abstracts Message-ID: <50D1FA32.5000303@mcs.le.ac.uk> [Apologies for multiple copies] ====================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013) ====================================================== July 28 - August 1, 2013 Department of Mathematics, Vanderbilt University Nashville, Tennessee USA http://www.math.vanderbilt.edu/~tacl2013/ The Sixth International Conference on Topology, Algebra and Categories in conjunction with the 28th Annual Shanks Lecture Series ====================================================== Confirmed invited speakers ------------------------------------- Vladimir Voevodsky, Institute for Advanced Studies, USA (Shanks Lecturer) Nick Bezhanishvili, Utrecht University, The Netherlands Leo Cabrer, University of Oxford, UK Silvio Ghilardi, University of Milan, Italy George Metcalfe, University of Bern, Switzerland Alex Simpson, University of Edinburgh, UK Scope --------- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2013 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the sixth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseilles (2011). Featured topics --------------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Lattice theory * Lattices with operators * Many-valued and fuzzy logics * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Submissions ----------------- Contributed presentations will be of two types: o 20 minutes long presentations in parallel sessions and o featured, 30 minutes long, plenary presentations. The submission of an abstract will be required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure, as well as a link to the EasyChair system, can be found at the conference web site. Important dates ----------------- April 1, 2013: Abstract submission deadline May 1, 2013: Notification to authors July 28-August 1, 2013: Conference Program Committee --------------------------- Steve Awodey, Carnegie Mellon University Guram Bezhanishvili, New Mexico State University David Gabelaia, Razmadze Mathematical Institute, Tbilisi Nick Galatos (co-chair), University of Denver Mai Gehrke, LIAFA, University of Paris Diderot Rob Goldblatt, Victoria University, Wellington John Harding, New Mexico State University Ramon Jansana, University of Barcelona Peter Jipsen, Chapman University Achim Jung, University of Birmingham Alexander Kurz (co-chair), University of Leicester Vincenzo Marra, University of Milan Hiroakira Ono, Japan Advanced Institute of Science and Technology Alessandra Palmigiano, University of Amsterdam Hilary Priestley, St Anne's College, Oxford James Raftery, University of KwaZulu-Natal, Durban Thomas Streicher, Technical University of Darmstadt Kazushige Terui, Kyoto University Constantine Tsinakis, Vanderbilt University Yde Venema, University of Amsterdam Michael Zakharyaschev, Birkbeck College, University of London Organizing Committee ------------------------------- Chris Conidis, Vanderbilt University Lianzhen Liu, Jiangnan University, China Warren McGovern, Florida Atlantic University Francesco Paoli, University of Cagliari Rebecca Steiner, Vanderbilt University Constantine Tsinakis (chair), Vanderbilt University William Young, Vanderbilt University Expression of interest ------------------------------ We would greatly appreciate your taking two minutes to express your level of interest in the conference by filling out a simple form on the conference web site under "Express Interest". This will help the Organizing Committee with their planning. You can also opt-out from receiving future announcements by clicking the link at the bottom of this email. More Information ----------------------- TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/ Use this site for local information, including hotel accommodations, for travel information and registration, and for submitting a request for financial support. Any queries for the Program Committee (such as usage of the EasyChair conference system, abstract submission guidelines, conference program, etc.) should be sent to tacl2013 at gmail.com. Queries for the local Organizing Committee (registration, hotel accommodations, financial support and reimbursements, technology infrastructure, etc.) should be sent to tacl2013oc at vanderbilt.edu. From Vasileios.Koutavas at scss.tcd.ie Wed Dec 19 14:26:28 2012 From: Vasileios.Koutavas at scss.tcd.ie (Vasileios Koutavas) Date: Wed, 19 Dec 2012 19:26:28 +0000 Subject: [TYPES/announce] OCCP 2013 Deadline Extension Message-ID: <22DF1B2F-FBB5-4914-9A52-747A734127F5@scss.tcd.ie> ---------------------------------------------------------------- DEADLINE EXTENSION OCCP 2013 1st Workshop on Optimistic Cooperation in Concurrent Programming Rome, Italy, March 16th, 2013 (collocated with ETAPS 2013) http://www.scss.tcd.ie/Vasileios.Koutavas/occp-workshop/ ---------------------------------------------------------------- * DATES *** note deadline extension *** Abstract submission deadline: 7 January 2013 Paper submission deadline: 11 January 2013 Notification: 1 February 2013 Camera ready deadline: 22 February 2013 * DESCRIPTION Optimistic concurrency has long been accepted as a convenient method for programming systems where there is contention for resources. Traditionally in database systems and more recently in software transactional memory systems, optimistic concurrency is realized in the form of transactions, which the programmer can assume run isolated from their environment, thereby alleviating the need for explicit programming of locking schemes. Recent research on concurrent programming models have lead to the realization in both academia and industry that optimistic concurrency can also be advantageous in programming systems where concurrent processes need to cooperate to perform a desired task. In such systems transactional isolation needs to be abandoned. This brings forward numerous challenges in 1) the design and implementation of such systems, 2) the invention of appropriate programming language support for optimistic process cooperation, 3) the semantics, theory and verification of these systems. This workshop aims to bring together researchers and practitioners from academia and industry who work on aspects of optimistic process cooperation. It also aims to connect the different research communities pertinent to this field. These include the programming language community, the systems community and the concurrent calculi community. * SCOPE Topics of interest include, but are not limited to: - Programming language support for optimistic process cooperation. - Semantics and theory of optimistic process cooperation. - Compilation techniques and runtime systems. - Calculi for modelling optimistic process cooperation in concurrent and distributed computing. - Use of optimistic cooperation in the modelling of service-oriented and biological systems. - Reversible computation. - Static analysis and verification of systems employing optimistic process cooperation. - Programming idioms for optimistic process cooperation. - Applications where optimistic process cooperation can provide a significant benefit to the programmer. - Experience reports of existing systems and prototypes employing forms of optimistic cooperation. * INVITED SPEAKERS - Suresh Jagannathan (Purdue University) - Victor Luchangco (Oracle Labs) * TUTORIALS - Matthew Fluet (Rochester Institute of Technology) Transactional Events - Vasileios Koutavas (Trinity College Dublin) Theory of Optimistic Cooperation * PAPER SUBMISSION AND PUBLICATION Submitted papers should contain previously unpublished complete work, work in progress, or experience reports. Submissions should be in PDF format, prepared using the EPTCS style (http://style.eptcs.org/), and should be from 7 to 15 pages long, including references. Papers must be submitted through the Easychair page of the workshop: http://www.easychair.org/conferences/?conf=occp2013 Accepted papers will be distributed in electronic preliminary proceedings at the workshop. Subsequently, selected papers will be invited for publication in a post-workshop refereed proceedings in Electronic Proceedings in Theoretical Computer Science. * ORGANISERS Nick Benton (Mircosoft Research) Matthew Fluet (Rochester Institute of Technology) Matthew Hennessy (Trinity College Dublin) Vasileios Koutavas (Trinity College Dublin) Jens Palsberg (UCLA) From serge.autexier at dfki.de Wed Dec 19 16:06:36 2012 From: serge.autexier at dfki.de (Serge Autexier) Date: Wed, 19 Dec 2012 22:06:36 +0100 (CET) Subject: [TYPES/announce] Call for Workshops: Conf. Intelligent Computer Mathematics (CICM 2013) Message-ID: <20121219210636.7C343FD7BF5@gigondas.localhost> CICM 2013 - Conference on Intelligent Computer Mathematics July 8-12, 2012 at the University of Bath, UK http://www.cicm-conference.org/2013 Call for Workshop Proposals ---------------------------------------------------------------------- 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. Workshop proposals for CICM 2013 are solicited. Both well-established workshops and newer or brand new ones are encouraged. Please provide the following information: + Workshop title. + Names and affiliations of organizers. + Brief description of workshop goals and/or topics. + Proposed workshop duration (half a day up to two days is possible). + If the workshop has met previously, please include the conference affiliation for the previous meeting. If the workshop is new, please indicate so. CICM conference fees will be levied on a per-day basis, so that workshop-only participation is possible. The CICM organizers plan to make available a small amount towards partial reimbursement for travel expenses of invited speakers. Also, CICM will take care of copying and distributing informal printed proceedings for workshops that would like this service, as well as permanently archived open access online proceedings with CEUR-WS.org. All proposals should be sent via email to cicm-organizers at jacobs-university.de for consideration by the CICM 2013 organizers: James Davenport (University of Bath, UK): Conference Chair Jacques Carette (McMaster University, Canada): Program Chair David Aspinall (University of Edinburgh, Scotland): MKM Track Chair Christoph Lange (Univ of Birmingham, UK): System & Projects Track Chair Petr Sojka (Masaryk University, CZ): DML Track Chair Wolfgang Windsteiger (RISC, Austria): Calculemus Track Chair Important dates: Deadline for proposal submissions: January 28, 2013 Acceptance/rejection notification: February 8, 2013 Workshop dates: July 8-12, 2013 ----------------------------------------------------------------------- From viktor at mpi-sws.org Thu Dec 20 03:58:16 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Thu, 20 Dec 2012 09:58:16 +0100 Subject: [TYPES/announce] PADL'13 : Call for participation Message-ID: <0FC390B7-75F6-4032-87B5-959A643A60EA@mpi-sws.org> Fifteenth Symposium on Practical Aspects of Declarative Languages (PADL '13) http://www.it.uu.se/conf/padl2013/ Rome, Italy January 21-22, 2013 Co-located with ACM POPL'13 You are cordially invited to the Fifteenth International Symposium on Practical Aspects of Declarative Languages that will be held on Jan 21-22, 2013 right before ACM POPL. If you are attending ACM POPL, we encourage you to stay for a whole week in Rome and attend PADL as well. Please note that the deadline for early registration is fast approaching. You can register by visiting https://regmaster3.com/2013conf/POPL13/register.php (Early registration deadline: 31 December) INVITED TALK: o Zipping Trees Across the Border - From Functional Specification to Logic Programming Implementation Tom Schrijvers LIST OF ACCEPTED PAPERS: o Implementing Equational Constraints in a Functional Language B. Brassel, M. Hanus, B. Peem?ller and F. Reck. o Dependently Typed Web Client Applications - FRP in Adga in HTML5 Alan Jeffrey. o The Generalized Intensional Transformation for Implementing Lazy Functional Languages G. Fourtounis, N. Papaspyrou and P. Rondogiannis. o A Library for Declarative Resolution-Independent 2D Graphics Paul Klint and Atze van der Ploeg. o Analysing the Entire Wikipedia History with Database Supported Haskell G. Giorgidze, T. Grust, I. Halatchliyski and M. Kummer. o Formalizing a Broader Recursion Coverage in SQL G. Aranda, S. Nieva, F. Sa?enz-Perez and Jaime Sanchez-Hernandez. o A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction V. Rodrigues, B. Akesson, M. Florido and S. Melo de Sousa. o LogicObjects: Enabling Logic Programming in Java Through Linguistic Symbiosis Sergio Castro, Kim Mens and Paulo Moura. o Supporting Pruning in Tabled LP P. Chico De Guzm?n, M. Carro and M. Hermenegildo. o A Portable and Efficient Implementation of Coinductive Logic Programming Paulo Moura. o A Declarative-friendly API for Web Document Manipulation Benjamin Canou, Emmmanuel Chailloux and Vincent Balat. o On the Efficient Implementation of Mode-Directed Tabling Jo?o Santos and Ricardo Rocha. o Terminyzer: An Automatic Non-Termination Analyzer for Large Logic Programs Senlin Liang and Michael Kifer. o Integrative functional statistics in logic programming N. Angelopoulos, V. Santos Costa, J. Azevedo, J. Wielemaker R. Camacho, and L. Wessels. o Reversible Language Extensions and their Application in Debugging Zo? Drey, Jose F. Morales, Manuel Hermenegildo and Manuel Carro. o ProSQLite: Prolog file based databases via an SQLite interface Sander Canisius, Nicos Angelopoulos, and Lodewyk Wessels. o Parallel Performance of Declarative Programming using a PGAS Model Rui Machado, Salvador Abreu and Daniel Diaz. From paolini at di.unito.it Thu Dec 20 07:05:26 2012 From: paolini at di.unito.it (Luca Paolini) Date: Thu, 20 Dec 2012 13:05:26 +0100 Subject: [TYPES/announce] CSL 2013 : PRELIMINARY ANNOUNCEMENT Message-ID: <50D2FF06.1010002@di.unito.it> ______________________________________________________________________________________________ CSL 2013 Torino, September 2-5 2013 http://csl13.di.unito.it/ PRELIMINARY ANNOUNCEMENT _______________________________________________________________________________________________ AIM AND SCOPE Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. LOCATION The 22nd EACSL Annual Conferences on Computer Science Logic will be held at Museo di Scienze Naturali in Torino from Monday 2nd through Thursday 5th of September 2013. LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE) automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, game semantics, modal and temporal logic, model checking, decision procedures, logical aspects of computational complexity, computational proof theory, bounded arithmetic and propositional proof complexity, logic programming and constraints, lambda calculus and combinatory logic, domain theory, categorical logic and topological semantics, database theory, specification, extraction and transformation of programs, logical aspects of quantum computing, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, non-monotonic reasoning. IMPORTANT DATES Abstract submission: April, 1st 2013 Paper Submission: April, 8th 2013 Paper Notification: June, 10th 2013 Paper final version: July, 1st 2013 Conference: September, 2nd --- 5th 2013 SUBMISSION Authors are invited to submit papers of not more than 15 pages in LIPIcs style presenting work not previously published. Papers are to be submitted through Easychair. Submitted papers must be in English and must provide sufficient detail to allow the PC to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the program committee. The submission is in two stages. Abstract submissions are due before April 1st, 2013. Full paper submissions must be done before April 8th, 2013. Papers must not be submitted concurrently to another conference with refereed proceedings. The PC chair should be informed of closely related work submitted to a conference or a journal by March 24th, 2013. Papers authored or co-authored by members of the Programme Committee are not allowed. SATELLITE EVENTS The 14th International Workshop on Logic and Computational Complexity (LCC'13) will be held on 6th of September 2013 as a satellite event of CSL'13. An international summer school on ?Linear logic and related topics? will be held from 28th through 31st of August 2013 as a satellite event of CSL'13. Further details will appear on this page as soon as possible. PROGRAM COMMITTEE Zena Ariola (University of Oregon) Arnon Avron (Tel-Aviv University) Roberto Bagnara (University of Parma, and BUGSENG srl) Christel Baier (Technical University of Dresden) Marc Bezem (University of Bergen) Paola Bruscoli (University of Bath, Computer Science Department) Agata Ciabattoni (TU Wien) Thierry Coquand (Chalmers University) Ugo Dal Lago (Universit? di Bologna) Valeria De Paiva (Nuance Communications) Reinhard Kahle (CENTRIA and DM, UNL, Portugal) Stephan Kreutzer (Technical University Berlin) Olivier Laurent (CNRS - ENS Lyon) Carsten Lutz (Universit?t Bremen) Jean-Yves Marion (Universit? de Lorraine, LORIA) Damian Niwinski (Warsaw University) Frank Pfenning (Carnegie Mellon University) Elaine Pimentel (UFMG) Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS)) Simona Ronchi Della Rocca CHAIR (Universit? di Torino) Jan Rutten (CWI) Helmut Schwichtenberg (LMU Munich) Phil Scott (Dept. of Math & Stats, U. Ottawa) Peter Selinger (Dalhousie University) Makoto Tatsuta (National Institute of Informatics) Tachio Terauchi (Nagoya University) ORGANIZING COMMITTEE Erika De Benedetti (Dipartimento di Informatica, Torino) Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica (DISIT), Alessandria) Mauro Piccolo (Dipartimento di Informatica, Torino) Luca Padovani (Dipartimento di Informatica, Torino) Luca Paolini (Dipartimento di Informatica, Torino) Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino) Luca Roversi (Dipartimento di Informatica, Torino) Angelo Troina (Dipartimento di Informatica, Torino) -- DipInfo Spam Engine -- Visit the following link if you are sure that this message IS SPAM https://mailscanner.di.unito.it/SpamEngine/this_is_spam.php?id=qBKC5RpO009801 From einarj at ifi.uio.no Thu Dec 20 08:36:46 2012 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Thu, 20 Dec 2012 14:36:46 +0100 Subject: [TYPES/announce] integrated Formal Methods (iFM 2013): Last Call for Papers Message-ID: <0718776A-6B5B-4E8F-AE87-435AD9853AA1@ifi.uio.no> LAST CALL FOR PAPERS ********************************************************************** 10th International Conference on integrated Formal Methods (iFM 2013) June 10 - 14, 2013 - Turku, Finland http://www.it.abo.fi/iFM2013/ ********************************************************************** IMPORTANT DATES - Abstract Submission: January 10, 2013 - Paper submission: January 17, 2013 - Paper notification: March 11, 2013 - Final version paper: March 31, 2013 OBJECTIVES AND SCOPE Applying formal methods may involve modeling different aspects of a system which are best expressed using different formalisms. Correspondingly, different analysis techniques may be used to examine different system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into hybrid approaches to formal modeling and analysis; i.e., the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Formal and semiformal modelling notations; - Integration of formal methods into software engineering practice; - Refinement; - Theorem proving; - Tools; - Logics; - Model checking; - Model transformations; - Semantics; - Static Analysis; - Type Systems; - Verification; - Case Studies; - Experience reports INVITED SPEAKERS iFM 2013 will have the following keynote speakers: - Jean-Raymond Abrial, Marseille, France: From Z to B and then Event-B: Assigning Proofs to Meaningful Programs - Susanne Graf, VERIMAG, France: Integrating Distributed Control over Systems with Priorities - Cosimo Laneve, University of Bologna, Italy: An Algebraic Theory for Web Services Contracts - Kim Larsen, Aalborg University, Denmark: Statistical Model Checking with Priced Timed Automata SPECIAL ISSUES To celebrate the 10th edition of iFM, there will be special issues of the Springer journals - Formal Aspects of Computing - Software and Systems Modeling The best papers from iFM 2013 will be invited for these special issues, complemented by an open call for papers, and undergo a separate peer-review process according to the usual scientific standards of these journals. WORKSHOPS AND TUTORIALS There will be two days of workshops and tutorials before the iFM conference. The conference will take place June 12-14, 2013 and the tutorials and workshops June 10-11, 2013. We are happy to announce the following workshops and tutorials that will accompany iFM 2013: - CompMod 2013: The 4th International Workshop on Computational Models for Cell Processes Website: http://combio.abo.fi/compmod13/ Organiser: Ion Petre, ?bo Akademi University, Finland - The 11th Overture Workshop Website: http://wiki.overturetool.org/index.php/11th_Overture_Workshop Organisers: Stefan Hallerstede, Aarhus University, Denmark and Ken Pierce, University of Newcastle, UK - Rodin User and Developer Workshop 2013 Website: http://wiki.event-b.org/index.php/Rodin_Workshop_2013 Organisers: Michael Butler, University of Southampton; Stefan Hallerstede, Aarhus University; Thierry Lecomte, ClearSy; Michael Leuschel, University of D?sseldorf; Alexander Romanovsky, University of Newcastle; Laurent Voisin, Systerel; Marina Walden, ?bo Akademi University - FMDEP 2013: Workshop on Formal Methods for Dependable Computer-Based Systems Website: to be announced Organisers: J?ri Vain, Tallinn University of Technology, Estonia and Leonidas Tsiopoulos, ?bo Akademi University, Finland - BCS FACS 2013 Refinement Workshop 2013 Website: http://www.refinenet.org.uk/ref13/cfp.html Organisers: Eerke Boiten, University of Kent, UK; John Derrick, University of Sheffield, UK; Steve Reeves, University of Waikato, NZ - Tutorial: Specification and Proof of Programs with Frama-C Organizers: Nikolai Kosmatov, Virgile Prevosto, and Julien Signoles (Software Safety Laboratory, CEA LIST) SUBMISSION GUIDELINES iFM 2013 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. The conference proceedings will be published in Springer's Lecture Notes in Computer Science series. All submissions must be original, unpublished, and not submitted for publication elsewhere. Submissions must be in PDF format, using the Springer LNCS style files; we suggest to use the LaTeX2e package (the llncs.cls class file, available in llncs2e.zip and the typeinst.dem available in typeinst.zip as a template for your contribution). Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. Submissions should be made using the iFM 2013 Easychair web site: https://www.easychair.org/account/signin.cgi?conf=ifm2013 All accepted papers must be presented at the conference. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by the early date, to be indicated by the organizers, and present the paper. iFM PROGRAMME COMMITTEE CHAIRS: - Einar Broch Johnsen, University of Oslo, Norway - Luigia Petre, ?bo Akademi University, Finland iFM 2013 TUTORIALS and WORKSHOPS CHAIR Pontus Bostr?m, ?bo Akademi University, Finland iFM 2013 ORGANIZING COMMITTEE CHAIR Luigia Petre, ?bo Akademi University, Finland PROGRAM COMMITTEE - Erika Abraham, RWTH Aachen University, Germany; - Elvira Albert, Complutense University of Madrid, Spain; - Marcello Bonsangue, Leiden University, the Netherlands; - Phillip J Brooke, Teesside University, UK; - Ana Cavalcanti, University of York, UK; - Dave Clarke, Catholic University of Leuven, Belgium; - John Derrick, Unversity of Sheffield, UK; - Jin Song Dong, National University of Singapore, Singapore; - Kerstin Eder, University of Bristol, UK; - John Fitzgerald, Newcastle University, UK; - Andy Galloway, University of York, UK; - Marieke Huisman, University of Twente, the Netherlands; - Reiner H?hnle, Technical University of Darmstadt, Germany; - Einar Broch Johnsen, University of Oslo, Norway; - Peter Gorm Larsen, Aarhus University, Denmark; - Diego Latella, ISTI-CNR, Pisa, Italy; - Michael Leuschel, University of Duesseldorf, Germany; - Shaoying Liu, Hosei University, Japan; - Michele Loreti, University of Florence, Italy; - Dominique Mery, LORIA and University of Lorraine, France; - Stephan Merz, INRIA Lorraine, France; - Richard Paige, University of York, UK; - Luigia Petre, ?bo Akademi University, Finland; - Kristin Yvonne Rozier, NASA Ames Research Center, USA; - Philipp Ruemmer, Uppsala University, Sweden; - Thomas Santen, European Microsoft Innovation Center, Germany; - Ina Schaefer, Technical University of Braunschweig, Germany; - Steve Schneider, University of Surrey, UK; - Emil Sekerinski, McMaster University, Canada; - Graeme Smith, University of Queensland, Australia; - Colin Snook, University of Southampton, UK; - Kenji Taguchi, AIST, Japan; - Helen Treharne, University of Surrey, UK; - Heike Wehrheim, University of Paderborn, Germany; - Herbert Wiklicky, Imperial College, UK; - Gianluigi Zavattaro, University of Bologna, Italy ********************************************************************** This call for papers and additional information about the conference can be found at http://www.it.abo.fi/iFM2013 For information regarding the conference you can contact: ifm2013 at abo.fi From ak155 at mcs.le.ac.uk Thu Dec 20 15:56:27 2012 From: ak155 at mcs.le.ac.uk (Alexander Kurz) Date: Thu, 20 Dec 2012 20:56:27 +0000 Subject: [TYPES/announce] Spring School MGS 2013 Message-ID: <50D37B7B.7080200@mcs.le.ac.uk> ************************************************************* Midlands Graduate School 2013 in the Foundations of Computing ************************************************************* The Midlands Graduate School is taking place 8 - 12 April 2013 at the University of Leicester, UK. http://www.cs.le.ac.uk/events/mgs2013/ The School provides an intensive course of lectures on the Foundations of Computing. It is very well established, having run annually for 10 years, and has always proved a popular and successful event. This year we have Philip Wadler, University of Edinburgh, as guest lecturer. Natasha Alechina, Modal Logic Venanzio Capretta, Coalgebras and Infinite Data Structures Paul Levy, Typed Lambda-Calculus Brian Logan, Multi-agent programming Uday Reddy, Category Theory Eike Ritter, Security and applied pi-calculus Georg Struth, Kleene Algebra Rick Thomas, Formal Languages and Group Theory Philip Wadler, tba The lectures are aimed at graduate students, typically in their first or second year of study for a PhD. However, the school is open to anyone who is interested in learning more about mathematical computing foundations. Early registration fee will be approximately 500 GBP, including accommodation and full board. Details will be announced in January, but we already welcome expressions of interest to mgs.le.2013 at gmail.com From ak155 at mcs.le.ac.uk Thu Dec 20 16:15:18 2012 From: ak155 at mcs.le.ac.uk (Alexander Kurz) Date: Thu, 20 Dec 2012 21:15:18 +0000 Subject: [TYPES/announce] 2 PhD positions in Leicester Message-ID: <50D37FE6.2050702@mcs.le.ac.uk> Hello, in case somebody knows of a talented student who is looking for a place to do a PhD in theoretical computer science (or any other topic of interest to our department), please forward http://www2.le.ac.uk/study/research/funding/computerscience-gta "GTA" means that the studentship is over 4 years, but also involves some teaching assistance. Deadline is 10th January. I am happy to answer any questions that might arise, Best wishes for Christmas and the New Year, Alexander From ak155 at mcs.le.ac.uk Thu Dec 20 16:30:20 2012 From: ak155 at mcs.le.ac.uk (Alexander Kurz) Date: Thu, 20 Dec 2012 21:30:20 +0000 Subject: [TYPES/announce] Lectureship in Computer Science Message-ID: <50D3836C.9000908@mcs.le.ac.uk> We have a lectureship in Computer Science available, see http://www2.le.ac.uk/departments/computer-science/documents/vacancies/SEN00310_Further_Particulars.pdf Deadline is 15th January. I am happy to answer any questions about our department. Best wishes for Christmas and the New Year again, Alexander From pangjun at gmail.com Fri Dec 21 09:56:44 2012 From: pangjun at gmail.com (Jun PANG) Date: Fri, 21 Dec 2012 15:56:44 +0100 Subject: [TYPES/announce] ESSS workshop 2013 (co-located with ICST 2013) -- submission deadline extended Message-ID: New submission deadline: January 6th, 2013 ================================================== 2nd International Workshop on Engineering Safety and Security Systems March 18, 2013, Luxembourg Co-located with ICST 2013 in Luxembourg, March 18-22, 2013 More information: http://www.comp.nus.edu.sg/~pat/esss2013/ =================================================== Important dates ----------------- * January 6th 2013: Submission deadline (extended) * February 11th 2013: Notification of acceptance/rejection (extended) * March 18th 2013: Workshop Introduction of the Workshop ----------------- The International Workshop on Engineering Safety and Security Systems (ESSS) aims at contributing to the challenge of constructing reliable and secure systems. The workshop covers areas such as formal specification, (extended) type checking, model checking, program analysis/transformation, model-based testing and model-driven software construction. The workshop will bring together researchers and industry R&D expertise together to exchange their knowledge, discuss their research findings, and explore potential collaborations. Theme of the Workshop ----------------- The main theme of the workshop is methods and techniques for constructing large reliable and secure systems. The goal of the workshop is to establish a platform for the exchange of ideas, discussion, cross-fertilization, inspiration, co-operation, and dissemination. The topics of the workshop include, but are not limited to: -- methods, techniques and tools for system safety and security -- methods, techniques and tools for analysis, certification, and debugging of complex safety and security systems -- model-based and verification-based testing -- emerging application domains such as cloud computing and cyber-physical systems -- case studies and experience reports on the use of formal methods for analyzing safety and security systems Submissions guidelines ----------------- Paper submissions must be original, unpublished work. Submissions should be in made via the Easychair site: https://www.easychair.org/conferences/?conf=esss2013. Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html ). Papers should not exceed 6 pages for full papers and 2 pages for short papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All workshop papers will be published in the IEEE Digital Library in the form of a post-proceedings. A pre-workshop version of the papers will be available on the workshop website prior. Publication of accepted articles requires the commitment of one of the authors to register for the workshop and present the paper. General chair ----------------- Sjouke Mauw, University of Luxembourg, Luxembourg Program chairs ----------------- Yang Liu, Nanyang Technological University, Singapore Jun Pang, University of Luxembourg, Luxembourg Program committee ----------------- Etienne Andre, Universite Paris 13, France Cyrille Artho, AIST, Japan Marieke Huisma, University of Twente, The Netherlands Weiqiang Kong, Kyushu University, Japan Keqin Li, SAP Research, France Yang Liu, Nanyang Technological University, Singapore Zhiming Liu, UNU/IIST Macao, China Sjouke Mauw, University of Luxembourg, Luxembourg Jun Pang, University of Luxembourg, Luxembourg Geguang Pu, East China Normal University, China Mohammad Torabi Dashti, ETH Zurich, Switzerland Anton Wijs, Eindhoven University of Technology Yoriyuki Yamagata, AIST, Japan -------------- next part -------------- An HTML attachment was scrubbed... URL: From francesco.tiezzi at imtlucca.it Fri Dec 21 11:53:49 2012 From: francesco.tiezzi at imtlucca.it (Francesco Tiezzi) Date: Fri, 21 Dec 2012 17:53:49 +0100 Subject: [TYPES/announce] CFP: COORDINATION 2013 in Firenze Message-ID: <4D9745C0-0AA4-4979-88D4-1EBF8352DBDE@imtlucca.it> [We apologize for multiple copies] ======================= First Call for Papers ====================== COORDINATION 2013 15th International Conference on Coordination Models and Languages http://coordination.discotec.org/ - part of DisCoTec 2013 Firenze, Italy, June 3-5 2013 ==================================================================== * IMPORTANT DATES * February 4, 2013 Abstract submission February 11, 2013 Paper submission March 18, 2013 Notification of acceptance March 25, 2013 Camera-ready version April 25, 2013 Early registration June 3-5 2013 Conference * SCOPE * COORDINATION 2013 is the premier forum for publishing research results and experience reports on software technologies for collaboration and coordination in concurrent, distributed, and socio-technical systems. Its distinctive feature is its emphasis on high-level abstractions that capture interaction patterns manifest at all levels of the software architecture extending into the realm of the end-user domain. We seek high-quality contributions on the usage, study, design, and implementation of languages, models, and techniques for coordination in distributed, concurrent, pervasive, and multicore software systems. * MAIN TOPICS OF INTEREST * - programming abstractions and languages; - coordination models and paradigms; - software management and software engineering; - specification and verification; - foundations and types; - software for decentralized technologies; - multicore programming; - adaptive and autonomic systems; - coordination for social and socio-technical systems. * EXPECTED CONTRIBUTIONS * - Research papers: that demonstrate an ability to increase modularity, improve adaptive behavior, simplify reasoning, and enhance the software development process and its integration into a socio-technical context. Both practical and foundational perspectives are of interest. - Experience reports: that describe lessons learned from the application of proposed models and techniques to problems in the real world. - Visions in Progress papers: that look far ahead into the future of coordination-related ideas and explore the long-term vision of coordination languages, models, middleware and algorithms. * SUBMISSIONS * All Research Papers and Experience Reports must report on original unpublished work and cannot be under review for publication elsewhere. The key criteria for evaluating submissions will be innovation, scientific and technical soundness, and the capability to prove the advantages of the proposed techniques (in addition to their potential applicability). Maximum length: 15 pages. Visions in Progress Papers can report on work that has already been presented elsewhere, but the paper in itself must be a new synthesis and must clearly outline the motivation for the vision and the path that can eventually lead to its realization. The key criteria for evaluating submissions will be solid motivations, radical innovation, capability to look far beyond the state of the art, and feasibility of the proposed vision. Maximum length: 8 pages. All contributions should be submitted electronically as Postscript or PDF, using the Springer LNCS style, via the following EasyChair submission site: https://www.easychair.org/conferences/?conf=coordination2013 Submissions exceeding the category's stated length might be rejected without review. Each paper will undergo a thorough evaluation, and the conference proceedings will be published by Springer-Verlag in the LNCS series. Proceedings will be made available at the conference. Submission of any category of paper is a commitment that at least one of the authors will attend the conference if the paper is accepted. * PC CHAIRS * Rocco De Nicola (IMT - Institute for Advanced Studies Lucca, Italy) Christine Julien (The University of Texas at Austin, USA) * PROGRAMME COMMITTEE * Gul Agha (The University of Illinois at Urbana Champaign, USA) Saddek Bensalem (Verimag Laboratory, France) Borzoo Bonakdarpour (The University of Waterloo, Canada) Giacomo Cabri (Universita' di Modena e Reggio Emilia, Italy) Paolo Ciancarini (Universita' di Bologna, Italy) Dave Clarke (KU Leuven, Belgium) Frank de Boer (CWI, The Netherlands) Wolfgang De Meuter (Vrije Universiteit Brussel, Belgium) Jose' Luiz Fiadeiro (Royal Holloway University of London, UK) Chien-Liang Fok (The University of Texas, USA) Chris Hankin (Imperial College London, UK) Raymond Hu (Imperial College London, UK) K.R. Jayaram (HP Labs, USA) eva Kuehn (Vienna University of Technology, Austria) Mieke Massink (ISTI-CNR, Pisa, Italy) Jamie Payton (The University of North Carolina at Charlotte, USA) Rosario Pugliese (Universita' di Firenze, Italy) Nikola Serbedzija (Fraunhofer FOKUS, Germany) Marjan Sirjani (Reykjavik University, Iceland) Robert Tolksdorf (Freie Universitat Berlin, Germany) Emilio Tuosto (University of Leicester, UK) Vasco T. Vasconcelos (University of Lisbon, Portugal) Mirko Viroli (Universita' di Bologna, Italy) * STEERING COMMITTEE * Farhad Arbab (CWI and Leiden University, The Netherlands, chair) Gul Agha (University of Illinois at Urbana Champaign, USA) Dave Clarke (KU Leuven, Belgium) Jean-Marie Jacquet (University of Namur, Belgium) Wolfgang De Meuter (Vrije Universiteit Brussels, Belgium) Rocco De Nicola (IMT - Institute for Advanced Studies Lucca, Italy) Marjan Sirjani (Reykjavik University, Iceland) Carolyn Talcott (SRI, USA) Vasco T. Vasconcelos (University of Lisbon, Portugal) Gianluigi Zavattaro (University of Bologna, Italy) * PUBLICITY CHAIR * Francesco Tiezzi (IMT - Institute for Advanced Studies Lucca, Italy) * FLYER * The COORDINATION 2013 flyer is available at: http://coordination.discotec.org/docs/Coordination_2013_flyer.pdf From cmsb13 at ist.ac.at Sat Dec 22 07:52:52 2012 From: cmsb13 at ist.ac.at (CMSB2013) Date: Sat, 22 Dec 2012 13:52:52 +0100 Subject: [TYPES/announce] [CFP] CMSB2013 - The 11th Annual Conference on Computational Methods in Systems Biology In-Reply-To: <50D5AC9B.1090505@ist.ac.at> References: <50D5AC9B.1090505@ist.ac.at> Message-ID: <50D5AD24.9040803@ist.ac.at> CALL FOR PAPERS *************************************************************************** CMSB 2013 The 11th Annual Conference on Computational Methods in Systems Biology 23-25 September, 2013 IST Austria, Klosterneuburg, Austria http://ist.ac.at/cmsb13 *************************************************************************** IMPORTANT DATES Abstract deadline 8 April, 2013 Paper submission deadline 15 April, 2013 Author notification 27 May, 2013 Poster submission deadline 27 May, 2013 Poster notification 10 June, 2013 Camera-ready deadline 24 June, 2013 AIM & SCOPE CMSB 2013 solicits original research articles on the computational modeling and analysis of biological systems, pathways, networks, data, and corresponding application domains. The conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological processes. It covers theory, computation, as well as applications. Topics of interest include, but are not limited to: * original paradigms, formalisms, and languages for modeling biological processes * original models together with their application domains * frameworks, techniques, and tools for verifying, validating, analyzing, and simulating biological systems * high-performance computational systems biology and parallel implementations * inference from high-throughput experimental data * model integration from biological databases * multi-scale modeling and analysis methods * synthetic biology. Case studies in systems and synthetic biology are especially encouraged. Submitted papers should describe original work that has not been previously published and is not under review for publication elsewhere. Proceedings will be published by Springer LNCS/LNBI. After the conference, a selection of papers will be invited to be extended and submitted to a special issue of Theoretical Computer Science. PAPER SUBMISSION Papers must be edited in LATEX using the LNCS format and be submitted electronically as PDF files via EasyChair. The limit for submissions is 12 pages. POSTER TRACK CMSB 2013 also solicits poster submissions. The abstract of each poster will get 2 pages in the proceedings. Some selected posters will also be given slots of short talks at the conference. We especially encourage poster submission from experimental biologists! In order to facilitate biologists to attend the conference and present their work, a limited number of travel stipends for students and postdocs presenting biology posters will be available. INVITED SPEAKERS tba ORGANIZING COMMITTEE * Calin Guet - IST Austria * Ashutosh Gupta - IST Austria * Thomas Henzinger - IST Austria (program chair) PROGRAM COMMITTEE tba STEERING COMMITTEE * Finn Drablos - NTNU, Trondheim, Norway * Francois Fages - INRIA Paris Rocquencourt, France * David Harel - Weizmann Institute of Science, Rehovot, Israel * Monika Heiner - Brandenburg University of Technology, Cottbus, Germany * Tommaso Mazza - IRCCS Casa Sollievo della Sofferenza Mendel, Rome, Italy * Satoru Miyano - University of Tokyo, Japan * Gordon Plotkin - University of Edinburgh, UK * Corrado Priami - CoSBi/Microsoft Research, University of Trento, Italy * Carolyn Talcott - Stanford Research Institute, Menlo Park, USA * Adelinde Uhrmacher - University of Rostock, Germany SPONSORS * European Research Council (ERC) * IST Austria * Technical Committee for Simulation (TCSIM) From Ralph.Matthes at irit.fr Sat Dec 22 13:01:12 2012 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Sat, 22 Dec 2012 19:01:12 +0100 Subject: [TYPES/announce] Types Meeting 2013 in Toulouse, 23 - 26 April: first call for contributions Message-ID: <1356199272.1699.328.camel@amelior> Types Meeting 2013 Toulouse, 23-26 April 2013 http://www.irit.fr/TYPES2013/ FIRST CALL FOR CONTRIBUTIONS The 19th Conference "Types for Proofs and Programs" will take place in Toulouse, France, from 23 to 26 April 2013. The Types Meeting is a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. Invited speakers: * Steve Awodey, Department of Philosophy, Carnegie Mellon University, U.S.A. * Lars Birkedal, Department of Computer Science, Aarhus University, Denmark * Ulrich Kohlenbach, Department of Mathematics, TU Darmstadt, Germany We invite all researchers to contribute talks on subjects related to the Types area of interest. These include, but are not limited to: - Foundations of type theory and constructive mathematics; - Applications of type theory; - Dependently typed programming; - Industrial uses of type theory technology; - Meta-theoretic studies of type systems; - Proof assistants and proof technology; - Automation in computer-assisted reasoning; - Links between type theory and functional programming; - Formalizing mathematics using type theory. We would like to especially encourage talks proposing new ways of applying type theory. The talks may be based on newly published papers or work submitted for publication, but also work in progress. There are no formal pre-proceedings, but we will make available the abstract book for the conference. Meanwhile, post-proceedings are confirmed to appear in LIPIcs (Leibniz International Proceedings in Informatics), Schloss Dagstuhl, see http://www.dagstuhl.de/en/publications/lipics (the same publisher as for the last TYPES meeting in Bergen in 2011) There will be a separate call for papers, and participation in TYPES 2013 is no prerequisite for submission to the post-proceedings. TYPES 2013 is intended to be a conference in our traditional workshop style. We expect submission of short abstracts that fit on one or two pages, presenting in sufficient detail the content of the talk and its relevance for TYPES, as judged by the program committee. Submission is exclusively admitted electronically, through the EasyChair system. The submission site is https://www.easychair.org/conferences/?conf=types2013 Deadline for proposing a contributed talk: Monday, February 18 This means registering a submission to the EasyChair system, including a short text-only abstract. Deadline for the final version of the abstract: Monday, February 25 The final abstract has to be typeset in LaTeX (precise instructions will be given on the web site) and should fit on one or two pages. It is meant for inclusion into the abstract book. Notification of acceptance: Friday, March 8 The conference itself: Tuesday to Friday, April 23-26, 2013 The venue: Toulouse in the South West of France is the fourth largest city of France and a lively university center with way over 100000 students. Toulouse offers numerous inexpensive accommodations, including student residences. Thanks to our sponsors, notably Universit? Toulouse 1 Capitole, granting the lecture hall in the city center, and IRIT (Institut de Recherche en Informatique de Toulouse) with financial support (other sources pending), we will be able to keep the participation fee moderate. Moreover, we will operate a scheme of additional fee reduction for master and PhD students (details will be given later on the web site). ----------------------------------------------------------------------- Satellite event: On Monday, April 22, the twelfth international workshop Proof, Computation, Complexity (PCC 2013) will be held on the campus of Toulouse Technical University. For the details, see the web site of TYPES 2013. ----------------------------------------------------------------------- Program Committee TYPES 2013 Jos? Esp?rito Santo, University of Minho, Braga, Portugal Herman Geuvers, Radboud University Nijmegen, Netherlands Silvia Ghilezan, University of Novi Sad, Serbia Hugo Herbelin, PPS, INRIA Rocquencourt-Paris, France Martin Hofmann, Ludwig-Maximilians-Universit?t M?nchen, Germany Zhaohui Luo, Royal Holloway, University of London, UK Ralph Matthes, IRIT, CNRS and Univ. de Toulouse, France (co-chair) Marino Miculan, University of Udine, Italy Bengt Nordstr?m, Chalmers University of Technology, G?teborg, Sweden Erik Palmgren, Stockholm University, Sweden Andy Pitts, University of Cambridge, UK Sergei Soloviev, IRIT, Univ. de Toulouse, France (co-chair) Pawe? Urzyczyn, University of Warsaw, Poland Tarmo Uustalu, Tallinn Technical University, Estonia From might at cs.utah.edu Sat Dec 22 14:53:03 2012 From: might at cs.utah.edu (Matt Might) Date: Sat, 22 Dec 2012 12:53:03 -0700 Subject: [TYPES/announce] PLDI 2013: Call for tutorials Message-ID: Date: Sunday June 16, 2013 PLDI is a forum where researchers, developers, educators, and practitioners exchange information on the latest practical and experimental work in the design and implementation of programming languages. The tutorial program enhances the technical program by providing a day of half-day tutorials offered in parallel tracks. Tutorials for PLDI 2013 are solicited on any topic relevant to the PLDI audience. In particular, tutorials that strive to do one of the following have been particularly successful in the past: * Describe an important piece of research infrastructure * Educate the community on an emerging topic For examples of past tutorials, see (among others) the websites of PLDI 2012, PLDI 2011, and PLDI 2010: * http://ecoop12.cs.purdue.edu/content/pldi-tutorials * http://pldi11.cs.utah.edu/index.html#events * http://www.cs.umd.edu/~mwh/pldi10tutorials/program.html In 2013, tutorials will be held on Sunday June 16, 2013 (the day before the main conference). We expect half-day tutorials (3 hours plus a break). For each accepted tutorial, one presenter will receive complimentary registration to PLDI. We are investigating low-cost options for video-recording tutorials if and only if tutorial presenters wish. Submission Procedures --------------------- Submissions should be in pdf or plain-text, sent via email to Dan Grossman (djg at cs.washington.edu, with subject line "PLDI tutorial proposal") with the following information: * Tutorial title * Presenter(s), affiliation(s), and contact information * 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees * 1-2 paragraph abstract suitable for tutorial publicity * 1 paragraph biography suitable for tutorial publicity Important Dates --------------- * Submission Deadline: January 22, 2013, 11PM Pacific Standard Time * Notification: On or before February 20, 2013 Questions --------- Questions should be emailed to the PLDI 2013 Tutorials Chair, Dan Grossman, djg at cs.washington.edu Conference website ------------------ http://pldi2013.ucombinator.org/ From ewen.w.denney at nasa.gov Sun Dec 23 06:57:48 2012 From: ewen.w.denney at nasa.gov (Ewen Denney) Date: Sun, 23 Dec 2012 03:57:48 -0800 Subject: [TYPES/announce] CFP: ASSURE 2013 Message-ID: <50D6F1BC.1070301@nasa.gov> [Type-based approaches to demonstrating assurance fall within the scope of the workshop] ****************************************************************** ASSURE 2013 The 1st International Workshop on Assurance Cases for Software-intensive Systems San Francisco, California, May 19, 2013 in conjunction with ICSE 2013 ------------------------------------------------------------------ http//www.cs.york.ac.uk/assure2013 ****************************************************************** Software plays a key role in high-risk systems, e.g., safety- and security-critical systems. Several certification standards/ guidelines now recommend and/or mandate the development of assurance cases for software-intensive systems, e.g., defense (UK MoD DS0056), aviation (CAP 670, FAA Interim Guidance 08-01), automotive (ISO 26262), and healthcare (FDA Guidance on Infusion Pumps 510(k)). As such, there is a need to understand and evaluate (a) the application of assurance cases to software, and (b) the relationship between assurance case development and assessment, and software engineering concepts, processes and techniques. The goals of the ASSURE 2013 workshop are to explore techniques for the creation and assessment of assurance cases for software- intensive systems; leverage, adapt and apply techniques, concepts, and tools from software engineering in the assurance case lifecycle; identify the dimensions of effective practice in the development and evaluation of assurance cases, and identify critical challenges and define a roadmap for future developments. We solicit high-quality research contributions and position papers on the application of assurance case principles and techniques for software assurance, and on the treatment of assurance cases as artifacts to which the full range of software engineering techniques can be applied. Papers should attempt to address the workshop goals in general. Topics of interest include, but are not limited to - Standards How can assurance cases be used to show compliance to standards that recommend/mandate their use? - Methodologies How do development and verification methodologies (including configuration management) transfer to an assurance case paradigm? - Use of output from software engineering tools (testing, formal verification, code generators) as evidence in assurance cases and use of software engineering tools for the modeling, analysis and management of assurance cases. - Application of formal techniques to the creation and analysis of arguments. - Exploring relevant techniques for assurance cases for real-time, concurrent, and distributed systems. - Assurance issues in emerging computational paradigms, e.g., cloud, mobile, virtual, many-core architectures, and adaptive and autonomous systems. - Representation of structured arguments through meta-models. - Assurance of software quality attributes, e.g., safety, security and maintainability as well as dependability in general; exploring notions of quality of assurance cases. - Domain-specific assurance issues, in domains such as aerospace, automotive, healthcare, defense and power. - Reuse and modularization contracts and patterns for improving the reuse of assurance case structures. - Connections between the Goal Structuring Notation for assurance cases and goal-orientation from the requirements engineering community. ------------------------------------------------------------------ Papers should conform to the formatting guidelines (http//2013.icse-conferences.org/content/submission-guidelines) and be no more than 6 pages long. Instructions for submission are available on ASSURE 2013 website (http//www.cs.york.ac.uk/assure2013). Accepted papers will be published in the ICSE 2013 electronic proceedings. Authors of best papers will be invited to submit extended versions for publication in an edited book. ****************************************************************** IMPORTANT DATES ------------------------------------------------------------------ Paper submission : February 7, 2013 Author notification : February 28, 2013 Camera ready copy due : March 7, 2013. Workshop : May 19, 2013. ****************************************************************** WORKSHOP CHAIRS ------------------------------------------------------------------ Ewen Denney SGT / NASA Ames Research Center, USA Ibrahim Habli University of York, UK Tim Kelly University of York, UK John Knight University of Virginia, USA Ganesh Pai SGT / NASA Ames Research Center, USA ****************************************************************** PROGRAM COMMITTEE ------------------------------------------------------------------ Robin Bloomfield CSR City University London, UK Luke Emmet Adelard, UK Richard Hawkins University of York, UK Kelly Hayhurst NASA Langley Research Center, USA Michael Holloway NASA Langley Research Center, USA Daniel Jackson MIT, USA Insup Lee University of Pennsylvania, USA Peter Lindsay University of Queensland, Australia Nikolai Mansourov KDM Analytics, USA Robert Martin MITRE, USA Yutaka Matsuno Nagoya University, Japan Roger Rivett Jaguar Land Rover, UK Christel Seguin ONERA, France Kenji Taguchi AIST, Japan Fredrik Toerner Volvo Car Corp. and Chalmers University, Sweden David Ward MIRA Ltd, UK Alan Wassyng McMaster University, Canada Robert Weaver AirServices Australia, Australia Charles Weinstock SEI, USA From pmt6sbc at maths.leeds.ac.uk Sun Dec 23 15:16:22 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Sun, 23 Dec 2012 20:16:22 GMT Subject: [TYPES/announce] TAMC 2013 in Hong Kong: Second Call for Papers Message-ID: <201212232016.qBNKGMfD023500@maths.leeds.ac.uk> =========================================================================== SECOND CALL FOR PAPERS: TAMC 2013 The 10th Annual Conference on Theory and Applications of Models of Computation Hong Kong, China, 20-22 May 2013 http://www.cs.hku.hk/tamc2013/ =========================================================================== The 10th Annual Conference on Theory and Application of Models of Computation (TAMC 2013 http://www.cs.hku.hk/tamc2013/) will be held in Hong Kong, China, from May 20 to May 22, 2013. TAMC aims at bringing together a wide range of researchers with interests in computational theory and applications. Hong Kong is situated on China's south coast and is famous for its skyline. Hong Kong was a colony of the British Empire until 1997 when it was returned to China. It now thrives under the principle of "one country, two systems", enjoying a high degree of authority and independent judiciary. Hong Kong is often described as "East meets West" and is one of the world's leading international financial centers. Come and visit Asia's vibrant world city (www.discoverhongkong.com/eng/index.jsp) and join the conference at the University of Hong Kong (according to 2012 QS World University Rankings HKU ranked 23rd in the world and 1st in Asia). The main themes of the conference are computability, complexity, and algorithms. Typical but not exclusive topics of interest include: algebraic computation algorithmic coding theory algorithmic number theory approximation algorithms automata theory circuit complexity computability theory computational biology, and biological computing computational complexity computational game theory computational logic computational geometry continuous and real computation cryptography data structures design and analysis of algorithms distributed algorithms fixed parameter tractability graph algorithms information and communication complexity learning theory natural computation network algorithms, networks in nature and society online algorithms optimization parallel algorithms privacy and security property testing proof complexity quantum computing randomness, pseudo-randomness randomized algorithms streaming algorithms IMPORTANT DATES - Submission deadline : 11:59 pm EST January 11, 2013 Notification of authors : February 22, 2013 Final versions deadline : March 8, 2013 Submission page: https://www.easychair.org/conferences/?conf=tamc2013. Conference Chair: Francis Chin (The University of Hong Kong) Program Chair: Lap Chi Lau (The Chinese University of Hong Kong) Luca Trevisan (Stanford University) Program Committee: Andrej Bogdanov (The Chinese University of Hong Kong) Hubert Chan (University of Hong Kong) Ho-Lin Chen (National Taiwan University) Jianer Chen (Texas A&M University) Ning Chen (Nanyang Technological University) Wei Chen (Microsoft Research Asia) Xi Chen (Columbia University) Francis Chin (The University of Hong Kong, Chair) Marek Chrobak (UC Riverside) Nicola Galesi (Universita di Roma La Sapienza) Naveen Garg (IIT Dehli) Navin Goyal (Microsoft Research India) Nick Harvey (University of British Columbia) Rahul Jain (National University of Singapore) David Jao (University of Waterloo) Ken-ichi Kawarabayashi (National Institute of Informatics, Japan) Jochen Konemann (University of Waterloo) Amit Kumar (IIT Delhi) Lap Chi Lau (The Chinese University of Hong Kong, Co-chair) Jian Li (Tsinghua University) Rachel Lin (MIT and The Chinese University of Hong Kong) Pinyan Lu (Microsoft Research Asia) Mohammad Mahdian (Google Research) Seffi Naor (Technion University) Krzysztof Onak (IBM Research) Periklis Papakonstantinou (Tsinghua University) Seth Pettie (University of Michigan) Atri Rudra (University at Buffalo, The State University of New York) Alexander Russell (University of Connecticut) Piotr Sankowski (University of Warsaw) Rahul Santhanam (University of Edinburgh) Anastasios Sidiropoulos (UIUC) Mohit Singh (Microsoft Research Redmond) Man Cho Anthony So (The Chinese University of Hong Kong) John Steinberger (Tsinghua University) Luca Trevisan (Stanford University, Co-chair) Laszlo Vegh (London School of Economics) David Woodruff (IBM Research) Ke Yi (Hong Kong University of Science and Technology) Qin Zhang (IBM Research and Indiana University) Submission instructions: * Authors should submit an extended abstract (not a full paper), online at: https://www.easychair.org/conferences/?conf=tamc2013 * The submission should contain a scholarly exposition of ideas, techniques, and results, including motivation and a clear comparison with related work. * The length of the extended abstract should not exceed ten (10) letter-sized pages (not including bibliography and appendices.) * Submitted papers must describe work not previously published. They must not be submitted simultaneously to another conference with refereed proceedings. * Research that is already submitted to a journal may be submitted to TAMC13, provided that (a) the PC chair is notified in advance that this is the case, and (b) it is not scheduled for journal publication before the conference. Proceedings: The TAMC proceedings will be published in the Lecture Notes in Computer Science Series by Springer (http://www.springer.com/lncs). Authors of accepted papers are expected to present their work at the conference. Special issues of the leading journals 'Theoretical Computer Science' and 'Mathematical Structures in Computer Science', devoted to a selected set of accepted papers of the conference, are planned. Steering Committee: Manindra Agrawal (Indian Institute of Technology, Kanpur, India) Jin-Yi Cai (University of Wisconsin - Madison, USA) S. Barry Cooper (University of Leeds, Leeds, UK) John Hopcroft (Cornell University) Angsheng Li (Chinese Academy of Sciences) Local Organising Committee: Hubert Chan, H.F. Ting, Zhang Yong =========================================================================== Contact: tamc at cs.hku.hk =========================================================================== From pmt6sbc at maths.leeds.ac.uk Sun Dec 23 16:44:17 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Sun, 23 Dec 2012 21:44:17 GMT Subject: [TYPES/announce] CiE 2013 in Milan - Special Awards and Call for Papers Message-ID: <201212232144.qBNLiHqF005167@maths.leeds.ac.uk> ************************************************************************ CiE13 CALL FOR PAPERS AND SPECIAL AWARDS: CiE 2013: The Nature of Computation: Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, biology, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. AWARDS: Springer-Verlag has graciously funded two awards that will be given during the CiE 2013 Conference. Best student paper: This prize will be awarded for the best student paper presented at CiE 2013, as judged by the Program Committee. A prize of 500 euros will be given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). In order to be considered, a paper has to be submitted in the category 'Regular paper (eligible for best student paper award)' on EasyChair. Papers are eligible if all of its authors are full-time students at the time of submission. Best paper on Natural Computing: The prize consists of the four volumes of the Handbook of Natural Computing (see http://cie2013.disco.unimib.it/awards/). This prize will be awarded to the best paper on Natural Computing presented at CiE 2013, as judged by the Program Committee. A paper is eligible if its main topic falls within the scope of Natural Computing, roughly defined as the set of fields studied in the above handbook. The Program Committee is the only judge of the relevance of a paper within the Natural Computing scope. The authors of a paper eligible for the award must indicate this in the submission notes. INVITED SPEAKERS Ulle Endriss (University of Amsterdam) Lance Fortnow (Georgia Institute of Technology) Anna Karlin (University of Washington) Bernard Moret (Ecole Polytechnique Federale de Lausanne) Mariya Soskova (Sofia University) Endre Szemeredi (Hungarian Academy of Sciences, Rutgers University) TUTORIAL SPEAKERS Gilles Brassard (Universite de Montreal) Grzegorz Rozenberg (Leiden Institute of Advanced Computer Science and University of Colorado at Boulder) SPECIAL SESSIONS on Algorithmic Randomness organizers: Mathieu Hoyrup, Andre Nies Data Streams and Compression organizers: Paolo Ferragina, Andrew McGregor Computational Complexity in the Continuous World organizers: Akitoshi Kawamura, Robert Rettinger Computational Molecular Biology organizers: Alessandra Carbone, Jens Stoye Computation in Nature organizers: Mark Delay, Natasha Jonoska History of Computation organizers: Gerard Alberts, Liesbeth De Mol PROGRAM COMMITTEE: * Gerard Alberts (Amsterdam) * Luis Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * S Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans) * Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) 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 using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it ************************************************************************ From dpw at cs.princeton.edu Wed Dec 26 14:24:16 2012 From: dpw at cs.princeton.edu (David Walker) Date: Wed, 26 Dec 2012 14:24:16 -0500 (EST) Subject: [TYPES/announce] Off the Beaten Track @ POPL 2013: Call for Participation In-Reply-To: Message-ID: <3f5af142-09f8-4f07-b2f0-3e5d0541bee4@suckerpunch-mbx-0.CS.Princeton.EDU> **************************************************** * Off The Beaten Track 2013 * * New Frontiers for Programming Languages Research * * Call for Participation * * * * January 26 * * Rome, Italy * * Co-located with POPL 2013 * * http://goto.ucsd.edu/~rjhala/OBT2013/index.html * **************************************************** Register to participate via the POPL 2013 registration process: http://popl.mpi-sws.org/2013/ Programming language researchers have the principles, tools, algorithms and abstractions to solve all kinds of problems, in all areas of computer science. However, identifying and evaluating new problems, particularly those that lie outside the typical core PL problems we all know and love, can be a significant challenge. Hence, the goal of this workshop is to identify and discuss problems that do not often show up in our top conferences, but where programming language researchers can make a substantial impact. The hope is that by holding such a forum and associating it directly with a top conference like POPL, we can slowly start to increase the diversity of problems that are studied by PL researchers and that by doing so we will increase the impact that our community has on the world. Invited Lectures: Andrew Gordon (MSR) Probabilistic Programming Michael Walfish (UT Austin) Making proof-based verified computation almost practical: progress and next steps (not our usual verification techniques --> verification of remote computation using probabilistically checkable proofs!) Contributed Presentations: Suresh Jagannathan & Jan Vitek (Purdue) Tilting at Windmills Harry Mairson (Brandeis) Trait? de lutherie, informatis? Thomas Ball, Peli de Halleux, Daan Leijen and Nikhil Swamy (MSR) Increasing Human Compiler Interaction Aquinas Hobor, Lin Myat Soe and Bimlesh Wadhwa (NUS) VisualizeSLE: A Visual Editor for Separation Logic Entailments Andy Gordon, Aditya Nori and Sriram Rajamani (MSR) Probabilistic Inference Using Program Analysis Umut Acar, Ezgi Cicek and Deepak Garg (CMU & MPI-SWS) Language Support for Efficient Dynamic Computation Ken Eguro, Kaushik Rajan, Ravi Ramamurthy, Kapil Vaswani and Ramarathnam Venkatesan (MSR) Migration to the Cloud made Safe and Secure Arvind Sujeeth et al. (Stanford & EPFL) Crossing the Software-Hardware Chasm With DSLs Yu David Liu (SUNY Binghamton) Tempo Support in Programming Languages Saurabh Srivastava et al. (UC Berkeley) Biochemistry as a Programming Language Benjamin Hall, Ethan Jackson and Jasmin Fisher (MSR) Fast Analysis of Biological Models Using Open-World Logic Programming From ronchi at di.unito.it Thu Dec 27 06:50:44 2012 From: ronchi at di.unito.it (Simona Ronchi della Rocca) Date: Thu, 27 Dec 2012 12:50:44 +0100 Subject: [TYPES/announce] DICE 2013 last call for papers Message-ID: <568474A3-1333-4A75-A31C-D47F4AE4325E@di.unito.it> ???????????????????????????????? DICE 2013 ?????????????????????????????????? (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY) http://dice2013.di.unito.it/ Roma, March 16,17 2013 satellite event of ETAPS 2013 call for papers IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 INVITED: ? Jean-Yves Marion (Loria - INPL Nancy) ? Marko van Eekelen (Open University - Radboud University Nijmegen) ? Paul-Andr? Melli?s (PPS, Paris) SCOPE: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity-bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). SUBMISSIONS: Authors are invited to submit an extended abstract, up to 5 pages. Abstracts should be written in English, in the form of a PDF file uploaded to DICE 13 page at Easychair . Submissions of abstracts by PC members are allowed and encouraged. We plan on not having pre-proceedings. POST-PROCEEDINGS: An open call for post-proceedings, as special issue of INFORMATION & COMPUTATION will follow. PROGRAM COMMITTEE: ? Roberto Amadio (Paris-Diderot) ? Harry Mairson (Brandeis) ? Virgile Mogbil (Paris 13) ? Simona Ronchi Della Rocca (Torino) (Chair) ? Luca Roversi (Torino) ? Olha Shkaravska (Nijmegen) ? Ulrich Sch?pp (LMU) ? Aleksy Shubert (Warsaw) ? Jakob G. Simonsen (DIKU) STEERING COMMITTEE: ? Patrick Baillot (ENS Lyon, CNRS) ? Ugo Dal Lago (Universit? degli Studi di Bologna) ? Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) ? Jean-Yves Marion (Loria - INPL Nancy) ? Simona Ronchi Della Rocca (Universit? degli Studi di Torino)) ---------------------------------------- Simona Ronchi Della Rocca full Professor of "Foundations of Computer Science" Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : ronchi at di.unito.it phone: +39-011-6706734 fax : +39-011-751603 mobile: +39-320-4205121 http://www.di.unito.it/~ronchi -------------- next part -------------- An HTML attachment was scrubbed... URL: From hirokawa at jaist.ac.jp Thu Dec 27 08:35:48 2012 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Thu, 27 Dec 2012 22:35:48 +0900 Subject: [TYPES/announce] IWC 2013 & CoCo 2013: Call for Participation and Provers Message-ID: <20121227223548.8718ac322f24a7667bcc65bd@jaist.ac.jp> This is a joint call for papers and provers for IWC 2013 and CoCo 2013. ====================================================================== First Call for Papers IWC 2013 2nd International Workshop on Confluence 28 June 2013, Eindhoven, The Netherlands collocated with RDP 2013 http://www.jaist.ac.jp/~hirokawa/iwc2013/ ====================================================================== Recently there is a renewed interest in confluence research, resulting in new techniques, tool support as well as new applications. The workshop aims at promoting further research in confluence and related properties. The workshop is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013). During the workshop the 2nd Confluence Competition (CoCo 2013) takes place. IMPORTANT DATES: * submission April 15, 2013 * notification May 10, 2013 * final version June 3, 2013 * workshop June 28, 2013 TOPICS: The workshop solicits short papers/extended abstracts on the following topics: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Jan Willem Klop (Vrije Universiteit) joint invited speaker for IWC 2013 and WIR 2013 * tba PROGRAM COMMITTEE: * Guillem Godoy Technical University of Catalonia * Nao Hirokawa JAIST (co-chair) * Barbara Koenig Universitaet Duisburg-Essen * Vincent van Oostrom Utrecht University (co-chair) * Michio Oyamaguchi Nagoya University * Harald Zankl University of Innsbruck * Hans Zantema Eindhoven University of Technology SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Submission will be via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2013 ====================================================================== First Call for Provers CoCo 2013 2nd Confluence Competition http://coco.nue.riec.tohoku.ac.jp/2013/ ====================================================================== Recently, several new implementations of confluence tools are reported and interest for proving/disproving confluence "automatically" has been grown. The confluence competition aims to foster the development of techniques for proving/disproving confluence automatically by a dedicated competition among such tools. The 2nd Confluence Competition (CoCo 2013) will run ***live*** during the 2nd International Workshop on Confluence (IWC 2013), which is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013) in Eindhoven, The Netherlands. In this competition categories for * first-order term rewrite systems * certification will be run. Other categories will be considered if there are tools and problems. In particular we are seeking for tools for first-order conditional rewrite sysetems. The problems considered for CoCo 2013 are selected from Cops, a collection of confluence problems. Problems submitted after the problem selection deadline will not be considered for the competition. IMPORTANT DATES: * requests for new categories March 1, 2013 * announcement of execution platform April 1, 2013 * tool registration June 10, 2013 * tool submission June 20, 2013 * problem selection June 25, 2013 * competition June 28, 2013 REGISTRATION/SUBMISSION: Registration and tool submission will be via the email address: coco-sc [AT] jaist.ac.jp Every tool submission should also contain a one page system description highlighting the distinctive features of the prover. For more information including competition rules and confluence problems, see http://coco.nue.riec.tohoku.ac.jp/ ORGANISING COMMITTEE: * Takahito Aoto Tohoku University * Nao Hirokawa JAIST * Harald Zankl University of Innsbruck (chair) From eernst at cs.au.dk Sat Dec 29 21:00:47 2012 From: eernst at cs.au.dk (Erik Ernst) Date: Sun, 30 Dec 2012 02:00:47 +0000 Subject: [TYPES/announce] CFP: (Last Call) FOAL 2013 - Foundations of Aspect-Oriented Languages Message-ID: <5236AF453495154F9AF8B307F6783A5F0119E7A0@SRVUNIMBX06.uni.au.dk> [Apologies if you receive multiple copies of this CFP] *** CALL FOR PAPERS: Foundations of Aspect-Oriented Languages *** *** Papers are due January 7, 2013, at 23:00 GMT *** FOAL is a one day workshop affiliated with MODULARITY: aosd 2013 conference in the Fukuoka International Congress Center, Japan, on March 26, 2013. Themes and Goals FOAL is a forum for research in foundations of aspect-oriented and other advanced separation of concern mechanisms. Areas of interest include but are not limited to: * Semantics of advanced separation of concern mechanisms * Specification and verification for languages with such mechanisms * Type systems * Static analysis * Theory of testing * Theory of composition * Theory of translation (compilation) and rewriting * Comparison of different advanced modularization and separation of concern mechanisms The workshop aims to foster work in foundations, including formal studies, promote the exchange of ideas, and encourage workers in the semantics and formal methods communities to consider advanced separation of concern mechanisms. All theoretical and foundational studies of this topic are welcome. Even though the workshop title contains the term "aspect-oriented", the workshop is not limited to aspect-oriented programming languages, but welcomes topics on other advanced separation of concern mechanisms such as feature-oriented or context-oriented programming. The goals of FOAL are to: * Make progress on the foundations of aspect-oriented and other advanced separation of concern mechanisms. * Exchange ideas about semantics and formal methods for aspect-oriented and other languages with advanced separation of concerns. * Foster interest within the programming language theory and types communities in languages with advanced separation of concerns. * Foster interest within the formal methods community in aspect-oriented programming and other advanced separation of concern mechanisms, and the problems of reasoning about them. Workshop Format The planned workshop format is primarily presentation of papers and group discussion. Talks will come in two categories: regular (25 minutes plus 5 minutes of discussion) and short (7 minutes plus 3 minutes of discussion). The short talks will allow for presentations of topics for which results are not yet available, perhaps for researchers who are seeking feedback on ideas or seek collaborations. We also plan to ensure sufficient time for discussion of each presentation by limiting the overall number of talks. Submissions Invitation to the workshop will be based on papers selected by the program committee; those wishing to attend but not having a paper to submit should contact the organizers directly to see if there is sufficient space in the workshop. FOAL solicits regular and short papers on all areas of formal foundations of advanced separation of concern mechanisms. Submissions will be read by the program committee and designated reviewers. Papers will be selected for regular and short presentation at the workshop based on their length, scientific merit, innovation, readability, and relevance. Papers previously published or already being reviewed by another conference are not eligible. Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than their paper length would otherwise command. We will limit the length of paper presentations and the number of papers presented to make sure that there is enough time for discussion. Five page papers presented at the workshop can be included in the ACM Digital Library, at the discretion of the authors. Authors of accepted papers who wish to have their papers in the ACM Digital Library will be asked to transfer copyright to the ACM. However, as FOAL is a workshop, publication of extended versions of the papers in other venues will remain possible. We will also investigate having a special issue of a journal for revisions of selected papers after the workshop. Authors should note the following details: * Submissions are due no later than 23:00 GMT, 7 January 2013 * Regular papers must not exceed 5 pages in length, and short papers must not exceed 3 pages in length * We encourage use of the ACM Conference format for submissions, as this will be required for accepted papers * You must add page numbers (which are not part of the standard format) to your submissions, to make adding comments easier * Submissions are to be made at the following URL: https://www.easychair.org/conferences/?conf=foal2013 We will notify the corresponding author of papers that are selected for presentation at the workshop by 28 January 2013. Early registration for MODULARITY: aosd (you must register for the conference to attend the workshop) shortly follows that date. Final versions of 5 page papers for the ACM digital library will be due on 4 February 2013. For more information, please visit the FOAL Workshop home page (at http://www.eecs.ucf.edu/FOAL). Important Dates Paper Submission Deadline - January 7, 2013, 23:00 GMT Notification of Acceptance - January 28, 2013 Final version and 5 page version due - February 4, 2013 Workshop - March 26, 2013 Program Committee * Erik Ernst (Program Committee Chair) -- University of Aarhus * Sven Apel -- University of Passau * Don Batory -- University of Texas, Austin * Eric Bodden -- European Center for Security and Privacy by Design, Center for Advanced Security Research Darmstadt * John Tang Boyland -- University of Wisconsin, Milwaukee * Sophia Drossopoulou -- Imperial College * Matthew Flatt -- University of Utah * Atsushi Igarashi -- Kyoto University * Radha Jagadeesan -- DePaul University * Todd Millstein -- University of California, Los Angeles * Bruno C. d. S. Oliveira -- National University of Singapore * Klaus Ostermann -- University of Marburg * Nicolas Tabareau -- Ecole des Mines de Nantes / INRIA * Elena Zucca -- University of Genoa Organizers * Gary T. Leavens -- University of Central Florida * Hidehiko Masuhara -- University of Tokyo * Hridesh Rajan -- Iowa State University * Mario Sudholt -- Ecole des Mines de Nantes -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From dreyer at mpi-sws.org Sun Dec 30 05:48:03 2012 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Sun, 30 Dec 2012 11:48:03 +0100 Subject: [TYPES/announce] New SIGPLAN "awards nomination portal" + Important information on eligibility requirement for Milner Award Message-ID: Dear colleagues, We are pleased to announce that ACM SIGPLAN has launched a new "awards nomination portal" at http://awards.sigplan.org where you can use a web form to submit nominations for the Achievement Award, the Software Award, and the Robin Milner Young Researcher Award. The deadline for all these awards is January 5. We request that you submit nominations through the website if possible. (If you have already submitted a nomination by e-mail to secretary_sigplan at acm.org and received a confirmation of it, then you do not need to resubmit your nomination through the website, although you are encouraged to.) Any questions about the award nomination process may be directed to the respective award e-mail addresses: SIGPLAN Programming Languages Achievement Award SIGPLAN Programming Languages Software Award SIGPLAN Robin Milner Young Researcher Award One point of note concerning the Milner award: - Several people have inquired about eligibility for this award, because it seems the eligibility requirement (http://www.sigplan.org/Awards/Milner/Description) is confusingly worded. The intention of the award description was that, for the 2013 award, individuals are eligible whose computer-related professional career (graduate school or full-time employment, whichever began first) started no earlier than January 1, 1993. However, the award description as written can also be reasonably interpreted to mean that, so long as the *nomination* is submitted by the end of this calendar year (December 31, 2012), the candidate is eligible so long as their professional career started no earlier than January 1, 1992. Therefore, for this year, the SIGPLAN Executive Committee has decided to accept the latter, more liberal interpretation of the requirement. In the next year, the SIGPLAN EC will work to revise and clarify the eligibility requirement. We apologize for any confusion. If you have any further questions regarding eligibility, please direct them to milner_award at sigplan.org. Best regards, Derek Dreyer (on behalf of the SIGPLAN EC) From bmuller at glam.ac.uk Mon Dec 31 04:33:33 2012 From: bmuller at glam.ac.uk (Muller B (AT)) Date: Mon, 31 Dec 2012 09:33:33 +0000 Subject: [TYPES/announce] LAM'13 - Call for Abstracts/Papers - Logics, Agents, and Mobility Message-ID: <8F14B363-F952-4DC3-8ABE-BBA7B348FF72@glam.ac.uk> *** 3nd CALL FOR PAPERS *** 6th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM?13), 5 April 2013, University of Exeter, United Kingdom organised as symposium at the AISB Annual Convention 2013 (http://emps.exeter.ac.uk/computer-science/research/aisb/) * Important Submission Information * Please submit your extended abstract by 14th January 2013. You will be notified of acceptance/rejection by 11 February 2013. The full version of your papers is then due by 4 March 2013. Organisers: Berndt ?Bertie? M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://lam2013.wordpress.com * Workshop Purpose * The aim of this series of workshops is to bring together active researchers in the areas of logics and other formal frameworks on the one hand, and mobile systems on the other hand. The main focus is on the field of applications of logics and calculi for mobile agents, smart intelligent solutions and multi-agent systems. Many notions used in the theory of agents are derived from philosophy, logic, and linguistics (belief, desire, intention, speech act, etc.), and interdisciplinary discourse has proved fruitful for the advance of this domain. Outside of academia, the deployment of large-scale pervasive infrastructures (mobile ad-hoc networks, mobile devices, RFIDs, etc.) is becoming a reality. This raises a number of scientific and technological challenges for the software modelling and programming models for such large-scale, open and highly-dynamic distributed systems. The agent and multi-agent systems approach seems particularly adapted to tackle this challenge, but there are many issues remaining to be investigated. For instance, the agents must be location-aware since the actual services available to them may depend on their (physical or virtual) location. The quality and quantity of resources at their disposal is also largely fluctuant, and the agents must be able to adapt to such highly dynamic environments. Moreover, mobility itself raises a large number of difficult issues related to safety and security, which require the ability to reason about the software (e.g. for analysis or verification). Logics and type systems with temporal or other kinds of modalities (relating to location, resource and/or security-awareness) play a central role in the semantic characterisation and then verification of properties about mobile agent systems. There are still many open problems and research questions in the theory of such systems. The workshop is intended to showcase results and current work being undertaken in these areas with a focus on logics for specification and verification of dynamic, mobile systems. The topics of interest lie in the area of logics and concurrent systems with a focus on the special application domain of mobile systems and (multi-)agent-based systems, such as: * Applications of logics and/or multi-agent systems * Smart/intelligent solutions * Models of concurrency * Models of resource-bounded systems * Models of location-based reasoning * Logics for concurrency with a perspective on mobility * Models of mobile systems * Verification and analysis techniques * Related programming models Scopes of Interest * applications of MAS * logics for specification and reasoning about agents, MAS, and mobile systems * treatment of location and resources in logics * security (e.g., in ad-hoc networks) * temporal logics and model checking * type systems and static analysis * logic programming * concurrency theory with a focus on mobility or dynamics in agent systems. * Previous Workshops * LAM?08: 4?8 August 2008 at ESSLI in Hamburg, Germany LAM?09: 10 August 2009 at LICS in Los Angeles, USA LAM?10: 15 July 2010 at LICS in Edinburgh, Scotland, UK LAM?11: 10 September 2011 at CONCUR in Aachen, Germany LAM?12: 25 June 2012 at Petri Nets 2012, Hamburg, Germany * Format of the Workshop * The workshop will be held as a one day of the convention. There will be a short introduction and brief survey of the field by the organisers as an introduction to the workshop. The workshop will contain invited talks, contributed talks, and will offer opportunities for discussion. The latter will give the participants a chance to discuss informally research directions, open problems, and possible co-operations. * Invited Speakers * [To be announced.] * Submission details * Authors are invited to submit an extended abstract (about 2 pages) or a full paper of original work in the areas mentioned above. The workshop chair should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper will be expected to present it at the LAM?13 workshop. Full papers should not exceed 15 pages, preferably using the LaTeX article or LNCSS class. The following formats are accepted: PDF, PS. Please send your submission electronically via EasyChair: http://www.easychair.org/conferences/?conf=lam13 The submissions will be reviewed by the workshop?s program committee and additional reviewers. Accepted papers will appear in electronic proceedings and authors will be encouraged to re-submit papers to formal proceedings to be published as a separate publication, e.g. as a special journal issue. * Important Dates * Abstract Submission Deadline: 14th January 2013 Notification of acceptance/rejection: 11 February 2013 Final version of full papers due: 4 March 2013 Workshop: at AISB 2013, 5 April 2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: