From carlos.martin at urv.cat Sun Jan 2 10:18:59 2011 From: carlos.martin at urv.cat (carlos.martin at urv.cat) Date: Sun, 02 Jan 2011 16:18:59 +0100 Subject: [TYPES/announce] LATA 2011: deadline extended Message-ID: ********************************************************************* Final Call for Papers 5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011) Tarragona, Spain, May 30 ? June 3, 2011 http://grammars.grlmc.com/LATA2011/ ********************************************************************* --- Extended deadline: January 9, 2011, 23:59h (Western Europe time) --- AIMS: LATA is a yearly conference in theoretical computer science and its applications. Inheriting the tradition of the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University in the period 2002-2006, LATA 2011 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - neural networks - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - term rewriting - transducers - trees, tree languages and tree machines - weighted machines STRUCTURE: LATA 2011 will consist of: - 3 invited talks - 2 invited tutorials - peer-reviewed contributions - open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants) INVITED SPEAKERS: Thomas Colcombet (Paris), Green's Relations and Their Use in Automata Bakhadyr Khoussainov (Auckland), Automaticity (tutorial) Kevin Knight (Marina del Rey), Automata for Deciphering Natural Language J?rome L?roux (Bordeaux), Vector Addition System Reachability Problem: A Short Self-Contained Proof (tutorial) Narad Rampersad (Li?ge), Abstract Numeration Systems PROGRAMME COMMITTEE: Andrew Adamatzky (Bristol) Cyril Allauzen (New York) Amihood Amir (Ramat-Gan) Franz Baader (Dresden) Marie-Pierre B?al (Marne-la-Vall?e) Philip Bille (Lyngby) Mikl?s B?na (Gainesville) Symeon Bozapalidis (Thessaloniki) Vasco Brattka (Cape Town) Maxime Crochemore (London) James Currie (Winnipeg) J?rgen Dassow (Magdeburg) Cunsheng Ding (Hong Kong) Rodney Downey (Wellington) Manfred Droste (Leipzig) Enrico Formenti (Nice) Amy Glen (Perth) Serge Haddad (Cachan) Shunsuke Inenaga (Fukuoka, co-chair) Jesper Jansson (Tokyo) Jarkko Kari (Turku) Marek Karpinski (Bonn) Maciej Koutny (Newcastle) Gregory Kucherov (Lille) Markus Lohrey (Leipzig) Benedikt L?we (Amsterdam) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n-Vide (Tarragona & Brussels, co-chair) Giancarlo Mauri (Milano) Alexander Meduna (Brno) Kenichi Morita (Hiroshima) Sven Naumann (Trier) Gonzalo Navarro (Santiago, CL) Mark-Jan Nederhof (St Andrews) Joachim Niehren (Lille) Joakim Nivre (Uppsala) Kemal Oflazer (Doha) Alexander Okhotin (Turku) Witold Pedrycz (Edmonton) Dominique Perrin (Marne-la-Vall?e) Giovanni Pighizzini (Milano) Alberto Policriti (Udine) Lech Polkowski (Warsaw) Helmut Prodinger (Stellenbosch) Mathieu Raffinot (Paris) Philippe Schnoebelen (Cachan) Ayumi Shinohara (Sendai) Jamie Simpson (Perth) Magnus Steinby (Turku) James Storer (Boston) Jens Stoye (Bielefeld) Andrzej Tarlecki (Warsaw) Richard Thomas (Leicester) Gy?rgy Vaszil (Budapest) Heiko Vogler (Dresden) Pascal Weil (Bordeaux) Damien Woods (Pasadena) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Adrian Horia Dediu (Tarragona) Shunsuke Inenaga (Fukuoka, co-chair) Carlos Mart?n-Vide (Tarragona & Brussels, co-chair) Bianca Truthe (Magdeburg) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2011 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since October 13, 2010 until May 30, 2011. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2011/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On-site registration fees: 580 Euro On-site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by February 28, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before February 28, 2011 (resp. May 16, 2011) to the conference series account at Uno-e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide ? LATA 2011). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. Please notice that the date that counts is the day when the transfer reached the conference?s account. On-site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: January 9, 2011 (23:59h, Western Europe time) Notification of paper acceptance or rejection: February 14, 2011 Early registration: February 28, 2011 Final version of the paper for the LNCS proceedings: February 28, 2011 Late registration: May 16, 2011 Starting of the conference: May 30, 2011 Submission to the post-conference special issue: August 30, 2011 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From Alex.Simpson at ed.ac.uk Mon Jan 3 06:44:58 2011 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Mon, 03 Jan 2011 11:44:58 +0000 Subject: [TYPES/announce] European Workshop on Computational Effects Message-ID: <20110103114458.91491lm56yngmcw0@www.staffmail.ed.ac.uk> EUROPEAN WORKSHOP ON COMPUTATIONAL EFFECTS Thursday 17th and Friday 18th March 2011, Ljubljana, Slovenia. http://ewce.fmf.uni-lj.si/ ANNOUNCEMENT AND CALL FOR CONTRIBUTED TALKS The aim of the workshop is to bring together researchers investigating computational effects from a variety of different angles: programming languages, type theory, operational semantics, universal algebra, category theory, denotational semantics, etc. CONTRIBUTED TALKS A limited number of slots are available for contributed talks. Please submit a title and short text abstract by email to Alex.Simpson at ed.ac.uk by the deadline of Thursday 27th January 2011. Notification of acceptance will be by Monday 7th February 2011. INVITED SPEAKERS Nick Benton, Microsoft Research, Cambridge Andrzej Filinski, Copenhagen University Ohad Kammar, University of Edinburgh Paul Blain Levy, University of Birmingham Paul-Andre Mellies, Paris 7 Rasmus Ejlers M?gelberg, IT University of Copenhagen Eugenio Moggi, University of Genova Gordon Plotkin, University of Edinburgh John Power*, University of Bath Matija Pretnar, University of Ljubljana Sam Staton*, University of Cambridge Janis Voigtlaender*, University of Bonn *to be confirmed ORGANISING COMMITTEE Andrej Bauer, University of Ljubljana Matija Pretnar, University of Ljubljana Alex Simpson, University of Edinburgh -- 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 noam.zeilberger at gmail.com Mon Jan 3 14:49:14 2011 From: noam.zeilberger at gmail.com (Noam Zeilberger) Date: Mon, 3 Jan 2011 20:49:14 +0100 Subject: [TYPES/announce] CFP: Workshop on Theory and Practice of Delimited Continuations Message-ID: Call for Papers TPDC 2011 1st International Workshop on Theory and Practice of Delimited Continuations http://www.pps.jussieu.fr/~saurin/tpdc2011/ 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop - Federated Conference on Rewriting, Deduction, and Programming SCOPE AND TOPIC: Since their introduction in the late 1980s, delimited control operators have triggered increasing interest among programmers and the programming language community, found unexpected applications in conceptual domains such as linguistics and constructive mathematics, and shown themselves to be the natural development of classical control operators. The first workshop on the Theory and Practice of Delimited Continuations aims to bring together people working with the many different (practical, theoretical, or foundational) aspects of delimited continuations, in the hope of fostering some unity and progress. Contributions on all topics related to delimited continuations are welcome, as either short abstracts or full papers (see SUBMISSION PROCEDURE below). INVITED SPEAKERS: To be announced IMPORTANT DATES: # Submission of full papers: 25 February 2011 # Submission of short abstracts: 18 March 2011 # Notification of acceptance: 25 March 2011 # Final version due: 8 April 2011 # Workshop: 29-30 May 2011 SUBMISSION PROCEDURE: We accept submissions of two kinds: * short abstracts (1 to 2 pages) * full papers up to 12 pages Short abstracts are proposals for talks within a wide rubric: reports on work-in-progress or recently published papers, surveys or short tutorials, system demonstrations, etc. Full papers must describe new work not under consideration for publication elsewhere. Accepted papers and abstracts will be presented at the workshop and included in the proceedings, published as a technical report. Papers and abstracts should be formatted using the easychair.cls LaTeX class (see http://easychair.org/coolnews.cgi), and may be submitted electronically as pdf files via the easychair website: https://www.easychair.org/login.cgi?conf=tpdc2011 PROGRAM COMMITTEE: To be announced WORKSHOP ORGANIZERS: Hugo Herbelin, INRIA, Paris, France Alexis Saurin, CNRS, Paris, France Noam Zeilberger, Universit?? Paris Diderot, Paris, France For more information, please contact Alexis Saurin or Noam Zeilberger From simonpj at microsoft.com Tue Jan 4 08:06:08 2011 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Tue, 4 Jan 2011 13:06:08 +0000 Subject: [TYPES/announce] CFP: Workshop on Intermediate Representations: deadline Jan 21 Message-ID: <59543203684B2244980D7E4057D5FBC11F1E86C8@DB3EX14MBXC308.europe.corp.microsoft.com> Friends Happy new year! I'm on the PC for Workshop on Intermediate Representations; do consider submitting a paper. Simon WIR 2011: Workshop on Intermediate Representations 2011 http://researchr.org/conference/wir-2011 The intermediate representation is the core of any program transformation tool. Its design has a significant impact on the simplicity, efficiency, and effectiveness of program transformations. The developments in concurrent programming, integrated development environments, and domain-specific languages pose new requirements on intermediate representations. This workshop provides a forum to discuss current trends and experiences in the design, implementation, and application of intermediate representations. Co-located with CGO 2011 Conference Dates Submissions: January 21, 2011 Notification: February 25, 2011 Event: April 2, 2011-April 2, 2011 -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.wrigstad at it.uu.se Tue Jan 4 11:58:30 2011 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Tue, 4 Jan 2011 17:58:30 +0100 Subject: [TYPES/announce] Call for Participation: STOP'11 Message-ID: Call for Participation Scripts to Programs (STOP) Jan 29th, 2011, Austin, TX http://wrigstad.com/stop11/ Please come join us at STOP (a workshop at POPL). See below for an introduction to the workshop and the program. Workshop Program ---------------- Invited talk: by John Field Pluggable Type System with Optional Runtime Monitoring of Type Errors by Jukka Lehtosalo and David J. Greaves Gradual Information Flow Typing by Tim Disney, Cormac Flanagan Type Inference with Run-time Logs by Ravi Chugh, Ranjit Jhala, Sorin Lerner Position Paper: Dynamically Inferred Types for Dynamic Languages by Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. Foster, and Michael Hicks The Ciao Approach to the Dynamic vs. Static Language Dilemma by Manuel Hermenegildo Workshop 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. To this end, we encourage not only submissions presenting original research results, but also papers that attempt to establish links between different approaches and/or papers that include survey material, experience reports and tool demonstrations. Original research results should be clearly described, and their usefulness to practitioners outlined. Paper selection will be based on the quality of the submitted material, including surveys. Programme Committee ------------------- Amal Ahmed, Indiana Robby Findler, Northwestern (chair) Fritz Henglein, DIKU Gavin Bierman, Microsoft Gilad Bracha, Cloud Programming Model Jeff Foster, Maryland Peter Thiemann, Freiburg Sam Tobin-Hochstadt, Northeastern Organizers ---------- Jan Vitek, Purdue Tobias Wrigstad, Uppsala Steering Committee ------------------ Matthias Felleisen, Northeastern Cormac Flanagan, UC Santa Cruz Nate Nystrom, UTA Jan Vitek, Purdue Philip Wadler, Edinburg Tobias Wrigstad, Uppsala Questions may be directed to Tobias Wrigstad (tobias.wrigstad@ it.uu.se) and Robby Findler (robby at eecs.northwestern.edu). From ekitzelmann at gmail.com Tue Jan 4 23:25:18 2011 From: ekitzelmann at gmail.com (Emanuel Kitzelmann) Date: Tue, 4 Jan 2011 20:25:18 -0800 Subject: [TYPES/announce] CfP: 4th Workshop on Approaches and Applications of Inductive Programming (AAIP 2011) Message-ID: 4th International Workshop on Approaches and Applications of Inductive Programming (AAIP 2011) co-located with the International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2011) and the International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011). July 19, 2011, Odense, Denmark http://www.cogsys.wiai.uni-bamberg.de/aaip11/ CALL FOR PAPERS Inductive program synthesis or inductive programming (IP) is concerned with the automated generation of general computer programs from incomplete specifications such as input/output examples. IP particularly includes the synthesis of programs that contain loops or recursive calls. This inductive type of automated program synthesis is addressed by researchers in different fields such as artificial intelligence, inductive logic programming, evolutionary computation, symbolic computation, grammar inference, formal methods, and functional programming. The aim of the AAIP workshop is to have a common place to present and discuss research on all aspects of inductive programming - including, but not limited to: Inductive programming algorithms, techniques, and systems, heuristics, inductive biases, analysis of the learnability of particular program classes, and the combination of generate-and-test based and analytical techniques. We especially encourage submissions on inductive programming challenge problems and real-world applications of inductive programming in, e.g., computer-assisted software engineering, end-user programming, and intelligent agents. This is the fourth workshop on "Approaches and Applications of Inductive Programming" and takes place for the first time in conjunction with PPDP and LOPSTR. We invite authors to submit papers reporting on original work in either of two categories: full technical papers and short papers. Full papers should present mature work. Short papers may be work in progress reports, descriptions of system demonstrations, or position statements. INVITED TALKS TBA PRESENTATION AND PUBLICATION INFORMATION All accepted papers will be presented orally. Workshop (pre-)proceedings will be published online and as a technical report. Furthermore, we plan to publish selected and revised papers as a post-proceedings volume and sent a corresponding request to Springer LNCS. SUBMISSION GUIDELINES Submitted papers must describe original work, be written in English and should be formatted in the Springer Lecture Notes in Computer Science style: http://www.springer.de/comp/lncs/authors.html Submissions can either be full papers describing mature work or short papers describing work in progress, a system demonstration, or make a position statement. Full and short papers should not exceed 16 and 8 pages, respectively, including bibliography and appendices. Papers should be submitted as PDF via the AAIP 2011 submission webpage: http://www.easychair.org/conferences/?conf=aaip2011 IMPORTANT DATES April 3, 2011 Paper submission May 16, 2011 Author notification June 12, 2011 Camera-ready July 19, 2011 Workshop ORGANIZATION COMMITTEE * Emanuel Kitzelmann, International Computer Science Institute, Berkeley, USA * Ute Schmid, University of Bamberg, Germany PROGRAM COMMITTEE * Ricardo Aler Mur, Universidad Carlos III de Madrid, Spain * Pierre Flener, Uppsala University, Sweden * Lutz Hamel, University of Rhode Island, Kingston, USA * Jose Hernandez-Orallo, Technical University of Valencia, Spain * Martin Hofmann, SAP Research & Development, Germany * Johan Jeuring, University of Utrecht, The Netherlands * Susumu Katayama, University of Miyazaki, Japan * Pieter Koopman, Radboud University Nijmegen, The Netherlands * Maria Jose Ramirez Quintana, Technical University of Valencia, Spain CONTACT aaip2011 at easychair.org -- Dr. Emanuel Kitzelmann International Computer Science Institute (ICSI) 1947 Center Street, Suite 600 Berkeley, CA 94704, USA e-mail: emanuel AT icsi DOT berkeley DOT edu phone: +1 510 666 2883 From bram at cs.queensu.ca Thu Jan 6 10:22:34 2011 From: bram at cs.queensu.ca (Bram Adams) Date: Thu, 6 Jan 2011 16:22:34 +0100 Subject: [TYPES/announce] Deadline Extension: MISS 2011 workshop (ex ACP4IS) at AOSD 2011 Message-ID: <98B35F25-F743-453B-A98F-F7B21047D07A@cs.queensu.ca> [sorry for duplicate reception of this cfp] ************************************************************************* 1st AOSD Workshop on Modularity in Systems Software MISS 2011 (ex ACP4IS) March 22, 2011 Porto de Galinhas, Pernambuco (Brazil) NEW DEADLINE: JANUARY 10, 2011 (23:59 APIA) http://www.aosd.net/workshops/miss A one-day workshop to be held in conjunction with the 10th International Conference on Aspect-Oriented Software Development (AOSD'11), March 21 -- March 25, 2011, Porto de Galinhas, Pernambuco (Brazil) http://aosd.net/conference ************************************************************************** The importance of "systems infrastructure" software - including application servers, virtual machines, middleware, compilers, and operating systems - is increasing as application programmers demand better and higher-level support for software development. Vendors that provide superior support for application development have a competitive advantage. The software industry as a whole benefits as the base level of abstraction increases, thus decreasing the need for application programmers to continually "reinvent the wheel". These trends, however, mean that the demands on infrastructure software are increasing. More and more features and requirements are being "pushed down" into the infrastructure, and the developers of systems software need better tools and techniques for handling these increased demands. The design and implementation of systems-level software presents unique opportunities and challenges for research on software modularity. These challenges include the need to address the inherent complexity of infrastructure software, the need for strong assurances of correct and predictable behaviour, the need for maximum run-time performance, and the necessity of dealing with the large body of existing systems software components. MISS 2011 aims to provide a highly interactive forum for researchers and developers to discuss the application of and relationships between exciting new modularity constructs for systems software such as aspects, components, traits and context layers. The goal is to put these constructs into a common reference frame and to build connections between the software engineering and systems communities. Following up on last year's workshop, MISS 2011 puts special focus on the challenges in system's programming introduced by multi-core platforms. As hardware-supported parallelization becomes mainstream, there is an increasing pressure on systems infrastructure to exploit this new parallelism to its fullest. However, the non-modular nature of parallel execution, and the numerous levels at which parallelism can be achieved (application, systems infrastructure, hardware or even a combination) make it hard to come up with an intuitive, yet efficient parallel architecture. We solicit novel ideas and experience reports on this emerging research area. Other suggested topics for position papers include, but are not restricted to: - Approaches that combine or relate techniques based on advanced modularization concepts - Dimensions of infrastructure software quality including comprehensibility, configurability (by implementers), customizability (by users), reliability, evolvability, scalability, and run-time characteristics such as performance and code size - Merits and downsides of container-, ORB-, and system-based separation of concerns - Architectural techniques for particular system concerns, e.g., security, static and dynamic optimization, and real-time behaviour - Design patterns for systems software - "Mining" and refactoring of concerns in systems code - Application- or domain-specific optimization of systems - Reasoning and optimization across architectural layers - Quantitative and qualitative evaluation AGENDA The workshop will be structured to encourage fruitful discussions and build connections between workshop participants. To this end, approximately half of the workshop time will be devoted to short presentations of accepted papers, with the remaining half devoted to semi-structured discussion groups and lightning talks. The latter are short talks that are combined with tool demos, aimed at stimulating even more interaction between workshop attendees. Participants will be expected to have read the accepted papers prior to the workshop, to help ensure focused discussions. SUBMISSION GUIDELINES Invitation to the workshop will be based on accepted position papers, 3-5 pages in length. All papers must be submitted as PDF documents in ACM format through the MISS 2011 online submission system found at: http://www.easychair.org/conferences/?conf=miss11. Paper submissions will be reviewed by the workshop program committee and by designated reviewers. Papers will be evaluated based on technical quality, originality, relevance, and presentation. In addition to position papers, we also solicit proposals for lightning talks, i.e., a combination of a 5 minute talk and 5 minute tool demo. Prospective lightning presenters should send us an abstract of 250 words (deadline: March 13, 2010). Abstracts will NOT be published, they are intended to be read by the reviewers only (hence the late deadline). Comments and questions can be sent to miss11 AT aosd DOH net. PUBLICATION OF PAPERS All accepted papers will be posted at the workshop web site prior to the workshop date, to give all participants the opportunity to read them before the workshop. In addition, the accepted position papers will be published in a Workshop Proceedings in the ACM Digital Library. IMPORTANT DATES Paper Deadline (updated!): January 10, 2011 at 23:59 (Apia time) Notification of acceptance: January 23, 2011 Final papers due: February 19, 2011 Lightning abstracts: March 13, 2011 Workshop: March 22, 2011 PROGRAM COMMITTEE - Bram Adams, Queen's University - Walter Binder, University of Lugano - Michael Haupt, Hasso Plattner Institut - Mick Jordan, Oracle Labs - Julia Lawall, DIKU - David Lorenz, The Open University of Israel - Stefan Marr, Vrije Universiteit Brussel - Eddy Truyen, KU Leuven - Eric Wohlstadter, University of British Columbia - Charles Zhang Hong Kong University of Science and Technology ORGANIZING COMMITTEE - Bram Adams, Queen's University - Michael Haupt, Hasso Plattner Institut - David Lorenz, The Open University of Israel - Eric Wohlstadter, University of British Columbia STEERING COMMITTEE - Eric Eide, University of Utah - Olaf Spinczyk, University of Dortmund - Yvonne Coady, University of Victoria - David Lorenz, The Open University of Israel -------------- next part -------------- An HTML attachment was scrubbed... URL: From Marc.Bezem at ii.uib.no Thu Jan 6 13:57:30 2011 From: Marc.Bezem at ii.uib.no (Marc.Bezem at ii.uib.no) Date: Thu, 06 Jan 2011 19:57:30 +0100 Subject: [TYPES/announce] CSL'11 call for papers and workshop proposals Message-ID: <20110106195730.71306vnn1aw0dlzu.nmimb@webmail.uib.no> CALL FOR PAPERS AND WORKSHOP PROPOSALS CSL 2011 20th Annual Conference of the European Association for Computer Science Logic Bergen, Norway September 12-15, 2011 GENERAL INFORMATION 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. The Ackermann Award for 2011 will be presented to the recipients at CSL 2011. SCOPE Topics of interest include (but are not limited to): - 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 - finite model theory - computational proof theory - 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 foundations of programming paradigms - logical aspects of quantum computing - verification and program analysis - linear logic - higher-order logic - nonmonotonic reasoning PROCEEDINGS The proceedings will be published in the series LIPIcs, Leibniz International Proceedings in Informatics. Each paper accepted by the Program Committee (PC) must be presented at the conference by one of the authors, and a final copy must be prepared according to LIPIcs guidelines (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/). PAPER 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: http://www.easychair.org/conferences/?conf=csl2011. Submitted papers must be in English and 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 intro- duction which is directed at all members of the program committee. Submission is in two phases with dates as given below. 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 journal by March 19, 2011. Papers authored or coauthored by members of the PC are not allowed. WORKSHOPS Proposals for satellite workshops on more specialized topics are welcome and can be sent to csl11 at eacsl.org IMPORTANT DATES Submission of title and abstract: March 27, 2011 Submission of full paper: April 3, 2011 Notification: May 30, 2011 Final paper due: June 17, 2011 Conference: September 12-15, 2011 PROGRAM COMMITTEE Samson Abramsky (Oxford) Andrea Asperti (Bologna) Franz Baader (Dresden) Matthias Baaz (Vienna) Johan van Benthem (Amsterdam/Stanford) Marc Bezem (Bergen, chair) Patrick Blackburn (Nancy) Andreas Blass (Michigan) Jan van den Bussche (Hasselt) Thierry Coquand (Gothenburg) Nachum Dershowitz (Tel Aviv) Valentin Goranko (Copenhagen) Erich Graedel (Aachen) Wiebe van der Hoek (Liverpool) Bart Jacobs (Nijmegen) Reinhard Kahle (Lisbon) Stephan Kreutzer (Oxford) Viktor Kuncak (Lausanne) Daniel Leivant (Indiana) Benedikt Loewe (Amsterdam) Jean-Yves Marion (Nancy) Eugenio Moggi (Genova) Albert Rubio (Barcelona) Anton Setzer (Swansea) Alex Simpson (Edinburgh) John Tucker (Swansea) Pawel Urzyczyn (Warsaw) Helmut Veith (Vienna) Andrei Voronkov (Manchester) ORGANIZING COMMITTEE Isolde Adler Marc Bezem Magne Haveraaen Michal Walicki Uwe Wolter CONFERENCE ADDRESS CSL 2011, Department of Informatics, University of Bergen, P.O.Box 7803, N-5020 Bergen, Norway http://www.eacsl.org/csl11 From Gethin.Norman at glasgow.ac.uk Fri Jan 7 09:45:34 2011 From: Gethin.Norman at glasgow.ac.uk (Gethin Norman) Date: Fri, 7 Jan 2011 14:45:34 +0000 Subject: [TYPES/announce] QAPL 2011 Call For Presentation reports/Abstracts Message-ID: [Apologies for multiple copies] ******************************************************************************* CALL FOR PRESENTATION REPORTS/ABSTRACTS Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011) Affiliated with ETAPS 2011 April 1-2, 2011, Saarbrucken, Germany http://www.dcs.gla.ac.uk/qapl11/ ******************************************************************************* SCOPE: Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on: * the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements) * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Prakash Panangaden, McGill University, Canada. * Erik de Vink, Technische Universiteit Eindhoven, the Netherlands. SUBMISSIONS: 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. Submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: http://www.easychair.org/conferences/?conf=qapl11 The reports will receive a light weight review to establish their relevance for the workshop. The authors are expected to present and discuss their work at the workshop. Publication of a selection of the papers in a special issue of a journal is under consideration. IMPORTANT DATES: * Submission: January 24, 2011 * Notification: January 26, 2011 ORGANIZATION: PC Chairs: * Mieke Massink, CNR-ISTI, Pisa, Italy * Gethin Norman, University of Glasgow, UK Program Committee: * Alessandro Aldini, University of Urbino, Italy * Christel Baier, University of Dresden, Germany * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, IRISA/INRIA Rennes, France * Patricia Bouyer, Oxford University, UK * Jeremy Bradley, Imperial College London, UK * Tomas Brazdil, Masaryk University, Czech Republic * Frank van Breugel, York University, Canada * Antonio Cerone, UNU-IIST, Macao * Kostas Chatzikokolakis, University of Eindohoven, NL * Josee Desharnais, University of Laval, Canada * Alessandra Di Pierro, University of Verona, Italy * Susanne Graf, Verimag, France * Marcus Groesser, Technical University Dresden, Germany * Mieke Massink, CNR-ISTI, Pisa, Italy * Paulo Mateus, Technical University of Lisbon, Portugal * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Oxford, UK * Jeremy Sproston, University of Torino, Italy * Herbert Wiklicky, Imperial College London, UK * Verena Wolf, Saarland University, Germany The University of Glasgow, charity number SC004401 From Klaus.Havelund at jpl.nasa.gov Sat Jan 8 15:58:44 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (317J)) Date: Sat, 8 Jan 2011 12:58:44 -0800 Subject: [TYPES/announce] [fm-announcements] CFP - VVPS 2011: Verification and Validation for Planning and Scheduling Systems Message-ID: ---------------------------------------------------------------------- ** CALL FOR PAPERS ** 3rd ICAPS Workshop on Verification and Validation for Planning and Scheduling Systems (VVPS'11) http://icaps11.informatik.uni-freiburg.de/workshops/vvps.html Freiburg, Germany, June 13, 2011 ---------------------------------------------------------------------- Topic and Objectives *************** Planning and scheduling (P&S) systems are finding increased application in safety- and mission-critical systems that require a high level of assurance. However, tools and methodologies for verification and validation (V&V) of P&S systems have received relatively little attention. Therefore, important goals of the workshop are (i) to encourage the ongoing interaction between V&V and P&S communities, (ii) to identify innovative tools and methodologies (iii) and to elicit open issues and real challenges. The workshop also aims to enhance a stable, long-term establishment of a forum on relevant topics connected to the influence between V&V and P&S. The workshop series began in 2005 with the first edition of the workshop (http://planning.cis.strath.ac.uk/vvpsws/) during ICAPS '05 and continued in 2009 with the second edition (http://www-vvps09.imag.fr/) during ICAPS '09. These workshops presented a stimulating environment where researchers could discuss about the opportunities and challenges in integrating V&V and P&S. Topics of interest include: V&V of domain models, using technologies such as static analysis, theorem proving, and model checking; consistency and completeness of domain models; domain model coverage metrics; regression, stress and boundary testing; runtime verification of plan executions; generation of robust plans; compositional verification of domain models; how to structure domain models which are more amenable to static analysis; inspection methods; the relationship between timed automata and domain models; investigations of the impact wrt. V&V of procedural versus declarative plan models; application of P&S techniques to V&V; Planning as model checking; etc. Important Dates *************** Paper submission: February 11, 2011 Notification of acceptance/rejection: March 11, 2011 Final version due: April 8, 2011 Workshop Date: June 13, 2011 (TBC) Submissions *************** There are two types of submissions: short position statements and regular papers. Position papers are a maximum of 2 (two) pages. Regular papers are a maximum of 10 (ten) pages. Papers should be submitted via the VVPS EasyChair website: http://www.easychair.org/conferences/?conf=vvps11 All papers should be typeset in the AAAI style, described at: http://www.aaai.org/Publications/Author/author.php removing AAAI copyright. Accepted papers will be published on the workshop website and printed as a hard-copy. A selection of the accepted papers will be published in a special issue of the International Journal on Software Tools for Technology Transfer: http://sttt.cs.uni-dortmund.de/index.html. Any additional questions can be directed towards the general workshop contact email: vvps11 at easychair.org Organization Chairs ******************* Saddek Bensalem, VERIMAG, France saddek.bensalem at imag.fr Klaus Havelund, NASA JPL, U.S.A. klaus.havelund at jpl.nasa.gov Andrea Orlandini ITIA-CNR, Italy andrea.orlandini at itia.cnr.it Programme Committee ******************* Howard Barringer (University of Manchester, UK) Andreas Bauer (NICTA, Australia) Saddek Bensalem (Verimag/UJF, France) (Co-Chair) Amedeo Cesta (ISTC-CNR, Rome, Italy) Alessandro Cimatti (FBK, Trento, Italy) Alexandre David (Aalborg University, Denmark) Giuseppe Della Penna (University of L'Aquila, L'Aquila, Italy) Lucas Dixon (University of Edinburgh, Edinburgh, UK) Bernd Finkbeiner (Saarland University, Germany) Alberto Finzi (University of Naples, Naples, Italy) Maria Fox (University of Strathclyde, UK) Dimitra Giannakopoulou (NASA Ames Research Center, USA) Enrico Giunchiglia (University of Genova, Italy) Alex Groce (Oregon State University, USA) Klaus Havelund (JPL, USA) (Co-Chair) Gerard Holzmann (JPL, USA) Felix Ingrand (LAAS-CNRS, France) Hadas Kress-Gazit (Cornell University, USA) Kim G. Larsen (Aalborg University, Denmark) Martin Leucker Technische Universit?t M?nchen, Germany) Lee McCluskey (University of Huddersfield, UK) David Musliner (SIFT, USA) Andrea Orlandini (ITIA-CNR, Milan, Italy) (Co-Chair) Corina Pasareanu (NASA Ames Research Center, USA) Charles Pecheur (Universit? catholique de Louvain, Belgium) Paul Pettersson (Malardalen University, Sweden) Douglas Smith (Kestrel Institute, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From amoeller at cs.au.dk Mon Jan 10 06:36:28 2011 From: amoeller at cs.au.dk (=?ISO-8859-1?Q?Anders_M=F8ller?=) Date: Mon, 10 Jan 2011 12:36:28 +0100 Subject: [TYPES/announce] Postdocs and PhD positions - Center for Advanced Software Analysis Message-ID: <4D2AEF3C.5090706@cs.au.dk> Several postdoc positions and PhD stipends are available in the new 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. The 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. 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 . Prospective applicants are requested to send an email containing a letter of interest, a CV, and references for recommendations. Applications will be considered until the positions are filled. From D.R.Ghica at cs.bham.ac.uk Mon Jan 10 12:25:29 2011 From: D.R.Ghica at cs.bham.ac.uk (Dan Ghica) Date: Mon, 10 Jan 2011 17:25:29 +0000 Subject: [TYPES/announce] GaLoP VI Call of Submissions Message-ID: <47290133-5700-47CC-9C72-C7EFFB7283A6@cs.bham.ac.uk> // Call for Submissions // 6th Workshop on Games for Logic and Programming Languages (GaLoP 2011) // ETAPS 2011 // Saarbr?cken, Germany // 26?27 March // http://sites.google.com/site/galopws/ GaLoP is an annual 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 VI will be held in Saarbr?cken, Germany, between March 26-27. It will be part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2011). 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. We particularly encourage submissions in the following related areas of research: * 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). // 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: January 20 Notification: February 1 Workshop: March 26-27 // Invited Speakers // ? Ian Mackie, Sussex ? Mehrnoosh Sadrzadeh, Oxford ? Jouko V??n?nen, Helsinki ? other speakers TBC // Program Committee // ? Samson Abramsky, Oxford (co-chair) ? Pierre Clairambault, Bath ? Claudia Faggian, Paris ? Dan R. Ghica, Birmingham (co-chair) ? Ugo Dal Lago, Bologna ? Jim Laird, Bath ? Paul Blain Levy, Birmingham ? Guy McCusker, Bath ? Andrzej Murawski, Leicester ? Paul-Andr? Melli?s, Paris ? Alexis Saurin, Paris ? Nikos Tzevelekos, Oxford From freek at cs.ru.nl Mon Jan 10 15:56:15 2011 From: freek at cs.ru.nl (Freek Wiedijk) Date: Mon, 10 Jan 2011 21:56:15 +0100 Subject: [TYPES/announce] ITP 2011 (Call for Papers) Message-ID: <20110110205615.GA14083@cs.ru.nl> Call for Papers ITP 2011: 2nd International Conference on Interactive Theorem Proving 22-25 August 2011, Nijmegen, The Netherlands http://itp2011.cs.ru.nl/ ----- ITP is the premier international conference for researchers from all areas of interactive theorem proving and its applications. The inaugural meeting of ITP was held on 11-14 July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC, 9-21 July 2010). The second edition of ITP will take place in Nijmegen, The Netherlands, on 22-25 August 2011. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The program committee welcomes submissions on all aspects of interactive theorem proving and its applications. Examples of typical topics include formal aspects of hardware or software (specification, verification, semantics, synthesis, refinement, compilation, etc.); formalization of significant bodies of mathematics; advances in theorem prover technology (automation, decision procedures, induction, combinations of systems and tools, etc.); other topics including those relating to user interfaces, education, comparisons of systems, and mechanizable logics; and concise and elegant worked examples ("Proof Pearls"). Submission details: All papers must be submitted electronically, via EasyChair: https://www.easychair.org/conferences/?conf=itp2011 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. As for the last edition, the proceedings will be published as a volume in the 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. They will be presented at the conference venue in a poster session. Authors of accepted papers are expected to present their papers at the conference, and will be required to sign copyright release forms. All submissions must be written in English. Important dates (midnight GMT): Abstract submission deadline: 13 February 2011 Paper submission deadline: 20 February 2011 Notification of paper decisions: 18 April 2011 Camera-ready papers due from authors: 15 May 2011 Conference dates: 22-25 August 2011 Web page: http://itp2011.cs.ru.nl/ Invited Speakers: Don Batory, University of Texas at Austin Georges Gonthier, Microsoft Research Mike Kishinevsky, Intel Conference co-chairs: Marko Van Eekelen, Radboud University Nijmegen/Open University of the Netherlands Herman Geuvers, Radboud University Nijmegen Julien Schmaltz, Open University of the Netherlands/Radboud University Nijmegen Freek Wiedijk, Radboud University Nijmegen Program Committee: David Aspinall (Univ. of Edinburgh, UK) Jeremy Avigad (CMU, USA) Stefan Berghofer (TUM, Gremany) Yves Bertot (INRIA Sophia-Antipolis, France) Sandrine Blazy (IRISA, France) Jens Brandt (Univ. of Kaiserslautern, Germany) Jared Davis (Centaur, USA) Amy Felty (Univ. of Ottawa, Canada) Jean-Christophe Filliatre (INRIA Saclay, France) Herman Geuvers - co-Chair (Radboud University Nijmegen, The Netherlands) Georges Gonthier (Microsoft Research, USA) Elsa Gunther (UIUC, USA) John Harrison (Intel, USA) Reiner H?hnle (Chalmers Univ. of Technology, Sweden) Matt Kaufmann (Univ. of Texas at Austin, USA) Gerwin Klein (NICTA, Australia) Assia Mahboubi (LIX, France) Panagiotis Manolios (Northeastern Univ., USA) John Matthews (Galois, USA) Paul Miner (NASA, USA) J Moore (Univ. of Texas at Austin, USA) Greg Morrisett (Harvard Univ., USA) Magnus O. Myreen (Univ. of Cambridge, UK) Tobias Nipkow (TU Munich, Germany) Michael Norrish (NICTA, Australia) Sam Owre (SRI, USA) Christine Paulin-Mohring (Univ. Paris-Sud, France) Lawrence Paulson (Univ. of Cambridge, UK) Brigitte Pientka (McGill Univ., Canad) Lee Pike (Galois, USA) Sandip Ray (Univ. of Texas at Austin, USA) Jose-Luis Ruiz-Reina (Univ. of Sevilla, Spain) David Russinoff (AMD, USA) Julien Schmaltz - co-Chair (Open Univ. of the Netherlands, The Netherlands) Konrad Slind (Rockwell Collins, USA) Sofiene Tahar (Concordia, Canada) Marko van Eekelen - co-Chair (Open Univ. of the Netherlands, The Netherlands) Makarius Wenzel (Univ. of Paris-Sud, France) Freek Wiedijk - co-Chair (Radboud University Nijmegen, The Netherlands) From soner at mtu.edu Mon Jan 10 21:14:37 2011 From: soner at mtu.edu (Soner Onder) Date: Mon, 10 Jan 2011 21:14:37 -0500 Subject: [TYPES/announce] ASPLOS 2011 Call for Participation Message-ID: <4D2BBD0D.9010107@mtu.edu> *** Our apologies if you receive this announcement from multiple sources *** =========================================================================================== Call for Participation : ASPLOS 2011 ( http://asplos11.cs.ucr.edu ) Sixteenth International Conference on Architectural Support for Programming Languages and Operating Systems Newport Beach, California, March 5-11, 2011 =========================================================================================== Registration is open. Early registration for the conference and hotel reservations is Februrary 2. A preliminary version of the program can be found at the address http://asplos11.cs.ucr.edu/tentative.html and a text version is also included in this message. ASPLOS is sponsored by ACM SIGPLAN, ACM SIGARCH and ACM SIGOPS and has also been generously supported by National Science Foundation, VMWare, Google, Intel, HP, Qualcomm Research Center, Oracle, AMD, Microsoft Research, and IBM. ============================================================================================ ========================= ASPLOS 2011 Travel Grants ========================= Funded by: NSF, SIGARCH, SIGOPS, SIGPLAN, & Google. ASPLOS will offer travel grants for students to attend the conference, in addition to reduced student registration fees. Travel grants will also be made available to junior faculty members, under-represented minorities, and faculty members from non-Ph.D. granting colleges. The size and number of these grants will vary depending on funding availability and the number of applications that we receive. Expenses will be reimbursed after the conference; grant recipients will be asked to submit original receipts. While we encourage all in need of a travel grant to apply, priority will be given to paper and poster presenters, co-authors, and under-represented minorities (including women and undergraduate students interested in research). To apply for a travel grant from ASPLOS, please complete the following steps: * Complete the application form (http://asplos11.cs.ucr.edu/travel_grant_application_form.doc). * Applicants, compose an email to asplos2011travel at gmail dot com. For your subject line, please use ?Travel Grant Application for ?. * In the body of your email, please briefly describe your reasons for attending ASPLOS and your research interests. * Attach a current resume and the completed application form. Student applicants also need to ask their advisor to send an e-mail to asplos2011travel at gmail dot com with the subject line ?Student Travel Status Confirmation for ?, stating that you are a full time student pursuing an MS/Ph.D. or undergraduate research in the areas covered by ASPLOS. Travel grant applications must be received by January 26th, 2011. For students, the confirmation email from their advisor needs to be received by that date also. Because of the large number of applications we expect to receive, we will not solicit these letters from your advisors - it is your responsibility to ensure that your advisor sends the email before the deadline. We will acknowledge receipt of your application within a week of receipt. If you do not receive such an acknowledgement, please resend. If you still don't receive an acknowledge mail, please call the Travel Chair, Philip Brisk, at +1 (951) 827-2030. We will do our best to notify you about the status of your application by January 30th, which is 3 days before the conference early registration deadline. Note that award decisions will be made based on funding availability. Note also that some awards may be made only after the conference. Please contact Philip Brisk for information. Funding for ASPLOS travel grants has been generously provided by the NSF, the SIGARCH, the SIGOPS, and the ACM SIGPLAN Professional Activities Committee (PAC). -------------------------------------------------------------------------------------------------- ================= Tentative Program ================= Innovations in Memory Ordering Models for Parallel Machines =========================================================== Efficient Processor Support for DRFx, a Memory Model with Exceptions Abhayendra Singh[1], Daniel Marino[2], Satish Narayanasamy[1], Todd Millstein[2], Madanlal Musuvathi[3] [1]University of Michigan, Ann Arbor, [2]University of California, Los Angeles, [3]Microsoft Research RCDC: A Relaxed-Consistency Deterministic Computer Joseph Devietti, Jacob Nelson, Tom Bergan, Luis Ceze, Dan Grossman University of Washington Specifying and Checking Semantic Atomicity for Multithreaded Programs Jacob Burnim, George Necula, Koushik Sen University of California, Berkeley Novel Computing Platforms ========================= A Case for Neuromorphic ISAs Atif Hashmi, Andrew Nere, James Thomas, Mikko Lipasti University of Wisconsin - Madison Mementos: System Support for Long-Running Computation on RFID-Scale Devices Benjamin Ransford, Jacob Sorber, Kevin Fu University of Massachusetts Amherst Pocket Cloudlets Emmanouil Koukoumidis[1], Dimitrios Lymberopoulos[2], Karin Strauss[2], Jie Liu[2], Doug Burger[2] [1]Princeton University, [2]Microsoft Research Programming for Persistent Memory ================================= Mnemosyne: Lightweight Persistent Memory Haris Volos, Andres Jaan Tack, Michael Swift University of Wisconsin-Madison NV-Heaps: Making Persistent Objects Fast and Safe with Next-Generation, Non-Volatile Memories Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laura M. Grupp, Rajesh K. Gupta, Ranjit Jhala, Steven Swanson University of California, San Diego Learning from the Past: Drawing Conclusions from Extensive Measurement Studies ============================================================================== Faults in Linux: Ten Years Later Nicolas Palix[1], Suman Saha[2], Gael Thomas[2], Christophe Calves[2], Julia Lawall[3], Gilles Muller[4] [1]DIKU, [2]LIP6-Regal, [3]DIKU/INRIA/LIP6-Regal, [4]INRIA/LIP6-Regal Looking Back on the Language and Hardware Revolution: Measured Power, Performance, and Scaling Hadi Esmaeilzadeh[1], Stephen Blackburn[2], Ting Cao[2], Xi Yang[2], Kathryn McKinley[1] [1]The University of Texas at Austin, [2]Australian National University Rethinking and Protecting Operating Systems =========================================== Ensuring Operating System Kernel Integrity with OSck Owen Hofmann, Alan Dunn, Sangman Kim, Indrajit Roy, Emmett Witchel The University of Texas at Austin Rethinking the Library OS from the Top Down Donald Porter[1], Silas Boyd-Wickizer[2], Jon Howell[3], Reuben Olinsky[3], Galen Hunt[3] [1]Stony Brook University, [2]Massachusetts Institute of Technology, [3]Microsoft Research Recognizing Software and Concurrency Bugs ========================================= 2ndStrike: Towards Manifesting Hidden Concurrency Typestate Bugs Qi Gao[1], Wenbin Zhang[2], Zhezhe Chen[2], Mai Zheng[2], Feng Qin[2] [1]Facebook, Inc., [2]The Ohio State University ConSeq: Detecting Concurrency Bugs through Sequential Errors Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Scherpelz, Guoliang Jin, Shan Lu, Thomas Reps University of Wisconsin, Madison S2E: A Platform for In Vivo Multi-Path Analysis of Software Systems Vitaly Chipounov, Volodymyr Kuznetsov, George Candea EPFL Enhancing Device Driver Reliability =================================== A declarative language approach to device configuration Adrian Schupbach, Andrew Baumann, Timothy Roscoe, Simon Peter ETH Zurich Improved Device Driver Reliability Through Hardware Verification Reuse Leonid Ryzhyk[1], John Keys[2], Balachandra Mirla[1], Arun Raghunath[2], Mona Vij[2], Gernot Heiser[1] [1]NICTA & UNSW, [2]Intel Better Logging Support for Software Debugging ============================================= DoublePlay: Parallelizing sequential logging and replay Kaushik Veeraraghavan, Dongyoon Lee, Benjamin Wester, Jessica Ouyang, Peter Chen, Jason Flinn, Satish Narayanasamy University of Michigan Improving Software Diagnosability via Log Enhancement Ding Yuan[1], Jing Zheng[2], Soyeon Park[2], Yuanyuan Zhou[2], Stefan Savage[2] [1]University of Illinois, Urbana-Champaign, [2]University of California, San Diego Exploiting Parallelism on GPUs ============================== On-the-Fly Elimination of Dynamic Irregularities for GPU Computing Eddy Zhang, Yunlian Jiang, Ziyu Guo, Kai Tian, Xipeng Shen The College of William and Mary Sponge: Portable Stream Programming on Graphics Engines Amir Hormati, Mehrzad Samadi, Mark Woh, Trevor Mudge, Scott Mahlke University of Michigan New Compiler Optimizations ========================== Exploring circuit timing-aware languages and compilation Giang Hoang, Robert Bruce Findler, Russ Joseph Northwestern University Orchestration by Approximation: Mapping Stream Programs Onto Multi-Core Architectures Sardar M. Farhad[1], Yousun Ko[2], Bernd Burgstaller[2], Bernhard Scholz[1] [1]The University of Sydney, [2]Yonsei University Synthesizing Concurrent Schedulers for Irregular Algorithms Donald Nguyen and Keshav Pingali The University of Texas at Austin Saving Power and Energy ======================= Blink: Managing Server Clusters on Intermittent Power Navin Sharma, Sean Barker, David Irwin, Prashant Shenoy University of Massachusetts at Amherst Dynamic Knobs for Power-Aware Computing Henry Hoffman, Stelios Sidiroglou, Michael Carbin, Sasa Misailovic, Anant Agarwal, Martin Rinard MIT Flikker: Saving DRAM Refresh-power through Critical Data Partitioning Song Liu[1], Karthik Pattabiraman[2], Thomas Moscibroda[3], Benjamin Zorn[3] [1]Northwestern University, [2]University of British Columbia, [3]Microsoft Research MemScale: Active Low-Power Modes for Main Memory Qingyuan Deng[1], David Meisner[2], Luiz Ramos[1], Thomas Wenisch[2], Ricardo Bianchini[1] [1]Rutgers University, [2]University of Michigan Novel Performance Improvements ============================== Improving the Performance of Trace-based Systems by False Loop Filtering Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mauricio Serrano, Toshio Nakatani IBM Inter-core Prefetching for Multicore Processors Using Migrating Helper Threads Md Kamruzzaman, Steven Swanson, Dean Tullsen UCSD Understanding and Improving Transactional Memory ================================================ Hardware Acceleration of Transactional Memory on Commodity Systems Jared Casper, Tayo Oguntebi, Sungpack Hong, Nathan Bronson, Christos Kozyrakis, Kunle Olukotun Stanford University Hybrid NOrec: A Case Study in the Effectiveness of Best Effort Hardware Transactional Memory Luke Dalessandro[1], Fraincois Carouge[2], Sean White[2], Yossi Lev[3], Mark Moir[3], Michael Scott[1], Michael Spear[2] [1]University of Rochester, [2]Lehigh University, [3]Sun Labs at Oracle From kutsia at risc.uni-linz.ac.at Tue Jan 11 09:35:52 2011 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 11 Jan 2011 15:35:52 +0100 Subject: [TYPES/announce] 2nd CfP: JAL Special Issue on Automated Specification and Verification of Web Systems Message-ID: <4D2C6AC8.1070206@risc.uni-linz.ac.at> [Apologies for multiple copies] ======================================================================== JOURNAL OF APPLIED LOGIC Special Issue on Automated Specification and Verification of Web Systems http://www.risc.uni-linz.ac.at/people/tkutsia/jal-wwv.html ======================================================================== SCOPE ----- This special issue of the Journal of Applied Logic is related to the topics of the workshop WWV'10: Automated Specification and Verification of Web Systems, which took place in Vienna on July 30-31, 2010. Both participants of the workshop and other authors are invited to submit contributions. The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit original papers on logic-based methods and techniques applied to Web sites, Web services or Web-based applications, such as: * Rule-based approaches to Web systems analysis, certification, specification, verification, and optimization * Algebraic methods for verification and certification of Web systems * Formal models for describing and reasoning about Web systems * Model-checking, synthesis and debugging of Web systems * Abstract interpretation and program transformation applied to the semantic Web * Intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications SUBMISSION ---------- We expect original articles (typically 15-25 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published and that must not be simultaneously submitted for publication elsewhere. Submissions must comply with JAL's author guidelines. They must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are encouraged via the EasyChair submission system: http://www.easychair.org/conferences/?conf=jalwwv2010. IMPORTANT DATES --------------- * Submission of papers: March 7, 2011. * Notification: June 6, 2011. GUEST EDITORS -------------- * Laura Kov?cs (Vienna University of Technology) * Temur Kutsia (RISC, Johannes Kepler University Linz) From vv at di.fc.ul.pt Tue Jan 11 11:00:47 2011 From: vv at di.fc.ul.pt (Vasco T. Vasconcelos) Date: Tue, 11 Jan 2011 16:00:47 +0000 Subject: [TYPES/announce] PLACES'11 _ Deadline extended to Jan 16th Message-ID: SECOND CALL FOR PAPERS (deadline extended) PLACES'11 Programming Language Approaches to Concurrency and communication-cEntric Software 2nd April 2011, Saarbr?cken, Germany Affiliated with ETAPS 2011 http://places11.di.fc.ul.pt/ Theme and Goals Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Much normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of fithe central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. Topics of Interest Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: language design and implementations for communications and/or concurrency, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. Submission Guidelines Authors are invited to submit a five-page abstract in PDF format using the EasyChair proceedings template available at http://www.easychair.org/easychair.zip. Abstracts and full papers should be submitted using EasyChair, http://www.easychair.org/conferences/?conf=places11. Preliminary proceedings will be available at the workshop. Post-proceedings will be published in a journal (the past post-proceedings were published in ENTCS and EPTCS). Important Dates Deadline of 5-page abstracts: Wednesday 16th Jan 2011 Notification: Wednesday 2nd Feb 2011 Camera Ready for pre-proceedings: Wednesday 9th Feb 2011 Program Committee Marco Carbone, IT University of Copenhagen Swarat Chaudhuri, Pennsylvania State University Alastair Donaldson, Oxford University Tim Harris, Microsoft Research Cambridge Alan Mycroft, University of Cambridge Jens Palsberg, University of California, Los Angeles Vijay A. Saraswat, IBM Research Vivek Sarkar, Rice University (co-chair) Vasco T. Vasconcelos, University of Lisbon (co chair) Jan Vitek, Purdue University Nobuko Yoshida, Imperial College London From bywang at iis.sinica.edu.tw Tue Jan 11 20:46:28 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Wed, 12 Jan 2011 09:46:28 +0800 Subject: [TYPES/announce] New conference - Certified Programs and Proofs Message-ID: <20110112094628.18074unmj06c98ms@webmail.iis.sinica.edu.tw> Dear colleagues, Certified Programs and Proofs (CPP) is a new international conference dedicated to the development of certified software and proofs. The conference is intended to be a forum for both theorists and practitioners to exchange ideas about certification used in computer science, mathematics, and education. Please read the manifesto (followed by CFP) for our visions. For more information, please go to the CPP web site at http://formes.asia/cpp/. Best regards, Bow-Yaw Academia Sinica, INRIA, and Tsinghua University *********************************************************************** CPP Manifesto In this manifesto, we advocate for the creation of a new international conference in the area of formal methods and programming languages, named Certified Programs and Proofs (CPP). Certification here means formal, mechanized verification of some sort, preferably with production of independently checkable certificates. CPP would target any research promoting formal development of certified software and proofs, that is: - the development of certified or certifying programs; - the development of certified mathematical theories; - the development of new languages and tools for certified programming; - new program logics, type systems, and semantics for certified code; - new automated or interactive tools and provers for certification; - results assessed by an original open source formal development; - original teaching material based on a proof assistant. Software today is still developed without precise specification. A developer often starts the programming task with a rather informal specification. After careful engineering, the developer delivers a program that may not fully satisfy the specification. Extensive testing and debugging may shrink the gap between the two, but there is no assurance that the program accurately follows the specification. Such inaccuracy may not always be significant, but when a developer links a large number of such modules together, these ``noises'' may multiply, leading to a system that nobody can understand and manage. System software built this way often contains hard-to-find ``zero-day vulnerabilities'' that become easy targets for the Stuxnet-like attacks. CPP aims to promote the development of new languages and tools for building certified programs and for making programming precise. Certified software consists of an executable program plus a formal proof that the software is free of bugs with respect to a particular dependability claim. With certified software, the dependability of a software system is measured by the actual formal claim that it is able to certify. Because the claim comes with a mechanized proof, the dependability can be checked independently and automatically in an extremely reliable way. The formal dependability claim can range from making almost no guarantee, to simple type safety property, or all the way to deep liveness, security, and correctness properties. It provides a great metric for comparing different techniques and building steady progress in constructing dependable software. The conventional wisdom is that certified software will never be practical because any real software must also rely on the underlying runtime system which is too low-level and complex to be verifiable. In recent years, however, there have been many advances in the theory and engineering of mechanized proof systems applied to verification of low-level code, including proof-carrying code, certified assembly programming, local reasoning and separation logic, certified linking of heterogeneous components, certified protocols, certified garbage collectors, certified or certifying compilation, and certified OS-kernels. CPP intends to be a driving force that would facilitate the rapid development of this exciting new area, and be a natural international forum for such work. The recent development in several areas of modern mathematics requires mathematical proofs containing enormous computation that cannot be verified by mathematicians in a whole lifetime. Such development has puzzled the mathematical community and prompted some of our colleagues in mathematics and computer science to start developing a new paradigm, formal mathematics, which requires proofs to be verified by a reliable theorem prover. As particular examples, such an effort has been done for the four-color theorem and has started for the sphere packing problem and the classification of finite groups. We believe that this emerging paradigm is the beginning of a new era. No essential existing theorem in computer science has been considered yet worth a similar effort, but it could well happen in the very near future. For example, existing results in security would often benefit from a formal development allowing to exhibit the essential hypotheses under which the result really holds. CPP would again be a natural international forum for this kind of work, either in mathematics or in computer science, and participate strongly to the emergence of this paradigm. On the other hand, there is a recent trend in computer science to formally prove new results in highly technical subjects such as computational logic, at least in part. In whichever scientific area, formal proofs have three major advantages: no assumption can be missing, as is sometimes the case; the result cannot be disputed by a wrong counterexample, as it sometimes happens; and more importantly, a formal development often results in a better understanding of the proof or program, and hence results in easier and better implementation. This new trend is becoming strong in computer science work, but is not recognized yet as it should be by traditional conferences. CPP would be a natural forum promoting this trend. There are not many proof assistants around. There should be more, because progress benefits from competition. On the other hand, there is much theoretical work that could be implemented in the form of a proof assistant, but this does not really happen. One reason is that it is hard to publish a development work, especially when this requires a long term effort as is the case for a proof assistant. It is even harder to publish work about libraries which, we know all, are fundamental to make the success of a proof assistant. CPP would take a particular attention in publishing, publicizing, and promoting this kind of work. Finally, CPP also aims to be a publication arena for innovative teaching experiences, in computer science or mathematics, using proof assistants in an essential way. These experiences could be submitted in an innovative format to be defined. CPP would be an international conference initially based in Asia. Formal methods in Asia based on model checking have been boosted by ATVA. An Asian community in formal methods based on formal proofs is now emerging, in China, South Korea, Taiwan, and Japan (where the use of such formal methods is recent despite a strong logical tradition), but is still very scattered and lacks a forum where researchers can easily meet on a regular basis. CPP is intended to nurse such a forum, and help boosting this community in Asia as ATVA did for the model checking community. For its start, CPP will join APLAS, to be organized in early December 2011 in Taiwan. Co-locating with APLAS will have the advantage of having a larger community present for the very first CPP meeting. In the long run, we would target a three-year rotating schema among Asia, Europe, and North America, and favor colocations with other conferences on each continent. by Jean-Pierre Jouannaud and Zhong Shao December 15, 2010 *********************************************************************** The First International Conference on Certified Programs and Proofs (CPP 2011) PRELIMINARY CALL FOR PAPERS Taiwan December 7--9, 2011 http://formes.asia/cpp (co-located with APLAS 2011) 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. 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; and teaching mathematics and computer science with proof assistants. 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: Monday, June 13, 2011 Paper Submission Deadline: Friday, June 17, 2011 Author Notification: Monday, August 29, 2011 Camera Ready: Monday, September 19, 2011 Conference: December 7-9, 2011 SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2011 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 is planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Submission instructions including Latex style files are available from the CPP 2011 website. Each submission must be written in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference, all phrased for the non-specialist. Technical and formal developments directed to the specialist should follow. Whenever appropriate, the submission should come along with a formal development, using whatever prover, e.g., Agda, Coq, Elf, HOL, HOL-Light, Isabelle, Matita, Mizar, NQTHM, PVS, Vampire, etc. References and comparisons with related work should be included. Papers not conforming to the above requirements concerning format and length may be rejected without further consideration. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other published conferences or workshops. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. Original formal proofs of known results in mathematics or computer science are among the targets. One author of each accepted paper is expected to present it at the conference. AWARD FOR BEST PAPER: An award will be given for the best accepted paper, as judged by the program committee. Details concerning eligibility criteria and procedure for consideration for this award will be posted at the CPP website. The committee may decline to make the award or split it among several papers. PROGRAM CO-CHAIRS: Jean-Pierre Jouannaud (INRIA and Tsinghua University) Zhong Shao (Yale University) Email: cpp2011pc at gmail.com GENERAL CHAIR: Yih-Kuen Tsay (National Taiwan University) PROGRAM COMMITTEE: Andrea Asperti (University of Bologna) Gilles Barthe (IMDEA Software Institute) Xiao-Shan Gao (Chinese Academy of Sciences) Georges Gonthier (Microsoft Research Cambridge) Chris Hawblitzel (Microsoft Research Redmond) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (INRIA and Tsinghua University) Akash Lal (Microsoft Research India) Xavier Leroy (INRIA Paris-Rocquencourt) Yasuhiko Minamide (University of Tsukuba) Shin-Cheng Mu (Academia Sinica) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Sandip Ray (University of Texas at Austin) Natarajan Shankar (SRI International) Zhong Shao (Yale University) Christian Urban (TU Munich) Viktor Vafeiadis (Max Planck Institute for Software Systems) Stephanie Weirich (University of Pennsylvania) Kwangkeun Yi (Seoul National University) PUBLICITY CHAIR: Bow-Yaw Wang (Academia Sinica, INRIA and Tsinhua University) ORGANIZING COMMITTEE: Tyng-Ruey Chuang (chair), Shin-Cheng Mu, Yih-Kuen Tsay (Academia Sinica and National Taiwan University) Email: cpp2011oc at gmail.com ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From gvidal at dsic.upv.es Wed Jan 12 10:01:27 2011 From: gvidal at dsic.upv.es (German Vidal) Date: Wed, 12 Jan 2011 16:01:27 +0100 Subject: [TYPES/announce] LOPSTR 2011 - call for papers Message-ID: <6648906C-A5B0-402E-9E3B-B688C3E5DFDC@dsic.upv.es> ============================================================ Preliminary Call for papers 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011) ============================================================ Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 21st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2011) will be held in Odense, Denmark; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2011 will be co-located with PPDP 2011 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming- in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: - specification - synthesis - verification - transformation - analysis - optimisation - specialization - partial evaluation - inversion - composition - program/model manipulation - certification - security - transformational techniques in SE - applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, the formal post-conference proceedings are planned to be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series. IMPORTANT DATES AND SUBMISSION GUIDELINES: - Paper submission: March 27, 2011 - Extended abstract submission: April 3, 2011 - Notification (for pre-proceedings): May 16, 2011 - Camera-ready (for pre-proceedings): June 12, 2011 - Symposium: July 18-20, 2011 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Lecture Notes in Computer Science style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2011 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings, which is planned to be published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2011 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal proceedings. Program Committee: TBD Contacts Program Chair (contact him for additional information about papers and submissions) German Vidal Department of Computer Science (DSIC) Universitat Politecnica de Valencia Valencia, Spain Email: lopstr11 at dsic.upv.es General Chair Peter Schneider-Kamp Dept. of Mathematics and Computer Science University of Southern Denmark Campusvej 55 DK-5230 Odense M, Denmark Email: petersk at imada.sdu.dk From rwh at cs.cmu.edu Wed Jan 12 16:49:46 2011 From: rwh at cs.cmu.edu (Robert Harper) Date: Wed, 12 Jan 2011 16:49:46 -0500 Subject: [TYPES/announce] Oregon Programming Languages Summer School Message-ID: We are pleased to announce the preliminary program for the 10th annual Oregon Programming Languages Summer School (OPLSS) to be held 15 June to 1 July 2011 at the University of Oregon in Eugene. This year's program is titled Types, Semantics, and Verification, and features the following speakers: Amal Ahmed Logical relations Indiana University Andrew Appel Software verification Princeton University Nick Benton Monadic effects Microsoft Research Robert Constable Cornell University Pierre-Louis Curien Polarization and Focalization pi.r2 team, PPS, CNRS-Paris 7 University-INRIA Robert Harper Type theory foundations Carnegie Mellon University Hugo Herbelin Foundation of Coq pi.r2 team, PPS, CNRS-Paris 7 University-INRIA Xavier Leroy Compiler verification INRIA Paul-Andre' Mellies Category theory pi.r2 team, PPS, CNRS-Paris 7 University-INRIA Greg Morrisett Ynot programming Harvard University Frank Pfenning Proof theory foundations Carnegie Mellon University Benjamin Pierce Software foundation in Coq University of Pennsylvania Dana Scott Carnegie Mellon University Full information on registration will be available shortly at http://www.cs.uoregon.edu/Activities/summerschool/summer11 . Robert Harper Zena Ariola Pierre-Louis Curien From herman at cs.ru.nl Thu Jan 13 10:01:00 2011 From: herman at cs.ru.nl (Herman Geuvers) Date: Thu, 13 Jan 2011 16:01:00 +0100 Subject: [TYPES/announce] Vacancy: Assistant or Associate Professor of Computer Science (1, 0 fte) Message-ID: <4D2F13AC.4070601@cs.ru.nl> Assistant or Associate Professor of Computer Science (1,0 fte) Faculty of Science Radboud University Nijmegen The Netherlands Maximum Salary: ?4970 UD 1 and ? 5,920 UHD 1 gross/month Vacancy number: 62.03.11 Closing date: 15 March 2011 Job description You will perform and disseminate novel research within one of the following two research themes. 1.Foundations, with a focus on logic, (symbolic) reasoning and mathematical reasoning, in particular topics like proof assistants, type theory and formalization of mathematics. 2.Machine Learning, with an interest in theory and an open eye towards applications, for example in neuroscience and bioinformatics. As a member of the scientific staff of the section Intelligent Systems you will develop and teach courses within the general curriculum of students of Computer Science, Information Sciences and Artificial Intelligence. In particular you will contribute to the teaching of courses in algorithms and complexity theory. Other tasks include supervision of PhD students, postdoctoral researchers and supporting staff members, and the further development of the department?s regular educational and research tasks. Acquisition of external funding is part of the job profile. Furthermore, you are expected to contribute to the general organizational tasks of the section Intelligent Systems, like participating in work groups and committees at the faculty and institute levels. Whether the position will be filled at the UD (assistant professor) or UHD (associate professor) level will depend on your CV. Requirements You are a successful researcher (PhD) in computer science, as demonstrated by publications in leading peer-reviewed journals, and have the capacity to obtain external funding. Your research experience should fit within one of the two themes mentioned above. You have demonstrable excellent teaching experience in the field and should possess or will obtain the required teaching qualification (for UD: BKO, for UHD: UKO). Organization The Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green campus, modern buildings, and state-of-the-art equipment, it has nine faculties and enrols over 17.500 students in approximately 90 study programmes. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal (a branch of the Rhine). The city has a rich history and one of the liveliest city centres in the Netherlands. The section Intelligent Systems of the Institute for Computing and Information Sciences (iCIS) at the Radboud University Nijmegen conducts research on the development and application of intelligent systems that are able to learn and reason. At the latest national research assessment, the Intelligent Systems section received excellent scores and iCIS as a whole came out as the best computer science institute within the Netherlands. Website: http://www.ru.nl/is/ Conditions of employment Employment: 1,0 fte Maximum salary per month, based on a fulltime employment: ?4970 for Assistant Professor (UD 1) and ? 5,920 for Associate Professor (UHD 1 ) gross/month, depending on qualifications and experience. Salary scale: maximum scale 12 (UD) and 14 (UHD) Duration of the contract: 1 year, with possible extension to permanent Additional Information Prof.dr. Herman Geuvers (Foundations) Telephone: +31 24 3652603 E-mail:herman at cs.ru.nl Prof.dr. Tom Heskes (Machine Learning) Telephone: +31 24 3652696 E-mail: tomh at cs.ru.nl Application In order to apply please send an application, with reference to vacancy number 62.03.11, including a full CV, information on research plans and teaching experience, and names and addresses of three references) before 15 March 2011 -preferably by email- to: RU Nijmegen, FNWI, P&O, drs. D. Reinders P.O. Box 9010, 6500 GL Nijmegen, NL Telephone: +31 24 3652027 E-mail: pz at science.ru.nl No commercial propositions please. Female applicants are particularly encouraged to apply. From mattpark at microsoft.com Thu Jan 13 11:14:09 2011 From: mattpark at microsoft.com (Matthew Parkinson) Date: Thu, 13 Jan 2011 16:14:09 +0000 Subject: [TYPES/announce] Open Research Positions at Microsoft Research Cambridge Message-ID: <45F6C1B611EEBE449F713744E6D0330F0E05EF15@TK5EX14MBXC110.redmond.corp.microsoft.com> The following advertisement might be of interested to readers of the TYPES mailing list. Matt --- Open Research Positions We at MSR-Cambridge are 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. The review of applications will begin on February 1, 2011, and candidates are strongly encouraged to submit applications by that date; however, applications will continue to be accepted at least until April 30, 2011. Apply for a researcher position: https://research.microsoft.com/apps/tools/jobs/fulltime.aspx From Radu.Iosif at imag.fr Thu Jan 13 12:05:49 2011 From: Radu.Iosif at imag.fr (Radu Iosif) Date: Thu, 13 Jan 2011 18:05:49 +0100 Subject: [TYPES/announce] Post-doc position at VERIMAG, Grenoble, France Message-ID: <4D2F30ED.5000207@imag.fr> A *post-doc position* is *now open* at the VERIMAG laboratory (Grenoble, France). The research, funded by the ASOPT project (http://asopt.inrialpes.fr/), will focus on newer methods for static analysis and invariant generation by abstract interpretation, including but not limited to : * Use of SMT-solving. * Reduction to optimization or quantifier elimination problems. * Alternative iteration schemes (e.g. policy iteration). * More generally, any topic covered by the ASOPT project. The post-doc will be supervised by Dr David Monniaux, research associate at CNRS. http://www-verimag.imag.fr/~monniaux/ About VERIMAG: VERIMAG (http://www-verimag.imag.fr/; director: Nicolas Halbwachs) is a joint laboratory between the French national center for scientific research (CNRS) and the University of Grenoble. It is specialized in methods for designing and analyzing safe computing systems, including programming language design (e.g. Lustre) and verification techniques (both abstract interpretation and model-checking have roots in Grenoble). VERIMAG is located in Gi?res, a suburb of Grenoble, a city of approximately 430000 inhabitants in the French Alps. Grenoble is a first-grade academic center, with numerous laboratories, including the international organizations ESRF (European synchrotron radiation facility) and the ILL (Institut Laue-Langevin). In addition, Grenoble is surrounded by mountains and skiing resorts, and is an internationally renowned center for paragliding. About the position: The post-doc will be employed as a temporary contract worker by CNRS, for one year. -------------- next part -------------- An HTML attachment was scrubbed... URL: From birkedal at itu.dk Fri Jan 14 03:48:30 2011 From: birkedal at itu.dk (Lars Birkedal) Date: Fri, 14 Jan 2011 09:48:30 +0100 Subject: [TYPES/announce] Assistant or Associate Professors of Computer Science Message-ID: <4D300DDE.7080804@itu.dk> Assistant or Associate Professorships in Computer Science at the IT University of Copenhagen, Denmark. We are inviting applications for Assistant / Associate Professorships at the IT University of Copenhagen, in particular in the areas of Programming, Logic, and Semantics. Application deadline is February 16, 2011. Please see https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=79841&DepartmentId=5237&MediaId=1282 for the official annoucement. Potential applicants are welcome to contact me for further information. Best wishes, Lars Birkedal birkedal at itu.dk ----------------------------------------------------------------------------- Lars Birkedal Professor, Head of Programming, Logic, and Semantics Group IT University of Copenhagen Web: http://www.itu.dk/people/birkedal Phone: +45 7218 5280 Email: birkedal at itu.dk From luca.aceto at gmail.com Fri Jan 14 06:42:18 2011 From: luca.aceto at gmail.com (Luca Aceto) Date: Fri, 14 Jan 2011 11:42:18 +0000 Subject: [TYPES/announce] ICALP 2011: Call for Papers Message-ID: *The ICALP 2011 submission server is now open. NEW: Student scholarships at ICALP 2011 (see below)* ================================ ICALP 2011 - 2nd Call for Papers ================================ The 38th International Colloquium on Automata, Languages and Programming (ICALP), the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from the 4th to the 8th of July 2011 in Zurich, Switzerland. The main conference will be preceded by a series of workshops, taking place on Sunday, July 3rd, 2011 (i.e., one day before ICALP). URL: http://icalp11.inf.ethz.ch/ 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: Models, Algorithms and Information Management Algorithmic Aspects of Networks, E-commerce, Privacy, Spam, Formal Methods for Network Information Management, Foundations of Trust and Reputation in Networks, Algorithms and Models for Mobile and Wireless Networks and Computation, Models of Complex Networks, Models and Algorithms for Global Computing, Network Economics and Incentive-Based Computing Related to Networks, Models and Algorithms for Networks of Low Capability Devices, Overlay Networks and P2P Systems, Social Networks, Specification, Semantics, Synchronization of Networked Systems, Theory of Security in Networks and Distributed Computing, Web Searching and Ranking, Web Mining and Analysis Important Dates --------------- * Submission Deadline: Feb 15, 2011 * Author Notification: Apr 12, 2011 * Final Manuscript Due: April 28, 2011 Submission Guidelines --------------------- Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. 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. It is strongly recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Material other than the abstract, references and the first 12 pages may be considered as supplementary and will be read at the committee's discretion. 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. Student Scholarships -------------------- EATCS (partly sponsored by MPI-INF) has provided ten 500-Euro student scholarships. The ten scholarships will be used to support participation of students in ICALP 2011 by covering early registration and possibly some of the local expenses. To apply for one of these scholarships, please send an email to . The application should be sent by April 19th, 2011, and should contain a motivation for the sponsorship request, one letter of recommendation, the curriculum vitae of the applicant, together with an indication of whether the applicant is an author or co-author of one of the papers selected for the conference. The applications will be reviewed by the ICALP 2011 conference chairs and the PC chairs. Preference will be given to PhD students from countries where access to funds is limited who will present papers at the conference. Each applicant will receive a notification of acceptance/rejection of her/his application by email by April 30th, 2011. Invited Speakers ---------------- Rajeev Alur, University of Pennsylvania Thore Husfeldt, IT University of Copenhagen Catuscia Palamidessi, INRIA Saclay and LIX Ronen Shaltiel, University of Haifa Eva Tardos, Cornell University Program Committees ------------------ Track A: Algorithms, Complexity and Games Nikhil Bansal, Harry Buhrman, Marek Chrobak, Martin Dietzfelbinger, Thomas Erlebach, Fedor V. Fomin, Dimitris Fotakis, Ricard Gavalda, Russell Impagliazzo, Juhani Karhumaeki, Howard Karloff, Michal Koucky, Dariusz Kowalski, Stefano Leonardi, Gonzalo Navarro, Rolf Niedermeier, Rafail Ostrovsky, Guenter Rote, Christian Scheideler, Maria Serna, Jiri Sgall (chair), Gabor Tardos, Jan Vondrak, Uli Wagner, Prudence W. H. Wong Track B: Logic, Semantics, Automata and Theory of Programming Luca Aceto (chair), Anuj Dawar, Rocco De Nicola, Zoltan Esik, Wan Fokkink, Herman Geuvers, Radha Jagadeesan, Jarkko Kari, Joost-Pieter Katoen, Orna Kupferman, Francois Laroussinie, Carroll Morgan, Anca Muscholl, Hanne Riis Nielson, Prakash Panangaden, Joachim Parrow, Reinhard Pichler, Roberto Segala, Helmut Seidl, Alex Simpson, Pawel Urzyczyn Track C: Foundations of Networked Computation: Models, Algorithms and Information Management Gilles Barthes, Andras Benczur, Edith Cohen, Joan Feigenbaum, Amos Fiat, Lisa Fleischer, Georg Gottlob, Monika Henzinger (chair), Bruce Maggs, Massimo Merro, Vahab Mirrokni, Alessandro Panconesi, Giuseppe Persiano, Anna Philippou, Davide Sangiorgi, Vladimiro Sassone, Andrew Tomkins, Dorothea Wagner, Roger Wattenhofer, Ingmar Weber Conference Chairs ----------------- Michael Hoffmann, Juraj Hromkovic, Ueli Maurer, Angelika Steger, Emo Welzl, Peter Widmayer Contact: -------------- next part -------------- An HTML attachment was scrubbed... URL: From katoen at cs.rwth-aachen.de Fri Jan 14 09:26:15 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Fri, 14 Jan 2011 15:26:15 +0100 Subject: [TYPES/announce] ETAPS 2011: First Call for Participation Message-ID: <4D305D07.2090808@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** *** *** *** ETAPS 2011 *** *** March 26 - April 3, 2011 *** *** Saarbr?cken, Germany *** *** http://www.etaps.org/ *** *** *** *** First CALL FOR PARTICIPATION *** *** *** *** 222 Early Registrations Available *** *** *** ****************************************************************** ----------------------------------------------------------------------- -- REGISTRATION -- ----------------------------------------------------------------------- For online registration visit: http://www.etaps.org/registration Early (and normal) registration fees are historically low. Early registration is limited to the first 222 registrants. ----------------------------------------------------------------------- -- 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 related to Software Science. It is a confederation of five conferences, and embedded in associated events, satellite workshops and other events. ----------------------------------------------------------------------- -- ETAPS MAIN CONFERENCES -- ----------------------------------------------------------------------- CC 2011 International Conference on Compiler Construction ESOP 2011 European Symposium on Programming FASE 2011 Fundamental Approaches to Software Engineering FOSSACS 2011 Foundations of Software Science and Computation TACAS 2011 Tools and Algorithms for the Construction and Analysis of Systems ----------------------------------------------------------------------- -- ETAPS 2011 INVITED SPEAKERS -- ----------------------------------------------------------------------- Ross Anderson, Cambridge, UK Andrew Appel, Princeton, USA Gerard J. Holzmann, NASA, USA Marta Kwiatkowska, Oxford, UK Martin Odersky, EPFL, Switzerland Prakash Panangaden, McGill, Canada Andreas Podelski, Freiburg, Germany ----------------------------------------------------------------------- -- Host City: Saarbruecken, Germany -- ----------------------------------------------------------------------- Saarbr?cken is the capital of the Saarland, the smallest German federal state. Saarbr?cken has approximately 190,000 inhabitants and hence is of pleasant size. Picturesque attractions and places of historic interest are scattered around the city, and offer the perfect destination for a hike or a daytrip. The cultural palette attracts visitors from far and wide. Saarbr?cken is located very close to the French border, and half way on the high-speed railway connecting Paris and Frankfurt. Both are in less than two hours distance. For travel and accomodation information, please consult the ETAPS 2011 website: http://www.etaps.org/ ETAPS 2011 is organized by the Department of Computer Science, Saarland University and will take place in the Saarbruecken Informatics Campus, on the Saarland University premises. ----------------------------------------------------------------------- -- Associated Event -- ----------------------------------------------------------------------- TOSCA Theory of Security and Applications ----------------------------------------------------------------------- -- Satellite Workshops -- ----------------------------------------------------------------------- ACCAT Applied and Computational Category Theory Bytecode Bytecode Semantics, Verification, Analysis and Transformation COCV 10th Workshop on Compiler Optimization Meets Compiler Verification DICE 2nd International Workshop on Developments in Implicit Computational complExity FESCA Formal Foundations of Embedded Software and Component-Based Software Architectures GaLoP VI Games for Logic and Programming Languages GT-VMT International Workshop on Graph Transformation and Visual Modeling Techniques HAS Hybrid Autonomous Systems iWIGP International Workshop on Interactions, Games and Protocols LDTA 11th Workshop on Language Descriptions, Tools and Applications PLACES Programming Language Approaches to Concurrency and Communication-cEntric Software QAPL 9th Workshop on Quantitative Aspects of Programming Languages ROCKS Rigorous dependability analysis using model checking techniquesfor stochastic systems SVARM Workshop on Synthesis, Verification, and Analysis of Rich Models TERMGRAPH 6th International Workshop on Computing with Terms and Graphs WGT 3rd Workshop on Generative Technologies ----------------------------------------------------------------------- -- Tool Demonstrations -- ----------------------------------------------------------------------- Demonstrations of tools presenting advances on the state of the art have been selected and are integrated in the programmes of the main conferences. ----------------------------------------------------------------------- -- Registration (again) -- ----------------------------------------------------------------------- For online registration visit: http://www.etaps.org/registration Early (and normal) registrations fees are historically low. Early registration is limited to the first 222 registrants. ----------------------------------------------------------------------- -- Contact -- ----------------------------------------------------------------------- See http://www.etaps.org/ Any question can be adressed to etaps2011 at cs.uni-saarland.de. From iliano at cmu.edu Sat Jan 15 09:25:08 2011 From: iliano at cmu.edu (Iliano Cervesato) Date: Sat, 15 Jan 2011 17:25:08 +0300 Subject: [TYPES/announce] Postdoctoral Positions on Ensemble Programming Message-ID: <4D31AE44.5010805@cmu.edu> Postdoctoral Positions on Ensemble Programming (further details at www.qatar.cmu.edu/~iliano/projects/ripple) The School of Computer Science at Carnegie Mellon University invites applications for two postdoctoral fellow positions on effective programming for large distributed ensembles. One position will be based on the Pittsburgh campus of CMU and the other on its Qatar campus, with travel between the two. Both positions are part of a common project to develop recent work on logic-based multiset rewriting and on programmable matter (Claytronics) into a usable and verifiable programming language for large distributed ensembles of agents. The research will be conducted under the supervision of Prof. Iliano Cervesato and Prof. Seth Goldstein. The project runs from 1 December 2010 to 30 November 2013. Candidates are also encouraged to explore research ideas on top and beyond the project description. The positions provide significant opportunities for professional development. Applicants should have a strong background and interest in some combination of multiset/term rewriting, concurrency, massively distributed systems, programming language design and implementation, linear logic, logic programming or swarm robotics . The project page lists some publications and links related to the project. To apply, send a cover letter, a CV and a list of references in PDF format to seth at cs.cmu.edu and iliano at cmu.edu. Additional material will be requested as needed. This posting will stay open until filled. Early expressions of interest are encouraged. Position in Qatar In 2004, Carnegie Mellon University established a branch campus in Qatar with the goal of promoting the same high standards of research and education as its original Pittsburgh campus. CMU Qatar is located in Education City, an ultramodern 2,500 acre campus which currently hosts branches of six of the world's leading universities. The campus provides cutting-edge research facilities in a dynamic and multidisciplinary environment. Carnegie Mellon Qatar is located in Qatar's capital, Doha, an up-and-coming modern city with easy access to the world. Qatar is a small country on the East coast of the Arabian peninsula. Its abundant reserves of natural gas have resulted in it having a GDP per capita among the highest in the world. It is cosmopolitan, vibrant, yet pleasant and safe. And of course, it was recently selected to host the 2022 FIFA World Cup. The position in Qatar offers a competitive salary, a foreign service premium, excellent international health care coverage, and allowances for housing, transportation, and travel. Benefits may vary with contract type. The position comes with support for conferences and equipment. Position in Pittsburgh Carnegie Mellon's School of Computer Science is one of the world's premier institutions for computer science research and education. For the past 45 years, it has been at the forefront of innovation in all areas of computing. The position in Pittsburgh offers the standard benefits of a postdoctoral fellowship in the USA. -- Iliano Cervesato www.qatar.cmu.edu/~iliano/ Associate Professor Carnegie Mellon University From Bruno.Blanchet at ens.fr Sat Jan 15 12:35:58 2011 From: Bruno.Blanchet at ens.fr (Bruno Blanchet) Date: Sat, 15 Jan 2011 18:35:58 +0100 Subject: [TYPES/announce] CFP: FCS'11 Workshop on Foundations of Computer Security Message-ID: <20110115173558.GA26544@di.ens.fr> +-------------------------------------------------------------------------+ ! ! ! FCS 2011 ! ! Workshop on Foundations of Computer Security ! ! Toronto, Ontario, Canada ! ! June 20, 2011 ! ! http://www.di.ens.fr/~blanchet/fcs11/ ! ! ! ! Affiliated with LICS 2011 ! ! ! +-------------------------------------------------------------------------+ Important dates =============== Abstracts due: March 29, 2011 Papers due: April 3, 2011 Notification of acceptance: April 29, 2011 Final papers: May 23, 2011 Background, aim and scope ========================= Computer security is an established field of computer science of both theoretical and practical significance. In recent years, there has been increasing interest in logic-based foundations for various methods in computer security, including the formal specification, analysis and design of security protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, and the modeling of information flow and its application to confidentiality policies, system composition, and covert channel analysis. The aim of the workshop FCS'11 is to provide a forum for continued activity in different areas of computer security, bringing computer security researchers in closer contact with the LICS community and giving LICS attendees an opportunity to talk to experts in computer security, on the one hand, and contribute to bridging the gap between logical methods and computer security foundations, on the other. We are interested both in new results in theories of computer security and also in more exploratory presentations that examine open questions and raise fundamental concerns about existing theories, as well as in new results on developing and applying automated reasoning techniques and tools for the formal specification and analysis of security protocols. We thus solicit submissions of papers both on mature work and on work in progress. Possible topics include, but are not limited to: Automated reasoning techniques Composition issues Formal specification Foundations of verification Information flow analysis Language-based security Logic-based design Program transformation Security models Static analysis Statistical methods Tools Trust management for Access control and resource usage control Authentication Availability and denial of service Covert channels Confidentiality Integrity and privacy Intrusion detection Malicious code Mobile code Mutual distrust Privacy Security policies Security protocols Submission ========== All submissions will be peer-reviewed. Authors of accepted papers must guarantee that their paper will be presented at the workshop. Submissions should be at most 15 pages (a4paper, 11pt), including references in the Springer LNCS style available at the URL http://www.springer.de/comp/lncs/authors.html The cover page should include title, names of authors, co-ordinates of the corresponding author, an abstract, and a list of keywords. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referees but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Authors are invited to submit their papers electronically, as portable document format (pdf) or postscript (ps); please, do not send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). The only mechanism for paper submissions is via the dedicated EasyChair submission web page: https://www.easychair.org/account/signin.cgi?conf=fcs2011 Please follow the instructions given there. Publication =========== Informal proceedings will be made available in electronic format and they will be distributed to all participants of the workshop. Program committee ================= * Bruno Blanchet (INRIA, Ecole Normale Sup?rieure, CNRS, France; co-chair) * Michele Boreale (Universit? di Firenze, Italy) * Adam Chlipala (Harvard University, USA) * V?ronique Cortier (LORIA INRIA-Lorraine, France) * Andrew D. Gordon (Microsoft Research Cambridge, UK) * Matthew Hennessy (Trinity College Dublin, Ireland) * Alan Jeffrey (Bell Labs, USA; co-chair) * Matteo Maffei (Saarland University, Germany) * Benjamin Pierce (University of Pennsylvania, USA) * Pierangela Samarati (Universit? degli Studi di Milano, Italy) * David Sands (Chalmers University of Technology, Sweden) * Geoffrey Smith (Florida International University, USA) * Bogdan Warinschi (University of Bristol, UK) From ohad.kammar at ed.ac.uk Sat Jan 15 14:05:28 2011 From: ohad.kammar at ed.ac.uk (Ohad Kammar) Date: Sat, 15 Jan 2011 19:05:28 +0000 Subject: [TYPES/announce] Course: Introduction to Dependently Typed Programming using Agda In-Reply-To: References: Message-ID: LFCS, University of Edinburgh presents: **** ? ? ?Introduction to Dependently Typed Programming using Agda ?**** by Conor McBride, MSP, University of Strathclyde More information available at: http://homepages.inf.ed.ac.uk/s0894694/agda-course/ Location ======= School of Informatics, University of Edinburgh, Scotland. Description ========= Types guarantee properties of runtime behaviour. Dependent types give stronger guarantees based on runtime values. In this course we shall introduce dependently typed programming using the Agda programming language. The course consists of five weekly afternoon sessions with lectures and hands-on laboratories. Exercises between sessions will be set. Refreshments will be provided during breaks. Prerequisites ========== ?This is a research level course. We assume basic familiarity with a functional programming language, such as Haskell or ML, in particular pattern matching and higher-order functions like map. This course is supported by the Scottish Informatics and Computer Science Alliance. Dates ===== Mondays, January 31, 2011 - February 28, 2011. Registration ========== ?Please let us know you are coming so we can prepare accordingly: Ohad Kammar ?< ?ohad.kammar ? ? ?at ? ? ed.ac.uk> More information available at: --------------------------------------- ?http://homepages.inf.ed.ac.uk/s0894694/agda-course/ -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From aarne at chalmers.se Sat Jan 15 14:56:20 2011 From: aarne at chalmers.se (Aarne Ranta) Date: Sat, 15 Jan 2011 20:56:20 +0100 Subject: [TYPES/announce] GF Summer School, Barcelona, 15-26 August Message-ID: FIRST CALL FOR PARTICIPATION GF Summer School Frontiers of Multilingual Technologies Barcelona, 15-26 August 2011 http://school.grammaticalframework.org ================================== GF, Grammatical Framework, is a multilingual grammar formalism based on the idea of a shared abstract syntax and mappings between the abstract syntax and concrete languages. GF has hundreds of users all over the world. The summer school is a collaborative effort to create grammars of new languages in GF and advanced multilingual GF applications. The new grammars are added to the Resource Grammar Library, which currently has 18 languages. Applications are parsing and generation programs compiled from GF grammars and usable as parts of programs written in other languages: e.g. Haskell, Java, Python, and JavaScript. GF applications can also be run on Android phones. Moreover, the school will address hybrid systems combining GF with statistical machine translation (SMT). Topics: Introductory and Advanced Tutorials on GF, Type Theory, SMT, Parsing and Multilingual Application Development Registration and Contact: http://school.grammaticalframework.org Location: Vertex Building, UPC, Barcelona Organizers: O. Caprotti, L. M?rquez, A. Ranta, J. Saludes, S. Xamb? Travel Grants: Via application procedure Sponsors: CLT Gothenburg, MOLTO EU FP7-ICT-247914, UPC. -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Sun Jan 16 16:49:53 2011 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sun, 16 Jan 2011 23:49:53 +0200 Subject: [TYPES/announce] PPDP 2011, Call for papers Message-ID: <20110116234953.26477570@duality> ====================================================================== CALL FOR PAPERS PPDP 2011 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www-ps.informatik.uni-kiel.de/ppdp11/ July 20-22, 2011, Odense, Denmark (in cooperation with ACM SIGPLAN, co-located with LOPSTR 2011) ====================================================================== PPDP 2011 aims to provide a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will held in cooperation with ACM SIGPLAN and take place in July 2011 in Odense, Denmark, co-located with the 21st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011). TOPICS: - Logic, Constraint, and Functional Programming - Database, AI and Knowledge Representation Languages - Visual Programming - Executable Specification Languages - Applications of Declarative Programming - Methodologies: Program Design and Development - Declarative Aspects of Object-Oriented Programming - Concurrent Extensions to Declarative Languages - Declarative Mobile Computing - Integration of Paradigms - Proof Theoretic and Semantic Foundations - Type and Module Systems - Program Analysis and Verification - Program Transformation - Abstract Machines and Compilation - Programming Environments This list is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. IMPORTANT DATES: Abstract submission: March 8, 2011 Paper submission: March 15, 2011 Notification: April 19, 2011 Camera-ready version: May 12, 2011 Symposium: July 20-22, 2011 SUBMISSION GUIDELINES: Papers should be submitted via the submission website for PPDP 2011: http://www.easychair.org/conferences/?conf=ppdp11 Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. PROCEEDINGS: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. PROGRAM COMMITTEE: Peter Achten Radboud University Nijmegen, The Netherlands Sergio Antoy Portland State University, USA Michael Codish Ben-Gurion University of the Negev, Israel Moreno Falaschi Universita di Siena, Italy Amy Felty University of Ottawa, Canada Michael Hanus University of Kiel, Germany (Chair) Andy King University of Kent, UK Helene Kirchner INRIA, France Francisco J. Lopez Fraguas Universidad Complutense de Madrid, Spain Salvador Lucas Universidad Politecnica de Valencia, Spain Simon Peyton Jones Microsoft Research, Cambridge, UK Kostis Sagonas Uppsala University, Sweden Peter Schneider-Kamp University of Southern Denmark, Denmark Doaitse Swierstra Utrecht University, The Netherlands Paul Tarau University of North Texas, USA Peter Thiemann University of Freiburg, Germany Kazunori Ueda Waseda University, Japan Tarmo Uustalu Tallinn University of Technology, Estonia Peter Van Roy Catholic University of Louvain, Belgium For more information, contact the chairs: Program Chair: Michael Hanus University of Kiel, Germany Email: mh at informatik.uni-kiel.de Symposium Chair: Peter Schneider-Kamp University of Southern Denmark Email: petersk at imada.sdu.dk ---------------------------------------------------------------------- From soloviev at irit.fr Mon Jan 17 14:06:10 2011 From: soloviev at irit.fr (soloviev at irit.fr) Date: Mon, 17 Jan 2011 20:06:10 +0100 (CET) Subject: [TYPES/announce] professor position in computer science at IRIT, Toulouse Message-ID: <42560.141.115.78.21.1295291170.squirrel@websecu.irit.fr> As usual, apologies for (possible) multiple postings. Sergei Soloviev =========================================================================== Professor position in Computer Science (starting September 2011) Profile: Dynamic Methods in Assisted Proof and Program Verification Context: the teaching position is to be opened at the Informatics Department of the University Toulouse-3. The research activities of a successful candidate are to be developed within IRIT (Institut de Recherche en Informatique de Toulouse), CNRS UMR 5505, team Acadie. Teaching duties: an important place is given to teaching related to the theory of algorithms, programming and software development (undergraduate and graduate level in computer science). Research tasks: the role of dynamic analysis of programs and systems is very important nowadays, in particular because autonomous and semi-autonomous, embedded and distributed systems are more and more common. In the theme 7 "Safety of software development" of IRIT, to which the team Acadie belongs, this trend is manifests in the growing role of the interactive methods of verification ? interactive proof development, model transformations, transformation verification. Taking into account the role of proof development and interactive methods of verification for the theme "Safety of software development" at IRIT, we would like to put forward for this position dynamic methods of proof and verification, in particular methods related to game theory, concurrency theory, agent-oriented semantics, etc. Our principal interest is to find a candidate that could bring new competencies but who could at the same time participate actively in the research of our team that has modeling, interactive proof development, computer assisted and automated verification as its main expertise. Other activities : The position implies the usual administrative and organizational responsibilities related to teaching and research: - participation in jury, implementation of new courses and other teaching activities, councils, diverse committees, tutorship, mentoring of internships, etc. - research management, councils and diverse committees at the IRIT and/or at regional research structures, organization of conferences, responsibility for contracts and projects, etc. Important: for candidates that are not French, the French habilitation and qualification certificate are actually not required. The University Scientific Council will decide on the equivalence of diplomas and other filed documents. A good level of French is required for teaching. Contact Team : ACADIE Site : IRIT, Paul Sabatier University Phone (contact with the director of IRIT): +33 (0) 5 34 32 21 54 e-mail : direction at irit.fr web site : http ://www.irit.fr/ Pedagogical team: Paul Sabatier University - Toulouse-3 Department : Informatics (UFR MIG) Director of the department : R?gine Andr?-Obrecht Phone :+33 5 61 55 68 86 e-mail: R?gine Andr?-Obrecht URL: http://www.ufr-mig.ups-tlse.fr/enseignement/departements/informatique/index.php From Lutz.Schroeder at dfki.de Tue Jan 18 04:15:53 2011 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Tue, 18 Jan 2011 10:15:53 +0100 Subject: [TYPES/announce] OSEMA 2011 Call for Papers Message-ID: <4D355A49.7050308@dfki.de> [This workshop may be of some interest to members of the types list -- although the dominant ontology languages are currently largely untyped, many people do use typed frameworks up to and including HOL as ontology languages, and especially the engineering domain generates interest in partially typed logics such as combinations of description logics with data types] OSEMA 2011 Call for Papers 1st International Workshop on Ontology and Semantic web for Manufacturing (OSEMA 2011) http://www.osema.org.ve/ at the 8th Extended Semantic Web Conference (ESWC 2011) http://www.eswc2011.org May 29th or 30th, Hersonissos, Crete, Greece SUBMISSION DEADLINE February 25 The necessity of continuous innovation and improvement in productivity presents the manufacturing industry with huge challenges. Not only is there a demand for more creative designs, there is also the need to improve support for streaming designs into production lines. Delivering products to the market involves the flow of information between several steps ranging from design to prototyping, manufacturing and distributing. Interoperability across software supporting these activities is notoriously limited. A semantic layer in the manufacturing sector may facilitate scenarios such as the development of new products considering restrictions and limitations of the manufacturing facility on the one hand and on the other hand considering customer needs. Here, the design of new the product is instantiated into a product ontology. This ontology has metadata including features related to materials, colors, dimensions, etc. Such features reflect customer preferences, but imply the necessity of processes to acquire and manage them. In a second step into this scenario, the ontology of the manufacturing process can be instantiated by extracting features from the product ontology, thus enabling e.g. the automatic inference of manufacturability of the product. In this vein, ontologies and the Semantic Web facilitate the creation of such metadata and enable reasoning over product and process restriction. Although several approaches of this kind have been proposed, none of them are widely accepted so far, which means that there are still several issues requiring extensive discussion and consensus in the community. Therefore, it is necessary to provide a discussion scenario where theoretical positions, best practices, implementations, proposals of standards, and frameworks are presented. It will deserve special interest to discuss how the manufacturing industry can take advantage of Semantic Web technologies. OSEMA 2011 aims to provide such scenario. QUESTIONS AND TOPICS OF INTEREST - How can the Semantic Web support the development of new products? - Why CAD ontologies? Do we really need them? - Do we need one enterprise ontology, or a modular enterprise ontology? - Can OWL be used to represent processes in the manufacturing domain? - Knowledge management over the manufacturing ?Know how?. - How can the versioning of products be managed? Can ontology help? How? - How can raw materials be semantically described? - Can there be an ontological framework for manufacturing so that designs and production are interoperable? - Semantic search over the manufacturing information space - How can tagging techniques be applied within the manufacturing domain? AUDIENCE We want to bring together researchers and practitioners active in the design, development, and application of ontologies and the Semantic Web in the manufacturing domain, as well as industrial representatives in Computer Aided Design (CAD), Computer Aided Process Planning (CAPP), and Computer Aided Manufacturing (CAM) industry who are interested in integrating the Product Life Cycle management into their software tools. IMPORTANT DATES Submission deadline: February 25, 2011 Acceptance notification: April 1, 2011 Camera-ready: April 15, 2011 Workshop date: May 29 or 30, 2011 SUBMISSION AND PROCEEDINGS Only electronic submissions will be considered. All submissions should be submitted in pdf format, to https://www.easychair.org/conferences/?conf=osema2011 Submissions should not exceed 14 pages and should be formatted according to the LNCS Springer format (http://www.springer.com/east/home/computer/lncs?SGWID=5-164-7-72376-0). The workshop proceedings will both be uploaded to CEUR (http://ceur-ws.org/) and placed on electronic media for distribution at the conference. PROGRAM COMMITTEE 1. Aristeidis Matsokis, Laboratory for Computer Aided Design and Production, Switzerland. 2. Aziz Bouras, University Claude Bernard Lyon II, France. 3. David Baxter, University of Cranfield, England 4. Dong Yang, Shanghai jiao Tong University, China. 5. Grubic Tonci, University of Cranfield, England. 6. John Bateman, University of Bremen, Germany. 7. J?rgen Angele, Ontoprise, Germany. 8. Kristina Shea, Technische Universit?t M?nchen, Germany. 9. Oliver Eck, Department of Computer Science, HTWG Konstanz, Germany. 10. Parisa Ghoudous, University Claude Bernard Lyon I, France. 11. Richard Gil Herrera, University Sim?n Bolivar. Venezuela. 12. Sylvere Krima, National Institute of Standards and Technology (NIST), USA. 13. Yuh-Jen Chen, National Kaohsiung First University of Science and Technology, Taiwan. ORGANIZING COMMITTEE * Alexander Garc?a Castro, University of Bremen, Germany/University of Arkansas, USA. Email: alexgarciac at gmail.com * Lutz Schr?der, German Research Center for Artificial Intelligence (DFKI). Email: Lutz.Schroeder at dfki.de * Carlos Toro, Vicomtech Research Centre / Donostia-San Sebast?an, Spain. Email: ctoro at vicomtech.org * Luis Enrique Ramos Garc?a, University of Bremen, Germany. Email: s_7dns7r at uni-bremen.de -- -------------------------------------- PD Dr. Lutz Schr?der Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder at dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum f?r K?nstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch?ftsf?hrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From freek at cs.ru.nl Tue Jan 18 04:33:22 2011 From: freek at cs.ru.nl (Freek Wiedijk) Date: Tue, 18 Jan 2011 10:33:22 +0100 Subject: [TYPES/announce] ITP 2011 (Call for Workshop Proposals) Message-ID: <20110118093322.GA14945@cs.ru.nl> Call for Workshop Proposals ITP 2011: 2nd International Conference on Interactive Theorem Proving 22-25 August 2011, Nijmegen, The Netherlands http://itp2011.cs.ru.nl/ ----- ITP brings together researchers working in all areas of interactive theorem proving. The inaugural meeting of ITP was held on 11-14 July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC, 9-21 July 2010). The second edition of ITP will take place in Nijmegen, The Netherlands, on 22-25 August 2011. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. Researchers and practitioners are invited to submit proposals for workshops on topics relating to interactive theorem proving. Workshops can target the ITP community in general or be focused to one particular ITP system. Possible dates for workshops are 26 and 27 August 2011 (two days after ITP). The duration of workshops can be one or two days. Important dates: Submission deadline: 13 February 2011 Notification: 13 March 2011 Workshop proposals should be submitted per email to itp2011 at easychair.org. All accepted workshops will be expected to have the programme ready by July 1st 2011. The workshop selection committee consists of the ITP chairs: Marko Van Eekelen, Radboud University Nijmegen/Open University of the Netherlands Herman Geuvers, Radboud University Nijmegen Julien Schmaltz, Open University of the Netherlands/Radboud University Nijmegen Freek Wiedijk, Radboud University Nijmegen From viktor at mpi-sws.org Tue Jan 18 08:12:27 2011 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Tue, 18 Jan 2011 14:12:27 +0100 Subject: [TYPES/announce] Postdoc position at MPI-SWS in software verification Message-ID: <0DB62C3A-7538-4443-9364-95BCB91BBB91@mpi-sws.org> Applications are invited for a full-time postdoctoral research position in the Software Analysis and Verification group, headed by Viktor Vafeiadis, at the Max Planck Institute for Software Systems (MPI-SWS). The initial postdoc appointment is for two years, starting anytime, with an option to extend to a third year (depending on performance). The position is relatively independent in that it is not tied to a specific project and there is considerable freedom to choose a research topic. To get a sense of the kind or research I do, see my webpage (http://www.mpi-sws.org/~viktor/). The successful candidate will have a strong background in at least one of the following areas: * separation logic (and/or other program logics) * interactive theorem proving (e.g., Coq or Isabelle) * static analysis (abstract interpretation) * concurrent algorithms and/or relaxed memory models * compilers (esp. for concurrent programs) Qualified candidates are encouraged to contact me directly by e-mail (viktor AT mpi-sws DOT org), as well as to submit an online application to: https://apply.mpi-sws.org/ About the institute: MPI-SWS, founded in 2005, is part of a network of eighty Max Planck Institutes, Germany's premier basic research facilities. MPIs have an established record of world-class, foundational research in the fields of medicine, biology, chemistry, physics, technology and humanities. Since 1948, MPI researchers have won 17 Nobel prizes. MPI-SWS aspires to meet the highest standards of excellence and international recognition with its research in software systems. The institute is located in Kaiserslautern and Saarbruecken, in the tri-border area of Germany, France and Luxembourg. (The advertised position is at Kaiserslautern.) The area offers a high standard of living, beautiful surroundings and easy access to major metropolitan areas in the center of Europe, as well as a stimulating, competitive and collaborative work environment. In immediate proximity are the MPI for Informatics, Saarland University, the Technical University of Kaiserslautern, the German Center for Artificial Intelligence (DFKI), and the Fraunhofer Institutes for Experimental Software Engineering and for Industrial Mathematics. The institute maintains an open, international and diverse work environment and seeks applications from outstanding researchers regardless of national origin or citizenship. The working language is English; knowledge of the German language is not required. Salaries are competitive with other academic institutions in Europe. Postdocs also receive funding for travel to conferences and collaborating institutions. More information about MPI-SWS, see http://www.mpi-sws.org/ From roberto at dicosmo.org Tue Jan 18 14:58:29 2011 From: roberto at dicosmo.org (Roberto Di Cosmo) Date: Tue, 18 Jan 2011 20:58:29 +0100 Subject: [TYPES/announce] Associate professor position at PPS (Paris, France): programming in the large, theory and applications In-Reply-To: <0DB62C3A-7538-4443-9364-95BCB91BBB91@mpi-sws.org> References: <0DB62C3A-7538-4443-9364-95BCB91BBB91@mpi-sws.org> Message-ID: <20110118195829.GA13253@traveler> ====================================================== Assistant professor (Maitre de Conferences) position University Paris 7 Denis Diderot Laboratory PPS (www.pps.jussieu.fr) Web: https://www.pps.jussieu.fr/annonces/2010-mdc ====================================================== A Maitre de Conference permanent position (~ Assistant Professor) is being opened within the Laboratory PPS located at University Paris Diderot (see: http://www.pps.jussieu.fr). We are looking for strong junior-level candidates who will be able to contribute to the ongoing effort made in the PPS lagoratory to study the foundations of programming. You can find more information on what is a 'Maitre de Conference', including an approximate salary scale, on a french page on Wikipedia http://fr.wikipedia.org/wiki/Ma%C3%AEtre_de_conf%C3%A9rences_%28France%29 Important dates --------------- Date of formal publication of the position: Februrary 24th 2011 Deadline for sending the complete application: March 25th 2011 Expected date of the interview of candidates May 2011 Start of the position September 2011 Research area of the position ----------------------------- The researcher to be recruited is expected to contribute to the current research activities of the PPS laboratory on various challenges arising from programming in the large: complex software systems based on heterogeneous, possibly distributed components with short development lifecycles; theory and applications of formal methods to large codes or code bases, possibly leading to the development of tools for improving the quality of software systems, especially free and open source software. Potential candidates are encouraged to peruse the laboratory web site (http://www.pps.jussieu.fr), as well as the websites of some of the research projects hosted there, like Mancoosi (http://www.mancoosi.org), CerCo (http://cerco.cs.unibo.it/), CDuce (http://www.cduce.org/) and Ocsigen (http://ocsigen.org/). In PPS, the candidate will find a unique blend of computer scientists, with strong formal basis rooted in mathematics, and a passion for programming and applications: this is why, while the position description may seem more oriented towards applications, strong candidates in theoretical computer science are very welcome and should not hesitate in contacting us. Please notice that this position involves teaching, in French and proficiency in this language is necessary at the time the position is taken (September 2011). Application procedure --------------------- The candidates will need to enter their application through the French nationwide portal Galaxie, starting from February 24th https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/candidats.html and are required to have previously obtained a 'qualification' (if you do not know what this is, we are afraid it will be too late to obtain one). Contact ------- Interested candidates are invited to contact us at candidats at sympa.mancoosi.univ-paris-diderot.fr --Roberto Di Cosmo ------------------------------------------------------------------ Professeur En delegation a l'INRIA PPS E-mail: roberto at dicosmo.org Universite Paris Diderot WWW : http://www.dicosmo.org Case 7014 Tel : ++33-(0)1-57 27 92 20 5, Rue Thomas Mann F-75205 Paris Cedex 13 Identica: http://identic.ca/rdicosmo FRANCE. Twitter: http://twitter.com/rdicosmo ------------------------------------------------------------------ Attachments: MIME accepted Word deprecated, http://www.rfc1149.net/documents/whynotword ------------------------------------------------------------------ Office location: Bureau 6C08 (6th floor) 175, rue du Chevaleret, XIII Metro Chevaleret, ligne 6 ------------------------------------------------------------------ From wintersmind at gmail.com Tue Jan 18 22:27:15 2011 From: wintersmind at gmail.com (Christian Skalka) Date: Tue, 18 Jan 2011 22:27:15 -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 2011 under the supervision of Prof. Christian Skalka. Research under this assistanship will focus on topic areas related to Types in Programming Languages and Wireless Sensor Networks (WSNs). Directions include: - Well-typed staged programming for resource constrained WSNs - 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: Applications must be accepted by February 1, 2011 in order to be considered for Fall 2011 assistantship. -- 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 bruni at di.unipi.it Wed Jan 19 10:36:11 2011 From: bruni at di.unipi.it (Roberto Bruni) Date: Wed, 19 Jan 2011 16:36:11 +0100 Subject: [TYPES/announce] FMOODS & FORTE 2011 - Second CfP Message-ID: <4D3704EB.6090306@di.unipi.it> [Apologies for multiple copies] --------------------------------------------------------------------- Call for Papers FMOODS & FORTE 2011 IFIP Int. Conference on Formal Techniques for Distributed Systems joint international conference 13th Formal Methods for Open Object-Based Distributed Systems 31th Formal Techniques for Networked and Distributed Systems part of the federated event DisCoTec'11 (Distributed Computing Techniques) Reykjavik, Iceland, June 6-9, 2011 http://discotec.ru.is/fmoodsforte/main ========================================================================== Important dates * February 6, 2011 Abstract Submission * February 13, 2011 Paper Submission * March 20, 2011 Notification of Acceptance * April 3, 2011 Camera ready version * June 6-8, 2011 Conference * June 9, 2011 Workshops -------------------------------------------------------------------------- Objectives and Scope The joint conference FMOODS & FORTE is a forum for fundamental research on theory and applications of distributed systems. The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of: * component- and model-based design * object technology, modularity, software adaptation * service-oriented, ubiquitous, pervasive, grid, cloud and mobile computing systems * software quality, reliability and security The conference encourages contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems. FMOODS & FORTE covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real time systems, as well as networking and communication security and reliability. -------------------------------------------------------------------------- Topics of interest include but are not limited to: * Languages and Semantic Foundations: new modeling and language concepts for distribution and concurrency, semantics for different types of languages, including programming languages, modeling languages, and domain specific languages; real-time and probability aspects; type systems and behavioral typing * Formal Methods and Techniques: design, specification, analysis, verification, validation and testing of various types of distributed systems including communications and network protocols, service-oriented systems, and adaptive distributed systems * Applications of Formal Methods: applying formal methods and techniques for studying quality, reliability and security of distributed systems, particularly web services, multimedia and telecommunications systems * Practical Experience with Formal Methods: industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems -------------------------------------------------------------------------- Invited Speaker: Giuseppe Castagna -------------------------------------------------------------------------- Proceedings and Submission guidelines The FMOODS & FORTE 2011 conference calls for high quality papers presenting research results and/or application reports related to the research areas in conference scope. The conference proceedings will be published by Springer Verlag in the LNCS series. Proceedings will be made available at the conference. All papers must be original, unpublished, and not submitted for publication elsewhere. Contributions should be submitted electronically in PDF via the EasyChair system at the URL https://www.easychair.org/account/signin.cgi?conf=fmoodsforte11 Each paper will undergo a peer review of at least 3 anonymous reviewers. The papers must be prepared using the SPRINGER LNCS style, available at the URL http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 Papers must not exceed 15 pages in length, including figures and references. For referees' convenience, any additional material that may help assessing the merits of the submission but not to be included in the final version, like some detailed proofs, may be placed in a clearly marked appendix (not to be counted in the page limit). Referees are at liberty to ignore the appendix, and papers must be understandable without them. Submissions not adhering to the above specified constraints may be rejected immediately, without review. -------------------------------------------------------------------------- Programme Committee - Saddek Bensalem, University Joseph Fourier, France - Dirk Beyer, University of Passau, Germany - Gregor Bochmann, University of Ottawa, Canada - Roberto Bruni (co-chair), University of Pisa, Italy - Nancy Day, University of Waterloo, Canada - John Derrick, University of Sheffield, UK - Juergen Dingel (co-chair), Queen's University, Kingston, Canada - Khaled El-Fakih, American University of Sharjah, UAE - Holger Giese, University of Potsdam, Germany - John Hatcliff, Kansas State University, USA - Valerie Issarny, INRIA Paris Rocquencourt, France - Claude Jard, INRIA/IRISA Rennes, France - Einar Broch Johnsen, University of Oslo, Norway - Ferhat Khendek, Concordia University, Canada - Jay Ligatti, University of South Florida, USA - Luigi Logrippo, University of Quebec - Outaouais, Canada - Niels Lohmann, University of Rostock, Germany - Fabio Massacci, University of Trento, Italy - Uwe Nestmann, Technical University of Berlin, Germany - Peter Olveczky, University of Oslo, Norway - Alexandre Petrenko, CRIM Montreal, Canada - Frank Piessens, Katholieke Universiteit Leuven, Belgium - Andre Platzer, Carnegie Mellon University, USA - Antonio Ravara, Technical University of Lisbon, Portugal - Ken Turner, University of Stirling, UK - Keiichi Yasumoto, Nara Institute of Science and Technology, Japan - Nobuko Yoshida, Imperial College London, UK - Elena Zucca, University of Genova, Italy -------------------------------------------------------------------------- Steering Committee - Gilles Barthe, IMDEA Software, Spain - Gregor v. Bochmann, University of Ottawa, Canada - Frank S. de Boer, Centrum voor Wiskunde en Informatica, the Netherlands - John Derrick, University of Sheffield, UK - Khaled El-Fakih, American University of Sharjah, UAE - Roberto Gorrieri, University of Bologna, Italy - John Hatcliff, Kansas State University, USA - David Lee, The Ohio State University, USA - Antonia Lopes, University of Lisbon, Portugal - Elie Najm (chair), Telecom ParisTech, France - Arnd Poetzsch-Heffter, University of Kaiserslautern, Germany - Antonio Ravara, Technical University of Lisbon, Portugal - Carolyn Talcott, SRI International, USA - Ken Turner, University of Stirling, UK - Keiichi Yasumoto, NAIST, Japan - Elena Zucca, University of Genova, Italy -------------------------------------------------------------------------- Contact Information fmoodsforte11 at easychair.org -------------------------------------------------------------------------- -- ===================================================================== Dr. Roberto Bruni Computer Science Department Phone: +39 050 2212785 University of Pisa Fax: +39 050 2212726 Largo B. Pontecorvo, 3 Email: bruni at di.unipi.it I-56127 Pisa - ITALY WWW: http://www.di.unipi.it/~bruni ===================================================================== "We think in generalities, but we live in detail" Alfred N. Whitehead ===================================================================== From koehler at informatik.uni-hamburg.de Wed Jan 19 09:19:58 2011 From: koehler at informatik.uni-hamburg.de (=?iso-8859-1?Q?=22Dr=2E_Michael_K=F6hler-Bussmeier=22?=) Date: Wed, 19 Jan 2011 15:19:58 +0100 Subject: [TYPES/announce] CfP: 4th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM'11), 10 September 2011, Aachen, Germany Message-ID: <88D4493A-1271-4071-BC56-44008A2F563B@informatik.uni-hamburg.de> *** CALL FOR PAPER *** 4th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM'11), 10 September 2011, Aachen, Germany, organised as satellite workshop at the Twenty-Second International Conference on CONCURRENCY THEORY (CONCUR 2011). Organisers: Berndt M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://web.me.com/farwer/LAM11 * 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. 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 established itself as a serious contender against 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 scientific and technological challenges for the modelling and programming of such large-scale, open and highly-dynamic distributed systems. 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 verification of mobile agent systems. In the past two or three years, some logics have been proposed that would be able to handle certain aspects of these requirements, but 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 the areas outlined above with a focus on logics and other formalisms for the specification 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 - 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 * 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 a discussion session. The latter is 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'11 workshop. Submissions should not exceed 15 pages, preferably using the LaTeX article.sty class. The following formats are accepted: PDF, PS. Please send your submission electronically via EasyChair: http://www.easychair.org/conferences/?conf=lam11 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: June 13, 2011 Workshop: 10 Sept 2011 -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 1725 bytes Desc: not available URL: From vv at di.fc.ul.pt Fri Jan 21 04:41:43 2011 From: vv at di.fc.ul.pt (Vasco T. Vasconcelos) Date: Fri, 21 Jan 2011 09:41:43 +0000 Subject: [TYPES/announce] POSTDOC Position in Lisbon (Carnegie Mellon | Portugal Research Project) Message-ID: <05A11DB9-A08E-401E-9503-50B577B30A18@di.fc.ul.pt> We welcome applications for a post-doctoral scholarship. *** DEADLINE 30 FEBRUARY 2011 **** The position is funded by the research project "Certified Interfaces for Integrity and Security in Extensible Web-based Applications", CMU-PT/NGN/0044/2008, in the context of the Carnegie Mellon-Portugal partnership, an international research / educational initiative launched by FCT, the portuguese national science foundation (see www.cmuportugal.org). Project partners are CITI FCT UNL (L. Caires), LASIGE FC UL (V. Vasconcelos), Carnegie Mellon CSD (F. Pfenning), and industrial partner OutSystems SA. The hosting environment will be the GLOSS Group at LASIGE, with extended visits to Carnegie Mellon Department of Computer Science. More information about the research environment may be found at websites of the hosting institutions. The objective of the project is the development of techniques for enforcing security, integrity, and correctness requirements on distributed extensible web-based applications by introducing novel, semantically rich notions of interface description languages, based on advanced type systems and logics, such as resource / epistemic logics and behavioral / session types. We seek applicants with strong interest in some of the following topics: programming language design and implementation, programming logics and types, verification, and concurrency. The contract is for one year, extensible until the end of 2012. Administrative rules applicable may be found in the FCT/MCTES site in http://alfa.fct.mctes.pt/apoios/bolsas/. Applications should include a curriculum vitae in pdf format, contact details for three referees, and should be sent to LaSIGE - Laborat?rio de Sistemas Inform?ticos de Grande-Escala Faculdade de Ci?ncias da Universidade de Lisboa Departamento de Inform?tica Edif?cio C6, Piso 3, Sala 30 Campo Grande 1749-016 Lisboa Portugal Phone: +351 21 750 05 32 Fax: +351 21 750 05 33 Email: Pedro Gon?alves, pgoncalves at di.fc.ul.pt Please email us for any further questions about the positions and the related research project, Best regards, Luis Caires, luis.caires(at)di.fct.unl.pt Frank Pfenning, fp(at)cs.cmu.edu Vasco Vasconcelos, vv(at)di.fc.ul.pt From gerardo at ifi.uio.no Fri Jan 21 08:23:37 2011 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Fri, 21 Jan 2011 14:23:37 +0100 Subject: [TYPES/announce] CfP: The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11) Message-ID: <91FCBAD8-6DFD-487B-94AA-FAB9269A95CB@ifi.uio.no> ========================================================= CALL FOR PAPERS - SEFM 2011 The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM) 14-18 November 2011 Montevideo, Uruguay URL: http://www.fing.edu.uy/inco/eventos/SEFM2011 ++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES * Title and abstract submission deadline: 23 April 2011 * Paper submission deadline: 30 April 2011 * Acceptance/rejection notification: 15 June 2011 * Camera-ready version due: 15 July 2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. Papers that combine formal methods and software engineering are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic. These can either be normal or short papers. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Daniel Le M?tayer - INRIA, France * More to be announced... SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development". A separate Call for Papers is available for the special track. All queries on submissions to the special track should be sent to: sefm2011-msd at iist.unu.edu. LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (R?o de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. All papers must be written in English. Research and tool papers must not exceed 16 pages in the LNCS format while short papers must not exceed 8 pages in the LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). All queries on the submissions should be sent to: sefm2011 at fing.edu.uy. Papers must be submitted electronically via the Easychair System: http://www.easychair.org/conferences/?conf=sefm11 The proceedings will be published in the Springer Lecture Notes in Computer Science series (LNCS). After the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a special issue of the SoSyM journal (Software and Systems Modeling, Springer), following the standard reviewing process of the journal. COMMITTEES Conference Chair * Alberto Pardo, Universidad de la Rep?blica, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering (Graz University of Technology, Austria) * Luis Barbosa (University of Minho, Portugal) * Gilles Barthe (IMDEA Software, Spain) * Thomas Anung Basuki (UNU-IIST, China) * Alexandre Bergel (University of Chile, Chile) * Gustavo Betarte (Universidad de la Rep?blica, Uruguay) * Ana Cavalcanti (University of York, UK) * Pedro R. D'Argenio (Univ. Nacional de C?rdoba, Argentina) * Van Hung Dang (UNU-IIST, China) * George Eleftherakis (SEERC, Greece) * Jos? Luiz Fiadeiro (University of Leicester, UK) * Martin Fr?nzle (Oldenburg University, Germany) * Stefania Gnesi (ISTI-CNR, Italy) * Rob Hierons (Brunel University, UK) * Paola Inverardi (University of L'Aquila, UK) * Jean-Marie Jacquet (University of Namur, Belgium) * Tomasz Janowski (UNU-IIST, China) * Jean-Marc Jezequel (IRISA, France) * Joseph Kiniry (IT University of Copenhagen, Denmark) * Paddy Krishnan (Bond University, Australia) * Martin Leucker (TU Munich, Germany) * Xuandong Li (Nanjing University, China) * Peter Lindsay (The University of Queensland, Australia) * Ant?nia Lopes (University of Lisbon, Portugal) * Nenad Medvidovic (University of Southern California, USA) * Mercedes Merayo (Universidad Complutense de Madrid, Spain) * Stephan Merz (INRIA Nancy, France) * Madhavan Mukund (Chennai Mathematical Institute, India) * Cesar Mu?oz (NASA, USA) * Mart?n Musicante (UFRN, Brazil) * Mizuhito Ogawa (JAIST, Japan) * Olaf Owe (University of Oslo, Norway) * Gordon Pace (University of Malta, Malta) * Ernesto Pimentel (University of M?laga, Spain) * Sanjiva Prasad (Indian Institute of Technology Delhi, India) * Anders Ravn (Aalborg University, Denmark) * Leila Ribeiro (UFRGS, Brazil) * Augusto Sampaio (UFPE, Brazil) * Gerardo Schneider (Chalmers | Univ. of Gothenburg, Sweden) * Sebastian Uchitel (Imperial College London, UK) * Willem Visser (University of Stellenbosch, South Africa) * Sergio Yovine (VERIMAG, France) Organising Committee * Carlos Luna, Universidad de la Rep?blica, Uruguay * Alberto Pardo, Universidad de la Rep?blica, Uruguay * Luis Sierra, Universidad de la Rep?blica, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR, China * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Mathai Joseph, TRDDC, Pune, India * Zhiming Liu, UNU-IIST, Macao SAR, China * Andrea Maggiolo-Schettini, Pisa University, Italy =================================================== --- Gerardo Schneider Department 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 soner at mtu.edu Fri Jan 21 08:31:23 2011 From: soner at mtu.edu (Soner Onder) Date: Fri, 21 Jan 2011 08:31:23 -0500 Subject: [TYPES/announce] ASPLOS 2011 Student Travel Grants Deadline is January 26. Message-ID: <4D398AAB.6020002@mtu.edu> *** Our apologies if you receive this announcement from multiple sources *** ========================= ASPLOS 2011 Travel Grants ========================= Funded by: NSF, SIGARCH, SIGOPS, SIGPLAN, & Google. ASPLOS will offer travel grants for students to attend the conference, in addition to reduced student registration fees. Travel grants will also be made available to junior faculty members, under-represented minorities, and faculty members from non-Ph.D. granting colleges. The size and number of these grants will vary depending on funding availability and the number of applications that we receive. Expenses will be reimbursed after the conference; grant recipients will be asked to submit original receipts. While we encourage all in need of a travel grant to apply, priority will be given to paper and poster presenters, co-authors, and under-represented minorities (including women and undergraduate students interested in research). To apply for a travel grant from ASPLOS, please complete the following steps: * Complete the application form (http://asplos11.cs.ucr.edu/travel_grant_application_form.doc). * Applicants, compose an email to asplos2011travel at gmail dot com. For your subject line, please use "Travel Grant Application for ". * In the body of your email, please briefly describe your reasons for attending ASPLOS and your research interests. * Attach a current resume and the completed application form. Student applicants also need to ask their advisor to send an e-mail to asplos2011travel at gmail dot com with the subject line "Student Travel Status Confirmation for ", stating that you are a full time student pursuing an MS/Ph.D. or undergraduate research in the areas covered by ASPLOS. Travel grant applications must be received by January 26th, 2011. For students, the confirmation email from their advisor needs to be received by that date also. Because of the large number of applications we expect to receive, we will not solicit these letters from your advisors - it is your responsibility to ensure that your advisor sends the email before the deadline. We will acknowledge receipt of your application within a week of receipt. If you do not receive such an acknowledgement, please resend. If you still don't receive an acknowledge mail, please call the Travel Chair, Philip Brisk, at +1 (951) 827-2030. We will do our best to notify you about the status of your application by January 30th, which is 3 days before the conference early registration deadline. Note that award decisions will be made based on funding availability. Note also that some awards may be made only after the conference. Please contact Philip Brisk for information. Funding for ASPLOS travel grants has been generously provided by the NSF, the SIGARCH, the SIGOPS, and the ACM SIGPLAN Professional Activities Committee (PAC). -------------------------------------------------------------------------------------------------- Soner Onder, ASPLOS 2011 Publicity Chair. From giannini at di.unipmn.it Fri Jan 21 16:48:11 2011 From: giannini at di.unipmn.it (Paola Giannini) Date: Fri, 21 Jan 2011 22:48:11 +0100 Subject: [TYPES/announce] CS2Bio11 - Call for Papers Message-ID: <4D39FF1B.10309@di.unipmn.it> ================================================================ Call for papers CS2Bio'11 2nd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'11 9th of June 2011 Reykjavik, Iceland http://cs2bio11.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. In particular we want to encourage presentation of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present an attempt at modeling a specific biological phenomenon using formal techniques, or a technical innovation that can be applied to a range of potential biological systems. In the latter case, some emphasis on the scalability of the method will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Synthetic biology, circuits design (IGEM models) -- Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparisons between different formal models for the 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 Simulations: -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of Mathematical Structures in Computer Science is planned. *** INVITED SPEAKERS *** - Jasmin Fisher (Microsoft Research - Cambridge, UK) - Gordon Plotkin (Lab for Foundation of Computer Science - Edinburgh, UK) *** 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=cs2bio11). 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: 21 March 2011 - Notification to authors: 5 May 2011 - Workshop: 9 June 2011 *** PROGRAM COMMITTEE *** - Luca Cardelli - Francesca Cordero - Erik de Vink - Fran?ois Fages - J?r?me Feret - Jasmine Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Jean-Louis Giavitto - Ion Petre - Gordon Plotkin - Angelo Troina - Verena Wolf - Gianluigi Zavattaro -- 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 miguelalfredo.garcia at epfl.ch Sat Jan 22 12:26:27 2011 From: miguelalfredo.garcia at epfl.ch (Garcia Gutierrez Miguel Alfredo) Date: Sat, 22 Jan 2011 17:26:27 +0000 Subject: [TYPES/announce] CfP Reminder: The Second Scala Workshop - Scala Days 2011 Message-ID: <7E4228B446372948BBB2916FC53FA49E1C6888A5@REXI2.intranet.epfl.ch> The Second Scala Workshop ========================= Call for Papers --------------- Scala is a general purpose programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. This workshop is a forum for researchers and practitioners to share new ideas and results of interest to the Scala community. The second annual workshop will be held at Stanford University in the San Francisco Bay Area, on Thursday the 2nd of June 2011, co-located with Scala Days 2011 (2nd-3rd of June). We seek papers on topics related to Scala, including (but not limited to): 1. Language design and implementation -- language extensions, optimization, and performance evaluation. 2. Library design and implementation patterns for extending Scala -- embedded domain-specific languages, combining language features, generic and meta-programming. 3. Formal techniques for Scala-like programs -- formalizations of the language, type system, and semantics, formalizing proposed language extensions and variants, dependent object types, type and effect systems. 4. Concurrent and distributed programming -- libraries, frameworks, language extensions, programming paradigms: (Actors, STM, ...), performance evaluation, experimental results. 5. Safety and reliability -- pluggable type systems, contracts, static analysis and verification, runtime monitoring. 6. Tools -- development environments, debuggers, refactoring tools, testing frameworks. 7. Case studies, experience reports, and pearls Important Dates --------------- Submission: Tuesday, Feb 8, 2011 (24:00 in Apia, Samoa) Notification: Tuesday, Mar 15, 2011 Final revision: Friday, Apr 15, 2011 Workshop: Thursday, Jun 2, 2011 Submission Guidelines --------------------- Submitted papers should describe new ideas, experimental results, or projects related to Scala. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. Submissions must be in English and at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (10pt). No formal proceedings will be published, but there will be a webpage linking to all accepted papers. The workshop also welcomes short papers. The papers can be submitted by using the Scala Workshop EasyChair website: http://www.easychair.org/conferences/?conf=days2011 Additional details about the Scala Days 2011 event are available at: http://days2011.scala-lang.org. Program Committee ----------------- Nathan Bronson, Stanford University Miguel Garcia, EPFL Klaus Havelund, Jet Propulsion Laboratory Cay Horstmann, San Jose State University Doug Lea, State University of New York at Oswego Nate Nystrom, University of Lugano Martin Odersky, EPFL (chair) Kunle Olukotun, Stanford University James Strachan, FuseSource From dd at dominicduggan.org Mon Jan 24 18:39:13 2011 From: dd at dominicduggan.org (Dominic Duggan) Date: Mon, 24 Jan 2011 17:39:13 -0600 Subject: [TYPES/announce] CFP: Second Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS'11) Message-ID: [Papers on types are for mobile and pervasive systems are welcome.] Second International Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS'10) http://www.pmmps.org San Francisco, CA, USA, June 12, 2011. Colocated with Pervasive 2011, the 9th International Conference on Pervasive Computing (Pervasive'11) http://www.pervasiveconference.org/2011/ Pervasive mobile computing is here, but how these devices and services should be programmed is still something of a mystery. There is a great deal of experience to draw upon in systems development, but many of the tools and methodologies for developing such applications comes from ancillary disciplines such as user interface design and distributed computing. Programming mobile and pervasive applications is more than than building client-server or peer-peer systems with mobility, and it is more than providing usable interfaces for mobile devices that may interact with the surrounding context: it includes aspects such as disconnected and low-attention working, spontaneous collaboration, evolving and uncertain security regimes, and integration into services and workflows hosted on the internet. In the past, efforts have focused on the form of human-device interfaces that can be built using mobile and distributed computing tools, or on human computer interface design based on, for example, the limited screen resolution and real estate provided by a smartphone. Much of the challenge in building pervasive systems is in bringing together users' expectations of their interactions with the system with the model of a physical and virtual environment with which users interact in the context of the pervasive application. An example of this is provided by mobile computer gaming, which may provide augmented or semi-immersive user experiences that project a virtual game reality, including other gamers, onto the physical environment experienced by each user. Developers of distributed systems have several tools to draw upon that increase their productivity, and raise the level of abstraction at which they work. Remote procedure call and reliable message queues are examples of tools that have succeeded in the past to mask remote communication in client-server and business-to-business applications. Transactions and nested transactions have provided essential support for handling failures, while other tools such as failure detectors and append-only logs have been proposed in the context of building fault-tolerant distributed applications. For middleware applications, programming environments such as Eclipse, NetBeans and Visual Studio automate some of the aspects of configuring and deploying resources, such as configuring JCA connectors to backend databases. However, it is now well accepted that these techniques perform poorly in semi-connected, sensor-driven, pervasive and dynamic environments. What are the corresponding tools that designers and implementors for mobile and pervasive applications should be able to draw upon? We can indeed see users at various levels of sophistication and user interface, from software developers working with middleware tools to end users writing scripts. What support would be useful to users at all of these levels of sophistication. Another aspects of mobile and pervasive computing is that devices increasingly must take on some "intelligence" to perform their tasks, requiring adaptive and autonomous behaviour on the part of the systems developed. Mobile personal devices such as telephones are envisioned as "intelligent assistants" that may compensate for the limitations of the user interface by asynchronously performing interactions with other devices on behalf of the device owner. Such devices may tailor their behaviour both to the current location and to the ambient context, which includes nearby devices. Smart spaces may in turn adapt their behaviour based on mobile devices in their vicinity, for example, turning off lights when people are not present or choosing not to divulge confidential information while untrusted parties are present. At the infrastructural level, autonomic network management adapts network behaviour to maintain quality of service over dynamic changes in load and environment, taking advantage of the capabilitiew of the devices actually being used for interaction. Wireless sensor networks must demonstrate stable and long-lived behaviour with little or no human intervention. Cognitive radio supposes a device that senses its radio environments and adapts to available frequencies and protocols, as part of its interaction with that environment. The International Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS) is intended to bring together researchers in programming languages, software architecture and design, and pervasive systems to present and discuss results and approaches to the development of mobile and pervasive systems. The goal is to begin the process of developing the software design and development tools necessary for the next generation of services in dynamic environments, including mobile and pervasive computing, wireless sensor networks, and adaptive devices. Potential workshop participants should submit a paper on topics relevant to programming models for mobile and pervasive systems. We are primarily seeking short position papers (2-4 pages), although full papers that have not been published and are not under consideration elsewhere will also be considered (a maximum of 10 pages). Position papers that lay out some of the challenges to programming mobile and pervasive systems, including past failures, are welcome. Papers longer than 10 pages may be automatically rejected by the chairs or workshop committee. From the submissions, the program committee will strive to balance participation between academia and industry and across topics. Selected papers will appear on the workshop web site; PMMPS has no formal published proceedings. Authors of selected papers will be invited to submit extended versions for publication in an appropriate journal (under negotiation). Submission deadline: February 4, 2011. Notification: March 11, 2011. Workshop: June 12, 2011. Both new ideas and *critical evaluation of earlier approaches* are welcome. -------------- next part -------------- An HTML attachment was scrubbed... URL: From maffei at cs.uni-saarland.de Tue Jan 25 03:36:58 2011 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Tue, 25 Jan 2011 09:36:58 +0100 Subject: [TYPES/announce] 2nd CFP: 24th IEEE Computer Security Foundations Symposium (CSF 2011) Message-ID: Our apologies for cross-posting. ========================================================== 24th IEEE Computer Security Foundations Symposium CSF 2011 June 27th-June 29th 2011 Domaine de l'Abbaye des Vaux-de-Cernay, France http://csf2011.inria.fr 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 Distributed systems Language-based security security Anonymity and Electronic voting Network security Privacy Authentication Executable content Resource usage control Data and system Formal methods Security for mobile integrity for security computing Database security Information flow Security models Data provenance Intrusion detection Security protocols Decidability and Hardware-based Trust and trust complexity security 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 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 Papers due: Wednesday, February 9, 2011, 11:59pm Eastern Standard Time Panel proposals due: Monday, March 14, 2011 Notification: Friday, March 25, 2011 Symposium: June 27 - 29, 2011 Program Committee PC-chairs: Michael Backes, Saarland U and MPI-SWS Steve Zdancewic, U Penn PC members: Gilles Barthe, IMDEA Patrick McDaniel, Penn State Lujo Bauer, CMU Cathy Meadows, NRL David Basin, ETH John Mitchell, Stanford U Michael Clarkson, Cornell U Greg Morrisett, Harvard U Stephanie Delaune, CNRS Catuscia Palamidessi, INRIA Riccardo Focardi, U Venice Alejandro Russo, U Chalmers Cedric Fournet, MSR Paul Syverson, NRL Joshua Guttman, WPI Nikil Swamy, MSR Boris Koepf, IMDEA Dominique Unruh, Saarland U 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 IEEE-CS Press. 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. Submit papers using the CSF 2011 submission site (online soon). 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 chair. Five-minute Talks CSF's popular tradition of a session of 5-minute talks will continue this year. To offer a 5-minute talk, send a 1-page text abstract to csf11-chairs at infsec.cs.uni-saarland.de by June 20, 2011. Short talks may be trailers for longer presentations at one of the affiliated workshops, or stand entirely on their own. Abstracts will be made available electronically but not published in the conference proceedings. Provocative and programmatic presentations are welcome! Note that speakers in this session must be registered for CSF. Contacts General Chair: Steve Kremer LSV, CNRS & ENS de Cachan 61, av. du President Wilson 94235 Cachan Cedex, France kremer at lsv.ens-cachan.fr Program Chairs: Michael Backes Department of Computer Science Saarland University and MPI-SWS Saarbr?cken, Germany Steve Zdancewic Department of Computer Science University of Pennsylvania csf11-pcchairs at infsec.cs.uni-saarland.de Publications Chair: Jonathan Herzog MIT Lincoln Labs Lexington, MA, USA 196 Broadway, jherzog at ll.mit.edu From carbonem at itu.dk Tue Jan 25 05:05:46 2011 From: carbonem at itu.dk (Marco Carbone) Date: Tue, 25 Jan 2011 11:05:46 +0100 Subject: [TYPES/announce] ICE 2011 - First Call for Papers (Deadline: 4th April 2011) In-Reply-To: References: Message-ID: -------- Apologies for multiple copies ------- ====================================================================== ICE 2011 4th Interaction and Concurrency Experience Reliable and Contract-based Interactions June 9, 2011, Reykjavik, Iceland http://www.artist-embedded.org/artist/-ICE-2011-.html Satellite workshop of DisCoTec 2011 http://discotec.ru.is === Highlights === - Invited talks: TBA - Innovative selection procedure - Special issue of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/) === Important Dates === 28 March 2011.............Abstract submission 4 April 2011................Full paper submission 11 April - 7 May 2011...Reviews, rebuttal and PC discussion 9 May 2011................Notification to authors 23 May 2011...............Camera-ready for pre-proceedings 9 June 2011...............ICE in Reykjavik 15 Sept 2011..............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 handshaking mechanisms used among actors 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'11 is ***Reliable and Contract-based Interactions***. Reliable interactions are, e.g., those providing suitable guarantees on the overall behaviour of interactive systems, enjoying suitable logical safety/liveness properties, adhering to certain QoS standards, offering certain levels of trust/security. Contract-based interactions are those where the interacting entities are committed to give certain guarantees whenever certain assumptions are met by their operating environment (including other autonomous entities and networking middleware). This way, contracts can be used to define faulty and malicious behaviours and to identify the responsible in case of contract violation or abuse. Topics of interest include, but shall not be limited to: - logics and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of reliable interaction - programming primitives for reliable interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for reliable interaction - expressiveness results - formal languages for contracts - formal analysis of contracts - contract negotiation, discovery and monitoring === Selection Procedure === The workshop pushes for an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past three editions of ICE, this 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. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions that the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE 2011 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=ice2011) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Special Issue === Full version 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 === Karthik Bhargavan (INRIA, France) Simon Bliudze (CEA LIST, France) (co-chair) Filippo Bonchi (INRIA, France) Roberto Bruni (University of Pisa, Italy) Marzia Buscemi (IMT Lucca Institute for Advanced Studies, Italy) Luis Caires (University of Lisbon, Protugal) Marco Carbone (IT University of Copenhagen, Denmark) Erik de Vink (Technische Universiteit Eindhoven, Netherlands) Laurent Doyen (ENS Cachan, France) Davide Grohmann (Italy) Barbara Jobstmann (CNRS/Verimag, France) Ivan Lanese (University of Bologna, Italy) Alberto Lluch Lafuente (IMT Lucca, Italy) Hernan Melgratti (University of Buenos Aires, Argentina) Dejan Nickovic (IST, Austria) Sylvain Pradalier (INRIA Rocquencourt, France) Sophie Quinton (Verimag, France) Alexandra Silva (CWI, Netherlands) (co-chair) Pawel Sobocinski (University of Southampton, UK) Ana Sokolova (University of Salzburg, Austria) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Frank D. Valencia (LIX, France) Nalini Vasudevan (Columbia University, NY, USA) Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy) - Marco Carbone (IT University of Copenhagen, Denmark) - Alexandra Silva (CWI, Netherlands; co-chair) === Contact === ice2011 at easychair.org === Previous editions === The previous three 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 a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10) is now in preparation. === Sponsors === CEA List -------------- next part -------------- An HTML attachment was scrubbed... URL: From katoen at cs.rwth-aachen.de Tue Jan 25 07:10:16 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Tue, 25 Jan 2011 13:10:16 +0100 Subject: [TYPES/announce] CONCUR 2011: First Call for Papers Message-ID: <4D3EBDA8.2010203@cs.rwth-aachen.de> [We apologise for multiple copies.] ============================================================================ CONCUR 2011 - First Call for Papers 22nd International Conference on Concurrency Theory September 6 - September 9, 2011, Aachen, Germany http://concur2011.rwth-aachen.de/ ============================================================================ 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. ================================ 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. ================================ INVITED SPEAKERS ================================ - Parosh Aziz Abdulla (Uppsala University, Sweden) - Ursula Goltz (Technical University Braunschweig, Germany) - Rachid Guerraoui (EPFL Lausanne, Switzerland) - Wil van der Aalst (Technical University Eindhoven, The Netherlands) ================================ CO-LOCATED EVENTS ================================ 8th Int. Conference on Quantitative Evaluation of SysTems (QEST 2011) 6th Int. Symposium on Trustworthy Global Computing (TGC 2011) There will be co-located workshops, which take place on September 5 and September 10, and tutorials (associated with QEST) on September 5. ================================ PAPER SUBMISSION ================================ CONCUR 2011 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. The CONVCUR 2011 proceedings will be published by Springer in the ArCoSS subseries of LNCS. The proceedings will be available at the conference. ================================ IMPORTANT DATES ================================ Abstract Submission: April 1, 2011 Paper Submission: April 8, 2011 Paper Notification: May 25, 2011 Camera Ready Copy Due: June 10, 2011 CONCUR 2011: September 6 - September 9, 2010 ================================ STEERING COMMITTEE ================================ - Roberto Amadio (PPS, Universite Paris Diderot - Paris 7, France) - Jos Baeten (Eindhoven University of Technology, The Netherlands) - Eike Best (Carl von Ossietzky Universit?t Oldenburg, Germany) - Kim Larsen (Aalborg University, Denmark) - Ugo Montanari (Universita di Pisa, Italy) - Scott Smolka (SUNY, Stony Brook University, USA) ================================ PROGRAM CHAIRS ================================ - Joost-Pieter Katoen (RWTH Aachen University, Germany) - Barbara K?nig (University of Duisburg-Essen, Germany) ================================ PROGRAM COMMITTEE ================================ - Christel Baier (TU Dresden, Germany) - Paolo Baldan (University of Padova, Italy) - Ahmed Bouajjani (University Paris Diderot, France) - Franck van Breugel (York University, Toronto, Canada) - Roberto Bruni (University of Pisa, Italy) - Rocco De Nicola (University of Florence, Italy) - Dino Distefano (Queen Mary University of London and Monoidics Ltd, UK) - Javier Esparza (TU Munich, Germany) - Yuxi Fu (Shanghai Jiaotong University, China) - Paul Gastin (ENS de Cachan, Paris, France) - Keijo Heljanko (Aalto University, Espoo, Finland) - Anna Ingolfsdottir (Reykjavik University, Iceland) - Maciej Koutny (Newcastle University, UK) - Antonin Kucera (Masaryk University, Brno, Czech Republic) - Gerald L?ttgen (Otto-Friedrich-Universit?t Bamberg, Germany) - Bas Luttik (Eindhoven University of Technology, The Netherlands) - Madhavan Mukund (Chennai Mathematical Institute, India) - Ernst-R?diger Olderog (Universit?t Oldenburg, Germany) - Joel Ouaknine (University of Oxford, UK) - Jan Rutten (CWI Amsterdam and Radboud University Nijmegen, The Netherlands) - Vladimiro Sassone (University of Southampton, UK) - Marielle Stoelinga (University of Twente, Enschede, The Netherlands) - Irek Ulidowski (University of Leicester, UK) - Bj?rn Victor (Uppsala University, Sweden) - Mahesh Viswanathan (University of Illinois, Urbana-Champaign, USA) - Andrzej Wasowski (IT University of Copenhagen, Denmark) ================================ ORGANIZING COMMITTEE ================================ Henrik Bohnenkamp, Arnd Gehrmann, Christina Jansen, Nils Jansen, Ulrich Loup, Thomas Noll, Elke Ohlenforst, Sabrina von Styp (RWTH Aachen), and Mathias H?lsbuch and Sander Bruggink (University of Duisburg-Essen). From sacerdot at cs.unibo.it Wed Jan 26 11:28:05 2011 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Wed, 26 Jan 2011 17:28:05 +0100 Subject: [TYPES/announce] Post-Doc position in the CerCo FET-Open EU Project In-Reply-To: <1262690107.5919.57.camel@zenone> References: <1262690107.5919.57.camel@zenone> Message-ID: <1296059286.27942.41.camel@zenone> === New Post-Doc position in the CerCo FET-Open EU Project === ** Approximate period: 01/06/2011-30/05/2013 (two years) ** Deadline for submission of candidatures: 21/02/2011 We are currently looking for a Post-Doc position at the Department of Computer Science, University of Bologna, to work on the CerCo FET-Open EU Project (see description below). The gross salary is 36000 euros per year. The University of Bologna is the oldest western university and the Department of Computer Science (http://www.cs.unibo.it/en/), located in the historic city center, has strong expertise in theoretical computer science and logic and it participates to several national and international projects. The Post-Doc will join the HELM team, leaded by Prof. Asperti, whose members work in the domains of Type Theory and Mathematical Knowledge Management. The CerCo project is headed by Dr. Sacerdoti Coen. The candidate will benefit from exchange opportunity with the other project participants (University Paris-Diderot, Paris, and University of Edinburgh, Edinburgh). The candidate will not have any teaching duties. Requirements: We are looking for candidates with 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 that are gonna defend their Ph.D. thesis before June 2011 will also be considered. Starting date: The proposed starting date is the 01/06/2011. The contract is for two years. The candidate should contact sacerdot at cs.unibo.it for further information. Project description: The CerCo FET-Open EU Project is aimed at producing the first _formally_ _verified_ _complexity_preserving_ compiler for a subset of C to the object code for a microprocessor used in embedded systems. The output of the compilation process will be the object code and a copy of the source code annotated with _exact_ computational complexities for each program slice in O(1). The exact computational complexities (expressed in clock cycles and parametric in the program input) can then be used to formally reason on the overall code complexity. The source code of the compiler will be formally verified using the Matita Interactive Theorem Prover (http://matita.cs.unibo.it), based on a variant of the Calculus of (Co)Inductive Constructions. 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) the 21/02/2011. Candidates must fill in the forms (in Italian only) that can be found at the following address: http://www.unibo.it/Portale/Personale/Concorsi/AvvisiSelezione/2011/BandoCerCO210211.htm 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 tobias.wrigstad at it.uu.se Thu Jan 27 12:49:13 2011 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Thu, 27 Jan 2011 11:49:13 -0600 Subject: [TYPES/announce] Assistant Professor/Research Associate in Computing Science Message-ID: The Department of Information Technology announces a position as Assistant Professor/Research Associate in Computing Science. The position is a time limited (maximum 4 years) position. The primary duty of an Assistant Professor/Research Associate is research, but also teaching at the undergraduate and postgraduate levels, as well as supervision of Ph.D. students. The appointment is within the programme of Computing Science, where research is conducted on programming languages, process algebra, interactive theorem proving, constraint programming, compiler technology and data base technology. The applicant must have a Ph.D. degree in Computing Science or related field, preferably awarded within the past 5 years. Applicants with research experience within the areas programming languages (for example language design, semantics, type systems, execution environments, compilers, program development tools) and algorithms and data structures (for example algorithm development, algorithm analysis, distributed algorithms and data structures) in connection with one or more of the areas of research in the programme as described above, will be given first priority. The application deadline is February 28, 2011. For more information about the position, including information on how to apply, see the official announcement at http://www.personalavd.uu.se/ledigaplatser/3375eng.htm From luca.aceto at gmail.com Fri Jan 28 04:14:20 2011 From: luca.aceto at gmail.com (Luca Aceto) Date: Fri, 28 Jan 2011 09:14:20 +0000 Subject: [TYPES/announce] CFP: Process Algebra and Coordination (PACO 2011), co-located with DisCoTec'11 Message-ID: [Contributions from members of the TYPES community to the workshop are most welcome.] ******************************************************** Call for Papers The First International Workshop on Process Algebra and Coordination (PACO 2011) (co-located with DisCoTec'11) http://www.win.tue.nl/paco2011/ 9 June 2011, Reykjavik, Iceland Paper Submission Deadline: March 25, 2011 ******************************************************** Scope Process algebra provides abstract and rigorous means for studying communicating concurrent systems. Coordination languages also provide abstract means for specifying and programming communication of components. Hence, the two fields seem to have very much in common and the links between these two research areas have been established formally by means of several translations, mainly from coordination languages to process algebras. There have also been proposals of process algebras whose communication policy is inspired by the one underlying coordination languages. The aim of this workshop is to push the state of the art in the study of the connections between process algebra and coordination languages by bringing together experts as well as young researchers from the two fields to communicate their ideas and findings. Format The workshop will comprise two main parts: invited lectures and contributed talks. In the first part, some invited senior researchers will present their ideas around the theme of linking process algebras and coordination languages. Contributions will be solicited in the areas related to the formal aspects of communication structures and coordination languages. The topics of interest include, but are not restricted to: * Comparison Among Different Coordination Models and/or Process Algebras * Expressive Power of Coordination Languages and Process Algebras * Formal Semantics of Coordination Languages * Formal Verification of Coordinated Architectures * Relating Different Semantic Models for Coordination Languages * Translations from Coordination Languages to Process Algebras and Vice Versa Submissions should not exceed 15 pages and should be formatted according to the EPTCS style. (Please check http://style.eptcs.org/ for more details.) Concurrent submission to other venues (conferences, workshops or journals) and submission of papers under consideration elsewhere are not allowed. Submissions are handled using the EasyChair system and can be uploaded using the following link: https://www.easychair.org/conferences/?conf=paco2011 All contributions will undergo a rigorous review procedure by the Program Committee of the workshop and a selection will be made based on the novelty, soundness and relevance of the contributions. The proceedings of the workshop, containing papers presented in both parts, will be published as a volume of Electronic Proceedings in Theoretical Computer Science. Invited Speakers Jos Baeten, Eindhoven University of Technology, The Netherlands Dave Clarke, Katholieke Universiteit Leuven, Belgium Rocco De Nicola, University of Florence, Italy Gianluigi Zavattaro, University of Bologna, Italy Important Dates Paper Submission: March 25, 2011 Author notification: April 22, 2011 Camera ready paper due: May 20, 2011 Workshop: June 9, 2011 Program Committee Luca Aceto Reykjavik University, Iceland (co-chair) Christel Bair Technische Universit?t Dresden, Germany Mario Bravetti University of Bologna, Italy Mohammad Mahdi Jaghoori Centrum Wiskunde & Informatica (CWI), The Netherlands MohammadReza Mousavi Eindhoven University of Technology, The Netherlands (co-chair) Rosario Pugliese University of Florence, Italy Davide Sangiorgi University of Bologna, Italy Marjan Sirjani Reykjavik University, Iceland -------------- next part -------------- An HTML attachment was scrubbed... URL: From vxc at Cs.Nott.AC.UK Fri Jan 28 06:54:36 2011 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Fri, 28 Jan 2011 11:54:36 +0000 Subject: [TYPES/announce] MGS 2011 Message-ID: <1296215676.1954.6.camel@hypatia> MIDLANDS GRADUATE SCHOOL in the Foundations of Computing Science University of Nottingham, 11-15 April 2011 http://www.cs.nott.ac.uk/~vxc/mgs/mgs.html The Midlands Graduate School (MGS) in the Foundations of Computing Science is a collaboration between researchers at the Universities of Birmingham, Leicester, Nottingham and Sheffield. It was established in 1999. The MGS has two main goals: to provide PhD students with a sound basis for research in the mathematical and practical foundations of computing and to give PhD students the opportunity to make contact with established researchers in the field and their peers who are at a similar stage in their research careers. This year, the MGS is at the University of Nottingham. It will start on 11 April and finish on 15 April. This year the school offers the following courses. Core courses: "Functional Programming" by Henrik Nilsson "Category Theory" by Thorsten Altenkirch "Typed Lambda Calculi" by Andrzej Murawski Advanced courses: "Coalgebra" by Paul Blain Levy "Game Semantics and Applications" by Dan Razvan Ghica "Game Theory, Topology and Proof Theory for Functional Programming" by Mart?n Escard? "Process Calculi for Protocol Verification" by Eike Ritter "Mechanized Theorem Proving" by Georg Struth In addition there will be an invited course given by Professor Andrew M Pitts. We invite graduate students in computer science and related fields to participate. Applicants from industry who want to strengthen their theoretical background are also welcome. The deadline for registration is 18 March 2011. More details and information on how to register are on the school web page. -- Venanzio Capretta School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~vxc/ From soner at mtu.edu Fri Jan 28 21:06:02 2011 From: soner at mtu.edu (Soner Onder) Date: Fri, 28 Jan 2011 21:06:02 -0500 Subject: [TYPES/announce] Reminder: ASPLOS 2011 early registration deadline is February 2 Message-ID: <4D43760A.6010108@mtu.edu> *** Our apologies if you receive this announcement from multiple sources *** ASPLOS 2011 Sixteenth International Conference on Architectural Support for Programming Languages and Operating Systems Newport Beach, California, March 5-11, 2011 Call for participation. Conference web site: http://asplos11.cs.ucr.edu Technical Program : http://asplos11.cs.ucr.edu/program.html Early registration deadline is February 2 for both conference registration and the hotel reservations. Registration web site: http://asplos11.cs.ucr.edu/registration.html Hotel reservations : http://asplos11.cs.ucr.edu/hotel.html ----------------------------- ASPLOS is sponsored by ACM SIGPLAN, ACM SIGARCH and ACM SIGOPS and has also been generously supported by National Science Foundation, VMWare, Google, Intel, HP, Qualcomm Research Center, Oracle, AMD, Microsoft Research, and IBM. ----------------------------- Posted by Soner Onder, ASPLOS 2011 Publicity chair From hahosoya at is.s.u-tokyo.ac.jp Sat Jan 29 00:00:00 2011 From: hahosoya at is.s.u-tokyo.ac.jp (Haruo HOSOYA) Date: Sat, 29 Jan 2011 14:00:00 +0900 Subject: [TYPES/announce] New book announcement: "Foundations of XML Processing: The Tree-Automata Approach" Message-ID: Dear folks, I'm very glad to announce the publication of my new book. "Foundations of XML Processing: The Tree-Automata Approach" (Cambridge University Press) This is the first book that provides a solid theoretical account of the foundation of the popular data format XML. It proposes a simple, clean, and novel principle for the construction of statically typed XML processing languages, based on finite tree automata. Part I establishes basic concepts, starting with schemas (i.e., types for XML), tree automata, and pattern matching, and concluding static typechecking for XML as a highlight of the book. Part II turns its attention to more advanced topics, including efficient 'on-the-fly' tree automata algorithms, path- and logic-based queries, tree transformation, and exact typechecking. Many of you may recognize the book as a summary of the series of work on type systems for XML processing, which I started with Benjamin Pierce and pursued with many collegues. However, the book has been rewritten from the scratch so that anyone new to this area can quickly get the whole picture. Also, elementary materials and a number of examples and exercises (with solutions!) are provided so that the book may be useful for a textbook. You can easily find the book from Amazon: http://www.amazon.com/gp/product/0521196132 The following is the table of contents. 1. Introduction 2. Preliminaries Part I 3. Schemas 4. Tree automata 5. Pattern matching 6. Marking tree automata 7. Typechecking Part II 8. On-the-fly algorithms 9. Alternating tree automata 10. Tree transducers 11. Exact typechecking 12. Path expressions and tree-walking automata 13. Logic-based queries 14. Ambiguity 15. Unorderedness Appendix: Solutions to Selected Exercises References Index Enjoy, Haruo -- Haruo Hosoya, Lecturer Computer Science Department The University of Tokyo, Japan Presto researcher, JST From nipkow at in.tum.de Mon Jan 31 04:46:57 2011 From: nipkow at in.tum.de (Tobias Nipkow) Date: Mon, 31 Jan 2011 10:46:57 +0100 Subject: [TYPES/announce] International Summer School Marktoberdorf Message-ID: <4D468511.4080708@in.tum.de> The *International Summer School Marktoberdorf* 2011 on *Tools for Analysis and Verification of Software Safety and Security* http://asimod.in.tum.de/ is ready for applications. *Deadline*: March 04, 2011 The "Marktoberdorf Summer School" is a two weeks' course for young computer scientists and mathematicians working in the field of formal software and systems development. It provides in-depth presentations of state-of-the-art topics in "Ananlysis and Verification of Software Systems" and promotes international contacts and collaborations with leading researchers and young scientists. *Lecturers and Titles* Bruno Blanchet: Mechanizing Game-Based Proofs of Security Protocols Hubert Common-Lundh: Formal Security Proofs Javier Esparza: Reachability in Models of Concurrent Programs Orna Grumberg: Model Checking Gerwin Klein: Interactive Proof: Applications to Semantics Marta Kwiatkowska: Advances in Probabilistic Model Checking Rustan Leino: Using and Building an Automatic Program Verifier Rupak Majumdar: Software Model Checking Sharad Malik: Boolean Satisfiability Solvers: Techniques and Extensions Tobias Nipkow: Interactive Proof: Hands-on Introduction Peter O'Hearn: Lectures on Separation Logic Andrei Sabelfeld: Information-Flow Security Helmut Seidl: Precise Fix-point Computation through Strategy Iteration For further questions or our poster and flyer, please contact: Dr. Katharina Spies, asimod at in.tum.de -- Dr. Katharina Spies ** executive director -- Summer School Marktoberdorf ** asimod at in.tum.de | http://asimod.in.tum.de Technische Universitaet Muenchen Fakultaet fuer Informatik Tel.: ++49/89/289-17829 Boltzmannstr. 3 Fax: ++49/89/289-17307 D-85748 Garching (Muenchen) / Germany From stefano at di.unito.it Mon Jan 31 05:19:56 2011 From: stefano at di.unito.it (Stefano Berardi) Date: Mon, 31 Jan 2011 11:19:56 +0100 Subject: [TYPES/announce] CfP for the Special Issue of APAL on "Classical Logic and Computation" - Extended deadline: March, 15 2011 Message-ID: <4D468CCC.9040606@di.unito.it> ************************************************************************ ANNALS OF PURE AND APPLIED LOGIC THIRD SPECIAL ISSUE ON "CLASSICAL LOGIC AND COMPUTATION" Extended deadline: March, 15 2011 ************************************************************************ CALL FOR PAPERS =============== Contributions on the topic of Classical Logic and Computation are invited for a special issue of Annals of Pure and Applied Logic. On August 22, 2010, CL&C 2011, the third workshop on "Classical Logic and Computation" took place in Brno - Czech Republic, as a satellite meeting of MFCS/CSL 2010, and a joint workshop with PECP.CL&C covered a broad range of works aiming to explore computational aspects of classical proofs, using tools from type theory and proof theory and lambda calculus and constructive semantics. This special issue is first of all set up for extended versions of papers presented at the workshop, but the call is open to all researchers. TOPICS Topics of interest for contributions to the journal issue include, but are not limited to: - type theory and lambda calculi for classical logic, - programming language design inspired by the former - examples of witness extraction from classical proofs, - constructive semantics of classical logic (game semantics, realization semantics, CPS translations ..) SUBMISSIONS Submissions must be original work which has not been previously published in a journal and is not being considered for publication elsewhere. If related material has appeared in a refereed conference proceedings, the manuscript submitted should be substantially more complete or otherwise different. Deadline for the submission of a title page indicating the intent to submit: February 15, 2011 ***Deadline for paper submission: March 15, 2011 (Extended dealine)*** The title page must include: full title, authors' full names and affiliations, and the address to which correspondence and proofs should be sent. Where possible, e-mail address and telephone number should be included. This should be followed by an abstract of approximately 300 words and five keywords for indexing. IMPORTANT All source files of the final versions of the accepted papers must respect the format of APAL. In order to make a submission, please follow the instructions at http://www.elsevier.com/wps/find/journaldescription.cws_home/505603/authorinstructions Please upload a .pdf file to the following easychair link http://www.easychair.org/conferences/?conf=apalclac10 Guest editors: Steffen van Bakel, Imperial College London, UK Stefano Berardi, Universita` di Torino, Italy Ulrich Berger, Swansea University, UK Contact: s.vanbakel at imperial.ac.uk From txa at Cs.Nott.AC.UK Mon Jan 31 06:47:29 2011 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Mon, 31 Jan 2011 11:47:29 +0000 Subject: [TYPES/announce] PhD studentships in Nottingham Message-ID: +------------------------------------------------------------------+ PhD Studentships in Functional Programming School of Computer Science University of Nottingham, UK The Functional Programming Lab (FP Lab) in the School of Computer Science at the University of Nottingham is seeking to appoint up to two new PhD students, starting on 1st October 2011. The topics for the studentships are open, but will be within the general area of functional programming. The studentships are for 3.5 years, include a maintenance grant of 13,590 UK pounds per year and UK/EU tuition fees, and are open to UK and EU applicants. Particularly strong candidates from outside the EU may also be considered, subject to additional funds being available. Applicants will require a first-class Honours degree (or equivalent) in Computer Science, Mathematics, and/or Physics, experience in functional programming, and an aptitude for mathematical subjects. A higher degree (e.g. Masters) would be desirable. Additionally, experience in one or more of the following will be particularly welcome: formal semantics, type theory, program verification, theorem provers, domain-specific languages, languages for physical modelling, programming language implementation and tools. Successful applicants will work under the supervision of Dr Graham Hutton or Dr Henrik Nilsson in the FP Lab in Nottingham, a leading centre for research on functional programming. The group currently comprises 5 academic staff, 1 research fellow, and 10 PhD students. In order to apply, please submit the following to Dr Graham Hutton (gmh at cs.nott.ac.uk) or Dr Henrik Nilsson (nhn at cs.nott.ac.uk) by 1st March 2011: an up-to-date copy of your CV (including the results of all your University examinations to date) along with a brief covering letter that describes your experience in functional programming, your reasons for wishing to pursue a PhD in this area, and any ideas you have regarding possible research directions. Note: applicants to the FP Lab should follow the procedure above, rather than applying directly to the School or University, e.g. in response to a general advert for PhD studentships. Closing date for applications: 1st March 2011. +------------------------------------------------------------------+ From d.r.ghica at cs.bham.ac.uk Tue Feb 1 05:24:27 2011 From: d.r.ghica at cs.bham.ac.uk (Dan Ghica) Date: Tue, 1 Feb 2011 10:24:27 +0000 Subject: [TYPES/announce] GaLoP VI Program and Call for Participation Message-ID: CALL FOR PARTICIPATION 6th Workshop on Games for Logic and Programming Languages (GaLoP 2011) // ETAPS 2011 // Saarbr?cken, Germany // 26?27 March // The full preliminary programme is now posted at: http://sites.google.com/site/galopws/ Please register soon in order to take advantage of lower fees, through the ETAPS central site: http://www.etaps.org/registration I hope to see you in Saarbrucken. Best wishes, Dan Ghica From noam.zeilberger at gmail.com Tue Feb 1 09:25:36 2011 From: noam.zeilberger at gmail.com (Noam Zeilberger) Date: Tue, 1 Feb 2011 15:25:36 +0100 Subject: [TYPES/announce] 2nd CFP: Workshop on Theory and Practice of Delimited Continuations Message-ID: Call for Papers TPDC 2011 1st International Workshop on Theory and Practice of Delimited Continuations http://www.pps.jussieu.fr/~saurin/tpdc2011/ 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop - Federated Conference on Rewriting, Deduction, and Programming SCOPE AND TOPIC: Since their introduction in the late 1980s, delimited control operators have triggered increasing interest among programmers and the programming language community, found unexpected applications in conceptual domains such as linguistics and constructive mathematics, and shown themselves to be the natural development of classical control operators. The first workshop on the Theory and Practice of Delimited Continuations aims to bring together people working with the many different (practical, theoretical, or foundational) aspects of delimited continuations, in the hope of fostering some unity and progress. Contributions on all topics related to delimited continuations are welcome, as either short abstracts or full papers (see SUBMISSION PROCEDURE below). INVITED SPEAKERS: To be announced IMPORTANT DATES: # Submission of full papers: 25 February 2011 # Submission of short abstracts: 18 March 2011 # Notification of acceptance: 25 March 2011 # Final version due: 8 April 2011 # Workshop: 29-30 May 2011 SUBMISSION PROCEDURE: We accept submissions of two kinds: * short abstracts (1 to 2 pages) * full papers up to 12 pages Short abstracts are proposals for talks within a wide rubric: reports on work-in-progress or recently published papers, surveys or short tutorials, system demonstrations, etc. Full papers must describe new work not under consideration for publication elsewhere. Accepted papers and abstracts will be presented at the workshop and included in the proceedings, published as a technical report. Papers and abstracts should be formatted using the easychair.cls LaTeX class (see http://easychair.org/coolnews.cgi), and may be submitted electronically as pdf files via the easychair website: https://www.easychair.org/login.cgi?conf=tpdc2011 PROGRAM COMMITTEE: Zena Ariola, University of Oregon, USA Dariusz Biernacki, University of Wroclaw, Poland Hugo Herbelin, INRIA, Paris, France Yukiyoshi Kameyama, University of Tsukuba, Japan Alexis Saurin, CNRS, Paris, France Hayo Thielecke, University of Birmingham, UK Noam Zeilberger, Universit? Paris Diderot, Paris, France WORKSHOP ORGANIZERS: Hugo Herbelin, INRIA, Paris, France Alexis Saurin, CNRS, Paris, France Noam Zeilberger, Universit? Paris Diderot, Paris, France For more information, please contact Alexis Saurin or Noam Zeilberger From urzy at mimuw.edu.pl Thu Feb 3 09:42:19 2011 From: urzy at mimuw.edu.pl (Pawel Urzyczyn) Date: Thu, 03 Feb 2011 15:42:19 +0100 Subject: [TYPES/announce] CFP - Types for Proofs and Programs Message-ID: <4d4abecb.PaYe2Dph1mcoEi2E%urzy@mimuw.edu.pl> ------------------------------------------------------------------------- Logical Methods in Computer Science Special issue "Types for Proofs and Programs" Call for Submissions (Deadline: May 2, 2011) This special issue is devoted to the recent progress in the technology of formal methods: notably the design and verification of software, hardware, and mathematics based on type theory. It continues the tradition originated by several books published by Springer under the same title since 1993. We encourage all researchers to contribute papers on all aspects of type theory and its applications, especially in the mentioned areas. Those include, but are not limited to the following. * Foundations of type theory and constructive mathematics: - Meta-theoretic studies of type systems. * Applications of type theory: - Type theory and functional programming; - Dependently typed programming; - Industrial designs using type theory. * Proof-assistants and proof technology: - Automation in computer-assisted reasoning; - Formalizing mathematics using type theory. Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. Submissions should follow the instructions available from www.lmcs-online.org/ojs/information.php with the following special author instructions. 1. Register as an author on the the web page lmcs-online.org and use the special code "-t-p-p-2010-". In case you are already registered, go to "profile" and enter the above special code under "register for special issue" 2. Go through the submission routine on the webpage. In Step 0 choose the special issue "Types for Proofs and Programs". The submission deadline is Monday, May 2, 2011. Special Issue Editors: Henk Barendregt, Pawel Urzyczyn ---------------------------------------------------------------------------- Pdf version available from http://types10.mimuw.edu.pl/content/call.pdf ---------------------------------------------------------------------------- From U.Berger at swansea.ac.uk Thu Feb 3 20:17:20 2011 From: U.Berger at swansea.ac.uk (Ulrich Berger) Date: Fri, 04 Feb 2011 01:17:20 +0000 Subject: [TYPES/announce] Workshop Announcement: Domains X Message-ID: <4D4B53A0.5080308@swansea.ac.uk> W o r k s h o p A n n o u n c e m e n t D O M A I N S X http://www.cs.swan.ac.uk/domains2011/ Swansea University, Wales, UK, 5-7 September 2011 INTRODUCTION The Workshop on Domains is aimed at computer scientists and mathematicians alike who share an interest in the mathematical foundations of computation. The workshop will focus on domains, their applications and related topics. Previous meetings were held in Darmstadt (94,99,04), Braunschweig (96), Munich (97), Siegen (98), Birmingham (02), Novosibirsk (07) and Brighton (08). Besides its traditional topics Domains X will have the special themes 'Modelling of Computational Effects' and 'Modelling of Discrete and Continuous Data.' FORMAT The emphasis is on the exchange of ideas between participants similar in style to Dagstuhl seminars. In particular, talks on subjects presented at other conferences and workshops are acceptable. INVITED SPEAKERS (confirmed) Lars Birkedal University of Copenhagen (Denmark) Nick Benton Microsoft Research Cambridge (UK) Margarita Korovina University of Manchester (UK) Dag Normann University of Oslo (Norway) John Power University of Bath (UK) Matija Pretnar University of Ljubljana (Slovenia) Thomas Streicher University of Darmstadt (Germany) Jeff Zucker McMaster University (Canada) SCOPE Domain theory has had applications to programming language semantics and logics (lambda-calculus, PCF, LCF), recursion theory (Kleene-Kreisel countable functionals), general topology (injective spaces, function spaces, locally compact spaces, Stone duality), topological algebra (compact Hausdorff semilattices) and analysis (measure, integration, dynamical systems). Moreover, these applications are related - for example, Stone duality gives rise to a logic of observable properties of computational processes. As such, domain theory is highly interdisciplinary. Topics of interaction with domain theory for this workshop include, but are not limited to: program semantics program logics probabilistic computation exact computation over the real numbers lambda calculus games models of sequential computation constructive mathematics recursion theory realizability real analysis and computability topology, metric spaces and domains locale theory category theory topos theory type theory SUBMISSION OF ABSTRACTS Please submit a one-page abstract via Easychair https://www.easychair.org/conferences/?conf=domainsx2011 Shortly after an abstract is submitted (usually two or three weeks), the authors will be notified by the programme committee. The criterion for acceptance is relevance to the meeting. In particular, talks on subjects presented at other conferences and workshops are acceptable. DEADLINE Abstracts will be dealt with on a first-come/first-served basis. We ask potential speakers to express the intention to give a talk by the end of June. REGISTRATION Further details about the local arrangements will be provided soon. VENUE AND ACCOMMODATION The Domains X workshop will take place at Swansea University, Department of Computer Science, Robert Recorde Room (2nd floor, Faraday Building). Accommodation will be on Campus in House Oxwich. Further details will be given later. PROGRAMME COMMITTEE Ulrich Berger Swansea University (Co-Chair) Jens Blanck Swansea University Martin Escardo University of Birmingham (Co-Chair) Achim Jung University of Birmingham Klaus Keimel TU Darmstadt Bernhard Reus University of Sussex John Tucker Swansea University ORGANIZING COMMITTEE Ulrich Berger Swansea University Jens Blanck Swansea University Monika Seisenberger Swansea University PUBLICATION We plan to publish proceedings of the workshop in a special volume of a journal. There will be a call for papers after the workshop. The papers will be refereed according to normal publication standards. URL http://www.cs.swan.ac.uk/domains2011/ From anda at comlab.ox.ac.uk Fri Feb 4 05:26:07 2011 From: anda at comlab.ox.ac.uk (Andrei Akhvlediani) Date: Fri, 4 Feb 2011 10:26:07 +0000 Subject: [TYPES/announce] PSSL 92 - First Announcement Message-ID: <172FDF3A-7484-4794-889A-D81025D0C7A4@comlab.ox.ac.uk> Dear All, We are pleased to announce that the 92nd Peripatetic Seminar on Sheaves and Logic (PSSL) will be held in Oxford, UK on the weekend of April 23-24, 2011. Please let us know asap if you intend to participate and would like to give a talk. If there are more talks than available slots, selection will be based on a combination of FCFS and distribution of topics. We will send a second announcement with practical information and the conference website address in February. Looking forward to seeing you in Oxford! Best wishes, The organisers, Andrei Akhvlediani, Bob Coecke, Raymond Lal, Roman Priebe Oxford University Computing Laboratory - Quantum group http://web.comlab.ox.ac.uk/activities/quantum/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From bruni at di.unipi.it Fri Feb 4 10:50:12 2011 From: bruni at di.unipi.it (Roberto Bruni) Date: Fri, 04 Feb 2011 16:50:12 +0100 Subject: [TYPES/announce] FMOODS & FORTE 2011 (extended deadline!) - Last CfP Message-ID: <4D4C2034.60803@di.unipi.it> [Apologies for multiple copies] Dear colleagues, due to several requests, FMOODS & FORTE 2011 submission deadlines are extended as follows: * February 13, 2011 Abstract Submission [EXTENDED!] * February 20, 2011 Paper Submission [EXTENDED!] Best regards, Roberto and Juergen --------------------------------------------------------------------- Call for Papers FMOODS & FORTE 2011 IFIP Int. Conference on Formal Techniques for Distributed Systems joint international conference 13th Formal Methods for Open Object-Based Distributed Systems 31th Formal Techniques for Networked and Distributed Systems part of the federated event DisCoTec'11 (Distributed Computing Techniques) Reykjavik, Iceland, June 6-9, 2011 http://discotec.ru.is/fmoodsforte/main ========================================================================== Important dates * February 13, 2011 Abstract Submission [EXTENDED!] * February 20, 2011 Paper Submission [EXTENDED!] * March 20, 2011 Notification of Acceptance * April 3, 2011 Camera ready version * June 6-8, 2011 Conference -------------------------------------------------------------------------- Objectives and Scope The joint conference FMOODS & FORTE is a forum for fundamental research on theory and applications of distributed systems. The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of: * component- and model-based design * object technology, modularity, software adaptation * service-oriented, ubiquitous, pervasive, grid, cloud and mobile computing systems * software quality, reliability and security The conference encourages contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems. FMOODS & FORTE covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real time systems, as well as networking and communication security and reliability. -------------------------------------------------------------------------- Topics of interest include but are not limited to: * Languages and Semantic Foundations: new modeling and language concepts for distribution and concurrency, semantics for different types of languages, including programming languages, modeling languages, and domain specific languages; real-time and probability aspects; type systems and behavioral typing * Formal Methods and Techniques: design, specification, analysis, verification, validation and testing of various types of distributed systems including communications and network protocols, service-oriented systems, and adaptive distributed systems * Applications of Formal Methods: applying formal methods and techniques for studying quality, reliability and security of distributed systems, particularly web services, multimedia and telecommunications systems * Practical Experience with Formal Methods: industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems -------------------------------------------------------------------------- Invited Speaker: Giuseppe Castagna -------------------------------------------------------------------------- Proceedings and Submission guidelines The FMOODS & FORTE 2011 conference calls for high quality papers presenting research results and/or application reports related to the research areas in conference scope. The conference proceedings will be published by Springer Verlag in the LNCS series. Proceedings will be made available at the conference. All papers must be original, unpublished, and not submitted for publication elsewhere. Contributions should be submitted electronically in PDF via the EasyChair system at the URL https://www.easychair.org/account/signin.cgi?conf=fmoodsforte11 Each paper will undergo a peer review of at least 3 anonymous reviewers. The papers must be prepared using the SPRINGER LNCS style, available at the URL http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 Papers must not exceed 15 pages in length, including figures and references. For referees' convenience, any additional material that may help assessing the merits of the submission but not to be included in the final version, like some detailed proofs, may be placed in a clearly marked appendix (not to be counted in the page limit). Referees are at liberty to ignore the appendix, and papers must be understandable without them. Submissions not adhering to the above specified constraints may be rejected immediately, without review. -------------------------------------------------------------------------- Programme Committee - Saddek Bensalem, University Joseph Fourier, France - Dirk Beyer, University of Passau, Germany - Gregor Bochmann, University of Ottawa, Canada - Roberto Bruni (co-chair), University of Pisa, Italy - Nancy Day, University of Waterloo, Canada - John Derrick, University of Sheffield, UK - Juergen Dingel (co-chair), Queen's University, Kingston, Canada - Khaled El-Fakih, American University of Sharjah, UAE - Holger Giese, University of Potsdam, Germany - John Hatcliff, Kansas State University, USA - Valerie Issarny, INRIA Paris Rocquencourt, France - Claude Jard, INRIA/IRISA Rennes, France - Einar Broch Johnsen, University of Oslo, Norway - Ferhat Khendek, Concordia University, Canada - Jay Ligatti, University of South Florida, USA - Luigi Logrippo, University of Quebec - Outaouais, Canada - Niels Lohmann, University of Rostock, Germany - Fabio Massacci, University of Trento, Italy - Uwe Nestmann, Technical University of Berlin, Germany - Peter Olveczky, University of Oslo, Norway - Alexandre Petrenko, CRIM Montreal, Canada - Frank Piessens, Katholieke Universiteit Leuven, Belgium - Andre Platzer, Carnegie Mellon University, USA - Antonio Ravara, Technical University of Lisbon, Portugal - Ken Turner, University of Stirling, UK - Keiichi Yasumoto, Nara Institute of Science and Technology, Japan - Nobuko Yoshida, Imperial College London, UK - Elena Zucca, University of Genova, Italy -------------------------------------------------------------------------- Steering Committee - Gilles Barthe, IMDEA Software, Spain - Gregor v. Bochmann, University of Ottawa, Canada - Frank S. de Boer, Centrum voor Wiskunde en Informatica, the Netherlands - John Derrick, University of Sheffield, UK - Khaled El-Fakih, American University of Sharjah, UAE - Roberto Gorrieri, University of Bologna, Italy - John Hatcliff, Kansas State University, USA - David Lee, The Ohio State University, USA - Antonia Lopes, University of Lisbon, Portugal - Elie Najm (chair), Telecom ParisTech, France - Arnd Poetzsch-Heffter, University of Kaiserslautern, Germany - Antonio Ravara, Technical University of Lisbon, Portugal - Carolyn Talcott, SRI International, USA - Ken Turner, University of Stirling, UK - Keiichi Yasumoto, NAIST, Japan - Elena Zucca, University of Genova, Italy -------------------------------------------------------------------------- Contact Information fmoodsforte11 at easychair.org -------------------------------------------------------------------------- -- ===================================================================== Dr. Roberto Bruni Computer Science Department Phone: +39 050 2212785 University of Pisa Fax: +39 050 2212726 Largo B. Pontecorvo, 3 Email: bruni at di.unipi.it I-56127 Pisa - ITALY WWW: http://www.di.unipi.it/~bruni ===================================================================== "We think in generalities, but we live in detail" Alfred N. Whitehead ===================================================================== From gaboardi at cs.unibo.it Fri Feb 4 18:24:15 2011 From: gaboardi at cs.unibo.it (Marco Gaboardi) Date: Sat, 5 Feb 2011 00:24:15 +0100 Subject: [TYPES/announce] Oregon Programming Languages Summer School 2011 - Call For Participation Message-ID: ---------------------------------------------------------------------- Call For Participation Types, Semantics and Verification 10th Annual Oregon Programming Languages Summer School (OPLSS 2011) University of Oregon, Eugene. June 16 - July 1, 2011 http://www.cs.uoregon.edu/Activities/summerschool/ ---------------------------------------------------------------------- The focus of this summer school is the mix or interplay of theory and practice in program verification. The main aim is to enable participants to conduct research in the area, thereby contributing to improve software quality. The Oregon Programming Languages Summer School (OPLSS) has been held at the University of Oregon each summer since 2002. This year, in the occasion of the tenth anniversary of the summer school, two plenary lectures will complement the technical program. ---------------------------------------------------------------------- Technical Program Logical Relations Amal Ahmed - Indiana University Software Verification Andrew Appel - Princeton University Monadic Effects Nick Benton - Microsoft Research Metamathematics of Polymorphic Logics - applications Robert Constable - Cornell University Polarization and Focalization Pierre-Louis Curien - pi.r2 team, PPS, CNRS-Paris Diderot University- INRIA Type Theory Foundation Robert Harper - Carnegie Mellon University Coq Foundation Hugo Herbelin - pi.r2 team, PPS, CNRS-Paris Diderot University-INRIA Compiler Certification Xavier Leroy - INRIA Category Theory Paul-Andre' Mellies - PPS, CNRS-Paris Diderot University Imperative Programming in Coq Greg Morrisett - Harvard University Proof Theory Foundation Frank Pfenning - Carnegie Mellon University Proof Theory in Coq Benjamin Pierce - University of Pennsylvania Semilattices, Domains, and Computability Dana Scott - Carnegie Mellon University - Berkeley University Plenary Lectures: Speaker: Dana Scott (Carnegie Mellon University and Berkeley University) Title: What is a Proof? -- Some Challenges for Automated Theorem Proving Speaker: Robert Constable (Cornell University) Title: Metamathematics of Polymorphic Logics - foundations ---------------------------------------------------------------------- Registration Full information on registration are available at: http://www.cs.uoregon.edu/Activities/summerschool/ Registration Deadline: March 4, 2011 ---------------------------------------------------------------------- Some further activities will complement the main program. Coq-labs: Some of the lectures will assume interactive sessions using the interactive proof assistant Coq. Students are encouraged to bring a laptop on which Coq has been installed, and to form small working group during the interactive sessions. Moreover, some Coq-labs will be offered in order to give the participants the opportunity of make more practice in using Coq. Student Sessions: Interested students will have the opportunity to present their work during special sessions. Each presentation will consist of a brief talk about the student research interests and results. These sessions will be an occasion for students to obtain useful feedback on their work by other students and researchers, and also to interact with participants having similar research interests. We hope to see you in Eugene. Zena Ariola Pierre-Louis Curien Marco Gaboardi Robert Harper Hugo Herbelin From cbraga at ic.uff.br Sat Feb 5 08:10:53 2011 From: cbraga at ic.uff.br (Christiano Braga) Date: Sat, 5 Feb 2011 11:10:53 -0200 Subject: [TYPES/announce] SBLP 2011 - 3rd. call for papers Message-ID: [Apologies for multiple copies of this call.] SBLP 2011: Call For Papers 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 26-30, 2011 http://www.each.usp.br/cbsoft2011/ IMPORTANT DATES Paper abstract submission (15 lines): April 22nd, 2011 Full paper submission: April 29th, 2011 Notification of acceptance: May 30th, 2011 Final papers due: July 1st, 2011 INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester Talk title: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida Talk title: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" INTRODUCTION The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2011 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical approaches. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Submissions should be done using SBLP 2011 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2011. Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. All papers should be prepared using the Springer Lecture Notes in Computer Science (LNCS) template. (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) We encourage the submission of short papers reporting on master dissertations or doctoral theses at early stages of their development. All accepted papers, with at least one author registered in the conference, will be published in the conference proceedings. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP 2009 and 2010, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. ORGANIZATION CHAIRS - For CBSoft * Marcelo Fantinato, EACH - USP * Luciano Silva, FCI - Mackenzie - For SBLP * Denise Stringhini FCI, Mackenzie * Alfredo Goldman IME, USP PROGRAMME COMMITTEE CHAIRS * Christiano Braga, UFF * Jose Luiz Fiadeiro, Univ. of Leicester PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Andre Du Bois, UFPel * Alex Garcia, IME * Andre Santos, UFPE * Artur Boronat, Univ. of Leicester * Carlos Camarao, UFMG * Christiano Braga, UFF (co-chair) * Fernando Castor Filho, UFPE * Fernando Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC * Jens Palsberg, UCLA * Joao Saraiva, Universidade do Minho * Johan Jeuring, Utrecht Univ. * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester (co-chair) * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho * Marcelo A. Maia, UFU * Marcelo d'Amorim, UFPE * Marco Tulio Valente, UFMG * Mariza A. S. Bigonha, UFMG * Martin A. Musicante, UFRN * Noemi Rodriguez, PUC-Rio * Paulo Borba, UFPE * Peter Mosses, Swansea University * Renato Cerqueira, PUC-Rio * Ricardo Massa, UFPE * Roberto S. Bigonha, UFMG * Roberto Ierusalimschy, PUC-Rio * Sandro Rigo, UNICAMP * Sergio Soares, UFPE * Sergiu Dascalu, Univ. of Nevada * Simon Thompson, Univ. of Kent * Varmo Vene, Univ. de Tartu From dario.dellamonica at uniud.it Sat Feb 5 13:37:58 2011 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Sat, 05 Feb 2011 19:37:58 +0100 Subject: [TYPES/announce] GandALF 2011: Call for Papers Message-ID: <4D4D9906.5090303@uniud.it> ******************************************************************************** ------- GandALF 2011 ******************************************************************************** Second International Symposium on Games, Automata, Logics, and Formal Verification Minori, Amalfi Coast, Italy, June 15-17, 2011 http://gandalf.dia.unisa.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 concrete applications, and to stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. INDICATIVE LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Logical aspects of Computational Complexity 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 Game Theory Hybrid, Embedded, and Mobile Systems Verification Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Program Analysis and Software Verification Specification and Verification of Finite and Infinite-state Systems Synthesis and Execution 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 March 13, 2011 Paper submission March 20, 2011 Acceptance notification April 22, 2011 Final version May 15, 2011 Conference June 15-17, 2011 INVITED SPEAKERS Thomas Colcombet (CNRS, Paris FRANCE) Erich Graedel (RWTH Aachen University, GERMANY) Moshe Vardi (Rice University, Houston USA) 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 last GandALF (GandALF 2010) will be published as a special issue of the International Journal of Foundation of Computer Science (http://www.cs.ucsb.edu/~ijfcs/). INFO Please visit the conference website (http://gandalf.dia.unisa.it) for more information. GENERAL CHAIR Angelo Montanari (University of Udine, ITALY) PROGRAM CHAIRS Giovanna D'Agostino (University of Udine, ITALY) Salvatore La Torre (University of Salerno, ITALY) PROGRAM COMMITTEE Krishnendu Chatterjee (Inst. of Science and Tech, AUSTRIA) Swarat Chaudhuri (Pennsylvania State University, USA) Giorgio Delzanno (University of Genova, ITALY) Javier Esparza (Technische Universitat Munchen, GERMANY) Eric Graedel (RWTH Aachen University, GERMANY) Neil Immerman, (University of Massachusetts, USA) Wojtek Jamroga (University of Luxembourg, LUXEMBOURG) Vineet Kahlon, (NEC Labs, Princeton, USA) Martin Leucker (University of Lubeck, GERMANY) Jerzy Marcinkowski (University of Wroclaw, POLAND) Aniello Murano (University of Napoli "Federico II", ITALY) Mimmo Parente (University of Salerno, ITALY) Gabriele Puppis (Oxford University, UK) Alexander Rabinovich (Tel Aviv University, ISRAEL) Jean Francois Raskin (University of Bruxelles, BELGIUM) Colin Stirling (University of Edinburgh, UK) Tayssir Touili (University Paris Diderot, FRANCE) Yde Venema (ILLC, University of Amsterdam, HOLLAND) Bow-Yaw Wang (INRIA, FRANCE and Tsinghua University, CHINA) Igor Walukiewicz (LaBRI, University of Bordeaux1, FRANCE) 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) ORGANIZING COMMITTEE TBA From Klaus.Havelund at jpl.nasa.gov Sat Feb 5 16:25:01 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (317J)) Date: Sat, 5 Feb 2011 13:25:01 -0800 Subject: [TYPES/announce] [fm-announcements] VVPS 2011 - deadline extension for all ICAPS workshops In-Reply-To: Message-ID: ---------------------------------------------------------------------- ** CALL FOR PAPERS ** DEADLINE EXTENSION FOR ALL ICAPS WORKSHOPS: March 18 3rd ICAPS Workshop on Verification and Validation for Planning and Scheduling Systems (VVPS'11) http://icaps11.informatik.uni-freiburg.de/workshops/vvps.html Freiburg, Germany, June 13, 2011 ---------------------------------------------------------------------- Topic and Objectives: Planning and scheduling (P&S) systems are finding increased application in safety- and mission-critical systems that require a high level of assurance. However, tools and methodologies for verification and validation (V&V) of P&S systems have received relatively little attention. Therefore, important goals of the workshop are (i) to encourage the ongoing interaction between V&V and P&S communities, (ii) to identify innovative tools and methodologies (iii) and to elicit open issues and real challenges. The workshop also aims to enhance a stable, long-term establishment of a forum on relevant topics connected to the influence between V&V and P&S. The workshop series began in 2005 with the first edition of the workshop (http://planning.cis.strath.ac.uk/vvpsws/) during ICAPS '05 and continued in 2009 with the second edition (http://www-vvps09.imag.fr/) during ICAPS '09. These workshops presented a stimulating environment where researchers could discuss about the opportunities and challenges in integrating V&V and P&S. Topics of interest include: V&V of domain models, using technologies such as static analysis, theorem proving, and model checking; consistency and completeness of domain models; domain model coverage metrics; regression, stress and boundary testing; runtime verification of plan executions; generation of robust plans; compositional verification of domain models; how to structure domain models which are more amenable to static analysis; inspection methods; the relationship between timed automata and domain models; investigations of the impact wrt. V&V of procedural versus declarative plan models; application of P&S techniques to V&V; Planning as model checking; etc. Important Dates: Paper submission: March 18, 2011 (*** extended ***) Notification of acceptance/rejection: April 15, 2011 Final version due: TBA Workshop Date: June 13, 2011 Submissions: There are two types of submissions: short position statements and regular papers. Position papers are a maximum of 2 (two) pages. Regular papers are a maximum of 10 (ten) pages. Papers should be submitted via the VVPS EasyChair website: http://www.easychair.org/conferences/?conf=vvps11 All papers should be typeset in the AAAI style, described at: http://www.aaai.org/Publications/Author/author.php Accepted papers will be published on the workshop website and printed as a hard-copy. A selection of the accepted papers will be published in a special issue of the International Journal on Software Tools for Technology Transfer: http://sttt.cs.uni-dortmund.de/index.html. Any additional questions can be directed towards the general workshop contact email: vvps11 at easychair.org Organization Chairs: Saddek Bensalem, VERIMAG, France saddek.bensalem at imag.fr Klaus Havelund, NASA JPL, U.S.A. klaus.havelund at jpl.nasa.gov Andrea Orlandini ITIA-CNR, Italy andrea.orlandini at itia.cnr.it Programme Committee: Howard Barringer (University of Manchester, UK) Andreas Bauer (NICTA, Australia) Saddek Bensalem (Verimag/UJF, France) (Co-Chair) Amedeo Cesta (ISTC-CNR, Rome, Italy) Alessandro Cimatti (FBK, Trento, Italy) Alexandre David (Aalborg University, Denmark) Giuseppe Della Penna (University of L'Aquila, L'Aquila, Italy) Lucas Dixon (University of Edinburgh, Edinburgh, UK) Bernd Finkbeiner (Saarland University, Germany) Alberto Finzi (University of Naples, Naples, Italy) Maria Fox (University of Strathclyde, UK) Dimitra Giannakopoulou (NASA Ames Research Center, USA) Enrico Giunchiglia (University of Genova, Italy) Alex Groce (Oregon State University, USA) Klaus Havelund (JPL, USA) (Co-Chair) Gerard Holzmann (JPL, USA) Felix Ingrand (LAAS-CNRS, France) Hadas Kress-Gazit (Cornell University, USA) Kim G. Larsen (Aalborg University, Denmark) Martin Leucker Technische Universit?t M?nchen, Germany) Lee McCluskey (University of Huddersfield, UK) David Musliner (SIFT, USA) Andrea Orlandini (ITIA-CNR, Milan, Italy) (Co-Chair) Corina Pasareanu (NASA Ames Research Center, USA) Charles Pecheur (Universit? catholique de Louvain, Belgium) Paul Pettersson (Malardalen University, Sweden) Douglas Smith (Kestrel Institute, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From vlad.rusu at inria.fr Sun Feb 6 11:07:25 2011 From: vlad.rusu at inria.fr (Vlad Rusu) Date: Sun, 6 Feb 2011 17:07:25 +0100 (CET) Subject: [TYPES/announce] Call for Papers - AMMSE 2001 - Algebraic Methods in Model-Based Software Engineering In-Reply-To: <13293320.30.1297006345468.JavaMail.rusu@initial.local> Message-ID: <13292375.52.1297008904451.JavaMail.rusu@initial.local> CALL FOR PAPERS AMMSE 2011 2nd International Workshop on Algebraic Methods in Model-Based Software Engineering A satellite event of the TOOLS'11 Conference Zurich, Switzerland, June 30th, 2011 AIMS AND SCOPE Over the past years there has been quite a lot of activity in the algebraic community about using algebraic methods for providing support to model-driven software engineering. The aim of this workshop is to gather researchers working on the development and application of algebraic methods to provide rigorous support to model-based software engineering. The topics relevant to the workshop are all those related to the use of algebraic methods to software engineering, including but not limited to: - formally specifying and verifying model-based software engineering concepts and related ones (MDE, UML, OCL, MOF, DSLs, ...) - tool support for the above - integration of formal and informal methods - theoretical frameworks (algebraic, rewriting-based, category theory-based, ...) The main goal is to examine, discuss, and relate the existing projects within the algebraic community that address common open-issues in model-driven software engineering. To foster the discussion among participants, our plan is to organize the workshop in two main sessions, with short individual presentations (20 minutes) followed by ample time slots for comments, questions, and exchange of ideas. IMPORTANT DATES Paper submission deadline: April 13, 2011 Author notification: May 29, 2011 Camera-ready paper versions due: June 12, 2011 Workshop: June 30, 2011 PROGRAM COMMITTEE Artur Boronat, University of Leicester, UK Roberto Bruni, University of Pisa, Italy Jordi Cabot, ?cole des Mines de Nantes, France Manuel Clavel, Imdea Software & Universidad Complutense de Madrid, Spain Francisco Dur?n, University of M?laga, Spain (co-chair) Martin Gogolla, University of Bremen, Germany Alexander Knapp, Augsburg University, Germany Juan de Lara, Universidad Aut?noma de Madrid, Spain Jos? Meseguer, University of Illinois, Urbana-Champaign, USA Pierre-Etienne Moreau, Ecole des Mines de Nancy & INRIA Nancy Grand-Est, France Peter Olveczky, University of Oslo, Norway Vlad Rusu, INRIA Lille Nord-Europe, France (co-chair) Gwen Sala?n, Grenoble INP?INRIA? LIG. France Mart?n Wirsing, Ludwig-Maximilians-Universit?t, M?nchen, Germany VENUE The selected papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS).The organizers of TOOLS'11 are negotiating for an LNCS volume comprising extended versions of the best papers of all the TOOLS'11 satellite events. SUBMISSIONS Please submit your contributions via https://www.easychair.org/conferences/?conf=ammse2011 Submissions should be at most 15 pages long in the EPTCS LaTeX style, available at http://style.eptcs.org/ CONTACT INFORMATION Francisco Duran duran at lcc.uma.es Vlad Rusu vlad.rusu at inria.fr ---- From shilov at iis.nsk.su Mon Feb 7 03:00:02 2011 From: shilov at iis.nsk.su (shilov at iis.nsk.su) Date: Mon, 7 Feb 2011 14:00:02 +0600 Subject: [TYPES/announce] CFP: Second Workshop on Program Semantics, Specification and Verification (St. Petersburg, Russia). Message-ID: <7AF3FF458CEC4D2898EF5A0403832BC9@fitmobile01> The Second Workshop on Program Semantics, Specification and Verification: Theory and Applications (PSSV 2011, http://logic.pdmi.ras.ru/csr2011/ppsv2011) affiliated with 6th International Computer Science Symposium in Russia (CSR-2011), will be held on June 12-13, 2011 in St. Petersburg, Russia. It will be the second edition of the workshop. The first inaugural workshop PSSV-2010 took place June 14-15, 2010 in Kazan, Russia as a part of 5th International Computer Science Symposium in Russia (CSR-2010). =========================================== Important dates: Extended abstract submission: March 1, 2011 Notification: March 31, 2011 =========================================== Official language: English =========================================== Scope and Topics List of topics of interest includes (but is not limited to): * formalisms for program semantics (e.g. Abstract State Machines); * formal models and semantics of programs and systems (e.g. labeled transition systems); * semantics of programming and specification languages (e.g. axiomatic semantics); * formal description techniques (e.g. SDL); * logics for formal specification and verification (e.g. temporal logic); * deductive program verification (e.g. verification conditions and automatic invariant generation); * automatic theorem proving (e.g. combinations of decidable theories); * model checking of programs and systems (e.g. verification of finite-state protocol models); * static analysis of programs; * formal approach to testing and validation (e.g. automatic test generation); * program analysis and verification tools. Research, work in progress and position papers are welcome. =========================================== Program Chairs * Valery Nepomniaschy (Institute of Informatics Systems, Novosibirsk, Russia, vnep at iis.nsk.su) * Valery Sokolov (Yaroslavl State University, Yaroslavl, Russia, sokolov at uniyar.ac.ru) Program Committee: * Natasha Alechina (University of Nottingham, UK), * Sergey Baranov (St. Petersburg State Polytech. University, Russia), * Alexander Bolotov (University of Westminster, UK), * Michael Dekhtyar (Tver State University , 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), * Alexander Letichevsky (Glushkov Institute of Cybernetics, Kiev, Ukraine), * Alexei Lisitsa (University of Lliverpool), * 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-2011" to Alexei Promsky (promsky at iis.nsk.su) and their short 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. From shilov at iis.nsk.su Mon Feb 7 06:34:10 2011 From: shilov at iis.nsk.su (shilov at iis.nsk.su) Date: Mon, 7 Feb 2011 17:34:10 +0600 Subject: [TYPES/announce] =?koi8-r?b?Q0ZQOiBXb3Jrc2hvcCBvbiBQcm9ncmFtIFVu?= =?koi8-r?b?ZGVyc3RhbmRpbmcgKEp1bHkgMiAtIDQsIDIwMTEsIE5vdm9zaWJp?= =?koi8-r?b?cnNrLCBSdXNzaWEp?= Message-ID: <160249797C5942008345572CB3C178DC@fitmobile01> International Workshop on Program Understanding July 2 - 4, 2011, Novosibirsk, Russia (http://psi.nsc.ru/psi11/p_understanding/index) The workshop is a satellite event of the 8th Ershov Informatics Conference PSI'11 (June 27 - July 01, 2011, Novosibirsk, Akademgorodok, Russia, http://psi.nsc.ru/). The aim of the workshop is to provide an opportunity for active researchers to establish cooperation, to exchange new ideas and discuss in deep current trends and problems related to the following topics. Workshop topics * formal and informal program models; * program specification, transformation and verification; * semantics and program analysis; * programming paradigms; * system re-engineering and reuse; * integrated programming environments; * software architectures; * software maintenance and testing; * program understanding and visualization. (The list is not exhaustive.) Co-chairs * Mikhail Bulyonkov, A.P.Ershov Institute of Informatics Systems, Novosibirsk, Russia (mike at iis.nsk.su) * Robert Gluck, DIKU, Dept. of Computer Science, University of Copenhagen, Denmark (glueck at acm.org). Programme Committee * Kenichi Asai, Ochanomizu University, Tokyo, Japan (asai at is.ocha.ac.jp, http://pllab.is.ocha.ac.jp/~asai/) * Dmitry Bulychev, Sank-Petersburg State University, Russia * Geoff Hamilton, Dublin City University, Ireland (Geoff.Hamilton at computing.dcu.ie, http://www.computing.dcu.ie/~hamilton/) * Andrei Klimov, Keldysh Institute of Applied Mathematics, Russia (klimov at keldysh.ru, http://pat.keldysh.ru/~anklimov/) * Sergei Romanenko, Keldysh Institute of Applied Mathematics, Russia (sergei.romanenko at supercompilers.ru, http://pat.keldysh.ru/~roman/) * Peter Sestoft, IT University of Copenhagen , Denmark (sestoft at itu.dk, http://www.itu.dk/~sestoft/) * Nikolay Shilov, A.P.Ershov Institute of Informatics Systems, Russia (shilov at iis.nsk.su, http://www.iis.nsk.su/persons/shilov/shilov.htm) * Andrey Terekhov, St. Petersburg State University, Russia (Andrey.Terekhov at lanit-tercom.com, http://ant.tepkom.ru/) Submission All submissions must be in English, clearly written and in sufficient detail to allow the Program Committee to assess the merits of the work. Electronic submissions by email to pev at iis.nsk.su are welcome. Please use LaTeX2e and do not exeed 12 pages limit (of A4 size). Submissions should be received by April 22, 2011. The paper should indicate complete authors' addresses (including e-mail addresses), affiliation and a short abstract. Authors will be notified about PC decision by May 8, 2011. Proceedings Publication Accepted papers will be published is a special complementary volume to Proceedings of PSI'11 Conference that will be available at the workshop. Venue The workshop location is a picturesque resort nearby Novosibirsk. Important Dates * April 22, 2011 - paper submission by email to pev at iis.nsk.su * May 8, 2011 - author notification. * May 22, 2011 - final version due date. * June 27 - July 01, 2011 - PSI'11 Conference. * July 2 - 4, 2011 - PU Workshop. From sylvie.boldo at inria.fr Mon Feb 7 11:17:07 2011 From: sylvie.boldo at inria.fr (Sylvie Boldo) Date: Mon, 07 Feb 2011 17:17:07 +0100 Subject: [TYPES/announce] Postdoc position for 6 months in Orsay Message-ID: <48583e691d66e6c349cb0ab532ac5fcb@lri.fr> The FOST ANR projet seeks candidates for a postdoctoral positionfor 6 months at the INRIA Saclay - ?le-de-France in Orsay, to begin as soon as possible. The FOST projet aims at formally proving numerical analysis programs. In particular, we have formally proved the correctness of a numerical scheme that solves the 1D acoustic wave equation using the Coq proof assistant. This postdoctoral work will generalize the proof to higher dimensions. Extensive experience with Coq or similar provers is desirable. See http://fost.saclay.inria.fr and http://hal.inria.fr/inria-00450789/en/ (published at ITP'10) for more details. -- Sylvie Boldo, projet ProVal, INRIA Saclay - ?le-de-France Parc Orsay Universit? - 4 rue Jacques Monod - 91893 ORSAY Cedex From ccshan at rutgers.edu Mon Feb 7 17:03:10 2011 From: ccshan at rutgers.edu (Chung-chieh Shan) Date: Mon, 7 Feb 2011 17:03:10 -0500 Subject: [TYPES/announce] Continuation Workshop 2011: Call for Contributions Message-ID: <20110207220310.GA27211@mantle.bostoncoop.net> CW 2011 ACM SIGPLAN Continuation Workshop 2011 http://logic.cs.tsukuba.ac.jp/cw2011/ co-located with ICFP 2011, Tokyo, Japan Saturday, September 24, 2011 Call for Contributions Continuations have been discovered many times, which highlights their many applications in programming language semantics and program analysis, linguistics, logic, parallel processing, compilation and web programming. Recently, there has been a surge of interest specifically in delimited continuations: new implementations (in Scala, Ruby, OCaml, Haskell), new applications (to probabilistic programming, event-driven distributed processing), substructural and constructive logics, natural language semantics. The goal of the Continuation Workshop is to make continuations more accessible and useful -- to practitioners and to researchers in various areas of computer science and outside computer science. We wish to promote communication among the implementors and users in many fields. We would like to publicize the applications of continuations in academic (logic, linguistics) and practical fields and various programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc). Continuation Workshop 2011 will be informal. We aim at accessible presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. The workshop will have no published proceedings; submissions of short abstracts are preferred. We intend to organize a tutorial session on delimited continuations and their main applications, in the evening before the workshop, on Friday, September 23, 2011. Invited speakers ---------------- TBD Important dates --------------- Submission: June 25, 2011 Notification: August 8, 2011 Tutorials: September 23, 2011 Workshop: September 24, 2011 Format ------ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ----- We seek several types of presentations on topics related to continuations. We especially encourage presentations that describe work in progress, outline a future research agenda, or encourage lively discussion. Research presentations on: - implementations of continuations - semantics - type systems and logics - meta-theory and its mechanization - code generation with continuations or effects - distributed programming - systems programming and security - pearls Research presentations must be broadly accessible and should describe new ideas, experimental results, significant advances in the theory or application of continuations, or informed positions regarding new control operators. Application presentations, or status reports These broadly accessible presentations should describe interesting applications of continuations in research, industry or open source. We encourage presentations of applications from areas outside of programming language research -- such as linguistics, logics, AI, computer graphics, operating systems, etc. These presentations need not present original research, but should deliver information that is new or that is unfamiliar to the general ICFP audience. (A broadly accessible version of research presented elsewhere, with the most recent results and more discussion of future work may be acceptable as a CW 2011 status report.) The abstract submission should justify, to a general reader, why an application is interesting. Demos and work-in-progress reports Live demonstrations or presentations of preliminary results are intended to show new developments, interesting prototypes, or work in progress. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes, and a work-in-progress report should take about 5 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Presenters will have to bring all the software and hardware for their demonstration; the workshop organizers are only able to provide a projector.) Submission Guidelines and Instructions -------------------------------------- Unlike the previous Continuation Workshops, we do not require the submission of complete research papers. We will select presentations based on submitted abstracts, up to 2 (A4 or US letter) pages long in the PDF format (with the optional supplementary material, up to 8 PDF pages). Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Email submissions to cw2011-submit at logic.cs.tsukuba.ac.jp Organizers ---------- Yukiyoshi Kameyama, University of Tsukuba http://logic.cs.tsukuba.ac.jp/~kam/ Chung-chieh Shan, Rutgers University http://www.cs.rutgers.edu/~ccshan/ Oleg Kiselyov http://okmij.org/ftp/ Program Committee ----------------- Kenichi Asai, Ochanomizu University, Japan http://pllab.is.ocha.ac.jp/~asai/ Malgorzata Biernacka, University of Wroclaw, Poland http://www.ii.uni.wroc.pl/~mabi/ Hugo Herbelin, PPS - pi.r2, INRIA, France http://pauillac.inria.fr/~herbelin/index-eng.html Oleg Kiselyov http://okmij.org/ftp/ Julia Lawall, University of Copenhagen, Denmark http://www.diku.dk/~julia Tiark Rompf, EPFL, Switzerland Chung-chieh Shan, Rutgers University (Chair) http://www.cs.rutgers.edu/~ccshan/ Hayo Thielecke, University of Birmingham, UK http://www.cs.bham.ac.uk/~hxt Previous Workshops ------------------ ACM SIGPLAN Continuation Workshop (CW'04) http://www.cs.bham.ac.uk/~hxt/cw04/index.html ACM SIGPLAN Workshop on Continuations (CW'01) http://www.cs.indiana.edu/~sabry/cw01/ ACM SIGPLAN Workshop on Continuations (CW'97) http://www.brics.dk/~cw97/ Continuation Fest 2008 http://logic.cs.tsukuba.ac.jp/~kam/Continuation2008/ -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 190 bytes Desc: Digital signature URL: From Jean-Yves.Marion at loria.fr Tue Feb 8 03:33:14 2011 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Tue, 8 Feb 2011 09:33:14 +0100 Subject: [TYPES/announce] Call for participation DICE 2011 Message-ID: <1E615826-35B8-4FDB-A2A3-79D875C3B1FB@loria.fr> ---------------------------------------------------------------------------------- Second International Workshop on Developments in Implicit Computational complExity (DICE 2011) http://dice11.loria.fr/ April, 2nd-3rd, Saarbr?cken, Germany as part of ETAPS 2011 ----------------------------------------------------------------------------------- REGISTRATION : To register for DICE 2011, follow the link from the ETAPS 2011 http://www.etaps.org/ (Early registration by Feb. 11th) ----------------------------------------------------------------------------------- April, 2nd (Saturday) --------------------------- 9h30-10h30 : Daniel Leivant (Invited Talk) TBA 10h30-11h : Coffee break 11h-11H45 : Maurizio Dominici and Simona Ronchi della Rocca. Evaluation in Resource lambda Calculus 11h45-12h30 : Lucien Capdevielle. A type system for PSPACE derived from light linear logic 12h30-14h : Lunch break 14h-15h : Ricardo Pena (Invited Talk) TBA 15h-16h : Amir Ben-Amram and Michael Vainer. Complexity Analysis of Size-Change Terminating Programs (extended abstract) : Marco Gaboardi. Realizability Models for Cost-Preserving Compiler Correctness (Extended Abstract) 16h-16h30 : Coffee break 16h30-17h15 : Jean-Yves Moyen and Ryma Metnani. Equivalence between the mwp and Quasi-Interpretation analysis 17h15-18h : Cl?ment Aubert. Sublogarithmic uniform Boolean proof nets April 3rd (Saturday) ---------------------------- 9h30-10h30 : Martin Hofmann (Invited Talk) TBA 10h30-11h : Coffee break 11h-11h45 : Daniel Leivant and Ramyaa Ramyaa. Implicit complexity for coinductive data: a characterization of corecurrence 11h45-12h30 : Evgeny Makarov. Another characterization of provably recursive functions 12h30-14h : Lunch break 14h-16h : Alo?s Brunel. Light forcing, Krivine's classical realizability and the timeout effect (Extended Abstract) : Tobias Heindel. On the Complexity of Process Behaviours (Extended Abstract) : Patrick Baillot. On Elementary Linear Logic and polynomial time (Extended Abstract) : Jesse Alama, Patr?cia Engr?cia, Reinhard Kahle and Isabel Oitavem. Induction schemes for complexity classes in applicative theories -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Tue Feb 8 03:33:29 2011 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 8 Feb 2011 09:33:29 +0100 Subject: [TYPES/announce] ICFP 2011: Second Call for Papers Message-ID: ===================================================================== Second Call for Papers ICFP 2011: International Conference on Functional Programming Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011 http://www.icfpconference.org/icfp2011 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Titles, abstracts & keywords due: Thursday 17 March 2011 at 14:00 UTC Submissions due: Thursday 24 March 2011 at 14:00 UTC Author response: Tuesday & Wednesday 17-18 May Notification: Monday 30 May 2011 Final copy due: Friday 01 July 2011 Conference: Monday-Wednesday 19-21 September 2011 Scope ~~~~~ ICFP 2011 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to imperative, object-oriented, or logic programming; interoperability * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; mathematical logic; monads; continuations; delimited continuations; global, delimited, or local effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proofs; normalization by evaluation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By 17 March 2011, 14:00 UTC, submit a title, an abstract of at most 300 words, and keywords. * By 24 March 2011, 14:00 UTC, submit a full paper of at most 12 pages (6 pages for a Functional Pearl and for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm In addition, authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no rewiewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on Tuesday 17 May 2010, to read reviews and respond to them. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2011. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Conference Chairs: Manuel M T Chakravarty, University of New South Wales, Australia Zhenjiang Hu, National Institute of Informatics (NII), Japan Program Chair: Olivier Danvy, Aarhus University, Denmark Program Committee: Kenichi Asai, Ochanomizu University, Japan Josh Berdine, Microsoft Research, UK Adam Chlipala, Harvard University, USA William Cook, University of Texas at Austin, USA Maribel Fernandez, King's College London, UK Ronald Garcia, Carnegie Mellon University, USA Neal Glew, Intel Labs, USA Jacques Garrigue, Nagoya University, Japan Suresh Jagannathan, Purdue University, USA Sam Lindley, University of Edinburgh, UK Frank Pfenning, Carnegie Mellon University, USA Paola Quaglia, University of Trento, Italy Alexis Saurin, University of Paris VII, France Mike Spivey, Oxford University, UK Kristian Stoevring, University of Copenhagen, Denmark Doaitse Swierstra, Utrecht University, The Netherlands David Van Horn, Northeastern University, USA Rene Vestergaard, JAIST, Japan Edwin Westbrook, Rice University, USA From ricardo at sip.ucm.es Tue Feb 8 12:13:17 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Tue, 08 Feb 2011 18:13:17 +0100 Subject: [TYPES/announce] FOPARA 2011, 1st CALL FOR PAPERS Message-ID: <4D5179AD.9020909@sip.ucm.es> *************************************************************************** * * CALL FOR PAPERS * * 2nd International Workshop on * Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** Scope ----- The 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) will be held at the Computer Science Faculty of Complutense University of Madrid. It will be co-located with the 12th International Symposium Trends in Functional Programming, TFP 2011 (http://dalila.sip.ucm.es/tfp11/). The workshop will serve as a forum for presenting original research results that are relevant to the analysis of resource (time, space, and others) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- FOPARA 2011 is a two-phase workshop. All participants are invited to submit a draft paper describing the work to be presented at the workshop. These submissions will be screened by the program committee chair to make sure they are within the scope of FOPARA and will appear in the draft proceedings distributed at the workshop. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the workshop, authors will be given the opportunity to incorporate the feedback from discussions at the workshop and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles that will appear in the formal proceedings. All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Computer Science Department of Complutense University of Madrid. The papers selected after the reviewing process will be published as a volume of the Springer LNCS series. Dates ----- Full Paper submission deadline: April 15, 2011 Notification of acceptance (for presentation): April 20, 2011 Early Registration deadline: April 25, 2011 FOPARA workshop: May 19, 2011 Submission for formal review deadline: July 8, 2011 Notification of acceptance (for LNCS): September 16, 2011 Camera ready paper: October 7th, 2011 Program Committee ----------------- . Purificacion Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/?cole normale sup?rieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tam?s Kozsik (E?tv?s Lor?nd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL) Sponsors -------- . Computer Science Faculty, Complutense University of Madrid . Spanish Ministry of Science and Innovation --------------------------------------------------------------------------- Ricardo Pe?a FOPARA 2011 PC Chair -- Ricardo Pe~na e-mail: ricardo at sip.ucm.es Departamento Sistemas Informaticos y Computacion Facultad de Informatica C/ Profesor Jose Garcia Santesmases s/n Universidad Complutense de Madrid, 28040 MADRID Ph: (+ 34) 91 394 7627 FAX: (+ 34) 91 394 7529 http://dalila.sip.ucm.es/~ricardo From ccshan at cs.rutgers.edu Tue Feb 8 15:33:22 2011 From: ccshan at cs.rutgers.edu (Chung-chieh Shan) Date: Tue, 8 Feb 2011 15:33:22 -0500 Subject: [TYPES/announce] ACM SIGPLAN Workshop on ML Message-ID: <20110208203322.GA9721@mantle.bostoncoop.net> ACM SIGPLAN Workshop on ML Sunday, 18 September 2011, Tokyo, Japan (co-located with ICFP) http://conway.rutgers.edu/ml2011/ CALL FOR CONTENT The ML family of programming languages includes dialects known as Standard ML, Objective Caml, and F#. These languages have inspired a large amount of computer-science research, both practical and theoretical. This workshop aims to provide a forum for discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of ML 2011 will continue the return in 2010 to a more informal model: a workshop with presentations selected from submitted abstracts. Presenters will be invited to submit working notes, source code, and extended papers for distribution to the attendees, but 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. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. In the abstract submission, describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. (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. We plan to make videos of the presentations available on ACM Digital Library. SUBMISSION INSTRUCTIONS Email submissions to ccshan AT cs.rutgers.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a one-paragraph synopsis suitable for inclusion in the workshop program. IMPORTANT DATES * 2011-06-17: Submission * 2011-07-22: Notification * 2011-09-18: Workshop PROGRAM COMMITTEE Amal Ahmed (Indiana University) Andrew Tolmach (Portland State University) Anil Madhavapeddy (University of Cambridge) Chung-chieh Shan (chair) (Rutgers University) Joshua Dunfield (Max Planck Institute for Software Systems) Julia Lawall (University of Copenhagen) Keisuke Nakano (University of Electro-Communications) Martin Elsman (SimCorp) Walid Taha (Halmstad University) STEERING COMMITTEE Eijiro Sumii (chair) (Tohoku University) Andreas Rossberg (Google) Jacques Garrigue (Nagoya University) Matthew Fluet (Rochester Institute of Technology) Robert Harper (Carnegie Mellon University) Yaron Minsky (Jane Street) From heinz.koeppl at epfl.ch Tue Feb 8 16:08:39 2011 From: heinz.koeppl at epfl.ch (Koeppl Heinz) Date: Tue, 8 Feb 2011 21:08:39 +0000 Subject: [TYPES/announce] CfP - International Workshop on Computational Systems Biology (WCSB2011) - June 6-8, ETH Zurich Message-ID: <37645A631A36234CB315AA45F673514737E85A83@REXM1.intranet.epfl.ch> Dear colleague, [Apologies for multiple copies] I would like to draw your attention to the upcoming workshop: ************************************************************** International Workshop on Computational Systems Biology (WCSB) June 6-8, 2011 ETH Zurich, Switzerland http://www.wcsb2011.ethz.ch ************************************************************** SCOPE: WCSB aims at bringing together the different communities involved in computational systems biology research, e.g. experimental biology, machine learning, signal processing, mathematics, statistics, and theoretical physics. The scientific program includes invited plenary talks as well as regular sessions with contributed research talks and posters. Following the four successful events hosted by Tampere University of Technology (Finland), and the events hosted by the University of Leipzig (Germany), Aarhus University (Denmark), and University of Luxembourg, the eighth event will be organized at ETH Z?rich (Switzerland), from 6 to 8 June 2011. PAPER SUBMISSION: The prospective authors are invited to submit full papers or abstracts. Full paper submissions: The authors are asked to submit a title and abstract (max. 2500 characters) first. Based on the abstract, the scientific committee decides which authors will be invited to submit a full paper to be included in the proceedings. The papers should be maximum four pages, including results, figures, tables, and references. Minor corrections will be suggested upon reviewing the full papers. Abstract-only submissions: The authors can choose to submit only the title and abstract, which will also be included in the proceedings. IMPORTANT DATES: Submission deadline for paper-abstract: February 15, 2011 Notification of acceptance: February 28, 2011 Submission deadline for full paper: March 31, 2011 Deadline for abstract-only submissions: March 31, 2011 Review comments: April 15, 2011 Submission deadline for camera-ready paper: April 30, 2011 TICSP Copyright Form: April 30, 2011 Early bird registration deadline: April 30, 2011 CONFIRMED INVITED SPEAKERS: Ruedi Aebersold, ETH Zurich, Switzerland Michael Stumpf, Imperial College London, UK Vincent Danos, University of Edinburgh, UK Magnus Rattray, University of Sheffield, UK Steffen Klamt, MPI Magdeburg, Germany Andre Ribeiro, Tampere University of Technology, FL Ilya Shmulevich, Institute for Systems Biology, USA SCIENTIFIC COMMITTEE: Jugoslava Acimovic (Tampere University of Technology) Miika Ahdesm?ki (Almac Diagnostics) Carsten Carlberg (University of Luxembourg) David Galas (Institute for Systems Biology) Peter Grass (Novartis Institute for BioMedical Research, Basel) Marco Grzegorczyk (Technische Universit?t Dortmund) Olli Yli-Harja(Tampere University of Technology, workshop co-chair) Antti Honkela (Aalto University) Juha Kesseli (Tampere University of Technology) Heinz Koeppl (ETH Z?rich, workshop co-chair) Harri L?hdesm?ki (Aalto University) Marja-Leena Linne (Tampere University of Technology) James Lu (ETH Z?rich) Matti Nykter (Tampere University of Technology) Serge Pelet (ETH Z?rich) Andre S. Ribeiro (Tampere University of Technology) Ilya Shmulevich (Institute for Systems Biology) Korbinian Strimmer (University of Leipzig) Ioan Tabus (Tampere University of Technology) Carsten Wiuf (Aarhus University) ORGANIZING COMMITTEE: Heinz Koeppl (ETH Z?rich) James Lu (ETH Z?rich) Serge Pelet (ETH Z?rich) Peter Grass (Novartis Institute for BioMedical Research, Basel) Jugoslava Acimovic (Tampere University of Technology) Juha Kesseli (Tampere University of Technology) Pirkko Ruotsalainen (Tampere University of Technology) SPONSORS: ETH Zurich, Tampere University of Technology, SystemsX.ch, Novartis, BASF, Roche, Syngenta, MerckSerono, Actelion. WORKSHOP EMAIL ADDRESS: wcsb2011 at ethz.ch On behalf of the WCSB 2011 organizing committee, Heinz Koeppl -- Dr. Heinz Koeppl - Assistant Professor BISON - Biomolecular Signaling & Control Group Automatic Control Lab, ETH Zurich P: +41 44 632 7288, Email: koeppl at ethz.ch -------------- next part -------------- An HTML attachment was scrubbed... URL: From xinyu.feng at gmail.com Thu Feb 10 04:22:11 2011 From: xinyu.feng at gmail.com (Xinyu Feng) Date: Thu, 10 Feb 2011 17:22:11 +0800 Subject: [TYPES/announce] faculty and post-doc positions at USTC-Yale Joint Research Center on High-Confidence Software Message-ID: <4D53AE43.8080100@gmail.com> *Faculty Positions at USTC-Yale Joint Research Center on High Confidence Software* The USTC-Yale Joint Research Center on High-Confidence Software invites applicants for tenure-track faculty positions at all levels, with background in programming languages and compilers, formal methods, security, operating systems, computer architectures, and embedded systems. Established in 2008, the USTC-Yale Joint Research Center for High-Confidence Software combines the expertise of faculty members from University of Science and Technology of China (USTC) and Yale University with the facilities and human resources of USTC. The long-term goal of the Center is to support a multidisciplinary research program in high-confidence software in which independent research groups will work within a common facility, sharing resources and expertise. USTC and Yale will work together through the Center to facilitate direct collaborations between research groups based at each university. They will also enable the periodic exchange of students and researchers between research groups at the two institutions through the Center. The Joint Research Center will pursue research in all areas of high-confidence software and formal methods. Its current research topics include formal verification of system software, certifying compilers, concurrent and multi-core software, and automatic theorem proving systems, etc. The Center is interested in exploring new software development methods that combine formal program verification techniques with domain-specific languages and logics. The Center also intends to construct a practical infrastructure for building large-scale certified system software that can be promoted in the industry. Successful research in high-confidence software requires a deep knowledge and shared expertise of a large number of sub-disciplines in computer science, ranging from formal methods, programming languages, compilers, operating systems, computer security, proof assistants, software engineering, computer architecture, to embedded systems. All applicants must have a Ph.D. in computer science or a related field and are expected to show evidence of an ability to establish a strong, independent, and internationally recognized research program. The new faculty member will be affiliated with USTC (University of Science and Technology of China), and the USTC Suzhou Institute for Advanced Study. The center also seeks dedicated post-doctoral research fellows and Ph.D. students working on the above areas. Applicants should send their CV, teaching and research statements, and contact information of at least three references to >. More information about the center can be found at . -------------- next part -------------- An HTML attachment was scrubbed... URL: From leucker at in.tum.de Thu Feb 10 06:01:49 2011 From: leucker at in.tum.de (Martin Leucker) Date: Thu, 10 Feb 2011 12:01:49 +0100 Subject: [TYPES/announce] CfP: Time'11 Message-ID: <20110210110149.GA22881@sunsvr01.isp.uni-luebeck.de> TIME 2011 Call for Papers Eighteenth International Symposium on Temporal Representation and Reasoning Luebeck, Germany, September 12-14, 2011 http://www.isp.uni-luebeck.de/time11/ 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. This year, TIME will feature a special track on interval temporal logics. The conference will span three days, and will be organized as a combination of technical paper presentations, keynote lectures, and tutorials. * IMPORTANT DATES Abstract Submission: April 13 Paper Submission: April 17 Paper Notification: May 15 Camera Ready Copy Due: May 29 TIME 2011 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 Interval Temporal logics 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 - tools and practical systems - temporal issues in security Special track on Interval Temporal logic This year, TIME has an additional special track on Interval Temporal Logics. This track is organized by Dimitar Guelev and Ben Moszkowski. Submissions on ITL will be primarily managed by them, though the final decision on acceptance will be taken by the whole PC. Topics of interest include, but are not limited to: - expressiveness, decidability, proof systems, model- and validity-checking for ITLs - modelling of system requirements in terms of time intervals - intervals versus time points in temporal modelling - Duration Calculus and other extensions and variants of ITLs - ITLs, DC, timed automata, timed regular languages and other models of real time - interval algebras and spatio-temporal reasoning - case studies, applications and tool support for interval-based reasoning * 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 will be published by the IEEE Computer Society Press. 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=time11 * CONFERENCE OFFICERS General Chair: Carlo Combi, University of Verona, Italy Program Committee Chairs: Martin Leucker, University of Luebeck, Germany Frank Wolter, University of Liverpool, United Kingdom Organization Chair: Martin Leucker, Universitaet Luebeck, Germany * PROGRAM COMMITTEE includes Alessandro Artale, University of Bolzano, Italy Philippe Balbiani, IRIT Toulouse, France Claudio Bettini, University of Milan, Italy Benedikt Bollig, CNRS, France Lubos Brim, University of Brno, Czech Republic Dang Van Hung, Vietnam National University, Vietnam Clare Dixon, University of Liverpool, UK Rajeev Gore, ANU, Australia Dimitar Guelev, Bulgarian Academy of Sciences, Bulgaria Peter Habermehl, CNRS, France Ian Hodkinson, Imperial College London, UK Roman Kontchakov, Birkeck College London, UK Salvatore La Torre, University of Salerno, Italy Ranko Lazic, University of Warwick, UK Kamal Lodaya, IMSc, India Nicolas Markey, CNRS, France Angelo Montanari, University of Udine, Italy Ben Moszkowski, De Montfort University, UK Dirk Nowotka, University of Stuttgart, Germany Jean-Francois Raskin, Free University Brussels, Belgium Peter Revesz, University of Nebraska-Lincoln, USA Mark Reynolds, University of Western Australia, Australia Martin Sachenbacher, Technical University Munich, Germany Cesar Sanchez, University of Madrid, Spain Christian Schallhart, University of Oxford, UK Stefan Woelfl, University of Freiburg, Germany Naijun Zhan, Chinese Academy of Sciences Beijing, China Esteban Zimanyi, ULB, Belgium * FURTHER INFORMATION Questions related to submission, reviewing, and program: time11 at isp.uni-luebeck.de Questions related to local organization: time11-org at isp.uni-luebeck.de From james.cheney at gmail.com Thu Feb 10 09:02:14 2011 From: james.cheney at gmail.com (James Cheney) Date: Thu, 10 Feb 2011 14:02:14 +0000 Subject: [TYPES/announce] CFP: Workshop on Theory and Practice of Provenance (TAPP 2011) Message-ID: [Note: Provenance is a broad topic that touches on many areas of interest to readers of the TYPES list, including language-based security, dependency analysis and incremental or bidirectional computation. --James] ---------------------------------------------------------------------------------------------------- TaPP '11 Call for Papers ---------------------------------------------------------------------------------------------------- 3rd USENIX Workshop on the Theory and Practice of Provenance (TaPP '11) http://www.usenix.org/events/tapp11/ June 20-22, 2011 Heraklion, Crete, Greece Sponsored by USENIX ** Overview With the deluge of digital data we are currently experiencing, it has become increasingly important to capture and understand the provenance of data. Provenance provides important documentation that is an essential part of the quality of data, and it is essential to the trust we put in, for example, the data we find on the Web and the data that is derived from scientific experiments. The meeting is in Crete, the week after the Athens meeting of ACM SIGMOD (http://www.sigmod2011.org/index.shtml). Crete is a spectacular island with great beaches, scenery, and food. ** Topics and What to Submit Submissions are solicited on any topic related to theoretical or practical aspects of provenance, including but not limited to: provenance in databases, workflows, programming languages, security, software engineering, or systems; provenance on the Web; or real-world applications of or requirements for provenance. The program committee very much wants to make this a workshop rather than a mini-conference. Therefore, in addition to papers describing original research, the committee welcomes any proposal that will make the workshop interactive and promote discussions, especially discussions across disciplines. ** The following are possible submissions: * Short papers and vision papers describing challenges for provenance research and novel applications (4 pages maximum) * Proposals for mini-tutorials on some aspect of provenance (4 pages maximum) * Regular submissions describing original research (8 pages maximum) * Other proposals (e.g., for panels or small discussion groups) Besides regular presentations, we plan to hold a poster session where authors of accepted submissions will have the opportunity to discuss their work with the other workshop participants. * Important Dates * Submissions due: April 8, 2011, 11:59 p.m. PDT * Notification to authors: May 9, 2011 * Final paper files due: May 23, 2011 ** How to Submit Submissions will be received electronically via a Web form, which will be available here soon. The Web form will ask for contact information for the paper and will allow for the submission of your full paper file in PDF format. Please do not email submissions. Papers should be formatted in two columns, using 10 point Times Roman type on 12 point leading, in a text block of 6.5" by 9". If you wish, you may use the LaTeX template found at http://www.usenix.org/events/samples/template.la and style file found at http://www.usenix.org/events/samples/usenix.sty or the RTF template found at http://www.usenix.org/events/samples/sample.rtf Simultaneous submission of the same work to multiple venues, submission of previously published work, or plagiarism constitutes dishonesty or fraud. USENIX, like other scientific and technical conferences and journals, prohibits these practices and may take action against authors who have committed them. See the USENIX Conference Submissions Policy at http://www.usenix.org/events/submissionspolicy.html for details. * Workshop Organizers ** Program Co-Chairs Peter Buneman, University of Edinburgh Juliana Freire, University of Utah ** Program Committee Umut Acar, Max Planck Institute for Software Systems Susan Davidson, University of Pennsylvania Irini Fundulaki, FORTH Dieter Gawlick, Oracle HV Jagadish, University of Michigan Grigoris Karvounarakis, LogicBlox and FORTH Anastasios Kementsietsidis, IBM Marta Mattoso, Universidade Federal do Rio de Janeiro, Brazil Paolo Missier, University of Newcastle Helen Parkinson, European Bioinformatics Institute Margo Seltzer, Harvard University Matthias Troyer, ETH Zurich Dan Suciu, University of Washington Jan Van den Bussche, Hasselt University Marianne Winslett, University of Illinois ** Local Workshop Chair Irini Fundulaki, FORTH ** Workshop Organization and Proceedings Coordinator Grigoris Karvounarakis, LogicBlox and FORTH ** Steering Committee James Cheney, University of Edinburgh Bertram Ludaescher, University of California, Davis Margo Seltzer, Harvard University Craig Soules, HP Labs Wang-Chiew Tan, University of California, Santa Cruz Val Tannen, University of Pennsylvania ** Questions? Contact your program co-chairs, at tapp11chairs at usenix.org, or the USENIX office, at submissionspolicy at usenix.org. Papers accompanied by nondisclosure agreement forms will not be considered. Accepted submissions will be treated as confidential prior to publication on the USENIX TaPP '11 Web site; rejected submissions will be permanently treated as confidential. All accepted papers will be available online to registered attendees before the workshop. If your paper should not be published prior to the event, please notify production at usenix.org. The papers will be available online to everyone beginning on the day of the first day of the workshop, June 20, 2011. From Gethin.Norman at glasgow.ac.uk Fri Feb 11 10:05:50 2011 From: Gethin.Norman at glasgow.ac.uk (Gethin Norman) Date: Fri, 11 Feb 2011 15:05:50 +0000 Subject: [TYPES/announce] QAPL 2011 Call For Participation Message-ID: [Apologies for multiple copies] ******************************************************************************* CALL FOR PARTICIPATION Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL2011) Affiliated with ETAPS 2011 April 1-3, 2011, Saarbruecken, Germany http://www.dcs.gla.ac.uk/qapl11/ ******************************************************************************* PROGRAMME: The programme for the workshop is available from: http://www.dcs.gla.ac.uk/qapl11/qapl11_programme.html REGISTRATION Registration is through the ETAPS registration page: http://www.etaps.org/registration Details on the venue, local information and accommodation are also available through the ETAPS site: http://www.etaps.org INVITED SPEAKERS: * Prakash Panangaden, McGill University, Canada Equivalences for Partially Observable Markov Decision Processes * Erik de Vink, Technische Universiteit Eindhoven, the Netherlands Decorating and Model Checking Stochastic Reo Connectors 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 * Gethin Norman, University of Glasgow, UK Program Committee: * Alessandro Aldini, University of Urbino, Italy * Christel Baier, University of Dresden, Germany * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, IRISA/INRIA Rennes, France * Patricia Bouyer, Oxford University, UK * Jeremy Bradley, Imperial College London, UK * Tomas Brazdil, Masaryk University, Czech Republic * Frank van Breugel, York University, Canada * Antonio Cerone, UNU-IIST, Macao * Kostas Chatzikokolakis, University of Eindohoven, NL * Josee Desharnais, University of Laval, Canada * Alessandra Di Pierro, University of Verona, Italy * Mieke Massink, CNR-ISTI, Pisa, Italy * Paulo Mateus, Technical University of Lisbon, Portugal * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Oxford, UK * Anne Remke, University of Twente, the Netherlands * Jeremy Sproston, University of Torino, Italy * Herbert Wiklicky, Imperial College London, UK * Verena Wolf, Saarland University, Germany The University of Glasgow, charity number SC004401 From vv at di.fc.ul.pt Fri Feb 11 18:19:50 2011 From: vv at di.fc.ul.pt (Vasco T. Vasconcelos) Date: Fri, 11 Feb 2011 23:19:50 +0000 Subject: [TYPES/announce] PLACES 2011 Call For Participation Message-ID: CALL FOR PARTICIPATION PLACES'11 Programming Language Approaches to Concurrency and communication-cEntric Software 2nd April 2011, Saarbr?cken, Germany Affiliated with ETAPS 2011 http://places11.di.fc.ul.pt/ PROGRAMME The programme for the workshop is available from: http://places11.di.fc.ul.pt/programme REGISTRATION Registration is through the ETAPS registration page: http://www.etaps.org/registration Details on the venue, local information and accommodation are also available through the ETAPS site: http://www.etaps.org INVITED SPEAKER Charting the course to a many core future: HW, SW and the parallel programming problem. Timothy G Mattson, Intel Corporation THEME AND GOALS Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Much normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of fithe central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. Topics of Interest Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: language design and implementations for communications and/or concurrency, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. PROGRAM COMMITTEE Marco Carbone, IT University of Copenhagen Swarat Chaudhuri, Pennsylvania State University Alastair Donaldson, Oxford University Tim Harris, Microsoft Research Cambridge Alan Mycroft, University of Cambridge Jens Palsberg, University of California, Los Angeles Vijay A. Saraswat, IBM Research Vivek Sarkar, Rice University (co-chair) Vasco T. Vasconcelos, University of Lisbon (co chair) Jan Vitek, Purdue University Nobuko Yoshida, Imperial College London From coglio at kestrel.edu Fri Feb 11 21:23:40 2011 From: coglio at kestrel.edu (Alessandro Coglio) Date: Fri, 11 Feb 2011 18:23:40 -0800 Subject: [TYPES/announce] Job Opportunities at Kestrel Institute Message-ID: <4D55EF2C.2@kestrel.edu> Researcher in Applied Software Synthesis ---------------------------------------- Are you interested in developing tools and techniques for the automated synthesis of provably correct software from formal specifications? Kestrel Institute has openings for researchers with strong implementation skills, driven to advance the state of the art and practice of software synthesis and to apply it to real-world problems. Research topics include: high-level modeling, rigorous specification, program refinement, program transformation, theorem proving, verification, security guarantees. Candidates must be willing and able to learn new application domains and to apply program synthesis technology to them. Past and current application domains include: smart cards, security and communication protocols, scheduling, memory management, Java analysis, synthetic diversity, embedded controllers, and sensor networks. Candidates must have a strong mathematics and computer science background, at the Master?s or PhD level or equivalent experience. U.S. citizenship is a plus. Kestrel Institute is a non-profit research center. Our website, www.kestrel.edu, describes our research. We offer competitive salaries and excellent benefits. Resumes may be submitted by email, fax or mail to: Careers Reference: Computer Scientist Position Kestrel Institute 3260 Hillview Ave. Palo Alto, CA 94304 Fax: 650-424-1807 Email: careers at kestrel.edu Please no phone calls. From pieter.hartel at utwente.nl Sat Feb 12 04:30:53 2011 From: pieter.hartel at utwente.nl (pieter.hartel at utwente.nl) Date: Sat, 12 Feb 2011 10:30:53 +0100 Subject: [TYPES/announce] Simple algebraic data types for C -- paper and tool Message-ID: Adt is a simple tool in the spirit of Lex and Yacc that makes monomorphic algebraic data types, polymorphic built-in types like the list and an efficient form of pattern matching available in C programs. The paper has been pre-ublished online at http://onlinelibrary.wiley.com/doi/10.1002/spe.1058/ The tool is available from http://eprints.eemcs.utwente.nl/17771/ --pieter hartel & henk muller From pangjun at gmail.com Mon Feb 14 05:42:05 2011 From: pangjun at gmail.com (Jun PANG) Date: Mon, 14 Feb 2011 11:42:05 +0100 Subject: [TYPES/announce] ICTAC 2011: First Call for Papers Message-ID: First Call for Papers ICTAC 2011 International Colloquium on Theoretical Aspects of Computing URL: http://www.ictac.net/ictac2011/ 31 August - 2 September 2011, Johannesburg, South Africa BACKGROUND ICTAC 2011 is the 8th 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 2011 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; * software specification, refinement, verification and testing; * model checking and theorem proving; * formal techniques in software testing; * models of object and component systems; * coordination and feature interaction; * integration of theories, formal methods and tools for engineering computing systems; * service-oriented development; * service-oriented architectures: models and development methods; * document-driven development; * models of concurrency, security, and mobility; * theory of parallel, distributed, and grid computing; * real-time, embedded and hybrid systems; * type and category theory in computer science; * models for learning and education; * cognitive architectures; * qualitative reasoning; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. KEYNOTE SPEAKERS * Jayadev Misra * David Parnas * Willem Visser PUBLICATION AND SUBMISSION The proceedings of ICTAC 2011 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be avaialble at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2011 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. Papers should be written in English and not exceed 15 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=ictac2011. All queries should be sent to: ictac2011 at iist.unu.edu IMPORTANT DATES: Paper abstract submission deadline: 15 March 2011 Paper submission deadline: 22 March 2011 Paper Accept/Reject Notification: 15 May 2011 Final paper submission 31 May 2011 PROGRAM COMMITTEE * Bernhard K. Aichernig, Austria * Junia Anacleto, Brazil * Jonathan P. Bowen, UK * Christiano Braga, Brazil * Vasco Brattka, South Africa * Andrew Butterfield, Ireland * Ana Cavalcanti, UK * Antonio Cerone, Macau SAR China (co-chair) * Dang Van Hung, Vietnam * Jim Davies, UK * David Deharbe, Brazil * Wan Fokkink, Netherlands * Pascal Fontaine, France * Marcelo Frias, Argentina * Lindsay Groves, New Zealand * Stefan Gruner, South Africa * Michael R. Hansen, Denmark * Rob Hierons, UK * Lynne Hunt, Australia * Moonzoo Kim, Korea * Coenraad Labuschagne, South Africa * Martin Leucker, Germany * Liu Zhiming, Macau SAR China * Patricia Machado, Brazil * Mieke Massink, Italy * Ali Mili, USA * Marius Minea, Romania * Tobias Nipkow, Germany * Ogawa Mizuhito, Japan * Odejobi Odetunji, Nigeria * Jose Oliveira, Portugal * Ekow Otoo, South Africa * Pekka Pihlajasaari, South Africa (co-chair) * Anders Ravn, Denmark * Francesca Pozzi, Italy * Markus Roggenbach, UK * Augusto Sampaio, Brazil * Bernhard Sch?tz, Germany * Gerardo Schneider, Sweden * Natarajan Shankar, USA * Marjan Sirjani, Iceland * Fausto Spoto, Italy * Clint van Alten, South Africa * Franck van Breugel, Canada * Govert van Drimmelen, South Africa * Daniel Varro, Hungary * Herbert Wiklicky, UK ORGANISING COMMITTEE * Antonio Cerone, Macau SAR China * Coenraad Labuschagne, South Africa * Pekka Pihlajasaari, South Africa * David Sherwell, South Africa * Clint van Alten, South Africa STEERING COMMITTEE * John Fitzgerald, UK * Martin Leucker, Germany * Liu Zhiming, Macau SAR China * Tobias Nipkow, Germany * Augusto Sampaio, Brazil * Natarajan Shankar, USA * Jim Woodcock, UK From tiezzi at dsi.unifi.it Mon Feb 14 11:09:00 2011 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Mon, 14 Feb 2011 17:09:00 +0100 Subject: [TYPES/announce] 1st Call for Papers: WWV 2011 Message-ID: [Apologies for multiple copies] ******************************************************** First Call for Papers WWV 2011 Automated Specification and Verification of Web Systems 7th International Workshop (as part of DisCoTec'11) http://rap.dsi.unifi.it/wwv2011/ June 9, 2011 - Reykjavik, Iceland ******************************************************** IMPORTANT DATES Abstract Submission March 28, 2011 Full Paper Submission April 4, 2011 Acceptance Notification May 3, 2011 Camera Ready (pre-proceedings) May 30, 2011 Workshop June 9, 2011 Camera Ready (post-proceedings) July 4, 2011 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 Elie Najm Telecom ParisTech, France 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=wwv2011 Submission is a firm commitment that at least one of the authors will attend the conference, 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 Laura Kovacs Vienna University of Technology, Austria Rosario Pugliese University of Florence, Italy Francesco Tiezzi University of Florence, Italy PROGRAM COMMITTEE Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Santiago Escobar Technical University of Valencia, Spain Jean-Marie Jacquet University of Namur, Belgium Laura Kovacs Vienna University of Technology, Austria Temur Kutsia Johannes Kepler University Linz, Austria Tiziana Margaria Univ. Potsdam, Germany Manuel Mazzara University of Newcastle, United Kingdom Catherine Meadows NRL, United States Yasuhiko Minamide University of Tsukuba, Japan Rosario Pugliese University of Florence, Italy I.V. Ramakrishnan SUNY Stony Brook, United States Maurice ter Beek ISTI-CNR, Pisa, Italy Francesco Tiezzi University of Florence, Italy Franz Weitl National Institute of Informatics, Tokyo, Japan Nobuko Yoshida Imperial College London, United Kingdom CONTACT wwv2011 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From sandra at dcc.fc.up.pt Tue Feb 15 06:02:14 2011 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Tue, 15 Feb 2011 11:02:14 +0000 Subject: [TYPES/announce] RDP-IFCoLog Student Session Message-ID: <1297767734.32661.81.camel@st157.dcs.kcl.ac.uk> [Apologies for multiple copies] =================================================================== Call for Papers First IFCoLog-RDP Student Session http://www.ifcolog.net/?page_id=6149 Novi Sad, Serbia 29 May 2011 An associated event of RDP 2011, Sixth Federated Conference on Rewriting, Deduction, and Programming =================================================================== Important Dates --------------- * 20 March 2011: Submission deadline * 10 April 2011: Author notification * 29 May 2011: Student Session The contributions and program will be available online before the event. Scope ----- The IFCoLog-RDP student session is a new initiative to encourage undergraduate and master students to present their research projects at high profile computer science events, and offer a good opportunity to undergraduate and master students to interact with more senior researchers. Topics ------ The IFCoLog-RDP student session will consider papers on Rewriting, Deduction, and Programming, broadly construed. But welcomes submissions on the topics of the two main RDP conferences, RTA and TCLA, with which the student session is connected. See http://www.rdp2011.uns.ac.rs/ for further details. 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/account/signin.cgi?conf=ifcologrdpss2011 Programme Committee ------------------- to be announced Contact ------- Sandra Alves: sandra at dcc.fc.up.pt Michael Gabbay: michael.gabbay at kcl.ac.uk ______________________________________________________________________ This email has been scanned by the MessageLabs Email Security System. For more information please visit http://www.messagelabs.com/email ______________________________________________________________________ From gvidal at dsic.upv.es Tue Feb 15 11:27:24 2011 From: gvidal at dsic.upv.es (German Vidal) Date: Tue, 15 Feb 2011 17:27:24 +0100 Subject: [TYPES/announce] LOPSTR 2011 - second call for papers Message-ID: ============================================================ Call for papers 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011) ============================================================ Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 21st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2011) will be held in Odense, Denmark; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2011 will be co-located with PPDP 2011 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming- in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: - specification - synthesis - verification - transformation - analysis - optimisation - specialization - partial evaluation - inversion - composition - program/model manipulation - certification - security - transformational techniques in SE - applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, the formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. IMPORTANT DATES AND SUBMISSION GUIDELINES: - Paper submission: March 27, 2011 - Extended abstract submission: April 3, 2011 - Notification (for pre-proceedings): May 16, 2011 - Camera-ready (for pre-proceedings): June 12, 2011 - Symposium: July 18-20, 2011 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Lecture Notes in Computer Science style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2011 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings to be published by Springer in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2011 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal proceedings. Program Committee: Elvira Albert (Complutense University of Madrid, Spain) Malgorzata Biernacka (University of Wroclaw , Poland) Manuel Carro (Technical University of Madrid, Spain) Michael Codish (Ben-Gurion University of the Negev, Israel) Danny De Schreye (K.U.Leuven, Belgium) Maribel Fernandez (King's College London, UK) Raul Gutierrez (University of Illinois at Urbana-Champaign, USA) Mark Harman (University College London, UK) Frank Huch (C.A.U. Kiel, Germany) Michael Leuschel (University of Dusseldorf, Germany) Yanhong Annie Liu (State University of New York at Stony Brook, USA) Kazutaka Matsuda (Tohoku University, Japan) Fred Mesnard (Universite de La Reunion, France) Ulrich Neumerkel (Technical University of Wien, Austria) Alberto Pettorossi (Universita' di Roma Tor Vergata, Italy) Carla Piazza (University of Udine, Italy) Peter Schneider-Kamp (University of Southern Denmark, Denmark) Hirohisa Seki (Nagoya Institute of Technology, Japan) Josep Silva (Technical University of Valencia, Spain) German Vidal (Technical University of Valencia, Spain) Jurgen Vinju (Centrum Wiskunde & Informatica, The Netherlands) Jianjun Zhao (Shanghai Jiao Tong University, Shanghai) Contacts Program Chair (contact him for additional information about papers and submissions): German Vidal Department of Computer Science (DSIC) Universitat Politecnica de Valencia Valencia, Spain Email: lopstr11 at dsic.upv.es General Chair Peter Schneider-Kamp Dept. of Mathematics and Computer Science University of Southern Denmark Campusvej 55 DK-5230 Odense M, Denmark Email: petersk at imada.sdu.dk From zhaohui at cs.rhul.ac.uk Wed Feb 16 05:27:05 2011 From: zhaohui at cs.rhul.ac.uk (zhaohui at cs.rhul.ac.uk) Date: Wed, 16 Feb 2011 10:27:05 -0000 Subject: [TYPES/announce] research post Message-ID: Department of Computer Science Royal Holloway, University of London Research Assistant Applications are invited for a research assistant in the above department, funded by the Leverhulme Trust for the following interdisciplinary research project: Lexical Semantics in Type Theory with Coercive Subtyping (http://www.cs.rhul.ac.uk/home/zhaohui/lexsem.html) The post is full time, for a period of three years and available from June 2011, with the starting annual salary between 31,987 pounds and 33,805 pounds (inclusive of London allowance). Candidates would normally be expected to have a PhD or equivalent experience in mathematics, computer science, or computational linguistics. Experience or background in some of the following areas is considered to be desirable, though not necessary: typed lambda calculi, computational linguistics, functional programming, and theorem proving. Applications should be made before 12 noon, March 14, 2011 and should include a curriculum vitae and the names of two or three referees with their addresses (and email addresses if available). Informal enquiries before formal applications are encouraged and can be addressed to Prof Zhaohui Luo at the email address zhaohui at cs.rhul.ac.uk. For further details on how to apply, please visit the following web page: http://www.rhul.ac.uk/jobs/jobvacancies/6223resarchfellowcomputerscience.aspx or contact the Recruitment Team by email: recruitment at rhul.ac.uk or tel: +44-(0)1784-414241. From tarmo at cs.ioc.ee Wed Feb 16 11:11:50 2011 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Wed, 16 Feb 2011 18:11:50 +0200 (EET) Subject: [TYPES/announce] ETAPS 2012 Call for Satellite Events Message-ID: *** CALL FOR SATELLITE EVENTS *** ETAPS 2012 European Joint Conferences on Theory and Practice of Software 24 March - 1 April 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 is an annual event which takes place in Europe each spring since 1998. The fifteenth conference, ETAPS 2012, will take place 24 March - 1 April 2012 in Tallinn, Estonia. Tallinn is the capital city of Estonia, famous for its picturesque medieval Old Town, a World Heritage site. This year 2011, Tallinn, together with Turku in Finland, is the European capital of culture. The main conferences of ETAPS are: - CC: International Conference on Compiler Construction - ESOP: European Symposium on Programming - FASE: Fundamental Approaches to Software Engineering - FOSSACS: Foundations of Software Science and Computation Structures - TACAS: Tools and Algorithms for the Construction and Analysis of Systems The ETAPS 2012 conferences will take place 26-30 March 2012. -- SATELLITE EVENTS -- The ETAPS 2012 organizing committee invites proposals for satellite events (workshops, tutorials, etc.) that will complement the main ETAPS 2012 conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. The ETAPS 2012 satellite events will be held immediately before and after the main conferences, 24-25 March and 31 March-1 April 2012. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize satellite events are invited to submit proposals in plain text or pdf format by e-mail to etaps12-wksh at cs.ioc.ee. A proposal should not exceed two pages and should include: - the satellite event name and acronym - the names and contact information of the organizers - the preferred period: 24-25 March or 31 March-1 April - the duration of the workshop: one-day or two-day event - a 120-word description of the event topic for later use in publicity material - a brief explanation of the event topic and its relevance to ETAPS - the history of the event, where applicable - a tentative schedule for paper submission, notification of acceptance and final versions, where applicable (the ETAPS 2012 organizing committee will need the final files of the event local proceedings by 12 February 2012) - the expected number of participants - plans for formal publication - any other relevant information, like event format, invited speakers, demo sessions, special space requirements, etc. The proposals will be evaluated by the ETAPS 2012 organizing committee on the basis of their assessed benefit for prospective participants of ETAPS 2012. The titles and brief information about accepted satellite events will be included in the ETAPS 2012 website, call for papers and call for participation. Satellite events organizers will be responsible for - producing the event's call for papers and call for participations - publicising the event through specialist mailing lists etc. to complement publicity for ETAPS as a whole - hosting and maintaining a web site for the event - reviewing and making acceptance decisions on submitted papers - producing the event proceedings, if any (the organizing committee obliges to print the local proceedings volume and to produce a CD/USB memory stick with the local proceedings of all satellite events) - scheduling of the event's activities in consultation with the organizing committee Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2011: http://www.etaps.org/2011/ ETAPS 2010: http://www.etaps10.cs.ucy.ac.cy/ ETAPS 2009: http://www.cs.york.ac.uk/etaps09/ ETAPS 2008: http://etaps08.mit.bme.hu/ ETAPS 2007: http://www.di.uminho.pt/etaps07/ ETAPS 2006: http://www.complang.tuwien.ac.at/etaps06/ ETAPS 2005: http://www.etaps05.inf.ed.ac.uk/ ETAPS 2004: http://www.lsi.upc.es/etaps04/ ETAPS 2003: http://www.mimuw.edu.pl/etaps03/ -- IMPORTANT DATES -- Satellite event proposals deadline: 6 March 2011. Notification of acceptance: 13 March 2011. -- FURTHER INFORMATION AND ENQUIRIES -- Please contact Keiko Nakata or Tarmo Uustalu, etaps12-wksh at cs.ioc.ee. From aslan at cs.cornell.edu Wed Feb 16 11:24:36 2011 From: aslan at cs.cornell.edu (Aslan Askarov) Date: Wed, 16 Feb 2011 11:24:36 -0500 Subject: [TYPES/announce] PLAS 2011: call for papers Message-ID: <6E109013-F67A-4FF3-BE43-CA11C054D330@cs.cornell.edu> *********************************************************************** Call for Papers Sixth ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2011) http://www.cs.cornell.edu/~aslan/plas2011 June 05, 2011 Co-located with PLDI 2011, San Jose, California *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ***************************** Submissions due: Tuesday, March 29, 2010 Author notification: Friday, April 29, 2010 PLAS 2010 workshop: Sunday, June 05, 2010 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 Aslan Askarov (Cornell University) (co-chair) Brendan Eich (Mozilla Corporation) Deepak Garg (Carnegie Mellon University) Joshua Guttman (Worcester Polytechnic Institute) (co-chair) Ranjit Jhala (University of California, San Diego) Sergio Maffeis (Imperial College London) Marco Pistoia (IBM TJ Watson Research Center) Nikhil Swamy (Microsoft Research) From mpj at cs.pdx.edu Wed Feb 16 14:43:54 2011 From: mpj at cs.pdx.edu (Mark P. Jones) Date: Wed, 16 Feb 2011 11:43:54 -0800 Subject: [TYPES/announce] Post-doc positions at Portland State University Message-ID: <33A3D54C-718B-4D8F-9777-32E39484EBC8@cs.pdx.edu> The High-Assurance Systems Programming (HASP) project at Portland State University in Portland, OR, USA, has openings for *two* post-doctoral researchers to help design, develop, and apply a new strongly typed, pure functional language for systems programming. The Habit language derives from Haskell, with the addition of features for efficient low-level programming. Its compiler and high-assurance runtime system (HARTS) extend the verified CompCert compiler. Possible demonstration projects include an L4-based microkernel, lightweight Xen guest domains, and high-assurance portable devices. It is anticipated that one post-doc will champion the certifying compiler and the other will champion the demonstration project. The HASP team currently consists of three faculty (James Hook, Mark Jones, and Andrew Tolmach) and seven PhD students. Please see http://hasp.cs.pdx.edu/postdoc.html for more details. From pierre.geneves at inria.fr Fri Feb 18 05:39:09 2011 From: pierre.geneves at inria.fr (Pierre Geneves) Date: Fri, 18 Feb 2011 11:39:09 +0100 Subject: [TYPES/announce] Associate Professor Position at LIG (Grenoble, France): Logic and Foundations of Programming Message-ID: <4D5E4C4D.9080208@inria.fr> ====================================================== Assistant professor (Maitre de Conferences) position Computer Science and Logic Grenoble INP - ENSIMAG LIG Laboratory Grenoble, France ====================================================== A Maitre de Conference permanent position (~ Assistant Professor) is being opened within the LIG Laboratory located in Grenoble (see: http://www.liglab.fr). We are looking for strong junior-level candidates who will be able to contribute to the ongoing effort made in the LIG laboratory to study the foundations of programming. You can find more general information on what is a 'Maitre de Conference', including an approximate salary scale, on a french page on Wikipedia: http://fr.wikipedia.org/wiki/Ma%C3%AEtre_de_conf%C3%A9rences_%28France%29 The researcher to be hired is expected to contribute to the current research activities of the LIG laboratory on challenges arising in program verification, logic, and foundations of programming languages. Research area and specific information for this position can be found at: http://www.liglab.fr/IMG/pdf/2011_Profil_poste_27mcf0670.pdf The candidate will be a member of one of the teams Capp (http://capp.imag.fr/) or Wam (http://wam.inrialpes.fr/), and must contact the team leader for elobrating a research program. Please notice that this position involves teaching in French, and proficiency in this language is necessary at the time the position is taken (September 2011). Important dates --------------- Date of formal publication of the position: Februrary 24th 2011 Deadline for sending the complete application: March 25th 2011 Expected date of the interview of candidates May 2011 Start of the position September 2011 Application procedure --------------------- The candidates will need to enter their application through the French nationwide portal Galaxie, starting from February 24th https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/candidats.html and are required to have previously obtained a 'qualification' (if you do not know what this is, we are afraid it will be too late to obtain one). Contacts -------- Interested candidates are invited to contact: - Herv? Martin , director of the LIG laboratory; - Brigitte Plateau and Roland Groz for teaching; - Vincent Quint or Rachid Echahed for the research program. ------------------------------------------------------------------ ________________________________________________ Pierre Geneves Researcher, CNRS From luigi.santocanale at lif.univ-mrs.fr Fri Feb 18 11:20:47 2011 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Fri, 18 Feb 2011 17:20:47 +0100 Subject: [TYPES/announce] TACL 2011, 2nd call for papers Message-ID: <4D5E9C5F.7090901@lif.univ-mrs.fr> [Apologies for multiple copies] =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) II call for papers =============================================================================== July 26-30, 2011 Universit?s Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Invited speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, Universit? degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. The program committee specially encourages submissions related to the work of Leo Esakia, and may select some of these submission for presentation at the special session. Submissions ----------- Contributed presentations will be of two types: * standard presentations of 20 minutes in parallel sessions, * featured, 30 minutes long, plenary presentations. The submission of an extended abstract in pdf format will be required to be selected for a contributed presentation of either kind. Concerning the standard presentations, while preference will be given to new work, results that have already been published or presented elsewhere will also be considered. Concerning the featured presentations: the program committee will choose a small number of submissions of which the authors will be invited to give a plenary presentation. The criteria for this selection will be: originality, significance and interest to the wider TACL community. There will be just one submission procedure, for contributed presentations of either kind: authors are requested to submit a short text of four pages, in English and in pdf format, through the easychair submission site: https://www.easychair.org/conferences/?conf=tacl2011 Important dates --------------- April 18, 2011: Abstract submission deadline May 20, 2011: Notification to authors July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Universit? degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Universit? Aix-Marseille II Tadeusz Litak, University of Leicester Paul-Andr? Melli?s, CNRS Paris Diderot George Metcalfe, Universit?t Bern Nicola Olivetti, Universit? Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Universit? Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Universit? de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011 at lif.univ-mrs.fr =============================================================================== From soner at mtu.edu Mon Feb 21 12:59:05 2011 From: soner at mtu.edu (Soner Onder) Date: Mon, 21 Feb 2011 12:59:05 -0500 Subject: [TYPES/announce] ASPLOS 2011 Call for Participation Message-ID: <4D62A7E9.2010001@mtu.edu> * * We apologize if you receive this announcement from multiple sources * * ***************************************************************************************************** Call for Participation : ASPLOS 2011 ( http://asplos11.cs.ucr.edu ) Sixteenth International Conference on Architectural Support for Programming Languages and Operating Systems Newport Beach, California, March 5-11, 2011 ***************************************************************************************************** ASPLOS is a multi-disciplinary conference for research that spans the boundaries of hardware, computer architecture, compilers, languages, operating systems, networking, and applications. ASPLOS provides a high quality forum for scientists and engineers to present their latest research findings in these rapidly changing fields. It has captured some of the major computer systems innovations of the past two decades (e.g., RISC and VLIW processors, small and large-scale multiprocessors, clusters and networks-of-workstations, optimizing compilers, RAID, and network-storage system designs). Conference web site is : http://asplos11.cs.ucr.edu Technical Program : http://asplos11.cs.ucr.edu/program.html Registration web site : http://asplos11.cs.ucr.edu/registration.html Hotel reservations : http://asplos11.cs.ucr.edu/hotel.html The conference program can be found at the address : http://asplos11.cs.ucr.edu/program.html ASPLOS is sponsored by ACM SIGPLAN, ACM SIGARCH and ACM SIGOPS and has also been generously supported by National Science Foundation, VMWare, Google, Intel, HP, Qualcomm Research Center, Oracle, AMD, Microsoft Research, and IBM. ----------------------------------------------------------------------------------------------------------------------------- Posted by: Soner Onder ASPLOS 2011 Publicity chair. From jarvi at cs.tamu.edu Mon Feb 21 21:31:18 2011 From: jarvi at cs.tamu.edu (=?iso-8859-1?Q?Jaakko_J=E4rvi?=) Date: Mon, 21 Feb 2011 20:31:18 -0600 Subject: [TYPES/announce] CFP: WGP 2011 - Workshop on Generic Programming Message-ID: <1E5915D5-7803-42E1-921F-FD8B43BA0195@cs.tamu.edu> ====================================================================== CALL FOR PAPERS WGP 2011 7th ACM SIGPLAN Workshop on Generic Programming Tokyo, Japan Sunday, September 18th, 2011 http://flolac.iis.sinica.edu.tw/wgp11/ Collocated with the International Conference on Functional Programming (ICFP 2011) ====================================================================== 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, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Jaakko J?rvi, Texas A&M University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee ------------------- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway Akimasa Morihata, Tohoku University, Japan Pablo Nogueira, Universidad Polit??cnica de Madrid, Spain Ulf Norell, Chalmers University of Technology and University of Gothenberg, Sweden Ross Paterson, City University London, UK Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands Sibylle Schupp, Technische Universit??t Hamburg-Harburg, Germany Andrew Sutton, Kent State University, USA Tarmo Uustalu, Institute of Cybernetics, Estonia Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Monday 2011-06-06 Notification of acceptance: Tuesday 2011-07-01 Final submission due: Monday 2011-07-25 Workshop: Sunday 2011-09-18 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP11 EasyChair instance by the above deadline. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Tokyo, Japan 2011 (affiliated with ICFP11) Earlier Workshops on Generic Programming have been held in * 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). Additional information: The WGP steering committee consists of J. Gibbons, R. Hinze, P. Jansson, J. J?rvi, J. Jeuring, B. Oliveira, S. Schupp, and M. Zalewski From giannini at di.unipmn.it Tue Feb 22 11:58:07 2011 From: giannini at di.unipmn.it (Paola Giannini) Date: Tue, 22 Feb 2011 17:58:07 +0100 Subject: [TYPES/announce] CS2Bio 2011 - Call For Paper Message-ID: <4D63EB1F.8080602@di.unipmn.it> ================================================================ Second Call for papers CS2Bio'11 2nd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'11 9th of June 2011 Reykjavik, Iceland http://cs2bio11.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. In particular we want to encourage presentation of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present an attempt at modeling a specific biological phenomenon using formal techniques, or a technical innovation that can be applied to a range of potential biological systems. In the latter case, some emphasis on the scalability of the method will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Synthetic biology, circuits design (IGEM models) -- Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparisons between different formal models for the 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 Simulations: -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of Mathematical Structures in Computer Science is planned. *** INVITED SPEAKERS *** - Jasmin Fisher (Microsoft Research - Cambridge, UK) - Gordon Plotkin (Lab for Foundation of Computer Science - Edinburgh, UK) *** 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=cs2bio11). 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: 21 March 2011 - Notification to authors: 5 May 2011 - Workshop: 9 June 2011 *** PROGRAM COMMITTEE *** - Luca Cardelli - Francesca Cordero - Erik de Vink - Fran?ois Fages - J?r?me Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Jean-Louis Giavitto - Ion Petre - Gordon Plotkin - Angelo Troina - Verena Wolf - Gianluigi Zavattaro -- 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 hesam at cs.ucla.edu Tue Feb 22 15:45:32 2011 From: hesam at cs.ucla.edu (Hesam Samimi) Date: Tue, 22 Feb 2011 12:45:32 -0800 Subject: [TYPES/announce] Doctoral Symposium on Object-Oriented Programming - ECOOP (UK) Message-ID: <479CC5D1-8B42-4863-8902-E54D7D4A12B2@cs.ucla.edu> Hi PhD students in Programming Languages! This year's Doctoral Symposium at ECOOP occurs in Lancaster, UK. Please consider submitting your research work. The acceptance rate is really good. You get to have top notch guys in the field give you feedback on your work! You also may be able to get studentships from the conference to cover some of the travel costs. Academic panel this year is not yet set, but previous academic panels included names like James Noble, Gary Leavens, and Todd Millstein! ============================================================================== Call for Papers: DS-ECOOP 2011 25th European Conference on Object-Oriented Programming Doctoral Symposium and PhD Student Workshop http://ecoop11.comp.lancs.ac.uk/?q=calls/doctoral ============================================================================== ============================================================================== Important Dates ============================================================================== Paper submission due: 15 April, 2011 Acceptance notification: 20 May, 2011 Doctoral Symposium and PhD Workshop: 25 July, 2011 ============================================================================== Goal ============================================================================== ECOOP 2011 in Lancaster UK hosts the 21st edition of the Doctoral Symposium and PhD Student Workshop along-side the various workshops. As the name suggests, this is a two-session event: a Doctoral Symposium and a PhD Student Workshop. The Doctoral Symposium and PhD Student Workshop provides a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice. The main objectives of this event are: - to allow PhD students to practice writing clearly and to present effectively their research proposal - to get constructive feedback from other researchers - to build bridges for potential research collaboration - to contribute to the conference goals through interaction with other researchers at the main conference ============================================================================== Studentships ============================================================================== Participants of Doctoral Symposium and PhD Student Workshop are eligible to apply for studentships to receive financial support for travel costs. Further details regarding studentship applications is available at: http://ecoop11.comp.lancs.ac.uk/?q=content/studentships ============================================================================== Event Format ============================================================================== This is a full-day event of interactive presentations. Morning and early afternoon will be dedicated to the Doctoral Symposium, with late afternoon dedicated to the PhD Student Workshop. Besides the formal presentations, there will be plenty of opportunities for informal interactions during lunch and (possibly) dinner. It is planned that members of the academic panel will give short presentations on a variety of topics related to doing research. ============================================================================== Topics ============================================================================== Potential topics are those of the main conference (see http://ecoop11.comp.lancs.ac.uk), i.e. all topics related to object technology. The following list of suggested topics is by no means exclusive: - Analysis and design methods and patterns - Databases, persistence, transactions - Distributed, concurrent, mobile, real-time systems - Empirical and application studies - Frameworks, product lines, software architectures - Language design and implementation - Modularity, aspects, features, components, services, reflection - Software development environments and tools - Static and dynamic software analysis, testing, and metrics - Theoretical foundations, type systems, formal methods - Versioning, compatibility, software evolution ============================================================================== Doctoral Symposium ============================================================================== The goal of the doctoral symposium session is to provide PhD students with useful feedback towards the successful completion of their dissertation research. Each student is assigned an academic panel, based on the specifics of that student's research. The student will give a presentation of 15-20 minutes (exact time will be announced later), followed by 15-20 minutes of questions and feedback. The experience is meant to mimic a "mini-" defense interview. Aside from the actual feedback, this helps the student gain familiarity with the style and mechanics of such an interview (advisors of student presenters will not be allowed to attend their student's presentations). To participate, the students should be far enough in their research to be able to present: - the importance of the problem - a clear research proposal - some preliminary work/results - an evaluation plan The students should still have at least 12 months before defending their dissertation. We believe that students that are defending within a year would not be able to incorporate the feedback they receive. To participate, please submit: - a 3-4 page abstract in the llncs format - a letter from your advisor. This letter should include an assessment of the current status of your dissertation research and an expected date for dissertation submission. The advisor should e-mail this letter to ecoop11-ds at comp.lancs.ac.uk Abstracts should be submitted to: http://www.easychair.org/conferences/?conf=dsecoop11 The abstract should focus on the following: 1. Problem Description - what is the problem? - what is the significance of this problem? - why the current state of the art can not solve this problem? 2. Goal Statement - what is the goal of your research? - what artifacts (tools, theories, methods) will be produced, and how do they address the stated problem? How are the artifacts going to help reach the stated goal? 3. Method - what experiments, prototypes, or studies need to be produced/executed? - what is the validation strategy? How will it demonstrate that the goal was reached? Note that this is not a typical technical paper submission, and that the focus is not on technical details, but rather on research method. Each submission will be reviewed by at least three members of the committee. If accepted for presentation, the student's advisor must email the chair no later than 18 July, 2011 and confirm that the advisor attended at least one of the student's presentation rehearsals. ============================================================================== PhD Student Workshop ============================================================================== This session is addressed primarily to PhD students in the early stages of their PhD work. The goal is to allow participants to present their research ideas and obtain feedback from the rest of the workshop attendees. Each participant will give a 10-15 minute presentation, followed by 10-15 minutes of discussions (exact times will be announced later). To participate, please submit: - 6-10 page position paper in the llncs format, presenting your idea or current work - a support letter from your advisor. The advisor should e-mail this letter to ecoop11-ds at comp.lancs.ac.uk Position papers should be submitted to: http://www.easychair.org/conferences/?conf=dsecoop11 The position paper should contain (at least): - a problem description - a detailed sketch of a proposed approach - related work As this is earlier-stage research, it is not necessary to have concrete results from this research presented in the paper. Instead, the goal of the paper is to inform the reader of a (well-motivated) problem and to present a high level (possible) solution. If accepted for presentation, the student's advisor must email the chair no later than 18 July, 2011 and confirm that the advisor attended at least one of the student's presentation rehearsals. ============================================================================== Committee ============================================================================== - Moharram Challenger, Ege University, Izmir, Turkey - Andreas Mertgen, Technischen Universitat, Berlin, Germany - Stephen Nelson, Victoria University of Wellington, New Zealand - Hesam Samimi, University of California, Los Angeles, USA - Lucas Satabin, Technische Universitat, Darmstadt, Germany ============================================================================== Academic Panel ============================================================================== [Announced soon] ============================================================================== Previous Experiences ============================================================================== The ECOOP Doctoral Symposium is an excellent place to meet many interesting people and discuss new ideas related to your research topic. It has a friendly atmosphere which makes everybody welcomed and relaxed. By attending the PhD symposium last year, I had the opportunity to engage in new collaborations with researchers from different institutions. I also received feedback from both well-established researchers and fellow PhD students which had a great positive effect on my thesis. I would certainly recommend all PhD students to attend the ECOOP PhD Symposium and Workshop. - Eduardo Figueiredo, participant DS ECOOP'08 The ECOOP Doctoral Symposium was a remarkable event. It was an honor to get feedback on my personal thesis topic from such well-established researchers in the field. Their comments not only encouraged me to continue with my thesis work but also gave me valuable feedback on how to refine my concrete topic and bring the overall topic into shape. In addition, I found the other students' talks to be some of the most interesting ones at ECOOP. Some of them were very inspiring even for my own work. Overall, my participation in the symposium will certainly have a great positive effect on my thesis. Apart from that it was a fun day which made me meet many interesting people. - Eric Bodden, participant DS ECOOP'07 ============================================================================== More Information and Contact ============================================================================== For additional information about Doctoral Symposium, please visit the event page at: http://ecoop11.comp.lancs.ac.uk/?q=calls/doctoral and contact the ECOOP 2011 Doctoral Symposium Chairs at email address: ecoop11-ds at comp.lancs.ac.uk From mwh at cs.umd.edu Tue Feb 22 20:47:18 2011 From: mwh at cs.umd.edu (Michael Hicks) Date: Tue, 22 Feb 2011 20:47:18 -0500 Subject: [TYPES/announce] Call for participation: HotSWUp III Message-ID: <48D648C2-4195-4708-9099-E601B8243671@cs.umd.edu> [Types play a central role in many topics involved in software upgrades; e.g., types can be used to describe evolving database schemas or system data representations, and dependent types can characterize relationships between old an new versions. We have an interesting program and would welcome your participation! ---Mike] CALL FOR PARTICIPATION HotSWUp 2011: Third Workshop on Hot Topics in Software Upgrades Hannover, Germany April 16, 2011 http://www.hotswup.org/2011 co-located with ICDE 2011 Registration site: http://www.icde2011.org/node/73 OBJECTIVES Actively-used software systems are upgraded regularly to incorporate bug fixes and security patches or to keep up with the evolving requirements. Whether upgrades are applied offline or online, they significantly impact the system's performance and reliability. Commercial products aiming to address some of these issues are starting to appear; however, recent studies and a large body of anecdotal evidence suggest that upgrades remain failure-prone, tedious, and expensive. The goal of the HotSWUp Workshop is to identify, promote, and disseminate cutting-edge research for supporting software system upgrades that are flexible, efficient, robust, and easy to specify and apply. Many diverse research areas are concerned with building large, evolving, highly-available systems. By seeking contributions from both academic researchers and industry practitioners, HotSWUp aims to combine novel ideas with experience from upgrading real systems. PROGRAM Invited Talk: Phil Bernstein, Microsoft Research. Schema and Mapping Evolution in an Object-Relational Mapper ABSTRACT: Schema evolution is an unavoidable consequence of the application development lifecycle. In a database application, the conceptual model, the persistent database model, and the mapping specification between them must co-evolve so they are always mutually consistent and can compile into executable code. We study scenarios where the conceptual model changes and the database and mapping must evolve in kind, in the context of Microsoft's ADO.NET Entity Framework. We present two new techniques that, in most cases, allow those evolutions to progress automatically. The first technique treats the mapping as data, mines it for mapping patterns such as table-per-hierarchy or table-per-type, and automatically derives proper store and mapping changes that are consistent with the pattern. The second technique incrementally compiles the mapping specification into executable views, thereby avoiding the expense of a recompiling the entire mapping specification. Together, the techniques enable a developer to modify the conceptual model and let the system do the rest. Session 1: Update Semantics and Analysis * Formal Reasoning about Runtime Code Update. Nathaniel Charlton, Ben Horsfall and Bernhard Reus * Towards a categorical framework to ensure correct software evolutions. Sylvain Bouveret, Julien Brunel, David Chemouil and Fabien Dagnat * Predicting Upgrade Failures Using Dependency Analysis. Roberto Di Cosmo and Pietro Abate Session 2: Database Upgrades * Schema Evolution Analysis for Embedded Databases. Shengfeng Wu and Iulian Neamtiu * Causes for Dynamic Inconsistency-tolerant Schema Update Management. Hendrik Decker * Propagating Evolution Events in Data-Centric Software Artifacts. George Papastefanatos, Panos Vassiliadis and Alkis Simitsis Session 3: Approaches and Systems * Agnes Crist??le Noubissi, Julien Iguchi-Cartigny and Jean-Louis Lanet . Hot updates for Java-based Smart Cards * Non-disruptive Large-scale Component Updates for Real-Time ControllersUpgrade. Michael Wahler, Stefan Richter, Sumit Kumar and Manuel Oriol. * State Transfer for Clear and Efficient Runtime Upgrades. Christopher Hayden, Edward Smith, Michael Hicks and Jeffrey Foster. PROGRAM COMMITTEE Rida Bazzi, Arizona State University, USA (co-organizer) Carlo Aldo Curino, Massachusetts Institute of Technology, USA Fabien Dagnat, Telecom Bretagne, France Johann Eder, University of Vienna, Austria Michael Hicks, University of Maryland, College park, USA (co-organizer) Manuel Oriol, University of York, UK George Papastefanatos, Inst. for the Mgmt. of Information Systems, Greece Paolo Papotti, Universita Roma Tre, Italy Jason Nieh, Columbia University, USA Xin Qi, Facebook, USA Mark Segal, Laboratory for Telecommunications Sciences, USA Liuba Shrira, Brandeis University, USA Carlo Zaniolo, University of California, Los Angeles, USA (co-organizer) MORE INFORMATION Visit the workshop's homepage at: http://www.hotswup.org/2011 or the ICDE main site at: http://www.icde2011.org From Klaus.Havelund at jpl.nasa.gov Tue Feb 22 20:46:27 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (317J)) Date: Tue, 22 Feb 2011 17:46:27 -0800 Subject: [TYPES/announce] [fm-announcements] RV 2011 Call for Papers and Tutorials Message-ID: CALL FOR PAPERS AND TUTORIALS International Conference on Runtime Verification (RV 2011) September 27 - 30, 2011 Berkeley, California, USA http://sites.google.com/site/2011rv/ Runtime verification (RV) is concerned with monitoring and analysis of software or hardware system executions. The field is often referred to under different names, such as runtime verification, runtime monitoring, runtime checking, runtime reflection, runtime analysis, dynamic analysis, runtime symbolic analysis, trace analysis, log file analysis, etc. RV can be used for many purposes, such as security or safety policy monitoring, debugging, testing, verification, validation, profiling, fault protection, behavior modification (e.g., recovery), etc. A running system can be abstractly regarded as a generator of execution traces, i.e., sequences of relevant states or events. Traces can be processed in various ways, e.g., checked against formal specifications, analyzed with special algorithms, visualized, etc. Topics of interest include, but are not limited to: * program instrumentation techniques * specification languages for writing monitors * dynamic program slicing * record-and-replay * trace simplification for debugging * extraction of monitors from specifications * APIs for writing monitors * programming language constructs for monitoring * model-based monitoring and reconfiguration * the use of aspect oriented programming for dynamic analysis * algorithmic solutions to minimize runtime monitoring impact * combination of static and dynamic analysis * full program verification based on runtime verification * intrusion detection, security policies, policy enforcement * log file analysis * model-based test oracles * observation-based debugging techniques * fault detection and recovery * model-based integrated health management and diagnosis * program steering and adaptation * dynamic concurrency analysis * dynamic specification mining * metrics and statistical information gathered during runtime * program execution visualization * data structure repair for error recovery * parallel algorithms for efficient monitoring * monitoring for effective fault localization and program repair The RV series of events started in 2001, as an annual workshop. The RV'01 to RV'05 proceedings were published in ENTCS. Since 2006, the RV proceedings have been published in LNCS. In year 2010, RV became an international conference. Links to past RV events can be found at the permanent URL: http://runtime-verification.org INVITED SPEAKERS TBD Talk titles will be made available on RV 2011 web page. PAPER SUBMISSION RV will have two research paper categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. * Regular papers (up to 15 pages) should present original unpublished results. Applications of runtime verification are particularly welcome. A Best Paper Award (USD 300) will be offered. Selected papers will be published in an issue of Formal Methods in System Design. * Short papers (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (5-10 minutes) and poster sessions. In addition to short and regular papers, proposals for tutorials and tool demonstrations are welcome. Proposals should be up to 2 pages long. * Tutorial proposals on any of the topics above, as well as on topics at the boundary between RV and other domains, are welcome. Accepted tutorials will be allocated up to 15 pages in the conference proceedings. Tutorial presentations will be at least 2 hours. * Tool demonstration proposals should briefly introduce the problem solved by the tool and give the outline of the demonstration. Tool papers will be allocated 5 pages in the conference proceedings. A Best Tool Award (USD 200) will be offered. Submitted tutorial and tool demonstration proposals will be evaluated by the corresponding chairs, with the help of selected reviewers. All accepted papers, including tutorial and tool papers, will appear in the LNCS proceedings. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'11 to present the paper. Papers must be submitted electronically using the EasyChair system. A link to the electronic submission page will be made available on the RV'11 web page. IMPORTANT DATES May 8, 2011 - Submission of regular and short papers May 15, 2011 - Submission of tutorial and tool demonstration proposals June 26, 2011 - Notification for regular, short, and tool papers July 24, 2011 - Submission of camera-ready versions of accepted papers September 27-30, 2011 - RV 2011 Conference and tutorials ORGANIZERS Programme committee chairs: Sarfraz Khurshid (University of Texas at Austin, USA) Koushik Sen (University of California at Berkeley, USA) Local organization chairs: Jacob Burnim (University of California at Berkeley, USA) Nicholas Jalbert (University of California at Berkeley, USA) PROGRAM COMMITTEE Howard Barringer (University of Manchester, UK) Eric Bodden (Technical University Darmstadt, Germany) Rance Cleaveland (University of Maryland, USA) Mads Dam (Kungliga Tekniska h?gskolan, Sweden) Brian Demsky (University of California at Irvine, USA) Bernd Finkbeiner (Saarland University, Germany) Cormac Flanagan (University of California at Santa Cruz, USA) Patrice Godefroid (Microsoft Research Redmond, USA) Jean Goubault-Larrecq (ENS Cachan, France) Susanne Graf (Verimag, France) Radu Grosu (State University of New York at Stony Brook, USA) Lars Grunske (University of Kaiserslautern, Germany) Aarti Gupta (NEC Laboratories America, USA) Rajiv Gupta (University of California at Riverside, USA) Klaus Havelund (NASA/JPL, USA) Mats Heimdahl (University of Minnesota, USA) Gerard Holzmann (NASA/JPL, USA) Sarfraz Khurshid (University of Texas at Austin, USA) (co-chair) Viktor Kuncak (?cole Polytechnique F?d?rale De Lausanne, Switzerland) Kim Larsen (Aalborg University, Denmark) Martin Leucker (University of Luebeck, Germany) Rupak Majumdar (Max Planck Institute Germany and University of California at Los Angeles USA) Greg Morrisett (Harvard University, USA) Mayur Naik (Intel Berkeley Labs, USA) Brian Nielsen (Aalborg University, Denmark) Klaus Ostermann (University of Marburg, Germany) Corina Pasareanu (NASA Ames, USA) Doron Peled (Bar Ilan University, Israel) Suzette Person (NASA Langley, USA) Gilles Pokam (Intel, Santa Clara, USA) Shaz Qadeer (Microsoft Research Redmond, USA) Derek Rayside (University of Waterloo, Canada) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Wolfram Schulte (Microsoft Research Redmond, USA) Manu Sridharan (IBM T. J. Watson, USA) Koushik Sen (University of California, Berkeley, USA) (co-chair) Peter Sestoft (IT University of Copenhagen, Denmark) Scott Smolka (State University of New York at Stony Brook, USA) Oleg Sokolsky (University of Pennsylvania, USA) Mana Taghdiri (Karlsruhe Institute of Technology, Germany) Serdar Tasiran (Koc University, Turkey) Nikolai Tillmann (Microsoft Research Redmond, USA) Shmuel Ur (Shmuel Ur Innovation, Israel) Willem Visser (University of Stellenbosch, South Africa) Mahesh Viswanathan (University of Illinois at Urbana-Champaign, USA) Xiangyu Zhang (Purdue University, USA) RV STEERING COMMITTEE Howard Barringer (University of Manchester, UK) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Insup Lee (University of Pennsylvania, USA) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Oleg Sokolsky (University of Pennsylvania, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From sescobar at dsic.upv.es Wed Feb 23 09:18:44 2011 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Wed, 23 Feb 2011 15:18:44 +0100 Subject: [TYPES/announce] 2nd CfP: WRS 2011 - 10th International Workshop on Reduction Strategies in Rewriting and Programming References: <3CEB9622-C52F-4FC9-9E3B-1735AF31C82C@dsic.upv.es> Message-ID: <037271DA-1C3B-4F38-A6F8-5E748C46A108@dsic.upv.es> Call for Papers WRS 2011 10th International Workshop on Reduction Strategies in Rewriting and Programming http://www.dsic.upv.es/workshops/wrs2011 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop Federated Conference on Rewriting, Deduction, and Programming This workshop promotes research and collaboration in the area of reduction strategies. It encourages the presentation of new directions, developments, and results as well as surveys and tutorials on existing knowledge in this area. Reduction strategies define which (sub)expression(s) should be selected for evaluation and which rule(s) should be applied. These choices affect fundamental properties of computations such as laziness, strictness, completeness, and efficiency, to name a few. For this reason programming languages such as Elan, Maude, OBJ, Stratego, and TOM allow the explicit definition of the evaluation strategy, whereas languages such as Clean, Curry, and Haskell allow its modification. In addition to strategies in rewriting and programming, WRS also covers the use of strategies and tactics in other areas such as theorem and termination proving. Previous editions of the workshop were held in Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), Seattle (2006), Paris (2007), Hagenberg (2008), Brasilia (2009), and Edinburgh (2010); the last one as a joint workshop with the STRATEGIES workshop. Further information can be found at the permanent site for WRS . WRS 2011 is planned to be co-located with RTA 2011 (22nd International Conference on Rewriting Techniques and Applications), as a satellite event of RDP, the Federated Conference on Rewriting, Deduction, and Programming. WRS 2011 will be held at Novi Sad, Serbia on 29 May 2011. Submissions and Publication: Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style through the EasyChair submission site. Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in an electronic journal, such as Electronic Proceedings in Theoretical Computer Science. Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. We envisage publication of a special issue of a journal dedicated to WRS after the event. Important Dates: # Submission: 20 March 2011 # Notification: 4 April 2011 (changed) # Preliminary proceedings version due: 15 April 2011 # Workshop: 29 May 2011 # Submission for final proceedings: 12 September 2011 # Notification: 7 November 2011 # Final version: 21 November 2011 Programme Committee: # Dan Dougherty, Worcester Polytechnic Institute, USA # Santiago Escobar, Universidad Politecnica de Valencia, Spain (chair) # Maribel Fernandez, King's College London, UK # Juergen Giesl, RWTH Aachen, Germany # Bernhard Gramlich, Technische Universit Wien, Austria # Helene Kirchner, Centre de Recherche INRIA Bordeaux, France # Francisco Javier Lopez Fraguas, Universidad Complutense de Madrid, Spain # Salvador Lucas, Universidad Politecnica de Valencia, Spain # Aart Middeldorp, University of Innsbruck, Austria # Jaco van de Pol, University of Twente, The Netherlands # Masahiko Sakai, Nagoya University, Japan # Manfred Schmidt-Schauss, Johann Wolfgang Goethe-Universitat, Germany For more information, please contact Santiago Escobar Universidad Politecnica de Valencia, Spain Email: sescobar at dsic.upv.es From freund at cs.williams.edu Wed Feb 23 11:15:20 2011 From: freund at cs.williams.edu (Steve Freund) Date: Wed, 23 Feb 2011 11:15:20 -0500 Subject: [TYPES/announce] CFP: Formal Techniques for Java-like Programs (FTfJP) 2011 Message-ID: CALL FOR PAPERS FTfJP 2011: Formal Techniques for Java-like Programs colocated with ECOOP 2011, Lancaster UK July 26, 2011 URL: http://www.cs.williams.edu/FTfJP2011/index.html OVERVIEW Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - formal techniques for Java, C#, Scala or similar languages - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties - verification logics - language semantics - type systems - dynamic linking and loading - security CALL FOR CONTRIBUTIONS Contributions (of up to 6 pages in the ACM 2-column style) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, and the potential to generate interesting discussions. The workshop is intended for around 25 participants. The workshop will be organized into four or more sessions, each focused on a specific topic, and initiated by a presentation of few related position papers by the respective participants, or the introduction of the specific topic by a single speaker, and followed by discussions. 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. A plain-text ASCII abstract must be submitted one week before the paper submission deadline. Submission site: http://www.easychair.org/conferences/?conf=ftfjp13 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: April 8, 2011 full paper submission: April 15, 2011 notification: May 20, 2011 camera-ready paper: June 10, 2011 workshop: July 26, 2011 PROGRAM COMMITTEE Gavin Bierman, Microsoft Research, UK Viviana Bono, Universita di Torino, Italy Manuel Fahndrich, Microsoft Research, USA Stephen Freund, Williams College, USA (chair) Miguel Garcia, Lausanne, Switzerland Giovanni Lagorio, Universita di Genova, Italy Rustan Leino, Microsoft Research, USA Rosemary Monahan, National University of Ireland, Ireland Wojciech Mostowski, Radboud University Nijmegen, The Netherlands Chin Wei Ngan, University of Singapore, Singapore Jan Smans, Katholieke Universiteit Leuven, Belgium Serdar Tasiran, Koc University, Turkey Frank Tip, IBM Research, USA (on sabbatical at University of Oxford, UK) Tobias Wrigstad, Uppsala University, Sweden ORGANIZATION Susan Eisenbach, Imperial College, London, Great Britain Stephen Freund, Williams College, USA Gary T. Leavens, University of Central Florida, Orlando, USA Rustan Leino, Microsoft Research, USA Peter Muller, ETH Zurich, Switzerland Arnd Poetzsch-Heffter, Universitat Kaiserlautern, Germany Erik Poll, Radboud University Nijmegen, The Netherlands From sunj at comp.nus.edu.sg Wed Feb 23 23:04:38 2011 From: sunj at comp.nus.edu.sg (jun sun) Date: Wed, 23 Feb 2011 23:04:38 -0500 Subject: [TYPES/announce] CFP: 13th International Conference on Formal Engineering Methods (ICFEM 2011) Message-ID: ************************************************************ ICFEM 2011: 13th International Conference on Formal Engineering Methods CALL FOR PAPERs 25-28 Oct 2011 Radisson BLU Hotel, Durham, UK URL: http://www.scm.tees.ac.uk/icfem2011 ************************************************************ Apologies for multiple copies! Since 1997, ICFEM has provided a forum for those interested in the application of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work thatpromises to bring practical, tangible benefit. ICFEM 2011 is organised by Teesside University and will be held in the historic Durham City in the North East of England (http://www.thisisdurham.com/). AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their support environments will also be considered: * 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 * Concurrency and software transaction memory * Formal methods for cloud computing * Software inspection * Formal methods for cyber-physical systems * Tool development and integration * Software safety, security and reliability * Experiments involving verified systems * Applications of formal methods * 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 2011 submission page (https://www.easychair.org/conferences/?conf=icfem2011), handled by the EasyChair conference system. All queries should be sent to the e-mail address icfem2011 at scm.tees.ac.uk. IMPORTANT DATES 31 March, 2011: Abstract submission deadline 7 April, 2011: Full-paper submission deadline 8 June, 2011: Acceptance/rejection notification 6 July, 2011: Camera-ready version due ORGANIZATION COMMITTEE Honorary Chairs: Marc Cavazza, Teesside University Cliff Hardcastle, Teesside University General Chairs: Phil Brooke, Teesside University, UK Cliff Jones, Newcastle University, UK Program Chairs: Shengchao Qin, Teesside University, UK Zongyan Qiu, Peking University, UK Program Committee: Bernhard K. Aichernig (Graz University of Technology, Austria) Keijiro Araki (Kyushu University, Japan) Farhad Arbab (CWI and Leiden University, The Netherlands) 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) Andrew Butterfield (Trinity College Dublin, Ireland) Ana Cavalcanti (University of York, UK) Wei-Ngan Chin (National University of Singapore, Singapore) Florin Craciun (Soter Sys, Romania) Thao Dang (French National Center for Scientific Research, France) Jim Davies (Oxford University, UK) Dino Distefano (Queen Mary College, University of London, UK) Jin-Song Dong (National University of Singapore, Singapore) Zhenhua Duan (Xidian University, China) Colin Fidge (Queensland University of Technology, Australia) J. S. Fitzgerald (Newcastle University, UK) Leo Freitas (Newcastle University, UK) Joaquim Gabarro (Universitat Polit??cnica de Catalunya, Spain) Stefania Gnesi (ISTI-CNR, Italy) Anthony Hall (Consultant) Ian J. Hayes (The University of Queensland, Australia) Mike Hinchey (Lero, Ireland) Zhenjiang Hu (National Institute of Informatics, Japan) Michael Jackson (Consultant) Thierry Jeron (INRIA , France) Gerwin Klein (NICTA, Australia) Laura Kovacs (Vienna University of Technology, Austria) Kim G. Larsen (Aalborg University, Denmark) Peter Gorm Larsen (Aarhus University, Denmark) Michael Leuschel (Heinrich-Heine Universit?t D??sseldorf, Germany) Xuandong Li (Nanjing University, China) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau) Tiziana Margaria (University of Potsdam, Germany) Stephan Merz (INRIA Nancy & LORIA, France) Huaikou Miao (Shanghai University, China) Peter Mueller (ETH Zurich, Switzerland) Jun Pang (University of Luxembourg, Luxembourg) Matthew Parkinson (Microsoft Research Cambridge, UK) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Augusto Sampaio (Universidade Federal de Pernambuco, Brazil) Thomas Santen (Microsoft Innovations Center Aachen, Germany) Wuwei Shen (Western Michigan University, USA) Marjan Sirjani (Reykjavik University, Iceland) Bill Stoddart (Teesside University, UK) Jing Sun (University of Auckland, New Zealand) Jun Sun (Singapore University of Technology and Design, Singapore) Kenji Taguchi (AIST, Japan) Tetsuo Tamai (University of Tokyo, Japan) Yih-Kuen Tsay (National Taiwan University, Taiwan) T.H. Tse (University of Hong Kong, Hong Kong) Viktor Vafeiadis (MPI-SWS, Germany) Miroslav Velev (Aries Design Automation, USA) Laurent Voisin (Systerel, France) Hai H. Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Heike Wehrheim (University of Paderborn, Germany) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Hongli Yang (Beijing University of Technology, China) Naijun Zhan (Chinese Academy of Sciences, China) Jian Zhang (Chinese Academy of Sciences, China) Hong Zhu (Oxford Brookes University, UK) Huibiao Zhu (East China Normal University, China) Steering Committee Keijiro Araki, Japan Jin Song Dong, Singapore Chris George, Canada Jifeng He, China Mike Hinchey, Ireland Shaoying Liu (Chair), Japan John McDermid, UK Tetsuo Tamai, Japan Jim Woodcock, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: From E.Visser at tudelft.nl Thu Feb 24 07:02:50 2011 From: E.Visser at tudelft.nl (Eelco Visser) Date: Thu, 24 Feb 2011 13:02:50 +0100 Subject: [TYPES/announce] Onward! 2011: Call for Papers, Essays, Films, and Workshops Message-ID: Call for Papers, Essays, Films, and Workshops -=-=-=-=-= Onward! 2011 ACM Conference on New Ideas in Programming and Reflections on Software October 22-27, 2011 Hilton Portland & Executive Tower, Portland, Oregon USA Sponsored by ACM SIGPLAN http://onward-conference.org/2011/ http://onward-conference.org/2011/poster.html -=-=-=-=-=-=-=-=-=-= Onward! is more radical, more visionary, and more open than other conferences to not (yet) so well-proven but well-argued ideas. We welcome different ways of thinking about, approaching, and reporting on programming language and software engineering research. Onward! fosters the multidisciplinarity of software development. We are interested in anything to do with programming and software. Processes, methods, languages, art, philosophy, biology, economics, communities, politics, ethics, and of course applications. Anything! Sounds good? Do you want to report on and present your new ideas to the community and get feedback? Do you have a video to show or a story to tell, an essay perhaps? Do you want to bring reflections and new insights to the community? Or do you simply want to know more about innovations, visions, and the future of programming languages and software engineering? Then... Join Onward!, the unique, creative, and collaborative environment to discuss and investigate challenging problems related to software, its creation, and nurturing. -=-=-=-=-=-=-=-=-=-= Call for Research Papers: * http://onward-conference.org/2011/papers-call.html * Research papers submission: April 8, 2011 * Research papers notification: June 13, 2011 * Camera-ready copy of research papers due: July 25, 2011 Call for Essays: * http://onward-conference.org/2011/essays-call.html * Essays submission: April 18, 2011 * Essays notification: June 13, 2011 * Camera-ready copy of essays due: July 15, 2011 Call for Films: * http://onward-conference.org/2011/films-call.html * Films submission: May 10, 2011 * Films notification: July 1, 2011 * Final Films due: August 1, 2011 Call for Workshops: * http://onward-conference.org/2011/workshops-call.html * Workshop proposal submission: April 8, 2011 * Workshop proposal notification: May 8, 2011 * Camera-ready copy of workshop abstracts due: June 8, 2011 -=-=-=-=-=-=-=-=-=-= Organization * General Chair: Robert Hirschfeld, Hasso-Plattner-Institut Potsdam, Germany * Steering Committee Chair and General Co-Chair: Richard P. Gabriel, IBM Research, USA * Program Chair: Eelco Visser, Delft University of Technology, The Netherlands * Workshops Chair: Pascal Costanza, Vrije Universiteit Brussel, Belgium * Essays Chair: David West, New Mexico Highlands University, USA * Films Chair: Bernd Bruegge, Technische Universitaet Muenchen, Germany * Web Chair: Tobias Pape, Hasso-Plattner-Institute Potsdam, Germany * Design: Constanze Langer, Institute of Industrial Design, Hochschule Magdeburg-Stendal, Germany -=-=-=-=-=-=-=-=-=-= From Nicholas.Cameron at ecs.vuw.ac.nz Thu Feb 24 02:52:20 2011 From: Nicholas.Cameron at ecs.vuw.ac.nz (Nicholas Cameron) Date: Thu, 24 Feb 2011 20:52:20 +1300 Subject: [TYPES/announce] IWACO 2011: Call for Papers Message-ID: <4D660E34.6070909@ecs.vuw.ac.nz> Call For Papers International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO) Celebrating 20 years of aliasing research at ECOOP 2011 July 25th, 2011, Lancaster, UK http://ecs.victoria.ac.nz/Events/IWACO2011/ Call For Papers =============== 2011 is the 20th anniversary of "The Geneva Convention on The Treatment of Object Aliasing", which started research in aliasing and led to the development of object-ownership techniques. To celebrate, IWACO 2011 will be a special edition; we are in negotiation to publish a book (edited by members of the organising committee) containing the best papers from IWACO '11 and invited papers of a survey or retrospective nature. In addition to original research papers, we encourage authors to submit position papers and papers considering future research directions. The power of objects lies in the flexibility of their interconnection structure. But this flexibility comes at a cost. Because an object can be modified via any alias, object-oriented programs are hard to understand, maintain, and analyse. Aliasing makes objects depend on their environment in unpredictable ways, breaking the encapsulation necessary for reliable software components, making it difficult to reason about and optimise programs, obscuring the flow of information between objects, and introducing security problems. Aliasing is a fundamental difficulty, but we accept its presence. Instead we seek techniques for describing, reasoning about, restricting, analysing, and preventing the connections between objects and/or the flow of information between them. Promising approaches to these problems are based on ownership, confinement, information flow, sharing control, escape analysis, argument independence, read-only references, effects systems, and access control mechanisms. The workshop will generally address the question how to manage interconnected object structures in the presence of aliasing. In particular, we will consider the following issues (among others): * models, type and other formal systems, programming language mechanisms, analysis and design techniques, patterns and notations for expressing object ownership, aliasing, confinement, uniqueness, and/or information flow. * optimisation techniques, analysis algorithms, libraries, applications, and novel approaches exploiting object ownership, aliasing, confinement, uniqueness, and/or information flow. * empirical studies of programs or experience reports from programming systems designed with these issues in mind * novel applications of aliasing management techniques such as ownership types, ownership domains, confined types, region types, and uniqueness. We encourage not only submissions presenting original research results, but also papers that attempt to establish links between different approaches and/or papers that include survey material. Original research results should be clearly described, and their usefulness to practitioners outlined. Paper selection will be based on the quality of the submitted material. The workshop will be held as part of the ECOOP'11 conference taking place in Lancaster, England. Programme Committee ------------------- Nicholas Cameron (chair, Victoria University of Wellington) Dave Clarke (KU Leuven) Werner Dietl (University of Washington) Ioannis Kassios (ETH Zurich) Doug Lea (State University of New York at Oswego) James Noble (Victoria University of Wellington) Matthew Parkinson (Microsoft Research, Cambridge) Alex Potanin (Victoria University of Wellington) Tobias Wrigstad (Uppsala University) Important Dates --------------- 15 April, 2011: paper submission deadline 20 May, 2011: author notification 25 May, 2011: full program disseminated 24 June, 2011: papers available 25 July, 2011: workshop takes place Organisers ---------- Dave Clarke (KU Leuven) James Noble (Victoria University of Wellington) Tobias Wrigstad (Uppsala University) Peter Muller (ETH Zurich) Matthew Parkinson (Microsoft Research, Cambridge) Participation ------------- The number of participants is limited to 25. Apart from those with accepted papers, others may attend by sending an email to Nicholas Cameron (ncameron at ecs.vuw.ac.nz) indicating what contribution you could make to the workshop. A small number of places will be reserved for PhD students and other researchers wishing to begin research in this area. Selection Process ----------------- Both full papers (up to 10 pgs.) and short papers (1-2 pgs.) are welcome. All submissions will be reviewed by the programme committee. The accepted papers, after rework by the authors, will be published in the Workshop Proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Papers should be submitted via Easychair at https://www.easychair.org/conferences/?conf=iwaco11 by 15 April, 2011. Submissions should be in English. Queries ------- Queries may be directed to Nicholas Cameron (ncameron at ecs.vuw.ac.nz). From Matthew.Hennessy at cs.tcd.ie Thu Feb 24 09:58:05 2011 From: Matthew.Hennessy at cs.tcd.ie (Matthew Hennessy) Date: Thu, 24 Feb 2011 14:58:05 +0000 Subject: [TYPES/announce] PhD position in Communicating Transactions at Trinity College Dublin References: <815D897A-8F29-424B-93C6-5CDD7C3380D1@cs.tcd.ie> Message-ID: [Apologies for multiple mailings] Language Support for Communicating Transactions A three year PhD position, to start in September 2011, is now available at Trinity College Dublin, Ireland, associated with the project "Language Support for Communicating Transactions" funded by the Microsoft Research PhD Scholarship scheme. Three years fees will be paid at the EU rate and there will be a stipend at the standard HEA rate. The position is based in the Department of Computer Science at Trinity College, co-supervised by Matthew Hennessy at Trinity and Andrew Gordon and Nick Benton at Microsoft Research, Cambridge England. The goal of the project is to develop abstract models and programming support for "communicating transactions" a novel language construct obtained by dropping the standard isolation requirement from traditional transactions. As a result independent transactions can interfere, or communicate, with each other, which leads to complex interdependences in the event of failure. The goal of the project is to construct abstract models for their behaviour and to develop efficient programming language support for these models. Specifically the project will extend concurrent Haskell with a construct for communicating transactions, study the formal semantics of the extended language, investigate efficient implementation strategies, and develop useful programming idioms and verification techniques. Candidates are expected to have a first-class degree in Computer Science. The project will involve language implementation, the elaboration of formal semantics, and the development of verification techniques. Consequently the successful candidate will have a broad range of skills. These should include language implementation skills, a good knowledge of formal techniques for the specification of language semantics; experience with logic based verification techniques is also desirable. Informal preliminary enquiries may be made to Matthew Hennessy at Trinity College. From shao at cs.yale.edu Thu Feb 24 10:12:41 2011 From: shao at cs.yale.edu (Zhong Shao) Date: Thu, 24 Feb 2011 10:12:41 -0500 Subject: [TYPES/announce] LOLA 2011 -- call for contributed talks Message-ID: <201102241512.p1OFCfLo031994@lux.cs.yale.edu> ============================================================ *** CALL FOR CONTRIBUTED TALKS *** LOLA 2011 Syntax and Semantics of Low Level Languages Monday 20th June 2011, Toronto, Canada A LICS 2011-affiliated workshop http://flint.cs.yale.edu/lola2011 ============================================================ IMPORTANT DATES Submission deadline Friday 29th April 2011 Author notification Friday 13th May 2011 Workshop Monday 20th June 2011 SUBMISSION LINK The submissions will be made by easychair at http://www.easychair.org/conferences/?conf=lola2011 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 bogus@does.not.exist.com Wed Jan 19 16:58:03 2011 From: bogus@does.not.exist.com () Date: Wed, 19 Jan 2011 21:58:03 -0000 Subject: No subject Message-ID: new research area at the frontier of logic and computer science. The practically motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified 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, - Implicit complexity, sublinear programming and Turing machines - Parametricity, modules and existential types - General references, Kripke models and recursive types - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects PROGRAM COMMITTEE * Nick Benton (MSR Cambridge) * Josh Berdine (MSR Cambridge) * Lars Birkedal (IT University of Copenhagen, co-chair) * Xinyu Feng (University of Science and Technology of China) * Greg Morrisett (Harvard University) * Xavier Rival (INRIA Roquencourt and ENS Paris) * Zhong Shao (Yale University, co-chair) * Nicolas Tabareau (INRIA - EMN) * J??r??me Vouillon (CNRS) * Noam Zeilberger (University of Paris VII) SUBMISSION INSTRUCTIONS LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. The submissions should be made by easychair at http://www.easychair.org/conferences/?conf=lola2011 INVITED SPEAKERS To be announced soon. From elaine at mat.ufmg.br Thu Feb 24 18:38:42 2011 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Thu, 24 Feb 2011 23:38:42 +0000 (UTC) Subject: [TYPES/announce] LSFA 2011 - First call for papers Message-ID: LSFA 2011 - Sixth Workshop on Logical and Semantic Frameworks, with Applications August 27th, 2011, Belo Horizonte, Minas Gerais, Brazil Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and 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 o Proof theory o Type theory o Automated deduction * Semantic frameworks o Specification languages and meta-languages o Formal semantics of languages and systems o Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA 2011 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. Invited Speakers 01 Camilo Rueda (PUJ - Colombia) 02 (TBC) Program Committee Simona Ronchi della Rocca (co-chair, UNITO, Italy) Elaine Gouv??a Pimentel (co-chair, UFMG, Brazil) Luis Farinas del Cerro (IRIT, France) Edward Hermann Haeusler (PUC-Rio, Brazil) Jonathan Seldin (Univ-Lethbridge , Canada) Maur??cio Ayala-Rinc??n (UnB, Brazil) Mario Benevides (Coppe-UFRJ, Brazil) Eduardo Bonelli (UNQ, Argentina) Marcelo Corr??a (IM-UFF, Brazil) Clare Dixon (Liverpool, UK) Gilles Dowek (Polytechnique-Paris, France) William Farmer (Mcmaster, Canada) Maribel Fern??ndez (King's College, UK) Marcelo Finger (IME-USP, Brazil) Alwyn Goodloe (NASA LaRC) Fairouz Kamareddine (Heriot-Watt Univ, UK) Delia Kesner (Paris-Jussieu, France) Luis da Cunha Lamb (UFRGS, Brazil) Joao Marcos (UFRN, Brazil) Flavio L. C. de Moura (UnB, Brazil) Ana Teresa Martins (UFC, Brazil) Martin Musicante (UFRN, Brazil) Cl??udia Nalon (UnB, Brazil) Vivek Nigam (Ludwig-Maximilians-Universit??t M??nchen) Luca Paolini (UNITO, Italy) Organizing Committee Mauricio Ayala-Rinc??n Edward Hermann Hauesler PUC-Rio Elaine Pimentel (Local-chair) Simona Ronchi della Rocca Dates and Submission Paper submission deadline: May 23 Author notification: June 30 Camera ready: July 31st Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA 2011 page at EasyChair until the submission deadline in May 23, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using EPTCS style. 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. A special issue of the first edition of the workshop appeared in the Journal of Algorithms, a special issue of the second edition of the workshop appeared in the J.IGPL and a special edition of TCS is being prepared with selected contributions from the third and the forth editions of LSFA. At least one of the authors should register at the conference. The paper presentation should be in English. Venue Belo Horizonte is the capital of the state of Minas Gerais and the third-largest metropolitan area in Brazil. A city surrounded by mountains, quite big, but still with this countryside town air. Contact Information For more information please contact the chairs The web page of the event can be reached at: http://www.mat.ufmg.br/lsfa2011/ 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 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- From isabelle.perseil at telecom-paristech.fr Thu Feb 24 20:36:37 2011 From: isabelle.perseil at telecom-paristech.fr (Isabelle Perseil) Date: Fri, 25 Feb 2011 02:36:37 +0100 Subject: [TYPES/announce] =?iso-8859-1?q?_CALL_FOR_PAPERS_=3A_UML=26FM=922?= =?iso-8859-1?q?011?= Message-ID: <4f092929c530f2d8da9cf3934c2d2983.squirrel@webmail1.telecom-paristech.fr> ********************************************************************** CALL FOR PAPERS : UML&FM?2011 4th INTERNATIONAL WORKSHOP ON UML&FORMAL METHODS http://www.artist-embedded.org/artist/UML-FM-2011.html Workshop held in conjunction with FM 2011 The 17th International Symposium on Formal Methods http://sites.lero.ie/fm2011 june 20th, 2011 Limerick, Ireland ************************************************************************ Submission deadline: April 15th, 2011 ------------------------------------- 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, CSP, VDM, Petri Nets, UPPAAL, HOL, Coq, PVS etc. This fourth 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=umlfm2011 Papers should not exceed 8 pages . Submitted manuscripts should be in English and formatted in the style of the ISSE Format. Please, follow the guidelines at the "For authors and editors" heading in the ISSE website All accepted papers will be published in a special issue of ISSE NASA journal (Innovations in Systems and Software Engineering). Slides will be made available through the workshop website. IMPORTANT DATES =============== Submission deadline: April 15th, 2011 All Notification of acceptance: May 5th, 2011 Final copy : June 15th, 2011 Workshop date : June 20th, 2011 Organizers ========== Organizational sponsors : OMG (http://www.omg.org/) ARTIST (http://www.artist-embedded.org/artist/) Organizers and Programme Steering committee: - Jean-Michel Bruel (Liuppa, France) - Robert de Simone (INRIA, France) - S?bastien G?rard (CEA-LIST, France) - Paul Gibson (Telecom SudParis, France) - Isabelle Perseil (Inserm, France) IEEE CS Coordinator: Mike Hinchey (Lero and NASA GSFC , Ireland) PC Chairs: - Paul Gibson (Telecom SudParis, France) - Isabelle Perseil (Inserm, France) Program Committee: - Lukman Ab Rahim (Lancaster University, United Kingdom) - Nazareno Aguirre (Universidad Nacional de R?o Cuarto, Argentina) - Marc Aiguier (Ecole Centrale Paris, France) - Yamine Ait Ameur (LISI / ENSMA, France) - Pascal Andr? (LINA, University of Nantes, France) - Luciano Baresi (Politecnico di Milano, Italia) - Kamel Barkaoui (CEDRIC-CNAM, France) - Jean-Paul Bodeveix (IRIT, France) - Jean-Michel Bruel (IRIT, France) - Alexandre Cabral Mota (Universidade Federal de Pernambuco, Brazil) - Agusti Canals (CS, France) - David Clark(University College London, United Kingdom) - Vincent Englebert (University of Namur, Belgium) - Huascar Espinoza (Tecnalia, Spain) - Mamoun Filali (IRIT, France) - S?bastien G?rard (CEA-LIST, France) - Frederic Gervais (Universit? Paris-Est, LACL, France) - Paul Gibson (Telecom SudParis, France) - Martin Gogolla (University of Bremen, Germany) - J?r?me Hugues (ISAE, France) - Stephen J.Mellor (Accelerated Technologies, Tucson AZ, USA) - Paul Krause (University of Surrey, United Kingdom) - Kevin Lano (King?s College London, United Kingdom) - Manuel Mazzara (Newcastle University, United Kingdom) - Sun Meng (Peking University, China) - Dominique Mery (LORIA, France) - Elie Najm (Telecom ParisTech, France) - Kazuhiro Ogata (Japan Advanced Institute of Science and Technology, Japan) - Isabelle Perseil (Inserm, France) - Dorina Petriu (Carlton University, USA) - Fiona Polack (University of York, United Kingdom) - 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) - Fran?oise Simonot Lion (LORIA, France) - Volker Stolz (United Nations University, Norway) - Jing Sun (University of Auckland, New Zealand) - Jun Suzuki (University of Massachusetts, Boston, USA) - 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) - Fran?ois Vernadat (CNRS-LAAS, France) - Eugenio Villar (Universidad de Cantabria, Spain) - Tim Weilkiens (OOSE Innovative Informatik, Germany) - Sergio Yovine (Universidad de Buenos Aires, Argentina) From antonio at iist.unu.edu Fri Feb 25 04:01:53 2011 From: antonio at iist.unu.edu (Antonio Cerone) Date: Fri, 25 Feb 2011 17:01:53 +0800 (CST) Subject: [TYPES/announce] CfP: Theoretical Aspects of Computing (ICTAC 2011) - DEADLINE EXTENDED Message-ID: Second Call for Papers ICTAC 2011 International Colloquium on Theoretical Aspects of Computing URL: http://www.ictac.net/ictac2011/ 31 August - 2 September 2011, Johannesburg, South Africa ------------------------------------------------- The Colloquium will be held in a nature reserve two hours travel by car from the centre of Johannesburg (transfer provided), in a malaria-free area in the Waterberg mountains. All of the big five can be viewed at the reserve and a safari tour will form part of the social programme for delegates. ------------------------------------------------- EXTENDED DEADLINES Paper abstract submission deadline: 31 March 2011 Paper submission deadline: 7 April 2011 ------------------------------------------------- BACKGROUND ICTAC 2011 is the 8th 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 2011 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; * software specification, refinement, verification and testing; * model checking and theorem proving; * formal techniques in software testing; * models of object and component systems; * coordination and feature interaction; * integration of theories, formal methods and tools for engineering computing systems; * service-oriented development; * service-oriented architectures: models and development methods; * document-driven development; * models of concurrency, security, and mobility; * theory of parallel, distributed, and grid computing; * real-time, embedded and hybrid systems; * type and category theory in computer science; * models for learning and education; * cognitive architectures; * qualitative reasoning; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. KEYNOTE SPEAKERS * Jayadev Misra * David Parnas * Willem Visser VENUE, TRANSPORTATION AND ACCOMMODATION The ICTAC 2011 Colloquium will be held in a nature reserve, away from the bustle and noise of a large city. The reserve is two hours travel by car from the centre of Johannesburg, in the Waterberg mountains, situated on 12000 hectares of malaria-free bushveld. All of the big five can be viewed at the reserve and a game drive will form part of the social programme for delegates. Transfers will be provided for delegates from the ICTAC tutorials to the reserve, and back again to Johannesburg after the event. The reserve is also easily accessible by self-drive with normal motor cars. Delegates can additionally arrange to stay on after the colloquium to relax and enjoy the quiet of the region, or take part in the numerous adventure activities - such as horse riding, abseiling, and archery. Accomodation at the reserve is recommended to simplify access during the event as other lodges are not easy to reach without a hired vehicle. Travel to Johannesburg is easy from all parts of the world with many major carriers having multiple departures each day and the availability of a modern rail link from O. R. Tambo International Airport to hotels in and around Johannesburg. PUBLICATION AND SUBMISSION The proceedings of ICTAC 2011 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be avaialble at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2011 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. Papers should be written in English and not exceed 15 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=ictac2011. All queries should be sent to: ictac2011 at iist.unu.edu IMPORTANT DATES: Paper abstract submission deadline: 15 March 2011 Paper submission deadline: 22 March 2011 Paper Accept/Reject Notification: 15 May 2011 Final paper submission 31 May 2011 PROGRAM COMMITTEE * Bernhard K. Aichernig, Austria * Junia Anacleto, Brazil * Jonathan P. Bowen, UK * Christiano Braga, Brazil * Vasco Brattka, South Africa * Andrew Butterfield, Ireland * Ana Cavalcanti, UK * Antonio Cerone, Macau SAR China (co-chair) * Dang Van Hung, Vietnam * Jim Davies, UK * David Deharbe, Brazil * Wan Fokkink, Netherlands * Pascal Fontaine, France * Marcelo Frias, Argentina * Lindsay Groves, New Zealand * Stefan Gruner, South Africa * Michael R. Hansen, Denmark * Rob Hierons, UK * Lynne Hunt, Australia * Moonzoo Kim, Korea * Coenraad Labuschagne, South Africa * Martin Leucker, Germany * Liu Zhiming, Macau SAR China * Patricia Machado, Brazil * Mieke Massink, Italy * Ali Mili, USA * Marius Minea, Romania * Tobias Nipkow, Germany * Ogawa Mizuhito, Japan * Odejobi Odetunji, Nigeria * Jose Oliveira, Portugal * Ekow Otoo, South Africa * Pekka Pihlajasaari, South Africa (co-chair) * Anders Ravn, Denmark * Francesca Pozzi, Italy * Markus Roggenbach, UK * Augusto Sampaio, Brazil * Bernhard Sch??tz, Germany * Gerardo Schneider, Sweden * Natarajan Shankar, USA * Marjan Sirjani, Iceland * Fausto Spoto, Italy * Clint van Alten, South Africa * Franck van Breugel, Canada * Govert van Drimmelen, South Africa * Daniel Varro, Hungary * Herbert Wiklicky, UK ORGANISING COMMITTEE * Antonio Cerone, Macau SAR China * Coenraad Labuschagne, South Africa * Pekka Pihlajasaari, South Africa * David Sherwell, South Africa * Clint van Alten, South Africa STEERING COMMITTEE * John Fitzgerald, UK * Martin Leucker, Germany * Liu Zhiming, Macau SAR China * Tobias Nipkow, Germany * Augusto Sampaio, Brazil * Natarajan Shankar, USA * Jim Woodcock, UK --- Antonio Cerone Research Fellow UNU-IIST, Macau SAR China From noam.zeilberger at gmail.com Fri Feb 25 14:32:18 2011 From: noam.zeilberger at gmail.com (Noam Zeilberger) Date: Fri, 25 Feb 2011 20:32:18 +0100 Subject: [TYPES/announce] CFP: Workshop on Theory and Practice of Delimited Continuations (deadline extension - 11 March) Message-ID: *** full paper deadline extended *** *** 11 March *** Call for Papers TPDC 2011 1st International Workshop on Theory and Practice of Delimited Continuations http://www.pps.jussieu.fr/~saurin/tpdc2011/ 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop - Federated Conference on Rewriting, Deduction, and Programming SCOPE AND TOPIC: Since their introduction in the late 1980s, delimited control operators have triggered increasing interest among programmers and the programming language community, found unexpected applications in conceptual domains such as linguistics and constructive mathematics, and shown themselves to be the natural development of classical control operators. The first workshop on the Theory and Practice of Delimited Continuations aims to bring together people working with the many different (practical, theoretical, or foundational) aspects of delimited continuations, in the hope of fostering some unity and progress. Contributions on all topics related to delimited continuations are welcome, as either short abstracts or full papers (see SUBMISSION PROCEDURE below). INVITED SPEAKERS: To be announced IMPORTANT DATES: # Submission of full papers: 11 March 2011 (extended deadline) # Submission of short abstracts: 18 March 2011 # Notification of acceptance: 25 March 2011 # Final version due: 8 April 2011 # Workshop: 29-30 May 2011 SUBMISSION PROCEDURE: We accept submissions of two kinds: * short abstracts (1 to 2 pages) * full papers up to 12 pages (in the EasyChair class style) Short abstracts are proposals for talks within a wide rubric: reports on work-in-progress or recently published papers, surveys or short tutorials, system demonstrations, etc. Full papers must describe new work not under consideration for publication elsewhere. Accepted papers and abstracts will be presented at the workshop and included in the proceedings, published as a technical report. Papers and abstracts should be formatted using the easychair.cls LaTeX class (see http://easychair.org/coolnews.cgi), and may be submitted electronically as pdf files via the easychair website: https://www.easychair.org/account/signin.cgi?conf=tpdc2011 PROGRAM COMMITTEE: Zena Ariola, University of Oregon, USA Dariusz Biernacki, University of Wroclaw, Poland Hugo Herbelin, INRIA, Paris, France Yukiyoshi Kameyama, University of Tsukuba, Japan Alexis Saurin, CNRS, Paris, France Hayo Thielecke, University of Birmingham, UK Noam Zeilberger, Universit? Paris Diderot, Paris, France WORKSHOP ORGANIZERS: Hugo Herbelin, INRIA, Paris, France Alexis Saurin, CNRS, Paris, France Noam Zeilberger, Universit? Paris Diderot, Paris, France For more information, please contact Alexis Saurin or Noam Zeilberger From katoen at cs.rwth-aachen.de Sun Feb 27 05:01:47 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Sun, 27 Feb 2011 11:01:47 +0100 Subject: [TYPES/announce] ETAPS 2011: Final Call for Participation Message-ID: <4D6A210B.5020200@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** *** *** *** ETAPS 2011 *** *** March 26 - April 3, 2011 *** *** Saarbr?cken, Germany *** *** http://www.etaps.org/ *** *** *** *** Final CALL FOR PARTICIPATION *** *** *** ****************************************************************** --------------------------------------------------------------------- -- REGISTRATION -- --------------------------------------------------------------------- For online registration visit: http://www.etaps.org/registration Normal registration closes on March 11. --------------------------------------------------------------------- -- 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 related to Software Science. It is a confederation of five conferences, and embedded in associated events, satellite workshops and other events. --------------------------------------------------------------------- -- ETAPS MAIN CONFERENCES -- --------------------------------------------------------------------- CC 2011 International Conference on Compiler Construction ESOP 2011 European Symposium on Programming FASE 2011 Fundamental Approaches to Software Engineering FOSSACS 2011 Foundations of Software Science and Computation TACAS 2011 Tools and Algorithms for the Construction and Analysis of Systems --------------------------------------------------------------------- -- ETAPS 2011 INVITED SPEAKERS -- --------------------------------------------------------------------- Prakash Panangaden (McGill, Canada) Martin Odersky (EPFL, Switzerland) Andreas Podelski (Freiburg, Germany) Gerard J. Holzmann (NASA, USA) Andrew Appel (Princeton, USA) Ross Anderson (Cambridge, UK) Michael Backes (Saarbr?cken, Germany) Marta Kwiatkowska (Oxford, UK) (in order of appearance) --------------------------------------------------------------------- -- Host City: Saarbruecken, Germany -- --------------------------------------------------------------------- Saarbruecken is the capital of the Saarland, the smallest German federal state. Saarbruecken has approximately 190,000 inhabitants and hence is of pleasant size. Picturesque attractions and places of historic interest are scattered around the city, and offer the perfect destination for a hike or a daytrip. The cultural palette attracts visitors from far and wide. Saarbruecken is located very close to the French border, and half way on the high-speed railway connecting Paris and Frankfurt. Both are in less than two hours distance. For travel and accommodation information, please consult the ETAPS 2011 website: http://www.etaps.org/ ETAPS 2011 is organized by the Department of Computer Science, Saarland University and will take place in the Saarbruecken Informatics Campus, on the Saarland University premises. --------------------------------------------------------------------- -- Associated Event -- --------------------------------------------------------------------- TOSCA Theory of Security and Applications --------------------------------------------------------------------- -- Satellite Workshops -- --------------------------------------------------------------------- ACCAT Applied and Computational Category Theory Bytecode Bytecode Semantics, Verification, Analysis and Transformation COCV 10th Workshop on Compiler Optimization Meets Compiler Verification DICE 2nd International Workshop on Developments in Implicit Computational complExity FESCA Formal Foundations of Embedded Software and Component-Based Software Architectures GaLoP VI Games for Logic and Programming Languages GT-VMT International Workshop on Graph Transformation and Visual Modeling Techniques HAS Hybrid Autonomous Systems iWIGP International Workshop on Interactions, Games and Protocols LDTA 11th Workshop on Language Descriptions, Tools and Applications PLACES Programming Language Approaches to Concurrency and Communication-cEntric Software QAPL 9th Workshop on Quantitative Aspects of Programming Languages ROCKS Rigorous dependability analysis using model checking techniquesfor stochastic systems SVARM Workshop on Synthesis, Verification, and Analysis of Rich Models TERMGRAPH 6th International Workshop on Computing with Terms and Graphs WGT 3rd Workshop on Generative Technologies --------------------------------------------------------------------- -- Tool Demonstrations -- --------------------------------------------------------------------- Demonstrations of tools presenting advances on the state of the art have been selected and are integrated in the programmes of the main conferences. --------------------------------------------------------------------- -- Registration (again) -- --------------------------------------------------------------------- For online registration visit: http://www.etaps.org/registration Normal registration closes on March 11. --------------------------------------------------------------------- -- Contact -- --------------------------------------------------------------------- See http://www.etaps.org/ Any question can be addressed to etaps2011 at cs.uni-saarland.de From murdoch.gabbay at gmail.com Sun Feb 27 08:52:37 2011 From: murdoch.gabbay at gmail.com (murdoch gabbay) Date: Sun, 27 Feb 2011 13:52:37 +0000 Subject: [TYPES/announce] survey paper "Nominal terms and nominal logics" Message-ID: I'd like to announce the availability of a survey article ? "Nominal terms and nominal logics: from foundations to meta-mathematics" providing an overview of rewriting, algebra, and first-order logic based on nominal terms. This is due to appear in the Handbook of Philosophical Logic, Volume 17. ?It is available online at ? http://www.gabbay.org.uk/papers.html#nomtnl (This can be viewed as a companion piece to my survey of nominal sets, "Foundations of nominal techniques" http://www.gabbay.org.uk/papers.html#fountl.) Murdoch Gabbay From davide at disi.unige.it Mon Feb 28 07:04:50 2011 From: davide at disi.unige.it (Davide Ancona) Date: Mon, 28 Feb 2011 13:04:50 +0100 Subject: [TYPES/announce] CfP: RP 2011 Message-ID: <4D6B8F62.2030902@disi.unige.it> ============================================================== 5th Workshop on Reachability Problems (RP'11) (September 28-30, 2011, Genova, Italy) Deadline for submissions: 10 May, 2011 http://rp11.disi.unige.it/ ============================================================== The 5th Workshop on Reachability Problems will be hosted by DISI (Dip. di Informatica e Scienze dell'Informazione), Universita' di Genova, Italy. 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: ================ - Krishnendu Chatterjee, IST Austria - Bruno Courcelle, LABRI, Bordeaux - Joost-Pieter Katoen, RWTH, Aachen - Jean-Francois Raskin, Univerite' Libre de Bruxelles 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, 2011 Notification: 28 June, 2011 Final version: 5 July, 2011 Conference: 28-30 September, 2011 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: ============= Parosh Aziz Abdulla , Uppsala Davide Ancona , Genova Bernard Boigelot , Liege Olivier Bournez, Palaiseau Cristian S. Calude , Auckland Giorgio Delzanno , Genova Stephane Demri , Cachan Javier Esparza , M?nchen Laurent Fribourg , Cachan Vesa Halava , Turku Juhani Karhum?ki, Turku Antonin Kucera , Brno Alexander Kurz , Leicester Jerome Leroux , Bordeaux Alexei Lisitsa , Liverpool Igor Potapov , Liverpool Arnaud Sangnier, Paris Hsu-Chun Yen , Taipei Gianluigi Zavattaro , Bologna Organizing Committee: ================ - Giorgio Delzanno, Genova - Igor Potapov, Liverpool Contacts ================ E-mail: giorgio at disi.unige.it, potapov at liverpool.ac.uk Web: http://rp11.disi.unige.it From katoen at cs.rwth-aachen.de Tue Mar 1 07:34:16 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Tue, 01 Mar 2011 13:34:16 +0100 Subject: [TYPES/announce] CONCUR 2011: Final Call for Papers Message-ID: <4D6CE7C8.80802@cs.rwth-aachen.de> [We apologise for multiple copies.] ============================================================================ CONCUR 2011 - Final Call for Papers 22nd International Conference on Concurrency Theory September 6 - September 9, 2011, Aachen, Germany http://concur2011.rwth-aachen.de/ ============================================================================ 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 ================================ - Parosh Aziz Abdulla (Uppsala University, Sweden) - Ursula Goltz (Technical University Braunschweig, Germany) - Rachid Guerraoui (EPFL Lausanne, Switzerland) - Wil van der Aalst (Eindhoven University of Technology, The Netherlands) ================================ 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 ================================ 8th Int. Conference on Quantitative Evaluation of SysTems (QEST 2011) 6th Int. Symposium on Trustworthy Global Computing (TGC 2011) There will be 9 co-located workshops, which take place on September 5 and September 10, and 6 tutorials (associated with QEST) which take place on September 5. ================================ PAPER SUBMISSION ================================ CONCUR 2011 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. The CONCUR 2011 proceedings will be published by Springer in the ArCoSS subseries of LNCS. The proceedings will be available at the conference. ================================ IMPORTANT DATES ================================ Abstract Submission: April 1, 2011 Paper Submission: April 8, 2011 Paper Notification: May 25, 2011 Camera Ready Copy Due: June 10, 2011 CONCUR 2011: September 6 - September 9, 2010 ================================ STEERING COMMITTEE ================================ - Roberto Amadio (PPS, Universite Paris Diderot - Paris 7, France) - Jos Baeten (Eindhoven University of Technology, The Netherlands) - Eike Best (Carl von Ossietzky Universit?t Oldenburg, Germany) - Kim Larsen (Aalborg University, Denmark) - Ugo Montanari (Universita di Pisa, Italy) - Scott Smolka (SUNY, Stony Brook University, USA) ================================ PROGRAM CHAIRS ================================ - Joost-Pieter Katoen (RWTH Aachen University, Germany) - Barbara K?nig (University of Duisburg-Essen, Germany) ================================ PROGRAM COMMITTEE ================================ - Christel Baier (TU Dresden, Germany) - Paolo Baldan (University of Padova, Italy) - Ahmed Bouajjani (University Paris Diderot, France) - Franck van Breugel (York University, Toronto, Canada) - Roberto Bruni (University of Pisa, Italy) - Rocco De Nicola (University of Florence, Italy) - Dino Distefano (Queen Mary University of London and Monoidics Ltd, UK) - Javier Esparza (TU Munich, Germany) - Yuxi Fu (Shanghai Jiaotong University, China) - Paul Gastin (ENS de Cachan, Paris, France) - Keijo Heljanko (Aalto University, Espoo, Finland) - Anna Ingolfsdottir (Reykjavik University, Iceland) - Maciej Koutny (Newcastle University, UK) - Antonin Kucera (Masaryk University, Brno, Czech Republic) - Gerald L?ttgen (Otto-Friedrich-Universit?t Bamberg, Germany) - Bas Luttik (Eindhoven University of Technology, The Netherlands) - Madhavan Mukund (Chennai Mathematical Institute, India) - Ernst-R?diger Olderog (Universit?t Oldenburg, Germany) - Joel Ouaknine (University of Oxford, UK) - Jan Rutten (CWI Amsterdam and Radboud University Nijmegen, The Netherlands) - Vladimiro Sassone (University of Southampton, UK) - Marielle Stoelinga (University of Twente, Enschede, The Netherlands) - Irek Ulidowski (University of Leicester, UK) - Bj?rn Victor (Uppsala University, Sweden) - Mahesh Viswanathan (University of Illinois, Urbana-Champaign, USA) - Andrzej Wasowski (IT University of Copenhagen, Denmark) ================================ ORGANIZING COMMITTEE ================================ Henrik Bohnenkamp, Arnd Gehrmann, Christina Jansen, Nils Jansen, Ulrich Loup, Thomas Noll, Elke Ohlenforst, Sabrina von Styp (RWTH Aachen), and Mathias H?lsbuch and Sander Bruggink (University of Duisburg-Essen). From f.rabe at jacobs-university.de Tue Mar 1 08:33:34 2011 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Tue, 1 Mar 2011 14:33:34 +0100 Subject: [TYPES/announce] CICM 2011: Final Call for Papers Message-ID: <41F18BF2A15744F2D62DC4D7@[10.71.197.206]> Mar 3: Registration/abstract deadline (required for all tracks) Mar 11: Full paper deadline --- Conference on Intelligent Computer Mathematics (CICM) Bertinoro, Forli (Italy), 18-23 July 2011 http://cicm11.cs.unibo.it Track A: Mathematical Knowledge Management (MKM) Track B: Calculemus Track C: Systems & Projects In addition to the formal tracks above, CICM has historically had associated workshops, and workshop proposals should be sent to the CICM PC Chair (J.H.Davenport at bath.ac.uk), DEFINITELY by the end of February 2011. Mathematical Knowledge Management is an innovative field at the intersection of mathematics, computer science, library science, and scientific publishing. Its development is driven, on the one hand, by new technological possibilities which computer science, the Internet, and intelligent knowledge processing offer, and, on the other hand, by the increasing demand by engineers and scientists for new techniques to help in producing, transmitting, consuming, and managing sophisticated mathematical knowledge. Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. Common to MKM and Calculemus is a need for their solutions to be implemented and applied. Hence there will also be a "Systems and Projects" track. It aims to provide a broad overview of the developed systems, projects, ideas, and interests of the CICM community. The track welcomes two-page abstracts about fresh systems and projects related to mathematical knowledge management (MKM) and Calculemus topics, and about progress on existing systems and projects. After successfully colocating as the Conference of Intelligent Computer Mathematics (CICM), MKM and Calculemus will formally join for CICM 2011. CICM seeks original high-quality submissions in their tracks and the "Systems and Projects" track. The topics of interest include but are not limited to: ** MKM track ** * Representations of mathematical knowledge * Repositories of formalized mathematics * Mathematical digital libraries * Diagrammatic representations * Multi-modal representations * Mathematical OCR * Mathematical search and retrieval * Deduction systems * Math assistants, tutoring and assessment systems * Authoring languages and tools * MathML, OpenMath, and other mathematical content standards * Web presentation of mathematics * Data mining, discovery, theory exploration * Computer algebra systems * Collaboration tools for mathematics * Challenges and solutions for mathematical workflows ** Calculemus track ** * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Theory exploration techniques * Input languages, programming languages, types and constraint languages, and modeling languages for mechanised mathematics systems (PA, CAS, and ATP). * Infrastructure for mathematical services ** Systems and Projects track ** * Systems addressing the MKM and Calculemus topics * Projects and long-term visions addressing the MKM and Calculemus topics Papers on other topics closely related to the above research areas will also be welcomed for consideration. ***** Submission ***** CICM seeks both formal and work-in-progress submissions. Formal submissions to tracks A or B must not exceed 15 pages and will be reviewed by blind peer review 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 two 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 two 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. Selected formal submissions from all tracks will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. In addition to these formal proceedings, authors are permitted and encouraged to publish the final versions of their papers on arXiv.org. Work-in-progress submissions are intended to provide a forum for the presentation of original work that is not (yet) in a suitable form for submission as a full or system description paper. This includes work in progress and emerging trends. Their size is not limited, but we recommend 5 - 10 pages. The programme committee may 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 the Springer's LNCS series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html). By submitting a paper the authors agree that if it is accepted at least one of the authors will attend the conference to present it. The web page for electronic submission is: http://www.easychair.org/conferences/?conf=cicm11 <--- not 2011 ***** Important Dates ***** For formal submissions: Abstract submission: March 03, 2011 Submission deadline: March 11, 2011 Reviews sent to authors: April 07, 2011 Rebuttals due: April 14, 2011 Notification of acceptance: April 21, 2011 Camera ready copies due: May 09, 2011 For work-in-progress submissions: Abstract submission: April 30, 2011 Submission deadline: May 7, 2011 Notification of acceptance: May 30, 2011 Camera ready copies due: June 7, 2011 ***** Programme Committee ***** General chair: James Davenport (University of Bath) ** MKM track ** Florian Rabe (Jacobs University, Bremen) Chair Laurent Bernardin (Maplesoft) Thierry Bouche (Joseph Fourier University, Grenoble) Simon Colton (Imperial College) Patrick Ion (American Mathematical Society) Johan Jeuring (University of Utrecht) Fairouz Kamareddine (Heriot-Watt University) Manfred Kerber (University of Birmingham) Andrea Kohlhase (DFKI Bremen) Paul Libbrecht (University of Saarbruecken) Bruce Miller (National Institute of Science and Technology) Adam Naumowicz (University of Bialystok) Claudio Sacerdoti Coen (University of Bologna) Petr Sojka (Masaryk University) Volker Sorge (University of Birmingham) Masakazu Suzuki (Kyushu University) Enrico Tassi (INRIA) Makarius Wenzel (University of Paris-South) Freek Wiedijk (Radboud University Nijmegen) ** Calculemus track ** William Farmer (McMaster University, Canada) Chair Thorsten Altenkirch (Nottingham University) Serge Autexier (DFKI Bremen) Christoph Benzmueller (Articulate Software) Anna Bigatti (University of Genoa) Herman Geuvers (Radboud University Nijmegen) Deepak Kapur (University of New Mexico) Cezary Kaliszyk (University of Tsukuba) Assia Mahboubi (Ecole Polytechnique) Francisco-Jesus Martin-Mateos(University of Seville) Russell O'Connor (INRIA and McMaster University) Grant Passmore (University of Cambridge and University of Edinburgh) Silvio Ranise (Fondazione Bruno Kessler) Alan Sexton (University of Birmingham) Adam Strzebonski (Wolfram Research) ** Systems and Projects Track ** Josef Urban (Radboud University Nijmegen) Chair Andrea Asperti (University of Bologna) Michael Beeson (San Jose State University) Jacques Carette (McMaster University) Michael Kohlhase (Jacobs University, Bremen) Christoph Lange (Jacobs University, Bremen) Piotr Rudnicki (University of Alberta) and members of the MKM and Calculemus programme committees More details are at http://cicm11.cs.unibo.it From Francois.Fages at inria.fr Tue Mar 1 09:15:31 2011 From: Francois.Fages at inria.fr (Francois Fages) Date: Tue, 01 Mar 2011 15:15:31 +0100 Subject: [TYPES/announce] CMSB 2011: call for papers Message-ID: <4D6CFF83.4050103@inria.fr> (Apologies if you receive multiple copies of this message) ================================================================ First call for papers CMSB 2011 9th Int. Conference on Computational Methods in Systems Biology September 21-23 2011 Institut Henri Poincar? Paris, France http://contraintes.inria.fr/CMSB11/ ================================================================ CMSB 2011 solicits original research articles on the analysis of biological systems, networks, and data. The Conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological processes. Topics of interest include, but are not limited to: original models or paradigms for modelling biological processes together with their application domains; frameworks and techniques for verifying, validating, analyzing, and simulating biological systems; high-performance computational systems biology (this year the HiBi workshop is merged into CMSB); inference from high-throughput experimental data; model integration from biological databases; model reduction methods; multi-scale models; control of biological systems. Contributions on modelling and analysis of relevant biological case studies are especially encouraged. INVITED TALKS Pedro Mendes, University of Manchester, UK Denis Thieffry, Ecole Normale Sup?rieure, Paris, France IMPORTANT DATES Abstract submission: April, 29 Paper submission: May, 6 Notification: June, 17 Camera-ready version: July, 1 PROGRAM COMMITTEE Fran?ois Fages (Chair) - INRIA Paris?Rocquencourt, France Paolo Ballarini - INRIA Rennes Bretagne Atlantique, France Gilles Bernot - University of Nice Sophia Antipolis, France Alexander Bockmayr - Freie Universit?t Berlin, Germany Vincent Danos - University of Edinburgh, United Kingdom Pierpaolo Degano - University of Pisa, Italy Diego Di Bernardo - TIGEM, Naples, Italy Finn Drablos - NTNU, Norway Jerome Feret - INRIA - ?cole Normale Sup?rieure, France Jasmin Fisher - Microsoft Research Cambridge, United Kingdom Stephen Gilmore - University of Edinburgh, United Kingdom Monika Heiner - Brandenburg University of Technology, Cottbus, Germany Jane Hillston - University of Edinburgh, United Kingdom Ina Koch - Goethe University Frankfurt am Main, Germany Marta Kwiatkowska - Trinity College, University of Oxford, United Kingdom Christopher Langmead - Carnegie Mellon University, Pittsburgh, USA Oded Maler - CNRS Verimag, Grenoble, France Tommaso Mazza - CIBIO / University of Trento, Italy Pedro Mendes, University of Manchester, United Kingdom Bud Mishra - Courant Institute and NYU School of Medicine, New York, USA Satoru Miyano - University of Tokyo, Japan Ion Petre - ?bo Akademi University, Finland Corrado Priami - CoSBi / Microsoft Research, University of Trento, Italy Ovidiu Radulescu - Universit? de Montpellier 2, France Olivier Roux - IRCCyN / ?cole Centrale de Nantes, France Carolyn Talcott - SRI International, Menlo Park CA, USA Denis Thieffry - ?cole Normale Sup?rieure, Paris, France Johannes H.G.M. Van Beek - Vrije Universiteit, Netherlands Verena Wolf - Saarland University, Saarbr?cken, Germany AWARDS The Program Committee of CMSB 2011 will give two best paper awards: one Best Student Paper Award and one NVIDIA Best Paper Award. The Best Student Paper Award recipient is given public recognition and receives an award of 500 US$ from the IEEE Technical Committee on Simulation (TCSIM). For a paper to qualify for the Best Student Paper award, a student must be the lead author, the submission must be done in the student paper category and the student must present the paper at the conference. The NVIDIA Best Paper Award recipient is given public recognition and receives one high end Tesla GPU equipment of a value of 3,999 US$ donated by NVIDIA. Any paper on any topic of CMSB can qualify for this award provided the submission indicates the NVIDIA Best Paper Award category. ORGANISING COMMITTEE Gr?gory Batt, Fran?ois Fages, Dragana Jovanovska, Ramon Martin, Thierry Martinez, Sylvain Soliman - INRIA Paris?Rocquencourt, France. VENUE The Institute Henri Poincar? (IHP) is in the Latin district in the center of Paris, near the Luxembourg garden. SUBMISSION GUIDELINES see http://contraintes.inria.fr/CMSB11 From manuel.mazzara at newcastle.ac.uk Tue Mar 1 09:35:00 2011 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Tue, 1 Mar 2011 14:35:00 +0000 Subject: [TYPES/announce] INTRUSO 2011 CFP Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA305A1BB27112@EXSAN01.campus.ncl.ac.uk> INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM'11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this "service revolution" will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general "rigorous software development" might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks.), service dependability, service evaluation/monitoring/testing, etc., a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific 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. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, .) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. 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. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We already agreed with the editor of an international journal to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra at imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas at oracle.com * Fabio Massacci, University of Trento, Italy - massacci at disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara at newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montr?al, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep K?ngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hern?n Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA From jv at informatik.uni-bonn.de Tue Mar 1 12:46:06 2011 From: jv at informatik.uni-bonn.de (=?UTF-8?B?SmFuaXMgVm9pZ3Rsw6RuZGVy?=) Date: Tue, 01 Mar 2011 18:46:06 +0100 Subject: [TYPES/announce] CFP WFLP 2011 Message-ID: <4D6D30DE.7080103@informatik.uni-bonn.de> =============================================================================== Call for Papers 20th International Workshop on Functional and (Constraint) Logic Programming WFLP 2011 Odense, Denmark July 19, 2011 Co-located with PPDP 2011, LOPSTR 2011, AAIP 2011 http://www.wi.uni-muenster.de/pi/konferenzen/wflp2011/wflp2011.htm =============================================================================== Conference Overview: The 20th International Workshop on Functional and (Constraint) Logic Programming will take place in July 2011 in Odense, Denmark. The Workshop on Functional and (Constraint) Logic Programming aims at bringing together researchers interested in functional programming, (constraint) logic programming, as well as the integration of the two paradigms. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications and combinations of high-level, declarative programming languages and related areas. WFLP 2011 solicits papers in all areas of functional and (constraint) logic programming, including but not limited to: ? Foundations: formal semantics, rewriting and narrowing, non-monotonic reasoning, dynamics, type theory ? Language Design: modules and type systems, multi-paradigm languages, concurrency and distribution ? Implementation: abstract machines, parallelism, compile-time and run-time optimizations, interfacing with external ? Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, meta-programming ? Software Engineering: design patterns, specification, verification and validation, debugging, test generation ? Integration of Paradigms: integration of declarative programming with other paradigms such as imperative, object-oriented, concurrent, and real-time programming ? Applications: declarative programming in education and industry, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, knowledge representation and machine learning, deductive databases, advanced programming environments and tools The previous WFLP editions were: WFLP 2010 (Madrid, Spain), WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). This year the workshop will be colocated with the 13th International Symposium on Principles and Practice of Declarative Programming (PPDP 2011), the 22st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011), and the International Workshop on Approaches and Applications of Inductive Programming (AAIP 2011). Proceedings: The proceedings will be published in the LNCS series of Springer-Verlag. Important Dates: Submission of abstract: April 9, 2011 Paper submission: April 10, 2011 Notification: May 1, 2011 Camera-ready: May 10, 2011 Workshop: July 19, 2011 Submission Guidelines: Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted via the submission website for WFLP 2011 at http://www.wi.uni-muenster.de/pi/konferenzen/wflp2011/wflp2011.htm Papers should consist of up to 15 pages under the LNCS formatting guidelines. These guidelines are available at http://www.springer.com/computer/lncs/ (follow link for LNCS authors) along with formatting templates and style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Program Committee: Mar?a Alpuente Universidad Polit?cnica de Valencia, Spain Sergio Antoy Portland State University, USA Rafael Caballero Rold?n Universidad Complutense, Madrid, Spain Olaf Chitil University of Kent, UK Rachid Echahed Institut IMAG - Laboratoire Leibniz, France Santiago Escobar Universidad Polit?cnica de Valencia, Spain Moreno Falaschi University of Siena, Italy Sebastian Fischer National Institute of Informatics, Tokyo, Japan Michael Hanus Christian-Albrechts-Universit?t zu Kiel, Germany Herbert Kuchen (chair) Westf?lische Wilhelms-Univ. M?nster, Germany Julio Mari?o y Carballo Universidad Polit?cnica de Madrid, Spain Janis Voigtl?nder Universit?t Bonn, Germany Contact: Herbert Kuchen (kuchen at uni-muenster.de) From gaboardi at cs.unibo.it Tue Mar 1 17:34:12 2011 From: gaboardi at cs.unibo.it (Marco Gaboardi) Date: Tue, 1 Mar 2011 23:34:12 +0100 Subject: [TYPES/announce] Oregon Programming Languages Summer School 2011 - Second Call For Participation Message-ID: <4F364806-BB80-43F0-960A-977A688B2552@cs.unibo.it> ---------------------------------------------------------------------- Second Call For Participation Types, Semantics and Verification 10th Annual Oregon Programming Languages Summer School (OPLSS 2011) University of Oregon, Eugene. June 16 - July 1, 2011 http://www.cs.uoregon.edu/Activities/summerschool/ => Registration Deadline: March 4, 2011 ---------------------------------------------------------------------- The focus of this summer school is the mix or interplay of theory and practice in program verification. The main aim is to enable participants to conduct research in the area, thereby contributing to improve software quality. The Oregon Programming Languages Summer School (OPLSS) has been held at the University of Oregon each summer since 2002. This year, in the occasion of the tenth anniversary of the summer school, two plenary lectures will complement the technical program. ---------------------------------------------------------------------- Technical Program Logical Relations Amal Ahmed - Indiana University Software Verification Andrew Appel - Princeton University Monadic Effects Nick Benton - Microsoft Research Metamathematics of Polymorphic Logics - applications Robert Constable - Cornell University Polarization and Focalization Pierre-Louis Curien - pi.r2 team, PPS, CNRS-Paris Diderot University- INRIA Type Theory Foundation Robert Harper - Carnegie Mellon University The Calculus of Inductive Constructions Hugo Herbelin - pi.r2 team, PPS, CNRS-Paris Diderot University-INRIA Compiler Certification Xavier Leroy - INRIA Programming languages in string diagrams Paul-Andre' Mellies - PPS, CNRS-Paris Diderot University Imperative Programming in Coq Greg Morrisett - Harvard University Proof Theory Foundation Frank Pfenning - Carnegie Mellon University Proof Theory in Coq Benjamin Pierce - University of Pennsylvania Semilattices, Domains, and Computability Dana Scott - Carnegie Mellon University - Berkeley University ---------------------------------------------------------------------- Plenary Lectures: Speaker: Dana Scott (Carnegie Mellon University and Berkeley University) Title: What is a Proof? -- Some Challenges for Automated Theorem Proving Speaker: Robert Constable (Cornell University) Title: Metamathematics of Polymorphic Logics - foundations ---------------------------------------------------------------------- Registration Full information on registration are available at: http://www.cs.uoregon.edu/Activities/summerschool/ Registration Deadline: March 4, 2011 ---------------------------------------------------------------------- Some further activities will complement the main program. Coq-labs: Some of the lectures will assume interactive sessions using the interactive proof assistant Coq. Students are encouraged to bring a laptop on which Coq has been installed, and to form small working group during the interactive sessions. Moreover, some Coq-labs will be offered in order to give the participants the opportunity of make more practice in using Coq. Student Sessions: Interested students will have the opportunity to present their work during special sessions. Each presentation will consist of a brief talk about the student research interests and results. These sessions will be an occasion for students to obtain useful feedback on their work by other students and researchers, and also to interact with participants having similar research interests. We hope to see you in Eugene. Zena Ariola Pierre-Louis Curien Marco Gaboardi Robert Harper Hugo Herbelin From kutsia at risc.uni-linz.ac.at Wed Mar 2 06:41:28 2011 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Wed, 02 Mar 2011 12:41:28 +0100 Subject: [TYPES/announce] Last CfP: JAL Special Issue on Automated Specification and Verification of Web Systems Message-ID: <4D6E2CE8.80405@risc.uni-linz.ac.at> [Apologies for multiple copies] ======================================================================== JOURNAL OF APPLIED LOGIC Special Issue on Automated Specification and Verification of Web Systems http://www.risc.uni-linz.ac.at/people/tkutsia/jal-wwv.html ======================================================================== SCOPE ----- This special issue of the Journal of Applied Logic is related to the topics of the workshop WWV'10: Automated Specification and Verification of Web Systems, which took place in Vienna on July 30-31, 2010. Both participants of the workshop and other authors are invited to submit contributions. The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit original papers on logic-based methods and techniques applied to Web sites, Web services or Web-based applications, such as: * Rule-based approaches to Web systems analysis, certification, specification, verification, and optimization * Algebraic methods for verification and certification of Web systems * Formal models for describing and reasoning about Web systems * Model-checking, synthesis and debugging of Web systems * Abstract interpretation and program transformation applied to the semantic Web * Intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications SUBMISSION ---------- We expect original articles (typically 15-25 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published and that must not be simultaneously submitted for publication elsewhere. Submissions must comply with JAL's author guidelines. They must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are encouraged via the EasyChair submission system: http://www.easychair.org/conferences/?conf=jalwwv2010. IMPORTANT DATES --------------- * Submission of papers: March 7, 2011. * Notification: June 6, 2011. GUEST EDITORS -------------- * Laura Kov?cs (Vienna University of Technology) * Temur Kutsia (RISC, Johannes Kepler University Linz) From james.cheney at gmail.com Wed Mar 2 10:38:42 2011 From: james.cheney at gmail.com (James Cheney) Date: Wed, 2 Mar 2011 15:38:42 +0000 Subject: [TYPES/announce] CFP for First Workshop on Compilers by Rewriting, Automated (COBRA) 2011 Message-ID: CALL FOR PAPERS COBRA 2011 "First Workshop on Compilers by Rewriting, Automated" http://www.rdp2011.uns.ac.rs/workshops/cobra.html Sunday, May 29, 2011 COBRA is a new workshop intended to promote research in and collaboration on in the application of rewriting to compilers across academia and industry. We hope to provide a forum for presentation, exchange, and discussion, of directions, developments, and results, as well as surveys, tutorials, experience reports, and proposals, for what is possible in this area! The basic idea is that rewriting can be used to transform programs, and indeed is used in that many compilers include some kind of rewrite engine to realize optimizations such as algebraic rewrites, SSA tree rewrites, type inference, static reduction, etc. In this workshop it is our hope that focusing on the rewrite transformations as proper rewrite systems with formal rewrite rules can help us understand how we can give access to generic formal rewriting techniques in a way that can be directly exploited by the compiler writer without sacrificing performance and expressiveness of the analyses and transformations. The workshop will take place on Sunday, May 29, 2011, in Novi Sad, Serbia, colocated with the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011) as a satellite event of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2011). TOPICS We invite submissions in the form of extended abstracts on the following topics: * Issues on using in algebraic, rewriting, logic, and other formal notations, as compiler specification languages. * Formal notations for specifying specific compiler components such as normalization, intermediate languages, translation schemes, analysis, optimization, static reductions, code generation, data flow analysis. * The role of type and sort systems in compiler specifications. * The benefits and difficulties of higher order and first order formalisms in compiler specifications; the use of higher order abstract syntax and other encodings of binders. * Formal code generation issues such as typed assembly language. * How to generate efficient and even industrial strength compilers fully automatically from the specifications; how to deal with large sets of rewrite rules. * The development cycle for generated compilers including issues of development environments and debugging of formal compiler specifications. * Position papers on whether compiler generation based on rewriting can become a factor in mainstream compiler writing in industry and academia. * Experience reports on and demonstrations of compilers based on formal rewrite systems using systems such as ASF+SDF, IMP, Rascal, MetaPRL, Coq, or even ANTLR TreeGrammars. * System descriptions for new or extended systems used to build rewrite components of compilers, including systems that are themselves compilers for rewrite systems or other formalisms used to specify compilers. * Presentations of how certain stages of existing compilers could be specified as formal rewrite systems. Submissions should be no more than 6 pages and uploaded to http://www.easychair.org/conferences/?conf=cobra2011; if possible please use the LaTeX style from http://www.easychair.org/easychair.zip. IMPORTANT DATES * Last day for submissions: Monday, March 21, 2011. * Notification: Monday, April 4, 2011. * Preliminary proceedings version due: Wednesday, April 20, 2011. * Workshop: Sunday, May 29, 2011. SELECTION COMMITTEE * Kristoffer H. Rose (IBM Thomas J. Watson Research Center, chair) * James Cheney (University of Edinburgh) * Kevin Millikin (Google) For further information see the links on the conference web site, http://www.rdp2011.uns.ac.rs/workshops/cobra.html, or contact Kristoffer H. Rose, krisrose at us.ibm.com. From shilov at iis.nsk.su Wed Mar 2 23:33:28 2011 From: shilov at iis.nsk.su (shilov at iis.nsk.su) Date: Thu, 3 Mar 2011 10:33:28 +0600 Subject: [TYPES/announce] PSSV: final CFP & deadline extension (St. Petersburg, Russia). Message-ID: <1B93E28361C649AC9C83F3481E062681@fitmobile01> The Second Workshop on Program Semantics, Specification and Verification: Theory and Applications (PSSV 2011, http://logic.pdmi.ras.ru/csr2011/ppsv2011) affiliated with 6th International Computer Science Symposium in Russia (CSR-2011), will be held on June 12-13, 2011 in St. Petersburg, Russia. It will be the second edition of the workshop. The first inaugural workshop PSSV-2010 took place June 14-15, 2010 in Kazan, Russia as a part of 5th International Computer Science Symposium in Russia (CSR-2010). =========================================== Important dates: Extended abstract submission: March 10, 2011 Notification: April 04, 2011 =========================================== Official language: English =========================================== Scope and Topics List of topics of interest includes (but is not limited to): * formalisms for program semantics (e.g. Abstract State Machines); * formal models and semantics of programs and systems (e.g. labeled transition systems); * semantics of programming and specification languages (e.g. axiomatic semantics); * formal description techniques (e.g. SDL); * logics for formal specification and verification (e.g. temporal logic); * deductive program verification (e.g. verification conditions and automatic invariant generation); * automatic theorem proving (e.g. combinations of decidable theories); * model checking of programs and systems (e.g. verification of finite-state protocol models); * static analysis of programs; * formal approach to testing and validation (e.g. automatic test generation); * program analysis and verification tools. Research, work in progress and position papers are welcome. =========================================== Program Chairs * Valery Nepomniaschy (Institute of Informatics Systems, Novosibirsk, Russia, vnep at iis.nsk.su) * Valery Sokolov (Yaroslavl State University, Yaroslavl, Russia, sokolov at uniyar.ac.ru) Program Committee: * Natasha Alechina (University of Nottingham, UK), * Sergey Baranov (St. Petersburg State Polytech. University, Russia), * Alexander Bolotov (University of Westminster, UK), * Michael Dekhtyar (Tver State University , 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), * Alexander Letichevsky (Glushkov Institute of Cybernetics, Kiev, Ukraine), * Alexei Lisitsa (University of Lliverpool), * 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-2011" to Alexei Promsky (promsky at iis.nsk.su) and their short 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. From colin.riba at ens-lyon.fr Fri Mar 4 13:07:42 2011 From: colin.riba at ens-lyon.fr (Colin RIBA) Date: Fri, 04 Mar 2011 19:07:42 +0100 Subject: [TYPES/announce] CHOCO meeting & Differential Linear Logic course - 4th to 7th April 2011, Lyon, France Message-ID: <1299262062.2897.316.camel@acalou.lip.ens-lyon.fr> Dear all, [Apologies for multiple copies] CALL FOR PARTICIPATION & CONTRIBUTED TALKS for the final meeting of the French ANR project Choco http://choco.pps.jussieu.fr/event32/ The meeting will take in place in ENS de Lyon, France from Monday 4th April to Thursday 7th April 2011. ================================================= There will invited talks, a course on differential linear logic and few sessions of contributed talks. We are pleased to announce invited talks by - Richard Blute (Ottawa, CA) - Daniel Leivant (Indiana University, USA) - Glynn Winskel (Cambridge, UK) The course on Differential Linear Logic will be made of 5 sessions of 1h30 : - Models (2 sessions) : T. Ehrhard (PPS, CNRS & Paris 7) and L. Vaux (IML, Marseille) - Differential Nets & Lambda-Calculus (2 sessions) : M. Pagani (LIPN, Paris 13) and P. Tranquilli (LIP, ENS de Lyon) - Uniformity and Taylor expansion (1 session) L. Regnier (IML, Marseille) More details about contents of invited talks and schedule will be added to the Choco web page when available. PRELIMINARY SCHEDULE ==================== http://tinyurl.com/6j4pp6v CONTRIBUTED TALKS ================= If you want to give a talk please contact me before the 18th of March. Slots will be attributed on a first asked first served basis. REGISTRATION ============ There is no registration fee, but an informal registration (by sending me an email) is required by the 25th of March. Practical informations on how to come in ENS de Lyon and on accomodation in Lyon are available here : http://www.ens-lyon.fr/LIP/web/index.php?option=com_content&view=article&id=48&Itemid=54 IMPORTANT DATES =============== Talk submission : March 18th Participation : March 25th Meeting : April 4th to 7th From chpkim at cs.utexas.edu Sat Mar 5 03:44:04 2011 From: chpkim at cs.utexas.edu (Chang Hwan Peter Kim) Date: Sat, 05 Mar 2011 02:44:04 -0600 Subject: [TYPES/announce] GPCE 2011 Call for Papers Message-ID: <20110305024404.mke5dtdpw8048w4k@webmail.utexas.edu> ------------------------------------------------------------------------ CALL FOR PAPERS Tenth International Conference on Generative Programming and Component Engineering (GPCE 2011) October 22-23, 2011 Portland, Oregon, USA (collocated with SPLASH 2011) http://www.gpce.org http://www.facebook.com/GPCEConference http://twitter.com/GPCECONF LinkedIn: GPCE (http://tinyurl.com/48eoovb) ------------------------------------------------------------------------ IMPORTANT DATES * Submission of abstracts: Monday, May 16, 2011 * Submission of papers: Sunday, May 22, 2011 * Paper notification: Wednesday, July 6, 2011 * Submission of tech talks: Sunday, August 7, 2011 SCOPE Generative and component approaches are revolutionizing software development just as automation and componentization revolutionized manufacturing. Key technologies for automating program development are Generative Programming for program synthesis, Component Engineering for modularity, and Domain-Specific Languages (DSLs) for compact problem-oriented programming notations. The International Conference on Generative Programming and Component Engineering is a venue for researchers and practitioners interested in techniques that use program generation and component deployment to increase programmer productivity, improve software quality, and shorten the time-to-market of software products. In addition to exploring cutting-edge techniques of generative and component-based software, our goal is to foster further cross-fertilization between the software engineering and the programming languages research communities. SUBMISSIONS Research papers: 10 pages in SIGPLAN proceedings style (sigplanconf.cls, see http://www.sigplan.org/authorInformation.htm) reporting original and unpublished results of theoretical, empirical, conceptual, or experimental research that contribute to scientific knowledge in the areas listed below (the PC chair can advise on appropriateness). Tool demonstrations: Tool demonstrations should present tools that implement generative and component-based software engineering techniques, and are available for use. Any of the GPCE'11 topics of interest are appropriate areas for tool demonstrations. Purely commercial tool demonstrations will not be accepted. Submissions should contain a tool description of up to 6 pages in SIGPLAN proceedings style (sigplanconf.cls) and a demonstration outline of up to 2 pages text plus 2 pages screen shots. The six page description will, if the demonstration is accepted, be published in the proceedings. The 2+2 page demonstration outline will only be used by the PC for evaluating the submission. Workshops and tech talks: Workshops are organized by SPLASH - see the SPLASH website for details (http://splashcon.org). Tech talks are organized by GPCE as one or two talks at the end of each day of the conference. The talks will be about an hour in length and, similarly to tutorials, do not (need to) present original new research material. Unlike longer tutorials, these talks cannot be very interactive, and should instead aim to be 'keynote' style presentations. Please see the tech talks call for contributions at www.gpce.org for details. TOPICS GPCE seeks contributions in software engineering and in programming languages related (but not limited) to: * Generative programming o Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, step-wise refinement, generic programming, automated code generation o Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, program transformation o Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection * Generative techniques for o Product-line architectures o Distributed, real-time and embedded systems o Model-driven development and architecture o Resource bounded/safety critical systems. * Component-based software engineering o Reuse, distributed platforms and middleware, distributed systems, evolution, patterns, development methods, deployment and configuration techniques, formal methods * Integration of generative and component-based approaches * Domain engineering and domain analysis o Domain-specific languages including visual and UML-based DSLs * Separation of concerns o Aspect-oriented and feature-oriented programming, o Intentional programming and multi-dimensional separation of concerns * Applications of the above in industrial scenarios or to real-world problems, bridging the gap between theory and practice * Empirical studies o Original work in any of the areas above where there is a substantial empirical dimension to the work being presented. Such contributions might take the form of a case/field study, comparative analysis, controlled experiment, survey or meta-analysis of previous studies. Incremental improvements over previously published work should have been evaluated through systematic, comparative, empirical, or experimental evaluation. Submissions must adhere to SIGPLAN's republication policy (http://www.sigplan.org/republicationpolicy.htm). Please contact the program chair if you have any questions about how this policy applies to your paper (chairs at gpce.org). ORGANIZATION Chairs (chairs at gpce.org) General Chair: Ewen Denney (SGT/NASA Ames, USA) Program Chair: Ulrik Pagh Schultz (Univ. of Southern Denmark, Denmark) Publicity Chair: Chang Hwan Peter Kim (Univ. of Texas at Austin, USA) Program Committee * Andrzej Wasowski (IT University of Copenhagen, Denmark) * Aniruddha Gokhale (Vanderbilt University, USA) * Bernd Fischer (University of Southampton, UK) * Bruno C. d. S. Oliveira (Seoul National University, Korea) * Christian Kaestner (Philipps Universitat Marburg, Germany) * Chung-Chieh Shan (Rutgers, The State University of New Jersey, USA) * Don Batory (University of Texas at Austin, USA) * Eli Tilevich (Virginia Tech, USA) * Eric Tanter (University of Chile, Chile) * Gorel Hedin (Lund Institute of Technology, Sweden) * Ina Schaefer (TU Braunschweig, Germany) * Jeremiah Willcock (Indiana University, USA) * Jeremy Siek (University of Colorado at Boulder, USA) * Jurgen Vinju (Centrum Wiskunde en Informatica, The Netherlands) * Lionel Seinturier (University of Lille, France) * Marjan Mernik (University of Maribor, Slovenia) * Mat Marcus (Adobe Systems, USA) * Nicolas Loriant (INRIA, France) * Ras Bodik (University of California at Berkeley, USA) * Robert Gluck (University of Copenhagen, Denmark) * Steffen Zschaler (King's College London, UK) * Tudor Girba (netstyle.ch, Switzerland) * Walter Binder (University of Lugano, Switzerland) * Yanhong A. Liu (State University of New York at Stony Brook, USA) From dario.dellamonica at uniud.it Sat Mar 5 05:44:45 2011 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Sat, 05 Mar 2011 11:44:45 +0100 Subject: [TYPES/announce] GandALF 2011: 3rd Call For Papers Message-ID: <4D72141D.4020902@uniud.it> [We apologize if you have received multiple copies of this message] ******************************************************************************** --------------------- GandALF 2011 ------------------------ ******************************************************************************** Second International Symposium on Games, Automata, Logics, and Formal Verification Minori, Amalfi Coast, Italy, June 15-17, 2011 http://gandalf.dia.unisa.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 concrete applications, and to stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. INDICATIVE LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Logical aspects of Computational Complexity 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 Game Theory Hybrid, Embedded, and Mobile Systems Verification Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Program Analysis and Software Verification Specification and Verification of Finite and Infinite-state Systems Synthesis and Execution 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 March 13, 2011 Paper submission March 20, 2011 Acceptance notification April 22, 2011 Final version May 15, 2011 Conference June 15-17, 2011 INVITED SPEAKERS Thomas Colcombet (CNRS, Paris FRANCE) Erich Graedel (RWTH Aachen University, GERMANY) Moshe Vardi (Rice University, Houston USA) 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 last GandALF (GandALF 2010) will be published as a special issue of the International Journal of Foundation of Computer Science (http://www.cs.ucsb.edu/~ijfcs/). INFO Please visit the conference website (http://gandalf.dia.unisa.it) for more information. GENERAL CHAIR Angelo Montanari (University of Udine, ITALY) PROGRAM CHAIRS Giovanna D'Agostino (University of Udine, ITALY) Salvatore La Torre (University of Salerno, ITALY) PROGRAM COMMITTEE Krishnendu Chatterjee (Inst. of Science and Tech, AUSTRIA) Swarat Chaudhuri (Pennsylvania State University, USA) Giorgio Delzanno (University of Genova, ITALY) Javier Esparza (Technische Universitat Munchen, GERMANY) Eric Graedel (RWTH Aachen University, GERMANY) Neil Immerman, (University of Massachusetts, USA) Wojtek Jamroga (University of Luxembourg, LUXEMBOURG) Vineet Kahlon, (NEC Labs, Princeton, USA) Martin Leucker (University of Lubeck, GERMANY) Jerzy Marcinkowski (University of Wroclaw, POLAND) Aniello Murano (University of Napoli "Federico II", ITALY) Mimmo Parente (University of Salerno, ITALY) Gabriele Puppis (Oxford University, UK) Alexander Rabinovich (Tel Aviv University, ISRAEL) Jean Francois Raskin (University of Bruxelles, BELGIUM) Colin Stirling (University of Edinburgh, UK) Tayssir Touili (University Paris Diderot, FRANCE) Yde Venema (ILLC, University of Amsterdam, HOLLAND) Bow-Yaw Wang (INRIA, FRANCE and Tsinghua University, CHINA) Igor Walukiewicz (LaBRI, University of Bordeaux1, FRANCE) 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) ORGANIZING COMMITTEE Marco Faella, chair (Universit? di Napoli "Federico II", Italy) Dario Della Monica (Universit? di Salerno, Italy) Stefano Minopoli (Universit? di Napoli "Federico II", Italy) -- Dario Della Monica, Research Associate University of Salerno - Dipartimento di Informatica e Applicazioni "R. M. Capocelli" Via Ponte don Melillo - 84084 Fisciano (SA) - Italy phone: (+39) 089 969318 cell: (+39) 328 2477327 fax: (+39) 089 969600 email: dario.dellamonica [at] uniud.it web site: http://www.dia.unisa.it/dottorandi/dario.dellamonica/ From pmt6sbc at maths.leeds.ac.uk Sat Mar 5 11:56:44 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Sat, 5 Mar 2011 16:56:44 +0000 (GMT) Subject: [TYPES/announce] CiE 2011 - Call for Informal Presentations Message-ID: _________________________________________________________________ Call for Informal Presentations CiE 2011: Computability in Europe Models of Computation in Context Sofia, Bulgaria 27 June 2011 - 2 July 2011 http://cie2011.fmi.uni-sofia.bg/ _____________________________________________________________________ There is a remarkable difference in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-conference proceedings is not able to accommodate this form of scientific communication. Continuing the tradition of past CiE conferences, this year's CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and one page) by the DEADLINE: MAY 15, 2011 Please submit your abstract electronically, via EasyChair, selecting the category "Informal Presentation". You will be notified whether your talk has been accepted for informal presentation usually within a week after your submission, so if you intend to apply for ASL Student Travel Awards you should submit your abstract before March 27, 2011. Let us remind you that we are planning several post-conference publications, which will contain full articles of selected CiE 2011 presentations, including informal presentations. GRANTS: Grants for students, members of the ASL: Students who are members of the ASL may apply for ASL travel support. Applications have to be addressed directly to the ASL, see their web-site on student travel awards for more information. The deadline for applying for an ASL grant is March 27, 2011, applying earlier is encouraged. NSF Grants for young U.S. participants: The National Science Foundation of the United States is providing travel support targeted at junior researchers and students from the U.S. Request for support should be sent to cenzer at ufl.edu by March 30, 2011. Preference will be given to those who are presenting papers at the conference. Students should provide a letter of support from their advisors. EMS grants for young East European Reserchers: Thanks to the generous support from EMS, CiE 2011 is glad to be able to offer partial or total fee waivers for a small number of Eastern European researchers (including from former Soviet Union), whose work has been accepted for presentation at CiE2011. Preference will be given to young researchers and researchers with papers accepted for LNCS. To apply, please send an application to cie2011 at fmi.uni-sofia.bg. The application should include name, affiliation and the title of the submission for CiE 2011. The deadline for application is April 30, 2011. Women in Computability: In 2011, we continue the programme "Women in Computability" (funded from 2008 to 2010 by the Elsevier Foundation) now supported by the journal "Annals of Pure and Applied Logic" (Elsevier). As part of this programme, we can offer four modest "Elsevier Women in Computability grants" for female graduate students or junior researchers. The grant will be paid as a reimbursement of up to 200 EUR of travel and accommodation expenses. More information about deadlines and the application process will become available in March 2011. All questions about the conference could be send at cie2011 at fmi.uni-sofia.bg ___________________________________________________________ Association Computability in Europe http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2011 http://cie2011.fmi.uni-sofia.bg CiE Membership Application Form http://www.cs.swan.ac.uk/acie ___________________________________________________________ From jonathan.aldrich at cs.cmu.edu Sat Mar 5 21:22:39 2011 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Sat, 05 Mar 2011 21:22:39 -0500 Subject: [TYPES/announce] SPLASH 2011: Call for Contributions Message-ID: <4D72EFEF.20500@cs.cmu.edu> SPLASH and its constituent conference (and predecessor) OOPSLA typically include a fair number of type system papers. OOPSLA and SPLASH are no longer focused explicitly on objects, so a broad variety of type systems work would be welcomed - Jonathan Aldrich ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'11) Portland, Oregon October 22-27, 2011 http://www.splashcon.org http://twitter.com/splashcon http://www.facebook.com/SPLASHCon Sponsored by ACM SIGPLAN Since 2010 SPLASH has been the umbrella conference for OOPSLA and Onward!. This year SPLASH features a third technical track, Wavefront, designed to publish innovative work closely related to advanced development and production software. The overall theme of the conference is "The Internet as the world-wide Virtual Machine." This theme captures the change in the order of magnitude of computing that happened over the past few years. /************************************************************** * CALL FOR CONTRIBUTIONS * **************************************************************/ SPLASH is now accepting submissions for a variety of tracks. We invite high quality submissions describing original and unpublished work. General technical tracks: * OOPSLA -- High quality research work that uses established scientific methodologies, written using high standards of academic technical publications. DEADLINE: April 8, 2011 See http://splashcon.org/2011/cfp/100 * Onward! -- Innovative ideas that challenge existing beliefs, or early work well written and well argued for; essays and ideas worth hearing about. DEADLINE: April 8, 2011 See http://onward-conference.org/2011/dates.html * Wavefront -- Work that has the potential for immediate impact in the practice of software, or descriptions of advanced development and production software, written using established guidelines for technical writing. Accepts full papers as well as extended abstracts. DEADLINE: April 8, 2011 http://splashcon.org/2011/cfp/101 Specialized tracks: * Demonstrations -- Applications and systems that show specific technologies in action, live. DEADLINE: June 24, 2011 See http://splashcon.org/2011/cfp/105 * Doctoral Symposium -- Doctoral proposals, both early- and mid-phase, to be reviewed and commented on by a panel of experts. DEADLINE: June 24, 2011 See http://splashcon.org/2011/cfp/103 * Educators' and Trainers' Symposium -- Topics of interest for developing curricula related to software training and education. DEADLINE: April 8, 2011 See http://splashcon.org/2011/cfp/106 * Experience Reports -- Work describing the use of specific software technologies and methodologies in real world settings. DEADLINE: April 8, 2011 See http://splashcon.org/2011/cfp/102 * Posters -- Forum for authors to present their work in an informal and interactive setting. DEADLINE: June 24, 2011 See http://splashcon.org/2011/cfp/108 Workshops: SPLASH is now accepting proposals for innovative, well-focused workshops on a broad spectrum of topics. DEADLINE: April 8, 2011 See http://splashcon.org/2011/cfp/104 Co-located events: * Dynamic Languages Symposium (DLS'11) http://www.dynamic-languages-symposium.org/dls-11/ * Generative Programming and Component Engineering (GPCE'11) http://program-transformation.org/GPCE11 * Pattern Languages of Programming (PLoP'11) http://hillside.net/index.php/conferences/plop * The Scheme Workshop 2011 http://scheme2011.ucombinator.org/ ORGANIZATION SPLASH General Chair: Cristina V. Lopes (UC Irvine) OOPSLA Program Chair: Kathleen Fisher (AT&T Labs) Onward! General Chair: Robert Hirschfeld (Hasso-Plattner Potsdam) Onward! Program Chair: Eelco Visser (Delft University of Tech.) Onward! Essays Chair: David West (New Mexico Highlands University) Wavefront Chair: Allen Wirfs-Brock (Mozilla) Demonstrations Chair: Igor Peshansky (IBM Research) Doctoral Symposium Chair: Jonathan Aldrich (CMU) Educators Symposium Chair: Eugene Wallingford (U. of Northern Iowa) Experience Reports Chair: Tim O'Connor (K12 Inc.) Panels Chair: Daniel Weinreb (ITA Software) Posters Chairs: Sushil Bajracharya (Black Duck Software) Eli Tilevich (Virginia Tech) Student Volunteers Chairs: Rochelle Elva (U. of Central Florida) Joel Ossher (UC Irvine) Tech Talks: Aino Corry (University of Aarhus) Workshops Chairs: Ademar Aguiar (FEUP) Ulrik Pagh Schultz (U. of Southern Denmark) Social Media: Michael Maximilien (IBM) Treasurer: William Cook (UT Austin) Proceedings Chair: Richard Gabriel (IBM Research) PDX.local: Andrew Black (Portland State U.) Content Management: Harry Baragar (Instantiated Software) Conference Management: Debra Brodbeck (UC Irvine) From carsten at itu.dk Mon Mar 7 10:33:58 2011 From: carsten at itu.dk (Carsten Schuermann) Date: Mon, 7 Mar 2011 10:33:58 -0500 Subject: [TYPES/announce] PhD Positions on Trustworthy Electronic Elections Message-ID: <69563635-E2CC-4894-B15E-797D74B1FA6A@itu.dk> PhD Positions on Trustworthy Electronic Elections (for more information see http://www.demtech.dk/) The IT University of Copenhagen invites applications for several PhD positions on developing and evaluating trustworthy electronic election technology. With this project, we try to prove that it is possible to modernize the democratic process using information technology without losing the trust of the voters. The PhD positions are concerned with different aspects of this research question, for example, how to design formal techniques to hold machines accountable for their actions, to run trusted code in untrusted environments, to develop software in a trust-preserving way, and to evaluate technology form a societal point of view. Applicants should have a strong background and interest in some combination of the following areas in computer science: cryptography, concurrency, epistemic logics, formal methods, information security, modal logics, operational semantics, programming languages, proof assistants, logical frameworks, requirement engineering, rewriting theory, security protocol design, software engineering, theorem proving, type theory and social science: democracy and science, democratic governance, ethnographic studies and ethnography of technologies, genealogy of democracy and technology, political technologies, public understanding of science, trust in information, science and technology studies (STS). To apply, please visit the project homepage http://www.demtech.dk/. Early expressions of interest are encouraged: Carsten Schuermann (carsten at itu.dk), Joseph Kiniry (kiniry at acm.org), Randi Markussen (rmar at itu.dk), Christopher Gad (chga at itu.dk), or nina Boulus (nbou at itu.dk). Best regards, -- Carsten Schuermann and Joseph Kiniry -------------- next part -------------- An HTML attachment was scrubbed... URL: From stavros.tripakis at gmail.com Mon Mar 7 19:06:28 2011 From: stavros.tripakis at gmail.com (Stavros Tripakis) Date: Mon, 7 Mar 2011 16:06:28 -0800 Subject: [TYPES/announce] CFP: FORMATS 2011, 21-23 Sep 2011 In-Reply-To: References: Message-ID: ?? ? ? ? ? ? ? ? ? ?CALL FOR PAPERS ?? ? ? ? ? ? ? ? ? ? ? ?FORMATS ?2011 ?? ? ? ? ? ? ?9th International Conference on ??Formal Modeling and Analysis of Timed Systems ? ? ? ? ? ? ? ? Aalborg University, Denmark ? ? ? ? ? ? ? ? ? ? 21-23 September 2011 ? ? ? ? ? ? ? ?http://formats2011.cs.aau.dk/ IMPORTANT DATES Abstract submission: 15 May 2011 Paper submission: 22 May 2011 Notification: 20 June 2011 Final version due: 10 July 2011 INVITED SPEAKERS Rajeev Alur, University of Pennsylvania Boudewijn Haverkort, University of Twente / Embedded Systems Institute Oded Maler, VERIMAG 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, type systems). - 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). - Applications: Adaptation and specialization of timing technology in application domains in which timing plays an important role (e.g. real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication). For more information, see: http://formats2011.cs.aau.dk/ From kutsia at risc.uni-linz.ac.at Tue Mar 8 03:02:13 2011 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 08 Mar 2011 09:02:13 +0100 Subject: [TYPES/announce] Extended deadline: JAL Special Issue on Automated Specification and Verification of Web Systems Message-ID: <4D75E285.3050103@risc.uni-linz.ac.at> [Apologies for multiple copies] ======================================================================== JOURNAL OF APPLIED LOGIC Special Issue on Automated Specification and Verification of Web Systems http://www.risc.uni-linz.ac.at/people/tkutsia/jal-wwv.html DEADLINE EXTENSION ======================================================================== IMPORTANT DATES --------------- * Submission of papers: March 16, 2011 (extended). * Notification: June 6, 2011. From U.Berger at swansea.ac.uk Tue Mar 8 03:44:10 2011 From: U.Berger at swansea.ac.uk (U.Berger at swansea.ac.uk) Date: Tue, 8 Mar 2011 08:44:10 -0000 (UTC) Subject: [TYPES/announce] LCC'11 Workshop Announcement Message-ID: <49357.92.6.175.18.1299573850.squirrel@cs.swansea.ac.uk> LCC'11 WORKSHOP ANNOUNCEMENT The Twelfth International Workshop on Logic and Computational Complexity (LCC'11,http://www.cs.swansea.ac.uk/lcc2011/) will be held in Toronto on June 25, 2011, as an affiliated meeting of LiCS'11 (http://www2.informatik.hu-berlin.de/lics/lics11/). LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The LCC'11 program will consist of invited lectures as well as contributed papers selected by the program committee. This year there will be no published proceedings, and we welcome informal presentations about work in progress, survey papers, as well as work submitted or published elsewhere, provided all pertinent information is disclosed at submission time. Submissions in the form of an extended abstract of approx. 5 pages are welcome. If full papers are submitted, they should not exceed 15 pages. Proposed papers should be uploaded to https://www.easychair.org/conferences/?conf=lcc2011 by 20 April 2011. IMPORTANT DATES Paper submission deadline: 20 April Authors' notification: 10 May LCC'11 workshop: 25 June For additional information see http://www.cs.swansea.ac.uk/lcc2011/ or www.cs.indiana.edu/lcc, or email inquiries to u.berger at swansea.ac.uk or denis at cs.mcgill.ca Further information about previous LCC meetings can be found at http://www.cis.syr.edu/~royer/lcc. PROGRAM COMMITTEE * Ulrich Berger (Swansea, Co-Chair) * Denis Therien (McGill Montreal, Co-Chair) * Klaus Aehlig (Southampton) * Arnold Beckmann (Swansea) * Guillaume Bonfante (LORIA Nancy) * Ugo Dal Lago (Bologna) * Phuong Nguyen (McGill Montreal) * Luca Roversi (Torino) * Thomas Schwentick (TU Dortmund) * Howard Straubing (Boston College) * Kazushige Terui (Kyoto) * Heribert Vollmer (Hanover) STEERING COMMITTEE: Michael Benedikt (Oxford, Co-chair), Daniel Leivant (Indiana U, Co-chair), Robert Constable (Cornell), Anuj Dawar (Cambridge), Fernando Ferreira (Lisbon), Martin Hofmann (U Munich), Neil Immerman (U Mass. Amherst), Neil Jones (Copenhagen), Bruce Kapron (U Victoria), Stefan Kreutzer (Oxford), Jean-Yves Marion (LORIA Nancy), Luke Ong (Oxford), Martin Otto (Darmstadt), James Royer (Syracuse), Helmut Schwichtenberg (U Munich), and Pawel Urzyczyn (Warsaw) From cristi at ifi.uio.no Tue Mar 8 09:20:53 2011 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Tue, 08 Mar 2011 15:20:53 +0100 Subject: [TYPES/announce] 2nd CFP: Fundamentals of Computation Theory, 18th International Symposium (FCT2011) Message-ID: <4D763B45.5030802@ifi.uio.no> Dear moderator of TYPES list, could you please forward this second CFP, which adds invited speakers and affiliated events to the first CFP. !Please forgive us if you receive this announcement several times! -------------------------------------------------------------------- Call for Papers FCT 2011 18th International Symposium on Fundamentals of Computation Theory http://fct11.ifi.uio.no/ August 22-25, 2011, Oslo, Norway The Symposium on Fundamentals of Computation Theory was established in 1977 for researchers interested in all aspects of theoretical computer science, as well as new emerging fields such as bio-inspired computing. It is a biennial series of conferences previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005), Budapest (Hungary, 2007), and Wroclaw (Poland, 2009). PROCEEDINGS The conference proceedings will be published (as usual) in the Lecture Notes in Computer Science series of Springer-Verlag. SUBMISSIONS Authors are invited to submit papers presenting original unpublished research in all areas of theoretical computer science. Topics of interest include (but are not limited to): * Algorithms: o algorithm design and optimization o combinatorics and analysis of algorithms o computational complexity o approximation, randomized, and heuristic methods o parallel and distributed computing o circuits and boolean functions o online algorithms o machine learning and artificial intelligence o computational geometry o computational algebra * Formal methods: o algebraic and categorical methods o automata and formal languages o computability and nonstandard computing models o database theory o foundations of concurrency and distributed systems o logics and model checking o models of reactive, hybrid and stochastic systems o principles of programming languages o program analysis and transformation o specification, refinement and verification o security o type systems * Emerging fields: o ad hoc, dynamic, and evolving systems o algorithmic game theory o computational biology o foundations of cloud computing and ubiquitous systems o quantum computation The submission drafts should have at most 12 pages and be formated in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance. If necessary, detailed proofs can be attached as an appendix. Simultaneous submission to other conferences with published proceedings or journals is not allowed. Paper submission and reviewing is handled via EasyChair: http://www.easychair.org/conferences?conf=fct2011 IMPORTANT DATES Submission Deadline: Tuesday, 5. April 2011 Author Notification: Monday, 6. June 2011 Camera ready manuscript: Friday 17. June 2011 For further information on the conference, please visit the URL at http://fct11.ifi.uio.no/ INVITED SPEAKERS FCT 2011 is honored by the contribution of three internationally renowned invited speakers. - Yuri Gurevich (Microsoft Research, Redmond USA) - Daniel Lokshtanov (University of California, USA) - Jose Meseguer (University of Illinois at Urbana-Champaign, USA) PROGRAM CHAIRS - Olaf Owe (U. of Oslo) - Martin Steffen (U. of Oslo) - Jan Arne Telle (U. of Bergen) PROGRAM COMMITTEE Erika Abraham (RWTH Aachen, Germany) Wolfgang Ahrendt (Chalmers, Sweden) David Coudert (INRIA Sophia-Antipolis, France) Camil Demetrescu (La Sapienza University of Rome, Italy) Johan Dovland (U. of Oslo, Norway) Jiri Fiala (Charles University, Czech Republic) Martin Hofmann (LMU Munich, Germany) Thore Husfeldt (IT University of Copenhagen, Denmark) Alexander Kurz (U. of Leicester, UK) Andrzej Lingas (Lund University, Sweden) Peter Olveczky (U. of Oslo, Norway) Olaf Owe (U. of Oslo, Norway) - co-chair Miguel Palomino (U. Complutense, Madrid, Spain) Yuri Rabinovich (U. of Haifa, Israel) Saket Saurabh (Inst. of Mathematical Sciences, India) Kaisa Sere (Aabo Akademi University, Finland) Martin Steffen (U. of Oslo, Norway) - co-chair Jan Arne Telle (U. of Bergen, Norway) - co-chair Tarmo Uustalu (Inst. of Cybernetics, Tallinn, Estonia) Ryan Williams (IBM Almaden, USA) Gerhard Woeginger (U. of Eindhoven, The Netherlands) David R. Wood (U. of Melbourne, Australia) Wang Yi (Uppsala University, Sweden) STEERING COMMITTEE Bogdan Chlebus (Warszawa/Denver, Poland/USA) Zoltan Esik (Szeged, Hungary) Marek Karpinski - chair (Bonn, Germany) Andrzej Lingas (Lund, Sweden) Miklos Santha (Paris, France) Eli Upfal (Providence, USA) AFFILIATED EVENTS FCT 2011 will host several affiliated events. These will take part after the main symposium, on the 26 August 2011. More information about each event can be found on their specific web-pages. - Doctoral Symposium affiliated with FCT'11 web: http://fct11.ifi.uio.no/index.php?n=Workshops.DoctoralSymposium - Workshop on Overcoming Challenges for Security and Dependability (WOCSD) web: http://www.mi.fu-berlin.de/secdep/workshop/2011/cfp.html -------------------------------------------------------------------- From cbraga at ic.uff.br Tue Mar 8 12:14:47 2011 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 8 Mar 2011 14:14:47 -0300 Subject: [TYPES/announce] SBLP 2011 - 4th. call for papers Message-ID: <20072ACB-D01F-47C4-BC3B-CABD6EC3B1A3@ic.uff.br> [Apologies for multiple copies of this call.] SBLP 2011: Call For Papers 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 26-30, 2011 http://www.each.usp.br/cbsoft2011/ IMPORTANT DATES Paper abstract submission (15 lines): April 22nd, 2011 Full paper submission: April 29th, 2011 Notification of acceptance: May 30th, 2011 Final papers due: July 1st, 2011 INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester Talk title: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida Talk title: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" INTRODUCTION The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2011 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical approaches. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Submissions should be done using SBLP 2011 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2011. Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. All papers should be prepared using the Springer Lecture Notes in Computer Science (LNCS) template. (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) We encourage the submission of short papers reporting on master dissertations or doctoral theses at early stages of their development. All accepted papers, with at least one author registered in the conference, will be published in the conference proceedings. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP 2009 and 2010, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. ORGANIZATION CHAIRS - For CBSoft * Marcelo Fantinato, EACH - USP * Luciano Silva, FCI - Mackenzie - For SBLP * Denise Stringhini FCI, Mackenzie * Alfredo Goldman IME, USP PROGRAMME COMMITTEE CHAIRS * Christiano Braga, UFF * Jose Luiz Fiadeiro, Univ. of Leicester PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Alvaro Moreira, UFRGS * Andre Du Bois, UFPel * Alex Garcia, IME * Andre Santos, UFPE * Artur Boronat, Univ. of Leicester * Carlos Camarao, UFMG * Christiano Braga, UFF (co-chair) * Fernando Castor Filho, UFPE * Fernando Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC * Jens Palsberg, UCLA * Joao Saraiva, Universidade do Minho * Johan Jeuring, Utrecht Univ. * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester (co-chair) * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho * Marcelo A. Maia, UFU * Marcelo d'Amorim, UFPE * Marco Tulio Valente, UFMG * Mariza A. S. Bigonha, UFMG * Martin A. Musicante, UFRN * Noemi Rodriguez, PUC-Rio * Paulo Borba, UFPE * Peter Mosses, Swansea University * Renato Cerqueira, PUC-Rio * Ricardo Massa, UFPE * Roberto S. Bigonha, UFMG * Roberto Ierusalimschy, PUC-Rio * Sandro Rigo, UNICAMP * Sergio Soares, UFPE * Sergiu Dascalu, Univ. of Nevada * Simon Thompson, Univ. of Kent * Varmo Vene, Univ. de Tartu From carbonem at itu.dk Thu Mar 10 08:12:01 2011 From: carbonem at itu.dk (Marco Carbone) Date: Thu, 10 Mar 2011 14:12:01 +0100 Subject: [TYPES/announce] ICE 2011 - Second Call for Papers (Deadline: 4th April 2011) In-Reply-To: References: Message-ID: ========================================================== [- Apologies for multiple copies -] ICE 2011 4th Interaction and Concurrency Experience Reliable and Contract-based Interactions June 9, 2011, Reykjavik, Iceland http://www.artist-embedded.org/artist/-ICE-2011-.html Satellite workshop of DisCoTec 2011 http://discotec.ru.is === Highlights === - Invited talks: Prakash Panangaden Rocco de Nicola (joint with PaCo) - Innovative selection procedure - Special issue of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/) === Important Dates === 28 March 2011.............Abstract submission 4 April 2011................Full paper submission 11 April - 7 May 2011...Reviews, rebuttal and PC discussion 9 May 2011................Notification to authors 23 May 2011...............Camera-ready for pre-proceedings 9 June 2011...............ICE in Reykjavik 15 Sept 2011..............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 handshaking mechanisms used among actors 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'11 is ***Reliable and Contract-based Interactions***. Reliable interactions are, e.g., those providing suitable guarantees on the overall behaviour of interactive systems, enjoying suitable logical safety/liveness properties, adhering to certain QoS standards, offering certain levels of trust/security. Contract-based interactions are those where the interacting entities are committed to give certain guarantees whenever certain assumptions are met by their operating environment (including other autonomous entities and networking middleware). This way, contracts can be used to define faulty and malicious behaviours and to identify the responsible in case of contract violation or abuse. Topics of interest include, but shall not be limited to: - logics and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of reliable interaction - programming primitives for reliable interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for reliable interaction - expressiveness results - formal languages for contracts - formal analysis of contracts - contract negotiation, discovery and monitoring === Selection Procedure === The workshop pushes for an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past three editions of ICE, this 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. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions that the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE 2011 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=ice2011) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Special Issue === Full version 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 === Karthik Bhargavan (INRIA, France) Simon Bliudze (CEA LIST, France) (co-chair) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marzia Buscemi (IMT Lucca Institute for Advanced Studies, Italy) Luis Caires (Universidade Nova de Lisboa, Portugal) Marco Carbone (IT University of Copenhagen, Denmark) Gabriel Ciobanu (IASI, Romania) Laurent Doyen (ENS Cachan, France) Davide Grohmann (Italy) Daniel Hirschkoff (ENS Lyon, France) Barbara Jobstmann (CNRS/Verimag, France) Ivan Lanese (University of Bologna, Italy) Alberto Lluch Lafuente (IMT Lucca, Italy) Hernan Melgratti (University of Buenos Aires, Argentina) Dejan Nickovic (IST, Austria) Sylvain Pradalier (INRIA Rocquencourt, France) Sophie Quinton (TU Braunschweig, Germany) Alexandra Silva (CWI, Netherlands) (co-chair) Pawel Sobocinski (University of Southampton, UK) Ana Sokolova (University of Salzburg, Austria) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Frank D. Valencia (LIX, France) Nalini Vasudevan (Intel Labs, USA) Hugo Torres Vieira (Universidade Nova de Lisboa, Portugal) Erik de Vink (Technische Universiteit Eindhoven, Netherlands) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy) - Marco Carbone (IT University of Copenhagen, Denmark) - Alexandra Silva (CWI, Netherlands; co-chair) === Contact === ice2011 at easychair.org === Previous editions === The previous three 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 a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10) is now in preparation. === Sponsors === CEA List -------------- next part -------------- An HTML attachment was scrubbed... URL: From dario.dellamonica at uniud.it Thu Mar 10 09:34:19 2011 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Thu, 10 Mar 2011 15:34:19 +0100 Subject: [TYPES/announce] GandALF2011 -- EXTENDED DEADLINE Message-ID: <4D78E16B.8080308@uniud.it> [We apologize if you have received multiple copies of this message] ******************************************************************************** --------------------- GandALF 2011 ------------------------ ******************************************************************************** Second International Symposium on Games, Automata, Logics, and Formal Verification Minori, Amalfi Coast, Italy, June 15-17, 2011 http://gandalf.dia.unisa.it/ **************************************************************************** | 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 concrete applications, and to stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. INDICATIVE LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Logical aspects of Computational Complexity 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 Game Theory Hybrid, Embedded, and Mobile Systems Verification Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Program Analysis and Software Verification Specification and Verification of Finite and Infinite-state Systems Synthesis and Execution 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 March 23, 2011 Paper submission March 28, 2011 Acceptance notification April 29, 2011 Final version May 15, 2011 Conference June 15-17, 2011 INVITED SPEAKERS Thomas Colcombet (CNRS, Paris FRANCE) Erich Graedel (RWTH Aachen University, GERMANY) Moshe Vardi (Rice University, Houston USA) 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 last GandALF (GandALF 2010) will be published as a special issue of the International Journal of Foundation of Computer Science (http://www.cs.ucsb.edu/~ijfcs/). INFO Please visit the conference website (http://gandalf.dia.unisa.it) for more information. GENERAL CHAIR Angelo Montanari (University of Udine, ITALY) PROGRAM CHAIRS Giovanna D'Agostino (University of Udine, ITALY) Salvatore La Torre (University of Salerno, ITALY) PROGRAM COMMITTEE Krishnendu Chatterjee (Inst. of Science and Tech, AUSTRIA) Swarat Chaudhuri (Pennsylvania State University, USA) Giorgio Delzanno (University of Genova, ITALY) Javier Esparza (Technische Universitat Munchen, GERMANY) Eric Graedel (RWTH Aachen University, GERMANY) Neil Immerman, (University of Massachusetts, USA) Wojtek Jamroga (University of Luxembourg, LUXEMBOURG) Vineet Kahlon, (NEC Labs, Princeton, USA) Martin Leucker (University of Lubeck, GERMANY) Jerzy Marcinkowski (University of Wroclaw, POLAND) Aniello Murano (University of Napoli "Federico II", ITALY) Mimmo Parente (University of Salerno, ITALY) Gabriele Puppis (Oxford University, UK) Alexander Rabinovich (Tel Aviv University, ISRAEL) Jean Francois Raskin (University of Bruxelles, BELGIUM) Colin Stirling (University of Edinburgh, UK) Tayssir Touili (University Paris Diderot, FRANCE) Yde Venema (ILLC, University of Amsterdam, HOLLAND) Bow-Yaw Wang (INRIA, FRANCE and Tsinghua University, CHINA) Igor Walukiewicz (LaBRI, University of Bordeaux1, FRANCE) 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) ORGANIZING COMMITTEE Marco Faella, chair (Universit? di Napoli "Federico II", Italy) Dario Della Monica (Universit? di Salerno, Italy) Stefano Minopoli (Universit? di Napoli "Federico II", Italy) -- Dario Della Monica, Research Associate University of Salerno - Dipartimento di Informatica e Applicazioni "R. M. Capocelli" Via Ponte don Melillo - 84084 Fisciano (SA) - Italy phone: (+39) 089 969318 cell: (+39) 328 2477327 fax: (+39) 089 969600 email: dario.dellamonica [at] uniud.it web site: http://www.dia.unisa.it/dottorandi/dario.dellamonica/ From rseba at disi.unitn.it Thu Mar 10 10:16:10 2011 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Thu, 10 Mar 2011 16:16:10 +0100 Subject: [TYPES/announce] URGENT: PhD position on Satisfiability-based algorithms for Requirements Engineering Message-ID: <20110310151610.GA1273@disi.unitn.it> ======================================================================== !!!!!!!!! URGENT: Submission Deadline: March 16th, 2011 !!!!!!!!!!!! Last call for one PhD position in ICT on "Satisfiability-based algorithms for Requirements Engineering" at Dept. of Computer Science & Engineering, University of Trento, Italy. Advisors: Prof. John Mylopoulos and Prof. Roberto Sebastiani ======================================================================== 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. INFORMAL ENQUIRIES ARE ENCOURAGED. Please get in touch with Roberto Sebastiani (rseba at disi.unitn.it, +39.0461.281514) as soon as possible, in order to have a better understanding of possible research activities and the formal application details. HOW TO APPLY: The positions are included in the "Project Specific Grants - DISI" of the ICT International Doctoral School, University of Trento, as reported in the official call published at http://ict.unitn.it/application. You must submit a formal application (by March 16 2011 !) to the ICT School (http://ict.unitn.it/). In the application, you must mandatorily quote the "Project-specific Grants - DISI" grant: "Ontologies and algorithms for requirements engineering" since failure to do so may result in ineligibility for this position. Closing date for applications (sharp!) is March 16th, 2011, 1 pm, local time. Thus, potentially-interested candidates must: - URGENTLY (by March 16 2011 !!) submit a formal application to the ICT School (http://ict.unitn.it/). - send their CV (and later three recommendation letters) to Roberto Sebastiani (rseba at disi.unitn.it) cc-ing Michela Angeli (angeli at disi.unitn.it), and 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 pmt6sbc at maths.leeds.ac.uk Fri Mar 11 07:55:12 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Fri, 11 Mar 2011 12:55:12 +0000 (GMT) Subject: [TYPES/announce] Book Announcement: "Computability In Context" Message-ID: Book Announcement: __________________________________________________________________________ COMPUTABILITY IN CONTEXT: Computation and Logic in the Real World (ed. S Barry Cooper and Andrea Sorbi) World Scientific, Feb. 2011 http://www.worldscibooks.com/mathematics/p577.html Computability has played a crucial role in mathematics and computer science, leading to the discovery, understanding and classification of decidable/undecidable problems, paving the way for the modern computer era, and affecting deeply our view of the world. Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions about the so-called Turing barrier. This volume, arising from the conference "Computability in Europe 2007: Computation and Logic in the Real World", addresses various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real-world issues, covering problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues. Contents: * Computation, Information, and the Arrow of Time (P Adriaans & P van Emde Boas) * The Isomorphism Conjecture for NP (M Agrawal) * The Ershov Hierarchy (M M Arslanov) * Complexity and Approximation in Reoptimization (G Ausiello et al.) * Definability in the Real Universe (S B Cooper) * HF-Computability (Y L Ershov et al.) * The Mathematics of Computing Between Logic and Physics (G Longo & T Paul) * Liquid State Machines: Motivation, Theory, and Applications (W Maass) * Experiments on an Internal Approach to Typed Algorithms in Analysis (D Normann) * Recursive Functions: An Archeological Look (P Odifreddi) * Reverse Mathematics and Well-Ordering Principles (M Rathjen & A Weiermann) * Discrete Transfinite Computation Models (P D Welch) ISBN: 978-1-84816-245-7, 1-84816-245-6 __________________________________________________________________________ From tiezzi at dsi.unifi.it Fri Mar 11 09:36:59 2011 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Fri, 11 Mar 2011 15:36:59 +0100 Subject: [TYPES/announce] 2nd Call for Papers: WWV 2011 Message-ID: <25EFE5A1-090E-4DFD-8DCF-6C0FD4405B7A@dsi.unifi.it> [Apologies for multiple copies] ******************************************************** Second Call for Papers WWV 2011 Automated Specification and Verification of Web Systems 7th International Workshop (as part of DisCoTec'11) http://rap.dsi.unifi.it/wwv2011/ June 9, 2011 - Reykjavik, Iceland ******************************************************** IMPORTANT DATES Abstract Submission March 28, 2011 Full Paper Submission April 4, 2011 Acceptance Notification May 3, 2011 Camera Ready (pre-proceedings) May 30, 2011 Workshop June 9, 2011 Camera Ready (post-proceedings) July 4, 2011 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 Elie Najm Telecom ParisTech, France 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=wwv2011 Submission is a firm commitment that at least one of the authors will attend the conference, 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 Laura Kovacs Vienna University of Technology, Austria Rosario Pugliese University of Florence, Italy Francesco Tiezzi University of Florence, Italy PROGRAM COMMITTEE Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Santiago Escobar Technical University of Valencia, Spain Jean-Marie Jacquet University of Namur, Belgium Laura Kovacs Vienna University of Technology, Austria Temur Kutsia Johannes Kepler University Linz, Austria Tiziana Margaria Univ. Potsdam, Germany Manuel Mazzara University of Newcastle, United Kingdom Catherine Meadows NRL, United States Yasuhiko Minamide University of Tsukuba, Japan Rosario Pugliese University of Florence, Italy I.V. Ramakrishnan SUNY Stony Brook, United States Maurice ter Beek ISTI-CNR, Pisa, Italy Francesco Tiezzi University of Florence, Italy Franz Weitl National Institute of Informatics, Tokyo, Japan Nobuko Yoshida Imperial College London, United Kingdom CONTACT wwv2011 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From sescobar at dsic.upv.es Fri Mar 11 09:55:59 2011 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Fri, 11 Mar 2011 15:55:59 +0100 Subject: [TYPES/announce] Last CfP: WRS 2011 - 10th International Workshop on Reduction Strategies in Rewriting and Programming References: <0FAE5A87-58B9-4787-B4C4-4B5590728E3E@dsic.upv.es> Message-ID: Last Call for Papers WRS 2011 10th International Workshop on Reduction Strategies in Rewriting and Programming http://www.dsic.upv.es/workshops/wrs2011 29 May 2011, Novi Sad, Serbia An RDP 2011 workshop Federated Conference on Rewriting, Deduction, and Programming This workshop promotes research and collaboration in the area of reduction strategies. It encourages the presentation of new directions, developments, and results as well as surveys and tutorials on existing knowledge in this area. Reduction strategies define which (sub)expression(s) should be selected for evaluation and which rule(s) should be applied. These choices affect fundamental properties of computations such as laziness, strictness, completeness, and efficiency, to name a few. For this reason programming languages such as Elan, Maude, OBJ, Stratego, and TOM allow the explicit definition of the evaluation strategy, whereas languages such as Clean, Curry, and Haskell allow its modification. In addition to strategies in rewriting and programming, WRS also covers the use of strategies and tactics in other areas such as theorem and termination proving. Previous editions of the workshop were held in Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), Seattle (2006), Paris (2007), Hagenberg (2008), Brasilia (2009), and Edinburgh (2010); the last one as a joint workshop with the STRATEGIES workshop. Further information can be found at the permanent site for WRS . WRS 2011 is planned to be co-located with RTA 2011 (22nd International Conference on Rewriting Techniques and Applications), as a satellite event of RDP, the Federated Conference on Rewriting, Deduction, and Programming. WRS 2011 will be held at Novi Sad, Serbia on 29 May 2011. Submissions and Publication: Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style through the EasyChair submission site. Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in an electronic journal, such as Electronic Proceedings in Theoretical Computer Science. Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. We envisage publication of a special issue of a journal dedicated to WRS after the event. Important Dates: # Submission: 20 March 2011 # Notification: 4 April 2011 # Preliminary proceedings version due: 15 April 2011 # Workshop: 29 May 2011 # Submission for final proceedings: 12 September 2011 # Notification: 7 November 2011 # Final version: 21 November 2011 Programme Committee: # Dan Dougherty, Worcester Polytechnic Institute, USA # Santiago Escobar, Universidad Politecnica de Valencia, Spain (chair) # Maribel Fernandez, King's College London, UK # Juergen Giesl, RWTH Aachen, Germany # Bernhard Gramlich, Technische Universit Wien, Austria # Helene Kirchner, Centre de Recherche INRIA Bordeaux, France # Francisco Javier Lopez Fraguas, Universidad Complutense de Madrid, Spain # Salvador Lucas, Universidad Politecnica de Valencia, Spain # Aart Middeldorp, University of Innsbruck, Austria # Jaco van de Pol, University of Twente, The Netherlands # Masahiko Sakai, Nagoya University, Japan # Manfred Schmidt-Schauss, Johann Wolfgang Goethe-Universitat, Germany For more information, please contact Santiago Escobar Universidad Politecnica de Valencia, Spain Email: sescobar at dsic.upv.es From Michele.Pagani at lipn.univ-paris13.fr Fri Mar 11 11:38:57 2011 From: Michele.Pagani at lipn.univ-paris13.fr (Michele.Pagani at lipn.univ-paris13.fr) Date: Fri, 11 Mar 2011 17:38:57 +0100 Subject: [TYPES/announce] Lecturer position in Paris 13 Message-ID: <20110311173857.97714png2nmpg8ip@webmail.lipn.univ-paris13.fr> ====================================================== University Lecturer position in LIPN (University Paris 13) ====================================================== A lecturer position is open within the Laboratory LIPN located at University Paris 13 (http://www-lipn.univ-paris13.fr). ___________________________________________________ __________________ Important dates ___________________ - deadline for application: 25 march 2011 (16h00 Paris Time) - starting date: 1 september 2011 __________________________________________________ _______________ Application procedure ________________ The applicant must have obtained a Ph.D. degree and be "qualified" (see http://www.enseignementsup-recherche.gouv.fr/cid22657/maitres-de-conferences.html for additional information). The candidate should apply online on the website https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/candidats.html Furthermore, he or she should send his/her full application to the University Paris 13, this including a resume, a research project and referee letters. Additional information is provided at the following address (see MCF 9004): http://www-lipn.univ-paris13.fr/~fouquere/Postes/index2011.html _______________________________________________ _____________ Profile of the position ________________ The teaching profile is "Syst?mes et r?seaux", the selected candidate will teach in French at the IUT of Villetaneuse (http://www.iutv.univ-paris13.fr/iutv/index.php). The research profile is "linear logic, proof nets and programming". We seek candidates with a solid mathematical background and expertise in one or several of the following areas of theoretical computer science: - linear logic, light linear logics; - proof nets, geometry of interaction; - lambda-calculus and their algebraic, probabilistic and non-deterministic extensions; - denonational semantics, games semantics, ludics; - functional programming. Expertise in other areas involving logic and theoretical computer science are also welcome. The selected candidate will work within the team LCR (Logic, Computation, Reasoning) of LIPN (http://www-lipn.univ-paris13.fr/LCR). The interested candidates may contact us by email at cf at lipn.univ-paris13.fr ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From mokhov at cse.concordia.ca Fri Mar 11 19:43:54 2011 From: mokhov at cse.concordia.ca (Serguei A. Mokhov on behalf of PST-11) Date: Fri, 11 Mar 2011 19:43:54 -0500 Subject: [TYPES/announce] Privacy, Security, Trust (PST 2011) - 2nd Call for Papers (Deadline: March 20) Message-ID: <201103120043.p2C0hsj0007367@alfredo.encs.concordia.ca> [ Apologies if you receive multiple copies of this announcement. Please pass it on to your colleagues and students who might be interested in contributing. ] Ninth Annual Conference on Privacy, Security and Trust ------------------------------------------------------ July 19-21, 2011 Montreal, Quebec, Canada http://www.unb.ca/pstnet/pst2011 Call for Papers --------------- The PST2011 International Conference on Privacy, Security and Trust (PST) is being held in Montreal, Quebec, Canada, July 19-21, 2011. PST2011 is the ninth such annual conference focusing on PST technologies. PST2011 provides a forum for researchers world-wide to unveil their latest work in privacy, security and trust and to show how this research can be used to enable innovation. EasyChair submission link of PST 2011: http://www.easychair.org/conferences/?conf=pst2011. IMPORTANT DATES: ---------------- Submission Deadline: March 20, 2011 Notification of Acceptance: May 9, 2011 Final Manuscript Due: May 22, 2011 PST2011 will include an Innovation Day featuring workshops and tutorials followed by two days of high-quality research papers whose topics include, but are NOT limited to, the following: * Privacy Preserving / Enhancing Technologies * Trust Technologies, Technologies for Building Trust in e-Business Strategy * Critical Infrastructure Protection * Observations of PST in Practice, Society, Policy and Legislation * Network and Wireless Security * Digital Rights Management * Operating Systems Security * Identity and Trust management * Intrusion Detection Technologies * PST and Cloud Computing * Secure Software Development and Architecture * Human Computer Interaction and PST * PST Challenges in e-Services, e.g. e-Health, e-Government, e-Commerce * Implications of, and Technologies for, Lawful Surveillance * Network Enabled Operations * Biometrics, National ID Cards, Identity Theft * Digital forensics * PST and Web Services / SOA * Information Filtering, Data Mining & Knowledge from Data * Privacy, Traceability, and Anonymity * National Security and Public Safety * Trust and Reputation in Self-Organizing Environments * Security Metrics * Anonymity and Privacy vs. Accountability * Recommendation, Reputation and Delivery Technologies * Access Control and Capability Delegation * Continuous Authentication * Representations and Formalizations of Trust in Electronic and Physical Social Systems High-quality papers in all PST related areas that, at the time of submission, are not under review and have not already been published or accepted for publications elsewhere are solicited. Accepted papers will either be accepted as regular papers up to 8 pages and with oral presentations, or short papers of up to 2 pages with poster presentations. Up to 2 additional pages will be allowed in each category with over-length charges. The standard IEEE two-column conference format should be used for all submissions. A copy of the IEEE Manuscript Templates for Microsoft Word or LaTeX and additional information about paper submission and conference topics and events can be found at the conference web site. All accepted papers will be published in the conference proceedings and by IEEE and will be accessible via IEEE Xplore Digital Library. Best Paper and Best Student Paper awards will be presented. Some travel grants to students who are presenting their work in the conference will also be made available. Organizing Committee -------------------- Honorary Conference Chair: Andrew Vallerand, Director S&T Public Security, National Defense, Canada General Co-Chairs: Mourad Debbabi, Concordia University, Canada Amr M. Youssef, Concordia University, Canada Program Co-Chairs: Frederic Cuppens (Privacy), ENST-Bretagne, France Natalia Stakhanova (Security), University of South Alabama, USA Jianying Zhou (Trust), Institute for Infocomm Research, Singapore Workshop & Tutorial Chair: Ali Miri, Ryerson University, Canada Poster Session Chair: Franois Cosquer, Alcatel Lucent, France Publication & Publicity Chair: Indrajit Ray, Colorado State University, USA Carlisle Adams, University of Ottawa, Canada PST Steering Committee Chair: Ali Ghorbani, University of New Brunswick, Canada Conference Manager: Greg Sprague, National Research Council, Canada Local Arrangements: Benjamin Fung, Concordia University, Canada Webmaster: Ilia Goldfarb, National Research Council, Canada Finance and Registration: Linda Vienneau, National Research Council, Canada Privacy Theme ------------- Privacy concerns the operational policies, procedures and regulations implemented within an information system to control for the unauthorized use of, access to, or release of personal information held in any format. Topics of interest in this theme include (but are not limited to): * privacy preserving/enhancing technologies * identity management and biometrics * privacy and ubiquitous computing, e.g. RFIDs * reputation, privacy and communities * e-health and privacy * anonymity and medical research * employee privacy and network administration * privacy and location-based technologies and services * privacy and traceability * spyware and stalking * anonymity, pseudonimity and accountability * responding to hate speech, flaming and trolls * privacy and emergency management policies and technologies * vulnerable online users and privacy sensitization * evolving nature of lawful surveillance * smart cards and privacy * identity theft and management * privacy audits and risk analysis * evolving role of privacy officers Privacy Theme Chair: Frederic Cuppens, TELECOM Bretagne, France Privace Theme Committee: Sushil Jajodia, George Mason University, USA Vijay Atluri, Rutgers University, USA Joaquin Garcia-Alfaro, Telecom Bretagne, France Nora Cuppens-Boulahia, Telecom Bretagne, France Alban Gabillon, Universit de la Polynsie Franaise, France Josep Domingo-Ferrer, Universitat Rovira i Virgili, Spain Ernesto Damiani, Universit degli Studi di Milano, Italy Ehud Gudes, Ben-Gurion University, Israel Carlisle Adams, University of Ottawa Esma Aimeur, University of Montreal Norm Archer, McMaster University Debra Grant, Office of the Information and Privacy Commissioner of Canada Steve Johnston, Office of the Privacy Commissioner of Canada Bradley Malin, Vanderbilt University Jian Pei, Simon Fraser University Teresa Scassa, University of Ottawa Jean-Marc Seigneur, University of Geneva Lisa Singh, Georgetown University Traian Truta, Northern Kentucky University Jens Weber, University of Victoria Security Theme -------------- Security addresses the various components of an information system that safeguard the data and associated infrastructure from unauthorized activity. Topics of interest in this theme include (but are not limited to): * access control * adaptive security and system management * analysis of network and security protocols * applications of cryptographic techniques * attacks against networks and machines * authentication and authorization of users, systems, and applications * botnets * critical infrastructure security * firewall technologies * forensics and diagnostics for security * intrusion and anomaly detection and prevention * malicious code analysis, anti-virus, anti-spyware * network infrastructure security * operating system security * public safety and emergency management * security architectures * security in heterogeneous and large-scale environments * techniques for developing secure systems * web security * wireless and pervasive/ubiquitous computing security Security Theme Chair: Natalia Stakhanova, University of South Alabama, USA Security Theme Committee: Michel Barbeau, Carleton University, Canada Mike Burmester, Florida State University, US Alvaro A. Cardenas, Fujitsu Laboratories, US Anton Chuvakin, Security Warrior Consulting, US Mathieu Couture, CRC, Canada Jos M. Fernandez, Ecole Polytechnique, Montreal, Canada Thorsten Holz, Ruhr-University Bochum, Germany Mohammed Houssaini Sqalli, King Fahd University of Petroleum & Minerals, Saudi Arabia H. Gunes Kayacik, Carleton University, Canada David Lie, University of Toronto, Canada Wei Lu, Keene State College, US Xinming Ou, Kansas State University, US Maria Papadaki, University of Plymouth, UK Nadia Tawbi, Universit Laval, Canada Julie Thorpe, University of Ontario Institute of Technology, Canada Issa Traore, University of Victoria, Canada Isaac Woungang, Ryerson University, Canada Alec Yasinsac, University of South Alabama, US Nur Zincir-Heywood, Dalhousie University, Canada Trust Theme ----------- Trust is a fundamental human behavior. It is necessary for people to function in social groups, and it forms the foundation for many of our organizations and relationships. The conference solicits original papers on any topic related to the personal, social, and economic aspects of trust. Topics of interest in this theme include (but are not limited to): * trust models * components and dimensions of trust * game theory and trusting behaviors * trust and risk * trust, regret, and forgiveness * perceptions of trustworthiness * trust management * automating trust decisions * attacks on trust * trust influences on security and privacy * economic drivers for trustworthy systems * cross-cultural differences * computing about trust * applications of trust * trust and economics * trust in e-commerce * reputation systems Trust Theme Chair: Jianying Zhou, Institute for Infocomm Research, Singapore Trust Theme Committee: Habtamu Abie, Norwegian Computing Center, Norway Claudio Agostino Ardagna, Universit degli Studi di Milano, Italy Robin Cohen, University of Waterloo, Canada Rino Falcone, National Research Council, Italy Jordi Forne, UPC, Spain Xinyi Huang, I2R, Singapore Steve Kremer, INRIA, France Costas Lambrinoudakis, University of Piraeus, Greece Albert Levi, Sabanci University, Turkey Hui Li, Xidian University, China Joseph Liu, I2R, Singapore Sangjae Moon, Kyungpook National University, Korea Yuko Murayama, Iwate Prefectural University, Japan Jose Onieva, University of Malaga, Spain Rolf Oppliger, eSECURITY Technologies, Switzerland Gunther Pernul, Universitt Regensburg, Germany Pierangela Samarati, Universit degli Studi di Milano, Italy Guilin Wang, University of Wollongong, Australia Yunlei Zhao, Fudan University, China Partners / Sponsors ------------------- * NRC-CNRC Canada * University of New Brunswick, Canada * Information Security Center of eXcellence (ISCX) * Concordia University, Montreal, Canada * National Cyberforensics and Training Alliance (NCFTA), Canada PST'11 From shankar at csl.sri.com Fri Mar 11 21:26:22 2011 From: shankar at csl.sri.com (Natarajan Shankar) Date: Fri, 11 Mar 2011 18:26:22 -0800 Subject: [TYPES/announce] Announcing Summer Formal 2011: Summer School on Formal Techniques Message-ID: <23469.1299896782@positron.csl.sri.com> Summer Formal 2011: First Summer School on Formal Techniques May 23-27, 2011 Menlo College, Atherton, California USA http://fm.csl.sri.com/SSFT11 Formal verification techniques such as model checking, satisfiability, and static analysis have matured rapidly in recent years. These techniques are widely applicable in computing as well as in engineering, biology, and mathematics. This school will focus on the principles and practice of formal verification, with a strong emphasis on the hands-on use of verification technology. It primarily targets graduate students who are interested in using or developing verification technology in their own research. We have NSF support for the travel and food/accommodation for students from US universities, but welcome applications from graduate students at non-US universities as well. The lecturers at the school include * Leonardo de Moura (Microsoft) and Bruno Dutertre (SRI International): Satisfiability Modulo Theories * Jason Baumgartner (IBM): Hardware Verification: Model Checking and Equivalence Checking * David Monniaux (VERIMAG): Static Analysis * Ken McMillan (Microsoft): Abstraction, Interpolation, and Composition * Neha Rungta and Peter Mehlitz (NASA Ames): Software Verification with Java PathFinder * Natarajan Shankar (SRI): Interactive Theorem Proving More information on the school can be found at http://fm.csl.sri.com/SSFT11. Students are invited to apply for admission to the school by visiting this web site. We especially welcome applications from women and under-represented minorities. Applications must be received by Mar 31, 2011. Tom Ball, Lenore Zuck, and Natarajan Shankar Summer Formal Steering Committee From pierre.geneves at inria.fr Sun Mar 13 05:17:17 2011 From: pierre.geneves at inria.fr (Pierre Geneves) Date: Sun, 13 Mar 2011 10:17:17 +0100 Subject: [TYPES/announce] PhD Position at INRIA Grenoble, France Message-ID: <4D7C8B9D.8060200@inria.fr> The WAM research project at INRIA Grenoble Rhone-Alpes invites applications for one PhD position on developing an XQuery Programming Environment for the mobile devices. -- Theme -- In the recent years, huge amounts of information from various application domains are stored, exchanged, and presented using XML. In this context, the ability to safely, efficiently and uniformly query XML data on different platforms such as mobile devices on a variety of data sources becomes increasingly important. XQuery is the W3C standard for querying XML data. It is increasingly popular and one of the challenges in web software development today is to help achieving a good level of quality in terms of programming frameworks, code size and runtime performance. In particular, with the recent advances in document formats such as the advent of HTML5, SVG and other UI oriented formats together with the increasing interaction between browsers and remote services, a general purpose, uniform and reliable alternative to JavaScript can be played with languages such as XQuery. -- Topic -- The topic of this PhD thesis consists in designing and implementing a programming environment for XQuery that can offer the following features: - A type inference system for XQuery - A Static type checker for XQuery - Automatic code optimization and dead-code analysis Based on these features, other applications can be built to offer security features for data manipulation such as path-based access control policies. On the theoretical side, the proposed work consists in extending an existing logical framework for XML reasoning to the modeling and reasoning on node sequences. The foundations are based on newly developed formal programming language verification techniques [1,2], which are now mature enough to be introduced in the context of software development. The WAM project seeks to establish logical foundations and automated reasoning techniques with applications concerning, but not limited to, static analysis of programs manipulating XML documents, pointer and heap analysis, program verification. Information about previous relevant research is available online: http://wam.inrialpes.fr/web-solver/webinterface.html -- Required Skills -- Applicants should have interests in programming languages, type theory, and/or mathematical logic, with a concern in the intersection of theory and practice. Expertise in the following areas are particularly welcomed: - programming language and type theory - program analysis - formal methods - automated reasoning -- References -- [1] Efficient Static Analysis of XML Paths and Types. Pierre Geneves, Nabil Layaida and Alan Schmitt. PLDI'07. [2] Impact of XML Schema Evolution. Pierre Geneves, Nabil Layaida and Vincent Quint. TOIT'11. [3] XQuery in the browser. Ghislain Fourny, Donald Kossmann, Tim Kraska, Markus Pilman, and Daniela Florescu. SIGMOD '08. -- Keywords -- XQuery, static analysis, type system, security, mobile computing -- How to apply -- Please submit your application through the link below: http://www.inria.fr/institut/recrutement-metiers/offres/theses/campagne-2011/%28view%29/details.html?id=PGTFK026203F3VBQB6G68LONZ&LOV5=4509&LG=FR&Resultsperpage=20&nPostingID=5115&nPostingTargetID=10138&option=52&sort=DESC&nDepartmentID=28 ________________________________________________ Pierre Geneves www.pierresoft.com/pierre.geneves From D.R.Ghica at cs.bham.ac.uk Sun Mar 13 13:05:18 2011 From: D.R.Ghica at cs.bham.ac.uk (Dan Ghica) Date: Sun, 13 Mar 2011 17:05:18 +0000 Subject: [TYPES/announce] Microsoft PhD Studentship In-Reply-To: <69563635-E2CC-4894-B15E-797D74B1FA6A@itu.dk> References: <69563635-E2CC-4894-B15E-797D74B1FA6A@itu.dk> Message-ID: Microsoft PhD Scholarship University of Birmingham School of Computer Science The School of Computer Science at the University of Birmingham is seeking to award a Microsoft PhD Scholarship on the topic "Structural Foundations for Heterogeneous Computation", starting on 1st October 2011. Applicants require a first-class Honours degree or equivalent in Computer Science, Mathematics or Computer Engineering, experience in programming and aptitude for mathematical subjects. A Masters degree is highly desirable. Experience in any of the following areas is relevant although no required: semantics, type theory, static analysis, system-level programming, microprocessor design, FPGA design, compiler design and optimisation, GPU programming. The position is open for UK and EU applicants, but exceptionally strong candidates from outside the EU may be considered subject to availability of funds. Before the Scholarship can be awarded the candidate must also undergo the formal admission procedure to the university. The Scholar will work under the supervision of Dr. Dan R. Ghica from University of Birmingham, a leading centre for research in programming language theory. On behalf of Microsoft Research, the Scholar will be also supervised by Prof. Satnam Singh. The Microsoft PhD Scholarship Programme recognises and supports exceptional students who show the potential to make an outstanding contribution to science and computing. Each Microsoft scholarship consists of an annual bursary of ?23,000 for up to a maximum of three years. In addition, every Scholar receives a laptop with a selection of software applications. During the course of their PhD, Scholars are invited to Microsoft Research in Cambridge for an annual Summer School that includes a series of talks of academic interest and posters sessions, which provides the Scholars the opportunity to present their work to Microsoft researchers and a number of Cambridge academics. Some of the Scholars may also be offered, at the discretion of Microsoft Research, an internship in one of the Microsoft Research laboratories. Internships involve working on a project alongside and as part of a team of Microsoft researchers. Scholars are paid during their internship, in addition to their scholarship bursary. To apply please submit the following to Dr. Dan R. Ghica (d.r.ghica at cs.bham.ac.uk ) before May 1st: ? an up-to-date copy of your CV ? a copy of your University transcript detailing all your examination results to date ? the name and contacts of three referees ? a sample of your academic publications such as articles or dissertations ? any other relevant information (e.g. links to web-sites, blogs, software portfolio) ? a covering letter. For further information, visit: ? Microsoft PhD Scholarships: http://research.microsoft.com/en-us/collaboration/global/open-phd-positions.aspx ? Dan R. Ghica's page: http://www.cs.bham.ac.uk/~drg/ ? Satnam Singh's page: http://research.microsoft.com/en-us/people/satnams/ ? Heterogeneous computing: http://en.wikipedia.org/wiki/Heterogeneous_computing From jfield at us.ibm.com Sun Mar 13 18:18:02 2011 From: jfield at us.ibm.com (John Field) Date: Sun, 13 Mar 2011 18:18:02 -0400 Subject: [TYPES/announce] POPL 12: Call for Proposals for Workshops, Tutorials, and Other Events Message-ID: ******************************************************************************* *** POPL '12: Call For Proposals for Workshops, Tutorials, and Other Events *** ******************************************************************************* Proposal submission deadline: 22 April 2011 Notification: 22 May 2011 Co-located event dates: 22--24 and 28 January 2012 Conference location: Philadelphia, USA Proposals are invited for workshops, tutorials, and other events to be co-located with POPL 2012, the 39th ACM Symposium on Principles of Programming Languages. Events may 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/2012/call-for-events/ POPL '12 call for papers: http://www.cse.psu.edu/popl/12/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From antonio at iist.unu.edu Sun Mar 13 20:13:33 2011 From: antonio at iist.unu.edu (Antonio Cerone) Date: Mon, 14 Mar 2011 08:13:33 +0800 (CST) Subject: [TYPES/announce] Call for Tutorials and Workshops: ICTAC 2011 - Theoretical Aspects of Computing Message-ID: Call for Tutorial and Workshop Proposals at ICTAC 2011 International Colloquium on Theoretical Aspects of Computing 29-30 August 2011, Johannesburg, South Africa URL: http://www.ictac.net/ictac2011/ ------------------------------------------------- WORKSHOP PROPOSALS EXTENDED DEADLINES Submission: 31 March 2011 Notification of acceptance: 11 April 2011 ------------------------------------------------- BACKGROUND ICTAC 2011 is the 8th 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 2011 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; * 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 fo engineering computing systems; * service-oriented development; * service-oriented architectures: models and development methods; * document-driven development; * models of concurrency, security, and mobility; * theory of parallel, distributed, and grid computing; * real-time, embedded and hybrid systems; * type and category theory in computer science; * models for learning and education; * cognitive architectures; * qualitative reasoning; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. KEYNOTE SPEAKERS * Jayadev Misra * David Parnas * Willem Visser LOCATION Tutorials and Workshops are hosted by the University of the Witwatersrand, Johannesburg, South Africa at its Braamfontein campus. The university is a leading learning institute on the continent and is in close proximity to a number of hotels and provides an established facility to hold the tutorial portion of the event. The Colloquium will be held at a game lodge two hours drive outside Johannesburg with facilities to experience the wilderness at first hand while attending ICTAC. PROPOSAL SUBMISSIONS You are welcome to submit proposals for tutorials and workshops on the subjects related to the colloquium topics. TUTORIAL proposal submissions: It should include detailed description of tutorial contents, time duration (half/one day), intended audience, biography of presenter(s) and extended abstract not exceeding 5 pages. Extended abstracts of the accepted tutorials will be included in the proceedings of the ICTAC 2012 colloquium to be published in the LNCS series by Springer. WORKSHOP proposal submissions: It should include detailed description of background and aims, duration (one or two days), intended audience, estimated number of participants, proceedings publication policy, biography of the organiser(s), information on perspective keynote speakers, provisional budget for additional expenses to be factored in the workshop fee (e.g. keynote speakers, printing, social event). Standard workshop fee will cover lunches, refreshments, room and equipment. All proposals should be written in English and should not exceed 10 pages. Proposal submissions should be sent to: ictac2011 at iist.unu.edu WORKSHOPS IMPORTANT DATES Submission: 31 March 2011 Notification of acceptance: 11 April 2011 ICTAC 2011 Workshops: 29-30 August 2011 TUTORIALS IMPORTANT DATES Submission: 5 June 2011 Notification of acceptance: 24 June 2011 ICTAC 2011 Tutorials: 29-30 August 2011 ORGANISING COMMITTEE * Antonio Cerone, Macau SAR China * Coenraad Labuschagne, South Africa * Pekka Pihlajasaari, South Africa * David Sherwell, South Africa * Clint van Alten, South Africa STEERING COMMITTEE * John Fitzgerald, UK * Martin Leucker, Germany * Liu Zhiming, Macau SAR China * Tobias Nipkow, Germany * Augusto Sampaio, Brazil * Natarajan Shankar, USA * Jim Woodcock, UK ------------------------------------------------- Antonio Cerone Research Fellow UNU-IIST, Macau SAR China From icfp.publicity at googlemail.com Mon Mar 14 06:53:10 2011 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Mon, 14 Mar 2011 11:53:10 +0100 Subject: [TYPES/announce] ICFP 2011 Deadline Extension Message-ID: ===================================================================== ICFP 2011: International Conference on Functional Programming http://www.icfpconference.org/icfp2011 ===================================================================== On behalf of the Program Committee of ICFP 2011, I would like to announce a deadline extension for authors affected by the recent earthquake in Japan. The Program Committee will accept titles and abstracts until Monday 4 April at 23:59, and full submissions until Thursday 7 April at 23:59 from those authors affected by the earthquake. Our thoughts go out to the victims of this tragedy. Wouter Swierstra ICFP Publicity Chair From gvidal at dsic.upv.es Mon Mar 14 07:21:00 2011 From: gvidal at dsic.upv.es (German Vidal) Date: Mon, 14 Mar 2011 12:21:00 +0100 Subject: [TYPES/announce] LOPSTR 2011 - Last CFP Message-ID: <9EEA1E6B-6D07-4862-B8DB-755509DAA69C@dsic.upv.es> News: - Invited speakers: * John Gallagher (Roskilde University, Denmark) * Fritz Henglein (University of Copenhagen, Denmark) * Vitaly Lagoon (Cadence Design Systems, Boston, USA) - Springer accepted to publish the post-proceedings in the Lecture Notes in Computer Science series. - Submission deadlines approaching: * Paper submission: March 27, 2011 * Extended abstract submission: April 3, 2011 ============================================================ Call for papers 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011, AAIP 2011 and WFLP 2011) ============================================================ Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 21st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2011) will be held in Odense, Denmark; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2011 will be co-located with PPDP 2011 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming- in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: - specification - synthesis - verification - transformation - analysis - optimisation - specialization - partial evaluation - inversion - composition - program/model manipulation - certification - security - transformational techniques in SE - applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, the formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. IMPORTANT DATES AND SUBMISSION GUIDELINES: - Paper submission: March 27, 2011 - Extended abstract submission: April 3, 2011 - Notification (for pre-proceedings): May 16, 2011 - Camera-ready (for pre-proceedings): June 12, 2011 - Symposium: July 18-20, 2011 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Lecture Notes in Computer Science style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2011 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings to be published by Springer in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2011 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal proceedings. Invited speakers: - John Gallagher, Roskilde University, Denmark - Fritz Henglein, University of Copenhagen, Denmark (shared with PPDP) - Vitaly Lagoon, Cadence Design Systems, Boston, USA (shared with PPDP) Program Committee: Elvira Albert (Complutense University of Madrid, Spain) Malgorzata Biernacka (University of Wroclaw , Poland) Manuel Carro (Technical University of Madrid, Spain) Michael Codish (Ben-Gurion University of the Negev, Israel) Danny De Schreye (K.U.Leuven, Belgium) Maribel Fernandez (King's College London, UK) Raul Gutierrez (University of Illinois at Urbana-Champaign, USA) Mark Harman (University College London, UK) Frank Huch (C.A.U. Kiel, Germany) Michael Leuschel (University of Dusseldorf, Germany) Yanhong Annie Liu (State University of New York at Stony Brook, USA) Kazutaka Matsuda (Tohoku University, Japan) Fred Mesnard (Universite de La Reunion, France) Ulrich Neumerkel (Technical University of Wien, Austria) Alberto Pettorossi (Universita' di Roma Tor Vergata, Italy) Carla Piazza (University of Udine, Italy) Peter Schneider-Kamp (University of Southern Denmark, Denmark) Hirohisa Seki (Nagoya Institute of Technology, Japan) Josep Silva (Technical University of Valencia, Spain) German Vidal (Technical University of Valencia, Spain) Jurgen Vinju (Centrum Wiskunde & Informatica, The Netherlands) Jianjun Zhao (Shanghai Jiao Tong University, Shanghai) Contacts Program Chair (contact him for additional information about papers and submissions): German Vidal Department of Computer Science (DSIC) Universitat Politecnica de Valencia Valencia, Spain Email: lopstr11 at dsic.upv.es General Chair Peter Schneider-Kamp Dept. of Mathematics and Computer Science University of Southern Denmark Campusvej 55 DK-5230 Odense M, Denmark Email: petersk at imada.sdu.dk From Lutz.Schroeder at dfki.de Mon Mar 14 05:48:41 2011 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Mon, 14 Mar 2011 10:48:41 +0100 Subject: [TYPES/announce] FHIES 2011: First Call for Papers Message-ID: <4D7DE479.7080408@dfki.de> [Thanks for distributing the call for papers below] ======= CfP======================================================== FHES 2011 International Symposium on Foundations of Health Information Engineering and Systems (http://www.iist.unu.edu/ICTAC/FHIES2011/) 27-29 August 2011 Mabalingwe Nature Reserve, South Africa (Colocated with ICTAC 2011) Information and communication technology plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world, that are the concern of the United Nations, its Peoples and Members States. The use of software in medical devices is already raising issues in relation to safety and efficacy for manufacturers and regulators. Health information systems raise issues of both privacy and confidentiality, on the one hand, and, increasingly, patient safety on the other. Hospital and other information systems raise important issues of efficacy and interoperability. However, to capitalize on the potential of this technology in reshaping healthcare demands focused research on sound and safe development techniques from software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. Aims ===== The purpose of the new symposium series on Foundations of Software Engineering Health Informatics (FHIES) is to promote a nascent research area that aims to develop and apply theories and techniques in computing science and software engineering to modelling, building and certifying software based systems in the application domain of healthcare. Many of these systems are already regulated in many jurisdictions and many more of them will become regulated in the future. Research on theories, techniques and tools of software modelling, verification and validation has been an important area of computer science and software engineering, known as Formal Methods. This research addresses the challenging problem of design and certification of safety or mission critical software systems through abstraction and decomposition techniques based on the use of mathematical modelling theories and sound engineering methods. Formal methods have primarily addressed the correctness of systems used in the industrial, financial, and defence applications. However, they have recently found application in modelling and analysis of complex systems that involve interacting behaviour of many kinds of objects and agents, including software systems, physical objects and humans. The models of these systems have both discrete and continuous behaviour, and both qualitative and quantitative (e.g., spatial timing and probabilistic) properties. It is believed that these methods can be used for modelling problems of health informatics, which presents the challenge of scalability. Software plays a critical role in sustainable health care, both as part of the solution and as part of the problem. Software intensive information systems are needed to support the collection and processing of vast amounts of data via different devices, and allow policy makers to access and share these data, and to support their decision making and validation. Software systems can be developed for managing, controlling and monitoring policies, processes and workflows in medical systems. Software systems can be developed to help create the sophisticated medical devices that are simply impossible to build without the software. On the other hand, the application of software raises challenging issues in safety, security and privacy, and increases the complexity of healthcare workflows and the need for new business policies. Paper Submissions ============== We solicit high quality submissions reporting on 1. original research contributions (18 pages maximum in LNCS format) 2. application experience, case studies and software prototypes (18 pages maximum in LNCS format) 3. surveys, comparisons, and state-of-the-art reports (18 pages maximum in LNCS format) 4. position papers that define research projects with identified challenges and milestones (10 pages maximum in LNCS format) 5. proposals for panel discussions, with at least three named panellists, about a topical question (5 pages maximum in LNCS format). All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions should be in English, prepared in the LNCS format (see here for details). Submission constitutes a commitment to attend and present a paper, if accepted. All accepted papers will be included in the pre-event proceedings of the symposium. It is the plan to publish the post event proceedings either by ACM or Springer in the LNCS series, and it will include all the accepted submissions, EXCEPT FOR the proposals for panel discussions. The post proceedings will include a brief summary of panel discussions. Important Dates =========== Abstract Submission 29 May 2011 Paper Submission 5 June 2011 Notification of acceptance 18 July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 Organization ========= General Chairs * Peter Haddawy, UNU-IIST, Macao * Tom Maibaum, McMaster University, Canada Programme Chairs * Zhiming Liu, UNU-IIST, Macao * Alan Wassyng, McMaster University, Canada Organising Chair * Hao Wang, UNU-IIST, Macao Program Committee * Syed Mohamed Aljunid, UNU-IIGH * Sebastian Fischmeister, University of Waterloo, Canada * Peter Haddawy, UNU-IIST, Macao * Jozef Hooman, Embedded Systems Institute and Radboud University, Nijmegen, The Netherlands * Michaela Huhn, TU Clausthal, Germany * Mark Lawford, McMaster University, Canada * Insup Lee, University of Pennsylvania, USA * Martin Leucker, TU Munich, Germany * Wendy MacCaull, St. Francis Xavier University, Canada * Tom Maibaum, McMaster University, Canada * Dominique Mery, LORIA and Universite Henri Poincare Nancy 1, France * Jun Pang, University of Luxembourg, Luxembourg * David Robertson, University of Edinburgh, UK * Lutz Schr?der, DFKI Bremen and University of Bremen, Germany * Jens H. Weber, University of Victoria, Canada * Liang Xiao, Hubei University of Technology, P.R.China -- -------------------------------------- PD Dr. Lutz Schr?der Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder at dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum f?r K?nstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch?ftsf?hrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From vlad.rusu at inria.fr Mon Mar 14 10:00:28 2011 From: vlad.rusu at inria.fr (Vlad Rusu) Date: Mon, 14 Mar 2011 15:00:28 +0100 (CET) Subject: [TYPES/announce] AMMSE'11 - 2nd International Workshop on Algebraic Methods in Model-Based Software Engineering In-Reply-To: <3682971.34.1300111462419.JavaMail.rusu@initial.local> Message-ID: <10247916.36.1300111790530.JavaMail.rusu@initial.local> This is a reminder that the submission deadline for AMMSE 2011 is April 13. Please receive our apologies for multiple postings. --- CALL FOR PAPERS AMMSE'11 2nd International Workshop on Algebraic Methods in Model-Based Software Engineering A satellite event of the TOOLS'11 Conference Zurich, Switzerland, June 30, 2011 http://www.lcc.uma.es/~duran/AMMSE11 Aims and Scope: Over the past years there has been quite a lot of activity in the algebraic community about using algebraic methods for providing support to model-driven software engineering. The aim of this workshop is to gather researchers working on the development and application of algebraic methods to provide rigorous support to model-based software engineering. The topics relevant to the workshop are all those related to the use of algebraic methods to software engineering, including but not limited to: - formally specifying and verifying model-based software engineering concepts and related ones (MDE, UML, OCL, MOF, DSLs, ...) - tool support for the above - integration of formal and informal methods - theoretical frameworks (algebraic, rewriting-based, category theory-based, ...) The main goal is to examine, discuss, and relate the existing projects within the algebraic community that address common open-issues in model-driven software engineering. To foster the discussion among participants, our plan is to organize the workshop in two main sessions, with short individual presentations (20 minutes) followed by ample time slots for comments, questions, and exchange of ideas. Program Committee: Artur Boronat, University of Leicester, UK Roberto Bruni, University of Pisa, Italy Jordi Cabot, Ecole des Mines de Nantes, France Manuel Clavel, Imdea Software & Universidad Complutense de Madrid, Spain Francisco Duran, University of Malaga, Spain (co-chair) Martin Gogolla, University of Bremen, Germany Alexander Knapp, Augsburg University, Germany Juan de Lara, Universidad Autonoma de Madrid, Spain Jose Meseguer, University of Illinois, Urbana-Champaign, USA Pierre-Etienne Moreau, Ecole des Mines de Nancy & INRIA Nancy Grand-Est, France Peter Csaba Olveczky, University of Oslo, Norway Vlad Rusu, INRIA Lille Nord-Europe, France (co-chair) Gwen Salaun, Grenoble INP/INRIA/LIG. France Martin Wirsing, Ludwig-Maximilians-Universitat, Munchen, Germany Paper Submissions: Please submit your contributions via https://www.easychair.org/conferences/?conf=ammse2011 Submissions should be at most 15 pages long in the EPTCS LaTeX style, available at http://style.eptcs.org/ Venue: The selected papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). The organizers of TOOLS?11 are negotiating for an LNCS volume comprising extended versions of the best papers of all the TOOLS?11 satellite events. Important Dates: Paper submission: April 13, 2011 Author noti?cation: May 29, 2011 Final versions: June 12, 2011 Workshop: June 30, 2011 Contact: Francisco Duran duran[at]lcc.uma.es Vlad Rusu vlad.rusu[at]inria.fr From giannini at di.unipmn.it Mon Mar 14 12:23:11 2011 From: giannini at di.unipmn.it (Paola Giannini) Date: Mon, 14 Mar 2011 17:23:11 +0100 Subject: [TYPES/announce] CS2Bio 2011 Deadline Extension Message-ID: <4D7E40EF.4060003@di.unipmn.it> ================================================================ Due to delayed notification from DISCOTEC conferences the PAPER SUBMISSION DEADLINE is **Extended** to April 2th, 2011 **** CS2Bio'11 2nd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'11 9th of June 2011 Reykjavik, Iceland http://cs2bio11.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. In particular we want to encourage presentation of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present an attempt at modeling a specific biological phenomenon using formal techniques, or a technical innovation that can be applied to a range of potential biological systems. In the latter case, some emphasis on the scalability of the method will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Synthetic biology, circuits design (IGEM models) -- Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparisons between different formal models for the 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 Simulations: -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of Mathematical Structures in Computer Science is planned. *** INVITED SPEAKERS *** - Jasmin Fisher (Microsoft Research - Cambridge, UK) - Gordon Plotkin (Lab for Foundation of Computer Science - Edinburgh, UK) *** 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=cs2bio11). 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 (extended) deadline: 2 April 2011 - Notification to authors: 5 May 2011 - Workshop: 9 June 2011 *** PROGRAM COMMITTEE *** - Luca Cardelli - Francesca Cordero - Erik de Vink - Fran?ois Fages - J?r?me Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Jean-Louis Giavitto - Ion Petre - Gordon Plotkin - Angelo Troina - Verena Wolf - Gianluigi Zavattaro -- 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 james.cheney at gmail.com Mon Mar 14 19:14:45 2011 From: james.cheney at gmail.com (James Cheney) Date: Mon, 14 Mar 2011 23:14:45 +0000 Subject: [TYPES/announce] Last CFP: Workshop on Compilers by Rewriting, Automated (COBRA 2011) Message-ID: LAST CALL FOR PAPERS COBRA 2011 First Workshop on Compilers by Rewriting, Automated http://www.rdp2011.uns.ac.rs/workshops/cobra.html Sunday, May 29, 2011 COBRA is a new workshop intended to promote research in and collaboration on in the application of rewriting to compilers across academia and industry. We hope to provide a forum for presentation, exchange, and discussion, of directions, developments, and results, as well as surveys, tutorials, experience reports, and proposals, for what is possible in this area! The basic idea is that rewriting can be used to transform programs, and indeed is used in that many compilers include some kind of rewrite engine to realize optimizations such as algebraic rewrites, SSA tree rewrites, type inference, static reduction, etc. In this workshop it is our hope that focusing on the rewrite transformations as proper rewrite systems with formal rewrite rules can help us understand how we can give access to generic formal rewriting techniques in a way that can be directly exploited by the compiler writer without sacrificing performance and expressiveness of the analyses and transformations. So in short: if you have used or thought about using rewriting in a compiler, either a formal system or implemented a custom rewrite mechanism, then we would like to hear about it! The workshop will take place on Sunday, May 29, 2011, in Novi Sad, Serbia, colocated with the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011) as a satellite event of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2011). TOPICS We invite submissions in the form of extended abstracts on the following topics: * Issues on using in algebraic, rewriting, logic, and other formal notations, as compiler specification languages. * Formal notations for specifying specific compiler components such as normalization, intermediate languages, translation schemes, analysis, optimization, static reductions, code generation, data flow analysis. * The role of type and sort systems in compiler specifications. * The benefits and difficulties of higher order and first order formalisms in compiler specifications; the use of higher order abstract syntax and other encodings of binders. * Formal code generation issues such as typed assembly language. * How to generate efficient and even industrial strength compilers fully automatically from the specifications; how to deal with large sets of rewrite rules. * The development cycle for generated compilers including issues of development environments and debugging of formal compiler specifications. * Position papers on whether compiler generation based on rewriting can become a factor in mainstream compiler writing in industry and academia. * Experience reports on and demonstrations of compilers based on formal rewrite systems using systems such as ASF+SDF, IMP, Rascal, MetaPRL, Coq, or even ANTLR TreeGrammars. * System descriptions for new or extended systems used to build rewrite components of compilers, including systems that are themselves compilers for rewrite systems or other formalisms used to specify compilers. * Presentations of how certain stages of existing compilers could be specified as formal rewrite systems. Submissions should be no more than 6 pages and uploaded to http://www.easychair.org/conferences/?conf=cobra2011; if possible please use the LaTeX style from http://www.easychair.org/easychair.zip. IMPORTANT DATES * Last day for submissions: Monday, March 21, 2011. * Notification: Monday, April 4, 2011. * Preliminary proceedings version due: Wednesday, April 20, 2011. * Workshop: Sunday, May 29, 2011. SELECTION COMMITTEE * Kristoffer H. Rose (IBM Thomas J. Watson Research Center, chair) * James Cheney (University of Edinburgh) * Kevin Millikin (Google) For further information see the links on the conference web site, http://www.rdp2011.uns.ac.rs/workshops/cobra.html, or contact Kristoffer H. Rose, krisrose at us.ibm.com. From peterol at ifi.uio.no Tue Mar 15 13:42:48 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Tue, 15 Mar 2011 18:42:48 +0100 Subject: [TYPES/announce] First CfP: 8th International Symposium on Formal Aspects of Component Software Message-ID: --------------------------------------------------------------------- Call for Papers FACS 2011 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- Aims and Scope: The component-based software development approach has emerged as a promising paradigm to cope with the complexity of present-day software systems by bringing sound engineering principles into software engineering. However, many challenging conceptual and technological issues still remain in component-based software development theory and practice. Moreover, the advent of service-oriented computing has brought to the fore new dimensions, such as quality of service and robustness to withstand inevitable faults, that require revisiting established component-based concepts in order to meet the new requirements of the service-oriented paradigm. FACS 2011 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The symposium seeks to address the applications of formal methods in all aspects of software components and services. Specific topics include, but are not limited to: - formal models for software components and their interaction - formal aspects of services, service oriented architectures, and business processes - design and verification methods for software components and services - composition and deployment: models, calculi, languages - formal methods and modeling languages for components and services - model based and GUI based testing of components and services - component/service re-engineering and reuse - models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services - components for real-time, safety-critical, secure, and/or embedded systems - industrial or experience reports, and case studies - update and reconfiguration of component and service architectures - component systems evolution and maintenance - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self-adaptive systems Past Events: FACS'11 is the eighth event in a series of events founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The previous workshops in the FACS series were held in Pisa (September 2003, co-located with FM'03), Macau (October 2005), Prague (September 2006), Sophia-Antipolis (September 2007), Malaga (September 2008), Eindhoven (October 2009, held as part of the Formal Methods Week), and Guimaraes (October 2010). Invited speakers: TBA Submission: We solicit high-quality submissions reporting on: A- original research contributions (18 pages max, LNCS format); B- applications and experiences (18 pages max, LNCS format); C- surveys, comparisons, and state-of-the-art reports (18 pages max, LNCS format); D- tool papers (6 pages max, LNCS format); related to the topics mentioned above. In addition, we also solicit submissions to the Doctoral Track of FACS 2011, in the form of abstracts (2 pages, LNCS format) concisely capturing PhD-work-in-progress, related theme, context, research questions, envisaged contributions, and partial results. 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=facs2011. The final version of the paper must be prepared in LaTeX, adhering to the LNCS format. Publication: All accepted papers will appear in the pre-proceedings of FACS 2011. Revised versions of accepted papers in the categories A-D above will appear in the post-proceedings of the symposium that will be published as a volume in Springer's Lecture Notes in Computer Science series. 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: Categories A-D abstract submission: June 10, 2011 Categories A-D submission: June 17, 2011 Categories A-D acceptance notification: August 9, 2011 Doctoral Track submission: August 12, 2011 Doctoral Track acceptance notification: August 20, 2011 Symposium: September 14-16, 2011 Venue: FACS 2011 is hosted by the Department of Informatics at the University of Oslo. The symposium will take place in the new modern computer science building on the main campus of the university. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Program chairs: Farhad Arbab (Leiden University and CWI, The Netherlands) and Peter Olveczky (University of Oslo, Norway) Program committee: Erika Abraham (RWTH Aachen University, Germany) Farhad Arbab (Leiden University and CWI, The Netherlands) Christel Baier (Technical University of Dresden, Germany) Luis Barbosa (University of Minho, Portugal) Mihaela Bobaru (NASA/JPL, USA) Frank de Boer (CWI, The Netherlands) Christiano Braga (Universidade Federal Fluminense, Brazil) Roberto Bruni (University of Pisa, Italy) Carlos Canal (University of Malaga, Spain) Francisco Duran (University of Malaga, Spain) Rolf Hennicker (Ludwig-Maximilians-Universitaet Munich, Germany) Alexander Knapp (Augsburg University, Germany) Zhiming Liu (IIST UNU, Macau) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia Antipolis, France) Sun Meng (Peking University, China) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Frantisek Plasil (Charles University, Czech Republic) Gwen Salaun (Grenoble INP - INRIA, France) Bernhard Schaetz (fortiss GmbH, Germany) Wolfram Schulte (Microsoft Research, Redmond, USA) Nishant Sinha (NEC Labs, Princeton, USA) Marjan Sirjani (Reykjavik University, Iceland) Volker Stolz (University of Oslo, Norway) Carolyn Talcott (SRI International, USA) Emilio Tuosto (University of Leicester, UK) Steering Committee: Zhiming Liu (coordinator) (IIST UNU, Macau) Farhad Arbab (Leiden University and CWI, The Netherlands) Luis Barbosa (University of Minho, Portugal) Carlos Canal (University of Malaga, Spain) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia-Antipolis, France) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Bernhard Schaetz (fortiss GmbH, Germany) Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From antonio at iist.unu.edu Tue Mar 15 21:59:04 2011 From: antonio at iist.unu.edu (Antonio Cerone) Date: Wed, 16 Mar 2011 09:59:04 +0800 (CST) Subject: [TYPES/announce] CfP: Modelling for Sustainable Development at SEFM 2011 Message-ID: Call for Papers - SEFM 2011 Special Track on MODELLING FOR SUSTAINABLE DEVELOPMENT at the 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM) 14-18 November 2011 Montevideo, Uruguay URL: http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES * Title and abstract submission deadline: 23 April 2011 * Paper submission deadline: 30 April 2011 * Acceptance/rejection notification: 15 June 2011 * Camera-ready version due: 15 July 2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the Special Track on MODELLING FOR SUSTAINABLE DEVELOPMENT at SEFM 2011 is to bring together practitioners and researchers from academia, industry, government and non-government organisations to present research results and exchange experience, ideas, and solutions for modelling and analysing complex systems in various domain areas, such as economy, health, biology, ecology, climate and poverty reduction, that address problems of sustainable development. Papers that present realistic applications to sustainable development and make use of techniques such as simulation, visualisation, animation, nonlinear systems analysis, model-checking and inferential statistics are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic. These can either be normal or short papers. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. TOPICS Modelling methodologies and notations include, but are not limited to: - Systems Dynamics - Systems of Differential Equations - Game Theory - Machine Learning - Agent-based Methodologies - Process Calculi - Automata-based Notations - Rewriting Systems - Membrane Systems - Cellular Automata - Discrete Optimisation Modelling - Continuous Optimisation Modelling - Empirical Modelling Application domains include, but are not limited to: - Sustainability Science - Integrated Development Planning - Evidence-based Policy - Ecosystem Science - Epidemiology - Genetics - Population and Reintroduction Biology - Climate Change - Environmental Risk Assessment and Management - Poverty Reduction KEYNOTE SPEAKER * Matteo Pedercini, Millennium Institute, USA LOCATION SEFM 2011 will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (R?o de la Plata) http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. SUBMISSION AND PUBLICATION Submissions to the special track must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference special track. All papers must be written in English. Research and tool papers must not exceed 16 pages in the LNCS format while short papers must not exceed 8 pages in the LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). All queries on the submissions should be sent to: sefm2011-msd at iist.unu.edu Papers must be submitted electronically via the Easychair System: https://www.easychair.org/conferences/?conf=sefm2011msd (please note that this Easychair website is distinct from the one for general submissions to SEFM 2011) Accepted papers will be included in the proceedings of SEFM 2011, which will be published in the Springer Lecture Notes in Computer Science series (LNCS, www.springer.com/lncs). After the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a special issue of the SoSyM journal (Software and Systems Modeling, Springer), following the standard reviewing process of the journal. SPECIAL TRACK PROGRAM COMMITTEE * Roberto Barbuti, University of Pisa. Italy * Antonio Cerone, UN University, UNU-IIST, Macau SAR China (Chair) * Elsa Estevez, UN University, UNU-IIST, Macau SAR China * Peter Haddawy, UN University, UNU-IIST, Macau SAR China * Siu-Wai Leung, University of Macau, Macau SAR China * Paolo Milazzo, University of Pisa, Italy * Ion Petre, ?bo Akademi University, Finland * Dave Robertson, University of Edinburgh, UK * Weishuang Qu, Millennium Institute, USA * Siraj Shaikh, Coventry University, UK * Michael Sonnenschein, University of Oldenburg, Germany * Hefeng Tong, Institute of Scientific and Technical Information of China (ISTIC), China * Shaofa Yang, Chinese Academy of Sciences, SIAT, China ------------------------------------------------ Antonio Cerone Research Fellow United Nations University UNU-IIST, Macau SAR China From asyropoulos at yahoo.com Wed Mar 16 04:20:38 2011 From: asyropoulos at yahoo.com (Apostolos Syropoulos) Date: Wed, 16 Mar 2011 01:20:38 -0700 (PDT) Subject: [TYPES/announce] CIT-2011 & ScalCom-2011: Submission deadline extended to April 15, 2011 Message-ID: <808256.74909.qm@web110114.mail.gq1.yahoo.com> ? ? ? ? ? ? ? ? ? ? *** Fourth Call for Papers *** ? The 11th IEEE International Conference on Computer and Information ? ? ? ? ? ? ? ? ? ? ? ? Technology (CIT-2011) ? ? ? ? ? ? ? ? ? ?http://www.cs.ucy.ac.cy/CIT2011 ? ?The 11th IEEE International Conference on Scalable Computing and ? ? ? ? ? ? ? ? ? ? Communications (ScalCom-2011) ? ? ? ? ? ? ? ? ?http://www.cs.ucy.ac.cy/SCALCOM2011 ? ? ? ? ? ? ? ?*** EXTENDED DEADLINE: 15 APRIL 2011 *** ? ? ? ? ? ? ? ? ? 31st August -- 2nd September 2011 ? ? ? ? ? ? ? ? ? Coral Beach Hotel, Paphos, Cyprus CIT 2011 -------- CIT has become a primary venue for researchers and industry practitioners to discuss open problems, new research directions, and real-world case studies on all aspects of computer and information technology. CIT is soliciting original, previously unpublished and high quality papers addressing research challenges and advances spanning over the multidisciplinary aspects of information technology, computing science and computer engineering. The topics of the conference include, but are not limited to, broadly understood: - Computer and System Architecture - High Performance Computing - Utility Computing - Cloud Computing - Ubiquitous Computing - Software Engineering - Computer Networks - Telecommunications - Artificial Intelligence and Multi-Agent Systems - Computer Graphics/Image Processing - Information Visualization - Information Security - Management of Data and Database Systems - New Web Technology and Applications - IT in e-Health, e-Business, e-Learning, e-Government ScalCom 2011 ------------ Scalability is a primary consideration in the design and implementation of computing and communication systems. The rapid increases in the volume of information that needs to be processed by computers necessitates new architectures, software, algorithms, and tools to improve scalability. ScalCom-11 aims at providing an international forum for researchers and practitioners to discuss original ideas on all aspects of scalability in computing. ScalCom-11 is soliciting original, previously unpublished work addressing research challenges and presenting advances in the design and implementation of scalable computing and communication systems. The conference solicits papers broadly categorized in two tracks, Distributed Computing Systems and Parallel Computing Systems. Topics of interest include but are not limited to: Distributed Computing Systems -Distributed computing paradigms (cloud, grid, P2P, and utility computing) -Data management and data centers -Sensor networks and applications -Wireless and mobile computing -Internet-based computing, protocols, and applications -Security and privacy issues in distributed computing -Fault tolerance, reliability, and availability -Algorithms -System software (programming environments, OS, middleware) -Applications and tools Scalable Parallel Computing -Multi-core architectures -Graphics processors and accelerators -Interconnection networks -Compilers, programming models, and runtime environments -Operating systems and virtual machine monitors -Parallel I/O and storage systems -Exascale computing systems -Fault tolerance, reliability and dependability -Green parallel computing -Applications and tools Proceedings ----------- The conferences proceedings will be published by IEEE Computer Society. Important Dates --------------- Submission Deadline: April 15, 2011 *** Extended Deadline *** Notification of Acceptance: May 15, 2011 Camera-ready papers due: May 31, 2011 Paper Submission Guidelines --------------------------- All papers must be submitted electronically and in PDF format. The material presented should be original and not published or under submission elsewhere. Authors should submit full papers of up to 8 pages, following strictly the IEEE Computer Society Proceedings Manuscript style (available at http://www.computer.org/portal/web/cscps/formatting), using two-column, single-space format, with 10-point font size. Figures and references must be included in the 8 pages. Oversized papers will be automatically rejected by the PC chairs. At least one of the authors of each accepted paper must register early to attend the conference, in order for the paper to appear in the conference proceedings. ? ---------------------- Apostolos Syropoulos Xanthi, Greece From ps at ecs.soton.ac.uk Wed Mar 16 06:08:47 2011 From: ps at ecs.soton.ac.uk (Pawel Sobocinski) Date: Wed, 16 Mar 2011 10:08:47 +0000 Subject: [TYPES/announce] *SOS 2010* call for papers Message-ID: [Apologies for multiple postings] ********************************************************** SOS `11 - Structural Operational Semantics 2011 An Affiliated Workshop of CONCUR 2011 September 5, 2011, Aachen, Germany http://sos2011.ecs.soton.ac.uk/ ********************************************************** CALL FOR PAPERS ********************************************************** Submission of abstract: Friday 27th May 2011 Submission: Friday 3rd June 2011 ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - category theoretic approaches - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome - semantics for domain-specific languages and model-based engineering. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair (http://www.easychair.org/conferences/?conf=sos2011) by Wednesday, 3rd June 2011. Papers should take the form of a pdf file in EPTCS format (http://www.eptcs.org/), whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speaker --------------- Wan Fokkink (Vrije Universiteit Amsterdam, NL, joint with EXPRESS `11) Program Committee ----------------- Luca Aceto (Reykjavik, IS) Simon Bliudze (CEA LIST, FR) Filippo Bonchi (ENS Lyon & CNRS, FR) Fabio Gadducci (Pisa, IT) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL) Keiko Nakata (Talinn, EE) Michel Reniers (Eindhoven, NL, co-chair) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Daniele Varacca (Paris 7, FR) Important Dates --------------- Submission of abstract: Friday 27 May 2011 Submission: Friday 3 June 2011 Notification: Friday 1 July 2011 Final version: Friday 15 July 2011 Workshop: Monday 5 September 2011 From cristina.pereira at informatics-europe.org Wed Mar 16 11:26:28 2011 From: cristina.pereira at informatics-europe.org (Cristina Pereira) Date: Wed, 16 Mar 2011 16:26:28 +0100 Subject: [TYPES/announce] 2011 Informatics Europe Curriculum Best Practices Award - Parallelism/Concurrency Message-ID: <4D80D6A4.3050707@informatics-europe.org> Dear Colleagues, Informatics Europe is proud to announce the 2011 Curriculum Best Practices Award, devoted to curriculum initiatives in the area of Parallelism and Concurrency. The initiative was officially announced first among the Informatics Europe Members last week and we are now publicizing it broadly to the whole community. We would be grateful if you could forward the information to your colleagues in the area of Parallelism and Concurrency that may be particularly interested in participating. The call containing full details can be found, as text, below, or in the attached pdf file. Kind regards, Dr. Cristina Pereira Informatics Europe Secretary-General *We apologize in case you have received multiple messages about the 2011 Curriculum Best Practices Award initiative. ------------------------------------------------------------------------ 2011 Informatics Europe Curriculum Best Practices Award Informatics Europe proudly announces the 2011 Curriculum Best Practices Award, devoted to curriculum initiatives in the area of Parallelism and Concurrency. The Informatics Europe Curriculum Best Practices 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 parallelism and concurrency * 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 collaboration, student projects, textbooks, influence on the curriculum of other universities. The 2011 Award is devoted to curriculum initiatives in the general area of parallelism and concurrency. It is funded through a generous grant from Intel Corporation. The amount of the Award is EUR 30,000.00 The Award can be awarded 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). Proposals should be submitted only at: http://www.easychair.org/conferences/?conf=informaticseuropebes 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); * Up to 5 letters of support. The letter of support will play an important role in the evaluation and may come from (for example) department management, academic colleagues in the same or another institution, industry colleagues; * A reference list (which may include URLs of supporting material) (max 3 pages). Deadlines: Abstract: May 1, 2011 Full proposal: June 1, 2011 Notification of winner(s): August 1, 2011 The Award will be presented at the 7th European Computer Science Summit, in Milan, 7-9 November 2011, 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: Michel Raynal, IRISA/University of Rennes 1 (chair) Gregor Engels, University of Paderborn (vice-chair) Gregory Andrews, University of Arizona Mordechai Ben-Ari, Weizmann Institute Thomas Gross, ETH Zurich Dan Grossman, University of Washington Rachid Guerraoui, EPF Lausanne Mark Harris, Intel Jeff Kramer, Imperial College Walter Tichy, University of Karlsruhe Akinori Yonezawa, University of Tokyo For full details visit: www.informatics-europe.org/curriculum-award For further inquires: ie-curriculum-award at informatics-europe.org _______________________________________________ ie-announce mailing list ie-announce at informatics-europe.org https://lists.inf.ethz.ch/mailman/listinfo/ie-announce -- ------------------------------------------------------------------------ Dr. Cristina Pereira Informatics Europe Clausiusstrasse 59 8092 Zurich Switzerland Tel: +41 44 633 9374 Cell: +41 77 455 2370 Fax: +41 44 632 1435 Skype: cris-zh-work cristina at informatics-europe.org ------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: IE-CBPA-call1.pdf Type: application/pdf Size: 244642 bytes Desc: IE-CBPA-call1.pdf URL: From swarat at cse.psu.edu Wed Mar 16 12:17:16 2011 From: swarat at cse.psu.edu (Swarat Chaudhuri) Date: Wed, 16 Mar 2011 12:17:16 -0400 Subject: [TYPES/announce] POPL 2012: Call for papers In-Reply-To: Message-ID: ********************************************************************* * 39th ACM SIGPLAN-SIGACT Symposium * on * Principles of Programming Languages * * Philadelphia, PA, USA * January 25-27, 2012 * * Call for Papers * * http://www.cse.psu.edu/popl/12 ********************************************************************* Important dates: Abstract submission 11:59:59 pm Samoa time, July 8, 2011 (Friday) Paper submission 11:59:59 pm Samoa time, July 12, 2011 (Tuesday) Author response September 14-18, 2011 (Wednesday-Saturday) Author notification October 3, 2011 (Monday) Camera ready November 8, 2011 (Tuesday) Conference January 25-27, 2012 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"). Evaluation The program committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper should explain its contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. More advice on writing technical papers can be found on the SIGPLAN Author Information page; advice on writing pearls can be found in the ICFP 2008 Call for Papers. Submission guidelines Authors should submit an abstract of at most 300 words and a full paper of no more than 12 pages formatted according to the ACM proceedings format. These 12 pages include everything (i.e., it is the total length of the paper). The program chair will reject papers that exceed the length requirement or are submitted late. Templates for ACM format are available for Word Perfect, Microsoft Word, and LaTeX at http://www.acm.org/sigs/sigplan/authorInformation.htm (use the 9 pt template). Submissions should be in PDF and printable on US Letter and A4 sized paper. Submitted papers must adhere to the SIGPLAN Republication Policy. Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. Following the recent history of PLDI and the lengthier history of other conferences, POPL'12 will employ double-blind reviewing. To facilitate this, submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors' own related work should be in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). The program chair has put together a document answering frequently asked questions that hopefully addresses many common concerns. When in doubt, contact the program chair. There is an option on the paper submission page to submit supplementary material, e.g., a tech report including proofs, or the software used to implement a system. This supplemental material should NOT be anonymized; it will be made available to reviewers after the intial reviews have been completed and author names are revealed. As usual, reviewers may choose to use the supplemental material or not at their discretion. The URL for paper registration and submission will be announced closer to the submission deadline. Author Response Period Authors will have four days to read and respond to the reviews of their papers before the PC meeting. Details of the response process will be announced by e-mail a few days beforehand. General Chair: John Field IBM T.J. Watson Research Laboratory PO Box 704, Yorktown Heights, NY 10598, USA. jfield at us.ibm.com Program Chair: Michael Hicks Department of Computer Science University of Maryland, College Park, MD 20866, USA mwh at cs.umd.edu Program Committee: Swarat Chaudhuri Pennsylvania State University, USA Adam Chlipala Harvard University, USA Dan R. Ghica University of Birmingham, UK Aarti Gupta NEC Labs America, USA Chris Hawblitzel Microsoft Research, Redmond, USA Suresh Jagannathan Purdue University, USA Ranjit Jhala University of California, San Diego, USA Sorin Lerner University of California, San Diego, USA Ondrej Lhotak University of Waterloo, Canada P. Madhusudan University of Illinois at Urbana-Champaign, USA Rupak Majumdar MPI-SWS, Germany Matthew Might University of Utah, USA Todd Millstein University of California, Los Angeles, USA Greg Morrisett Harvard University, USA Andrew Myers Cornell University, USA Matthew Parkinso Microsoft Research, Cambridge, UK Frank Piessens K.U. Leuven, Belgium Andrew Pitts University of Cambridge, UK Andreas Podelski University of Freiburg, Germany Fran?ois Pottier INRIA, France Norman Ramsey Tufts University, USA Tachio Terauchi Tohoku University, Japan Mandana Vaziri IBM Research, USA Dimitrios Vytiniotis Microsoft Research, Cambridge, UK Nobuko Yoshida Imperial College, London, UK Francesco Zappa Nardelli INRIA, France Workshops Chair: Matthew Might University of Utah Treasurer: Bor-Yuh Evan Chang University of Colorado, Boulder Publicity Chair: Swarat Chaudhuri Pennsylvania State University External review committee: Umut Acar, MPI-SWS Rajeev Alur, Penn Josh Berdine, MSR Cambridge Emery Berger, UMass Hans Boehm, HP Labs Ahmed Bouajjani, Paris David Brumley, CMU Bor-Yuh (Evan) Chang, Colorado James Cheney, Edinburgh Koen Claessen, Chalmers William Cook, UT Austin Derek Dreyer, MPI-SWS John Field, IBM T.J. Watson Robby Findler, Northwestern Cormac Flanagan, UCSC Jeff Foster, Maryland Nate Foster, Cornell Patrice Godefroid, MSR Redmond Andy Gordon, MSR Cambridge Dan Grossman, Washington Rajiv Gupta, UC Riverside Kohei Honda, Queen Mary Joxan Jaffar, Singapore Somesh Jha, Wisconsin Patty Johann, Strathclyde Neel Krishnaswami, MSR Cambridge Viktor Kuncak, EPFL Paul Levy, Birmingham Yitzhak Mandelbaum, AT&T Roman Manevich, UT Austin Ken McMillan, MSR Mayur Naik, Intel Aditya Nori, MSR Bangalore Luke Ong, Oxford Erez Petrank, Technion Simon Peyton Jones, MSR Cambridge Brigitte Pientka, McGill Mark Ryan, Birmingham Andrey Rybalchenko, T.U. Munchen Vijay Saraswat, IBM T.J. Watson Helmut Seidl, T.M. Munchen Peter Sewell, Cambridge Chung-chieh Shan, Rutgers Zhong Shao, Yale Satnam Singh, MSR Cambridge Yannis Smaragdakis, UMass Manu Sridharan, IBM T.J. Watson Sam Staton, Cambridge Zhendong Su, UC Davis Nikhil Swamy, MSR Redmond Ashish Tiwari, SRI Stavros Tripakis, VERIMAG Jean-Baptiste Tristan, Harvard Martin Vechev, IBM T.J. Watson David Walker, Princeton Stephanie Weirich, UPenn Adam Welc, Intel Kwangkeun Yi, Seoul Steve Zdancewic, UPenn Noam Zeilberger, Univ. of Paris 7 From colin.riba at ens-lyon.fr Wed Mar 16 12:36:23 2011 From: colin.riba at ens-lyon.fr (Colin RIBA) Date: Wed, 16 Mar 2011 17:36:23 +0100 Subject: [TYPES/announce] [Reminder] CHOCO meeting & Differential Linear Logic course - 4th to 7th April 2011 Message-ID: <1300293383.13761.81.camel@acalou.lip.ens-lyon.fr> Dear all, [Apologies for multiple copies] SECOND CALL FOR PARTICIPATION & CONTRIBUTED TALKS for the final meeting of the French ANR project Choco http://choco.pps.jussieu.fr/event32/ The meeting will take in place in ENS de Lyon, France from Monday 4th April to Thursday 7th April 2011. ================================================= There will invited talks, a course on differential linear logic and few sessions of contributed talks. We are pleased to announce invited talks by - Richard Blute (Ottawa, CA) - Daniel Leivant (Indiana University, USA) - Glynn Winskel (Cambridge, UK) The course on Differential Linear Logic will be made of 5 sessions of 1h30 : - Models (2 sessions) : T. Ehrhard (PPS, CNRS & Paris 7) and L. Vaux (IML, Marseille) - Differential Nets & Lambda-Calculus (2 sessions) : M. Pagani (LIPN, Paris 13) and P. Tranquilli (LIP, ENS de Lyon) - Uniformity and Taylor expansion (1 session) L. Regnier (IML, Marseille) More details about contents of invited talks and schedule will be added to the Choco web page when available. PRELIMINARY SCHEDULE ==================== http://tinyurl.com/6j4pp6v CONTRIBUTED TALKS ================= If you want to give a talk please contact me before the 18th of March. Slots will be attributed on a first asked first served basis. REGISTRATION ============ There is no registration fee, but an informal registration (by sending me an email) is required by the 25th of March. Practical informations on how to come in ENS de Lyon and on accomodation in Lyon are available here : http://www.ens-lyon.fr/LIP/web/index.php?option=com_content&view=article&id=48&Itemid=54 IMPORTANT DATES =============== Talk submission : March 18th Participation : March 25th Meeting : April 4th to 7th From andrei at chalmers.se Thu Mar 17 10:03:50 2011 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Thu, 17 Mar 2011 15:03:50 +0100 Subject: [TYPES/announce] Summer School in Software Engineering and Verification 2011 - Call For Participation Message-ID: <4D8214C6.3020401@chalmers.se> Call for participation Summer School in Software Engineering and Verification will take place outside of Moscow, Russia, on July 17?27, 2011. The school is co-sponsored by Microsoft Research and is organized in cooperation with the Higher School of Economics (HSE) in Moscow. Courses The school will consist of a number of courses from international leaders in their field, including: * Tony Hoare, Microsoft Research, UK foundations of program verification * Andrei Voronkov, University of Manchester, UK automation of proof and disproof * Patrice Godefroid, Microsoft Research, US software model checking and automatic test case generation * Yannis Smaragdakis, University of Massachusetts, Amherst, US static analysis and bug detection * Stephan Tobies, Microsoft, Germany verification of concurrent C programs and operating systems * Natasha Sharygina, University of Lugano, Switzerland model checking * Ben Livshits, Microsoft Research, US program analysis and its applications School Goals The aim of the school is to attract promising graduate students and young scientists, and to encourage and prepare them for research in software engineering, verification, and program analysis. The students will be exposed to a combination of classical results as well as leading-edge research. To encourage research participation, the students will be required to complete a project as part of the school. We also want to provide a stimulating environment for students to meet and establish ties with each other, local faculty members and industry researchers, as well as school lecturers, who are among the top scientists in their area. Primary participants We are primarily targeting students from Russia as well as countries in Scandinavia and Eastern Europe. For more information about the school and to register for the school, please consult: http://research.microsoft.com/en-us/um/redmond/events/sssev2011/ We strongly encourage people interested in participating to register as soon as possible. From M.Roggenbach at swansea.ac.uk Thu Mar 17 11:27:49 2011 From: M.Roggenbach at swansea.ac.uk (Markus Roggenbach) Date: Thu, 17 Mar 2011 15:27:49 +0000 Subject: [TYPES/announce] Post-doc position: Timed systems Message-ID: Applications are invited for a 2 year RA position at Swansea University, Wales, UK, on developing tool support, modelling and verifying railway systems in Timed CSP. Tool support shall be based the existing tool CSP-Prover. The position is part of the EPSRC/RSSB funded SafeCap project, an international cooperation between Swansea University, Newcastle University, the company Invensys as industrial partner, as well as the National Institute of Advanced Industrial Science and Technology AIST in Japan. The successful candidate will join the Processes and Data Group, see http://www.cs.swan.ac.uk/~csmarkus/ProcessesAndData/, as well as become a member of the Swansea Railway Verification Group. Informal enquiries are welcome and should be directed to Dr Markus Roggenbach, on +44 (0) 1792 513578, email: csmarkus at swan.ac.uk An application form and further details may be obtained at http://www.swan.ac.uk/personnel/Vacancies/Research/PostTitle,56696,en.php Closing date: Thursday 7 April 2011. From lengrand at lix.polytechnique.fr Thu Mar 17 12:03:03 2011 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Thu, 17 Mar 2011 17:03:03 +0100 Subject: [TYPES/announce] CfP: Proof-Search in Axiomatic Theories and Type Theories 2011 Message-ID: <4D8230B7.3060107@lix.polytechnique.fr> Call for Papers PSATTT 2011: International Workshop on Proof Search in Axiomatic Theories and Type Theories Wroclaw, Poland August 1, 2011 http://www.lix.polytechnique.fr/~lengrand/Events/PSATTT11/ Affiliated with CADE, Wroclaw, Poland Joint invited talk with the PxTP workshop. IMPORTANT DATES Paper / long abstract submission: May 2 Notification: May 30 Final papers due: June 27 Workshop: August 1 DESCRIPTION AND AIMS OF THE WORKSHOP This workshop continues the series entitled "Proof Search in Type Theories" (PSTT at CADE'09, FLOC'10), and enlarges its scope to encompass proof search in axiomatic theories as well. Generic proof-search in propositional and first-order logic (even second-order, higher-order) are fields that already benefit from a long research experience, spanning from techniques as old as unification to more recent concepts such as focusing and polarisation. More adventurous is the adaptation of generic proof-search mechanisms to the specificities of particular theories, whether these are expressed in the form of axioms or expressed by sophisticated typing systems or inference systems. The aim of this workshop is to discuss proof search techniques when these are constrained or guided by the shape of either axioms or inference/typing rules. But it more generally offers a natural (and rather informal) venue for discussing and comparing techniques arising from communities ranging from logic programming to type theory-based proof assistants, or techniques imported from the fields of automated reasoning and SMT but with an ultimate view to build proofs or at least provide proof traces. ============================ Topics of the workshop include, but are not limited to: - invertibility of deductive rules, polarity of connectives and focusing devices, - more generally, development and application of theorems establishing the existence of normal forms for proofs, - explicit proof-term representations and dynamic proof-term construction during proof-search, - use of meta-variables to represent unknown proofs to be found, - use of failure and backtracking in proof search, - integration of rewriting or computation into deductive systems, as organised by e.g. deduction-modulo - integration of domain-specific algorithms into generic deductive systems - transformation of goals into particular shapes that can be treated by domain-specific tactics or external tools - externalisation of some proof searching tasks and interpretation of the obtained outputs (justifications, execution traces...) - more generally, interfaces between cooperating tools - importation of automated reasoning techniques and SMT techniques to proof-constructing frameworks - quantifier instantiation in SMT techniques, arbitrary alternation of forall/exists quantifiers - unification in particular theories or in sophisticated typing systems More generally, contributions about the following topics are welcome - proof search strategies, their complexity and the trade-off between completeness and efficiency, - searching for proofs by induction, finding well-founded induction measures, strengthening goals to be proved by induction, etc, - reasoning on syntaxes with variable binding (in e.g. quantifiers or data structures), - termination, computational expressivity of related programming paradigms, - user interaction and interfaces, - systems implementing any of the ideas described above. Synthesising some of the above aspects into unifying theories is a concern of our research theme that aims at bringing together research efforts of different communities, enhancing their interaction. Contributions made in a spirit of synthesis are thus particularly welcome. ============================== SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 15-page limit in LNCS format, including bibliography. They can be shorter. System description are also welcome, with an 8-page limit and a demonstration on the day of the workshop. At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. PSATTT and PxTP are in the process of organizing a special issue in a journal, dedicated to their themes. The call will be open to everyone but will concern in particular the research material presented at PSATTT'11 and PxTP'11, as well as PSTT'08, PSTT'09 and PSTT'10. A specific refereeing round will ensure journal quality of the selected papers. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSATTT11/ PROGRAM COMMITTEE: Jeremy Avigad, Carnegie Mellon University Evelyne Contejean, CNRS - INRIA Saclay Amy Felty, University of Ottawa Stephane Lengrand, CNRS - Ecole Polytechnique David Pichardie, INRIA Rennes Aaron Stump, University of Iowa Enrico Tassi, INRIA Microsoft Research joint centre ORGANISERS Germain Faure, INRIA, France Stephane Lengrand, CNRS, France Assia Mahboubi, INRIA, France Contact details: psattt11 at easychair.org From carlos.martin at urv.cat Thu Mar 17 12:48:25 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Thu, 17 Mar 2011 17:48:25 +0100 Subject: [TYPES/announce] SSFLA 2011: last call Message-ID: 2011 INTERNATIONAL SPRING SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS (SSFLA 2011) (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain, April 18-22, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/ssfla2011/ ****************************************** ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. All courses will be made compatible in terms of schedule. COURSES AND PROFESSORS: Franz Baader (Dresden), Automata and Logic [advanced, 4 hours] Markus Holzer (Giessen), Computational Complexity [introductory, 14 hours] Thierry Lecroq (Rouen), Text Searching and Indexing [introductory, 10 hours] Rupak Majumdar (Kaiserslautern), Software Model Checking [introductory, 10 hours] Bernhard Steffen (Dortmund), Automata Learning from Theory to Application [introductory/advanced, 18 hours] Wolfgang Thomas (Aachen), omega-Automata and Infinite Games [introductory/advanced, 6 hours] Sheng Yu (London ON), Finite Automata and Regular Languages [introductory/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/ssfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until November 30, 2010), - 15 euros (for payments after November 30, 2010). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC) Please mention SSFLA 2011 and your full name in the subject. An invoice will be provided on site. Bank transfers should not involve any expense for the School. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is provided on the website of the School. CERTIFICATES: Students will be delivered a diploma stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: October 8, 2010 Starting of the registration: October 11, 2010 Early registration deadline: November 30, 2010 Starting of the School: April 18, 2011 End of the School: April 22, 2011 QUESTIONS AND FURTHER INFORMATION: Carlos Martin-Vide: carlos.martin at urv.cat WEBSITE: http://grammars.grlmc.com/ssfla2011/ POSTAL ADDRESS: SSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From jnfoster at cs.cornell.edu Thu Mar 17 22:21:51 2011 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Thu, 17 Mar 2011 22:21:51 -0400 Subject: [TYPES/announce] DBPL 2011 Call for papers Message-ID: The 13th International Symposium on Database Programming Languages http://www.cs.cornell.edu/conferences/dbpl2011 Seattle, Washington, USA August 29, 2011 co-located with VLDB 2011 Call for Papers For over 20 years, DBPL has established itself as the principal venue for publishing and discussing new ideas at the intersection of databases and programming languages. Many key contributions in query languages for object-oriented data, persistent databases, nested relational data, semistructured data, as well as fundamental ideas in types for query languages were first announced at DBPL. Today, the emergence of new data management applications such as Semantic Web and Web services, XML processing, Social and Sensor Networks, Cloud Computing and Peer-to-peer data management has lead to a new flurry of creative research in this area. DBPL is an established destination for such new ideas. ----- SCOPE ----- DBPL solicits theoretical and practical papers in all areas of Database Programming Languages. Papers emphasizing new topics or foundations of emerging areas are especially welcome. Suggested, but not exclusive, topics of interest for submissions include: * Data Exchange * Data Integration and Interoperability * Databases and Information Retrieval * Databases and the Semantic Web * Databases and Social Networking * Databases and Cloud Computing * Databases in Bioinformatics * Databases in Computational Linguistics * Declarative Data Centers * Dependent Type Systems * Information-Flow Type Systems * Managing Uncertain and Imprecise Information * Language-Integrated Query Mechanisms * Programming Language Support for Databases * Databases in E-commerce * Multimedia Databases * Peer-to-peer Data Management * Provenance * Stream Data Processing * Schema Mapping and Metadata Management * Security in Data Management * Semi-structured Data * Spatial and Temporal data * Transaction Management * Validation, Type-checking * Web Services * XML Processing ----------------- AUTHOR GUIDELINES ----------------- Prospective authors are invited to submit papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions should be no more than 6 pages long in the standard ACM SIG proceedings format with two columns and a nine-point font on a ten-point baseline. It is recommended that each submission begin with a succinct statement of the problem and a summary of the main results. If the authors believe more details are necessary to substantiate the main claims of the paper, they may include a clearly marked appendix to be read at the discretion of the committee. At least one author of each accepted paper must attend the symposium to present their work. Papers must be submitted online at the following URL: https://cmt.research.microsoft.com/DBPL2011/Default.aspx --------------- IMPORTANT DATES --------------- Submission : June 8, 2011 (11:59pm EDT) Notification : July 16, 2011 DBPL 2011 : August 29, 2011 ----------- PROCEEDINGS ----------- Accepted papers will appear in an informal proceedings, distributed electronically from the symposium website. ----------------- PROGRAM COMMITTEE ----------------- Nate Foster, Cornell University (Co-chair) Anastasios Kementsietsidis, IBM Research (Co-chair) Yanif Ahmad, Johns Hopkins Gavin Bierman, MSR-Cambridge Martin Bravenboer, LogicBlox Songyun Duan, IBM Research Floris Geerts, Edinburgh Pierre Geneves, CNRS Giorgio Ghelli, Universita di Pisa Todd Green, UC Davis Fritz Henglein, DIKU Feifei Li, Florida State Lipyeow Lim, Hawaii Sam Lindley, Edinburgh Kim Nguyen, NICTA Jorge Perez, Pontificia Universidad Catolica de Chile Dimitris Theodoratos, NJIT Yannis Velegrakis, Trento ------- HISTORY ------- The 13th Symposium on Data Base Programming Languages (DBPL 2011) continues the tradition of excellence initiated by its predecessors in Roscoff, Finistere (1987), Salishan, Oregon (1989), Nafplion, Argolida (1991), Manhattan, New York (1993), Gubbio, Umbria (1995), Estes Park, Colorado (1997), Kinloch Rannoch, Scotland (1999), Marino, Rome (2001), Potsdam, Germany (2003), Trondheim, Norway (2005), Vienna, Austria (2007), and Lyon, France (2009). DBPL has been affiliated with VLDB since 1999. From tobias.wrigstad at it.uu.se Fri Mar 18 05:31:49 2011 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Fri, 18 Mar 2011 10:31:49 +0100 Subject: [TYPES/announce] Summer School on Programming Languages for Concurrent and Parallel Computing Message-ID: Call for Participation The 2011 UPMARC Summer School on Multicore Computing focuses on programming languages for concurrent and parallel computing and will take place in Stockholm, Sweden in June 20-23, 2011. The school is subsidised by the UPMARC research programme (see upmarc.se) and is organised by Uppsala University. Courses The school consists of a number of lectures and talks from international leaders in their field, including: * Doug Lea, SUNY Oswego, US The Design and Engineering of Concurrency Libraries * Ganesh Gopalakrishnan, The University of Utah, US Formal Verification Methods for Message Passing and GPU Computing * Francesco Zappa Nardelli, INRIA Rocquencourt, France Shared Memory: An Elusive Abstraction * Philipp Haller, EPFL, Switzerland, and Stanford University, USA Scala for Multicore Programming * Joe Armstrong, Ericsson, Sweden Concurrent and Parallel Programming ? What's the difference? * Kostis Sagonas, Uppsala University, Sweden Erlang-style concurrency: pros, cons and implementation issues School Objective The objective of the school is to offer foundational tutorials accompanied by a selection of exiting new emerging technologies and industrial applications in the multicore-related areas, all given by leading scientific and industrial experts of the community. We aim to attract graduate students and young scientists and, through tutorials and lectures, prepare them for research on identifying and addressing fundamental challenges that will enable all programmers to leverage the potential performance from the ongoing shift to universal parallel computing. We also aim to provide a fun and stimulating environment for students to meet and establish connections with other students, world-class researchers from academia and industry, local faculty, and other senior scientists. For more information about the school, including how to register: http://upmarc.se/events/SS2011 There is also a printable flyer to distribute in your coffee room, or other venue: http://www.it.uu.se/research/upmarc/events/SS2011/flyer.pdf We strongly encourage people interested in participating to register as soon as possible. From Marc.Bezem at ii.uib.no Fri Mar 18 10:27:29 2011 From: Marc.Bezem at ii.uib.no (Marcus Aloysius Bezem) Date: Fri, 18 Mar 2011 15:27:29 +0100 Subject: [TYPES/announce] CSL'11 call for papers, deadline approaching Message-ID: ------------------------------------------------------------------- CALL FOR PAPERS AND WORKSHOP PROPOSALS CSL 2011 20th Annual Conference of the European Association for Computer Science Logic Bergen, Norway September 12-15, 2011 http://www.eacsl.org/csl11 IMPORTANT DATES Submission of title and abstract: March 27, 2011 Submission of full paper: April 3, 2011 Notification: May 30, 2011 Final paper due: June 17, 2011 GENERAL INFORMATION 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. The Ackermann Award for 2011 will be presented to the recipients at CSL 2011. CSL'11 will be preceded by TYPES 2011, the 18-th Workshop "Types for Proofs and Programs" (http://www.types.name) to be held in Bergen from 8-11 September. INVITED SPEAKERS Thomas Ehrhard (University Paris Diderot) Martin Otto (Technical University Darmstadt) Moshe Vardi (Rice University) Frank Wolter (University of Liverpool) SCOPE Topics of interest include (but are not limited to): - 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 - finite model theory - computational proof theory - 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 foundations of programming paradigms - logical aspects of quantum computing - verification and program analysis - linear logic - higher-order logic - nonmonotonic reasoning PROCEEDINGS The proceedings will be published in the series LIPIcs, Leibniz International Proceedings in Informatics. Each paper accepted by the Program Committee (PC) must be presented at the conference by one of the authors, and a final copy must be prepared according to LIPIcs guidelines (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/). PAPER 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: http://www.easychair.org/conferences/?conf=csl2011. Submitted papers must be in English and 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 intro- duction which is directed at all members of the program committee. Submission is in two phases with dates as given below. 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 journal by March 19, 2011. Papers authored or coauthored by members of the PC are not allowed. WORKSHOPS Proposals for satellite workshops on more specialized topics are welcome and can be sent to csl11 at eacsl.org PROGRAM COMMITTEE Samson Abramsky (Oxford) Andrea Asperti (Bologna) Franz Baader (Dresden) Matthias Baaz (Vienna) Johan van Benthem (Amsterdam/Stanford) Marc Bezem (Bergen, chair) Patrick Blackburn (Nancy) Andreas Blass (Michigan) Jan van den Bussche (Hasselt) Thierry Coquand (Gothenburg) Nachum Dershowitz (Tel Aviv) Valentin Goranko (Copenhagen) Erich Graedel (Aachen) Wiebe van der Hoek (Liverpool) Bart Jacobs (Nijmegen) Reinhard Kahle (Lisbon) Stephan Kreutzer (Oxford) Viktor Kuncak (Lausanne) Daniel Leivant (Indiana) Benedikt Loewe (Amsterdam) Jean-Yves Marion (Nancy) Eugenio Moggi (Genova) Albert Rubio (Barcelona) Anton Setzer (Swansea) Alex Simpson (Edinburgh) John Tucker (Swansea) Pawel Urzyczyn (Warsaw) Helmut Veith (Vienna) Andrei Voronkov (Manchester) ORGANIZING COMMITTEE Isolde Adler Marc Bezem Magne Haveraaen Michal Walicki Uwe Wolter CONFERENCE ADDRESS CSL 2011, Department of Informatics, University of Bergen, P.O.Box 7803, N-5020 Bergen, Norway http://www.eacsl.org/csl11 ----------------------------------------------------------------- From aaron.stump at gmail.com Fri Mar 18 11:01:49 2011 From: aaron.stump at gmail.com (Aaron Stump) Date: Fri, 18 Mar 2011 10:01:49 -0500 Subject: [TYPES/announce] CFP for PxTP 2011 Message-ID: The First International Workshop on Proof Exchange for Theorem Proving (PxTP) http://pxtp2011.loria.fr/ associated with The Conference on Automated Deduction (CADE), 2011. ---------------------------------------------------------------------- The goal of this new 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, tool papers or experience reports * 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. 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=pxtp2011 and follow the instructions there. PxTP will have no formal proceedings, but we anticipate a joint open call, together with the PSATTT workshop (also at CADE 2011), for a special issue of a journal with PxTP and PSATTT post-proceedings. ---------------------------------------------------------------------- Important dates Submission of papers: May 2nd, 2011 Notification: May 30th, 2011 Camera ready versions due: June 27th, 2011 Workshop: August 1st, 2011 ---------------------------------------------------------------------- Organizers Pascal Fontaine (INRIA, University of Nancy) Aaron Stump (The University of Iowa) Program Committee Clark Barrett (New York University) Christoph Benzm?ller (Articulate Software) Sacha B?hme (Technische Universit?t M?nchen) Amy Felty (University of Ottawa) Pascal Fontaine (INRIA, University of Nancy) Leonardo de Moura (Microsoft research) Hans de Nivelle (University of Wroc?aw) David Pichardie (INRIA Rennes) Stephan Schulz (Technische Universit?t M?nchen) Aaron Stump (The University of Iowa) Geoff Sutcliffe (University of Miami) Laurent Th?ry (INRIA) Tjark Weber (University of Cambridge) Bruno Woltzenlogel Paleo (Technische Universit?t Wien) ---------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Klaus.Havelund at jpl.nasa.gov Fri Mar 18 12:20:21 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (318M)) Date: Fri, 18 Mar 2011 09:20:21 -0700 Subject: [TYPES/announce] [fm-announcements] VVPS'11 CFP - deadline extension: March 25 Message-ID: ---------------------------------------------------------------------- CALL FOR PAPERS *** DEADLINE EXTENSION : March 25 *** 3rd ICAPS Workshop on Verification and Validation of Planning and Scheduling Systems (VVPS?11) http://icaps11.informatik.uni-freiburg.de/workshops/vvps.html Freiburg, Germany, June 13, 2011 ---------------------------------------------------------------------- Topic and Objectives: Planning and scheduling (P&S) systems are finding increased application in safety- and mission-critical systems that require a high level of assurance. However, tools and methodologies for verification and validation (V&V) of P&S systems have received relatively little attention. Therefore, important goals of the workshop are (i) to encourage the ongoing interaction between V&V and P&S communities, (ii) to identify innovative tools and methodologies (iii) and to elicit open issues and real challenges. The workshop also aims to enhance a stable, long-term establishment of a forum on relevant topics connected to the influence between V&V and P&S. The workshop series began in 2005 with the first edition of the workshop (http://planning.cis.strath.ac.uk/vvpsws/) during ICAPS '05 and continued in 2009 with the second edition (http://www-vvps09.imag.fr/) during ICAPS '09. These workshops presented a stimulating environment where researchers could discuss about the opportunities and challenges in integrating V&V and P&S. Topics of interest include: V&V of domain models, using technologies such as static analysis, theorem proving, and model checking; consistency and completeness of domain models; domain model coverage metrics; regression, stress and boundary testing; runtime verification of plan executions; generation of robust plans; compositional verification of domain models; how to structure domain models which are more amenable to static analysis; inspection methods; the relationship between timed automata and domain models; investigations of the impact wrt. V&V of procedural versus declarative plan models; application of P&S techniques to V&V; Planning as model checking; etc. Important Dates: Paper submission: March 25, 2011 ** extended deadline ** Notification of acceptance/rejection: April 15, 2011 Workshop Date: June 13, 2011 Submissions: There are two types of submissions: short position statements and regular papers. Position papers are a maximum of 2 (two) pages. Regular papers are a maximum of 10 (ten) pages. Papers should be submitted via the VVPS EasyChair website: http://www.easychair.org/conferences/?conf=vvps11 All papers should be typeset in the AAAI style, described at: http://www.aaai.org/Publications/Author/author.php Accepted papers will be published on the workshop website and printed as a hard-copy. A selection of the accepted papers will be published in a special issue of the International Journal on Software Tools for Technology Transfer: http://sttt.cs.uni-dortmund.de/index.html. Any additional questions can be directed towards the general workshop contact email: vvps11 at easychair.org Organization Chairs: Saddek Bensalem, VERIMAG, France saddek.bensalem at imag.fr Klaus Havelund, NASA JPL, U.S.A. klaus.havelund at jpl.nasa.gov Andrea Orlandini ITIA-CNR, Italy andrea.orlandini at itia.cnr.it Programme Committee: Howard Barringer (University of Manchester, UK) Andreas Bauer (NICTA, Australia) Saddek Bensalem (Verimag/UJF, France) (Co-Chair) Amedeo Cesta (ISTC-CNR, Rome, Italy) Alessandro Cimatti (FBK, Trento, Italy) Alexandre David (Aalborg University, Denmark) Giuseppe Della Penna (University of L'Aquila, L'Aquila, Italy) Lucas Dixon (University of Edinburgh, Edinburgh, UK) Bernd Finkbeiner (Saarland University, Germany) Alberto Finzi (University of Naples, Naples, Italy) Maria Fox (University of Strathclyde, UK) Dimitra Giannakopoulou (NASA Ames Research Center, USA) Enrico Giunchiglia (University of Genova, Italy) Alex Groce (Oregon State University, USA) Klaus Havelund (JPL, USA) (Co-Chair) Gerard Holzmann (JPL, USA) Felix Ingrand (LAAS-CNRS, France) Hadas Kress-Gazit (Cornell University, USA) Kim G. Larsen (Aalborg University, Denmark) Martin Leucker Technische Universit?t M?nchen, Germany) Lee McCluskey (University of Huddersfield, UK) David Musliner (SIFT, USA) Andrea Orlandini (ITIA-CNR, Milan, Italy) (Co-Chair) Corina Pasareanu (NASA Ames Research Center, USA) Charles Pecheur (Universit? catholique de Louvain, Belgium) Paul Pettersson (Malardalen University, Sweden) Douglas Smith (Kestrel Institute, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bengt.nordstrom at gmail.com Sun Mar 20 09:35:50 2011 From: bengt.nordstrom at gmail.com (Bengt Nordstrom) Date: Sun, 20 Mar 2011 14:35:50 +0100 Subject: [TYPES/announce] Types 2011 in Bergen 8 - 11 Sept. Submission deadline June 3. Message-ID: Types Meeting 2011 Bergen, 8 - 11 September 2011 www.types.name The 18-th Workshop "Types for Proofs and Programs" will take place in Bergen, Norway from 8 September to 11 September 2011. The CSL meeting will take place in Bergen 12 - 15 September. 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. We encourage all researchers to contribute talks on subjects related to the Types area of interest. Those 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. The talks may be based on newly published papers, work submitted for publication, but also work-in-progress. There are no formal pre-proceedings. More details on www.types.name Marc Bezem, Bergen University Bengt Nordstr?m, Chalmers From mokhov at cse.concordia.ca Sun Mar 20 15:06:57 2011 From: mokhov at cse.concordia.ca (Serguei A. Mokhov on behalf of PST-11) Date: Sun, 20 Mar 2011 15:06:57 -0400 Subject: [TYPES/announce] Privacy, Security, Trust (PST 2011) - Call for Papers (EXTENDED Deadline: April 3, 2011) Message-ID: <201103201906.p2KJ6vb8023873@alfredo.encs.concordia.ca> [ Apologies if you receive multiple copies of this announcement. Please pass it on to your colleagues and students who might be interested in contributing. ] NOTICE: due to several received requests, we extended the paper submission deadline to April 3, 2011. Ninth Annual Conference on Privacy, Security and Trust ------------------------------------------------------ July 19--21, 2011 Montreal, Quebec, Canada http://www.unb.ca/pstnet/pst2011 Call for Papers --------------- The PST2011 International Conference on Privacy, Security and Trust (PST) is being held in Montreal, Quebec, Canada, July 19-21, 2011. PST2011 is the ninth such annual conference focusing on PST technologies. PST2011 provides a forum for researchers world-wide to unveil their latest work in privacy, security and trust and to show how this research can be used to enable innovation. EasyChair submission link of PST 2011: http://www.easychair.org/conferences/?conf=pst2011. IMPORTANT DATES: ---------------- Submission Deadline: April 3, 2011 (new) Notification of Acceptance: May 16, 2011 (new) Final Manuscript Due: May 22, 2011 PST2011 will include an Innovation Day featuring workshops and tutorials followed by two days of high-quality research papers whose topics include, but are NOT limited to, the following: * Privacy Preserving / Enhancing Technologies * Trust Technologies, Technologies for Building Trust in e-Business Strategy * Critical Infrastructure Protection * Observations of PST in Practice, Society, Policy and Legislation * Network and Wireless Security * Digital Rights Management * Operating Systems Security * Identity and Trust management * Intrusion Detection Technologies * PST and Cloud Computing * Secure Software Development and Architecture * Human Computer Interaction and PST * PST Challenges in e-Services, e.g. e-Health, e-Government, e-Commerce * Implications of, and Technologies for, Lawful Surveillance * Network Enabled Operations * Biometrics, National ID Cards, Identity Theft * Digital forensics * PST and Web Services / SOA * Information Filtering, Data Mining & Knowledge from Data * Privacy, Traceability, and Anonymity * National Security and Public Safety * Trust and Reputation in Self-Organizing Environments * Security Metrics * Anonymity and Privacy vs. Accountability * Recommendation, Reputation and Delivery Technologies * Access Control and Capability Delegation * Continuous Authentication * Representations and Formalizations of Trust in Electronic and Physical Social Systems High-quality papers in all PST related areas that, at the time of submission, are not under review and have not already been published or accepted for publications elsewhere are solicited. Accepted papers will either be accepted as regular papers up to 8 pages and with oral presentations, or short papers of up to 2 pages with poster presentations. Up to 2 additional pages will be allowed in each category with over-length charges. The standard IEEE two-column conference format should be used for all submissions. A copy of the IEEE Manuscript Templates for Microsoft Word or LaTeX and additional information about paper submission and conference topics and events can be found at the conference web site. All accepted papers will be published in the conference proceedings and by IEEE and will be accessible via IEEE Xplore Digital Library. Best Paper and Best Student Paper awards will be presented. Some travel grants to students who are presenting their work in the conference will also be made available. Organizing Committee -------------------- Honorary Conference Chair: Andrew Vallerand, Director S&T Public Security, National Defense, Canada General Co-Chairs: Mourad Debbabi, Concordia University, Canada Amr M. Youssef, Concordia University, Canada Program Co-Chairs: Frederic Cuppens (Privacy), ENST-Bretagne, France Natalia Stakhanova (Security), University of South Alabama, USA Jianying Zhou (Trust), Institute for Infocomm Research, Singapore Workshop & Tutorial Chair: Ali Miri, Ryerson University, Canada Poster Session Chair: Franois Cosquer, Alcatel Lucent, France Publication & Publicity Chairs: Indrajit Ray, Colorado State University, USA Carlisle Adams, University of Ottawa, Canada PST Steering Committee Chair: Ali Ghorbani, University of New Brunswick, Canada Conference Manager: Greg Sprague, National Research Council, Canada Local Arrangements: Benjamin Fung, Concordia University, Canada Webmaster: Ilia Goldfarb, National Research Council, Canada Finance and Registration: Linda Vienneau, National Research Council, Canada Privacy Theme ------------- Privacy concerns the operational policies, procedures and regulations implemented within an information system to control for the unauthorized use of, access to, or release of personal information held in any format. Topics of interest in this theme include (but are not limited to): * privacy preserving/enhancing technologies * identity management and biometrics * privacy and ubiquitous computing, e.g. RFIDs * reputation, privacy and communities * e-health and privacy * anonymity and medical research * employee privacy and network administration * privacy and location-based technologies and services * privacy and traceability * spyware and stalking * anonymity, pseudonimity and accountability * responding to hate speech, flaming and trolls * privacy and emergency management policies and technologies * vulnerable online users and privacy sensitization * evolving nature of lawful surveillance * smart cards and privacy * identity theft and management * privacy audits and risk analysis * evolving role of privacy officers Privacy Theme Chair: Frederic Cuppens, TELECOM Bretagne, France Privace Theme Committee: Sushil Jajodia, George Mason University, USA Vijay Atluri, Rutgers University, USA Joaquin Garcia-Alfaro, Telecom Bretagne, France Nora Cuppens-Boulahia, Telecom Bretagne, France Alban Gabillon, Universit de la Polynsie Franaise, France Josep Domingo-Ferrer, Universitat Rovira i Virgili, Spain Ernesto Damiani, Universit degli Studi di Milano, Italy Ehud Gudes, Ben-Gurion University, Israel Carlisle Adams, University of Ottawa Esma Aimeur, University of Montreal Norm Archer, McMaster University Debra Grant, Office of the Information and Privacy Commissioner of Canada Steve Johnston, Office of the Privacy Commissioner of Canada Bradley Malin, Vanderbilt University Jian Pei, Simon Fraser University Teresa Scassa, University of Ottawa Jean-Marc Seigneur, University of Geneva Lisa Singh, Georgetown University Traian Truta, Northern Kentucky University Jens Weber, University of Victoria Security Theme -------------- Security addresses the various components of an information system that safeguard the data and associated infrastructure from unauthorized activity. Topics of interest in this theme include, but are not limited to: * access control * adaptive security and system management * analysis of network and security protocols * applications of cryptographic techniques * attacks against networks and machines * authentication and authorization of users, systems, and applications * botnets * critical infrastructure security * firewall technologies * forensics and diagnostics for security * intrusion and anomaly detection and prevention * malicious code analysis, anti-virus, anti-spyware * network infrastructure security * operating system security * public safety and emergency management * security architectures * security in heterogeneous and large-scale environments * techniques for developing secure systems * web security * wireless and pervasive/ubiquitous computing security Security Theme Chair: Natalia Stakhanova, University of South Alabama, USA Security Theme Committee: Michel Barbeau, Carleton University, Canada Mike Burmester, Florida State University, US Alvaro A. Cardenas, Fujitsu Laboratories, US Anton Chuvakin, Security Warrior Consulting, US Mathieu Couture, CRC, Canada Jose M. Fernandez, Ecole Polytechnique, Montreal, Canada Thorsten Holz, Ruhr-University Bochum, Germany Mohammed Houssaini Sqalli, King Fahd University of Petroleum & Minerals, Saudi Arabia H. Gunes Kayacik, Carleton University, Canada David Lie, University of Toronto, Canada Wei Lu, Keene State College, US Xinming Ou, Kansas State University, US Maria Papadaki, University of Plymouth, UK Nadia Tawbi, Universit Laval, Canada Julie Thorpe, University of Ontario Institute of Technology, Canada Issa Traore, University of Victoria, Canada Isaac Woungang, Ryerson University, Canada Alec Yasinsac, University of South Alabama, US Nur Zincir-Heywood, Dalhousie University, Canada Trust Theme ----------- Trust is a fundamental human behavior. It is necessary for people to function in social groups, and it forms the foundation for many of our organizations and relationships. The conference solicits original papers on any topic related to the personal, social, and economic aspects of trust. Topics of interest in this theme include (but are not limited to): * trust models * components and dimensions of trust * game theory and trusting behaviors * trust and risk * trust, regret, and forgiveness * perceptions of trustworthiness * trust management * automating trust decisions * attacks on trust * trust influences on security and privacy * economic drivers for trustworthy systems * cross-cultural differences * computing about trust * applications of trust * trust and economics * trust in e-commerce * reputation systems Trust Theme Chair: Jianying Zhou, Institute for Infocomm Research, Singapore Trust Theme Committee: Habtamu Abie, Norwegian Computing Center, Norway Claudio Agostino Ardagna, Universit degli Studi di Milano, Italy Robin Cohen, University of Waterloo, Canada Rino Falcone, National Research Council, Italy Jordi Forne, UPC, Spain Xinyi Huang, I2R, Singapore Steve Kremer, INRIA, France Costas Lambrinoudakis, University of Piraeus, Greece Albert Levi, Sabanci University, Turkey Hui Li, Xidian University, China Joseph Liu, I2R, Singapore Sangjae Moon, Kyungpook National University, Korea Yuko Murayama, Iwate Prefectural University, Japan Jose Onieva, University of Malaga, Spain Rolf Oppliger, eSECURITY Technologies, Switzerland Gunther Pernul, Universitt Regensburg, Germany Pierangela Samarati, Universit degli Studi di Milano, Italy Guilin Wang, University of Wollongong, Australia Yunlei Zhao, Fudan University, China Partners / Sponsors ------------------- * NRC-CNRC Canada * University of New Brunswick, Canada * Information Security Center of eXcellence (ISCX) * Concordia University, Montreal, Canada * National Cyberforensics and Training Alliance (NCFTA), Canada PST'11 From spider.vz at gmail.com Tue Mar 22 08:10:10 2011 From: spider.vz at gmail.com (Vadim Zaytsev) Date: Tue, 22 Mar 2011 13:10:10 +0100 Subject: [TYPES/announce] SLE 2011 - Final Call for Papers Message-ID: ============================================================ FINAL CALL FOR PAPERS SLE 2011 4th International Conference on Software Language Engineering Braga, Portugal, 3-6 July 2011 http://planet-sl.org/sle2011/ Co-located with the 4th Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE 2011) ============================================================= IMPORTANT DATES * 2011: Paper submission: April 08 (midnight Apia Samoa time) Author notification: May 13 Paper submission for online proceedings: June 17 Conference: July 03-06 Camera-ready copy submission for post-proceedings: August 29 --------------------------------------------------------- Software language engineering is devoted to topics related to artificial languages in software engineering. The foremost mission of the International Conference on Software Language Engineering (SLE) is to encourage and organize communication between communities that traditionally have looked at soft- ware languages from different, more specialized, and yet complementary perspectives. Thus, technologies, methods, experiments and case studies from modelware, grammarware, and ontologyware serving the objectives of software languages are of particular relevance to SLE. We invite high-quality submissions to all conference tracks. Submissions must be PDF files following the Springer LNCS style and will be managed using the EasyChair submission system. Please check the conference web site for further information. SLE 2011 will include a Doctoral Symposium that will provide a supportive yet questioning setting in which PhD students can present their work, including goals, methods, and preliminary results. The Symposium aims to provide students with useful guidance and feedback on various aspects of their research from established researchers and the other student attendees. Please forward this call to anyone who might be interested. http://planet-sl.org/sle2011/ --------------------------------------------------------- INVITED SPEAKERS SLE 2011 is proud to announce the following invited speakers. Krzysztof Czarnecki is associate professor at the University of Waterloo and industrial research chair at Bank of Nova Scotia / NSERC. Before coming to Waterloo, he spent eight years at DaimlerChrysler Research working on the practical applications of generative programming. His current work focuses on realizing the synergies between generative and model-driven software development. Paul Klint is head of the software engineering department at Centrum Wiskunde en Informatica in Amsterdam, full professor in Computer Science at the University of Amsterdam and theme leader of Software Analysis and Transformation at CWI. His research interests include generic language technology, domain-specific languages, software renovation, and technology transfer. --------------------------------------------------------- PAPER SUBMISSION Submitted papers must be original work and must not be previously published in, currently submitted to, or currently in consideration for any journal, book, conference, or workshop. Each submitted paper will be reviewed closely by at least three members of the program committee. Accepted papers will be distributed at the conference via the online proceedings as well as published in the post-proceedings, which will appear in the Springer Lecture Notes in Computer Science (LNCS) series. Authors will have the opportunity to revise their accepted paper(s) for the pre- and post- proceedings. For an accepted paper to appear in the proceedings, at least one author must attend the event and present the work. --------------------------------------------------------- RESEARCH PAPERS Research papers should report a substantial research contribution to SLE and/or a successful application of SLE techniques. 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. We list examples of tools, techniques, applications, and problems of interest to clarify the types of contributes that we seek: * Formalisms used in designing and specifying languages and tools that analyze such language descriptions * Language implementation techniques * Program and model transformation tools * Composition, integration, and mapping tools for managing different aspects of software languages or different manifestations of a given language * Transformations and transformation languages between languages and models * Language evolution * Approaches to elicitation, specification, or verification of requirements for software languages * Language development frameworks, methodologies, techniques, best practices, and tools for the broader language lifecycle covering phases such as analysis, testing , and documentation. * Design challenges in SLE * Applications of languages including innovative domain-specific languages or "little" languages The preceding list is neither exclusive nor exhaustive. Visit the conference web site for more information about the scope and topics of interest of SLE, or contact the program co-chairs with questions. Page limit: 20 --------------------------------------------------------- SHORT PAPERS Short papers may describe interesting or thought-provoking concepts that are not yet fully developed or evaluated, make an initial contribution to challenging research issues in SLE, or discuss and analyze controversial issues in the field. Page limit: 10 --------------------------------------------------------- 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. 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. Submissions may also include an appendix (that will not be published) containing additional screen-shots and discussion of the proposed demonstration. Page limit: 10 --------------------------------------------------------- MINI-TUTORIAL PAPERS SLE is composed of various research areas, such as grammarware, modelware, language schemas, and semantic technologies. The cross product of attendees at SLE creates a situation where the contribution from one session may be difficult to understand by those not initiated to the area. To help unite the various communities of SLE 2011, we solicit mini-tutorials that provide discussion points for mapping common ideas between related and complementary research topics of SLE. A mini-tutorial submission should be between 15 and 20 pages. --------------------------------------------------------- DOCTORAL SYMPOSIUM The Doctoral Symposium provides 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. Submissions are invited from PhD students working on any topic that falls within the SLE conference remit. Submissions consist of two parts, a research abstract and a letter of recommendation from the student's supervisor. See the upcoming Doctoral Symposium call for submissions for full details. Participants will also be invited to present a poster on their research as part of the conference poster session. ------------------------------------------------------------ GENERAL CHAIR Jo?o Saraiva Universidade do Minho, Portugal jas at di.uminho.pt PROGRAM CO-CHAIRS Uwe A?mann Dresden University of Technology, Germany uwe.assmann at tu-dresden.de Anthony Sloane Macquarie University, Australia anthony.sloane at mq.edu.au DOCTORAL SYMPOSIUM CHAIRS Perdita Stevens University of Edinburgh, UK perdita.stevens at ed.ac.uk Eric Van Wyk University of Minnesota, USA evw at cs.umn.edu PROGRAM COMITTEE Adrian Johnstone, University of London, UK Aldo Gangemi, Semantic Technology Laboratory, Italy Alexander Serebrenik, Eindhoven University of Technology, Netherlands Ana Moreira, FCT/UNL, Portugal Anthony Cleve, University of Namur, Belgium Anya Helene Bagge, University of Bergen, Norway Bernhard Rumpe, Aachen University, Germany Bijan Parsia, University of Manchester, UK Brian Malloy, Clemson University, USA Bruno Oliveira, Seoul National University, Korea Chiara Ghidini, FBK-irst, Italy Daniel Oberle, SAP Research, Germany Eelco Visser, Delft University of Technology, Netherlands Eric Van Wyk, University of Minnesota, USA Fernando Pereira, Federal University of Minas Gerais, Brasil Fernando Silva Parreiras, University of Koblenz-Landau, Germany Friedrich Steimann, University of Hannover, Germany G?rel Hedin, Lund University, USA Ivan Kurtev, University of Twente, Netherlands James Power, National University of Ireland, Ireland Jean-Marie Favre, OneTree Technologies, France Jeff Gray, University of Alabama, USA Jeff Z. Pan, University of Aberdeen, UK Jo?o Paulo Fernandes, Univ. of Minho & Univ. of Porto, Portugal John Boyland, University of Wisconsin-Milwaukee, USA John Grundy, Swinburne University of Technology, Australia Jordi Cabot, ?cole des Mines de Nantes, France Jurgen Vinju, CWI, Netherlands Laurence Tratt, Middlesex University, UK Marjan Mernik, University of Maribor, Slovenia Mark van den Brand, Eindhoven University of Technology, Netherlands Michael Collard, University of Akron, USA Nicholas Kraft, University of Alabama, USA Paul Klint, CWI, Netherlands Paulo Borba, Federal University of Pernambuco, Brazil Peter Haase, University of Karlsruhe, Germany Peter Mosses, Swansea University, UK Ralf M?ller, Hamburg University of Technology, Germany Silvana Castano, University of Milan, Italy Steffen Zschaler, Lancaster University, UK York Sure, University of Koblenz-Landau, Germany Zhenjiang Hu, National Institute of Informatics, Japan ORGANIZATION COMMITTEE Jos? Creissac Campos (Finance Chair) Universidade do Minho, Portugal Jo?o Paulo Fernandes (Web and Publicity co-Chair) Universidade do Porto & Universidade do Minho, Portugal Jurgen Vinju (Workshop Selection Chair) CWI, The Netherlands Vadim Zaytsev (Publicity co-Chair) CWI, The Netherlands From femke at cs.vu.nl Tue Mar 22 09:15:40 2011 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Tue, 22 Mar 2011 14:15:40 +0100 (CET) Subject: [TYPES/announce] Workshop Developments in Computational Models: CFP Message-ID: ========================================================================= First Call for Papers DCM 2011 7th International Workshop on Developments in Computational Models July 3, 2011 Zurich, Switzerland http://www.pps.jussieu.fr/~jkrivine/conferences/DCM2011/DCM_2011.html A satellite event of ICALP 2011 - http://icalp11.inf.ethz.ch/ Deadline for submissions: 02 May, 2011 ========================================================================= DCM 2011 is the seventh in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. The goal of DCM is to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2011 will be a one-day satellite event of ICALP 2011 in Zurich, Switzerland. TOPICS OF INTEREST: ------------------- Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modeling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - comparisons of different models of computations; - information-theoretic ideas in computing. IMPORTANT DATES: ---------------- Paper Submission: May 02, 2011 Notification: May 25, 2011 Final Version: June 03, 2011 Workshop July 03, 2011 SUBMISSIONS: ------------ Please submit a paper via the conference EasyChair submission page: http://www.easychair.org/conferences/?conf=dcm2011 Submissions should be at most 12 pages, in PDF format. Please use the EPTCS macro package and follow the instructions of EPTCS: http://eptcs.org/ http://style.eptcs.org/ A submission may contain an appendix, but reading the appendix should should not be necessary to assess the merits of a submission. PUBLICATION: ------------ Accepted contributions will appear in EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, quality permitting full versions of selected papers will be invited for a special issue in an internationally leading journal. INVITED SPEAKERS: TBA ----------------- PROGRAMME COMMITTEE: -------------------- Erika Andersson, Heriot-Watt University, UK Nachum Dershowitz, Tel Aviv University, Israel Eleni Diamanti, CNRS & Telecom ParisTech, France Lucas Dixon, Google, USA Elham Kashefi, University of Edinburgh, UK (Co-chair) Delia Kesner, CNRS & Universit? Paris Diderot, France H?l?ne Kirchner, INRIA, France Heinz Koeppl, ETH Zurich, Switzerland Jean Krivine, CNRS & Universit? Paris Diderot, France (Co-chair) Michael Mislove, Tulane University, USA Mio Murao, University of Tokyo, Japan Vincent van Oostrom, Utrecht University, The Netherlands Femke van Raamsdonk, VU University Amsterdam, The Netherlands (Co-chair) Paul Ruet, CNRS & Institut de Math?matiques de Luminy, France Aaron Stump, University of Iowa, USA ========================================================================= Further information: Elham Kashefi Jean Krivine Femke van Raamsdonk ========================================================================= From s.p.luttik at tue.nl Wed Mar 23 06:34:44 2011 From: s.p.luttik at tue.nl (Bas Luttik) Date: Wed, 23 Mar 2011 11:34:44 +0100 Subject: [TYPES/announce] EXPRESS 2011: Call for Papers Message-ID: <4D89CCC4.6090204@tue.nl> ------------------------------------------------------------ 18th International Workshop on Expressiveness in Concurrency EXPRESS 2011 ------------------------------------------------------------ September 5, 2011, Aachen (Germany) Affiliated with CONCUR 2011 http://www.lix.polytechnique.fr/comete/EXPRESS11/ Submission of abstracts: Friday May 27, 2011 Submission of papers: Friday June 3, 2011 ------------------------------------------------------------ SCOPE AND TOPICS: The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. Their focus has traditionally been on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, and rewrite systems) on the basis of their relative expressive power. The EXPRESS workshop series has run successfully since 1994 and over the years this focus has become broadly construed. Since EXPRESS'09 we have made this development "official": we are now aiming to bring together researchers who are interested in the expressiveness and comparison of formal models that broadly relate to concurrency. In particular, this includes emergent fields such as logic and interaction, game-theoretic models, and service-oriented computing. SUBMISSION GUIDELINES: We solicit two types of submissions: * Short papers (up to 5 pages, not included in the final 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'11 EASYCHAIR server (http://www.easychair.org/conferences/?conf=express2011). The final versions of accepted full papers will be published in EPTCS. Furthermore, authors of the very best full papers will be invited to submit an extended version to a special issue of a high-quality journal. INVITED SPEAKERS: Wan Fokkink (Vrije Universiteit Amsterdam, NL) - joint invited speaker with SOS 2011 Bj?rn Victor (Uppsala University, SE) IMPORTANT DATES: Abstract submission: May 27, 2011 Paper submission: June 3, 2011 Notification date: July 11, 2011 Camera ready version: July 29, 2011 WORKSHOP CO-CHAIRS: Bas Luttik (Eindhoven University of Technology, NL) Frank Valencia (LIX, CNRS& Ecole Polytechnique, FR) PROGRAMME COMMITTEE: Filippo Bonchi (CNRS& ENS Lyon, FR) Sibylle Fr?schle (Universit?t Oldenburg, DE) Rob van Glabbeek (NICTA, Sydney, AU) Cosimo Laneve (University of Bologna, IT) Sergio Maffeis (Imperial College London, UK) Faron Moller (Swansea University, UK) Philippe Schnoebelen (LSV, CNRS& ENS Cachan, FR) Jiri Srba (Aalborg University, DK) Jan Strej?ek(Masaryk University, Brno, CZ) Alwen Tiu (ANU, Canberra, AU) From tiezzi at dsi.unifi.it Wed Mar 23 17:22:41 2011 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Wed, 23 Mar 2011 22:22:41 +0100 Subject: [TYPES/announce] Final Call for Papers: WWV 2011 Message-ID: [Apologies for multiple copies] ******************************************************** Final Call for Papers WWV 2011 Automated Specification and Verification of Web Systems 7th International Workshop (as part of DisCoTec'11) http://rap.dsi.unifi.it/wwv2011/ June 9, 2011 - Reykjavik, Iceland ******************************************************** IMPORTANT DATES Abstract Submission March 28, 2011 Full Paper Submission April 4, 2011 Acceptance Notification May 3, 2011 Camera Ready (pre-proceedings) May 30, 2011 Workshop June 9, 2011 Camera Ready (post-proceedings) July 4, 2011 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 Elie Najm Telecom ParisTech, France 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=wwv2011 Submission is a firm commitment that at least one of the authors will attend the conference, 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 Laura Kovacs Vienna University of Technology, Austria Rosario Pugliese University of Florence, Italy Francesco Tiezzi University of Florence, Italy PROGRAM COMMITTEE Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Santiago Escobar Technical University of Valencia, Spain Jean-Marie Jacquet University of Namur, Belgium Laura Kovacs Vienna University of Technology, Austria Temur Kutsia Johannes Kepler University Linz, Austria Tiziana Margaria Univ. Potsdam, Germany Manuel Mazzara University of Newcastle, United Kingdom Catherine Meadows NRL, United States Yasuhiko Minamide University of Tsukuba, Japan Rosario Pugliese University of Florence, Italy I.V. Ramakrishnan SUNY Stony Brook, United States Maurice ter Beek ISTI-CNR, Pisa, Italy Francesco Tiezzi University of Florence, Italy Franz Weitl National Institute of Informatics, Tokyo, Japan Nobuko Yoshida Imperial College London, United Kingdom CONTACT wwv2011 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From cc2 at ecs.soton.ac.uk Thu Mar 24 18:44:14 2011 From: cc2 at ecs.soton.ac.uk (Corina Cirstea) Date: Thu, 24 Mar 2011 22:44:14 +0000 Subject: [TYPES/announce] Second call for contributions: CALCO-Jnr 2011: CALCO Young Researchers Workshop (Winchester, UK) References: <20110324224414.GA4811@login.ecs.soton.ac.uk> Message-ID: [Apologies for multiple copies] !!! Please forward to PhD students and young researchers !!! =============================================================== SECOND CALL FOR CONTRIBUTIONS: CALCO-Jnr 2011 CALCO Young Researchers Workshop August 29, 2011, Winchester, UK part of 4th Conference on Algebra and Coalgebra in Computer Science August 29-September 2, 2011, Winchester, UK =============================================================== Abstract submission: May 8, 2011 Author notification: May 30, 2011 Final abstract due: June 30, 2011 Full paper submission: September 30, 2011 =============================================================== http://calco2011.ecs.soton.ac.uk/ =============================================================== CALCO 2011 will be preceded by the CALCO Young Researchers Workshop, CALCO-Jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. The study of algebra and coalgebra relates to the data, process and structural aspects of software systems. This is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy, 2009). The fourth edition will be held in the city of Winchester (England), a historic cathedral city and the ancient capital of Wessex and the Kingdom of England. The CALCO Young Researchers Workshop, CALCO-Jnr, is a CALCO satellite workshop dedicated to presentations by PhD students and young researchers. Attendance at the workshop is open to all - it is anticipated that many CALCO conference participants will want to attend the CALCO-Jnr workshop (and vice versa). Topics of Interest ----------------------- The CALCO Young Researchers Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. In particular, the workshop encourages submissions related to the topics listed below. * Abstract models and logics - Automata and languages, - Categorical semantics, - Modal logics, - Relational systems, - Graph transformation, - Term rewriting, - Adhesive categories * Specialised models and calculi - Hybrid, probabilistic, and timed systems, - Calculi and models of concurrent, distributed, mobile, and context-aware computing, - General systems theory and computational models (chemical, biological, etc) * Algebraic and coalgebraic semantics - Abstract data types, - Inductive and coinductive methods, - Re-engineering techniques (program transformation), - Semantics of conceptual modelling methods and techniques, - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification, - Formal testing and quality assurance, - Validation and verification, - Generative programming and model-driven development, - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra Submission ---------------- CALCO-Jnr presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page abstracts. A booklet with the abstracts of the accepted presentations will be available at the workshop. Submissions will be handled via the EasyChair system (http://www.easychair.org). The use of LNCS style (see http://www.springer.de/compo/lncs/authors.html) is strongly encouraged. After the workshop, the author(s) of each presentation will be invited to submit a full 10-15 page paper on the same topic. They will also be asked to write (anonymous) reviews of papers submitted by other authors on related topics. Additional reviewing and the final selection of papers will be carried out by the CALCO-Jnr PC. The volume of selected papers from the workshop will be published as a technical report of the University of Southampton. Authors will retain copyright, and are also encouraged to disseminate the results reported at CALCO-Jnr by subsequent publication elsewhere. Important Dates ---------------------- May 8, 2011 Deadline for 2-page abstract submission May 30, 2011 Notification of abstract selection decision June 30, 2011 Final version of abstract due August 29, 2011 CALCO-Jnr, CALCO Young Researchers Workshop August 30 -September 2, 2011 CALCO technical programme September 30, 2011 Deadline for 10-15 page paper submission November 15, 2011 Notification of paper selection decision November 30, 2011 Final version of paper due Programme Committee -------------------------------- * Corina Cirstea, University of Southampton, UK http://www.ecs.soton.ac.uk/people/cc2 * Magne Haveraaen, University of Bergen, NO http://www.ii.uib.no/~magne/ * John Power, University of Bath, UK http://www.bath.ac.uk/comp-sci/people/contact/index.php?contact=Dr_John_Power * Monika Seisenberger (chair), Swansea University, UK http://www.cs.swan.ac.uk/~csmona/ * Toby Wilkinson, University of Southampton, UK http://www.ecs.soton.ac.uk/people/stw08r Posters ------------ * Low quality (for online viewing) http://calco2011.ecs.soton.ac.uk/workshops/calcojnr.jpg * High quality (for printing) http://calco2011.ecs.soton.ac.uk/workshops/calcojnr.pdf --- CALCO-Jnr 2011: http://calco2011.ecs.soton.ac.uk/workshops/calco-jnr.html CALCO 2011: http://calco2011.ecs.soton.ac.uk/ . From ekitzelmann at gmail.com Fri Mar 25 04:13:59 2011 From: ekitzelmann at gmail.com (Emanuel Kitzelmann) Date: Fri, 25 Mar 2011 01:13:59 -0700 Subject: [TYPES/announce] Last CFP: 4th Workshop on Approaches and Applications of Inductive Programming (AAIP 2011) Message-ID: LAST CALL FOR PAPERS 4th International Workshop on Approaches and Applications of Inductive Programming AAIP 2011 July 19, 2011, Odense, Denmark http://www.cogsys.wiai.uni-bamberg.de/aaip11/ NEWS * Due date for paper submission approaching: April 3, 2011 * Invited speaker announced: Ras Bodik, UC Berkeley, USA AAIP 2011 is co-located with the * the International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2011), * the International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011), and * the Workshop on Functional and (Constraint) Logic Programming (WFLP 2011) AIMS AND SCOPE Inductive program synthesis or inductive programming (IP) is concerned with the automated generation of (parts of) computer programs from incomplete specifications such as input/output examples. IP particularly includes the synthesis of programs that contain loops or recursive calls. This inductive type of automated program synthesis is addressed by researchers in different fields such as artificial intelligence, evolutionary computation, inductive inference, formal methods, functional programming, and inductive logic programming. The aim of the AAIP workshop is to have a common place to present and discuss research on all aspects of inductive programming - including, but not limited to: Inductive programming algorithms, techniques, and systems, heuristics, inductive biases, analysis of the learnability of particular program classes, and the integration of different techniques. We especially encourage submissions on relevant challenge problems and on real-world applications of inductive programming in, e.g., computer-assisted software development, end-user programming, and intelligent agents. This is the fourth workshop on "Approaches and Applications of Inductive Programming" and takes place for the first time in conjunction with PPDP and LOPSTR. We invite authors to submit papers reporting on original work in either of two categories: full technical papers and short papers. Full papers should present mature work. Short papers may be work in progress reports, descriptions of system demonstrations, or position statements. INVITED SPEAKER Ras Bodik, University of California, Berkeley, USA PRESENTATION AND PUBLICATION INFORMATION All accepted papers will be presented orally. Workshop (pre-)proceedings will be published online and as a technical report. Furthermore, we plan to publish selected and revised papers as a formal post-proceedings volume, most likely in the Springer LNCS series. SUBMISSION GUIDELINES Submitted papers must describe original work, be written in English and should be formatted in the Springer Lecture Notes in Computer Science style: http://www.springer.de/comp/lncs/authors.html Submissions can either be full papers describing mature work or short papers describing work in progress, a system demonstration, or make a position statement. Full and short papers should not exceed 16 and 8 pages, respectively, including bibliography and appendices. Papers should be submitted as PDF via the AAIP 2011 submission webpage: http://www.easychair.org/conferences/?conf=aaip2011 IMPORTANT DATES April 3, 2011 Paper submission May 16, 2011 Author notification June 12, 2011 Camera-ready July 19, 2011 Workshop ORGANIZATION COMMITTEE * Emanuel Kitzelmann, International Computer Science Institute, Berkeley, USA * Ute Schmid, University of Bamberg, Germany PROGRAM COMMITTEE * Ricardo Aler Mur, Universidad Carlos III de Madrid, Spain * Pierre Flener, Uppsala University, Sweden * Lutz Hamel, University of Rhode Island, Kingston, USA * Jose Hernandez-Orallo, Technical University of Valencia, Spain * Martin Hofmann, SAP Research & Development, Germany * Johan Jeuring, University of Utrecht, The Netherlands * Susumu Katayama, University of Miyazaki, Japan * Pieter Koopman, Radboud University Nijmegen, The Netherlands * Maria Jose Ramirez Quintana, Technical University of Valencia, Spain CONTACT aaip2011 at easychair.org -- Dr. Emanuel Kitzelmann International Computer Science Institute (ICSI) 1947 Center Street, Suite 600 Berkeley, CA 94704, USA e-mail: emanuel at icsi.berkeley.edu phone: +1 510 666 2883 From paolini at di.unito.it Fri Mar 25 09:01:22 2011 From: paolini at di.unito.it (Luca Paolini) Date: Fri, 25 Mar 2011 14:01:22 +0100 Subject: [TYPES/announce] RDP 2011 - FIRST CALL FOR PARTICIPATION Message-ID: <1301058082.2341.0.camel@gmoon> ******************************************************************** *** Federated Conference on Rewriting, Deduction, and Programming*** *** RDP 2011 *** *** May 29 - June 3, 2011 *** *** Novi Sad, Serbia *** *** http://www.rdp2011.uns.ac.rs *** *** *** *** FIRST CALL FOR PARTICIPATION *** *** *** ******************************************************************** --------------------------------------------------------------------- -- REGISTRATION -- --------------------------------------------------------------------- For online registration visit: http://www.rdp2011.uns.ac.rs/practical/registration.html Early registration closes on April 10. --------------------------------------------------------------------- -- ABOUT RDP -- --------------------------------------------------------------------- RDP'11 is the sixth edition of the biannual Federated Conference on Rewriting, Deduction, and Programming, consisting of two main conferences and related events. --------------------------------------------------------------------- -- RDP MAIN CONFERENCES -- --------------------------------------------------------------------- RTA 2011 The 22nd International Conference on Rewriting Techniques and Applications May 30 - June 1, 2011 TLCA 2011 The Tenth International Conference on Typed Lambda Calculi and Applications June 1 - 3, 2011 --------------------------------------------------------------------- -- RDP 2011 INVITED SPEAKERS -- --------------------------------------------------------------------- Alexandre Miquel (Ecole Normale Superieure de Lyon, France) Sophie Tison (Universite Lille and LIFL, France) Ashish Tiwari (SRI, USA) Vladimir Voevodsky (Institute of Advanced Study, USA) Stephanie Weirich (University of Pennsylvania, USA) (in alphabetical order) --------------------------------------------------------------------- -- WORKSHOPS -- --------------------------------------------------------------------- COBRA 2011 Compilers by Rewriting, Automated HDTT 2011 Higher Dimensional Type Theory TPDC 2011 Theory and Practice of Delimited Continuations (TPDC) 2FC 2011 Two Faces of Complexity (2FC) WRS 2011 Reduction Strategies in Rewriting and Programming IFIP WG 1.6 Working Group 1.6 Term Rewriting --------------------------------------------------------------------- -- ASSOCIATED EVENTS -- --------------------------------------------------------------------- IFCoLog Student session organized by The International Federation for Computational Logic --------------------------------------------------------------------- -- HOST CITY: NOVI SAD, SERBIA -- --------------------------------------------------------------------- Novi Sad is capital of Vojvodina, the northern region of Serbia. Situated on the Danube river, 80km from the capital city Belgrade, it is treasured regional and cultural center. With the population of about 300,000, Novi Sad is a modern and pleasant city with wide boulevards, modern buildings and the historical Central Square surrounded by the Old Town Hall, the Roman catholic church and similar buildings dating mainly from the early nineteenth century. The city, as well as whole of Vojvodina is well-known multicultural, multinational and multiconfesional region. Among the cultural-historical monuments, the best known is the Petrovaradin fortress with its underground corridors, promenades, museums, restaurants and art studios. There are also many churches, monasteries and other cultural monuments. Novi Sad is also known by the longest and the most beautiful sandy beach on the Danube, as well as by nearby Fruska Gora mountain. As a university town, Novi Sad is known for a lively night life, with lots of nice restaurants, bars, cafes and clubs. Several international theater and music festivals take place here. For travel and accommodation information, please consult the RDP 2011 website: http://www.rdp2011.uns.ac.rs RDP 2011 is organized by the University of Novi Sad, Faculty of Technical Sciences, and Mathematical Institute SASA and will take place in the University Campus, at the Faculty of Technical Sciences. --------------------------------------------------------------------- -- REGISTRATION (again) -- --------------------------------------------------------------------- For online registration visit: http://www.rdp2011.uns.ac.rs/practical/registration.html Early registration closes on April 10. --------------------------------------------------------------------- -- CONTACT -- --------------------------------------------------------------------- See http://www.rdp2011.uns.ac.rs Any question can be addressed to rdp2011 at uns.ac.rs From tmesser at cs.wisc.edu Fri Mar 25 10:45:14 2011 From: tmesser at cs.wisc.edu (Tonya Messer) Date: Fri, 25 Mar 2011 09:45:14 -0500 Subject: [TYPES/announce] Fwd: Position Vacancy Listing UW Madison Computer Sciences Message-ID: <4D8CAA7A.9020603@cs.wisc.edu> -------- Original Message -------- Subject: Position Vacancy Listing UW Madison Computer Sciences Date: Fri, 25 Mar 2011 08:45:20 -0500 From: Tonya Messer To: types-announce at lists.seas.upenn.edu Please post this position vacancy listing to qualifying groups. Thanks, Tonya -- Tonya Messer Payroll and Benefits Specialist Computer Sciences Department University of Wisconsin-Madison 1210 W Dayton St. Room 5368 Madison, WI 53706 P:608-262-4694 F:608-262-9777 Position vacancy UW-Madison Computer Science Department: Researcher 100% Appointment The Wisconsin CRASH project seeks someone to carry out research on policy-weaving at the machine code level.The primary duties include: Research, development, and support of software such as software tools, operating systems, libraries and run-time systems.This is not an application developer.The researcher will also represent CRASH project, participate in collaborative research and in the writing of technical reports and train new staff and students. Requirements: ?Minimum of Master's in Computer Science or related discipline ?Minimum of 5 years of experience of working on machine code analysis ?Experience using one or more SMT solvers, such as Yices, Z3, or STP ?Experience as an advanced graduate student will be accepted Please submit application by April 20^th 2011.For full position listing visit: http://www.ohr.wisc.edu/pvl/pv_066758.html -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: PVL 66758.docx Type: application/vnd.openxmlformats-officedocument.wordprocessingml.document Size: 12163 bytes Desc: not available URL: From emilie.balland at inria.fr Sat Mar 26 05:10:46 2011 From: emilie.balland at inria.fr (Emilie Balland) Date: Sat, 26 Mar 2011 10:10:46 +0100 (CET) Subject: [TYPES/announce] Call for Papers: Conference on Domain-Specific Languages (DSL 2011) In-Reply-To: <1465178141.72674.1301130319916.JavaMail.root@zmbs1.inria.fr> Message-ID: <1166333379.72703.1301130646267.JavaMail.root@zmbs1.inria.fr> ============================ Call for Papers ============================ DSL 2011: Conference on Domain-Specific Languages (IFIP sponsorship pending approval) 6-8 September 2011, Bordeaux, France http://dsl2011.bordeaux.inria.fr/ CALL FOR PAPERS Domain-specific languages have long been a popular way to shorten the distance from ideas to products in software engineering. On one hand, the interface of a DSL lets domain experts express high-level concepts succinctly in familiar notation, such as grammars for text or scripts for animation, and often provides guarantees and tools that take advantage of the specifics of the domain to help write and maintain these particular programs. On the other hand, the implementation of a DSL can automate many tasks traditionally performed by a few experts to turn a specification into an executable, thus making this expertise available widely. Overall, a DSL thus mediates a collaboration between its users and implementers that results in software that is more usable, more portable, more reliable, and more understandable. These benefits of DSLs have been delivered in domains old and new, such as signal processing, data mining, and Web scripting. Widely known examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL, Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM, Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes, the adoption of DSLs have been stunted by the lack of general tools and principles for developing, compiling, and verifying domain-specific programs. General support for building and using DSLs is thus urgently needed. Languages that straddle the line between the domain-specific and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest that such support be based on modern notions of language design and software engineering. The goal of this conference, following the last one in 2009, is to explore how present and future DSLs can fruitfully draw from and potentially enrich these notions. We seek research papers on the theory and practice of DSLs, including but not limited to the following topics. * Foundations, including semantics, formal methods, type theory, and complexity theory * Language design, including concrete syntax, semantics, and types * Software engineering, including domain analysis, software design, and round-trip engineering * Modularity and composability of DSLs * Software processes, including metrics for software and language evaluation * Implementation, including parsing, compiling, program generation, program analysis, transformation, optimization, and parallelization * Reverse engineering, re-engineering, design discovery, automated refactoring * Hardware/software codesign * Programming environments and tools, including visual languages, debuggers, testing, and verification * Teaching DSLs and the use of DSLs in teaching * Case studies in any domain, especially the general lessons they provide for DSL design and implementation The conference will include a visit to the city of Bordeaux, a tour and tasting at the wine museum and cellar, and a banquet at La Belle ?poque. INSTRUCTIONS FOR AUTHORS Papers will be judged on the depth of their insight and the extent to which they translate specific experience into general lessons for software engineers and DSL designers and implementers. Where appropriate, papers should refer to actual languages, tools, and techniques, provide pointers to full definitions, proofs, and implementations, and include empirical results. Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://info.eptcs.org/). Submissions and final manuscripts should be at most 25 pages in EPTCS format. IMPORTANT DATES * 2011-04-18: Abstracts due * 2011-04-25: Submissions due * 2011-06-10: Authors notified of decisions * 2011-07-11: Final manuscripts due * 2011-09-05: Distilled tutorials * 2011-09-06/2011-09-08: Main conference PROGRAM COMMITTEE * Emilie Balland (INRIA) * Olaf Chitil (University of Kent) * Zo? Drey (IRIT) * Nate Foster (Cornell University) * Mayer Goldberg (Ben-Gurion University) * Shan Shan Huang (LogicBlox) * Sam Kamin (University of Illinois at Urbana-Champaign) * Jerzy Karczmarczuk (University of Caen) * Jan Midtgaard (Aarhus University) * Keiko Nakata (Tallinn University of Technology) * Klaus Ostermann (University of Marburg) * Jeremy Siek (University of Colorado at Boulder) * Tony Sloane (Macquarie University) * Josef Svenningsson (Chalmers University of Technology) * Paul Tarau (University of North Texas) * Dana N. Xu (INRIA) ORGANIZERS Local chair: Emilie Balland (INRIA) Program chairs: Olivier Danvy (Aarhus University), Chung-chieh Shan (Rutgers University) ------------------------------------------------------------------------ From gaboardi at cs.unibo.it Sat Mar 26 12:39:26 2011 From: gaboardi at cs.unibo.it (Marco Gaboardi) Date: Sat, 26 Mar 2011 17:39:26 +0100 Subject: [TYPES/announce] Oregon Programming Languages Summer School 2011 - Call For Participation Message-ID: <1B88E393-85E7-400B-B8C1-9CE5549AFEEC@cs.unibo.it> ---------------------------------------------------------------------- Call For Participation Types, Semantics and Verification 10th Annual Oregon Programming Languages Summer School (OPLSS 2011) University of Oregon, Eugene. June 16 - July 1, 2011 http://www.cs.uoregon.edu/Activities/summerschool/ => NOTE: the registration deadline has passed but we still have few open slots. ---------------------------------------------------------------------- The focus of this summer school is the mix or interplay of theory and practice in program verification. The main aim is to enable participants to conduct research in the area, thereby contributing to improve software quality. The Oregon Programming Languages Summer School (OPLSS) has been held at the University of Oregon each summer since 2002. This year, in the occasion of the tenth anniversary of the summer school, two plenary lectures will complement the technical program. ---------------------------------------------------------------------- Technical Program Logical Relations Amal Ahmed - Indiana University Software Verification Andrew Appel - Princeton University Monadic Effects Nick Benton - Microsoft Research Metamathematics of Polymorphic Logics - applications Robert Constable - Cornell University Polarization and Focalization Pierre-Louis Curien - pi.r2 team, PPS, CNRS-Paris Diderot University- INRIA Type Theory Foundation Robert Harper - Carnegie Mellon University The Calculus of Inductive Constructions Hugo Herbelin - pi.r2 team, PPS, CNRS-Paris Diderot University-INRIA Compiler Certification Xavier Leroy - INRIA Programming languages in string diagrams Paul-Andre' Mellies - PPS, CNRS-Paris Diderot University Imperative Programming in Coq Greg Morrisett - Harvard University Proof Theory Foundation Frank Pfenning - Carnegie Mellon University Proof Theory in Coq Benjamin Pierce - University of Pennsylvania Semilattices, Domains, and Computability Dana Scott - Carnegie Mellon University - Berkeley University ---------------------------------------------------------------------- Plenary Lectures: Speaker: Dana Scott (Carnegie Mellon University and Berkeley University) Title: What is a Proof? -- Some Challenges for Automated Theorem Proving Speaker: Robert Constable (Cornell University) Title: Metamathematics of Polymorphic Logics - foundations ---------------------------------------------------------------------- Registration => the registration deadline has passed but we still have few open slots. Full information on registration are available at: http://www.cs.uoregon.edu/Activities/summerschool/ ---------------------------------------------------------------------- Some further activities will complement the main program. Coq-labs: Some of the lectures will assume interactive sessions using the interactive proof assistant Coq. Students are encouraged to bring a laptop on which Coq has been installed, and to form small working group during the interactive sessions. Moreover, some Coq-labs will be offered in order to give the participants the opportunity of make more practice in using Coq. Student Sessions: Interested students will have the opportunity to present their work during special sessions. Each presentation will consist of a brief talk about the student research interests and results. These sessions will be an occasion for students to obtain useful feedback on their work by other students and researchers, and also to interact with participants having similar research interests. We hope to see you in Eugene. Zena Ariola Pierre-Louis Curien Marco Gaboardi Robert Harper Hugo Herbelin From msteffen at ifi.uio.no Mon Mar 28 02:42:29 2011 From: msteffen at ifi.uio.no (Martin Steffen) Date: Mon, 28 Mar 2011 08:42:29 +0200 Subject: [TYPES/announce] Submission Deadline approaching (April 5): 19th Symp.\ on Fundamentals of Computing Theory, Oslo Message-ID: -------------------------------------------------------------------- Call for Papers FCT 2011 18th International Symposium on Fundamentals of Computation Theory http://fct11.ifi.uio.no/ August 22-25, 2011, Oslo, Norway IMPORTANT DATES Submission Deadline: Tuesday, 5. April 2011 Author Notification: Monday, 6. June 2011 Camera ready manuscript: Friday 17. June 2011 ---------------------------------------------------------------- The Symposium on Fundamentals of Computation Theory was established in 1977 for researchers interested in all aspects of theoretical computer science, as well as new emerging fields such as bio-inspired computing. It is a biennial series of conferences previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005), Budapest (Hungary, 2007), and Wroclaw (Poland, 2009). PROCEEDINGS The conference proceedings will be published (as usual) in the Lecture Notes in Computer Science series of Springer-Verlag. SUBMISSIONS Authors are invited to submit papers presenting original unpublished research in all areas of theoretical computer science. Topics of interest include (but are not limited to): * Algorithms: o algorithm design and optimization o combinatorics and analysis of algorithms o computational complexity o approximation, randomized, and heuristic methods o parallel and distributed computing o circuits and boolean functions o online algorithms o machine learning and artificial intelligence o computational geometry o computational algebra * Formal methods: o algebraic and categorical methods o automata and formal languages o computability and nonstandard computing models o database theory o foundations of concurrency and distributed systems o logics and model checking o models of reactive, hybrid and stochastic systems o principles of programming languages o program analysis and transformation o specification, refinement and verification o security o type systems * Emerging fields: o ad hoc, dynamic, and evolving systems o algorithmic game theory o computational biology o foundations of cloud computing and ubiquitous systems o quantum computation Submissions (LNCS style, 12 pages max), should contain sufficient detail to allow to evaluate its validity, quality, and relevance. If necessary, proofs can be attached as an appendix. Simultaneous submission to other conferences with published proceedings or journals is not allowed. Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=fct2011 For further information on the conference, please visit the URL at http://fct11.ifi.uio.no/ INVITED SPEAKERS FCT 2011 is honored by the contribution of three internationally renowned invited speakers. - Yuri Gurevich (Microsoft Research, Redmond USA) - Daniel Lokshtanov (University of California, USA) - Jose Meseguer (University of Illinois at Urbana-Champaign, USA) PROGRAM CHAIRS - Olaf Owe (U. of Oslo) - Martin Steffen (U. of Oslo) - Jan Arne Telle (U. of Bergen) PROGRAM COMMITTEE Erika Abraham (RWTH Aachen, Germany) Wolfgang Ahrendt (Chalmers, Sweden) David Coudert (INRIA Sophia-Antipolis, France) Camil Demetrescu (La Sapienza University of Rome, Italy) Johan Dovland (U. of Oslo, Norway) Jiri Fiala (Charles University, Czech Republic) Martin Hofmann (LMU Munich, Germany) Thore Husfeldt (IT University of Copenhagen, Denmark) Alexander Kurz (U. of Leicester, UK) Andrzej Lingas (Lund University, Sweden) Peter Olveczky (U. of Oslo, Norway) Olaf Owe (U. of Oslo, Norway) - co-chair Miguel Palomino (U. Complutense, Madrid, Spain) Yuri Rabinovich (U. of Haifa, Israel) Saket Saurabh (Inst. of Mathematical Sciences, India) Kaisa Sere (Aabo Akademi University, Finland) Martin Steffen (U. of Oslo, Norway) - co-chair Jan Arne Telle (U. of Bergen, Norway) - co-chair Tarmo Uustalu (Inst. of Cybernetics, Tallinn, Estonia) Ryan Williams (IBM Almaden, USA) Gerhard Woeginger (U. of Eindhoven, The Netherlands) David R. Wood (U. of Melbourne, Australia) Wang Yi (Uppsala University, Sweden) STEERING COMMITTEE Bogdan Chlebus (Warszawa/Denver, Poland/USA) Zoltan Esik (Szeged, Hungary) Marek Karpinski - chair (Bonn, Germany) Andrzej Lingas (Lund, Sweden) Miklos Santha (Paris, France) Eli Upfal (Providence, USA) AFFILIATED EVENTS FCT 2011 will host several affiliated events. These will take part after the main symposium, on the 26 August 2011. More information about each event can be found on their specific web-pages. - Doctoral Symposium affiliated with FCT'11 web: http://fct11.ifi.uio.no/index.php?n=Workshops.DoctoralSymposium - Workshop on Overcoming Challenges for Security and Dependability (WOCSD) web: http://www.mi.fu-berlin.de/secdep/workshop/2011/cfp.html -------------------------------------------------------------------- From guttman at WPI.EDU Mon Mar 28 06:57:27 2011 From: guttman at WPI.EDU (Joshua D. Guttman) Date: Mon, 28 Mar 2011 06:57:27 -0400 Subject: [TYPES/announce] PLAS: Programming Languages and Security (final cfp) Message-ID: <87oc4v8qco.fsf@wpi.edu> [[ Programming Languages and Analysis for Security has been a major consumer of type systems. Submissions from Types types of people warmly encouraged. ]] *********************************************************************** Final Call for Papers Sixth ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2011) http://www.cs.cornell.edu/~aslan/plas2011 June 05, 2011 Co-located with PLDI 2011, San Jose, California *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ***************************** Submissions due: Tuesday, March 29, 2010 Author notification: Friday, April 29, 2010 PLAS 2010 workshop: Sunday, June 05, 2010 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 Aslan Askarov (Cornell University) (co-chair) Brendan Eich (Mozilla Corporation) Deepak Garg (Carnegie Mellon University) Joshua Guttman (Worcester Polytechnic Institute) (co-chair) Ranjit Jhala (University of California, San Diego) Sergio Maffeis (Imperial College London) Marco Pistoia (IBM TJ Watson Research Center) Nikhil Swamy (Microsoft Research) -- Joshua D. Guttman WPI, Computer Science From gvidal at dsic.upv.es Mon Mar 28 08:47:09 2011 From: gvidal at dsic.upv.es (German Vidal) Date: Mon, 28 Mar 2011 14:47:09 +0200 Subject: [TYPES/announce] LOPSTR 2011 - Submission deadline extended: April 17 (both full papers and extended abstracts) Message-ID: <287168BE-E946-46F2-B12A-B98346EC0AD1@dsic.upv.es> News: - Due to multiple requests, the submission deadlines for both full papers and extended abstracts have been extended: * Paper submission: April 17, 2011 * Extended abstract submission: April 17, 2011 ============================================================ Call for papers 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011, AAIP 2011 and WFLP 2011) ============================================================ Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 21st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2011) will be held in Odense, Denmark; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2011 will be co-located with PPDP 2011 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming- in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: - specification - synthesis - verification - transformation - analysis - optimisation - specialization - partial evaluation - inversion - composition - program/model manipulation - certification - security - transformational techniques in SE - applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, the formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. IMPORTANT DATES AND SUBMISSION GUIDELINES: - Paper submission: April 17, 2011 - Extended abstract submission: April 17, 2011 - Notification (for pre-proceedings): May 26, 2011 - Camera-ready (for pre-proceedings): June 19, 2011 - Symposium: July 18-20, 2011 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Lecture Notes in Computer Science style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2011 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings to be published by Springer in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2011 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal proceedings. Invited speakers: - John Gallagher, Roskilde University, Denmark - Fritz Henglein, University of Copenhagen, Denmark (shared with PPDP) - Vitaly Lagoon, Cadence Design Systems, Boston, USA (shared with PPDP) Program Committee: Elvira Albert (Complutense University of Madrid, Spain) Malgorzata Biernacka (University of Wroclaw , Poland) Manuel Carro (Technical University of Madrid, Spain) Michael Codish (Ben-Gurion University of the Negev, Israel) Danny De Schreye (K.U.Leuven, Belgium) Maribel Fernandez (King's College London, UK) Raul Gutierrez (University of Illinois at Urbana-Champaign, USA) Mark Harman (University College London, UK) Frank Huch (C.A.U. Kiel, Germany) Michael Leuschel (University of Dusseldorf, Germany) Yanhong Annie Liu (State University of New York at Stony Brook, USA) Kazutaka Matsuda (Tohoku University, Japan) Fred Mesnard (Universite de La Reunion, France) Ulrich Neumerkel (Technical University of Wien, Austria) Alberto Pettorossi (Universita' di Roma Tor Vergata, Italy) Carla Piazza (University of Udine, Italy) Peter Schneider-Kamp (University of Southern Denmark, Denmark) Hirohisa Seki (Nagoya Institute of Technology, Japan) Josep Silva (Technical University of Valencia, Spain) German Vidal (Technical University of Valencia, Spain) Jurgen Vinju (Centrum Wiskunde & Informatica, The Netherlands) Jianjun Zhao (Shanghai Jiao Tong University, Shanghai) Contacts Program Chair (contact him for additional information about papers and submissions): German Vidal Department of Computer Science (DSIC) Universitat Politecnica de Valencia Valencia, Spain Email: lopstr11 at dsic.upv.es General Chair Peter Schneider-Kamp Dept. of Mathematics and Computer Science University of Southern Denmark Campusvej 55 DK-5230 Odense M, Denmark Email: petersk at imada.sdu.dk From giannini at di.unipmn.it Mon Mar 28 09:31:45 2011 From: giannini at di.unipmn.it (Paola Giannini) Date: Mon, 28 Mar 2011 15:31:45 +0200 Subject: [TYPES/announce] CS2Bio'11 Submission Deadline Approaching (April 2) Message-ID: <4D908DC1.3080207@di.unipmn.it> ================================================================ **** Submission Deadline Approaching, APRIL 2, 2011 **** CS2Bio'11 2nd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'11 9th of June 2011 Reykjavik, Iceland http://cs2bio11.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. In particular we want to encourage presentation of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present an attempt at modeling a specific biological phenomenon using formal techniques, or a technical innovation that can be applied to a range of potential biological systems. In the latter case, some emphasis on the scalability of the method will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Synthetic biology, circuits design (IGEM models) -- Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparisons between different formal models for the 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 Simulations: -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of Mathematical Structures in Computer Science is planned. *** INVITED SPEAKERS *** - Jasmin Fisher (Microsoft Research - Cambridge, UK) - Gordon Plotkin (Lab for Foundation of Computer Science - Edinburgh, UK) *** 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=cs2bio11). 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 (extended) deadline: 2 April 2011 - Notification to authors: 5 May 2011 - Workshop: 9 June 2011 *** PROGRAM COMMITTEE *** - Luca Cardelli - Francesca Cordero - Erik de Vink - Fran?ois Fages - J?r?me Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Jean-Louis Giavitto - Ion Petre - Gordon Plotkin - Angelo Troina - Verena Wolf - Gianluigi Zavattaro -- 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 carbonem at itu.dk Tue Mar 29 06:25:54 2011 From: carbonem at itu.dk (Marco Carbone) Date: Tue, 29 Mar 2011 12:25:54 +0200 Subject: [TYPES/announce] ICE 2011 - DEADLINE EXTENSION (now April 11, 2011) Message-ID: ========================================================== [- Apologies for multiple copies -] ICE 2011 4th Interaction and Concurrency Experience Reliable and Contract-based Interactions June 9, 2011, Reykjavik, Iceland http://www.artist-embedded.org/artist/-ICE-2011-.html Satellite workshop of DisCoTec 2011 http://discotec.ru.is === Highlights === - Invited talks: Simon Gay Rocco de Nicola (joint with PaCo) Prakash Panangaden - Innovative selection procedure - Travel Grants for Young Researchers - Special issue of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/) === Important Dates === 4 April 2011................Abstract submission 11 April 2011...............Full paper submission 13 April - 7 May 2011...Reviews, rebuttal and PC discussion 9 May 2011................Notification to authors 23 May 2011...............Camera-ready for pre-proceedings 9 June 2011...............ICE in Reykjavik 15 Sept 2011..............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 handshaking mechanisms used among actors 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'11 is ***Reliable and Contract-based Interactions***. Reliable interactions are, e.g., those providing suitable guarantees on the overall behaviour of interactive systems, enjoying suitable logical safety/liveness properties, adhering to certain QoS standards, offering certain levels of trust/security. Contract-based interactions are those where the interacting entities are committed to give certain guarantees whenever certain assumptions are met by their operating environment (including other autonomous entities and networking middleware). This way, contracts can be used to define faulty and malicious behaviours and to identify the responsible in case of contract violation or abuse. Topics of interest include, but shall not be limited to: - logics and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of reliable interaction - programming primitives for reliable interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for reliable interaction - expressiveness results - formal languages for contracts - formal analysis of contracts - contract negotiation, discovery and monitoring === Selection Procedure === The workshop pushes for an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past three editions of ICE, this 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. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions that the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE 2011 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=ice2011) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Special Issue === Full version 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 === Karthik Bhargavan (INRIA, France) Simon Bliudze (CEA LIST, France) (co-chair) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marzia Buscemi (IMT Lucca Institute for Advanced Studies, Italy) Luis Caires (Universidade Nova de Lisboa, Portugal) Marco Carbone (IT University of Copenhagen, Denmark) Gabriel Ciobanu (IASI, Romania) Laurent Doyen (ENS Cachan, France) Davide Grohmann (Italy) Daniel Hirschkoff (ENS Lyon, France) Barbara Jobstmann (CNRS/Verimag, France) Ivan Lanese (University of Bologna, Italy) Alberto Lluch Lafuente (IMT Lucca, Italy) Hernan Melgratti (University of Buenos Aires, Argentina) Dejan Nickovic (IST, Austria) Sylvain Pradalier (INRIA Rocquencourt, France) Sophie Quinton (TU Braunschweig, Germany) Alexandra Silva (CWI, Netherlands) (co-chair) Pawel Sobocinski (University of Southampton, UK) Ana Sokolova (University of Salzburg, Austria) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Frank D. Valencia (LIX, France) Nalini Vasudevan (Intel Labs, USA) Hugo Torres Vieira (Universidade Nova de Lisboa, Portugal) Erik de Vink (Technische Universiteit Eindhoven, Netherlands) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy) - Marco Carbone (IT University of Copenhagen, Denmark) - Alexandra Silva (CWI, Netherlands; co-chair) === Contact === ice2011 at easychair.org === Previous editions === The previous three 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 a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10) is now in preparation. === Sponsors === CEA List -------------- next part -------------- An HTML attachment was scrubbed... URL: From tiezzi at dsi.unifi.it Tue Mar 29 06:46:58 2011 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Tue, 29 Mar 2011 12:46:58 +0200 Subject: [TYPES/announce] EXTENDED Deadline for WWV 2011 Message-ID: <863E68C5-8567-47C8-B31B-139ABF5353A7@dsi.unifi.it> [Apologies for multiple copies] ************************************************************************* Deadline for abstract and paper submission to WWV 2011 has been extended: Abstract submission (new date): April 4, 2011 Paper submission (new date): April 11, 2011 ************************************************************************* ******************************************************** Call for Papers WWV 2011 Automated Specification and Verification of Web Systems 7th International Workshop (as part of DisCoTec'11) http://rap.dsi.unifi.it/wwv2011/ June 9, 2011 - Reykjavik, Iceland ******************************************************** IMPORTANT DATES Abstract Submission (NEW) April 4, 2011 Full Paper Submission (NEW) April 11, 2011 Acceptance Notification May 3, 2011 Camera Ready (pre-proceedings) May 30, 2011 Workshop June 9, 2011 Camera Ready (post-proceedings) July 4, 2011 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 Elie Najm Telecom ParisTech, France 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=wwv2011 Submission is a firm commitment that at least one of the authors will attend the conference, 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 Laura Kovacs Vienna University of Technology, Austria Rosario Pugliese University of Florence, Italy Francesco Tiezzi University of Florence, Italy PROGRAM COMMITTEE Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Santiago Escobar Technical University of Valencia, Spain Jean-Marie Jacquet University of Namur, Belgium Laura Kovacs Vienna University of Technology, Austria Temur Kutsia Johannes Kepler University Linz, Austria Tiziana Margaria Univ. Potsdam, Germany Manuel Mazzara University of Newcastle, United Kingdom Catherine Meadows NRL, United States Yasuhiko Minamide University of Tsukuba, Japan Rosario Pugliese University of Florence, Italy I.V. Ramakrishnan SUNY Stony Brook, United States Maurice ter Beek ISTI-CNR, Pisa, Italy Francesco Tiezzi University of Florence, Italy Franz Weitl National Institute of Informatics, Tokyo, Japan Nobuko Yoshida Imperial College London, United Kingdom CONTACT wwv2011 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From manuel.mazzara at newcastle.ac.uk Wed Mar 30 06:57:13 2011 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Wed, 30 Mar 2011 11:57:13 +0100 Subject: [TYPES/announce] INTRUSO 2011 - Second CFP Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA305F355807D9@EXSAN01.campus.ncl.ac.uk> INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM'11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this "service revolution" will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general "rigorous software development" might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks.), service dependability, service evaluation/monitoring/testing, etc., a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific 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. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, .) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. 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. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We have already agreed with the editor of the international Journal of Internet Services and Information Security to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * April 18, 2011: Submission of papers * May 16, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27, 2011: INTRUSO Workshop Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra at imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas at oracle.com * Fabio Massacci, University of Trento, Italy - massacci at disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara at newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montr?al, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep K?ngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hern?n Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA From Bruno.Blanchet at ens.fr Wed Mar 30 10:28:12 2011 From: Bruno.Blanchet at ens.fr (Bruno Blanchet) Date: Wed, 30 Mar 2011 16:28:12 +0200 Subject: [TYPES/announce] FCS'11 extended deadline April 10 (Workshop on Foundations of Computer Security) Message-ID: <20110330142812.GJ7482@di.ens.fr> EXTENDED DEADLINE: April 10, 2011 +-------------------------------------------------------------------------+ ! ! ! FCS 2011 ! ! Workshop on Foundations of Computer Security ! ! Toronto, Ontario, Canada ! ! June 20, 2011 ! ! http://www.di.ens.fr/~blanchet/fcs11/ ! ! ! ! Affiliated with LICS 2011 ! ! ! +-------------------------------------------------------------------------+ Extended deadline: April 10, 2011 Notification of acceptance: April 29, 2011 Final papers: May 23, 2011 Background, aim and scope ========================= Computer security is an established field of computer science of both theoretical and practical significance. In recent years, there has been increasing interest in logic-based foundations for various methods in computer security, including the formal specification, analysis and design of security protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, and the modeling of information flow and its application to confidentiality policies, system composition, and covert channel analysis. The aim of the workshop FCS'11 is to provide a forum for continued activity in different areas of computer security, bringing computer security researchers in closer contact with the LICS community and giving LICS attendees an opportunity to talk to experts in computer security, on the one hand, and contribute to bridging the gap between logical methods and computer security foundations, on the other. We are interested both in new results in theories of computer security and also in more exploratory presentations that examine open questions and raise fundamental concerns about existing theories, as well as in new results on developing and applying automated reasoning techniques and tools for the formal specification and analysis of security protocols. We thus solicit submissions of papers both on mature work and on work in progress. Possible topics include, but are not limited to: Automated reasoning techniques Composition issues Formal specification Foundations of verification Information flow analysis Language-based security Logic-based design Program transformation Security models Static analysis Statistical methods Tools Trust management for Access control and resource usage control Authentication Availability and denial of service Covert channels Confidentiality Integrity and privacy Intrusion detection Malicious code Mobile code Mutual distrust Privacy Security policies Security protocols Submission ========== All submissions will be peer-reviewed. Authors of accepted papers must guarantee that their paper will be presented at the workshop. Submissions should be at most 15 pages (a4paper, 11pt), including references in the Springer LNCS style available at the URL http://www.springer.de/comp/lncs/authors.html The cover page should include title, names of authors, co-ordinates of the corresponding author, an abstract, and a list of keywords. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referees but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Authors are invited to submit their papers electronically, as portable document format (pdf) or postscript (ps); please, do not send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). The only mechanism for paper submissions is via the dedicated EasyChair submission web page: https://www.easychair.org/account/signin.cgi?conf=fcs2011 Please follow the instructions given there. Publication =========== Informal proceedings will be made available in electronic format and they will be distributed to all participants of the workshop. Program committee ================= * Bruno Blanchet (INRIA, Ecole Normale Sup?rieure, CNRS, France; co-chair) * Michele Boreale (Universit? di Firenze, Italy) * Adam Chlipala (Harvard University, USA) * V?ronique Cortier (LORIA INRIA-Lorraine, France) * Andrew D. Gordon (Microsoft Research Cambridge, UK) * Matthew Hennessy (Trinity College Dublin, Ireland) * Alan Jeffrey (Bell Labs, USA; co-chair) * Matteo Maffei (Saarland University, Germany) * Benjamin Pierce (University of Pennsylvania, USA) * Pierangela Samarati (Universit? degli Studi di Milano, Italy) * David Sands (Chalmers University of Technology, Sweden) * Geoffrey Smith (Florida International University, USA) * Bogdan Warinschi (University of Bristol, UK) From spider.vz at gmail.com Wed Mar 30 16:59:40 2011 From: spider.vz at gmail.com (Vadim Zaytsev) Date: Wed, 30 Mar 2011 22:59:40 +0200 Subject: [TYPES/announce] SLE 2011 - Deadline extension Message-ID: ============================================================ * DEADLINE EXTENSION * SLE 2011 4th International Conference on Software Language Engineering Braga, Portugal, 3-6 July 2011 http://planet-sl.org/sle2011/ ============================================================= PAPER SUBMISSION DEADLINE EXTENSION The paper submission deadline has been *extended* and is now set to April, 15th --------------------------------------------------------- INVITED SPEAKERS SLE 2011 is proud to announce the following invited speakers. Krzysztof Czarnecki is associate professor at the University of Waterloo and industrial research chair at Bank of Nova Scotia / NSERC. Before coming to Waterloo, he spent eight years at DaimlerChrysler Research working on the practical applications of generative programming. His current work focuses on realizing the synergies between generative and model-driven software development. Paul Klint is head of the software engineering department at Centrum Wiskunde en Informatica in Amsterdam, full professor in Computer Science at the University of Amsterdam and theme leader of Software Analysis and Transformation at CWI. His research interests include generic language technology, domain-specific languages, software renovation, and technology transfer. --------------------------------------------------------- CO-LOCATED EVENTS The following events will take place together with SLE 2011: Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE) * http://gttse.wikidot.com/2011 Coupled Software Transformations Workshop (CSXW) * http://www.di.univaq.it/CSXW2011/ Industry Track of Software Language Engineering (ITSLE) * http://planet-sl.org/itsle2011/ Workshop on Transforming and Weaving Ontologies and MDE (TWOMDE) * http://planet-sl.org/twomde2011/ ------------------------------------------------------------ SLE 2011 COMITTEES GENERAL CHAIR Jo?o Saraiva Universidade do Minho, Portugal jas at di.uminho.pt PROGRAM CO-CHAIRS Uwe A?mann Dresden University of Technology, Germany uwe.assmann at tu-dresden.de Anthony Sloane Macquarie University, Australia anthony.sloane at mq.edu.au SLE/GTTSE Student Workshop Joost Visser Software Improvement Group j.visser at sig.eu Eric Van Wyk University of Minnesota, USA evw at cs.umn.edu PROGRAM COMITTEE Adrian Johnstone, University of London, UK Aldo Gangemi, Semantic Technology Laboratory, Italy Alexander Serebrenik, Eindhoven University of Technology, Netherlands Ana Moreira, FCT/UNL, Portugal Anthony Cleve, University of Namur, Belgium Anya Helene Bagge, University of Bergen, Norway Bernhard Rumpe, Aachen University, Germany Bijan Parsia, University of Manchester, UK Brian Malloy, Clemson University, USA Bruno Oliveira, Seoul National University, Korea Chiara Ghidini, FBK-irst, Italy Daniel Oberle, SAP Research, Germany Eelco Visser, Delft University of Technology, Netherlands Eric Van Wyk, University of Minnesota, USA Fernando Pereira, Federal University of Minas Gerais, Brasil Fernando Silva Parreiras, University of Koblenz-Landau, Germany Friedrich Steimann, University of Hannover, Germany G?rel Hedin, Lund University, USA Ivan Kurtev, University of Twente, Netherlands James Power, National University of Ireland, Ireland Jean-Marie Favre, OneTree Technologies, France Jeff Gray, University of Alabama, USA Jeff Z. Pan, University of Aberdeen, UK Jo?o Paulo Fernandes, Univ. of Minho & Univ. of Porto, Portugal John Boyland, University of Wisconsin-Milwaukee, USA John Grundy, Swinburne University of Technology, Australia Jordi Cabot, ?cole des Mines de Nantes, France Jurgen Vinju, CWI, Netherlands Laurence Tratt, Middlesex University, UK Marjan Mernik, University of Maribor, Slovenia Mark van den Brand, Eindhoven University of Technology, Netherlands Michael Collard, University of Akron, USA Nicholas Kraft, University of Alabama, USA Paul Klint, CWI, Netherlands Paulo Borba, Federal University of Pernambuco, Brazil Peter Haase, University of Karlsruhe, Germany Peter Mosses, Swansea University, UK Ralf M?ller, Hamburg University of Technology, Germany Silvana Castano, University of Milan, Italy Steffen Zschaler, Lancaster University, UK York Sure, University of Koblenz-Landau, Germany Zhenjiang Hu, National Institute of Informatics, Japan ORGANIZATION COMMITTEE Jos? Creissac Campos (Finance Chair) Universidade do Minho, Portugal Jo?o Paulo Fernandes (Web and Publicity co-Chair) Universidade do Porto & Universidade do Minho, Portugal Jurgen Vinju (Workshop Selection Chair) CWI, The Netherlands Vadim Zaytsev (Publicity co-Chair) CWI, The Netherlands From ricardo at sip.ucm.es Thu Mar 31 03:39:36 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Thu, 31 Mar 2011 09:39:36 +0200 Subject: [TYPES/announce] TFP 2011: Last Call for Papers and Call for Participation Message-ID: <4D942FB8.7090303@sip.ucm.es> ********************************************************* LAST CALL FOR PAPERS and CALL FOR PARTICIPATION 12th International Symposium Trends in Functional Programming 2011 Madrid, Spain May 16-18, 2011 http://dalila.sip.ucm.es/tfp11 ********************************************************* SUBMISSION AND REGISTRATION DATES APPROACHING (2011) Full papers/extended abstracts submission: April 2nd Notification of acceptance for presentation: April 15th Early registration deadline: April 25th Camera ready for draft proceeding: April 30th INVITED SPEAKER In this TFP edition, an invited talk will be given by Neil Mitchell (http://community.haskell.org/~ndm/), who finished his PhD thesis on 'Transformation and Analysis of Functional Programs' at the University of York, England, and is currently working for the Standard Chartered Bank. The title of the talk is 'Finding functions from types', and will be about the Hoogle tool (http://haskell.org/hoogle). DESCRIPTION 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, as a Springer Lecture Notes in Computer Science volume, as they were for the TFP-2010 selected papers. TFP 2011 is going to be held in the Computer Science Faculty of Complutense University of Madrid, on May 16-18, 2011. It will be co-located with the 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) (http://dalila.sip.ucm.es/fopara11/). This collocation could make such a gathering a very interesting event and will allow researchers from the two communities to exchange ideas. 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, and in Oklahoma (USA) in 2010. 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: o Dependently typed functional programming o Validation and verification of functional programs o Debugging for functional languages o Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids etc. o Functional languages for reasoning about imperative/object-oriented programs o Interoperability with imperative programming languages o Novel memory management techniques o Program transformation techniques o Empirical performance studies o Abstract/virtual machines and compilers for functional languages o New implementation strategies o 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 2011 program chair, Ricardo Pe~na, at tfp2011 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 articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (6 to 10 pages in length) or full papers (16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. 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 2011 website. Submission procedures will be posted on the TFP 2011 website as the submission deadline is approaching. 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 (see http://dalila.sip.ucm.es/tfp11/). POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the last year decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science series (previous editions were published by Intellect). 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. Important dates (2011): TFP 2011 Symposium: May 16-18th Student papers feedback: June 6th Submission for formal review: June 24th Notification of acceptance for LNCS: September 2nd Camera ready paper: September 23rd TFP 2011 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: Ricardo Pe~na, Complutense University of Madrid, ES TFP 2011 PROGRAMME COMMITTEE Peter Achten (Radboud University Nijmegen, NL) Ana Bove (Chalmers University of Technology, SE) Olaf Chitil (University of Kent, UK) Marko van Eekelen (Radboud University Nijmegen,Open University, NL) Robby Findler (Northwestern University, USA) Victor Gul'ias (University of La Coru~na, ES) Jurriaan Hage (University of Utrecht, NL) Kevin Hammond (University of St. Andrews, UK) Michael Hanus (Christian Albrechts University zu Kiel, DE) Zolt'an Horv'ath (E"otv"os Lor'and University, HU) Frank Huch (Christian Albrechts University zu Kiel, DE) Mauro Jaskelioff (National University of Rosario, AR) Rita Loogen (Philipps University Marburg, DE) Jay McCarthy (Brigham Young University, USA) Henrik Nilsson (University of Nottingham, UK) Rex Page (University of Oklahoma, USA) Ricardo Pe~na (Chair) (Complutense University of Madrid, ES) John Reppy (University of Chicago, USA) Konstantinos Sagonas (Uppsala University, SE, and National Technical University of Athens, GR) Simon Thompson (University of Kent, UK) German Vidal (Universidad Polit'ecnica de Valencia, ES) SPONSORS Computer Science Faculty, Complutense University of Madrid Spanish Ministry of Science and Innovation From Manuela.Bujorianu at manchester.ac.uk Thu Mar 31 14:09:59 2011 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Thu, 31 Mar 2011 18:09:59 +0000 Subject: [TYPES/announce] FIRE research school in Manchester Message-ID: <38A9C8B532151940826352E121D3570C02D8C3@MBXP07.ds.man.ac.uk> *** Apologies for multiple copies due to cross-posting *** *** Please forward to colleagues who might be interested *** ---> IMPORTANT <--- =========================== FIRE =============================== Formal and Interdisciplinary methods in Resilience Engineering 23-25 May 2011 A research School organised by The Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) University of Manchester, UK Part of MaDe: Manchester Dependability Week http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/MaDe.html ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ?Safety is the sum of events that do not occur. While accident research has focussed on that occurred and try to understand why, safety research should focus on the accidents that did not occur and try to understand why? `` Resilience Engineering: concepts and precepts" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ =========================== Structure =============================== 1 Course + 5 tutorials + 2 lectures: Course on ``Probabilistic Model Checking? By Prof. Joost-Pieter Katoen ; Duration: 4 hours Tutorial on ``Probabilistic Models and Tools for Information Security Decisions? By Prof. Aad van Moorsel ; Duration: 2 hours, Tutorial on ``Introduction to object-oriented Modeling and Simulation with Modelica using OpenModelica? By Dr. Mohsen Torabzadeh-Tari ; Duration: 2 hours, Tutorial on ``Solving discrete time control systems under severe uncertainty using imprecise probabilities? By Prof. Matthias Troffaes ; Duration: 2 hours, Tutorial on ``Algorithmic Game Theory? By Prof. Anna Philippou ; Duration: 2 hours, Lecture on ``The Road to Resilience: Autonomy, Fault Tolerance, Verification? By Dr. Manuela Bujorianu ; Duration: 1 hour, Lecture on ``Resilience Engineering: A Quick Tour? By Dr. Manuela Bujorianu ; Duration: 1 hour, Tutorial on ``Steering Computer Simulation Of Physical Systems? By Prof. John Brook ; Duration: 2 hours, =========================== Organisation =============================== Contact: Manuela Bujorianu, John Brooke and Helen Harper - CICADA; Place and time: 9.30 am - 5.00 pm Frank Adams rooms, Alan Turing Building, Manchester University Registration Registration website will be open soon. Registration fee will be around 30GBP. Payment can be also made at the site. The phD students can apply for fee waiving grant. If you would like to register your interest in the event, please contact Helen Harper (Helen.Harper at Manchester.ac.uk) in the first instance. Accommodation There are several hotels near to the Alan Turing Building. Please consult the school webpage for details. From A.Jung at cs.bham.ac.uk Fri Apr 1 05:47:56 2011 From: A.Jung at cs.bham.ac.uk (Achim Jung) Date: Fri, 1 Apr 2011 10:47:56 +0100 (BST) Subject: [TYPES/announce] BCTCS 2011: 2nd Call for Participation Message-ID: [ Only a few days left to register.... ] ======================================================================= 27th British Colloquium for Theoretical Computer Science (BCTCS) 18th to 21st April 2011 University of Birmingham http://events.cs.bham.ac.uk/BCTCS2011 SCOPE The purpose of the BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. The conference will consist of invited keynote presentations by distinguished researchers and a number of contributed talks. LOCATION AND SCHEDULE BCTCS 2011 will be held at the University of Birmingham, a short train ride away from the central "New Street Station" which has direct connections from much of the UK. Accommodation will be provided by the Etap Hotel in the city centre with easy access to eateries and other amenities. The event will start on Monday afternoon and will end with a lunch on Thursday (the day before Good Friday). INVITED SPEAKERS BCTCS 2011 will include invited lectures by the following distinguished speakers: * David S. Johnson (AT&T Labs) * Cliff Jones (Newcastle) * Prakash Panangaden (McGill) * Peter Selinger (Dalhousie) * Nigel Smart (Bristol) * Carsten Witt (Technical University of Denmark) CONTRIBUTED TALKS Participants at the colloquium are encouraged to present a contributed talk. If you wish to present a contributed talk, please give the title when you register for the Colloquium. You will be asked to provide an abstract, using a provided LaTeX template, at a later stage. The abstracts of accepted contributed talks will be published in the Bulletin of the European Association for Theoretical Computer Science. REGISTRATION The registration fee is GBP 290, which includes accommodation (nights of the 18th, 19th, and 20th) and one evening meal. Registration is via the Colloquium website. Registration closes on 4 APRIL 2011. ORGANISATION AND FURTHER INFORMATION The conference is being organised by Achim Jung, Paul Levy, and Sarah Collins of the School of Computer Science, University of Birmingham. More information about the meeting including updates are available from the conference webpages at: http://events.cs.bham.ac.uk/BCTCS2011 Queries can be sent to: bctcs2011 at cs.bham.ac.uk. We hope to see you there! From jun.pang at uni.lu Fri Apr 1 09:08:20 2011 From: jun.pang at uni.lu (Jun PANG) Date: Fri, 1 Apr 2011 15:08:20 +0200 Subject: [TYPES/announce] SecCo 2011: First Call for Papers Message-ID: +-------------------------------------------------------------------------+ ! ! ! SecCo 2011 ! ! Aachen, Germany ! ! Monday, September 5th, 2011 ! ! http://www.lix.polytechnique.fr/~kostas/SecCo2011/ ! ! ! ! Affiliated with CONCUR 2011 ! ! ! +-------------------------------------------------------------------------+ IMPORTANT DATES =============== Papers due: June 3rd, 2011 Notification: July 8th, 2011 Final paper due: July 22nd, 2011 Workshop: September 5th, 2011 BACKGROUND, AIM AND SCOPE ========================= Emerging trends in concurrency theory require the definition of models and languages adequate for the design and management of new classes of applications, mainly to program either WANs (like Internet) or smaller networks of mobile and portable devices (which support applications based on a dynamically reconfigurable communication structure). Due to the openness of these systems, new critical aspects come into play, such as the need to deal with malicious components or with a hostile environment. Current research on network security issues (e.g. secrecy, authentication, etc.) usually focuses on opening cryptographic point-to-point tunnels. Therefore, the proposed solutions in this area are not always exploitable to support the end-to-end secure interaction between entities whose availability or location is not known beforehand. The aim of the workshop is to cover the gap between the security and the concurrency communities. More precisely, the workshop promotes the exchange of ideas, trying to focus on common interests and stimulating discussions on central research questions. In particular, we look for papers dealing with security issues -- such as authentication, integrity, privacy, confidentiality, access control, denial of service, service availability, safety aspects, fault tolerance, trust, language-based security, probabilistic and information theoretic models -- in emerging fields like web services, mobile ad-hoc networks, agent-based infrastructures, peer-to-peer systems, context-aware computing, global/ubiquitous/pervasive computing. SecCo 2011 follows the success of SecCo'03 (affiliated to ICALP'03), SecCo'04 (affiliated to CONCUR'04), SecCo'05 (affiliated to CONCUR'05), SecCo'07 (affiliated to CONCUR'07), SecCo'08 (affiliated to CONCUR'08), SecCo'09 (affiliated to CONCUR'09) and SecCo'10 (affiliated to CONCUR'10). SUBMISSION ========== The workshop proceedings will be published in the new EPTCS series (Electronic Proceedings in Theoretical Computer Science, see http://www.cse.unsw.edu.au/~rvg/EPTCS/ and http://www.informatik.uni-trier.de/~ley/db/series/eptcs/index.html for the list of all published EPTCS volumes); we thus encourage submissions already in that format (A4 size). Submissions may be of two kinds: - Normal submissions, included in the EPTCS proceedings. - Presentation-only submissions. These could overlap with submissions to other conferences or journals, and will not be included in the proceedings. These provide an opportunity to present innovative ideas and get feedback from a technically competent audience. The page limit is 18 pages including the bibliography but excluding well-marked appendices. The page limit is the same for both kinds of submissions, please indicate clearly whether you intend you paper to be included in the proceedings or not. Papers must be submitted electronically at the following URL: http://www.easychair.org/conferences/?conf=secco11 A special issue of Journal of Computer Security (JCS) has been arranged in collaboration with TOSCA (ARSPA-WITS) 2011. Selected papers from both workshops will be invited for submission, and will be peer-reviewed according to the standard policy of JCS. PROGRAM COMMITTEE ================= * Miguel E. Andres (Ecole Polytechnique, France) * Kostas Chatzikokolakis (Ecole Polytechnique, France; co-chair) * Stephanie Delaune (ENS Cachan, France) * Ralf Kuesters (University of Trier, Germany) * Gavin Lowe (University of Oxford, UK) * Jun Pang (University of Luxembourg, Luxembourg; co-chair) * Mark Ryan (University of Birmingham, UK) * Dominique Unruh (Saarland University, Germany) * Luca Vigano (University of Verona, Italy) * Chenyi Zhang (University of New South Wales, Australia) From s.p.luttik at tue.nl Fri Apr 1 09:31:37 2011 From: s.p.luttik at tue.nl (Bas Luttik) Date: Fri, 01 Apr 2011 15:31:37 +0200 Subject: [TYPES/announce] PhD position in probabilistic processes and modal logic at VU University Amsterdam Message-ID: <4D95D3B9.5030000@tue.nl> In the research project From Modal Logic to Probabilistic Processes and Back there is a vacancy for a 4 year PhD position at the VU University Amsterdam. This is a joint project between the Theoretical Computer Science group at the VU University Amsterdam and the Model Driven Software Engineering group at Eindhoven University of Technology. The project involves research at the crossroads of modal logic, process algebra, and structural operational semantics, in the context of probabilistic processes. More information on the project can be found at http://www.cs.vu.nl/~tcs/problog.pdf To apply, send a CV, letter of motivation, and names of at least two references to Wan Fokkink (w.j.fokkink at vu.nl) and Bas Luttik (s.p.luttik at tue.nl). Deadline for application is May 15, 2011. From Klaus.Havelund at jpl.nasa.gov Fri Apr 1 15:14:03 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (318M)) Date: Fri, 1 Apr 2011 12:14:03 -0700 Subject: [TYPES/announce] [fm-announcements] NFM 2011 - call for participation Message-ID: CALL FOR PARTICIPATION NFM 2011 Third NASA Formal Methods Symposium Pasadena, California, USA April 18 - 20, 2011 http://lars-lab.jpl.nasa.gov/nfm2011 THEME: The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, government and industry, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. The focus of the symposium is on formal methods, and aims to foster collaboration between NASA researchers and engineers and the wider aerospace and academic formal methods communities. The symposium will be comprised of a mixture of invited talks, invited tutorials, and presentation of papers and tool demonstrations. COSTS: There will be no registration fee charged to participants. INVITED SPEAKERS: Rustan Leino, Microsoft Research, USA: "From Retrospective Verification to Forward-Looking Development" Oege de Moor, University of Oxford, UK: "Do Coding Standards Improve Software Quality?" Andreas Zeller, Saarland University, Germany: "Specifications for Free" TUTORIALS: Andreas Bauer, NICTA and Australian National University, Australia, and Martin Leucker, University of Luebec, Germany: "The Theory and Practice of SALT - Structured Assertion Language forTemporal Logic" Bart Jacobs, Katholieke Universiteit Leuven, Belgium: "VeriFast: a Powerful, Sound, Predictable, Fast Verifier for C and Java" Michal Moskal, Microsoft Research, USA: "Verification of Functional Correctness of Concurrent C Programs with VCC" HISTORY: NFM 2011 is the third edition of the NASA Formal Methods Symposium, organized by NASA on a yearly basis. The first in 2009 and was organized at NASA Ames Research Center, Moffett Field, California. The second in 2010 was organized at NASA head quarters, Washington D.C. The symposium originated from the earlier Langley Formal Methods Workshop series. PROGRAMME CHAIRS: Mihaela Bobaru, NASA/Jet Propulsion Laboratory Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Rajeev Joshi, NASA/Jet Propulsion Laboratory PROGRAMME COMMITTEE: Rajeev Alur, University of Pennsylvania, USA Tom Ball, Microsoft Research, USA Howard Barringer, University of Manchester, UK Saddek Bensalem, Verimag Laboratory, France Nikolaj Bjoerner, Microsoft Research, USA Eric Bodden, Technical University Darmstadt, Germany Marsha Chechik, University of Toronto, Canada Rance Cleaveland, University of Maryland, USA Dennis Dams, Bell Labs/Alcatel-Lucent, Belgium Ewen Denney, NASA Ames Research Center, USA Matt Dwyer, University of Nebraska, USA Cormac Flanagan, UC Santa Cruz, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Patrice Godefroid, Microsoft Research, USA Alex Groce, Oregon State University, USA Radu Grosu, Stony Brook, USA John Hatcliff, Kansas State University, USA Mats Heimdahl, University of Minnesota, USA Mike Hinchey, Lero - the Irish SW. Eng. Research Centre, Ireland Sarfraz Khurshid, University of Texas at Austin, USA Orna Kupferman, Jerusalem Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Rupak Majumdar, Max Planck Institute, Germany Kenneth McMillan, Cadence Berkeley Labs, USA Cesar Munoz, NASA Langley, USA Madan Musuvathi, Microsoft Research, USA Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Shaz Qadeer, Microsoft Research, USA Grigore Rosu, University of Illinois at Urbana-Champaign, Nicolas Rouquette, NASA/Jet Propulsion Laboratory, USA Kristin Rozier, NASA Ames Research Center, USA John Rushby, SRI International, USA Wolfram Schulte, Microsoft Research, USA Koushik Sen, Berkeley University, USA Sanjit Seshia, Berkeley University, USA Natarajan Shankar, SRI International, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Ben Di Vito, NASA Langley, USA Mike Whalen, University of Minnesota, USA STEERING COMMITTEE: Ewen Denney, NASA Ames Research Center Dimitra Giannakopoulou, NASA Ames Research Center Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Cesar Munoz, NASA Langley Corina Pasareanu, NASA Ames Research Center James Rash, NASA Goddard Kristin Y. Rozier, NASA Ames Research Center Ben Di Vito, NASA Langley -------------- next part -------------- An HTML attachment was scrubbed... URL: From Klaus.Havelund at jpl.nasa.gov Fri Apr 1 15:51:15 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (318M)) Date: Fri, 1 Apr 2011 12:51:15 -0700 Subject: [TYPES/announce] [fm-announcements] RV 2011 - 2nd Call for Papers and Tutorials Message-ID: 2nd Call for Papers and Tutorials International Conference on Runtime Verification (RV 2011) September 27 - 30, 2011 San Francisco, California, USA http://rv2011.eecs.berkeley.edu/ Runtime verification (RV) is concerned with monitoring and analysis of software or hardware system executions. The field is often referred to under different names, such as runtime verification, runtime monitoring, runtime checking, runtime reflection, runtime analysis, dynamic analysis, runtime symbolic analysis, trace analysis, log file analysis, etc. RV can be used for many purposes, such as security or safety policy monitoring, debugging, testing, verification, validation, profiling, fault protection, behavior modification (e.g., recovery), etc. A running system can be abstractly regarded as a generator of execution traces, i.e., sequences of relevant states or events. Traces can be processed in various ways, e.g., checked against formal specifications, analyzed with special algorithms, visualized, etc. Topics of interest include, but are not limited to: * program instrumentation techniques * specification languages for writing monitors * dynamic program slicing * record-and-replay * trace simplification for debugging * extraction of monitors from specifications * APIs for writing monitors * programming language constructs for monitoring * model-based monitoring and reconfiguration * the use of aspect oriented programming for dynamic analysis * algorithmic solutions to minimize runtime monitoring impact * combination of static and dynamic analysis * full program verification based on runtime verification * intrusion detection, security policies, policy enforcement * log file analysis * model-based test oracles * observation-based debugging techniques * fault detection and recovery * model-based integrated health management and diagnosis * program steering and adaptation * dynamic concurrency analysis * dynamic specification mining * metrics and statistical information gathered during runtime * program execution visualization * data structure repair for error recovery * parallel algorithms for efficient monitoring * monitoring for effective fault localization and program repair The RV series of events started in 2001, as an annual workshop. The RV'01 to RV'05 proceedings were published in ENTCS. Since 2006, the RV proceedings have been published in LNCS. In year 2010, RV became an international conference. Links to past RV events can be found at the permanent URL: http://runtime-verification.org INVITED SPEAKERS TBD Talk titles will be made available on RV 2011 web page. PAPER SUBMISSION RV will have two research paper categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. * Regular papers (up to 15 pages) should present original unpublished results. Applications of runtime verification are particularly welcome. A Best Paper Award (USD 300) will be offered. * Short papers (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (5-10 minutes) and poster sessions. In addition to short and regular papers, proposals for tutorials and tool demonstrations are welcome. Proposals should be up to 2 pages long. * Tutorial proposals on any of the topics above, as well as on topics at the boundary between RV and other domains, are welcome. Accepted tutorials will be allocated up to 15 pages in the conference proceedings. Tutorial presentations will be at least 2 hours. * Tool demonstration proposals should briefly introduce the problem solved by the tool and give the outline of the demonstration. Tool papers will be allocated 5 pages in the conference proceedings. A Best Tool Award (USD 200) will be offered. Submitted tutorial and tool demonstration proposals will be evaluated by the corresponding chairs, with the help of selected reviewers. All accepted papers, including tutorial and tool papers, will appear in the LNCS proceedings. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'11 to present the paper. Papers must be submitted electronically using the EasyChair system. A link to the electronic submission page will be made available on the RV'11 web page. IMPORTANT DATES June 5, 2011 - Submission of regular and short papers June 12, 2011 - Submission of tutorial and tool demonstration proposals July 24, 2011 - Notification for regular, short, and tool papers August 21, 2011 - Submission of camera-ready versions of accepted papers September 27-30, 2011 - RV 2011 Conference and tutorials ORGANIZERS Programme committee chairs: Sarfraz Khurshid (University of Texas at Austin, USA) Koushik Sen (University of California at Berkeley, USA) Local organization chairs: Jacob Burnim (University of California at Berkeley, USA) Nicholas Jalbert (University of California at Berkeley, USA) PROGRAM COMMITTEE Howard Barringer (University of Manchester, UK) Eric Bodden (Technical University Darmstadt, Germany) Rance Cleaveland (University of Maryland, USA) Mads Dam (Kungliga Tekniska h?gskolan, Sweden) Brian Demsky (University of California at Irvine, USA) Bernd Finkbeiner (Saarland University, Germany) Cormac Flanagan (University of California at Santa Cruz, USA) Patrice Godefroid (Microsoft Research Redmond, USA) Jean Goubault-Larrecq (ENS Cachan, France) Susanne Graf (Verimag, France) Radu Grosu (State University of New York at Stony Brook, USA) Lars Grunske (University of Kaiserslautern, Germany) Aarti Gupta (NEC Laboratories America, USA) Rajiv Gupta (University of California at Riverside, USA) Klaus Havelund (NASA/JPL, USA) Mats Heimdahl (University of Minnesota, USA) Gerard Holzmann (NASA/JPL, USA) Sarfraz Khurshid (University of Texas at Austin, USA) (co-chair) Viktor Kuncak (?cole Polytechnique F?d?rale De Lausanne, Switzerland) Kim Larsen (Aalborg University, Denmark) Martin Leucker (University of Luebeck, Germany) Rupak Majumdar (Max Planck Institute Germany and University of California at Los Angeles USA) Greg Morrisett (Harvard University, USA) Mayur Naik (Intel Berkeley Labs, USA) Brian Nielsen (Aalborg University, Denmark) Klaus Ostermann (University of Marburg, Germany) Corina Pasareanu (NASA Ames, USA) Wim De Pauw (IBM T. J. Watson, USA) Doron Peled (Bar Ilan University, Israel) Suzette Person (NASA Langley, USA) Gilles Pokam (Intel, Santa Clara, USA) Shaz Qadeer (Microsoft Research Redmond, USA) Derek Rayside (University of Waterloo, Canada) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Wolfram Schulte (Microsoft Research Redmond, USA) Manu Sridharan (IBM T. J. Watson, USA) Koushik Sen (University of California, Berkeley, USA) (co-chair) Peter Sestoft (IT University of Copenhagen, Denmark) Scott Smolka (State University of New York at Stony Brook, USA) Oleg Sokolsky (University of Pennsylvania, USA) Mana Taghdiri (Karlsruhe Institute of Technology, Germany) Serdar Tasiran (Koc University, Turkey) Nikolai Tillmann (Microsoft Research Redmond, USA) Shmuel Ur (Shmuel Ur Innovation, Israel) Willem Visser (University of Stellenbosch, South Africa) Mahesh Viswanathan (University of Illinois at Urbana-Champaign, USA) Xiangyu Zhang (Purdue University, USA) RV STEERING COMMITTEE Howard Barringer (University of Manchester, UK) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Insup Lee (University of Pennsylvania, USA) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Oleg Sokolsky (University of Pennsylvania, USA) ================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From freund at cs.williams.edu Sun Apr 3 21:10:10 2011 From: freund at cs.williams.edu (Steve Freund) Date: Sun, 3 Apr 2011 21:10:10 -0400 Subject: [TYPES/announce] Second CFP: Formal Techniques for Java-like Programs (FTfJP) 2011 Message-ID: SECOND CALL FOR PAPERS FTfJP 2011: Formal Techniques for Java-like Programs colocated with ECOOP 2011, Lancaster UK July 26, 2011 URL: http://www.cs.williams.edu/FTfJP2011/index.html OVERVIEW Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - formal techniques for Java, C#, Scala or similar languages - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties - verification logics - language semantics - type systems - dynamic linking and loading - security CALL FOR CONTRIBUTIONS Contributions (of up to 6 pages in the ACM 2-column style) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, and the potential to generate interesting discussions. The workshop is intended for around 25 participants. The workshop will be organized into four or more sessions, each focused on a specific topic, and initiated by a presentation of few related position papers by the respective participants, or the introduction of the specific topic by a single speaker, and followed by discussions. 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. A plain-text ASCII abstract must be submitted one week before the paper submission deadline. Submission site: http://www.easychair.org/conferences/?conf=ftfjp13 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: April 8, 2011 full paper submission: April 15, 2011 notification: May 20, 2011 camera-ready paper: June 10, 2011 workshop: July 26, 2011 PROGRAM COMMITTEE Gavin Bierman, Microsoft Research, UK Viviana Bono, Universita di Torino, Italy Manuel Fahndrich, Microsoft Research, USA Stephen Freund, Williams College, USA (chair) Miguel Garcia, Lausanne, Switzerland Giovanni Lagorio, Universita di Genova, Italy Rustan Leino, Microsoft Research, USA Rosemary Monahan, National University of Ireland, Ireland Wojciech Mostowski, Radboud University Nijmegen, The Netherlands Chin Wei Ngan, University of Singapore, Singapore Jan Smans, Katholieke Universiteit Leuven, Belgium Serdar Tasiran, Koc University, Turkey Frank Tip, IBM Research, USA (on sabbatical at University of Oxford, UK) Tobias Wrigstad, Uppsala University, Sweden ORGANIZATION Susan Eisenbach, Imperial College, London, Great Britain Stephen Freund, Williams College, USA Gary T. Leavens, University of Central Florida, Orlando, USA Rustan Leino, Microsoft Research, USA Peter Muller, ETH Zurich, Switzerland Arnd Poetzsch-Heffter, Universitat Kaiserlautern, Germany Erik Poll, Radboud University Nijmegen, The Netherlands From cristi at ifi.uio.no Mon Apr 4 06:03:10 2011 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Mon, 04 Apr 2011 12:03:10 +0200 Subject: [TYPES/announce] Deadline Extended (14 Apr.): FCT 2011 Message-ID: !!!! !! Deadline Extended until _14 April_ (midnight Hawaii time) !! !!!! -------------------------------------------------------------------- Call for Papers FCT 2011 18th International Symposium on Fundamentals of Computation Theory http://fct11.ifi.uio.no/ August 22-25, 2011, Oslo, Norway NEW: scholarships are available for eligible student participants! See the registration web-page for more information. The Symposium on Fundamentals of Computation Theory was established in 1977 for researchers interested in all aspects of theoretical computer science, as well as new emerging fields such as bio-inspired computing. It is a biennial series of conferences previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005), Budapest (Hungary, 2007), and Wroclaw (Poland, 2009). PROCEEDINGS The conference proceedings will be published (as usual) in the Lecture Notes in Computer Science series of Springer-Verlag. SUBMISSIONS Authors are invited to submit papers presenting original unpublished research in all areas of theoretical computer science. Topics of interest include (but are not limited to): * Algorithms: o algorithm design and optimization o combinatorics and analysis of algorithms o computational complexity o approximation, randomized, and heuristic methods o parallel and distributed computing o circuits and boolean functions o online algorithms o machine learning and artificial intelligence o computational geometry o computational algebra * Formal methods: o algebraic and categorical methods o automata and formal languages o computability and nonstandard computing models o database theory o foundations of concurrency and distributed systems o logics and model checking o models of reactive, hybrid and stochastic systems o principles of programming languages o program analysis and transformation o specification, refinement and verification o security o type systems * Emerging fields: o ad hoc, dynamic, and evolving systems o algorithmic game theory o computational biology o foundations of cloud computing and ubiquitous systems o quantum computation The submission drafts should have at most 12 pages and be formated in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance. If necessary, detailed proofs can be attached as an appendix. Simultaneous submission to other conferences with published proceedings or journals is not allowed. Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=fct2011 IMPORTANT DATES Submission Deadline: Tuesday, 5. April 2011 Author Notification: Monday, 6. June 2011 Camera ready manuscript: Friday 17. June 2011 For further information on the conference, please visit the URL at http://fct11.ifi.uio.no/ INVITED SPEAKERS FCT 2011 is honored by the contribution of three internationally renowned invited speakers. - Yuri Gurevich (Microsoft Research, Redmond USA) - Daniel Lokshtanov (University of California, USA) - Jose Meseguer (University of Illinois at Urbana-Champaign, USA) PROGRAM CHAIRS - Olaf Owe (U. of Oslo) - Martin Steffen (U. of Oslo) - Jan Arne Telle (U. of Bergen) PROGRAM COMMITTEE Erika Abraham (RWTH Aachen, Germany) Wolfgang Ahrendt (Chalmers, Sweden) David Coudert (INRIA Sophia-Antipolis, France) Camil Demetrescu (La Sapienza University of Rome, Italy) Johan Dovland (U. of Oslo, Norway) Jiri Fiala (Charles University, Czech Republic) Martin Hofmann (LMU Munich, Germany) Thore Husfeldt (IT University of Copenhagen, Denmark) Alexander Kurz (U. of Leicester, UK) Andrzej Lingas (Lund University, Sweden) Peter Olveczky (U. of Oslo, Norway) Olaf Owe (U. of Oslo, Norway) - co-chair Miguel Palomino (U. Complutense, Madrid, Spain) Yuri Rabinovich (U. of Haifa, Israel) Saket Saurabh (Inst. of Mathematical Sciences, India) Kaisa Sere (Aabo Akademi University, Finland) Martin Steffen (U. of Oslo, Norway) - co-chair Jan Arne Telle (U. of Bergen, Norway) - co-chair Tarmo Uustalu (Inst. of Cybernetics, Tallinn, Estonia) Ryan Williams (IBM Almaden, USA) Gerhard Woeginger (U. of Eindhoven, The Netherlands) David R. Wood (U. of Melbourne, Australia) Wang Yi (Uppsala University, Sweden) STEERING COMMITTEE Bogdan Chlebus (Warszawa/Denver, Poland/USA) Zoltan Esik (Szeged, Hungary) Marek Karpinski - chair (Bonn, Germany) Andrzej Lingas (Lund, Sweden) Miklos Santha (Paris, France) Eli Upfal (Providence, USA) AFFILIATED EVENTS FCT 2011 will host several affiliated events. These will take part after the main symposium, on the 26 August 2011. More information about each event can be found on their specific web-pages. - Doctoral Symposium affiliated with FCT'11 web: http://fct11.ifi.uio.no/index.php?n=Workshops.DoctoralSymposium - Workshop on Overcoming Challenges for Security and Dependability (WOCSD) web: http://www.mi.fu-berlin.de/secdep/workshop/2011/cfp.html -------------------------------------------------------------------- From jarin.sevcik at gmail.com Mon Apr 4 06:51:22 2011 From: jarin.sevcik at gmail.com (Jaroslav Sevcik) Date: Mon, 4 Apr 2011 11:51:22 +0100 Subject: [TYPES/announce] CompCertTSO release Message-ID: Dear all, we are pleased to announce a release of CompCertTSO, a certified compiler from a multithreaded C-like language with a TSO relaxed memory model to x86 assembly language with a realistic x86-TSO memory model; the development builds on CompCert. The code, documentation, and papers are available here: http://www.cl.cam.ac.uk/~pes20/CompCertTSO/ They build with Coq 8.3pl1 and OCaml 3.12.0. Any comments would be very welcome. Jaroslav, Viktor, Francesco, Suresh, and Peter From luigi.santocanale at lif.univ-mrs.fr Mon Apr 4 17:03:40 2011 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Mon, 04 Apr 2011 23:03:40 +0200 Subject: [TYPES/announce] TACL 2011, third and last call for papers (submission deadline approaching: 18/04/2011) Message-ID: <4D9A322C.5030803@lif.univ-mrs.fr> [Apologies for multiple copies] *Submission deadline approaching: 18/04/2011* =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) Third and final call for papers =============================================================================== July 26-30, 2011 Universit?s Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Invited speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, Universit? degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. The program committee specially encourages submissions related to the work of Leo Esakia, and may select some of these submission for presentation at the special session. Submissions ----------- Contributed presentations will be of two types: * standard presentations of 20 minutes in parallel sessions, * featured, 30 minutes long, plenary presentations. The submission of an extended abstract in pdf format will be required to be selected for a contributed presentation of either kind. Concerning the standard presentations, while preference will be given to new work, results that have already been published or presented elsewhere will also be considered. Concerning the featured presentations: the program committee will choose a small number of submissions of which the authors will be invited to give a plenary presentation. The criteria for this selection will be: originality, significance and interest to the wider TACL community. There will be just one submission procedure, for contributed presentations of either kind: authors are requested to submit a short text of four pages, in English and in pdf format, through the easychair submission site: https://www.easychair.org/conferences/?conf=tacl2011 Important dates --------------- April 18, 2011: Abstract submission deadline May 20, 2011: Notification to authors July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Universit? degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Universit? Aix-Marseille II Tadeusz Litak, University of Leicester Paul-Andr? Melli?s, CNRS Paris Diderot George Metcalfe, Universit?t Bern Nicola Olivetti, Universit? Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Universit? Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Universit? de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011 at lif.univ-mrs.fr =============================================================================== -- Luigi Santocanale LIF/CMI Marseille T?l: 04 13 55 13 08 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 13 55 13 02 From ekitzelmann at gmail.com Tue Apr 5 17:23:29 2011 From: ekitzelmann at gmail.com (Emanuel Kitzelmann) Date: Tue, 5 Apr 2011 14:23:29 -0700 Subject: [TYPES/announce] Extended submission deadline, AAIP 2011 Message-ID: 4th Workshop on Approaches and Applications of Inductive Programming, AAIP 2011 *The deadline for paper submissions has been extended to April 24, 2011.* More information on AAIP 2011: http://www.cogsys.wiai.uni-bamberg.de/aaip11/ -- Dr. Emanuel Kitzelmann International Computer Science Institute (ICSI) 1947 Center Street, Suite 600 Berkeley, CA 94704, USA e-mail: emanuel at icsi.berkeley.edu phone: +1 510 666 2883 From Francois.Fages at inria.fr Thu Apr 7 02:43:16 2011 From: Francois.Fages at inria.fr (=?windows-1252?Q?Fran=E7ois_Fages?=) Date: Thu, 07 Apr 2011 08:43:16 +0200 Subject: [TYPES/announce] CMSB 2011: second call for papers Message-ID: <4D9D5D04.50308@inria.fr> (Apologies if you receive multiple copies of this message) ================================================================ Call for papers CMSB 2011 9th Int. Conference on Computational Methods in Systems Biology in cooperation with the ACM SIG Bioinformatics September 21-23 2011 Institut Henri Poincar? Paris, France http://contraintes.inria.fr/CMSB11/ ================================================================ CMSB 2011 solicits original research articles on the analysis of biological systems, networks, and data. The conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological processes. Topics of interest include, but are not limited to: original paradigms for modelling biological processes, original models together with their application domains; frameworks and techniques for verifying, validating, analyzing, and simulating biological systems; high-performance computational systems biology and parallel implementations (this year the HiBi workshop is merged into CMSB); inference from high-throughput experimental data; model integration from biological databases; model reduction methods; multi-scale models; control of biological systems. Contributions on modelling and analysis of relevant biological case studies are especially encouraged. INVITED TALKS Pedro Mendes, University of Manchester, UK Denis Thieffry, Ecole Normale Sup?rieure, Paris, France IMPORTANT DATES Abstract submission: April, 29 Paper submission: May, 6 Notification: June, 17 Camera-ready version: July, 1 PROGRAM COMMITTEE Fran?ois Fages (Chair) - INRIA Paris?Rocquencourt, France Paolo Ballarini - INRIA Rennes Bretagne Atlantique, France Hans van Beek - Vrije Universiteit, Netherlands Gilles Bernot - University of Nice Sophia Antipolis, France Alexander Bockmayr - Freie Universit?t Berlin, Germany Vincent Danos - University of Edinburgh, United Kingdom Pierpaolo Degano - University of Pisa, Italy Diego Di Bernardo - TIGEM, Naples, Italy Finn Drablos - NTNU, Norway Jerome Feret - INRIA - ?cole Normale Sup?rieure, France Jasmin Fisher - Microsoft Research Cambridge, United Kingdom Stephen Gilmore - University of Edinburgh, United Kingdom Monika Heiner - Brandenburg University of Technology, Cottbus, Germany Jane Hillston - University of Edinburgh, United Kingdom Ina Koch - Goethe University Frankfurt am Main, Germany Marta Kwiatkowska - Trinity College, University of Oxford, United Kingdom Christopher Langmead - Carnegie Mellon University, Pittsburgh, USA Oded Maler - CNRS Verimag, Grenoble, France Tommaso Mazza - CIBIO / University of Trento, Italy Pedro Mendes, University of Manchester, United Kingdom Bud Mishra - Courant Institute and NYU School of Medicine, New York, USA Satoru Miyano - University of Tokyo, Japan Ion Petre - ?bo Akademi University, Finland Corrado Priami - CoSBi / Microsoft Research, University of Trento, Italy Ovidiu Radulescu - Universit? de Montpellier 2, France Olivier Roux - IRCCyN / ?cole Centrale de Nantes, France Carolyn Talcott - SRI International, Menlo Park CA, USA Denis Thieffry - ?cole Normale Sup?rieure, Paris, France Adelinde Uhrmacher - University of Rostock, Germany Verena Wolf - Saarland University, Saarbr?cken, Germany BEST PAPER AWARDS The Program Committee of CMSB 2011 will give two best paper awards: one Best Student Paper Award and one NVIDIA Best Paper Award. The Best Student Paper Award recipient is given public recognition and receives an award of 500 US$ from the IEEE Technical Committee on Simulation (TCSIM). For a paper to qualify for the Best Student Paper award, a student must be the lead author, the submission must be done in the student paper category and the student must present the paper at the conference. The NVIDIA Best Paper Award recipient is given public recognition and receives one high end Tesla GPU equipment of a value of 3,999 US$ donated by NVIDIA. Any paper on any topic of CMSB can qualify for this award provided the submission indicates the NVIDIA Best Paper Award category. ORGANISING COMMITTEE Gr?gory Batt, Fran?ois Fages, Dragana Jovanovska, Ramon Martin, Thierry Martinez, Sylvain Soliman - INRIA Paris?Rocquencourt, France. Davide Prandi - CoSBI, Trento, Italy. VENUE The Institute Henri Poincar? (IHP) is in the Latin district in the center of Paris, near the Luxembourg garden. SUBMISSION GUIDELINES see http://contraintes.inria.fr/CMSB11 From morawska at tcs.inf.tu-dresden.de Thu Apr 7 07:40:09 2011 From: morawska at tcs.inf.tu-dresden.de (Barbara Morawska) Date: Thu, 7 Apr 2011 13:40:09 +0200 Subject: [TYPES/announce] UNIF 2011: call for papers Message-ID: Please consider submitting to UNIF 2011 - The International Workshop on Unification. https://sites.google.com/a/cs.uni.wroc.pl/unif-2011/ Important Dates May 2, 2011 - Paper submission May 30, 2011 - Notification June 17, 2011 - Final versions July 31, 2011 - Workshop Detailed information on the submission requirements is contained in the attached call for papers. This year Unif is co-located with the CADE conference http://cade23.ii.uni.wroc.pl/, which is going to take place in Wroclaw (Poland), 31 July -5 August 2011. Please forward this email to all who might be interested in UNIF. Franz Baader Barbara Morawska Jah Otop ----------------------------------------------- UNIF 2011 Organization Committee -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: call-unif2011.pdf Type: application/pdf Size: 87717 bytes Desc: not available URL: From shao at cs.yale.edu Thu Apr 7 11:12:56 2011 From: shao at cs.yale.edu (Zhong Shao) Date: Thu, 7 Apr 2011 11:12:56 -0400 Subject: [TYPES/announce] LOLA 2011 -- Final Call for Contributed Talks (Deadline: April 29th) Message-ID: <201104071512.p37FCu1h020376@lux.cs.yale.edu> [The final version of CFP for LOLA 2011 with updated information about the invited speaker and the instructions for submission.] ============================================================ *** FINAL CALL FOR CONTRIBUTED TALKS *** LOLA 2011 Syntax and Semantics of Low Level Languages Monday 20th June 2011, Toronto, Canada A LICS 2011-affiliated workshop http://flint.cs.yale.edu/lola2011 ============================================================ IMPORTANT DATES Submission Deadline Friday 29th April 2011 Author Notification Friday 13th May 2011 Workshop Monday 20th June 2011 SUBMISSION LINK The submissions will be made by easychair at http://www.easychair.org/conferences/?conf=lola2011 INVITED SPEAKER Paul-Andr? Melli?s (CNRS & Universit? Paris Diderot) 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 bogus@does.not.exist.com Tue Mar 8 18:08:42 2011 From: bogus@does.not.exist.com () Date: Tue, 08 Mar 2011 23:08:42 -0000 Subject: No subject Message-ID: new research area at the frontier of logic and computer science. The practically motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified 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, - Implicit complexity, sublinear programming and Turing machines - Parametricity, modules and existential types - General references, Kripke models and recursive types - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects PROGRAM COMMITTEE * Nick Benton (MSR Cambridge) * Josh Berdine (MSR Cambridge) * Lars Birkedal (IT University of Copenhagen, co-chair) * Xinyu Feng (University of Science and Technology of China) * Greg Morrisett (Harvard University) * Xavier Rival (INRIA Roquencourt and ENS Paris) * Zhong Shao (Yale University, co-chair) * Nicolas Tabareau (INRIA - EMN) * J??r??me Vouillon (CNRS) * Noam Zeilberger (University of Paris VII) SUBMISSION INSTRUCTIONS LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. The submissions should be made by easychair at http://www.easychair.org/conferences/?conf=lola2011 From gerardo at ifi.uio.no Thu Apr 7 14:48:14 2011 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Thu, 7 Apr 2011 20:48:14 +0200 Subject: [TYPES/announce] Final CfP: The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11) In-Reply-To: <91FCBAD8-6DFD-487B-94AA-FAB9269A95CB@ifi.uio.no> References: <91FCBAD8-6DFD-487B-94AA-FAB9269A95CB@ifi.uio.no> Message-ID: <74B05320-1F9B-4B4F-BA22-8162F2D80ABE@ifi.uio.no> FINAL CALL FOR PAPERS - SEFM 2011 The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM) 14-18 November 2011 Montevideo, Uruguay URL: http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES * Title and abstract submission deadline: 23 April 2011 * Paper submission deadline: 30 April 2011 * Acceptance/rejection notification: 15 June 2011 * Camera-ready version due: 15 July 2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. Papers that combine formal methods and software engineering are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic. These can either be normal or short papers. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Holger Hermanns, Saarland University, Germany * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Daniel Le M?tayer - INRIA, France SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development". A separate Call for Papers is available for the special track. All queries on submissions to the special track should be sent to: sefm2011-msd at iist.unu.edu. The special track will have as keynote speaker: * Matteo Pedercini, Millennium Institute, USA LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (R?o de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. All papers must be written in English. Research and tool papers must not exceed 16 pages in the LNCS format while short papers must not exceed 8 pages in the LNCS format (seehttp://www.springer.de/comp/lncs/authors.html for details). All queries on the submissions should be sent to: sefm2011 at fing.edu.uy. Papers must be submitted electronically via the Easychair System: http://www.easychair.org/conferences/?conf=sefm11 The proceedings will be published in the Springer Lecture Notes in Computer Science series (LNCS, http://www.springer.com/lncs). After the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a special issue of the SoSyM journal (Software and Systems Modeling, Springer), following the standard reviewing process of the journal. COMMITTEES Conference Chair * Alberto Pardo, Universidad de la Rep?blica, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering, Graz University of Technology, Austria * Luis Barbosa, University of Minho, Portugal * Gilles Barthe, IMDEA Software, Spain * Thomas Anung Basuki, Parahyangan Catholic University, Indonesia * Alexandre Bergel, University of Chile, Chile * Gustavo Betarte, Universidad de la Rep?blica, Uruguay * Ana Cavalcanti, University of York, UK * Pedro R. D'Argenio, Univ. Nacional de C?rdoba, Argentina * Van Hung Dang, Vietnam National University, Vietnam * George Eleftherakis, SEERC, Greece * Jos? Luiz Fiadeiro, University of Leicester, UK * Martin Fr?nzle, Oldenburg University, Germany * Stefania Gnesi, ISTI-CNR, Italy * Rob Hierons, Brunel University, UK * Paola Inverardi, University of L'Aquila, UK * Jean-Marie Jacquet, University of Namur, Belgium * Tomasz Janowski, UNU-IIST, China * Jean-Marc Jezequel, IRISA, France * Joseph Kiniry, IT University of Copenhagen, Denmark * Paddy Krishnan, Bond University, Australia * Martin Leucker, TU Munich, Germany * Xuandong Li, Nanjing University, China * Peter Lindsay, The University of Queensland, Australia * Ant?nia Lopes, University of Lisbon, Portugal * Nenad Medvidovic, University of Southern California, USA * Mercedes Merayo, Universidad Complutense de Madrid, Spain * Stephan Merz, INRIA Nancy, France * Madhavan Mukund, Chennai Mathematical Institute, India * Cesar Mu?oz, NASA, USA * Mart?n Musicante, UFRN, Brazil * Mizuhito Ogawa, JAIST, Japan * Olaf Owe, University of Oslo, Norway * Gordon Pace, University of Malta, Malta * Ernesto Pimentel, University of M?laga, Spain * Sanjiva Prasad, Indian Institute of Technology Delhi, India * Anders Ravn, Aalborg University, Denmark * Leila Ribeiro, UFRGS, Brazil * Augusto Sampaio, UFPE, Brazil * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden * Sebasti?n Uchitel, Imperial College London, UK, and UBA, Argentina * Willem Visser, University of Stellenbosch, South Africa * Sergio Yovine, VERIMAG, France, and UBA, Argentina Organising Committee * Carlos Luna, Universidad de la Rep?blica, Uruguay * Alberto Pardo, Universidad de la Rep?blica, Uruguay * Luis Sierra, Universidad de la Rep?blica, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR, China * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Mathai Joseph, TRDDC, Pune, India * Zhiming Liu, UNU-IIST, Macao SAR, China * Andrea Maggiolo-Schettini, Pisa University, Italy --- Gerardo Schneider Department 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 jv at cs.purdue.edu Thu Apr 7 16:31:55 2011 From: jv at cs.purdue.edu (Jan Vitek) Date: Thu, 7 Apr 2011 16:31:55 -0400 Subject: [TYPES/announce] Dahl-Nygaard Awards Message-ID: <3A9E5762-65AF-4A6F-B27D-048C52DB56C7@cs.purdue.edu> DAHL-NYGAARD 2001 AWARDS ANNOUNCEMENT AITO is proud to announce the Dahl-Nygaard Prizes for 2011. The Senior Prize will be given to Craig Chambers, Google, for the design of the Cecil object-oriented programming language and his work on compiler techniques used to implement object- oriented languages efficiently on modern architectures. The Junior Prize will be given to Atsushi Igarashi, Graduate School of Informatics, Kyoto University, for his investigations into the foundation of object-oriented programming languages and their type systems. Website: http://www.aito.org/Dahl-Nygaard/2011.html The prizes will be presented in July at ECOOP, in Lancaster, UK. http://ecoop11.comp.lancs.ac.uk From antonio at iist.unu.edu Fri Apr 8 00:13:10 2011 From: antonio at iist.unu.edu (Antonio Cerone) Date: Fri, 8 Apr 2011 12:13:10 +0800 (CST) Subject: [TYPES/announce] Final CfP and Extended Deadline: ICTAC 2011 - Theoretical Aspects of Computing Message-ID: Final Call for Papers ICTAC 2011 International Colloquium on Theoretical Aspects of Computing URL: http://www.ictac.net/ictac2011/ 31 August - 2 September 2011, Johannesburg, South Africa ------------------------------------------------- The Colloquium will be held at the Mabalingwe Nature Reserve (http://www.mabalingwe.co.za/), two hours travel by car from the centre of Johannesburg (transfer provided), in a malaria-free area in the Waterberg mountains. All of the big five can be viewed at the reserve and a safari tour will form part of the social programme for delegates. ------------------------------------------------- EXTENDED DEADLINES Regular and Short Paper abstract submission deadline: 17 April 2011 Regular and Short Paper submission deadline: 17 April 2011 ------------------------------------------------- BACKGROUND ICTAC 2011 is the 8th 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 2011 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; * software specification, refinement, verification and testing; * model checking and theorem proving; * formal techniques in software testing; * models of object and component systems; * coordination and feature interaction; * integration of theories, formal methods and tools for engineering computing systems; * service-oriented development; * service-oriented architectures: models and development methods; * document-driven development; * models of concurrency, security, and mobility; * theory of parallel, distributed, and grid computing; * real-time, embedded and hybrid systems; * type and category theory in computer science; * models for learning and education; * cognitive architectures; * qualitative reasoning; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. KEYNOTE SPEAKERS * Jayadev Misra (FME Invited Speaker) * David Parnas * Willem Visser VENUE, TRANSPORTATION AND ACCOMMODATION The ICTAC 2011 Colloquium will be held at the Mabalingwe Nature Reserve (http://www.mabalingwe.co.za/), away from the bustle and noise of a large city. The reserve is two hours travel by car from the centre of Johannesburg, in the Waterberg mountains, situated on 12000 hectares of malaria-free bushveld. All of the big five can be viewed at the reserve and a game drive will form part of the social programme for delegates. Transfers will be provided for delegates from the ICTAC tutorials to the reserve, and back again to Johannesburg after the event. The reserve is also easily accessible by self-drive with normal motor cars. Delegates can additionally arrange to stay on after the colloquium to relax and enjoy the quiet of the region, or take part in the numerous adventure activities - such as horse riding, abseiling, and archery. Accommodation at the reserve is recommended to simplify access during the event as other lodges are not easy to reach without a hired vehicle. Travel to Johannesburg is easy from all parts of the world with many major carriers having multiple departures each day and the availability of a modern rail link from O. R. Tambo International Airport to hotels in and around Johannesburg. PUBLICATION AND SUBMISSION The proceedings of ICTAC 2011 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 2011 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=ictac2011. All queries should be sent to: ictac2011 at iist.unu.edu From rybal at in.tum.de Fri Apr 8 03:15:28 2011 From: rybal at in.tum.de (Andrey Rybalchenko) Date: Fri, 8 Apr 2011 09:15:28 +0200 Subject: [TYPES/announce] Call for Participation: 2FC'11 Message-ID: <82B8F553-784B-49CB-A963-C19D17F7C23A@in.tum.de> CALL FOR PARTICIPATION CALL FOR STUDENT PAPERS 2FC'11 Two Faces of Complexity http://cl-informatik.uibk.ac.at/events/2fc11/ May 29, 2011, part of RDP'11, Novi Sad, Serbia In recent years there have been several approaches to the automated analysis of the complexity of programs. Mostly these approaches have been developed independently and use a variety of different techniques. This workshop aims to bring together the leading researchers working in this area. In particular we are interested in a transfer of knowledge between researchers working on model-checking and on rewriting. While these communities essentially solve the same problems the techniques (and sometimes even the terminology) used is quite different. In order to provide the best possible interaction between the different concerned communities, the workshop is centred around invited presentations: two tutorial and 6 technical invited talks. In addition to these, we will invite contributed papers by early researches. We are happy to announce that the following colleagues agreed to give invited presentations at this workshop: *) Amir Ben-Amram, Academic College of Tel-Aviv-Yaffo, Israel *) Samir Genaim, Complutense University of Madrid, Spain *) Juergen Giesl, RWTH Aachen, Germany *) Nao Hirokawa, JAIST, Japan *) Martin Hofmann, LMU Munich, Germany *) Daniel Kroening, Oxford University *) Jean-Yves Marion, Loria-INPL, France *) Andreas Podelski, University of Freiburg, Germany In addition to invited presentations we want to give early researchers (aka PhD students) the opportunity to contribute papers to this workshop. Thus we invite submissions in the form of extended abstracts on the topics of the workshop. Mandatory requirement for acceptance of these short papers is originality, that is, only papers presenting new ideas (not published or presented elsewhere) will be accepted. Furthermore we will only accept papers exclusively written by students. Submissions should be no more than 6 pages and uploaded to https://www.easychair.org/account/signin.cgi?conf=2fc11. The workshop will take place on Sunday, May 29, 2011 in Novi Sad, Serbia as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2011). Important dates: *) Early registration deadline: April 10 *) Please register for the workshop via the RDP site. *) Submission of student papers: April 30 *) Notification of acceptance: May 9 *) Registration deadline: May 10 For further information see the links on the workshop web site, http://www.rdp2011.uns.ac.rs/workshops/2fc.html, or directly at http://cl-informatik.uibk.ac.at/events/2fc11/. Georg Moser and Andrey Rybalchenko From emilie.balland at inria.fr Fri Apr 8 06:47:13 2011 From: emilie.balland at inria.fr (Emilie Balland) Date: Fri, 8 Apr 2011 12:47:13 +0200 (CEST) Subject: [TYPES/announce] DSL 2011 - Last CFP In-Reply-To: <1382029471.1202169.1302259549754.JavaMail.root@zmbs1.inria.fr> Message-ID: <1543805158.1202184.1302259633106.JavaMail.root@zmbs1.inria.fr> =========================== Call for Papers ============================ DSL 2011: Conference on Domain-Specific Languages (IFIP sponsorship pending approval) 6-8 September 2011, Bordeaux, France http://dsl2011.bordeaux.inria.fr/ IMPORTANT DATES * 2011-04-18 : Abstracts due * 2011-04-25 : Submissions due * 2011-06-10 : Authors notified of decisions * 2011-07-11 : Final manuscripts due * 2011-09-05 : Distilled tutorials * 2011-09-06 / 2011-09-08 : Main conference CALL FOR PAPERS Domain-specific languages have long been a popular way to shorten the distance from ideas to products in software engineering. On one hand, the interface of a DSL lets domain experts express high-level concepts succinctly in familiar notation, such as grammars for text or scripts for animation, and often provides guarantees and tools that take advantage of the specifics of the domain to help write and maintain these particular programs. On the other hand, the implementation of a DSL can automate many tasks traditionally performed by a few experts to turn a specification into an executable, thus making this expertise available widely. Overall, a DSL thus mediates a collaboration between its users and implementers that results in software that is more usable, more portable, more reliable, and more understandable. These benefits of DSLs have been delivered in domains old and new, such as signal processing, data mining, and Web scripting. Widely known examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL, Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM, Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes, the adoption of DSLs have been stunted by the lack of general tools and principles for developing, compiling, and verifying domain-specific programs. General support for building and using DSLs is thus urgently needed. Languages that straddle the line between the domain-specific and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest that such support be based on modern notions of language design and software engineering. The goal of this conference, following the last one in 2009, is to explore how present and future DSLs can fruitfully draw from and potentially enrich these notions. We seek research papers on the theory and practice of DSLs, including but not limited to the following topics. * Foundations, including semantics, formal methods, type theory, and complexity theory * Language design, including concrete syntax, semantics, and types * Software engineering, including domain analysis, software design, and round-trip engineering * Modularity and composability of DSLs * Software processes, including metrics for software and language evaluation * Implementation, including parsing, compiling, program generation, program analysis, transformation, optimization, and parallelization * Reverse engineering, re-engineering, design discovery, automated refactoring * Hardware/software codesign * Programming environments and tools, including visual languages, debuggers, testing, and verification * Teaching DSLs and the use of DSLs in teaching * Case studies in any domain, especially the general lessons they provide for DSL design and implementation The conference will include a visit to the city of Bordeaux, a tour and tasting at the wine museum and cellar, and a banquet at La Belle ?poque. INSTRUCTIONS FOR AUTHORS Papers will be judged on the depth of their insight and the extent to which they translate specific experience into general lessons for software engineers and DSL designers and implementers. Where appropriate, papers should refer to actual languages, tools, and techniques, provide pointers to full definitions, proofs, and implementations, and include empirical results. Proceedings will be published in Electronic Proceedings in Theoretical Computer Science ( http://info.eptcs.org/) . Submissions and final manuscripts should be at most 25 pages in EPTCS format. PROGRAM COMMITTEE * Emilie Balland (INRIA) * Olaf Chitil (University of Kent) * Zo? Drey (IRIT) * Nate Foster (Cornell University) * Mayer Goldberg (Ben-Gurion University) * Shan Shan Huang (LogicBlox) * Sam Kamin (University of Illinois at Urbana-Champaign) * Jerzy Karczmarczuk (University of Caen) * Jan Midtgaard (Aarhus University) * Keiko Nakata (Tallinn University of Technology) * Klaus Ostermann (University of Marburg) * Jeremy Siek (University of Colorado at Boulder) * Tony Sloane (Macquarie University) * Josef Svenningsson (Chalmers University of Technology) * Paul Tarau (University of North Texas) * Dana N. Xu (INRIA) ORGANIZERS Local chair: Emilie Balland (INRIA) Program chairs: Olivier Danvy (Aarhus University), Chung-chieh Shan (Rutgers University) ------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From bywang at iis.sinica.edu.tw Fri Apr 8 07:14:12 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Fri, 08 Apr 2011 19:14:12 +0800 Subject: [TYPES/announce] CPP 2011 2nd CFP Message-ID: <20110408191412.156575k13ccdvymc@webmail.iis.sinica.edu.tw> The First International Conference on Certified Programs and Proofs (CPP 2011) PRELIMINARY CALL FOR PAPERS Kenting, Taiwan December 7--9, 2011 http://formes.asia/cpp (co-located with APLAS 2011) 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. 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; and teaching mathematics and computer science with proof assistants. 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: Monday, June 13, 2011 Paper Submission Deadline: Friday, June 17, 2011 Author Notification: Monday, August 29, 2011 Camera Ready: Monday, September 19, 2011 Conference: December 7-9, 2011 SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2011 Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submissions should not exceed 16 pages in LNCS format, including bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. The proceedings of the symposium will be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Submission instructions including Latex style files are available from the CPP 2011 website. Each submission must be written in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference, all phrased for the non-specialist. Technical and formal developments directed to the specialist should follow. Whenever appropriate, the submission should come along with a formal development, using whatever prover, e.g., Agda, Coq, Elf, HOL, HOL-Light, Isabelle, Matita, Mizar, NQTHM, PVS, Vampire, etc. References and comparisons with related work should be included. Papers not conforming to the above requirements concerning format and length may be rejected without further consideration. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other published conferences or workshops. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. Original formal proofs of known results in mathematics or computer science are among the targets. One author of each accepted paper is expected to present it at the conference. AWARD FOR BEST PAPER: An award will be given for the best accepted paper, as judged by the program committee. Details concerning eligibility criteria and procedure for consideration for this award will be posted at the CPP website. The committee may decline to make the award or split it among several papers. PROGRAM CO-CHAIRS: Jean-Pierre Jouannaud (INRIA and Tsinghua University) Zhong Shao (Yale University) Email: cpp2011pc at gmail.com GENERAL CHAIR: Yih-Kuen Tsay (National Taiwan University) PROGRAM COMMITTEE: Andrea Asperti (University of Bologna) Gilles Barthe (IMDEA Software Institute) Xiao-Shan Gao (Chinese Academy of Sciences) Georges Gonthier (Microsoft Research Cambridge) Chris Hawblitzel (Microsoft Research Redmond) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (INRIA and Tsinghua University) Akash Lal (Microsoft Research India) Xavier Leroy (INRIA Paris-Rocquencourt) Yasuhiko Minamide (University of Tsukuba) Shin-Cheng Mu (Academia Sinica) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Sandip Ray (University of Texas at Austin) Natarajan Shankar (SRI International) Zhong Shao (Yale University) Christian Urban (TU Munich) Viktor Vafeiadis (Max Planck Institute for Software Systems) Stephanie Weirich (University of Pennsylvania) Kwangkeun Yi (Seoul National University) PUBLICITY CHAIR: Bow-Yaw Wang (Academia Sinica, INRIA and Tsinhua University) ORGANIZING COMMITTEE: Tyng-Ruey Chuang (chair), Shin-Cheng Mu, Yih-Kuen Tsay (Academia Sinica and National Taiwan University) Email: cpp2011oc at gmail.com ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From gopalan at cs.umn.edu Fri Apr 8 17:40:42 2011 From: gopalan at cs.umn.edu (Gopalan Nadathur) Date: Fri, 08 Apr 2011 16:40:42 -0500 Subject: [TYPES/announce] LFMTP 2011 , Call for Papers Message-ID: <4D9F80DA.2060206@cs.umn.edu> Sixth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'11) http://lfmtp11.cs.umn.edu Nijmegen, The Netherlands, August 27, 2011 Affiliated with Interactive Theorem Proving (ITP 2011) CALL FOR PAPERS ------------------------------------------------------------- IMPORTANT DATES Abstract submission: May 16, 2011 Paper submission: May 23, 2011 Author notification: June 22, 2011 Final versions due: August 1, 2011 Workshop day: August 27, 2011 ------------------------------------------------------------- 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'11 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. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * applications and comparative studies * implementation techniques * efficient proof representation and validation * proof-generating decision procedures and theorem provers * proof-carrying code * substructural frameworks * semantic foundations * methods for reasoning about logics * formal digital libraries Program Committee: Claudio Sacerdoti Coen (University of Bologna) Herman Geuvers (Radboud University Nijmegen) James McKinna (Radboud University Nijmegen) Gopalan Nadathur (University of Minnesota) Frank Pfenning (Carnegie Mellon University) Alwen Tiu (Australian National University) Christian Urban (TU Munich) Submission of papers is electronic and must be completed through the EasyChair server that can be accessed through the workshop web site. The actual paper submission must be preceded by the submission of a title and a short abstract---see the important dates indicated alongside. Submissions to the workshop can take several forms, such as system descriptions, short accounts of work in progress, and detailed, technical presentations of new results. Different categories of submissions will be judged differently, the main common criteria being the content of the ideas and their ability to stimulate discussions at the workshop. Submissions must be in PDF format prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org) and must not exceed 15 pages including references. Accepted papers are expected to be presented at the workshop by their authors. Revised versions of these papers will be included in the proceedings that will be published as an Electronic Proceedings in Theoretical Computer Science (EPTCS) via http://eptcs.org. Workshop organizers: Herman Geuvers Gopalan Nadathur Intelligent Systems, iCIS Computer Science and Engineering Faculty of Science University of Minnesota Radboud University Nijmegen, NL Minneapolis, MN 55455, USA Email: herman at cs.ru.nl Email: gopalan at cs.umn.edu From cbraga at ic.uff.br Sat Apr 9 13:24:39 2011 From: cbraga at ic.uff.br (Christiano Braga) Date: Sat, 9 Apr 2011 14:24:39 -0300 Subject: [TYPES/announce] SBLP 2011 - Final call for papers Message-ID: [Apologies for multiple copies of this call.] SBLP 2011: Call For Papers *** Easychair is now open for submissions! *** 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 26-30, 2011 http://www.each.usp.br/cbsoft2011/ IMPORTANT DATES Paper abstract submission (15 lines): April 22nd, 2011 Full paper submission: April 29th, 2011 Notification of acceptance: May 30th, 2011 Final papers due: July 1st, 2011 INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester Talk title: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida Talk title: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" INTRODUCTION The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2011 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical approaches. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Submissions should be done using SBLP 2011 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2011. Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. All papers should be prepared using the Springer Lecture Notes in Computer Science (LNCS) template. (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) We encourage the submission of short papers reporting on master dissertations or doctoral theses at early stages of their development. All accepted papers, with at least one author registered in the conference, will be published in the conference proceedings. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP 2009 and 2010, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. ORGANIZATION CHAIRS - For CBSoft * Marcelo Fantinato, EACH - USP * Luciano Silva, FCI - Mackenzie - For SBLP * Denise Stringhini FCI, Mackenzie * Alfredo Goldman IME, USP PROGRAMME COMMITTEE CHAIRS * Christiano Braga, UFF * Jose Luiz Fiadeiro, Univ. of Leicester PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Alvaro Moreira, UFRGS * Andre Du Bois, UFPel * Alex Garcia, IME * Andre Santos, UFPE * Artur Boronat, Univ. of Leicester * Carlos Camarao, UFMG * Christiano Braga, UFF (co-chair) * Fernando Castor Filho, UFPE * Fernando Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC * Jens Palsberg, UCLA * Joao Saraiva, Universidade do Minho * Johan Jeuring, Utrecht Univ. * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester (co-chair) * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho * Marcelo A. Maia, UFU * Marcelo d'Amorim, UFPE * Marco Tulio Valente, UFMG * Mariza A. S. Bigonha, UFMG * Martin A. Musicante, UFRN * Noemi Rodriguez, PUC-Rio * Paulo Borba, UFPE * Peter Mosses, Swansea University * Renato Cerqueira, PUC-Rio * Ricardo Massa, UFPE * Roberto S. Bigonha, UFMG * Roberto Ierusalimschy, PUC-Rio * Sandro Rigo, UNICAMP * Sergio Soares, UFPE * Sergiu Dascalu, Univ. of Nevada * Simon Thompson, Univ. of Kent * Varmo Vene, Univ. de Tartu From w.swierstra at cs.ru.nl Mon Apr 11 03:42:12 2011 From: w.swierstra at cs.ru.nl (Wouter Swierstra) Date: Mon, 11 Apr 2011 09:42:12 +0200 Subject: [TYPES/announce] Call for papers DTP'11 Message-ID: Dependently Typed Programming 2011 Call for Papers 27 of August 2011 Nijmegen, The Netherland In association with ITP 2011 Deadline for submission: 10 June 2011 http://www.cs.ru.nl/dtp11 Dependently typed programming is here today: where will it go tomorrow? On the one hand, dependent type theories have grown programming languages; on the other hand, the type systems of programming languages like Haskell (and even C#) are incorporating some kinds of type-level data. When types involve data, they can capture relationships between data, internalising invariants necessary for appropriate computation. When data describe types, we can express patterns of programming in code. We're beginning to see how to take advantage of the power and precision which dependent types afford, but there are still plenty of problems to address and issues to resolve. The design space is large: this workshop is a forum for researchers who are exploring it. We hope that the workshop will attract people who work on the design and implementation of dependently typed programming languages and development environments, or who are using existing systems to develop dependently typed programs and libraries. * Submissions * If you want to give a talk or a demo at the workshop, please send us a title and an abstract before 10 June 2011 to w.swierstra{at}cs.ru.nl. Slots will be of 30 minutes (unless you ask for less). We will try to fit as many talks as possible. We aim to publish post-proceedings containing refereed papers related to the topic of the workshop in a suitable journal. More information about this will come after the workshop. * Important Dates * 10 June 2011: Submission deadline 25 June 2011: Notification of acceptance 27 August 2911: DTP workshop * Program Committee * Ana Bove, Chalmers, Sweden Matthieu Sozeau, INRIA, France Wouter Swierstra, Radboud University, The Netherlands From Alex.Simpson at ed.ac.uk Mon Apr 11 04:34:52 2011 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Mon, 11 Apr 2011 09:34:52 +0100 Subject: [TYPES/announce] 4th Scottish Category Theory Seminar Message-ID: <20110411093452.191744iq7bc3aofg@www.staffmail.ed.ac.uk> Contributed talks on category theory and type theory would be welcome at the meeting below --- *** THE 4TH SCOTTISH CATEGORY THEORY SEMINAR *** *** School of Mathematics and Statistics, University of Glasgow *** *** Friday 13 May 2011, 2.00-5.30pm *** The Scottish Category Theory Seminar brings together the diverse groups of people interested in the many aspects of category theory. For our fourth meeting we give you: INVITED SPEAKERS Eugenia Cheng (Sheffield) - "Distributive laws for Lawvere theories" Bruno Vallette (Nice/Max Planck) - To be announced. CONTRIBUTED TALKS Submissions are invited for two 25-minute contributed talks. If you would like to give one, please send us a title and abstract soon. If you intend to come, it would be helpful (but is not essential) to send us a short email saying so. Information: http://www.maths.gla.ac.uk/~tl/sct110513.html Contact: scotcats at cis.strath.ac.uk We are generously supported by the Glasgow Mathematical Journal Trust. Tom Leinster (for the organizers: Neil Ghani, TL, Alex Simpson) -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From rensink at cs.utwente.nl Mon Apr 11 07:12:37 2011 From: rensink at cs.utwente.nl (Arend Rensink) Date: Mon, 11 Apr 2011 13:12:37 +0200 Subject: [TYPES/announce] Winner EAPLS Best Phd Dissertation Award 2010 Message-ID: <4DA2E225.4030509@cs.utwente.nl> It is the great pleasure of the European Association for Programming Languages and Systems to announce the outcome of the EAPLS Best Dissertation Award 2010 (http://eapls.org/items/330/). 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 up to November 2010 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 first edition of the EAPLS Dissertation Award is Dr. Alexey Gotsman Computer Laboratory, University of Cambridge for his dissertation on Logics and analyses for concurrent heap-manipulating programs 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. Gotsman's dissertation is an outstanding piece of work; it received the best marks amidst some very strong contenders. A summary of the jury's findings: + Program logic and analysis are two related fields, but here they are unified at a very deep level, and the author presents important results in both fields. The subject is very difficult and very relevant, and the author masters it all. + The breadth and depth of the dissertation are excellent; it provides the reader with a competent and intriguing overview of this interesting field of research. + The quality of the publication venues (PoPL, SAS, PLDI) and the impact of the work, measured by the number of citations, are impressive. + The dissertation is very well written. We offer Dr. Gotsman our heartfelt congratulations with his achievement. We are confident that it will be a sign of a long and distinguished scientific career. European Association for Programming Languages and Systems http://eapls.org From sescobar at dsic.upv.es Mon Apr 11 12:14:32 2011 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Mon, 11 Apr 2011 11:14:32 -0500 Subject: [TYPES/announce] 2nd CfP: Special journal issue on Functional and (Constraint) Logic Programming References: <5DA1B5C0-621D-4477-85CB-C10E05F1A4DB@dsic.upv.es> Message-ID: Special issue of Information and Computation on Functional and (Constraint) Logic Programming Scope Functional and (Constraint) Logic Programming aims at bringing together researchers interested in functional programming, (constraint) logic programming, as well as the integration of the two paradigms. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications and combinations of high-level, declarative programming languages and related areas. This special issue is devoted to contributions which aim at realizing integrations of the two classical declarative paradigms: functional programming and (constraint) logic programming. Contributions on functional programming or (constraint) logic programming are also welcome but they should discuss and effectively justify their usefulness to the integration of both paradigms. Submissions Submitted papers must be original and not submitted for journal publication elsewhere, and will be subject to the standard journal refereeing process of the Information and Computation journal. Submissions must be sent in pdf format to sescobar at dsic.upv.es no later than May 6th, 2011 You should use the Elsevier's latex macro package, available at http://www.elsevier.com/wps/find/authorsview.authors/elsarticle The cover page of the submission should include the paper title, the author names, the coordinates of the corresponding author, and an abstract. Guest Editors Moreno Falaschi Dipartimento di Scienze Matematiche e Informatiche Facolt? di Scienze MM.FF.NN. Universit? di Siena Italy. Santiago Escobar Departamento de Sistemas Inform?ticos y Computaci?n Universidad Polit?cnica de Valencia Camino de Vera, 14 Apdo. 22.012 E-46022 Valencia (Spain) From leucker at in.tum.de Mon Apr 11 19:53:46 2011 From: leucker at in.tum.de (Martin Leucker) Date: Tue, 12 Apr 2011 01:53:46 +0200 Subject: [TYPES/announce] TIME'11: CFP Message-ID: <20110411235346.GA26876@sunsvr01.isp.uni-luebeck.de> TIME 2011 Call for Papers Eighteenth International Symposium on Temporal Representation and Reasoning Luebeck, Germany, September 12-14, 2011 http://www.isp.uni-luebeck.de/time11/ 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. This year, TIME will feature a special track on interval temporal logics. The conference will span three days, and will be organized as a combination of technical paper presentations, keynote lectures, and tutorials. * IMPORTANT DATES Paper Submission: April 17 Paper Notification: May 15 Camera Ready Copy Due: May 29 TIME 2011 Symposium: September 12-14 * INVITED SPEAKERS - Nir Piterman - Gerhard Schellhorn - Jef Wijsen * 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 Interval Temporal logics 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 - tools and practical systems - temporal issues in security Special track on Interval Temporal logic This year, TIME has an additional special track on Interval Temporal Logics. This track is organized by Dimitar Guelev and Ben Moszkowski. Submissions on ITL will be primarily managed by them, though the final decision on acceptance will be taken by the whole PC. Topics of interest include, but are not limited to: - expressiveness, decidability, proof systems, model- and validity-checking for ITLs - modelling of system requirements in terms of time intervals - intervals versus time points in temporal modelling - Duration Calculus and other extensions and variants of ITLs - ITLs, DC, timed automata, timed regular languages and other models of real time - interval algebras and spatio-temporal reasoning - case studies, applications and tool support for interval-based reasoning * 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 will be published by the IEEE Computer Society Press. 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=time11 * CONFERENCE OFFICERS General Chair: Carlo Combi, University of Verona, Italy Program Committee Chairs: Martin Leucker, University of Luebeck, Germany Frank Wolter, University of Liverpool, United Kingdom Organization Chair: Martin Leucker, Universitaet Luebeck, Germany * PROGRAM COMMITTEE includes Alessandro Artale, University of Bolzano, Italy Philippe Balbiani, IRIT Toulouse, France Claudio Bettini, University of Milan, Italy Benedikt Bollig, CNRS, France Lubos Brim, University of Brno, Czech Republic Antonio Cau, De Montfort University, UK Dang Van Hung, Vietnam National University, Vietnam Clare Dixon, University of Liverpool, UK Rajeev Gore, ANU, Australia Dimitar Guelev, Bulgarian Academy of Sciences, Bulgaria Peter Habermehl, University Paris Diderot, France Ian Hodkinson, Imperial College London, UK Roman Kontchakov, Birkeck College London, UK Salvatore La Torre, University of Salerno, Italy Ranko Lazic, University of Warwick, UK Kamal Lodaya, IMSc, India Nicolas Markey, CNRS, France Angelo Montanari, University of Udine, Italy Ben Moszkowski, De Montfort University, UK Dirk Nowotka, University of Stuttgart, Germany Paritosh Pandya, Tata IFR, India Jean-Francois Raskin, Free University Brussels, Belgium Peter Revesz, University of Nebraska-Lincoln, USA Mark Reynolds, University of Western Australia, Australia Martin Sachenbacher, Technical University Munich, Germany Cesar Sanchez, University of Madrid, Spain Christian Schallhart, University of Oxford, UK Stefan Woelfl, University of Freiburg, Germany Naijun Zhan, Chinese Academy of Sciences Beijing, China Esteban Zimanyi, ULB, Belgium * FURTHER INFORMATION Questions related to submission, reviewing, and program: time11 at isp.uni-luebeck.de Questions related to local organization: time11-org at isp.uni-luebeck.de From vlad.rusu at inria.fr Tue Apr 12 10:13:06 2011 From: vlad.rusu at inria.fr (Vlad Rusu) Date: Tue, 12 Apr 2011 16:13:06 +0200 (CEST) Subject: [TYPES/announce] extended deadline - April 20 - AMMSE 2001 - Algebraic Methods in Model-Based Software Engineering In-Reply-To: <13292375.52.1297008904451.JavaMail.rusu@initial.local> Message-ID: <15000697.74.1302618235153.JavaMail.rusu@initial.local> (Apologies for multiple copies) CALL FOR PAPERS AMMSE 2011 2nd International Workshop on Algebraic Methods in Model-Based Software Engineering A satellite event of the TOOLS'11 Conference Zurich, Switzerland, June 30th, 2011 AIMS AND SCOPE Over the past years there has been quite a lot of activity in the algebraic community about using algebraic methods for providing support to model-driven software engineering. The aim of this workshop is to gather researchers working on the development and application of algebraic methods to provide rigorous support to model-based software engineering. The topics relevant to the workshop are all those related to the use of algebraic methods to software engineering, including but not limited to: - formally specifying and verifying model-based software engineering concepts and related ones (MDE, UML, OCL, MOF, DSLs, ...) - tool support for the above - integration of formal and informal methods - theoretical frameworks (algebraic, rewriting-based, category theory-based, ...) The main goal is to examine, discuss, and relate the existing projects within the algebraic community that address common open-issues in model-driven software engineering. To foster the discussion among participants, our plan is to organize the workshop in two main sessions, with short individual presentations (20 minutes) followed by ample time slots for comments, questions, and exchange of ideas. IMPORTANT DATES Paper submission deadline (extended) April 20, 2011 Author notification: May 29, 2011 Camera-ready paper versions due: June 12, 2011 Workshop: June 30, 2011 PROGRAM COMMITTEE Artur Boronat, University of Leicester, UK Roberto Bruni, University of Pisa, Italy Jordi Cabot, ?cole des Mines de Nantes, France Manuel Clavel, Imdea Software & Universidad Complutense de Madrid, Spain Francisco Dur?n, University of M?laga, Spain (co-chair) Martin Gogolla, University of Bremen, Germany Alexander Knapp, Augsburg University, Germany Juan de Lara, Universidad Aut?noma de Madrid, Spain Jos? Meseguer, University of Illinois, Urbana-Champaign, USA Pierre-Etienne Moreau, Ecole des Mines de Nancy & INRIA Nancy Grand-Est, France Peter Olveczky, University of Oslo, Norway Vlad Rusu, INRIA Lille Nord-Europe, France (co-chair) Gwen Sala?n, Grenoble INP?INRIA? LIG. France Mart?n Wirsing, Ludwig-Maximilians-Universit?t, M?nchen, Germany VENUE The selected papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS).The organizers of TOOLS'11 are negotiating for an LNCS volume comprising extended versions of the best papers of all the TOOLS'11 satellite events. SUBMISSIONS Please submit your contributions via https://www.easychair.org/conferences/?conf=ammse2011 Submissions should be at most 15 pages long in the EPTCS LaTeX style, available at http://style.eptcs.org/ CONTACT INFORMATION Francisco Duran duran at lcc.uma.es Vlad Rusu vlad.rusu at inria.fr ---- From ricardo at sip.ucm.es Wed Apr 13 03:57:32 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Wed, 13 Apr 2011 09:57:32 +0200 Subject: [TYPES/announce] FOPARA 2011: Last CFP and Call for Participation Message-ID: <4DA5576C.9020503@sip.ucm.es> *************************************************************************** * LAST CALL FOR PAPERS AND CALL FOR PARTICIPATION * * 2nd International Workshop on * Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** REGISTRATION IS OPEN NOW!! Submission date in few days --------------------------- Full Paper submission deadline: April 15, 2011 Notification of acceptance (for presentation): April 20, 2011 Early Registration deadline: April 25, 2011 FOPARA workshop: May 19, 2011 Submission for formal review deadline: July 8, 2011 Notification of acceptance (for LNCS): September 16, 2011 Camera ready paper: October 7th, 2011 Invited Speaker --------------- Reinhard Wilhelm (Universitat des Saarlandes) Timing Analysis and Timing Predictability I will describe our approach to compute safe and precise upper bounds on execution times for real-time programs. The required effort and the precision of the results depends strongly on the characteristics of the execution platform. Increasing the precision and reducing the effort is easy if performance is of no concern. However, the ultimate goal is to design architectures that offer a good combination of performance and predictability. I will present an overview of existing results in this research area. Scope ----- The 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) will be held at the Computer Science Faculty of Complutense University of Madrid. It will be co-located with the 12th International Symposium Trends in Functional Programming, TFP 2011 (http://dalila.sip.ucm.es/tfp11/). The workshop will serve as a forum for presenting original research results that are relevant to the analysis of resource (time, space, and others) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- FOPARA 2011 is a two-phase workshop. All participants are invited to submit a draft paper describing the work to be presented at the workshop. These submissions will be screened by the program committee chair to make sure they are within the scope of FOPARA and will appear in the draft proceedings distributed at the workshop. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the workshop, authors will be given the opportunity to incorporate the feedback from discussions at the workshop and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles that will appear in the formal proceedings. All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Computer Science Department of Complutense University of Madrid. The papers selected after the reviewing process will be published as a volume of the Springer LNCS series. Program Committee ----------------- . Puri Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/?cole normale sup?rieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tam?s Kozsik (E?tv?s Lor?nd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL) Sponsors -------- . Computer Science Faculty, Complutense University of Madrid . Spanish Ministry of Science and Innovation From henk at cs.ru.nl Wed Apr 13 08:21:10 2011 From: henk at cs.ru.nl (henk) Date: Wed, 13 Apr 2011 14:21:10 +0200 Subject: [TYPES/announce] Special Issue LMCS: Types for Proofs and Programs Message-ID: <4DA59536.4020708@cs.ru.nl> [Apologies for multiple messages] Logical Methods in Computer Science Special issue "Types for Proofs and Programs" Call for Submissions (Deadline: May 2, 2011) This special issue is devoted to the recent progress in the technology of formal methods: notably the design and verification of software, hardware, and mathematics based on type theory. It continues the tradition originated by several books published by Springer under the same title since 1993. We encourage all researchers to contribute papers on all aspects of type theory and its applications, especially in the mentioned areas. Those include, but are not limited to the following. * Foundations of type theory and constructive mathematics: - Meta-theoretic studies of type systems. * Applications of type theory: - Type theory and functional programming; - Dependently typed programming; - Industrial designs using type theory. * Proof-assistants and proof technology: - Automation in computer-assisted reasoning; - Formalizing mathematics using type theory. Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. Submissions should follow the instructions available from www.lmcs-online.org/ojs/information.php with the following special author instructions. 1. Register as an author on the the web page lmcs-online.org and use the special code "-t-p-p-2010-". In case you are already registered, go to "profile" and enter the above special code under "register for special issue" 2. Go through the submission routine on the webpage. In Step 0 choose the special issue "Types for Proofs and Programs". The submission deadline is Monday, May 2, 2011. Special Issue Editors: Henk Barendregt, Pawel Urzyczyn From leucker at in.tum.de Thu Apr 14 14:46:30 2011 From: leucker at in.tum.de (Martin Leucker) Date: Thu, 14 Apr 2011 20:46:30 +0200 Subject: [TYPES/announce] CfP: TIME'11 - EXTENDED DEADLINE Message-ID: <20110414184630.GA7241@sunsvr01.isp.uni-luebeck.de> =============================================== Due to numerous requests, the submission deadline has been extended to the 23rd of April 2011 =============================================== TIME 2011 Call for Papers Eighteenth International Symposium on Temporal Representation and Reasoning Luebeck, Germany, September 12-14, 2011 http://www.isp.uni-luebeck.de/time11/ 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. This year, TIME will feature a special track on interval temporal logics. The conference will span three days, and will be organized as a combination of technical paper presentations, keynote lectures, and tutorials. * IMPORTANT DATES Abstract Submission: April 23 (extended) Paper Submission: April 23 (extended) Paper Notification: May 23 TIME 2011 Symposium: September 12-14 * INVITED SPEAKERS - Nir Piterman - Gerhard Schellhorn - Jef Wijsen * 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 Interval Temporal logics 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 - tools and practical systems - temporal issues in security Special track on Interval Temporal logic This year, TIME has an additional special track on Interval Temporal Logics. This track is organized by Dimitar Guelev and Ben Moszkowski. Submissions on ITL will be primarily managed by them, though the final decision on acceptance will be taken by the whole PC. Topics of interest include, but are not limited to: - expressiveness, decidability, proof systems, model- and validity-checking for ITLs - modelling of system requirements in terms of time intervals - intervals versus time points in temporal modelling - Duration Calculus and other extensions and variants of ITLs - ITLs, DC, timed automata, timed regular languages and other models of real time - interval algebras and spatio-temporal reasoning - case studies, applications and tool support for interval-based reasoning * 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 will be published by the IEEE Computer Society Press. 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=time11 * CONFERENCE OFFICERS General Chair: Carlo Combi, University of Verona, Italy Program Committee Chairs: Martin Leucker, University of Luebeck, Germany Frank Wolter, University of Liverpool, United Kingdom Organization Chair: Martin Leucker, Universitaet Luebeck, Germany * PROGRAM COMMITTEE includes Alessandro Artale, University of Bolzano, Italy Philippe Balbiani, IRIT Toulouse, France Claudio Bettini, University of Milan, Italy Benedikt Bollig, CNRS, France Lubos Brim, University of Brno, Czech Republic Antonio Cau, De Montfort University, UK Dang Van Hung, Vietnam National University, Vietnam Clare Dixon, University of Liverpool, UK Rajeev Gore, ANU, Australia Dimitar Guelev, Bulgarian Academy of Sciences, Bulgaria Peter Habermehl, University Paris Diderot, France Ian Hodkinson, Imperial College London, UK Roman Kontchakov, Birkeck College London, UK Salvatore La Torre, University of Salerno, Italy Ranko Lazic, University of Warwick, UK Kamal Lodaya, IMSc, India Nicolas Markey, CNRS, France Angelo Montanari, University of Udine, Italy Ben Moszkowski, De Montfort University, UK Dirk Nowotka, University of Stuttgart, Germany Paritosh Pandya, Tata IFR, India Jean-Francois Raskin, Free University Brussels, Belgium Peter Revesz, University of Nebraska-Lincoln, USA Mark Reynolds, University of Western Australia, Australia Martin Sachenbacher, Technical University Munich, Germany Cesar Sanchez, University of Madrid, Spain Christian Schallhart, University of Oxford, UK Stefan Woelfl, University of Freiburg, Germany Naijun Zhan, Chinese Academy of Sciences Beijing, China Esteban Zimanyi, ULB, Belgium * FURTHER INFORMATION Questions related to submission, reviewing, and program: time11 at isp.uni-luebeck.de Questions related to local organization: time11-org at isp.uni-luebeck.de From isabelle.perseil at telecom-paristech.fr Thu Apr 14 22:20:30 2011 From: isabelle.perseil at telecom-paristech.fr (Isabelle Perseil) Date: Fri, 15 Apr 2011 04:20:30 +0200 Subject: [TYPES/announce] [ ] EXTENDED DEADLINE : UML&FM'2011 Message-ID: <6660f9a85bd6e5352583623d6f6b619e.squirrel@webmail1.telecom-paristech.fr> ********************************************************************** CALL FOR PAPERS : UML&FM?2011 4th INTERNATIONAL WORKSHOP ON UML&FORMAL METHODS http://www.artist-embedded.org/artist/UML-FM-2011.html Workshop held in conjunction with FM 2011 The 17th International Symposium on Formal Methods http://sites.lero.ie/fm2011 june 20th, 2011 Limerick, Ireland ************************************************************************ Extended Submission deadline: April 30th, 2011 ---------------------------------------------- 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, CSP, VDM, Petri Nets, UPPAAL, HOL, Coq, PVS etc. This fourth 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=umlfm2011 Papers should not exceed 8 pages . Submitted manuscripts should be in English and formatted in the style of the ISSE Format. Please, follow the guidelines at the "For authors and editors" heading in the ISSE website All accepted papers will be published in a special issue of ISSE NASA journal (Innovations in Systems and Software Engineering). Slides will be made available through the workshop website. IMPORTANT DATES =============== Submission deadline: April 30th, 2011 All Notification of acceptance: May 20th, 2011 Camera ready copy : June 15th, 2011 Workshop date : June 20th, 2011 Final copy for ISSE proceedings : Sept 01st, 2011 Organizers ========== Organizational sponsors : OMG (http://www.omg.org/) ARTIST (http://www.artist-embedded.org/artist/) Organizers and Programme Steering committee: - Jean-Michel Bruel (Liuppa, France) - Robert de Simone (INRIA, France) - S?bastien G?rard (CEA-LIST, France) - Paul Gibson (Telecom SudParis, France) - Isabelle Perseil (Inserm, France) IEEE CS Coordinator: Mike Hinchey (Lero and NASA GSFC , Ireland) PC Chairs: - Paul Gibson (Telecom SudParis, France) - Isabelle Perseil (Inserm, France) Program Committee: - Lukman Ab Rahim (Lancaster University, United Kingdom) - Nazareno Aguirre (Universidad Nacional de R?o Cuarto, Argentina) - Marc Aiguier (Ecole Centrale Paris, France) - Yamine Ait Ameur (LISI / ENSMA, France) - Pascal Andr? (LINA, University of Nantes, France) - Luciano Baresi (Politecnico di Milano, Italia) - Kamel Barkaoui (CEDRIC-CNAM, France) - Jean-Paul Bodeveix (IRIT, France) - Jean-Michel Bruel (IRIT, France) - Alexandre Cabral Mota (Universidade Federal de Pernambuco, Brazil) - Agusti Canals (CS, France) - David Clark(University College London, United Kingdom) - Vincent Englebert (University of Namur, Belgium) - Huascar Espinoza (Tecnalia, Spain) - Mamoun Filali (IRIT, France) - S?bastien G?rard (CEA-LIST, France) - Frederic Gervais (Universit? Paris-Est, LACL, France) - Paul Gibson (Telecom SudParis, France) - Martin Gogolla (University of Bremen, Germany) - J?r?me Hugues (ISAE, France) - Stephen J.Mellor (Accelerated Technologies, Tucson AZ, USA) - Paul Krause (University of Surrey, United Kingdom) - Kevin Lano (King?s College London, United Kingdom) - Manuel Mazzara (Newcastle University, United Kingdom) - Sun Meng (Peking University, China) - Dominique Mery (LORIA, France) - Elie Najm (Telecom ParisTech, France) - Kazuhiro Ogata (Japan Advanced Institute of Science and Technology, Japan) - Isabelle Perseil (Inserm, France) - Dorina Petriu (Carlton University, USA) - Fiona Polack (University of York, United Kingdom) - 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) - Fran?oise Simonot Lion (LORIA, France) - Volker Stolz (United Nations University, Norway) - Jing Sun (University of Auckland, New Zealand) - Jun Suzuki (University of Massachusetts, Boston, USA) - 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) - Fran?ois Vernadat (CNRS-LAAS, France) - Eugenio Villar (Universidad de Cantabria, Spain) - Tim Weilkiens (OOSE Innovative Informatik, Germany) - Sergio Yovine (Universidad de Buenos Aires, Argentina) From haskellsymp at gmail.com Fri Apr 15 04:30:39 2011 From: haskellsymp at gmail.com (Haskell Symposium) Date: Fri, 15 Apr 2011 10:30:39 +0200 Subject: [TYPES/announce] CFP -- Haskell Symposium 2011 In-Reply-To: References: Message-ID: ? ? ? ? ? ? ? ? ? ? ?"Haskell 2011" ? ? ? ? ? ? ?ACM SIGPLAN Haskell Symposium 2011 ? ? ? ? ? ? ? ? ? ? ? Tokyo, Japan ? ? ? ? ? ? ? ? ? 22nd September, 2011 ? ? ? ? ? ? ? ? ? ? ?CALL FOR PAPERS ? ? ? http://www.haskell.org/haskell-symposium/2011/ The ACM SIGPLAN Haskell Symposium 2011 will be co-located with the 2011 International Conference on Functional Programming (ICFP), in Tokyo, Japan. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: ?* Language Design, with a focus on possible extensions and ? modifications of Haskell as well as critical discussions of the ? status quo; ?* Theory, such as formal treatments of the semantics of the present ? language or future extensions, type systems, and foundations ? for program analysis and transformation; ?* Implementations, including program analysis and transformation, ? static and dynamic compilation for sequential, parallel, and ? distributed architectures, memory management as well as foreign ? function and component interfaces; ?* Tools, in the form of profilers, tracers, debuggers, pre-processors, ? testing tools, and suchlike; ?* Functional Pearls, being elegant, instructive examples of using ? Haskell; ?* Applications, using Haskell for scientific and symbolic computing, ? database, multimedia, telecom and web applications, and so forth; ?* Practice and Experience, general experience with Haskell in education ? and industry. 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. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Submission Details ?* Submission Deadline: Monday, 6th June 2011 ?* Author Notification: Friday, 1st July 2011 ?* Final Papers Due ? : Sunday, 10th July 2011 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links ?* http://www.haskell.org/haskell-symposium, ? the permanent homepage of the Haskell Symposium. ?* http://www.haskell.org/haskell-symposium/2011, ? the 2011 Haskell Symposium web page. ?* http://www.icfpconference.org/icfp2011, ? the ICFP 2011 web page. Programme Committee ?* Koen Claessen, Chalmers University of Technology (chair) ?* Conal Elliott, LambdaPix ?* Andy Gill, University of Kansas ?* Ralf Hinze, Oxford University ?* Graham Hutton, University of Nottingham ?* John Launchbury, Galois, Inc. ?* Sam Lindley, University of Edinburgh ?* Rita Loogen, Philipps-Universit?t Marburg ?* Neil Mitchell, Standard Chartered ?* Matthew Naylor, University of York ?* Bruno Oliveira, Seoul National University ?* Dimitrios Vytiniotis, Microsoft Research ?* Steve Zdancewic, University of Pennsylvania From elaine at mat.ufmg.br Fri Apr 15 17:32:38 2011 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Fri, 15 Apr 2011 21:32:38 +0000 (UTC) Subject: [TYPES/announce] LSFA 2011 - Second call for papers Message-ID: LSFA 2011 - Sixth Workshop on Logical and Semantic Frameworks, with Applications August 27th, 2011, Belo Horizonte, Minas Gerais, Brazil Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and 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 o Proof theory o Type theory o Automated deduction * Semantic frameworks o Specification languages and meta-languages o Formal semantics of languages and systems o Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA 2011 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. Invited Speakers 01 Pete Manolios (Northeastern University) 02 Arnon Avron (Tel-Aviv University) 03 Luiz Carlos Pereira (PUC-Rio) Program Committee Simona Ronchi della Rocca (co-chair, UNITO, Italy) Elaine Gouvea Pimentel (co-chair, UFMG, Brazil) Luis Farinas del Cerro (IRIT, France) Edward Hermann Haeusler (PUC-Rio, Brazil) Mauricio Ayala-Rincon (UnB, Brazil) Mario Benevides (Coppe-UFRJ, Brazil) Eduardo Bonelli (UNQ, Argentina) Marcelo Correa (IM-UFF, Brazil) Clare Dixon (Liverpool, UK) Gilles Dowek (Polytechnique-Paris, France) William Farmer (Mcmaster, Canada) Maribel Fernandez (King's College, UK) Marcelo Finger (IME-USP, Brazil) Alwyn Goodloe (NASA LaRC) Fairouz Kamareddine (Heriot-Watt Univ, UK) Delia Kesner (Paris-Jussieu, France) Luis da Cunha Lamb (UFRGS, Brazil) Joao Marcos (UFRN, Brazil) Flavio L. C. de Moura (UnB, Brazil) Ana Teresa Martins (UFC, Brazil) Martin Musicante (UFRN, Brazil) Claudia Nalon (UnB, Brazil) Vivek Nigam (Ludwig-Maximilians-Universitat Munchen) Luca Paolini (UNITO, Italy) Jonathan Seldin (Univ-Lethbridge , Canada) Luis Menasche Schechter (UFRJ, Brazil) Organizing Committee Mauricio Ayala-Rincon Edward Hermann Hauesler PUC-Rio Elaine Pimentel (Local-chair) Simona Ronchi della Rocca Dates and Submission Paper submission deadline: May 23 Author notification: June 30 Camera ready: July 31st Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA 2011 page at EasyChair until the submission deadline in May 23, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using EPTCS style. 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 (tbc). 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. A special issue of the first edition of the workshop appeared in the Journal of Algorithms, a special issue of the second edition of the workshop appeared in the J.IGPL and a special edition of TCS is being prepared with selected contributions from the third and the forth editions of LSFA. At least one of the authors should register at the conference. The paper presentation should be in English. Venue Belo Horizonte is the capital of the state of Minas Gerais and the third-largest metropolitan area in Brazil. A city surrounded by mountains, quite big, but still with this countryside town air. Contact Information For more information please contact the chairs The web page of the event can be reached at: http://www.mat.ufmg.br/LSFA2011/ 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 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- From Patricia.Johann at cis.strath.ac.uk Sat Apr 16 13:30:54 2011 From: Patricia.Johann at cis.strath.ac.uk (Patricia Johann) Date: Sat, 16 Apr 2011 18:30:54 +0100 (BST) Subject: [TYPES/announce] PhD studentship Message-ID: PhD Position in Category Theory and Functional Programming Department of Computer and Information Sciences University of Strathclyde, Scotland Applications are invited for one PhD position within the Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, Dr. Conor McBride, Dr. Peter Hancock, Dr. Robert Atkey, and five PhD students. The PhD project centers around applications of categorical methods to functional programming languages. The project is under the direction of Patricia Johann. The successful applicant will have either a first-class degree or an MSc in Mathematics or Computing Science or a related subject with a strong Mathematics or Computing Science component. Ideally, they will also have a strong, documented interest in doing research. Strong mathematical background and problem-solving skills are essential; good programming skills are a plus. Prior knowledge of category theory and/or functional programming is an advantage, but is not required. The PhD position is for 3 years; it starts early October of 2011. The position is a fully-funded post for a UK or EU student, and includes both coverage of fees and an EPSRC-level stipend for each of the three years. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is located in the heart of Glasgow, which Lonely Planet Travel Guides hail as "one of Britain's largest, liveliest and most interesting cities" (see http://www.lonelyplanet.com/worldguide/scotland/glasgow/). Southern Scotland provides a particularly stimulating environment for researchers in theoretical computer science, with active groups in this area at Heriot-Watt University, the University of Edinburgh, the University of Glasgow, the University of St. Andrews, and the University of Strathclyde. Requests for further information and other informal enquiries can be sent to: Patricia Johann patricia at cis.strath.ac.uk Those interested in the position are asked to send e-mail to the address given above in the next week, since there is a very short deadline for this position. From koehler at informatik.uni-hamburg.de Sun Apr 17 14:41:40 2011 From: koehler at informatik.uni-hamburg.de (=?iso-8859-1?Q?=22Dr=2E_Michael_K=F6hler-Bussmeier=22?=) Date: Sun, 17 Apr 2011 20:41:40 +0200 Subject: [TYPES/announce] LAM'11: 2nd Call for Paper In-Reply-To: <4D944E98.2070808@cs.unibo.it> References: <48DCACFE.6000908@cs.unibo.it> <4D6D2C63.2030201@cs.unibo.it> <4D944E98.2070808@cs.unibo.it> Message-ID: Apologies for cross-postings. *** 2nd CALL FOR PAPERS *** 4th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM'11), 10 September 2011, Aachen, Germany, organised as satellite workshop at the Twenty-Second International Conference on CONCURRENCY THEORY (CONCUR 2011). Organisers: Berndt M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://web.me.com/farwer/LAM11 *Important Dates * Submission Deadline: June 13, 2011 Notification: July 21, 2011 Final Version: August 17, 2011 Workshop: 10 Sept 2011 * 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. 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 established itself as a serious contender against 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 scientific and technological challenges for the modelling and programming of such large-scale, open and highly-dynamic distributed systems. 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 verification of mobile agent systems. In the past two or three years, some logics have been proposed that would be able to handle certain aspects of these requirements, but 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 the areas outlined above with a focus on logics and other formalisms for the specification 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 - 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 * 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 a discussion session. The latter is 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'11 workshop. Submissions should not exceed 15 pages, preferably using the LaTeX article.sty class. The following formats are accepted: PDF, PS. Please send your submission electronically via EasyChair: http://www.easychair.org/conferences/?conf=lam11 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. -- Vertr.-Prof. PD Dr. Michael K?hler-Bu?meier University of Hamburg, Department for Informatics Group: Theoretical Foundations of Informatics http://www.informatik.uni-hamburg.de/TGI/mitarbeiter/ -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 1725 bytes Desc: not available URL: From ricardo at sip.ucm.es Mon Apr 18 06:11:47 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Mon, 18 Apr 2011 12:11:47 +0200 Subject: [TYPES/announce] FOPARA 2011: Extended submission deadline May 29th Message-ID: <4DAC0E63.8060904@sip.ucm.es> *************************************************************************** * * EXTENDED CALL FOR PAPERS AND CALL FOR PARTICIPATION * * 2nd International Workshop on * Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** SUBMISSION DATE EXTENDED!! REGISTRATION IS OPEN NOW!! Submission date has been extended --------------------------------- Full Paper extended submission deadline: April 29, 2011 Notification of acceptance (for presentation): May 1, 2011 Early Registration deadline for extended deadline papers: May 5, 2011 FOPARA workshop: May 19, 2011 Submission for formal review deadline: July 8, 2011 Notification of acceptance (for LNCS): September 16, 2011 Camera ready paper: October 7th, 2011 Invited Speaker --------------- Reinhard Wilhelm (Universitat des Saarlandes) Timing Analysis and Timing Predictability I will describe our approach to compute safe and precise upper bounds on execution times for real-time programs. The required effort and the precision of the results depends strongly on the characteristics of the execution platform. Increasing the precision and reducing the effort is easy if performance is of no concern. However, the ultimate goal is to design architectures that offer a good combination of performance and predictability. I will present an overview of existing results in this research area. Scope ----- The 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) will be held at the Computer Science Faculty of Complutense University of Madrid. It will be co-located with the 12th International Symposium Trends in Functional Programming, TFP 2011 (http://dalila.sip.ucm.es/tfp11/). The workshop will serve as a forum for presenting original research results that are relevant to the analysis of resource (time, space, and others) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- FOPARA 2011 is a two-phase workshop. All participants are invited to submit a draft paper describing the work to be presented at the workshop. These submissions will be screened by the program committee chair to make sure they are within the scope of FOPARA and will appear in the draft proceedings distributed at the workshop. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the workshop, authors will be given the opportunity to incorporate the feedback from discussions at the workshop and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles that will appear in the formal proceedings. All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Computer Science Department of Complutense University of Madrid. The papers selected after the reviewing process will be published as a volume of the Springer LNCS series. Program Committee ----------------- . Puri Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/?cole normale sup?rieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tam?s Kozsik (E?tv?s Lor?nd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL) Sponsors -------- . Computer Science Faculty, Complutense University of Madrid . Spanish Ministry of Science and Innovation From andrzej.murawski at le.ac.uk Mon Apr 18 11:54:52 2011 From: andrzej.murawski at le.ac.uk (Andrzej Murawski) Date: Mon, 18 Apr 2011 16:54:52 +0100 Subject: [TYPES/announce] PhD opportunities at Leicester Message-ID: ** The closing date for applications is midnight on Sunday 15th May 2011 *** PhD positions available for September/October 2011 start Department of Computer Science University of Leicester Package up to ?13,590 and Home/EU fee waiver (Please note, if you are a non-EU national you will be responsible for any monetary difference between International and Home/EU fees.) Computer Science is offering the opportunity for seven exceptional students to pursue research leading to a PhD. We are inviting applications for four Graduate Teaching Assistant positions, two University-sponsored studentships, and a studentship sponsored by Microsoft Research. Instructions on how to apply and specific information on each of these can be found at http://www.le.ac.uk/joinus (Ref: SEN00181). From taha at rice.edu Tue Apr 19 08:05:10 2011 From: taha at rice.edu (Walid Taha) Date: Tue, 19 Apr 2011 14:05:10 +0200 Subject: [TYPES/announce] Summer School on Mechanized Logic for High Assurance Software In-Reply-To: References: Message-ID: [Only 10 more places are available. ?Deadline is April 29th, 2011.] Summer School on Mechanized Logic for High Assurance Software May 30 - June 1, 2011, Halmstad University, Halmstad, Sweden This three-day school is focused on innovative methods for logic-based software engineering using verification and property-based testing as key tools for building software with mathematically expressed properties. The workshop speakers and topics will be: ??* Rex Page, University of Oklahoma, ?????Teaching using Dracula/ACL2? ??* John Hughes, Chalmers University, ?????Property-based Testing using QuviQ QuickCheck? ??* Veronica Gaspes and Walid Taha, Halmstad Univeristy, ?????Property-based Development in Scala? The workshop activities will include lectures and hands-on tutorial sessions. ?The afternoon of the final day will offer participants the opportunity to develop work on their projects with the help of the speakers and using the tools introduced in the workshop. Registration ends April 29th, and the number of participants is limited. ?The registration fee of 450 SEK covers lunches and coffee breaks. ?Information to help you make arrangements for lodging will be sent to you when you registration has been confirmed. To apply to the summer school, please send an email to Dr. Veronica Gaspes ? with "Application to Logic Summer School" in the title. Walid Taha, Eng., PhD.,? Adjunct Professor of Computer Science, Rice University, Houston, TX 77025. Tel:? +1 (832) 528 5948. ?Fax:? +1 (832) 645 0239 Professor of Computer Science, School of Information Science, Computer and Electrical Engineering, Halmstad University, Halmstad, S-301 18 Sweden, Tel:? +46 35 16 76 19 --- CONFIDENTIALITY NOTICE The information in this email may be confidential and/or privileged. This email is intended to be reviewed by only the individual or organization named above. If you are not the intended recipient or an authorized representative of the intended recipient, you are hereby notified that any review, dissemination or copying of this email and its attachments, if any, or the information contained herein is prohibited. If you have received this email in error, please immediately notify the sender by return email and delete this email from your system. From doaitse at swierstra.net Tue Apr 19 08:16:15 2011 From: doaitse at swierstra.net (S. Doaitse Swierstra) Date: Tue, 19 Apr 2011 14:16:15 +0200 Subject: [TYPES/announce] Summer school on Applied Functional Programming at Utrecht University; deadline for registration May 15 Message-ID: Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous two occasions students were all very happy with the school and we plan to repeat this success this year. The intended audience are prospective master students who have been in contact with Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In the previous two years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/bin/view/USCS2011/WebHome -- the poster you can print and hang somewhere (why not your office door): http://www.cs.uu.nl/wiki/pub/USCS2011/WebHome/USCSpos11.pdf -- the official summerschool site where you can register: http://www.utrechtsummerschool.nl/index.php?type=courses&code=H9 Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra PS: apologies if you get this mail more than once _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe at haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -------------- next part -------------- An HTML attachment was scrubbed... URL: From manuel.mazzara at newcastle.ac.uk Tue Apr 19 11:16:09 2011 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Tue, 19 Apr 2011 16:16:09 +0100 Subject: [TYPES/announce] INTRUSO 2011: Deadline Extended to May 11 Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA305F3558093C@EXSAN01.campus.ncl.ac.uk> INTRUSO 2011 1st INternational Workshop on TRUstworthy Service-Oriented Computing Affiliated with 5th IFIP International Conference on Trust Management (IFIPTM'11) Copenhagen, June 27, 2011, Technical University of Denmark http://www.ifiptm.org/IFIPTM11/INTRUSO11 Service-Oriented Computing (SOC) is an emerging paradigm for distributed computing aiming at changing the way software applications are designed, delivered and consumed. SOC is triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services (such as Web services) interact publishing their interfaces inside dedicated repositories, where they can be searched by other services or software agents, retrieved and invoked, always abstracting from the actual implementation. The proliferation of such services is considered the second wave of evolution in the Internet age. In order to realize this vision and to bring SOC to its full potential, several security challenges must still be addressed. In particular, consensus is growing that this "service revolution" will not eventuate until we resolve trustworthiness?related issues. For instance, lack of consumer trust and Web service trustworthiness still represent two critical impediments to the success of Web service-oriented systems. Although software trustworthiness is a wide topic, far from being an issue only for SOC, the intrinsic openness of this vision makes it even more crucial. The SOC vision, indeed, faces with a large, open and dynamic service-oriented environment where anyone can publish his own (even malicious) services. In this scenario, a client (human or software agent) faces a dilemma in having to make a choice from a bunch of services offering the same functionalities. Thus, selecting the right service requires addressing at least two key issues: 1. Discovering the service on the basis of its functionality 2. Evaluating the trustworthiness of the service (how well the service will work) Although concrete applications coping with the first issue are far from being widely adopted, the significant effort spent on its investigation in the current literature is recognizable (OWL-S and the SOAP/WSDL/UDDI Web service framework to mention only some contributions). Instead, service trustworthiness is still in its infancy and represents a barrier for widening the application of service-oriented technologies. The open and dynamic nature of the SOC vision raises new challenges to traditional software trustworthiness. Indeed, in a traditional closed software system all of its components and their relationships are pre-decided before the software runs. Therefore, each component can be thoroughly tested as well as its interactions with other components before the system starts to run. This is not possible in the SOC vision due to its openness and dynamicity. For instance, in the Web service dynamic invocation model, it is likely that users may not even know which Web services they will use, much less their trustworthiness. Traditional dependability techniques, such as correctness proof, fault tolerant computing, testing, and evaluation and more in general "rigorous software development" might be used to improve the trustworthiness of Web services. However, again these techniques have to be redesigned to handle the dynamicity and openness of SOC. The 1st INternational Workshop on TRUstworthy Service-Oriented Computing (INTRUSO 2011) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of Trustworthiness and Dependability in service-oriented environments. Since the overall goal of Trustworthy SOC includes the investigation of several cross-disciplinary issues such as a deep understanding of trust vs. trustworthiness in a service domain, trust-based approaches for service rating and selection (reputation systems, recommendation systems, referral networks.), service dependability, service evaluation/monitoring/testing, etc., a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on SOC-specific 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. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for building a variety of trustworthy service-oriented systems. Topics of interests include, but are not limited to: * Trust and trustworthiness in the Web service domain * Trust-based approaches for Web service rating and selection (reputation systems, recommendation systems, referral networks, .) * Trust negotiation for Web services * Service monitoring and testing * Service dependability * Fault-tolerant mechanisms for SOC * Security for SOC * Architectures for trustworthy SOC * Software engineering methodologies for trustworthy SOC (e.g., deployment life cycle for trustworthy services) * Policy assurance for trustworthy SOC * Formal methods and frameworks for trustworthy services * Quality of Service (QoS) for service discovering and trustworthiness * Case studies on trustworthy SOC * Industrial experiences in the adoption of trust-based approaches for SOC * Rigorous Software Development to ensure service trustworthiness Submitted full papers must not exceed 16 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the following link on EasyChair: https://www.easychair.org/account/signin.cgi?conf=intruso2011 Please use the LNCS templates and style files available from: http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0. 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. The collection of the accepted papers of all the IFIPTM workshops will be published in a technical report at Technical University of Denmark (DTU). We have already agreed with the editor of the international Journal of Internet Services and Information Security to have a special issue in November 2011 with extended versions of best papers selected from IFIPTM workshops. Important Dates * May 11, 2011: Submission of papers * May 23, 2011: Notification of acceptance * June 1, 2011: Camera-ready * June 27/28, 2011: INTRUSO and NODES Workshops Chairs * Nicola Dragoni, Denmark Technical University (DTU), Denmark - ndra at imm.dtu.dk * Nickolaos Kavantzas, Oracle, USA - nickolas.kavantzas at oracle.com * Fabio Massacci, University of Trento, Italy - massacci at disi.unitn.it * Manuel Mazzara Newcastle University, UK - manuel.mazzara at newcastle.ac.uk Program Committee * Mohamed Faical Abouzaid, Ecole Polytechnique de Montr?al, Canada * Mario Bravetti, University of Bologna, Italy * Achim D. Brucker, SAP, Germany * Schahram Dustdar, Vienna University of Technology, Austria * Tim Hallwyl, Visma Sirius, Denmark * Koji Hasebe, University of Tsukuba, Japan * Peep K?ngas, University of Tartu, Estonia * Ivan Lanese, University of Bologna/INRIA, Italy * Marcello La Rosa, Queensland University of Technology, Australia * Michele Mazzucco, University of Tartu, Estonia * Hern?n Melgratti, University of Buenos Aires, Argentina * Paolo Missier, Newcastle University, UK * Christian W. Probst, Denmark Technical University (DTU), Denmark * Ayda Saidane, University of Luxembourg, Luxembourg * Mirko Viroli, University of Bologna, Italy * Prakash Yamuna, Oracle, USA From carsten at itu.dk Tue Apr 19 11:44:57 2011 From: carsten at itu.dk (Carsten Schuermann) Date: Tue, 19 Apr 2011 11:44:57 -0400 Subject: [TYPES/announce] Two Postdoc Positions at the IT University of Copenhagen Message-ID: <04304FA5-50FA-4B7E-AE1F-B44023B63FBD@itu.dk> The IT University of Copenhagen invites applications for several Postdoctoral fellow positions on trustworthy electronic election technology. The positions are part of the DemTech project, a larger effort to prove that it is possible to modernize the democratic process without losing the trust of the voters. We plan to use 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, but the position cannot be filled before 1 July, 2011. 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 Post doc in Computer Science to file your application. Best regards, -- Carsten Schuermann and Joseph Kiniry -------------- next part -------------- An HTML attachment was scrubbed... URL: From conor at strictlypositive.org Tue Apr 19 13:17:00 2011 From: conor at strictlypositive.org (Conor McBride) Date: Tue, 19 Apr 2011 18:17:00 +0100 Subject: [TYPES/announce] Another(!) PhD Position at Strathclyde Message-ID: Hot on the heels of Patricia Johann's advertisement, here's another PhD Position in the Mathematically Structured Programming Group, Deparment of Computer and Information Sciences at the University of Strathclyde to be supervised by Dr. Conor McBride and Prof. Neil Ghani on something related to Designing Precision with Dependent Types. We invite applications for one PhD position within the Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, Dr. Conor McBride, Dr. Peter Hancock, Dr. Robert Atkey, and five PhD students. The PhD project involves THEORETICAL and PRACTICAL issues in FUNCTIONAL PROGRAMMING with DEPENDENT TYPES. Dependent type systems allow us to construct precise variations on general-purpose datatypes which address the specific needs of particular programming problems, thus opening a new "precision" axis in the design space of programs and data. We seek equipment to help programmers explore this axis, determining what is needed to shift the level of precision at which existing functions operate and which properties are guaranteed in return. The project thus represents an opportunity to study mathematical abstractions with a concrete engineering motivation. The PhD position is for 3 years, starting in October 2011. The position is a fully-funded post for a UK or EU student, and includes coverage both of fees and an EPSRC-level stipend for each of the three years. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is slap bang in the middle of Glasgow, a thronging metropolis of wit and daring. Scotland is a hive of activity in Computer Science: we have active collaborations with researchers at Edinburgh, Heriot-Watt, Glasgow and St. Andrews. This is the time and the place to make an impact. Requests for further information and other informal enquiries can be sent to: Conor McBride conor at cis.strath.ac.uk Please get in touch as soon as you can. We hope to appoint in early May. From ccshan at cs.rutgers.edu Tue Apr 19 16:20:17 2011 From: ccshan at cs.rutgers.edu (Chung-chieh Shan) Date: Tue, 19 Apr 2011 16:20:17 -0400 Subject: [TYPES/announce] Extended deadline; IFIP sponsorship: IFIP Working Conference on Domain-Specific Languages Message-ID: <20110419202017.GA23440@mantle.bostoncoop.net> IFIP Working Conference on Domain-Specific Languages (DSL) 6-8 September 2011, Bordeaux, France http://dsl2011.bordeaux.inria.fr/ CALL FOR PAPERS (EXTENDED DEADLINE; IFIP SPONSORSHIP) Domain-specific languages have long been a popular way to shorten the distance from ideas to products in software engineering. On one hand, the interface of a DSL lets domain experts express high-level concepts succinctly in familiar notation, such as grammars for text or scripts for animation, and often provides guarantees and tools that take advantage of the specifics of the domain to help write and maintain these particular programs. On the other hand, the implementation of a DSL can automate many tasks traditionally performed by a few experts to turn a specification into an executable, thus making this expertise available widely. Overall, a DSL thus mediates a collaboration between its users and implementers that results in software that is more usable, more portable, more reliable, and more understandable. These benefits of DSLs have been delivered in domains old and new, such as signal processing, data mining, and Web scripting. Widely known examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL, Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM, Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes, the adoption of DSLs have been stunted by the lack of general tools and principles for developing, compiling, and verifying domain-specific programs. General support for building and using DSLs is thus urgently needed. Languages that straddle the line between the domain-specific and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest that such support be based on modern notions of language design and software engineering. The goal of this conference, following the last one in 2009, is to explore how present and future DSLs can fruitfully draw from and potentially enrich these notions. We seek research papers on the theory and practice of DSLs, including but not limited to the following topics. * Foundations, including semantics, formal methods, type theory, and complexity theory * Language design, including concrete syntax, semantics, and types * Software engineering, including domain analysis, software design, and round-trip engineering * Modularity and composability of DSLs * Software processes, including metrics for software and language evaluation * Implementation, including parsing, compiling, program generation, program analysis, transformation, optimization, and parallelization * Reverse engineering, re-engineering, design discovery, automated refactoring * Hardware/software codesign * Programming environments and tools, including visual languages, debuggers, testing, and verification * Teaching DSLs and the use of DSLs in teaching * Case studies in any domain, especially the general lessons they provide for DSL design and implementation The conference will include a visit to the city of Bordeaux, a tour and tasting at the wine museum and cellar, and a banquet at La Belle ?poque. INSTRUCTIONS FOR AUTHORS Papers will be judged on the depth of their insight and the extent to which they translate specific experience into general lessons for software engineers and DSL designers and implementers. Where appropriate, papers should refer to actual languages, tools, and techniques, provide pointers to full definitions, proofs, and implementations, and include empirical results. Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://info.eptcs.org/). Submissions and final manuscripts should be at most 25 pages in EPTCS format. IMPORTANT DATES * 2011-04-25: Abstracts due (extended deadline) * 2011-05-02: Submissions due (extended deadline) * 2011-06-10: Authors notified of decisions * 2011-07-11: Final manuscripts due * 2011-09-05: Distilled tutorials * 2011-09-06/2011-09-08: Main conference PROGRAM COMMITTEE * Emilie Balland (INRIA) * Olaf Chitil (University of Kent) * Zo? Drey (LaBRI) * Nate Foster (Cornell University) * Mayer Goldberg (Ben-Gurion University) * Shan Shan Huang (LogicBlox) * Sam Kamin (University of Illinois at Urbana-Champaign) * Jerzy Karczmarczuk (University of Caen) * Jan Midtgaard (Aarhus University) * Keiko Nakata (Tallinn University of Technology) * Klaus Ostermann (University of Marburg) * Jeremy Siek (University of Colorado at Boulder) * Tony Sloane (Macquarie University) * Josef Svenningsson (Chalmers University of Technology) * Paul Tarau (University of North Texas) * Dana N. Xu (INRIA) ORGANIZERS Local chair: Emilie Balland (INRIA) Program chairs: Olivier Danvy (Aarhus University), Chung-chieh Shan (Rutgers University) From gerardo at ifi.uio.no Wed Apr 20 01:09:05 2011 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Wed, 20 Apr 2011 07:09:05 +0200 Subject: [TYPES/announce] CfP: SEFM'11 - Deadline EXTENDED till May 9 Message-ID: <737299D3-892C-48D9-A76F-AD76C91E9DAF@ifi.uio.no> FINAL CALL FOR PAPERS - SEFM 2011 The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM) 14-18 November 2011 Montevideo, Uruguay URL: http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES * NEW Title and abstract submission deadline: 30 April 2011 * NEW Paper submission deadline: 9 May 2011 * Acceptance/rejection notification: 15 June 2011 * Camera-ready version due: 15 July 2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. Papers that combine formal methods and software engineering are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic. These can either be normal or short papers. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Holger Hermanns, Saarland University, Germany * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Daniel Le M?tayer - INRIA, France SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development". A separate Call for Papers is available for the special track. All queries on submissions to the special track should be sent to: sefm2011-msd at iist.unu.edu. The special track will have as keynote speaker: * Matteo Pedercini, Millennium Institute, USA LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (R?o de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. All papers must be written in English. Research and tool papers must not exceed 16 pages in the LNCS format while short papers must not exceed 8 pages in the LNCS format (seehttp://www.springer.de/comp/lncs/authors.html for details). All queries on the submissions should be sent to: sefm2011 at fing.edu.uy. Papers must be submitted electronically via the Easychair System: http://www.easychair.org/conferences/?conf=sefm11 The proceedings will be published in the Springer Lecture Notes in Computer Science series (LNCS, http://www.springer.com/lncs). After the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a special issue of the SoSyM journal (Software and Systems Modeling, Springer), following the standard reviewing process of the journal. COMMITTEES Conference Chair * Alberto Pardo, Universidad de la Rep?blica, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering, Graz University of Technology, Austria * Luis Barbosa, University of Minho, Portugal * Gilles Barthe, IMDEA Software, Spain * Thomas Anung Basuki, Parahyangan Catholic University, Indonesia * Alexandre Bergel, University of Chile, Chile * Gustavo Betarte, Universidad de la Rep?blica, Uruguay * Ana Cavalcanti, University of York, UK * Pedro R. D'Argenio, Univ. Nacional de C?rdoba, Argentina * Van Hung Dang, Vietnam National University, Vietnam * George Eleftherakis, SEERC, Greece * Jos? Luiz Fiadeiro, University of Leicester, UK * Martin Fr?nzle, Oldenburg University, Germany * Stefania Gnesi, ISTI-CNR, Italy * Rob Hierons, Brunel University, UK * Paola Inverardi, University of L'Aquila, UK * Jean-Marie Jacquet, University of Namur, Belgium * Tomasz Janowski, UNU-IIST, China * Jean-Marc Jezequel, IRISA, France * Joseph Kiniry, IT University of Copenhagen, Denmark * Paddy Krishnan, Bond University, Australia * Martin Leucker, TU Munich, Germany * Xuandong Li, Nanjing University, China * Peter Lindsay, The University of Queensland, Australia * Ant?nia Lopes, University of Lisbon, Portugal * Nenad Medvidovic, University of Southern California, USA * Mercedes Merayo, Universidad Complutense de Madrid, Spain * Stephan Merz, INRIA Nancy, France * Madhavan Mukund, Chennai Mathematical Institute, India * Cesar Mu?oz, NASA, USA * Mart?n Musicante, UFRN, Brazil * Mizuhito Ogawa, JAIST, Japan * Olaf Owe, University of Oslo, Norway * Gordon Pace, University of Malta, Malta * Ernesto Pimentel, University of M?laga, Spain * Sanjiva Prasad, Indian Institute of Technology Delhi, India * Anders Ravn, Aalborg University, Denmark * Leila Ribeiro, UFRGS, Brazil * Augusto Sampaio, UFPE, Brazil * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden * Sebasti?n Uchitel, Imperial College London, UK, and UBA, Argentina * Willem Visser, University of Stellenbosch, South Africa * Sergio Yovine, VERIMAG, France, and UBA, Argentina Organising Committee * Carlos Luna, Universidad de la Rep?blica, Uruguay * Alberto Pardo, Universidad de la Rep?blica, Uruguay * Luis Sierra, Universidad de la Rep?blica, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR, China * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Mathai Joseph, TRDDC, Pune, India * Zhiming Liu, UNU-IIST, Macao SAR, China * Andrea Maggiolo-Schettini, Pisa University, Italy --- Gerardo Schneider Chalmers | University of Gothenburg University of Oslo http://www.cse.chalmers.se/~gersch/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Stephan.Merz at loria.fr Wed Apr 20 10:31:57 2011 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Wed, 20 Apr 2011 16:31:57 +0200 Subject: [TYPES/announce] post-doc position in INRIA-MSR project (Paris, France) Message-ID: <90B3946C-4FEA-4696-91C4-464D62F2F9D8@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 work on a proof development environment for TLA+ in the Tools for Proofs project-team (see http://www.msr-inria.inria.fr). Research Context ================ TLA+ is a language for formal specifications and proofs designed by Leslie Lamport. It is based on first-order logic, set theory, temporal logic, and a module system. While the specification part of TLA+ has existed for several years, the proof language is more recent, and we are developing tools for writing and checking proofs. TLA+ proofs are interpreted by the Proof Manager (PM), which generates proof obligations corresponding to individual steps of the TLA+ proof. The PM passes proof obligations to backend provers; currently these include the tableau prover Zenon and a generic backend for SMT solvers. When possible, we expect backend provers to produce a detailed proof that is then checked by an axiomatization of TLA+ in the trusted proof assistant Isabelle. In this way, we obtain high assurances 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 as 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. This part of TLA+ is already useful for proving safety properties. Description of the activity of the post-doc =========================================== The post-doctoral researcher will extend the proof manager to handle the temporal part of TLA+. In cooperation with the other members of the project, he or she will contribute to the extension of the TLA+ proof language to temporal operators, and will design and implement a new translation to Isabelle of the full language. This extension poses interesting conceptual and practical problems. In particular, the new translation will have to smoothly extend the existing one in order to make use of the plain first-order theorems produced by the old translation, which will be kept for all action-level reasoning. Skills and profile of the candidate =================================== The ideal candidate will 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. Location ======== The Microsoft Research-INRIA Joint Centre is located on the Campus of INRIA Saclay, in the South of Paris, near the Le-Guichet RER station. The Tools for Proofs project-team is composed of Damien Doligez, Leslie Lamport, and Stephan Merz. 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 June 1, 2011. This announcement is available at http://www.msr-inria.inria.fr/Members/doligez/post-doc-position/view From cezarykaliszyk at gmail.com Wed Apr 20 17:56:17 2011 From: cezarykaliszyk at gmail.com (Cezary Kaliszyk) Date: Thu, 21 Apr 2011 06:56:17 +0900 Subject: [TYPES/announce] THedu'11 at CADE: last call for ext.abstracts In-Reply-To: References: <4D482137.2000205@inria.fr> <4DAEF21D.7060001@ist.tugraz.at> Message-ID: ---------------------------------------------------------------------- LAST CALL FOR EXTENDED ABSTRACTS ---------------------------------------------------------------------- THedu'11 CTP components for educational software ======================================= (CTP -- Computer Theorem Proving) http://www.uc.pt/en/congressos/thedu Workshop at CADE-23, 23nd International Conference on Automated Deduction Wroclaw, Poland, July 31- August 5, 2011 http://cade23.ii.uni.wroc.pl/ ---------------------------------------------------------------------- Important Dates --------------- * Extended Abstracts/Demo proposals 29 Apr 2011 (PDF, easychair [2]) * Author Notification: 3 Jun 2011 * Worshop Day: 31 Jul 2011 * Full papers (post-proceedings): 27 Aug 2011 (LaTeX,easychair[2]) THedu'11 Scope -------------- This workshop intends to gather the research communities for Computer Theorem proving (CTP), Automated Theorem Proving (ATP), Interactive Theorem Proving (ITP) as well as for Computer Algebra Systems (CAS) and Dynamic Geometry Systems (DGS). The goal of this union is to combine and focus systems of these areas and to enhance existing educational software as well as studying the design of the next generation of mechanised mathematics assistants (MMA). Elements for next-generation MMA's include: * Declarative Languages for Problem Solution: education in applied sciences and in engineering is mainly concerned with problems, which are understood as operations on elementary objects to be transformed to an object representing a problem solution. Preconditions and postconditions of these operations can be used to describe the possible steps in the problem space; thus, ATP-systems can be used to check if an operation sequence given by the user does actually present a problem solution. Such "Problem Solution Languages" encompass declarative proof languages like Isabelle/Isar or Coq's Mathematical Proof Language, but also more specialized forms such as, for example, geometric problem solution languages that express a proof argument in Euclidean Geometry or languages for graph theory. * Consistent Mathematical Content Representation: libraries of existing ITP-Systems, in particular those following the LCF-prover paradigm, usually provide logically coherent and human readable knowledge. In the leading provers, mathematical knowledge is covered to an extent beyond most courses in applied sciences. However, the potential of this mechanised knowledge for education is clearly not yet recognised adequately: renewed pedagogy calls for enquiry-based learning from concrete to abstract --- and the knowledge's logical coherence supports such learning: for instance, the formula 2.pi depends on the definition of reals and of multiplication; close to these definitions are the laws like commutativity etc. Clearly, the complexity of the knowledge's traceable interrelations poses a challenge to usability design. * User-Guidance in Stepwise Problem Solving: Such guidance is indispensable for independent learning, but costly to implement so far, because so many special cases need to be coded by hand. However, CTP technology makes automated generation of user-guidance reachable: declarative languages as mentioned above, novel programming languages combining computation and deduction, methods for automated construction with ruler and compass from specifications, etc --- all these methods 'know how to solve a problem'; so, using the methods' knowledge to generate user-guidance mechanically is an appealing challenge for ATP and ITP, and probably for compiler construction! In principle, mathematical software can be conceived as models of mathematics: The challenge addressed by this workshop is to provide appealing models for MMAs which are interactive and which explain themselves such that interested students can independently learn by inquiry and experimentation. Program Chairs -------------- Ralph-Johan Back, Abo University, Turku, Finland Pedro Quaresma, University of Coimbra, Portugal Program Committee Francisco Botana, University of Vigo at Pontevedra, Spain Florian Haftmann, Munich University of Technology, Germany Predrag Janicic, University of Belgrade, Serbia Cezary Kaliszyk, University of Tsukuba, Japan Julien Narboux, University of Strasbourg, France Walther Neuper, Graz University of Technology, Austria Wolfgang Schreiner, Johannes Kepler University, Linz, Austria Laurent Th?ry, Sophia Antipolis, INRIA, France Makarius Wenzel, University Paris-Sud, France Burkhart Wolff, University Paris-Sud, France Submission ---------- THedu'11 seeks papers and demos presenting original unpublished work which is not been submitted for publication elsewhere. Both, papers and demos, are submitted as extended abstracts first (29 Apr 2011), which must not exceed five pages. The abstract should be new material. Demos should be accompanied by links to demos/downloads and [existing] system descriptions. Availability of such accompanying material will be a strong prerequisite for acceptance. The authors of the extended abstracts and system descriptions should submit to easychair [2] in PDF format generated by EPTCS LaTeX style [3] . Selected extended abstracts and system descriptions will appear in CISUC Technical Report series (ISSN 0874-338X, [1]). At least one author of each accepted paper/demo is expected to attend THedu'11 and to present her or his paper/demo, and the extended abstracts will be made available online. After presentation at the conference selected authors will be invited to submit a substantially revised version, extended to 10-14 pages, for publication by the Electronic Proceedings in Theoretical Computer Science (EPTCS). Papers/system descriptions will be reviewed by blind peer review and evaluated by three referees with respect to relevance, clarity, quality, originality, and impact. Revised versions are submitted in LaTeX according to the EPTCS style guidelines [3] via easychair [2]. [1] http://www.uc.pt/en/fctuc/ID/cisuc/RecentPublications/Techreports/ [2] http://www.easychair.org/conferences/?conf=thedu11 [3] http://www.cse.unsw.edu.au/%7Ervg/EPTCS/eptcsstyle.zip -------------- next part -------------- An HTML attachment was scrubbed... URL: From Manuela.Bujorianu at manchester.ac.uk Thu Apr 21 03:26:49 2011 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Thu, 21 Apr 2011 07:26:49 +0000 Subject: [TYPES/announce] CfPart: IM-PCS and FoRMA, Manchester, UK Message-ID: <38A9C8B532151940826352E121D3570C02F04B@MBXP07.ds.man.ac.uk> * Appologies for potential cross-postings of this adverts * Please feel free to distribute to the interested colleagues ---------------------------------------------------------------------------------------------------------------------------------------------- IM-CPS: International Symposium on =================================== Interdisciplinary Modelling of Cyber-Physical Systems ====================================================== FoRMA: Tutorial Workshop on ============================ Formal and Resilient Methods in Aerospace ========================================= 25-28 May 2011 University of Manchester Part of MaDe: Manchester Dependability Week ---------------------------------------------------------------------------------------------------------------------------------------------- http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/IMCPS2011.htm http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/Forma.htm ---------------------------------------------------------------------------------------------------------------------------------------------- Organisation The Centre for Interdisciplinary Computational and Dynamical Analysis - CICADA Co-Chairs: Manuela Bujorianu, Jonathan Shapiro MaDe General Chair: Dave Broomhead ---------------------------------------------------------------------------------------------------------------------------------------------- Overview Cyber-physical systems are a facet of the contemporary holistic trend in engineering and technology. These constitute a class of applications where behaviours are characterized by a non-trivial interaction between physics and computation. Moreover, systems are considered in their deployment context, for example in networking or multi-agent situations. The mathematical modelling of cyber-physical systems is complex, and its core is based on the so-called hybrid systems, a class of mathematical models based on combinations of discrete and continuous mathematics. There are several classes of models and techniques of hybrid systems, commonly grouped under the names of hybrid automata, hybrid control systems and hybrid dynamical systems. The second edition of IM-CPS will bring together researchers from academia and industry with expertise relevant to cyber-physical systems. IM-CPS is a forum that facilitates the interactions between various disciplines like applied mathematics, computer science, control theories and other branches of engineering. Promoting inter-disciplinary research is a major objective of IM-CPS. Some priority topics include hybrid discrete/continuous mathematical models, embedded systems, stochastic hybrid systems, symbolic verification, stochastic modelling and model checking, aerospace applications. ---------------------------------------------------------------------------------------------------------------------------------------------- The registration can be done online at http://estore.manchester.ac.uk/browse/product.asp?catid=81&modid=2&compid=1 and http://estore.manchester.ac.uk/browse/product.asp?catid=80&modid=2&compid=1 or by contacting Helen Harper (Helen.Harper at manchester.ac.uk), with whom any further aspects can be discussed. Lunches and beverages will be served on the site. The registration fee is kept to a minimum, which covers the very basic costs. The PhD students may apply for fee waiving. The number of available places is limited, therefore book your participation in time. ---------------------------------------------------------------------------------------------------------------------------------------------- Tutorials ? Mike Hinchey (Lero, Ireland) `` Self-Managed Software? ? Rafael Wisniewski and Christoffer Sloth (Aalburg University, Denmark) `` Discrete Abstractions of Mechanical Systems? ? Pieter Mosterman (The MathWorks US and McGill University, Canada) and Justyna Zander (Harvard University, US) ``A Model of Time to Characterize a Computational Framework for the Design of Cyber-Physical Systems" ? Peter Harman (DeltaTheta UK Limited) "Modelica simulation and non-simulation applications in engineering" Presentations ? Richard Banach (University of Manchester, UK) ``Formal Control System Design across the Continuous/Discrete Modeling Interface: A Simple Train Stopping Application? ? Howard Barringer (University of Manchester, UK) ``Modelling of Supervised Component-based Systems? ? Marco Bozzano, Alessandro Cimatti, Marco Roveri (Fondazione Bruno Kessler, Trento, Italy) ``A Model-Based Approach to the Synthesis of FDIR for Aerospace Systems? ? John Brooke (University of Manchester, UK) ``Parameterization and control of cyber-physical systems? ? Marius Bujorianu (University of Manchester, UK) "A Stochastic Hybrid Model for Massively Parallel Systems? ? Clare Dixon (University of Liverpool, UK) ``Towards Verifying Emergent Properties of Robot Swarms" ? Michael Fisher (University of Liverpool, UK) ``Autonomy Verification" ? Steve Furber (University of Manchester, UK) "Real-Time Brain Modelling with Massively-Parallel Embedded Processors" ? Antoine Girard (Universit? Joseph Fourier, Grenoble, FR) ``Symbolic Approaches to Control via Approximate Bisimulations" ? Tingting Han (University of Oxford, UK) ``Model Checking CTMC Against Timed-Automata Specifications`` ? Agung Julius (Rensselaer Polytechnic Institute, US) ``Control Synthesis Using Video Games" ? Joost-Pieter Katoen (RWTH Aachen, Germany) ``Observing Markov Chain Behaviour by Timed Automata" ? Margarita Korovina (University of Manchester, UK) ``Reachability In One-Dimensional Controlled Polynomial Dynamical Systems? ? Alexandru Mereacre (University of Oxford, UK) ``Quantitative Automata Model Checking of Autonomous Stochastic Hybrid Systems" ? John Moriarty (University of Manchester, UK) ``Hysteretic Regime Switching Diffusions, And Applications In The Theory Of Real Options? ? Anna Philippou (Technical University of Cyprus) ``A Process-Algebraic Approach To Hierarchical Scheduling" ? William Parnell (University of Manchester, UK) ``Smart Materials For Acoustic And Elastic Wave Filtering? ? Giordano Pola University of l?Aquila, Italy ``Symbolic Controller Design for Continuous Systems" ? Mohsen Torabzadeh-Tari (Link?ping University Sweden) ``Modelica and OpenModelica?its Open Source Environment? From carlos.martin at urv.cat Thu Apr 21 03:36:45 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Thu, 21 Apr 2011 09:36:45 +0200 Subject: [TYPES/announce] LATA 2011: call for participation Message-ID: Call for participation 5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011) Tarragona, Spain, May 26-31, 2011 http://grammars.grlmc.com/LATA2011/ ********************************************************************* PROGRAMME THURSDAY, MAY 26 08:00-08:50 Registration 08:50-09:00 Opening 09:00-09:50 Bakhadyr Khoussainov: Automatic Structures and Groups (I) - Invited Tutorial 09:50-10:00 Break 10:00-11:40 Arto Salomaa, Kai Salomaa, Sheng Yu: Undecidability of the State Complexity of Composed Regular Operations Alexei Lisitsa, Igor Potapov, Rafiq Saleh: Planarity of Knots, Register Automata and LogSpace Computability Alexander Okhotin, Kai Salomaa: Descriptional Complexity of Unambiguous Nested Word Automata Francine Blanchet-Sadri, Kevin Black, Andrew Zemke: Unary Pattern Avoidance in Partial Words Dense with Holes 11:40-12:10 Coffee Break 12:10-13:50 Natalie Schluter: Restarting Automata with Auxiliary Symbols and Small Lookahead Benedek Nagy, Friedrich Otto: Globally Deterministic CD-Systems of Stateless R(1)-Automata Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, Mohammad Reza Mousavi, Michel A. Reniers: Rule Formats for Distributivity Marcella Anselmo, Dora Giammarresi, Maria Madonia: Classification of String Languages via Tiling Recognizable Picture Languages 13:50-15:30 Lunch 15:30-16:20 Dana Angluin, James Aspnes, Raonne Barbosa Vargas: Mutation Systems J?rgen Dassow, Florin Manea, Bianca Truthe: Networks of Evolutionary Processors with Subregular Filters 16:20-16:30 Break 16:30-17:20 Narad Rampersad: Abstract Numeration Systems - Invited Talk FRIDAY, MAY 27 09:00-09:50 Bakhadyr Khoussainov: Automatic Structures and Groups (II) - Invited Tutorial 09:50-10:00 Break 10:00-11:40 Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Unique Small Subgraphs are not Easier to Find Alberto Policriti, Alexandru I. Tomescu: Well-quasi-ordering Hereditarily Finite Sets Robert Brijder, Hendrik Blockeel: Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll: A Local Greibach Normal Form for Hyperedge Replacement Grammars 11:40-12:10 Coffee Break 12:10-13:50 Gr?goire Laurence, Aur?lien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi: Normalization of Sequential Top-Down Tree-to-Word Transducers Pavel Labath, Branislav Rovan: Simplifying DPDA Using Supplementary Information Karin Quaas: On the Interval-Bound Problem for Weighted Timed Automata Beno?t Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski: Decision Problems for Interval Markov Chains 13:50-15:30 Lunch 15:30 - 16:45 Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas: Singular Artin Monoids of Finite Coxeter Type are Automatic ?milie Charlier, Mike Domaratzki, Tero Harju, Jeffrey Shallit: Finite Orbits of Language Operations Jana Hadravov?: The Block Structure of Successor Morphisms 17:30 Visit to the Old City MONDAY, MAY 30 09:00-09:50 J?r?me Leroux: Vector Addition System Reachability Problem: A Short Self-Contained Proof (I) - Invited Tutorial 09:50-10:00 Break 10:00-11:40 Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: The Complexity of Request-Response Games Michel Rigo, ?lise Vandomme: Syntactic Complexity of Ultimately Periodic Sets of Integers Agata Barecka, Witold Charatonik: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees Krishnendu Chatterjee, Nathana?l Fijalkow: Finitary Languages 11:40-12:10 Coffee Break 12:10-13:50 Daniel Reidenbach, Markus L. Schmid: Finding Shuffle Words that Represent Optimal Scheduling of Shared Memory Access Martin Berglund, Henrik Bj?rklund, Johanna H?gberg: Recognizing Shuffled Languages Ehud S. Conley, Shmuel T. Klein: Improved Alignment Based Algorithm for Multilingual Text Compression Lasse Nielsen, Fritz Henglein: Bit-Coded Regular Expression Parsing 13:50-15:30 Lunch 15:30-16:20 John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan: Automatic Learning of Subclasses of Pattern Languages Jacek Marciniec: Tarski's Principle, Categorial Grammars and Learnability 16:20-16:30 Break 16:30-17:20 Thomas Colcombet: Green's Relations and their Use in Automata Theory - Invited Talk TUESDAY, MAY 31 09:00-09:50 J?r?me Leroux: Vector Addition System Reachability Problem: A Short Self-Contained Proof (II) - Invited Tutorial 09:50-10:00 Break 10:00-11:15 Martin Huschenbett: Models for Quantitative Distributed Systems and Multi-Valued Logics Holger Bock Axelsen, Robert Gl?ck: A Simple and Efficient Universal Reversible Turing Machine K?vin Perrot, Eric R?mila: Avalanche Structure in the Kadanoff Sand Pile Model 11:15-11:45 Coffee Break 11:45-12:35 Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Partial Derivatives of an Extended Regular Expression Marcus Gelderie: Classifying Regular Languages via Cascade Products of Automata 12:35-12:45 Break 12:45-13:35 Kevin Knight: Automata for Deciphering Natural Language - Invited Talk 13:35-13:50 Closing 13:50 Lunch From paolini at di.unito.it Thu Apr 21 04:20:04 2011 From: paolini at di.unito.it (Luca Paolini) Date: Thu, 21 Apr 2011 10:20:04 +0200 Subject: [TYPES/announce] RDP 2011 - Second Call for Participation Message-ID: <1303374004.1936.60.camel@gmoon> [We apologise for multiple copies.] ********************************************************************* *** Federated Conference on Rewriting, Deduction, and Programming *** *** RDP 2011 *** *** May 29 - June 3, 2011 *** *** Novi Sad, Serbia *** *** http://www.rdp2011.uns.ac.rs *** *** *** *** SECOND CALL FOR PARTICIPATION *** *** *** ********************************************************************* --------------------------------------------------------------------- -- REGISTRATION -- --------------------------------------------------------------------- For online registration visit: http://www.rdp2011.uns.ac.rs/practical/registration.html Regular registration closes on May 10. --------------------------------------------------------------------- -- ABOUT RDP -- --------------------------------------------------------------------- RDP'11 is the sixth edition of the biannual Federated Conference on Rewriting, Deduction, and Programming, consisting of two main conferences and related events. --------------------------------------------------------------------- -- RDP MAIN CONFERENCES -- --------------------------------------------------------------------- RTA 2011 The 22nd International Conference on Rewriting Techniques and Applications May 30 - June 1, 2011 TLCA 2011 The Tenth International Conference on Typed Lambda Calculi and Applications June 1 - 3, 2011 --------------------------------------------------------------------- -- RDP 2011 INVITED SPEAKERS -- --------------------------------------------------------------------- Alexandre Miquel (Ecole Normale Superieure de Lyon, France) Sophie Tison (Universite Lille and LIFL, France) Ashish Tiwari (SRI, USA) Vladimir Voevodsky (Institute of Advanced Study, USA) Stephanie Weirich (University of Pennsylvania, USA) (in alphabetical order) --------------------------------------------------------------------- -- WORKSHOPS -- --------------------------------------------------------------------- COBRA 2011 Compilers by Rewriting, Automated HDTT 2011 Higher Dimensional Type Theory TPDC 2011 Theory and Practice of Delimited Continuations (TPDC) 2FC 2011 Two Faces of Complexity (2FC) WRS 2011 Reduction Strategies in Rewriting and Programming IFIP WG 1.6 Working Group 1.6 Term Rewriting --------------------------------------------------------------------- -- HOST CITY: NOVI SAD, SERBIA -- --------------------------------------------------------------------- Novi Sad is capital of Vojvodina, the northern region of Serbia. Situated on the Danube river, 80km from the capital city Belgrade, it is treasured regional and cultural center. With the population of about 300,000, Novi Sad is a modern and pleasant city with wide boulevards, modern buildings and the historical Central Square surrounded by the Old Town Hall, the Roman catholic church and similar buildings dating mainly from the early nineteenth century. The city, as well as whole of Vojvodina is well-known multicultural, multinational and multiconfesional region. Among the cultural-historical monuments, the best known is the Petrovaradin fortress with its underground corridors, promenades, museums, restaurants and art studios. There are also many churches, monasteries and other cultural monuments. Novi Sad is also known by the longest and the most beautiful sandy beach on the Danube, as well as by nearby Fruska Gora mountain. As a university town, Novi Sad is known for a lively night life, with lots of nice restaurants, bars, cafes and clubs. Several international theater and music festivals take place here. For travel and accommodation information, please consult the RDP 2011 website: http://www.rdp2011.uns.ac.rs RDP 2011 is organized by the University of Novi Sad, Faculty of Technical Sciences, and Mathematical Institute SASA and will take place in the University Campus, at the Faculty of Technical Sciences. --------------------------------------------------------------------- -- REGISTRATION (again) -- --------------------------------------------------------------------- For online registration visit: http://www.rdp2011.uns.ac.rs/practical/registration.html Regular registration closes on May 10. --------------------------------------------------------------------- -- CONTACT -- --------------------------------------------------------------------- See http://www.rdp2011.uns.ac.rs Any question can be addressed to rdp2011 at uns.ac.rs From pierre.hyvernat at univ-savoie.fr Thu Apr 21 11:45:17 2011 From: pierre.hyvernat at univ-savoie.fr (Pierre Hyvernat) Date: Thu, 21 Apr 2011 17:45:17 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?Fourth_workshop_=22r=E9alisabilit?= =?iso-8859-1?q?=E9_=E0_Chamb=E9ry=22=2C_June_2011?= Message-ID: <20110421154517.GB2308@d53> This is the official announcement for the fourth workshop "R?alisabilit? ? Chamb?ry". This year's workshop will take place during week 24: from Tuesday the 14th of June to Friday the 17th of June. The special "theme" is "realizability and games". Partial information is gathered on the web page: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2011/ and you can register for the workshop there: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2011/registration.php There will be an invited course given by John Longley (Edinburgh) and two invited seminars by Stefano Berardi (Torino) and Olivier Laurent (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.) 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 should be possible to get a student room (on campus, very cheap, but only a bare room). Since some renovations are planned, I cannot say how many such rooms will be available. Students will of course be given priority for those, but anyone may ask for one... Other possibilities for accommodation are given on the web page: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2011/logistic.php Pierre Hyvernat -- The reason he never stops talking is because he's got nothing to say and so he doesn't know when he's said it. -- John Major From carlos.martin at urv.cat Fri Apr 22 05:41:20 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Fri, 22 Apr 2011 11:41:20 +0200 Subject: [TYPES/announce] SSLST 2011: 1st announcement Message-ID: 2011 INTERNATIONAL SUMMER SCHOOL IN LANGUAGE AND SPEECH TECHNOLOGIES (SSLST 2011) (formerly International PhD School in Language and Speech Technologies) Tarragona, Spain, August 29 ? September 2, 2011 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/sslst2011/ ****************************************** ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Linguistics. Other students (for instance, from Mathematics, Electrical Engineering, or Philosophy) are welcome too. All courses will be compatible in terms of schedule. COURSES AND PROFESSORS: Walter Daelemans (Antwerpen), Computational Stylometry [advanced, 4 hours] Robert Dale (Macquarie), Automated Writing Assistance: Grammar Checking and Beyond [intermediate, 8 hours] Christiane Fellbaum (Princeton), Computational Lexical Semantics [introductory/intermediate, 10 hours] Ralph Grishman (New York), Introduction to Information Extraction [intermediate, 8 hours] Daniel Jurafsky (Stanford), Computational Extraction of Social and Interactional Meaning [introductory/advanced, 8 hours] Chin-Hui Lee (Georgia Tech), Digital Speech Processing [intermediate, 8 hours] Yuji Matsumoto (Nara), Syntax and Parsing: Phrase Structure and Dependency Parsing [introductory, 8 hours] Diana Maynard (Sheffield), Text Mining [introductory/intermediate, 8 hours] Dan Roth (Urbana-Champaign), Structured Predictions in NLP: Constrained Conditional Models, and Integer Linear Programming in NLP [intermediate/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/sslst2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until June 5, 2011), - 15 euros (for payments after June 5, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC) Please mention SSLST 2011 and your full name in the subject. An invoice will be provided on site. Bank transfers should not involve any expense for the School. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation will be provided on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: April 21, 2011 Starting of the registration: April 25, 2011 Early registration deadline: June 5, 2011 Starting of the School: August 29, 2011 End of the School: September 2, 2011 QUESTIONS AND FURTHER INFORMATION: Florentina-Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/sslst2011/ POSTAL ADDRESS: SSLST 2011 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From L.C.Verbrugge at ai.rug.nl Fri Apr 22 15:57:15 2011 From: L.C.Verbrugge at ai.rug.nl (Rineke Verbrugge) Date: Fri, 22 Apr 2011 21:57:15 +0200 Subject: [TYPES/announce] Second CfP TARK-workshop 'Reasoning about other minds', Groningen, 11 July 2011 Message-ID: <5F0BA290-9B90-46AB-99DD-DBE158F5104E@ai.rug.nl> **apologies for multiple postings** Second CALL FOR PAPERS WORKSHOP : Reasoning about other minds: Logical and cognitive perspectives Groningen, the Netherlands, Monday 11 July 2011 http://www.ai.rug.nl/conf/reasoningminds/ Workshop Goal: This workshop aims to shed light on models of social reasoning that take into account realistic resource bounds. People reason about other people?s mental states in order to understand and predict the others? behavior. This capability to reason about others? knowledge, beliefs and intentions is often referred to as ?theory of mind?. Idealized rational agents are capable of recursion in their social reasoning, and can reason about phenomena like common knowledge. Such idealized social reasoning has been modeled by modal logics such as epistemic logic and BDI (belief, goal, intention) logics and by epistemic game theory. However, in real-world situations, many people seem to lose track of such recursive social reasoning after only a few levels. The workshop provides a forum for researchers that attempt to analyze, understand and model how resource-bounded agents reason about other minds. Topics of interest include but are not limited to: -Logics modeling human social cognition; -Computational cognitive models of theory of mind; -Behavioral game theory; -Bounded rationality in epistemic game theory; -Relations between language and social cognition; -Models of the evolution of theory of mind; -Models of the development of theory of mind in children; -Bounded rationality in multi-agent systems; -Formal models of team reasoning; -Theory of mind in specific groups, e.g., persons with autism spectrum disorder; -Complexity measures for reasoning about other minds. Invited Speakers: -Chris Baker, Massachusetts Institute of Technology -Barbara Dunin-Keplicz, Warsaw University and Polish Academy of Sciences -Petra Hendriks, University of Groningen Deadline CFP: Please send your submission in PDF format, not exceeding 10 double-spaced pages (4,000 words) by Wednesday May 4, 2011. If needed due to space reasons, technical material such as proofs may be added in an appendix of at most 5 pages. The PDF files have to be uploaded online via the workshop's submission website: https://www.easychair.org/account/signin.cgi?ReasoningMinds-2011 The author notification date is Friday May 27, 2011. Authors of accepted papers will be expected to upload their paper in an online workshop proceedings collection that we are currently setting up. Further details about the proceedings will be made available soon. After the workshop, selected authors will be invited to submit a revised and extended version of their paper for a special issue of Synthese / Knowledge, Rationality and Action, devoted to on Reasoning about other minds, to appear in 2012. Programme Committee: -Rineke Verbrugge (University of Groningen, chair) -Jan van Eijck (CWI Amsterdam, vice-chair) -Johan van Benthem (University of Amsterdam and Stanford University) -Robin Clark (University of Pennsylvania) -Hans van Ditmarsch (University of Sevilla) -Peter G?rdenfors (Lund University) -Sujata Ghosh (University of Groningen) -Noah Goodman (Stanford University) -Bart Hollebrandse (University of Groningen) -Eric Pacuit (Tilburg University and University of Maryland) -Rohit Parikh (City University of New York) -Jun Zhang (University of Michigan) The workshop will be held on the day before TARK XIII, The Thirteenth Conference on Theoretical Aspects of Rationality and Knowledge. A workshop on Quantum physics meets TARK will be held on the day after TARK, Friday 15 July. http://www.tark2011.org It is already possible to register for the complete event, including TARK and two workshops, Monday 11 July - Friday 15 July. Early bird registration until May 31: euro 225,- (euro 125,- for MSc and PhD students) http://www.philos.rug.nl/TARK2011/registration.html TARK local organizers at the University of Groningen: Sonja Smets and Rineke Verbrugge (chairs), Virginie Fiutek, Sujata Ghosh, Barteld Kooi, Ben Meijering, Bryan Renne, Ben Rodenh?user, Olivier Roy, Allard Tamminga, Bart Verheij. Sponsors: The Netherlands Organization for Scientific Research (NWO), in particular the Vici project: ?Cognitive systems in interaction: Logical and computational models of higher-order theory of mind? and the Royal Netherlands Academy of Arts and Sciences (KNAW). Rineke Verbrugge University of Groningen Faculty of Mathematics and Natural Sciences, Institute of Artificial Intelligence P.O. Box 407 9700 AK Groningen The Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: From cbraga at ic.uff.br Fri Apr 22 21:28:33 2011 From: cbraga at ic.uff.br (Christiano Braga) Date: Fri, 22 Apr 2011 22:28:33 -0300 Subject: [TYPES/announce] [Sbc-l] SBLP 2011 - Deadline extension Message-ID: <4B3C6A58-DED6-43B0-9CD7-A6CD0CA44FEB@ic.uff.br> [Apologies for multiple copies of this call.] SBLP 2011: Call For Papers *** New deadlines! *** *** Easychair is open for submissions *** 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 26-30, 2011 http://www.each.usp.br/cbsoft2011/ IMPORTANT DATES Paper abstract submission (15 lines): April 29th, 2011 (was April 22nd, 2011) Full paper submission: May 6th, 2011 (was April 29th, 2011) Notification of acceptance: June 6th, 2011 (was May 30th, 2011) Final papers due: July 8th, 2011 (was July 1st, 2011) INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester Talk title: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida Talk title: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" INTRODUCTION The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2011 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical approaches. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Submissions should be done using SBLP 2011 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2011. Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. All papers should be prepared using the Springer Lecture Notes in Computer Science (LNCS) template. (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) We encourage the submission of short papers reporting on master dissertations or doctoral theses at early stages of their development. All accepted papers, with at least one author registered in the conference, will be published in the conference proceedings. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP 2009 and 2010, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. ORGANIZATION CHAIRS - For CBSoft * Marcelo Fantinato, EACH - USP * Luciano Silva, FCI - Mackenzie - For SBLP * Denise Stringhini FCI, Mackenzie * Alfredo Goldman IME, USP PROGRAMME COMMITTEE CHAIRS * Christiano Braga, UFF * Jose Luiz Fiadeiro, Univ. of Leicester PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Alvaro Moreira, UFRGS * Andre Du Bois, UFPel * Alex Garcia, IME * Andre Santos, UFPE * Artur Boronat, Univ. of Leicester * Carlos Camarao, UFMG * Christiano Braga, UFF (co-chair) * Fernando Castor Filho, UFPE * Fernando Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC * Jens Palsberg, UCLA * Joao Saraiva, Universidade do Minho * Johan Jeuring, Utrecht Univ. * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester (co-chair) * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho * Marcelo A. Maia, UFU * Marcelo d'Amorim, UFPE * Marco Tulio Valente, UFMG * Mariza A. S. Bigonha, UFMG * Martin A. Musicante, UFRN * Noemi Rodriguez, PUC-Rio * Paulo Borba, UFPE * Peter Mosses, Swansea University * Renato Cerqueira, PUC-Rio * Ricardo Massa, UFPE * Roberto S. Bigonha, UFMG * Roberto Ierusalimschy, PUC-Rio * Sandro Rigo, UNICAMP * Sergio Soares, UFPE * Sergiu Dascalu, Univ. of Nevada * Simon Thompson, Univ. of Kent * Varmo Vene, Univ. de Tartu _______________________________________________ Sbc-l mailing list Sbc-l at sbc.org.br https://grupos.ufrgs.br/mailman/listinfo/sbc-l From M.R.Mousavi at tue.nl Sun Apr 24 07:55:11 2011 From: M.R.Mousavi at tue.nl (Mousavi, M.) Date: Sun, 24 Apr 2011 13:55:11 +0200 Subject: [TYPES/announce] CFP: Foundations of Coordination Languages and Software Architectures (Deadline: June 3) In-Reply-To: <7DF2365FF07C0E4E89419D65CCC93C9E018E3E791AE6@EXCHANGE11.campus.tue.nl> References: <7DF2365FF07C0E4E89419D65CCC93C9E018E3E791AE6@EXCHANGE11.campus.tue.nl> Message-ID: <7DF2365FF07C0E4E89419D65CCC93C9E018E3E791AE7@EXCHANGE11.campus.tue.nl> *************************************************** The 10th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2011) A Satellite Workshop of CONCUR 2011 Aachen (Germany), September 10, 2011 http://foclasa.lcc.uma.es/ Submission Deadline: June 3rd, 2011 (Abstract: May 27th, 2011) *************************************************** Abstract ====== Computation nowadays is becoming inherently concurrent, either because of characteristics of the hardware (with multicore processors becoming omnipresent) or due to the ubiquitous presence of distributed systems (incarnated in the Internet). Computational systems are therefore typically distributed, concurrent, mobile, and often involve composition of heterogeneous components. To specify and reason about such systems and go beyond the functional correctness proofs, e.g., by supporting reusability and improving maintainability, approaches such as coordination languages and software architecture are recognised as fundamental. The goal of the FOCLASA workshop is to put together researchers and practitioners of the aforementioned fields, to share and identify common problems, and to devise general solutions in the context of coordination languages and software architectures. Topics of interest ============ Topics of interest include (but are not limited to): * Theoretical models (of coordination, of component composition, of open, concurrent, and distributed systems) * Specification, refinement, and analysis of software systems (architectures, patterns and styles, verification of functional and non-functional properties via logics or types) * Languages for interaction, coordination, architectures, and interface definition (syntax and semantics, implementation, usability, domain-specific languages) * Dynamic software architectures (mobile agents, self-organizing/adaptive/reconfigurable systems) * Tools and environments for the development of applications. In particular, practice, experience and methodologies from the following areas are solicited as well: * Service-Oriented computing * Multi-agent systems * Peer-to-peer systems * Grid computing * Component-based systems Invited Talk ======== Joe Armstrong, Ericsson, Sweden. Submissions ======== FOCLASA 2011 is a satellite workshop of the 22nd International Conference on Concurrency Theory (CONCUR 2011). It provides 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 software architecture, and explore together and disseminate solutions. 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: click here. Important Dates =========== Abstract submission: May 27th, 2011 Paper submission: June 3rd, 2011 Notification: July 4th, 2011 Final version due: July 18th, 2011 Workshop: September 10th, 2011 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 edition, a special issue of an international scientific journal will be devoted to FOCLASA 2011. 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 and we plan to devote a special issue of the same journal to FOCLASA 2011. Program Committee Chairs ================== MohammadReza Mousavi Eindhoven University of Technology, The Netherlands Ant?nio Ravara New University of Lisbon, Portugal Program Committee ============= Jonathan Aldrich, Carnegie Mellon University, USA Luis Barbosa, University of Minho, Portugal Bernhard Beckert, Karlsruhe Institute of Technology, Germany Antonio Brogi, University of Pisa, Italy Carlos Canal, University of M?laga, Spain Vittorio Cortellessa, University of L'Aquila, Italy Gregor Goessler, INRIA Grenoble - Rh?ne-Alpes, France Ludovic Henrio, INRIA Sophia Antipolis, France Paola Inverardi, Universit? dell'Aquila, Italy MohammadReza Mousavi, Eindhoven University of Technology, The Netherlands Jaco van de Pol, University of Twente, The Netherlands Ant?nio Ravara, Technical University of Lisbon, Portugal Gwen Sala?n, Grenoble INP - INRIA - LIG, France Carolyn Talcott, SRI International, USA Emilio Tuosto, University of Leicester, UK Mirko Viroli, University of Bologna, Italy From marco.devillers at gmail.com Sun Apr 24 09:12:30 2011 From: marco.devillers at gmail.com (M.C.A. (Marco) Devillers) Date: Sun, 24 Apr 2011 15:12:30 +0200 Subject: [TYPES/announce] Request for Help for getting a Type Inferencer Right Message-ID: Dear all, I guess this is a somewhat unexpected request for a type theory list, but thought I would like to post it anyway. As an experiment, I implemented a small compiler for a language. You can read about it at www.hi-language.org. The language of the compiler can be understood to be a cheap Haskell knock-off with ML (eager) semantics. In short, it is an eager impure functional language with support for type constructor classes. (I am aware of various ideas written by mr. Peyton Jones.) I am looking for people who would like to help met to get the static semantics right. At the moment, the compiler has been bootstrapped and has a prototype type-inferencer which discharges type constraints to a sequent style prover. Basically, I am looking for people who have done this before and know more than the average what can be read in various resources so I can bounce some ideas to them; i.e., people who also know the hairy details of getting a type system for a programming language right. I have been asked to make my request more concrete, so, here some of the background ideas for the intended type inferencer: 1. Support for infinite types. A lot of straight-forward Hindley-Milner type inferencing algorithms do not support infinite type whereas they can be very useful. I would like you to consider the next streaming type as an example for that: type stream = \i o => i -> (o, stream i o). I'll want infinite types. 2. Support for type annotated records. The typing system of Haskell is very complex. The Hi language is designed to be much simpler. More specific, in Haskell the operational semantics of terms (if I remember correctly) depend on derived type-dictionaries for terms. In Hi, records are just 'tagged' with their type constructor, and therefor, the operational semantics do not depend on the types inferred. This should make type inferencing much simpler. 3. Support for type classes. Like in Haskell, types may be instances of type classes, which in Hi just means that a number of terms become associated with a type constructor name. I suspect that type inferencing in Hi should be much easier than in Haskell, and think that a simple system for nominal typing should be correct, but am not sure. 4. Rethinking of support for existential and universally typed types. Hi, at the moment, has rudimentary support for the mentioned logical types. I don't trust these too much as I find those specific types too much influenced by type theory for logical systems instead of programming languages. If possible, I would like to get rid of them, but, at the same time, I don't see a clear alternative. If nothing else, I'll just stick with them which means that I'll need an impredicative type system. 5. Getting rid of the sequent calculus prover. It made sense to use a sequent calculus prover to discharge type constraints as gathered by the type inferencing process. Basically, since type checking solely corresponds to proving qualities (consequences) given a number of assumptions (antecedents) a sequent prover just seems to be the right choice for type checking. Unfortunately, such a process comes at a hefty compile-time price. Such a process is just too heavy weight for checking large pieces of source code in little time - which is a requirement for most modern languages. Which means that I would like to have a simpler system which is just term based. I am not sure this is possible, also given the fact that I would like to check infinite types, which just goes best with a sequent style prover. 6. No strange restrictions. I can't get my head around ML's value restriction and still think someone must have made a mistake there somewhere. So, if possible, I'll want a system without these strange added-on patches. These are all questions I which I am toying with, any hints greatly appreciated. Thanks for your time, M.C.A. (Marco) Devillers From lutz at lix.polytechnique.fr Sun Apr 24 21:50:22 2011 From: lutz at lix.polytechnique.fr (Lutz Strassburger) Date: Mon, 25 Apr 2011 03:50:22 +0200 (CEST) Subject: [TYPES/announce] Postdoc position in proof theory in Paris Message-ID: -------------------------------------------------------- Postdoc position in proof theory in Paris -------------------------------------------------------- There is an opening of a postdoc position on structural and computational proof theory. The position is financed by the ANR within the project STRUCTURAL The postdoc will be hosted by the Laboratoire d'Informatique (LIX) at the Ecole Polytechnique, one of the "Grand Ecoles" in the French university system, located in the suburbs of Paris. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and related topics. The principal responsibility of the postdoc will be to carry out research in the area of proof theory within the project STRUCTURAL. There are no teaching duties. For further information, see or contact Lutz Strassburger or Kaustuv Chaudhuri Applications should be sent via email to Lutz Strassburger and Kaustuv Chaudhuri , and should include a CV, a research statement (1-2 pages), and two recommendation letters. The application deadline is *** May 20, 2011 *** From pangjun at gmail.com Tue Apr 26 09:15:54 2011 From: pangjun at gmail.com (Jun PANG) Date: Tue, 26 Apr 2011 15:15:54 +0200 Subject: [TYPES/announce] FHIES 2011: 2nd Call for Papers Message-ID: FHIES 2011 International Symposium on Foundations of Health Information Engineering and Systems (http://www.iist.unu.edu/ICTAC/FHIES2011/) 27-29 August 2011 Mabalingwe Nature Reserve, South Africa (Colocated with ICTAC 2011) Information and communication technology plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world, that are the concern of the United Nations, its Peoples and Members States. The use of software in medical devices is already raising issues in relation to safety and efficacy for manufacturers and regulators. Health information systems raise issues of both privacy and confidentiality, on the one hand, and, increasingly, patient safety on the other. Hospital and other information systems raise important issues of efficacy and interoperability. However, to capitalize on the potential of this technology in reshaping healthcare demands focused research on sound and safe development techniques from software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. Aims ===== The purpose of the new symposium series on Foundations of Software Engineering Health Informatics (FHIES) is to promote a nascent research area that aims to develop and apply theories and techniques in computing science and software engineering to modelling, building and certifying software based systems in the application domain of healthcare. Many of these systems are already regulated in many jurisdictions and many more of them will become regulated in the future. Research on theories, techniques and tools of software modelling, verification and validation has been an important area of computer science and software engineering, known as Formal Methods. This research addresses the challenging problem of design and certification of safety or mission critical software systems through abstraction and decomposition techniques based on the use of mathematical modelling theories and sound engineering methods. Formal methods have primarily addressed the correctness of systems used in the industrial, financial, and defense applications. However, they have recently found application in modelling and analysis of complex systems that involve interacting behaviour of many kinds of objects and agents, including software systems, physical objects and humans. The models of these systems have both discrete and continuous behaviour, and both qualitative and quantitative (e.g., spatial timing and probabilistic) properties. It is believed that these methods can be used for modelling problems of health informatics, which presents the challenge of scalability. Software plays a critical role in sustainable health care, both as part of the solution and as part of the problem. Software intensive information systems are needed to support the collection and processing of vast amounts of data via different devices, and allow policy makers to access and share these data, and to support their decision making and validation. Software systems can be developed for managing, controlling and monitoring policies, processes and workflows in medical systems. Software systems can be developed to help create the sophisticated medical devices that are simply impossible to build without the software. On the other hand, the application of software raises challenging issues in safety, security and privacy, and increases the complexity of healthcare workflows and the need for new business policies. Paper Submissions ============== We solicit high quality submissions reporting on 1. original research contributions (18 pages maximum in LNCS format) 2. application experience, case studies and software prototypes (18 pages maximum in LNCS format) 3. surveys, comparisons, and state-of-the-art reports (18 pages maximum in LNCS format) 4. position papers that define research projects with identified challenges and milestones (10 pages maximum in LNCS format) 5. proposals for panel discussions, with at least three named panellists, about a topical question (5 pages maximum in LNCS format). All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions should be in English, prepared in the LNCS format (see here for details). Submission constitutes a commitment to attend and present a paper, if accepted. All accepted papers will be included in the pre-event proceedings of the symposium and considered for EXCEPT FOR the proposals for panel discussions inclusion in a special issue of the Springer Journal "Innovations in Systems and Software Engineering" (ISSE), following revision and re-review. The post proceedings will include a brief summary of panel discussions. Important Dates =========== Abstract Submission 29 May 2011 Paper Submission 5 June 2011 Notification of acceptance 18 July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 Organization ========= General Chairs * Peter Haddawy, UNU-IIST, Macao * Tom Maibaum, McMaster University, Canada Programme Chairs * Zhiming Liu, UNU-IIST, Macao * Alan Wassyng, McMaster University, Canada Organising Chair * Hao Wang, UNU-IIST, Macao Program Committee * Syed Mohamed Aljunid, UNU-IIGH * Sebastian Fischmeister, University of Waterloo, Canada * Peter Haddawy, UNU-IIST, Macao * Jozef Hooman, Embedded Systems Institute and Radboud University Nijmegen, The Netherlands * Michaela Huhn, TU Clausthal, Germany * Mark Lawford, McMaster University, Canada * Insup Lee, University of Pennsylvania, USA * Martin Leucker, TU Munich, Germany * Wendy MacCaull, St. Francis Xavier University, Canada * Tom Maibaum, McMaster University, Canada * Dominique Mery, LORIA and Universite Henri Poincare Nancy 1, France * Jun Pang, University of Luxembourg, Luxembourg * David Robertson, University of Edinburgh, UK * Lutz Schroeder, DFKI Bremen and University of Bremen, Germany * Jens H. Weber, University of Victoria, Canada * Liang Xiao, Hubei University of Technology, P.R.China From carbonem at itu.dk Tue Apr 26 15:20:06 2011 From: carbonem at itu.dk (Marco Carbone) Date: Tue, 26 Apr 2011 21:20:06 +0200 Subject: [TYPES/announce] WS-FM 2011 - Second Call for Papers (Deadline: 12h June 2011) Message-ID: Dear colleagues, Please find below the WS-FM'11 Call for Papers. Yours, Marco Carbone and Jean-Marc Petit Co-chairs of WS-FM'11. ---------------------- WS-FM 2011 8th International Workshop on Web Services and Formal Methods September 1-2, 2011, Clemont-Ferrand, France http://itu.dk/wsfm2011/ Co-located with BPM 2011 http://bpm2011.isima.fr/ === Important Dates === June 5, 2011................Full Paper Abstract Submission June 12, 2011:.............Full Paper Submission July 22, 2010:..............Notification Acceptance August 5, 2010:...........Camera-ready due September 1-2, 2011:...Workshop in Clemont-Ferrand === Scope === Service Oriented Computing (SOC) provides standard mechanisms and protocols for describing, locating and invoking services over the Internet. Although there are existing SOC infrastructures that support specification of service interfaces, access policies, behaviors and compositions, there are still many active research areas in SOC such as the support and management of interactions with stateful and long-running services, large farms of services and quality of service delivery. Moreover, emerging paradigm of cloud computing provides a new platform for service delivery, enabling the development of services that are configurable based on client requirements, service level guarantee mechanisms, and extended services based on virtualization (Software as a Service, Platform as a Service, Infrastructure as a Service). The convergence of SOC and cloud computing is accelerating the adoption of both of these technologies, making the service dependability and trustworthiness a crucial and urgent problem. Formal methods can play a fundamental role in this research area. They can help us define unambiguous semantics for the languages and protocols that underpin existing web service infrastructures, and provide a basis for checking the conformance and compliance of bundled services. They can also empower dynamic discovery and binding with compatibility checks against behavioral properties and quality of service requirements. Formal analysis of security properties and performance is also essential in cloud computing and in application areas including e-science, e-commerce, workflow, business process management, etc. Moreover, the challenges raised by this new area can offer opportunities for extending the state of the art in formal techniques. The aim of the WS-FM workshop series is to bring together researchers working on SOC, cloud computing and formal methods in order to catalyze fruitful collaboration. The scope of the workshop is not only limited to technological aspects. In fact, the WS-FM series has a strong tradition of attracting submissions on formal approaches to enterprise systems modeling in general, and business process modeling in particular. Potentially, this could have a significant impact on the on-going standardization efforts for SOC and cloud computing technologies. Topics of interest include but are not limited to: Trust and Dependability in service oriented and cloud computing Multi-tenancy, Adaptability and Evolvability in cloud systems Formal approaches to service-oriented analysis and design Formal approaches to enterprise modeling and business process modeling Model-driven development, testing, and analysis of web services/clouds Web services for business process management Security, performance and quality of web services/clouds Web service coordination and transactions Web service ontologies and semantic description Goal-driven discovery and composition of web services Complex event processing in service-oriented architectures Continuous query processing in presence of web services Semi-structured data management and XML technology Types and logics for web services/clouds Innovative application scenarios for web services/clouds Data services Data centric process modeling === Submission Guidelines === Submissions must be original and should not have been published previously nor be under consideration for publication while being evaluated for this workshop. All papers must be submitted at the following submission site, handled by EasyChair, ----------- https://www.easychair.org/conferences/?conf=wsfm11 ----------- using the Springer LNCS style. Papers should not exceed 15 pages in length. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The workshop proceedings will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS). === Program Committee === Marco Carbone, IT University of Copenhagen, Denmark (co-chair) Jean-Marc Petit, University of Lyon/CNRS, France (co-chair) Karthikeyan Bhargavan INRIA, France Maria Grazia Buscemi IMT Lucca, Italy Marco Carbone IT University, Copenhagen, Denmark Florian Daniel Universita' di Trento, Italy Pierre-Malo Danielou Imperial College London, UK Giuseppe De Giacomo SAPIENZA Universita' di Roma, Italy Rocco De Nicola Universita' di Firenze, Italy Marlon Dumas University of Tartu, Estonia Jos? Luiz Fiadeiro University of Leicester, UK Xiang Fu Hofstra University, USA Serge Haddad ENS Cachan, France Sylvain Hall? Universit? du Qu?bec ? Chicoutimi, Canada Thomas Hildebrandt IT University of Copenhagen, Denmark Manuel Mazzara Newcastle University, UK Luca Padovani Universita' di Torino, Italy Jean-Marc Petit University of Lyon/CNRS, France Steve Ross-Talbot Pi4Tech, UK Hagen Voelzer IBM Research - Zurich, Switzerland Nobuko Yoshida Imperial College London, UK Fatiha Zaidi Universit? Paris-Sud XI, France Gianluigi Zavattaro Universita' di Bologna, IT === Contact === wsfm11 at easychair.org === Previous editions === WS-FM 2010 in Hoboken, co-chaired by Mario Bravetti and Tevfik Bultan WS-FM 2009 in Bologna, co-chaired by Cosimo Laneve and Jianwen Su WS-FM 2008 in Milan, co-chaired by Roberto Bruni and Karsten Wolf WS-FM 2007 in Brisbane, co-chaired by Marlon Dumas and Reiko Heckel WS-FM 2006 in Wien, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2005 in Versailles, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2004 in Pisa, co-chaired by Mario Bravetti and Gianluigi Zavattaro From cristina.pereira at informatics-europe.org Wed Apr 27 09:52:05 2011 From: cristina.pereira at informatics-europe.org (Cristina Pereira) Date: Wed, 27 Apr 2011 15:52:05 +0200 Subject: [TYPES/announce] 2011 Curriculum Best Practices Award - DEADLINE MAY 1st! Message-ID: <4DB81F85.50104@informatics-europe.org> Dear Colleagues, We would like to remind about the 2011 Informatics Europe Curriculum Best Practices Award (see info below) and call your attention for the near deadline of proposal abstract submissions: _*1 May 2011.*_ Best regards, Cristina Pereira Informatics Europe Secretary-General ------------------------------------------------------------------------ *2011 Informatics Europe Curriculum Best Practices Award* Informatics Europe proudly announces the *2011 Curriculum Best Practices Award*, devoted to curriculum initiatives in the area of *Parallelism and Concurrency*. * *The Informatics Europe Curriculum Best Practices 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 parallelism and concurrency * 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 collaboration, student projects, textbooks, influence on the curriculum of other universities. The 2011 Award is devoted to curriculum initiatives in the general area of parallelism and concurrency. It is funded through a generous grant from Intel Corporation.* _The amount of the Award is EUR 30,000.00_*__ The Award can be awarded 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). *Proposals should be submitted only at**: **http://www.easychair.org/conferences/?conf=informaticseuropebes * * **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); * Up to 5 letters of support. The letter of support will play an important role in the evaluation and may come from (for example) department management, academic colleagues in the same or another institution, industry colleagues; * A reference list (which may include URLs of supporting material) (max 3 pages). * Deadlines:* _Abstract:***May 1, 2011*_ *__ * Full proposal: *June 1, 2011* Notification of winner(s):*August 1, 2011* The Award will be presented at the 7^th European Computer Science Summit, in Milan, 7-9 November 2011, 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:* ** Michel Raynal, IRISA/University of Rennes 1 (chair) Gregor Engels, University of Paderborn (vice-chair) Gregory Andrews, University of Arizona MordechaiBen-Ari, Weizmann Institute Thomas Gross, ETH Zurich Dan Grossman, University of Washington Rachid Guerraoui, EPF Lausanne Mark Harris, Intel Jeff Kramer, Imperial College Walter Tichy, University of Karlsruhe Akinori Yonezawa, University of Tokyo *For full details visit:* www.informatics-europe.org/curriculum-award *For further inquires:* ie-curriculum-award at informatics-europe.org -- ------------------------------------------------------------------------ Dr. Cristina Pereira Informatics Europe Clausiusstrasse 59 8092 Zurich Switzerland Tel: +41 44 633 9374 Cell: +41 77 455 2370 Fax: +41 44 632 1435 Skype: cris-zh-work cristina at informatics-europe.org ------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From cristi at ifi.uio.no Thu Apr 28 05:27:14 2011 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Thu, 28 Apr 2011 11:27:14 +0200 Subject: [TYPES/announce] call for abstracts: Doctoral Symposium at FCT 2011 Message-ID: I am sorry if you receive this announcement through several means. Please forward this call for abstracts and presentations to interested students in your group or department. --------------------------------------------------------------------- Call for Abstracts Doctoral Symposium affiliated with the 18th International Symposium on Fundamentals of Computation Theory Oslo, NORWAY August 26, 2011 web: http://fct11.ifi.uio.no/index.php?n=Workshops.DoctoralSymposium ----- Description of the Event ----- The aim of the Doctoral Symposium @ FCT'11 is to provide a platform for PhD students and young researchers who recently completed their doctoral studies, to present new results related to the foundations of computing theory and receive feedback on their research. Excellent master students working in theoretical fields of CS are also encouraged to contribute. Moreover, the DS wants to offer students the opportunity to attend talks in the main conference and to interact with established researchers in their fields. It is warmly encouraged that FCT participants attend the DS also. A non-exhaustive list of topics of interest is available at the FCT home. http://fct11.ifi.uio.no The acceptance of the presentations is based on a two page abstract (incl. references). The accepted abstracts will be available at the workshop and published together in a technical report by the University of Oslo. It is allowed (and encouraged) to send results that have been published at other conferences or journals or that are work in progress. Acceptance is conditioned on one of the student authors holding a 15-25 min (exact time slot to be decided later) presentation in the doctoral symposium. Student reductions of participation fees and scholarships are planned; see the registration page for updates. ----- Important Dates ----- Submission Deadline: Sunday, 12. June 2011 Author Notification: Sunday, 26. June 2011 Camera ready abstract: Friday 1. July 2011 DS day: Friday 26. August 2011 FCT days: 22 - 25. August 2011 ----- Submissions ----- Authors are encouraged to submit a 2 page extended abstract prepared according to Springer's guidelines for the LNCS series, preferably using LaTeX with the llncs document class. Please do not modify font size, spacing, margins, etc of the llncs document class. The abstracts should be authored by young researchers (i.e., PhD students, excellent master students, or researchers that defended their PhD in 2010). If a senior researcher (like supervisor) must be listed as author, her/his contribution to the present abstract should be minimal and should be backed by a letter sent by her/him via e-mail to the organizers of the doctoral symposium stating this fact. Please submit your paper as a PDF file using the EasyChair system at the link below (the page will be opened for submissions on 1st June): https://www.easychair.org/conferences/?conf=dsfct2011 ----- Submission Guidelines ----- Do NOT use runningheaders (i.e., your documentclass declaration could look like this: \documentclass[10pt]{llncs}). The submitted abstracts are encouraged to follow an outline like: 1. Problem Description and Motivation: Describe the research problem you are addressing and motivate why this is relevant for FCT community. 2. Brief Overview of Related Work: Briefly argument that this problem and your work has not been done by others before. Possibly discuss the gaps in the current related research literature. 3. Proposed Solution: Give a high-level overview of your proposed solution to the problem identified in part 1. Describe any hypotheses that you have formulated. Describe the research method you are using or plan to use. ----- Program Committee ----- Sergiu Bursuc (U. of Birmingham, UK) Andrea Corradini (U. of Pisa, Italy) Clemens Grabmayer (Utrecht University, Netherlands) Magne Haveraaen (U. of Bergen, Norway) Martin Leucker (T.U. Munchen, Germany) Andrzej Lingas (Lund University, Sweden) Daniel Lokshtanov (U. of California, USA) Cristian Prisacariu (U. of Oslo, Norway) Gerardo Schneider (U. of Gothenburg, Sweden) Alexandra Silva (CWI, The Netherlands) Tomoyuki Suzuki (U. of Leicester, UK) Edsko de Vries (Trinity College, Ireland) ----- For further advertising one may use this .txt CFP, downloadable at http://fct11.ifi.uio.no/documents/cfp_DS_FCT11.txt or the .pdf posters http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A4.pdf (A4 format) http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A3.pdf (A3 format) ----- From might at cs.utah.edu Fri Apr 29 09:56:48 2011 From: might at cs.utah.edu (Matt Might) Date: Fri, 29 Apr 2011 09:56:48 -0400 Subject: [TYPES/announce] CFP: Scheme and Functional Programming (co-located with SPLASH 2011) Message-ID: DEADLINE: 15 June 2011 WEBSITE: http://scheme2011.ucombinator.org/ The annual workshop on Scheme and Functional Programming solicits submissions related to Scheme and functional programming. We also welcome submissions related to dynamic or multiparadigmatic languages and programming techniques. The following topics are especially encouraged: compiler-implementation techniques; compiler optimization; data structures; domain-specific languages; contracts; commerical applications of Scheme; garbage-collection; language-based security; language design; macros and hygiene; mixing static and dynamic typing; module systems; static analysis; semantics; syntactic extensibility; tools and packages; and web-based development. For more information, please see: http://scheme2011.ucombinator.org/ Matt Might, 2011 Chair From aaron.stump at gmail.com Fri Apr 29 11:39:32 2011 From: aaron.stump at gmail.com (Aaron Stump) Date: Fri, 29 Apr 2011 10:39:32 -0500 Subject: [TYPES/announce] deadline extension: PxTP '11 Message-ID: We have extended the deadline to Wednesday, May 11th, for this workshop, which should be relevant to types-announce readers interested in proofs and proof checking. Aaron and Pascal -------------------------------------------------------------------------------------------------------------------------- The First International Workshop on Proof Exchange for Theorem Proving (PxTP) http://pxtp2011.loria.fr/ associated with The Conference on Automated Deduction (CADE), 2011. -------------------------------------------------------------------------------------------------------------------------- The goal of this new 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, tool papers or experience reports * 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. 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=pxtp2011 and follow the instructions there. PxTP will have no formal proceedings, but we anticipate a joint open call, together with the PSATTT workshop (also at CADE 2011), for a special issue of a journal with PxTP and PSATTT post-proceedings. -------------------------------------------------------------------------------------------------------------------------- Important dates Submission of papers: May 11th, 2011 (Extended) Notification: May 30th, 2011 Camera ready versions due: June 27th, 2011 Workshop: August 1st, 2011 -------------------------------------------------------------------------------------------------------------------------- Organizers Pascal Fontaine (INRIA, University of Nancy) Aaron Stump (The University of Iowa) Program Committee Clark Barrett (New York University) Christoph Benzm?ller (Articulate Software) Sacha B?hme (Technische Universit?t M?nchen) Amy Felty (University of Ottawa) Pascal Fontaine (INRIA, University of Nancy) Leonardo de Moura (Microsoft research) Hans de Nivelle (University of Wroc?aw) David Pichardie (INRIA Rennes) Stephan Schulz (Technische Universit?t M?nchen) Aaron Stump (The University of Iowa) Geoff Sutcliffe (University of Miami) Laurent Th?ry (INRIA) Tjark Weber (University of Cambridge) Bruno Woltzenlogel Paleo (Technische Universit?t Wien) -------------------------------------------------------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From urzy at mimuw.edu.pl Fri Apr 29 18:28:30 2011 From: urzy at mimuw.edu.pl (=?UTF-8?B?UGF3ZcWCIFVyenljenlu?=) Date: Sat, 30 Apr 2011 00:28:30 +0200 Subject: [TYPES/announce] "Types for Proofs and Programs" - deadline extension Message-ID: <4DBB3B8E.8030508@mimuw.edu.pl> Several authors requested an extension of the submission deadline for LMCS special issue "Types for Proofs and Programs" Therefore we offer the following schedule: Title and abstract: May 2 Full paper: May 16 Further extensions are negotiable, but please notify us as soon as possible. Henk Barendregt, Pawel Urzyczyn - special issue editors. From stavros.tripakis at gmail.com Fri Apr 29 20:08:03 2011 From: stavros.tripakis at gmail.com (Stavros Tripakis) Date: Fri, 29 Apr 2011 17:08:03 -0700 Subject: [TYPES/announce] 2nd CFP: FORMATS 2011, 21-23 Sep 2011 In-Reply-To: References: Message-ID: ? ? ? ? ? ? ? ? ? ? 2nd CALL FOR PAPERS ? ? ? ? ? ? ? ? ? ? ? ?FORMATS ?2011 ? ? ? ? ? ? ? 9th International Conference on ? ? ? ?Formal Modeling and Analysis of Timed Systems ? ? ? ? ? ? ? ?Phonix Hotel, Aalborg, Denmark ? ? ? ? ? ? ? ? ? ? 21-23 September 2011 ? ? ? ? ? ? ? ?http://formats2011.cs.aau.dk/ NEWS New location Registration fee: 275 Euro Social program incl. viking dinner IMPORTANT DATES Abstract submission: 15 May 2011 Paper submission: 22 May 2011 Notification: 20 June 2011 Final version due: 10 July 2011 INVITED SPEAKERS Rajeev Alur, University of Pennsylvania Boudewijn Haverkort, University of Twente / Embedded Systems Institute Oded Maler, VERIMAG 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, type systems). - 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). - Applications: Adaptation and specialization of timing technology in application domains in which timing plays an important role (e.g. real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication). For more information, see: http://formats2011.cs.aau.dk/ From iliano at cmu.edu Mon May 2 04:05:48 2011 From: iliano at cmu.edu (Iliano Cervesato) Date: Mon, 02 May 2011 11:05:48 +0300 Subject: [TYPES/announce] Postdoctoral Positions on Ensemble Programming Message-ID: <4DBE65DC.7060501@cmu.edu> Postdoctoral Positions on Ensemble Programming (further details at www.qatar.cmu.edu/iliano/projects/ripple) The School of Computer Science at Carnegie Mellon University seeks applications for two postdoctoral fellow positions on effective programming for large distributed ensembles. These positions target complementary expertise towards the synergistic 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 below for a detailed description of each position. See also the project page for publications and links related to the project. One position will be based on the Qatar campus of CMU and the other on its Pittsburgh campus, with travel between the two. The research will be conducted under the supervision of Prof. Iliano Cervesato in Qatar and Prof. Seth Goldstein in Pittsburgh. To apply, send a cover letter, a CV and a list of references in PDF format to seth at cs.cmu.edu and iliano at cmu.edu. Additional material will be requested as needed. Position in Qatar (effective immediately) Ideal applicants bring together a strong theoretical background and a keen interest in turning new theoretical developments into practical applications. Specifically, applicants for this position should have an established research record in some combination of the following fields: * multiset/term rewriting * concurrency * massively distributed systems * programming language design/implementation * linear logic * logic programming * swarm robotics Why would I go to Qatar? We are an integral part of the School of Computer Science of Carnegie Mellon University in Pittsburgh. With some 30 people, equally divided among faculty, postdocs and research staff, the Computer Science group at Carnegie Mellon Qatar is comparable to the best mid-size CS departments around the world. Indeed, we publish our research in the same venues, go to the same conferences, and interact in the same way with our colleagues worldwide. Differently from many mid-size CS departments, we are committed to and have the resources for significant further growth. A postdoc in the CS group at CMU Qatar has the opportunity not only to do cutting edge research with world-renowned experts, but also to be part of a new dynamic environment, to gain responsibilities that go well beyond the typical postdoc experience, and to contribute to the growth of CMU Qatar. All former CMU Qatar postdocs are enjoying successful careers in academia or in industry (at Google, in startups). The position in Qatar offers a highly competitive salary, a foreign service premium, excellent international health care coverage, and allowances for housing, transportation, and travel. Benefits may vary with contract type. The position comes with support for conferences and equipment. Postdocs are encouraged to explore research ideas on top of and beyond the project description. The positions provide significant opportunities for professional development. About CMU Qatar In 2004, Carnegie Mellon University established a branch campus in Qatar with the goal of promoting the same high standards of research and education as its original Pittsburgh campus. CMU Qatar is located in Education City, an ultramodern 2,500 acre campus which currently hosts branches of six of the world's leading universities. The campus provides cutting-edge research facilities in a dynamic and multidisciplinary environment. Carnegie Mellon Qatar is located in Qatar's capital, Doha, an up-and-coming modern city with easy access to the world. Qatar is a small country on the East coast of the Arabian peninsula. Its abundant reserves of natural gas have resulted in it having a GDP per capita among the highest in the world. It is cosmopolitan, vibrant, yet pleasant and safe. And of course, it was recently selected to host the 2022 FIFA World Cup Position in Pittsburgh (We will start accepting applications for the Pittsburgh position only after the Qatar position has been filled.) Ideal applicants bring together a strong systems background and a keen interest in developing highly experimental systems. Specifically, applicants for this position should have an established research record in some combination of the following fields: * distributed systems * embedded systems * programming language implementation * reconfigurable computing * swarm robotics The position in Pittsburgh offers the standard benefits of a postdoctoral fellowship in the USA. -- Iliano Cervesato www.qatar.cmu.edu/~iliano/ Associate Professor Carnegie Mellon University From jonathan.aldrich at cs.cmu.edu Mon May 2 12:10:18 2011 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Mon, 02 May 2011 12:10:18 -0400 Subject: [TYPES/announce] summer REU at CMU Message-ID: <4DBED76A.3030209@cs.cmu.edu> I am looking for undergraduate students for a type systems-related Research Experience for Undergraduates (NSF REU) this summer at Carnegie Mellon University. Due to NSF eligibility requirements, applicants must be a US citizen or permanent resident. Two possible projects are listed below. Interested students please send me their resume at jonathan.aldrich at cs.cmu.edu Thanks, Jonathan Aldrich - - - - - - DESIGN AND IMPLEMENTATION OF THE PLAID LANGUAGE AND ITS TYPE SYSTEM Plaid is a new general-purpose programming language that has a type system based on affine logic, and leverages those types to build typestate and implicit concurrency into the language. In Plaid, a state is like a class, with methods and fields, except that the state of an object can change over time. This supports interesting new ways of designing programs, and creates new challenges for efficient implementation and for a practical type system that can statically track the changing state of objects. We are looking for students to work on a compiler and typechecker for the language, as well as involvement in the language design and the type theory for students with the right background. For more information: http://www.plaid-lang.org/ http://www.cs.cmu.edu/~aldrich/reu/ jonathan.aldrich at cs.cmu.edu IMPROVED ERROR MESSAGES IN THE FUSION PROTOCOL CHECKER Our studies of industrial software frameworks has shown that the protocols to use them are extremely complex and easy for programmers to misuse. To prevent developers from misusing these protocols, we created the Fusion system. Fusion allows framework developers to specify the complex protocols to use the framework, using a type-based formalism, and an associated type-based static analysis runs at compile time to ensure that plugins meet these specifications. This summer research project will seek to make the error messages of Fusion more understandable through visualizations and through task-directed error messages. Questions to be investigated include how to describe the heap configuration in which an error occurs, and suggesting fixes for incorrect specifications or buggy code. The project is a particularly good match for students who have experience with software frameworks, and are interested in a broad range of software engineering and type systems research. For more information: http://www.plaid-lang.org/ jonathan.aldrich at cs.cmu.edu From morawska at tcs.inf.tu-dresden.de Tue May 3 08:13:19 2011 From: morawska at tcs.inf.tu-dresden.de (Barbara Morawska) Date: Tue, 3 May 2011 14:13:19 +0200 Subject: [TYPES/announce] UNIF 2011: deadline extension Message-ID: The deadline for paper submission for UNIF has been extended till May 8, 2011. We expect abstracts of up to 5 pages. UNIF 2011 - The International Workshop on Unification. https://sites.google.com/a/cs.uni.wroc.pl/unif-2011/ Important Dates May 8, 2011 - Extended deadline for paper submission May 30, 2011 - Notification June 17, 2011 - Final versions July 31, 2011 - Workshop This year Unif is co-located with the CADE conference http://cade23.ii.uni.wroc.pl/, which is going to take place in Wroclaw (Poland), 31 July -5 August 2011. Franz Baader Barbara Morawska Jah Otop ----------------------------------------------- UNIF 2011 Organization Committee -------------- next part -------------- An HTML attachment was scrubbed... URL: From Lutz.Schroeder at dfki.de Wed May 4 08:17:20 2011 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Wed, 04 May 2011 14:17:20 +0200 Subject: [TYPES/announce] FHIES 2011 Second Call for Papers Message-ID: <4DC143D0.5080306@dfki.de> [Thanks for circulating the call for papers below, which may be of interest to readers of the types list through the relationship of types to formal methods. -- Lutz] ------------------------------------------------------------------------ FHIES 2011 International Symposium on Foundations of Health Information Engineering and Systems (http://www.iist.unu.edu/ICTAC/FHIES2011/) 27-29 August 2011 Mabalingwe Nature Reserve, South Africa (Colocated with ICTAC 2011) Information and communication technology plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world, that are the concern of the United Nations, its Peoples and Members States. The use of software in medical devices is already raising issues in relation to safety and efficacy for manufacturers and regulators. Health information systems raise issues of both privacy and confidentiality, on the one hand, and, increasingly, patient safety on the other. Hospital and other information systems raise important issues of efficacy and interoperability. However, to capitalize on the potential of this technology in reshaping healthcare demands focused research on sound and safe development techniques from software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. Aims ===== The purpose of the new symposium series on Foundations of Software Engineering Health Informatics (FHIES) is to promote a nascent research area that aims to develop and apply theories and techniques in computing science and software engineering to modelling, building and certifying software based systems in the application domain of healthcare. Many of these systems are already regulated in many jurisdictions and many more of them will become regulated in the future. Research on theories, techniques and tools of software modelling, verification and validation has been an important area of computer science and software engineering, known as Formal Methods. This research addresses the challenging problem of design and certification of safety or mission critical software systems through abstraction and decomposition techniques based on the use of mathematical modelling theories and sound engineering methods. Formal methods have primarily addressed the correctness of systems used in the industrial, financial, and defense applications. However, they have recently found application in modelling and analysis of complex systems that involve interacting behaviour of many kinds of objects and agents, including software systems, physical objects and humans. The models of these systems have both discrete and continuous behaviour, and both qualitative and quantitative (e.g., spatial timing and probabilistic) properties. It is believed that these methods can be used for modelling problems of health informatics, which presents the challenge of scalability. Software plays a critical role in sustainable health care, both as part of the solution and as part of the problem. Software intensive information systems are needed to support the collection and processing of vast amounts of data via different devices, and allow policy makers to access and share these data, and to support their decision making and validation. Software systems can be developed for managing, controlling and monitoring policies, processes and workflows in medical systems. Software systems can be developed to help create the sophisticated medical devices that are simply impossible to build without the software. On the other hand, the application of software raises challenging issues in safety, security and privacy, and increases the complexity of healthcare workflows and the need for new business policies. Paper Submissions ============== We solicit high quality submissions reporting on 1. original research contributions (18 pages maximum in LNCS format) 2. application experience, case studies and software prototypes (18 pages maximum in LNCS format) 3. surveys, comparisons, and state-of-the-art reports (18 pages maximum in LNCS format) 4. position papers that define research projects with identified challenges and milestones (10 pages maximum in LNCS format) 5. proposals for panel discussions, with at least three named panellists, about a topical question (5 pages maximum in LNCS format). All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions should be in English, prepared in the LNCS format (see here for details). Submission constitutes a commitment to attend and present a paper, if accepted. All accepted papers will be included in the pre-event proceedings of the symposium and considered for EXCEPT FOR the proposals for panel discussions inclusion in a special issue of the Springer Innovations in Systems and Software Engineering (ISSE), following revision and re-review.. The post proceedings will include a brief summary of panel discussions. Important Dates =========== Abstract Submission 29 May 2011 Paper Submission 5 June 2011 Notification of acceptance 18 July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 Organization ========= General Chairs * Peter Haddawy, UNU-IIST, Macao * Tom Maibaum, McMaster University, Canada Programme Chairs * Zhiming Liu, UNU-IIST, Macao * Alan Wassyng, McMaster University, Canada Organising Chair * Hao Wang, UNU-IIST, Macao Program Committee * Syed Mohamed Aljunid, UNU-IIGH * Sebastian Fischmeister, University of Waterloo, Canada * Peter Haddawy, UNU-IIST, Macao * Jozef Hooman, Embedded Systems Institute and Radboud University Nijmegen, The Netherlands * Michaela Huhn, TU Clausthal, Germany * Mark Lawford, McMaster University, Canada * Insup Lee, University of Pennsylvania, USA * Martin Leucker, TU Munich, Germany * Wendy MacCaull, St. Francis Xavier University, Canada * Tom Maibaum, McMaster University, Canada * Dominique Mery, LORIA and Universite Henri Poincare Nancy 1, France * Jun Pang, University of Luxembourg, Luxembourg * David Robertson, University of Edinburgh, UK * Lutz Schr?der, DFKI Bremen and University of Bremen, Germany * Jens H. Weber, University of Victoria, Canada * Liang Xiao, Hubei University of Technology, P.R.China ---------------------------------------------------------------------------- -- -------------------------------------- Prof. Dr. Lutz Schr?der Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder at dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum f?r K?nstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch?ftsf?hrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From c.grelck at uva.nl Wed May 4 09:09:24 2011 From: c.grelck at uva.nl (Clemens Grelck) Date: Wed, 04 May 2011 15:09:24 +0200 Subject: [TYPES/announce] CFP: RACORE 2011 - Resource Adaptive Compilation and Runtime Environments Message-ID: <4DC15004.8030200@uva.nl> RACORE2011 Resource Adaptive Compilation and Runtime Environments http://csa.science.uva.nl/racore2011 A mini-symposium held in conjunction with ParCo2011 Ghent University, Belgium 30 August - September 2011 RACORE2011 is a mini-symposium organized in conjunction with the Parallel Computing conference ParCo2011, to be held in Ghent, Belgium on 30 August - 2 September 2011. Scope ----- The computing landscape is diversifying. On most computing platforms, the number and properties of available computing resources differ, both over space and over time. Space heterogeneity arises in commodity hardware from diverse core counts and combinations of CPUs with companion processors like GPGPUs, streaming units as in IBM's Cell processor or specialised hardware. Time heterogeneity arises from frequency scaling, hardware faults, and dynamic addition or removal of hardware components. Deploying software to such diverse targets inevitably needs to factor in resource adaptability, especially at run-time. The RACORE symposium addresses dynamic adaptation of programs and operating systems to changes in resource availability at run time, either when applications are started or during their execution. We foresee adaptation ranging from, but not limited to, changes to the mapping of computation to resources, adjusting the level of exhibited concurrency, reacting to energy constraints, possibly down to hardware reconfiguration. We solicit papers on all aspects of dynamic adaptation to resource constraints. Topics include but are not limited to: - adaptive mapping of applications to resources (e.g. the set of applications or the set of resources evolves over time) - dynamically adapting code / just-in-time compilation - adaptation of program concurrency at run-time - dynamic trade-offs for resource consumption (e.g. cores vs. memory) - adaptation to comply with energy budgets - dynamically evolving computation resources - dynamically evolving input/output requirements or channel properties Papers ------ Authors are invited to submit a full paper (up to 8 pages) or an extended abstract (at least 2 pages) using the EasyChair submission system. Details regarding the format and other author guidelines are given on the submission page. Deadline for the submission is 15 June 2011. More information: http://csa.science.uva.nl/racore2011/submission/ Committees ---------- Organizing committee: - Raphael Poss, University of Amsterdam. NL - Frank Penczek, University of Hertfordshire, UK - Stephan Herhut, Intel, USA - Clemens Grelck, University of Amsterdam, NL - Sven-Bodo Scholz, University of Hertfordshire, UK - Chris Jesshope, University of Amsterdam, NL Program committee: - Chris Jesshope, University of Amsterdam, NL - Clemens Grelck, University of Amsterdam, NL - Sven-Bodo Scholz, University of Hertfordshire, UK - Alex Shafarenko, University of Hertfordshire, UK - Mats Brorsson, KTH Sweden - Albert Cohen, INRIA France - Benedict Gaster, AMD USA - James P. Held, Intel, USA - Stephan Herhut, Intel, USA - Brad Chamberlain, Cray, USA - John Reppy, University of Chicago, USA - Lei Zhang, ICT, CAS, China Important dates: - June 15th: Deadline for submission - July 22nd: Notification of acceptance - August 22nd: Final papers due -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 Universitair Docent 1098 XH Amsterdam Nederland Universiteit van Amsterdam Instituut voor Informatica T +31 (0) 20 525 8683 F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From freek at cs.ru.nl Wed May 4 09:12:28 2011 From: freek at cs.ru.nl (Freek Wiedijk) Date: Wed, 4 May 2011 15:12:28 +0200 Subject: [TYPES/announce] Call for bids ITP 2012 Message-ID: <20110504131228.GA14070@cs.ru.nl> It is time to begin the process of selecting a host for ITP 2012, the International Conference on Interactive Theorem Proving. Following tradition from TPHOLs, the hosts of the previous conference (ITP 2011) are running the process. There are two phases: solicitation of bids and voting. This message concerns the first phase. A long-standing TPHOLs convention is that the conference should be held in a continent different from the location of the previous meeting, and therefore no bids to host ITP 2012 in Europe will be accepted. Based on ITP and TPHOLs history, ITP 2012 will likely be held in July, August or September. Bids should be sent to itp2011 at easychair.org and should include at least the following information: - name and email address of a contact person - names of other people involved - address of website for the bid - approximate dates of the conference - structure (e.g., k workshop days and n days of presentations followed by excursion...) - advantages of the proposed venue An example of a previous winning bid is here: http://itp2011.cs.ru.nl/ITP2011/Bid_ITP11.html Deadline for all bids is Monday, 30 May 2011. Shortly after that, the bids will be made public and the voting phase will take place. The people eligible to vote are those who are seriously thinking of attending ITP 2012. The voting system used will be Single Transferable Vote between all received bids. Marko van Eekelen Herman Geuvers Julien Schmaltz Freek Wiedijk From freek at cs.ru.nl Wed May 4 09:20:01 2011 From: freek at cs.ru.nl (Freek Wiedijk) Date: Wed, 4 May 2011 15:20:01 +0200 Subject: [TYPES/announce] Call for Papers ACL2 2011 Message-ID: <20110504132001.GA14249@cs.ru.nl> Call for Papers ACL2 2011: 10th International Workshop on the ACL2 Theorem Prover and Its Applications 3-4 November 2011, Austin, TX, USA http://www.cs.ru.nl/~julien/acl2-11/ ----- Important dates ------------ Abstract submission: 13 June2011 Paper submission: 20 June 2011 Author notification: 25 July 2011 Final version: 02 September 2011 Scope of the workshop ------------------ ACL2 2011 is a major forum for the users of the ACL2 theorem proving system to present research related to the ACL2 theorem prover and its applications. ACL2 2011 is the tenth in the series of workshops, occurring at approximately 18-month intervals. ACL2 is a state-of-the-art automated reasoning system, the latest in the Boyer-Moore family of theorem provers, for which its authors received the 2005 ACM Software Systems Award. ACL2 2011 is planned as a two-day workshop to be held in Austin, TX, USA, on 3-4 November 2011. ACL2 2011 is affiliated with FMCAD 2011, the eleventh International Conference on Formal Methods in Computer Aided Design (http://www.cs.utexas.edu/users/ragerdl/fmcad11/). In addition to paper presentations, ACL2 2011 is anticipated to include several rump sessions discussing ongoing research. We invite submission of papers on any topic related to ACL2 and its applications. We strongly encourage the participation of users of other theorem provers and researchers and practitioners interested in theorem proving technology. Paper categories ------------- Papers presented at the workshop will be assigned to one of the following categories. At the time of submission, please indicate to which category you think your paper belongs. If you are not sure about the category for your paper, simply submit the paper to the "Other" category. ** Wizard spells ** (new) Let the wizards reveal their spells! Wizard spell papers must present detailed proof techniques. They illustrate the use of ACL2 features, general proof patterns, and advanced proof strategies. The objectives are to help new users, to share the expertise of ACL2 "power users", and hopefully to inspire and help other users. ** Applications ** Applications have played an important role in the development of ACL2. ACL2 2011 welcomes papers reporting about user experiences in hardware and software verification, formalization of mathematics, teaching, but also in emerging or novel areas. ** What's new ? ** Papers of this category will present updates about the ACL2 systems and related systems, like ACL2s, ACL2(r) or ACL2(h). Papers may present new system capabilities, features, or interfaces. ** Other ** All papers that do not fit in any of the above categories belong to this category. ** Short and long papers ** In all categories, ACL2 2011 welcomes long (10 pages) and short (4 pages) papers. Paper submission -------------- Submissions must be made electronically in PDF format through Easy Chair. The corresponding webpage can be found on the ACL2 2011 website. Submissions must use ACM SIG Proceedings format with letter-size paper (see http://www.acm.org/sigs/pubs/proceed/template.html). The proceedings are expected to be published in the ACM Digital Library (pending). Authors may assume that the audience has a working knowledge of ACL2's syntax, basic commands, and modeling techniques. Papers should contain a short abstract of about 150 words, clearly stating the contribution of the submission. Papers should be self-contained, but we strongly encourage authors to follow the tradition (where applicable) of providing ACL2 "books", or script files, with instructions for their execution. For accepted papers, these books will be mirrored from the ACL2 Home Page and included in the future ACL2 distributions. At least one author of each accepted paper will be required to register for the workshop and present the paper. 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 AOE (Anywhere On Earth) -------------------------------- Abstract Submission: 13 June 2011 Paper Submission: 20 June 2011 Author Notification: 25 July 2011 Final Version: 02 September 2011 Workshop: 03-04 November 2011 Web page -------- http://www.cs.ru.nl/~julien/acl2-11/ Conference co-chairs ----------------- David S. Hardin (Rockwell Collins) Julien Schmaltz (Open University of the Netherlands) Program Committee ---------------- John Cowles (Univ. Wyoming, USA) Mike Gordon (Cambridge Univ., UK) David Greve (Rockwell Collins, USA) David Hardin (Rockwell Collins, USA) Warren Hunt (UT Austin, USA) Matt Kaufmann (UT Austin, USA) Panagiotis Manolios (Northeastern Univ., USA) Francisco-Jesus Martin-Mateos (Univ. of Sevilla, Spain) John Matthews (Galois, USA) Cesar Munoz (NASA, USA) Rex Page (Univ. of Oklahoma, USA) Laurence Pierre (TIMA Labs., France) Sandip Ray (UT Austin, USA) David Russinoff (AMD, USA) Jun Sawada (IBM, USA) Julien Schmaltz (Open Universiteit, The Netherlands) Natarajan Shankar (SRI, USA) Sol Swords (Centaur, USA) Freek Wiedijk (Radboud Univ. Nijmegen, The Netherlands) From ricardo at sip.ucm.es Thu May 5 04:42:28 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Thu, 05 May 2011 10:42:28 +0200 Subject: [TYPES/announce] TFP 2011: Call for participation (May 16th-18th) Message-ID: <4DC262F4.60809@sip.ucm.es> -------------------------------------------------------- CALL FOR PARTICIPATION 12th International Symposium Trends in Functional Programming 2011 Madrid, Spain May 16-18, 2011 http://dalila.sip.ucm.es/tfp11 -------------------------------------------------------- --------------------- About TFP 2011 --------------------- 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. TFP 2011 will be held in Madrid (Spain), on May 16th-18th, in the premises of the Computer Science Faculty of the Universidad Complutense de Madrid, one of the biggest universities in Europe (85.000 students). A visit to Toledo, (a well preserved Middle Age city, capital of Spain in the XVI century), is foreseen in the social program. Immediately after TFP 2011, the 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) (http://dalila.sip.ucm.es/fopara11/) will be held in the same location. --------------------- Registration --------------------- Registration on-line is possible at http://dalila.sip.ucm.es/tfp11/?page_id=137 --------------------- Invited talk --------------------- Neil Mitchell http://community.haskell.org/~ndm/ Finding functions from types --------------------- Accepted papers --------------------- Thomas Schilling. Constraint-free Type Error Slicing. Adam Gundry. Type Inference for Units of Measure. Julien Signoles. An OCaml Library for Dynamic Typing. Vladimir Komendantsky. Subtyping by folding an inductive relation into a coinductive one. Maria Christakis, Konstantinos Sagonas. Static Detection of Deadlocks in Erlang. Attila Gobi, Olha Shkaravska, Marko Van Eekelen. Size Analysis of Higher-Order Functions. Stefan Holdermans, Jurriaan Hage. Refinement Types for Pattern-match Analysis. Edwin Brady. Epic --- A Library for Generating Compilers. Laurence E. Day, Graham Hutton. Towards Modular Compilers for Effects. Jocelyn Serot, Greg Michaelson. Compiling Hume down to gates. Jean-Christophe Filliatre, K. Kalyanasundaram. Functory: A Distributed Computing Library for Objective Caml. Barnabas Kralik, Viktoria Zsok, Zoltan Istenes. An Application of D-Clean Distributed Functional Programming for the Navigation of Robots. Jost Berthold, Ken Friis Larsen, Fritz Henglein, Andrzej Filinski, Mogens Steffensen, Brian Vinter. Functional High Performance Financial IT - The HIPERFIT Research Center in Copenhagen. Mustafa Aswad, Phil. W. Trinder, Hans-Wolfgang Loidl. Architecture Aware Parallel Programming in Glasgow Parallel Haskell (GPH). Christopher Brown, Hans-Wolfgang Loidl, Kevin Hammond. Refactoring Parallel Haskell Programs. Silvia Clerici, Cristina Zoltan. Exploiting Parallelism by Customizing Evaluation. Michael Lesniak. Thread-safe Priority Queues in Haskell based on Skiplists. Milan Straka. Adams' Trees Revisited - Correct and Efficient Implementation. Marco T. Morazan. The Time of Space Invaders Will Come to Pass: A Video Game Journey from Structural Recursion to Accumulative Recursion in CS1. Jeroen Henrix, Rinus Plasmeijer, Peter Achten. GiN: a graphical language and tool for defining iTask workflows. Pieter Koopman, Rinus Plasmeijer. Effective Test Set Generation. Gergely Devai. Restricted Function Patterns. German Andres Delbianco, Mauro Jaskelioff, Alberto Pardo. Applicative Shortcut Fusion. Christoph Herrmann, Edwin Brady, Kevin Hammond. Dependently-typed Programming by Composition from Functional Building Blocks. --------------------- TFP 2011 organization --------------------- Symposium Organization Chair: Ricardo Pe~na --------------------- Sponsors --------------------- Computer Science Faculty, Universidad Complutense de Madrid Spanish Ministry of Science and Innovation From sobocinski at gmail.com Thu May 5 11:32:54 2011 From: sobocinski at gmail.com (Pawel Sobocinski) Date: Thu, 5 May 2011 16:32:54 +0100 Subject: [TYPES/announce] *SOS 2011* 2nd call for papers Message-ID: [Apologies for multiple postings] ********************************************************** SOS `11 - Structural Operational Semantics 2011 An Affiliated Workshop of CONCUR 2011 September 5, 2011, Aachen, Germany http://sos2011.ecs.soton.ac.uk/ ********************************************************** 2nd CALL FOR PAPERS ********************************************************** Submission of abstract: Friday 27th May 2011 Submission: Friday 3rd June 2011 ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - category theoretic approaches - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome - semantics for domain-specific languages and model-based engineering. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair (http://www.easychair.org/conferences/?conf=sos2011) by Wednesday, 3rd June 2011. Papers should take the form of a pdf file in EPTCS format (http://www.eptcs.org/), whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speaker --------------- Wan Fokkink (Vrije Universiteit Amsterdam, NL, joint with EXPRESS `11) Program Committee ----------------- Luca Aceto (Reykjavik, IS) Simon Bliudze (CEA LIST, FR) Filippo Bonchi (ENS Lyon & CNRS, FR) Fabio Gadducci (Pisa, IT) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL) Keiko Nakata (Talinn, EE) Michel Reniers (Eindhoven, NL, co-chair) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Daniele Varacca (Paris 7, FR) Important Dates --------------- Submission of abstract: Friday 27 May 2011 Submission: Friday 3 June 2011 Notification: Friday 1 July 2011 Final version: Friday 15 July 2011 Workshop: Monday 5 September 2011 From Klaus.Havelund at jpl.nasa.gov Thu May 5 23:16:53 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (318M)) Date: Thu, 5 May 2011 20:16:53 -0700 Subject: [TYPES/announce] [fm-announcements] RV 2011 - call for papers + tutorial and tool demo proposals In-Reply-To: Message-ID: International Conference on Runtime Verification (RV 2011) September 27 - 30, 2011 San Francisco, California, USA at the Historic Fairmont Hotel http://rv2011.eecs.berkeley.edu/ Runtime verification (RV) is concerned with monitoring and analysis of software or hardware system executions. The field is often referred to under different names, such as runtime verification, runtime monitoring, runtime checking, runtime reflection, runtime analysis, dynamic analysis, runtime symbolic analysis, trace analysis, log file analysis, etc. RV can be used for many purposes, such as security or safety policy monitoring, debugging, testing, verification, validation, profiling, fault protection, behavior modification (e.g., recovery), etc. A running system can be abstractly regarded as a generator of execution traces, i.e., sequences of relevant states or events. Traces can be processed in various ways, e.g., checked against formal specifications, analyzed with special algorithms, visualized, etc. Topics of interest include, but are not limited to: * program instrumentation techniques * specification languages for writing monitors * dynamic program slicing * record-and-replay * trace simplification for debugging * extraction of monitors from specifications * APIs for writing monitors * programming language constructs for monitoring * model-based monitoring and reconfiguration * the use of aspect oriented programming for dynamic analysis * algorithmic solutions to minimize runtime monitoring impact * combination of static and dynamic analysis * full program verification based on runtime verification * intrusion detection, security policies, policy enforcement * log file analysis * model-based test oracles * observation-based debugging techniques * fault detection and recovery * model-based integrated health management and diagnosis * program steering and adaptation * dynamic concurrency analysis * dynamic specification mining * metrics and statistical information gathered during runtime * program execution visualization * data structure repair for error recovery * parallel algorithms for efficient monitoring * monitoring for effective fault localization and program repair The RV series of events started in 2001, as an annual workshop. The RV'01 to RV'05 proceedings were published in ENTCS. Since 2006, the RV proceedings have been published in LNCS. In year 2010, RV became an international conference. Links to past RV events can be found at the permanent URL: http://runtime-verification.org INVITED SPEAKERS Dawson Engler, Stanford University Title: "Making finite verification of raw C code easier than writing a test case" Cormac Flanagan, University of California, Santa Cruz Title: "Efficient and Precise Dynamic Detection of Destructive Races" Wolfgang Grieskamp, Google Title: "Utilizing Protocol Contracts for Verifying Services in the Cloud" Sharad Malik, Princeton University Title: "Runtime Verification: A Computer Architecture Perspective" Vern Paxson, University of California, Berkeley Title: "Approaches and Challenges for Detecting Network Attacks in Real-Time" Steven P. Reiss, Brown University Title: "What is My Program Doing? Program Dynamics in Programmer's Terms" PAPER SUBMISSION RV will have two research paper categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. * Regular papers (up to 15 pages) should present original unpublished results. Applications of runtime verification are particularly welcome. A Best Paper Award (USD 300) will be offered. * Short papers (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (5-10 minutes) and poster sessions. In addition to short and regular papers, proposals for tutorials and tool demonstrations are welcome. Proposals should be up to 2 pages long. * Tutorial proposals on any of the topics above, as well as on topics at the boundary between RV and other domains, are welcome. Accepted tutorials will be allocated up to 15 pages in the conference proceedings. Tutorial presentations will be at least 2 hours. * Tool demonstration proposals should briefly introduce the problem solved by the tool and give the outline of the demonstration. Tool papers will be allocated 5 pages in the conference proceedings. A Best Tool Award (USD 200) will be offered. Submitted tutorial and tool demonstration proposals will be evaluated by the corresponding chairs, with the help of selected reviewers. All accepted papers, including tutorial and tool papers, will appear in the LNCS proceedings. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'11 to present the paper. Papers must be submitted electronically using the EasyChair system. A link to the electronic submission page will be made available on the RV'11 web page. IMPORTANT DATES June 5, 2011 - Submission of regular and short papers June 12, 2011 - Submission of tutorial and tool demonstration proposals July 24, 2011 - Notification for regular, short, and tool papers August 21, 2011 - Submission of camera-ready versions of accepted papers September 27-30, 2011 - RV 2011 Conference and tutorials ORGANIZERS Programme committee chairs: Sarfraz Khurshid (University of Texas at Austin, USA) Koushik Sen (University of California at Berkeley, USA) Local organization chairs: Jacob Burnim (University of California at Berkeley, USA) Nicholas Jalbert (University of California at Berkeley, USA) PROGRAM COMMITTEE Howard Barringer (University of Manchester, UK) Eric Bodden (Technical University Darmstadt, Germany) Rance Cleaveland (University of Maryland, USA) Mads Dam (Kungliga Tekniska h?gskolan, Sweden) Brian Demsky (University of California at Irvine, USA) Bernd Finkbeiner (Saarland University, Germany) Cormac Flanagan (University of California at Santa Cruz, USA) Patrice Godefroid (Microsoft Research Redmond, USA) Jean Goubault-Larrecq (ENS Cachan, France) Susanne Graf (Verimag, France) Radu Grosu (State University of New York at Stony Brook, USA) Lars Grunske (University of Kaiserslautern, Germany) Aarti Gupta (NEC Laboratories America, USA) Rajiv Gupta (University of California at Riverside, USA) Klaus Havelund (NASA/JPL, USA) Mats Heimdahl (University of Minnesota, USA) Gerard Holzmann (NASA/JPL, USA) Sarfraz Khurshid (University of Texas at Austin, USA) (co-chair) Viktor Kuncak (?cole Polytechnique F?d?rale De Lausanne, Switzerland) Kim Larsen (Aalborg University, Denmark) Martin Leucker (University of Luebeck, Germany) Rupak Majumdar (Max Planck Institute Germany and University of California at Los Angeles USA) Greg Morrisett (Harvard University, USA) Mayur Naik (Intel Berkeley Labs, USA) Brian Nielsen (Aalborg University, Denmark) Klaus Ostermann (University of Marburg, Germany) Corina Pasareanu (NASA Ames, USA) Wim De Pauw (IBM T. J. Watson, USA) Doron Peled (Bar Ilan University, Israel) Suzette Person (NASA Langley, USA) Gilles Pokam (Intel, Santa Clara, USA) Shaz Qadeer (Microsoft Research Redmond, USA) Derek Rayside (University of Waterloo, Canada) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Wolfram Schulte (Microsoft Research Redmond, USA) Manu Sridharan (IBM T. J. Watson, USA) Koushik Sen (University of California, Berkeley, USA) (co-chair) Peter Sestoft (IT University of Copenhagen, Denmark) Scott Smolka (State University of New York at Stony Brook, USA) Oleg Sokolsky (University of Pennsylvania, USA) Mana Taghdiri (Karlsruhe Institute of Technology, Germany) Serdar Tasiran (Koc University, Turkey) Nikolai Tillmann (Microsoft Research Redmond, USA) Shmuel Ur (Shmuel Ur Innovation, Israel) Willem Visser (University of Stellenbosch, South Africa) Mahesh Viswanathan (University of Illinois at Urbana-Champaign, USA) Xiangyu Zhang (Purdue University, USA) RV STEERING COMMITTEE Howard Barringer (University of Manchester, UK) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Insup Lee (University of Pennsylvania, USA) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Oleg Sokolsky (University of Pennsylvania, USA) ===================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From eijiro.sumii at gmail.com Fri May 6 04:52:49 2011 From: eijiro.sumii at gmail.com (Eijiro Sumii) Date: Fri, 06 May 2011 17:52:49 +0900 (JST) Subject: [TYPES/announce] ICFP Programming Contest 2011 Message-ID: <20110506.175249.126772773.sumii@ecei.tohoku.ac.jp> Dear Types subscribers, I believe this would be relevant to many people in the Types community. Thanks! Eijiro ---------------------------------------------------------------------- ICFP Programming Contest 2011 http://www.icfpcontest.org/ The ICFP Programming Contest 2011 is the 14th instance of the annual programming contest series sponsored by The ACM SIGPLAN International Conference on Functional Programming. This year, the contest starts at 00:00 June 17 Friday UTC (= 24:00 June 16 Thursday UTC) and ends at 00:00 June 20 Monday UTC (= 24:00 June 19 Sunday UTC). Unlike in previous years, there is no 24-hour lightning division. The task description will be published in this blog when the contest starts. Solutions to the task must be submitted online before the contest ends. Details of the submission procedure will be announced along with the contest task. This is an open contest. Anybody may participate except for the contest organizers and members of the same laboratory as the the contest chair's. No advance registration or entry fee is required. Participants may form teams. A team consists of every person who contributes ideas and/or code towards a submission. Teams may have any number of members. Individuals may only be members of a single team and teams may not divide or collaborate with each other once the contest has begun. Any programming language(s) may be used as long as the submitted program can be run by the judges on a standard Linux environment with no network connection. Details of the judges' environment will be announced later. There will be prizes for the first (US$1,000) and second ($500) place teams as well as a discretionary judges' prize ($500). There will also be a total of $6,000 travel support. (The prizes and travel support are subject to the budget plan of ICFP 2011 pending approval by ACM.) In addition, the organizers will declare during the conference that: - the first place team's language is "the programming language of choice for discriminating hackers", - the second place team's language is "a fine tool for many applications", - and the team winning the judges' prize is "an extremely cool bunch of hackers". Additional announcements about the contest will be made at http://www.icfpcontest.org/. Questions can be posted as comments to the blog or e-mailed to icfpc2011-blogger AT kb.ecei.tohoku.ac.jp (please replace AT with @). We look forward to your participation! The contest organizers: Hidehiko Abe, Yumi Arai, Kenichi Asai (observer), Noriko Hirota, Atsushi Igarashi (observer), Lintaro Ina, Kazuhiro Inaba, Arisa Iwai, Chihiro Kaneko, Shinya Kawanaka, Moe Masuko, Yasuhiko Minamide (observer), Ryosuke Sato, Yu Shibata, Yu Sugawara, Takeshi Tsukada, Kanae Tsushima, Yayoi Ueda, and Eijiro Sumii (chair). ---------------------------------------------------------------------- From f.rabe at jacobs-university.de Fri May 6 08:06:59 2011 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Fri, 6 May 2011 14:06:59 +0200 Subject: [TYPES/announce] Call for Papers: 3rd Workshop on Modules and Libraries for Proof Assistants (affiliated with ITP 2011) Message-ID: Third International Workshop on Modules and Libraries for Proof Assistants (MLPA'11) http://kwarc.info/frabe/events/mlpa-11/index.html Affiliated with ITP Nijmegen, The Netherlands, August 22-27, 2011 CALL FOR PAPERS ----------------------------------------------------------------------- Submission deadline: 20 June 2011 Author Notification: 1 July 2011 Final Version: 11 July 2011 Workshop day: 26 August 2011 ----------------------------------------------------------------------- MLPA'11 is the third International Workshop on Modules and Libraries for Proof Assistants. Previous meetings were held at CADE 2009 and at FLoC 2010. MLPA aims at bringing together researchers and practitioners with background and experience in module systems from different logic-based systems, such as theorem provers, proof assistants, and programming languages. It will provide a fertile venue for the exchange of ideas and experiences and has the potential to impact the way we organize proofs and programs in the future. We want to foster discussion of state-of-the-art results and techniques, from theory and practice of module systems. This includes but is not limited to: * The design of module systems for programming languages and proof systems. * System descriptions of existing module systems, for example ML modules, type classes, Coq's, Isabelle's, or Agda's module system. * The implementation of formal digital libraries. * Case studies regarding information retrieval, sharing, and management of change. * Experience reports of industrial practitioners, using e.g., HOL, PVS, or other proof assistants. Program Committee: * Gerwin Klein, NICTA * Dale Miller, INRIA * Brigitte Pientka, McGill University * Florian Rabe, Jacobs University Bremen (chair) * Claudio Sacerdoti Coen, University of Bologna * Carsten Sch?rmann, IT University of Copenhagen (chair) Submission Categories: * Category A: Detailed accounts of novel research - up to 15 pages. * Category B: Abstracts and short descriptions of current work and proposed directions - up to 5 pages. * Category C: System descriptions presenting an implemented tool and its features - up to 5 pages. Shorter papers are welcome. Submission is electronic via easychair. The submission site is https://www.easychair.org/conferences/?conf=mlpa11 Proceedings are published informally and will be available to the participants at the workshop. Formal post-proceedings will be considered depending on the number and quality of submissions. Authors of accepted papers are expected to present their work at the workshop. System descriptions should be accompanied with a demo. Organizers: Florian Rabe Carsten Schuermann f.rabe at jacobs-university.de carsten at itu.dk Jacobs University IT University of Copenhagen Bremen, Germany Copenhagen, Denmark From lengrand at lix.polytechnique.fr Fri May 6 09:24:27 2011 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Fri, 06 May 2011 15:24:27 +0200 Subject: [TYPES/announce] CfP - Deadline extension: "Proof-Search in Axiomatic Theories and Type Theories 2011" Message-ID: <4DC3F68B.2000206@lix.polytechnique.fr> Call for Papers PSATTT 2011: International Workshop on Proof Search in Axiomatic Theories and Type Theories Wroclaw, Poland August 1, 2011 http://www.lix.polytechnique.fr/~lengrand/Events/PSATTT11/ Affiliated with CADE, Wroclaw, Poland IMPORTANT DATES - *DEADLINE EXTENSION* Paper / long abstract submission: *May 23* Notification: June 6 Final papers due: June 27 Workshop: August 1 INVITED SPEAKERS (Joint with the PxTP workshop) *Jasmin Christian Blanchette, *Technische Universit?t M?nchen, "Proof Search and Proof Reconstruction in Sledgehammer" *John Harrison*, Intel corporation, TBA DESCRIPTION AND AIMS OF THE WORKSHOP This workshop continues the series entitled "Proof Search in Type Theories" (PSTT at CADE'09, FLOC'10), and enlarges its scope to encompass proof search in axiomatic theories as well. Generic proof-search in propositional and first-order logic (even second-order, higher-order) are fields that already benefit from a long research experience, spanning from techniques as old as unification to more recent concepts such as focusing and polarisation. More adventurous is the adaptation of generic proof-search mechanisms to the specificities of particular theories, whether these are expressed in the form of axioms or expressed by sophisticated typing systems or inference systems. The aim of this workshop is to discuss proof search techniques when these are constrained or guided by the shape of either axioms or inference/typing rules. But it more generally offers a natural (and rather informal) venue for discussing and comparing techniques arising from communities ranging from logic programming to type theory-based proof assistants, or techniques imported from the fields of automated reasoning and SMT but with an ultimate view to build proofs or at least provide proof traces. ============================ Topics of the workshop include, but are not limited to: - invertibility of deductive rules, polarity of connectives and focusing devices, - more generally, development and application of theorems establishing the existence of normal forms for proofs, - explicit proof-term representations and dynamic proof-term construction during proof-search, - use of meta-variables to represent unknown proofs to be found, - use of failure and backtracking in proof search, - integration of rewriting or computation into deductive systems, as organised by e.g. deduction-modulo - integration of domain-specific algorithms into generic deductive systems - transformation of goals into particular shapes that can be treated by domain-specific tactics or external tools - externalisation of some proof searching tasks and interpretation of the obtained outputs (justifications, execution traces...) - more generally, interfaces between cooperating tools - importation of automated reasoning techniques and SMT techniques to proof-constructing frameworks - quantifier instantiation in SMT techniques, arbitrary alternation of forall/exists quantifiers - unification in particular theories or in sophisticated typing systems More generally, contributions about the following topics are welcome - proof search strategies, their complexity and the trade-off between completeness and efficiency, - searching for proofs by induction, finding well-founded induction measures, strengthening goals to be proved by induction, etc, - reasoning on syntaxes with variable binding (in e.g. quantifiers or data structures), - termination, computational expressivity of related programming paradigms, - user interaction and interfaces, - systems implementing any of the ideas described above. Synthesising some of the above aspects into unifying theories is a concern of our research theme that aims at bringing together research efforts of different communities, enhancing their interaction. Contributions made in a spirit of synthesis are thus particularly welcome. ============================== SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 15-page limit in LNCS format, including bibliography. They can be shorter. System description are also welcome, with an 8-page limit and a demonstration on the day of the workshop. At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. PSATTT and PxTP are in the process of organizing a special issue in a journal, dedicated to their themes. The call will be open to everyone but will concern in particular the research material presented at PSATTT'11 and PxTP'11, as well as PSTT'08, PSTT'09 and PSTT'10. A specific refereeing round will ensure journal quality of the selected papers. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSATTT11/ PROGRAM COMMITTEE: Jeremy Avigad, Carnegie Mellon University Evelyne Contejean, CNRS - INRIA Saclay Amy Felty, University of Ottawa Stephane Lengrand, CNRS - Ecole Polytechnique David Pichardie, INRIA Rennes Aaron Stump, University of Iowa Enrico Tassi, INRIA Microsoft Research joint centre ORGANISERS Germain Faure, INRIA, France Stephane Lengrand, CNRS, France Assia Mahboubi, INRIA, France Contact details: psattt11 at easychair.org From sam.staton at cl.cam.ac.uk Fri May 6 11:52:00 2011 From: sam.staton at cl.cam.ac.uk (Sam Staton) Date: Fri, 6 May 2011 16:52:00 +0100 Subject: [TYPES/announce] Post-doctoral position at University of Cambridge Message-ID: <47511B0E-2AAA-4C68-A68C-95337537B914@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, preferably with expertise in all the areas of games and logic, concurrency, types, category theory. 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 at http://www.admin.cam.ac.uk/offices/hr/jobs/vacancies.cgi?job=8130 From femke at cs.vu.nl Mon May 9 09:11:50 2011 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Mon, 9 May 2011 15:11:50 +0200 (CEST) Subject: [TYPES/announce] DCM 2011: call for papers Message-ID: ========================================================================= Second Call for Papers DCM 2011 7th International Workshop on Developments in Computational Models July 3, 2011 Zurich, Switzerland http://www.pps.jussieu.fr/~jkrivine/conferences/DCM2011/DCM_2011.html A satellite event of ICALP 2011 - http://icalp11.inf.ethz.ch/ EXTENDED DEADLINE FOR SUBMISSIONS MAY 15, 2011 ========================================================================= DCM 2011 is the seventh in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. The goal of DCM is to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2011 will be a one-day satellite event of ICALP 2011 in Zurich, Switzerland. TOPICS OF INTEREST: ------------------- Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modeling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - comparisons of different models of computations; - information-theoretic ideas in computing. IMPORTANT DATES: ---------------- Paper Submission: May 15, 2011 (EXTENDED DEADLINE) Notification: May 25, 2011 Final Version: June 03, 2011 Workshop July 03, 2011 SUBMISSIONS: ------------ Please submit a paper via the conference EasyChair submission page: http://www.easychair.org/conferences/?conf=dcm2011 Submissions should be at most 12 pages, in PDF format. Please use the EPTCS macro package and follow the instructions of EPTCS: http://eptcs.org/ http://style.eptcs.org/ A submission may contain an appendix, but reading the appendix should should not be necessary to assess the merits of a submission. PUBLICATION: ------------ Accepted contributions will appear in EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, quality permitting full versions of selected papers will be invited for a special issue in an internationally leading journal. INVITED SPEAKERS: TBA ----------------- PROGRAMME COMMITTEE: -------------------- Erika Andersson, Heriot-Watt University, UK Nachum Dershowitz, Tel Aviv University, Israel Eleni Diamanti, CNRS & Telecom ParisTech, France Lucas Dixon, Google, USA Elham Kashefi, University of Edinburgh, UK (Co-chair) Delia Kesner, CNRS & Universit? Paris Diderot, France H?l?ne Kirchner, INRIA, France Heinz Koeppl, ETH Zurich, Switzerland Jean Krivine, CNRS & Universit? Paris Diderot, France (Co-chair) Michael Mislove, Tulane University, USA Mio Murao, University of Tokyo, Japan Vincent van Oostrom, Utrecht University, The Netherlands Femke van Raamsdonk, VU University Amsterdam, The Netherlands (Co-chair) Paul Ruet, CNRS & Institut de Math?matiques de Luminy, France Aaron Stump, University of Iowa, USA ========================================================================= Further information: Elham Kashefi Jean Krivine Femke van Raamsdonk ========================================================================= From A.G.Setzer at swansea.ac.uk Mon May 9 17:46:17 2011 From: A.G.Setzer at swansea.ac.uk (Anton Setzer) Date: Mon, 09 May 2011 22:46:17 +0100 Subject: [TYPES/announce] Logic related PhD studentships available in Swansea, UK Message-ID: <4DC860A9.2030306@swansea.ac.uk> Swansea has a strong group in logic and theoretical computer science included several researchers in type theory (Anton Setzer, Ulrich Berger, Monika Seisenberger, Karim Kanso, Fredrik Norvall Forsberg) Some of the following studentships are available for students in this area. Please apply. More details can be found at http://www.swan.ac.uk/compsci/research/postgraduate.html --------------------------------------------------------- At least four new PhD studentships are expected to be available in Computer Science at Swansea University in 2011. ***************************** Please apply by 31 May 2011 ! ***************************** Two of the confirmed studentships are linked to specific research projects; the others will be awarded for PhD studies in any of our main research areas: Graphics, HCI and Theory. *************************************** Overseas and EU candidates are eligible for some of the studentships ! *************************************** DOCTORAL TRAINING GRANTS ======================== EPSRC Doctoral Training Grants will fund up to two PhD studentships with an annual stipend of 13,590 GBP plus UK/EU-level tuition fees. Only UK-resident candidates are eligible for the full studentships; other EU-nationals are eligible for fees-only awards. See http://www.epsrc.ac.uk/funding/students/Pages/eligibility.aspx for the precise residency requirements. UNIVERSITY PROJECT STUDENTSHIP - VISUALISING THE PAST ===================================================== This joint PhD studentship with History represents an exciting opportunity to become involved with a project exploring the ways in which digital technologies can be used to represent, explain, and interpret the past. The 'Visualising the Past' project focuses in particular on how the past (historical and archaeological) can be visualised through graphics, visualisations, animations, and the use of hand-held mobile technologies. Further details of this studentship are available at: http://www.swansea.ac.uk/scholarships/research/whoiseligible,57506,en.php Only UK/EU students are eligible. Computer Science candidates who wish to be considered for it should indicate so on the University application form, and contact Professor Matt Jones before applying. EPSRC PROJECT STUDENTSHIP -- PLANCOMPS: PROGRAMMING LANGUAGE COMPONENTS AND SPECIFICATIONS ================================================== This PhD studentship is linked to the PLanCompS project, which will establish and test the practicality of a component-based framework for the design, specification and implementation of programming languages. The student is to carry out foundational research related to the semantic specification frameworks used in the project, and will be supervised by Professor Peter Mosses. Further details of this studentship are available at: http://www.swansea.ac.uk/scholarships/research/whoiseligible,58266,en.php All candidates (UK, EU and overseas) are eligible. Candidates who wish to be considered for it should indicate so on the University application form, and contact Professor Peter Mosses before applying. The 1-2 page supplementary personal statement submitted with the application form should include a brief overview of any previous studies related to the foundations of programming languages. COLLEGE OF SCIENCE AWARDS ========================= The recently-formed College of Science is expected to award additional PhD studentships in 2011. These will be announced separately at: http://www.swansea.ac.uk/scholarships/research/ APPLICATIONS ============ Potential candidates should have a first or upper-second (2:1) class honours degree (or equivalent) in Computer Science or a closely related area, or a higher qualification. To ensure consideration for an award, please apply to the University for admission as a PhD student in Computer Science: http://www.swansea.ac.uk/postgraduate/apply/ ********************* Deadline: 31 May 2011 ********************* Applications received after the deadline may be disregarded in connection with awards of studentships. Candidates are recommended to discuss possible topics with potential supervisors before applying. Separate application for an award is NOT required. Decisions concerning the studentships linked to specific projects are expected by mid-June, and the rest by mid-July. Information about tuition fees can be found at http://www.swansea.ac.uk/international/money/ScholarshipsandFees/ General queries may be addressed to Dr Oliver Kullmann . The Department of Computer Science in the College of Science at Swansea University offers an active and stimulating research atmosphere for PhD students, with internationally-leading research groups in Graphics, HCI and Theory. In RAE 2008, 70% of the research submitted by the department was assessed as either world-leading or internationally excellent; only 12 Computer Science departments throughout the UK achieved a higher percentage of world-leading research. For further details of our research, see: http://www.swansea.ac.uk/compsci/research/ --------------------------------------------------------- -- --------------------------------------- Anton Setzer Department of Computer Science Swansea University Singleton Park Swansea SA2 8PP UK Telephone: (national) (01792) 513368 (international) +44 1792 513368 Fax: (national) (01792) 295708 (international) +44 1792 295708 Visiting address: Faraday Building, Computer Science Dept. 2nd floor, room 211. Email: a.g.setzer at swan.ac.uk WWW: http://www.cs.swan.ac.uk/~csetzer/ --------------------------------------- From dallago at cs.unibo.it Tue May 10 03:50:32 2011 From: dallago at cs.unibo.it (Ugo Dal Lago) Date: Tue, 10 May 2011 09:50:32 +0200 Subject: [TYPES/announce] Postdoc Position Message-ID: <4DC8EE48.6080305@cs.unibo.it> ------------------------------------------------------------ NEW POSTDOC POSITION IN THE "ETERNAL" INRIA ARC Project http://eternal.cs.unibo.it/ ------------------------------------------------------------ --> Approximate period: 01/10/2011-01/10/2012 (one year) <-- --> Deadline for submission of candidatures: 31/05/2011 <-- We are currently looking for candidates for a postdoc position, to work on the "ETERNAL" INRIA ARC Project. The postdoc will join the FOCUS team at the University of Bologna (http://focus.cs.unibo.it), but short visits are possible to the other two teams participating to "ETERNAL" (PARSIFAL and PI.R2). The postdoc will not have any teaching duty. The gross salary will be approximately 2600 euros per month, like any other INRIA postdoc. REQUIREMENTS: We are looking for candidates with a Ph.D. in Computer Science and previous experience in either Implicit Computational Complexity or Interactive Theorem Proving. Candidates that will defend their Ph.D. thesis before October 2011 will also be considered. STARTING DATE: The proposed starting date is October 1st, 2011, but can be postponed until the end of the year. PROJECT DESCRIPTION: This project aims at putting together ideas from Implicit Computational Complexity and Interactive Theorem Proving, in order to develop new methodologies for handling quantitative properties related to program resource consumption, like execution time and space. The task of verifying and certifying quantitative properties is undecidable as soon as the considered programming language gets close to a general purpose language. So, full-automatic techniques in general cannot help in classifying programs in a precise way with respect to the amount of resources used and moreover in several cases the programmer will not gain any relevant information on his programs. In particular, this is the case for all the techniques based on the study of structural constraints on the shape of programs, like many of those actually proposed in the field of implicit computational complexity. To overcome these limitations, we aim at combining the ideas developed in the linear logic approach to implicit computational complexity with the ones of interactive theorem proving, getting rid of the intrinsic limitations of the automatic techniques. HOW TO APPLY: All candidates are invited to send by email the following material to Ugo Dal Lago (dallago at cs.unibo.it), before May 31st, 2011: - A detailed CV; - A short statement about the candidate's motivation for working in the "ETERNAL" project; - An abstract of the candidate's Ph.D. thesis (if already discussed). - Letters of recommendation (if any). For any further information, please write to dallago at cs.unibo.it -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Tue May 10 04:12:20 2011 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 10 May 2011 10:12:20 +0200 Subject: [TYPES/announce] An update on ICFP'11 in Tokyo (September 18-24, 2011) Message-ID: Given the fairly recent severe earthquake and tsunami in Japan, you may wonder how this affects the preparations for ICFP'11 in Tokyo. Luckily, Tokyo was significantly less affected by these saddening events than the regions further north. In fact, the situation in Tokyo is almost back to normal, after only two months, with another four months until ICFP. Moreover, all major embassies have in the meantime lifted their travel advisories for the Tokyo metropolitan region (while they still maintain active advisories for some other regions.) Our local organisational team has completed major parts of the preparations and recently summarised the most important facts on a local information page for ICFP'11: http://www.biglab.org/icfp11local/index.html The main conference site is at http://www.icfpconference.org/icfp2011/ We are looking forward to seeing you in Tokyo in September! Manuel Chakravarty Zhenjiang Hu (General Chairs of ICFP'11) From spider.vz at gmail.com Tue May 10 12:05:05 2011 From: spider.vz at gmail.com (Vadim Zaytsev) Date: Tue, 10 May 2011 18:05:05 +0200 Subject: [TYPES/announce] GTTSE 2011: Call for Participation Message-ID: GTTSE 2011, 3?9 July, 2011, Braga, Portugal 4th International Summer School on Generative and Transformational Techniques in Software Engineering http://gttse.wikidot.com/ SCIENTIFIC PROGRAM SUMMARY 8 Long Tutorials 8 Short Tutorials Participants Workshop REGISTRATION DEADLINE: May 27 (early registration) June 17 (late registration) SCOPE AND FORMAT The summer school brings together PhD students, lecturers, technology presenters, as well as other researchers and practitioners who are interested in the generation and the transformation of programs, data, software models, data models, meta-models, documentation, and entire software systems. This concerns many areas of software engineering: software reverse and re-engineering, model-driven approaches, automated software engineering, generic language technology, aspect-oriented programming, feature-oriented development, compiler construction, to name a few. These areas differ with regard to the specific sorts of meta-models (or grammars, schemas, formats etc.) that underlie the involved artifacts, and with regard to the specific techniques that are employed for the generation and the transformation of the artifacts. The tutorials are given by renowned representatives of complementary approaches and problem domains. Each tutorial combines foundations, methods, examples, and tool support. The program of the summer school also features invited technology presentations, which present setups for generative and transformational techniques. These presentations complement each other in terms of the chosen application domains, case studies, and the underlying concepts. The program of the school also features a participants workshop. All summer school material will be collected in proceedings that are handed out to the participants. Formal proceedings will be compiled after the summer school, where all contributions are subjected to additional reviewing. The formal proceedings of the previous three instances of the summer school (2005, 2007 and 2009) were published as volumes 4143, 5235 and 6491 in the Lecture Notes in Computer Science series of Springer-Verlag. LONG TUTORIALS Compilation in the 21st century?Too Real for Comfort Darius Blasband (RainCode, Belgium) Tips & Tricks for Communication in CS: Reviews, Papers and Talks Olivier Danvy (Aarhus University, Denmark) Test Automation: An Empirical Perspective Arie van Deursen (Delft University of Technology, The Netherlands) Variation Programming with the Choice Calculus Martin Erwig (Oregon State University, USA) Exposing and Exploiting Program Analyses in an IDE Robert Fuhrer (IBM Research, USA) Model Management in the Wild: Foundations & Applications Richard Paige (University of York, UK) Methods and Tools for Analyzing Software Evolution Eleni Stroulia (University of Alberta, Canada) Bidirectional by Necessity James F. Terwilliger (Microsoft Corporation, USA) SHORT TUTORIALS Requirements for Self-adaptation Nelly Bencomo (INRIA, France) Dynamic Program Analysis for Database Reverse Engineering Anthony Cleve (University of Namur, Belgium) Tooling Research Tudor Girba (netstyle.ch GmbH, Switzerland) Model-based Language Engineering Florian Heidenreich (Technische Universit?t Dresden, Germany) Christian Wende (Technische Universit?t Dresden, Germany) Re(verse)engineering Tim Janssen (Cornerstone, Netherlands) Feature-oriented Software Development (FOSD) Christian K?stner (Philipps University Marburg, Germany) Sven Apel (University of Passau, Germany) Managing the Evolution of F/OSS with Model-Driven Techniques Alfonso Pierantonio (University of L?Aquila, Italy) Davide Di Ruscio (University of L?Aquila, Italy) Language & IDE Development, Modularization and Composition with MPS Markus V?lter (independent/itemis, Germany) ORGANIZATION COMMITTEE Ralf L?mmel (Universit?t Koblenz-Landau, Germany) Jo?o Saraiva (Universidade do Minho, Portugal) Joost Visser (Software Improvement Group, The Netherlands) ADDITIONAL INFORMATION For additional information on the program, venue, and other details of the summer school, please consult the web page: http://gttse.wikidot.com/ Or engage in direct contact with: J?come Cunha (Universidade do Minho, Portugal) ? local arrangements and registration Vadim Zaytsev (Centrum Wiskunde & Informatica, The Netherlands) ? publicity chair From shao at cs.yale.edu Tue May 10 17:39:54 2011 From: shao at cs.yale.edu (Zhong Shao) Date: Tue, 10 May 2011 17:39:54 -0400 Subject: [TYPES/announce] Post-Doctoral Position at Yale University Message-ID: <201105102139.p4ALdsLX009625@lux.cs.yale.edu> The FLINT group at Yale University (http://flint.cs.yale.edu) is seeking applicants for a post-doctoral position 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, formal semantics, certified OS kernels and compilers, and language-based security. 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. 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 bywang at iis.sinica.edu.tw Wed May 11 01:49:01 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Wed, 11 May 2011 13:49:01 +0800 Subject: [TYPES/announce] CPP 2011 - Call for Papers Message-ID: <20110511134901.16105fsebvrt0uh9@webmail.iis.sinica.edu.tw> The First International Conference on Certified Programs and Proofs (CPP 2011) CALL FOR PAPERS Kenting, Taiwan December 7--9, 2011 http://formes.asia/cpp (co-located with APLAS 2011) 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. 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; and teaching mathematics and computer science with proof assistants. INVITED SPEAKERS: * Andrew Appel (Princeton University) * Nikolaj Bj?rner (Microsoft Research) * Peter O'Hearn (Queen Mary, University of London) * Vladimir Voevodsky (Institute for Advanced Study, Princeton University) 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: Monday, June 13, 2011 Paper Submission Deadline: Friday, June 17, 2011 Author Notification: Monday, August 29, 2011 Camera Ready: Monday, September 19, 2011 Conference: December 7-9, 2011 SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2011 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. AWARD FOR BEST PAPER: An award will be given for the best accepted paper, as judged by the program committee. The committee may decline to make the award or split it among several papers. PROGRAM CO-CHAIRS: Jean-Pierre Jouannaud (INRIA and Tsinghua University) Zhong Shao (Yale University) Email: cpp2011pc at gmail.com GENERAL CHAIR: Yih-Kuen Tsay (National Taiwan University) PROGRAM COMMITTEE: Andrea Asperti (University of Bologna) Gilles Barthe (IMDEA Software Institute) Xiao-Shan Gao (Chinese Academy of Sciences) Georges Gonthier (Microsoft Research Cambridge) Chris Hawblitzel (Microsoft Research Redmond) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (INRIA and Tsinghua University) Akash Lal (Microsoft Research India) Xavier Leroy (INRIA Paris-Rocquencourt) Yasuhiko Minamide (University of Tsukuba) Shin-Cheng Mu (Academia Sinica) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Sandip Ray (University of Texas at Austin) Natarajan Shankar (SRI International) Zhong Shao (Yale University) Christian Urban (TU Munich) Viktor Vafeiadis (Max Planck Institute for Software Systems) Stephanie Weirich (University of Pennsylvania) Kwangkeun Yi (Seoul National University) PUBLICITY CHAIR: Bow-Yaw Wang (Academia Sinica, INRIA and Tsinhua University) ORGANIZING COMMITTEE: Tyng-Ruey Chuang (chair), Shin-Cheng Mu, Yih-Kuen Tsay (Academia Sinica and National Taiwan University) Email: cpp2011oc at gmail.com ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From rlc3 at mcs.le.ac.uk Wed May 11 05:31:05 2011 From: rlc3 at mcs.le.ac.uk (Roy Crole) Date: Wed, 11 May 2011 10:31:05 +0100 Subject: [TYPES/announce] Lectureship in Computer Science, University of Leicester, UK Message-ID: <4DCA5759.3050505@mcs.le.ac.uk> Dear Colleagues, I would be grateful if you could forward the lectureship advertisement below to your Department and to interested colleagues. Best Regards, Roy Crole. ============================================================= * Lecturer in Computer Science * * Department of Computer Science* * * *University of Leicester* * * *http://www.cs.le.ac.uk/* * * Salary Grade 8 --- ?35,788 to ?44,016 per annum Ref: SEN00185 At Leicester we're going places. Ranked in the top 12 universities in Britain our aim is to climb further. A commitment to high quality fused with an inclusive academic culture is our hallmark and led the Times Higher Education to describe us as "elite without being elitist". The Department has a strong research program in the foundations of computational models, processes and structures, and the way they support the engineering of software-intensive systems, including socio- -technical systems. The successful candidate will have a strong or promising research record in computer science that is aligned with or complements the department's research themes, and will be able to contribute to undergraduate and postgraduate teaching and supervision in software engineering. Ability to attract funding or engage with industry are other aspects that we will rate very highly. * * *Important dates* Closing date for applications: June 5th Interview: June 30 and July 1 Start date: September 1st (or as close as possible) *Other information* A lecturer position in the UK is similar to an assistant professorship in the North-American system. Informal enquiries are welcome and should be made to the Head of Department on cshod at mcs.le.ac.uk . For further information and to apply on-line, please visit our website: _www.le.ac.uk/joinus _ Candidates short-listed for interview will be contacted by the University. If you do not receive a communication from the University within 4 weeks of the closing date, please assume that your application has been unsuccessful. -- Dr R. L. Crole Department of Computer Science University Road University of Leicester Leicester LE1 7RH United Kingdom Tel +44 (0)116 252 3887 Fax +44 (0)116 252 3915 http://www.cs.le.ac.uk/people/rcrole Times Higher Education University of the Year 2008/9 Times Higher Education Awards: Outstanding Support for Students 2009/10 -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.wrigstad at it.uu.se Wed May 11 07:46:15 2011 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Wed, 11 May 2011 13:46:15 +0200 Subject: [TYPES/announce] Extended last registration date for Summer School on Programming Languages for Concurrent and Parallel Computing Message-ID: NOTE: The last day of registration has been extended to May 16! Call for Participation The 2011 UPMARC Summer School on Multicore Computing focuses on programming languages for concurrent and parallel computing and will take place in Stockholm, Sweden in June 20-23, 2011. The school is subsidised by the UPMARC research programme (see upmarc.se) and is organised by Uppsala University. NOTE: The last day of registration has been extended to May 16! Courses The school consists of a number of lectures and talks from international leaders in their field, including: * Doug Lea, SUNY Oswego, US The Design and Engineering of Concurrency Libraries * Ganesh Gopalakrishnan, The University of Utah, US Formal Verification Methods for Message Passing and GPU Computing * Francesco Zappa Nardelli, INRIA Rocquencourt, France Shared Memory: An Elusive Abstraction * Philipp Haller, EPFL, Switzerland, and Stanford University, USA Scala for Multicore Programming * Joe Armstrong, Ericsson, Sweden Concurrent and Parallel Programming ? What's the difference? * Kostis Sagonas, Uppsala University, Sweden Erlang-style concurrency: pros, cons and implementation issues * Mats Brorsson, KTH, Sweden A case for task-centric programming models School Objective The objective of the school is to offer foundational tutorials accompanied by a selection of exiting new emerging technologies and industrial applications in the multicore-related areas, all given by leading scientific and industrial experts of the community. We aim to attract graduate students and young scientists and, through tutorials and lectures, prepare them for research on identifying and addressing fundamental challenges that will enable all programmers to leverage the potential performance from the ongoing shift to universal parallel computing. We also aim to provide a fun and stimulating environment for students to meet and establish connections with other students, world-class researchers from academia and industry, local faculty, and other senior scientists. For more information about the school, including how to register: http://upmarc.se/events/SS2011 There is also a printable flyer to distribute in your coffee room, or other venue: http://www.it.uu.se/research/upmarc/events/SS2011/flyer.pdf We strongly encourage people interested in participating to register as soon as possible. ------------------------------------------------------------ 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 pmt6sbc at maths.leeds.ac.uk Wed May 11 08:13:33 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Wed, 11 May 2011 13:13:33 +0100 (BST) Subject: [TYPES/announce] CiE 2011 in Sofia - Call for Participation Message-ID: CiE 2011: Computability in Europe: Models of Computation in Context Sofia, Bulgaria, 27 June 2011 - 2 July 2011 CALL FOR PARTICIPATION Informal Presentation Deadline: 15 May 2011 Early Registration Deadline: 29 May 2011 http://cie2011.fmi.uni-sofia.bg/ _____________________________________________________________________ TUTORIALS: Jack Lutz (Ames IA, U.S.A.), Geoffrey Pullum (Edinburgh, U.K.) PLENARY TALKS: Scott Aaronson (Cambridge MA, U.S.A.), Christel Baier (Dresden, Germany), Michiel van Lambalgen (Amsterdam, The Netherlands), Antonio Montalban (Chicago IL, U.S.A.), Alexandra Shlapentokh (Greenville NC, U.S.A.), Theodore Slaman (Berkeley CA, U.S.A.), Janet Thornton (Cambridge, U.K.), Alasdair Urquhart (Toronto ON, Canada). SPECIAL SESSIONS: * Computability in Analysis, Algebra, and Geometry (Organizers: Alexandra Shlapentokh, Dieter Spreen) : Ulrich Berger (Swansea), Vasco Brattka (Cape Town): Valentina Harizanov (Washington, DC), Russel Miller (New York, NY). * Classical Computability Theory (Organizers: Doug Cenzer, Bjorn Kjos-Hanssen): Mingzhong Cai (Cornell), Rachel Epstein (Harvard), Charles Harris (Leeds), Guohua Wu (NTU, Singapore) * Natural Computing (Organizers: Erzs?bet Csuhaj-Varju, Ion Petre): Natalio Krasnogor (University of Nottingham), Martin Kutrib (University of Giessen), Victor Mitrana (University of Bucharest), Agustin Riscos-Nunez (University of Seville) * Relations between the physical world and formal models of computability (Organizers: Viv Kendon, Sonja Smets): Pablo Arrighi (University of Grenoble), Caslav Brukner (University of Vienna), Joe Fitzsimons (University of Singapore), Prakash Panangaden (McGill University) * Theory of transfinite computations (Organizers: Peter Koepke, C.T. Chong): Philip Welch (University of Bristol), Sy D. Friedman (University of Vienna), Wei Wang (Sun Yat-sen University), Merlin Carl (Rheinische Friedrich-Wilhelms-Universitat Bonn) * Computational Linguistics (Organizers: Tejaswini Deoskar, Tinko Tinchev): Klaus U. Schulz (Ludwig-Maximilians-Universitat Munchen)& Stoyan Mihov (Bulgarian Academy of Sciences), Ian Pratt-Hartmann (University of Manchester). CiE serves as an interdisciplinary forum for research in all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. Women in Computability Workshop, 30 June 2011 : In 2011, we continue the programme "Women in Computability" supported by the journal "Annals of Pure and Applied Logic" (Elsevier). Speakers: Alexandra Shlapentokh Valentina Harizanov The Women in Computability workshop aims to bring together women in Computing and Mathematical research to present and exchange their academic and scientific experience with young researchers. The meeting will offer the CIE scientific community the opportunity to encourage young students, especially young female researchers, to have active careers in the mathematical and computational sciences. Mentorship Programme The mentorship programme allows junior female researchers to meet senior women in their field, discuss career issues with them and get their support. Junior female researchers who wish to participate in this programme will be assigned a mentor for the duration of the conference with whom they will meet several times, including a dinner invitation with other junior researchers and the mentors. All questions about the conference could be send at cie2011 at fmi.uni-sofia.bg __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2011 in Sofia, Bulgaria http://cie2011.fmi.uni-sofia.bg CiE 2012: Turing Centenary Conference http://www.cie2012.eu CiE Membership Application Form http://www.cs.swan.ac.uk/acie ALAN TURING YEAR http://www.turingcentenary.eu __________________________________________________________________________ From elaine at mat.ufmg.br Wed May 11 17:05:26 2011 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Wed, 11 May 2011 21:05:26 +0000 (UTC) Subject: [TYPES/announce] LSFA 2011 - Last call for papers Message-ID: ***** Deadline approaching ***** LSFA 2011 - Sixth Workshop on Logical and Semantic Frameworks, with Applications August 27th, 2011, Belo Horizonte, Minas Gerais, Brazil Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and 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 o Proof theory o Type theory o Automated deduction * Semantic frameworks o Specification languages and meta-languages o Formal semantics of languages and systems o Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA 2011 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. Invited Speakers 01 Pete Manolios (Northeastern University) 02 Arnon Avron (Tel-Aviv University) 03 Luiz Carlos Pereira (PUC-Rio) Program Committee Simona Ronchi della Rocca (co-chair, UNITO, Italy) Elaine Gouvea Pimentel (co-chair, UFMG, Brazil) Luis Farinas del Cerro (IRIT, France) Edward Hermann Haeusler (PUC-Rio, Brazil) Mauricio Ayala-Rincon (UnB, Brazil) Mario Benevides (Coppe-UFRJ, Brazil) Eduardo Bonelli (UNQ, Argentina) Marcelo Correa (IM-UFF, Brazil) Clare Dixon (Liverpool, UK) Gilles Dowek (Polytechnique-Paris, France) William Farmer (Mcmaster, Canada) Maribel Fernandez (King's College, UK) Marcelo Finger (IME-USP, Brazil) Alwyn Goodloe (NASA LaRC) Fairouz Kamareddine (Heriot-Watt Univ, UK) Delia Kesner (Paris-Jussieu, France) Luis da Cunha Lamb (UFRGS, Brazil) Joao Marcos (UFRN, Brazil) Flavio L. C. de Moura (UnB, Brazil) Ana Teresa Martins (UFC, Brazil) Martin Musicante (UFRN, Brazil) Claudia Nalon (UnB, Brazil) Vivek Nigam (Ludwig-Maximilians-Universitat Munchen) Luca Paolini (UNITO, Italy) Jonathan Seldin (Univ-Lethbridge , Canada) Luis Menasche Schechter (UFRJ, Brazil) Organizing Committee Mauricio Ayala-Rincon Edward Hermann Hauesler PUC-Rio Elaine Pimentel (Local-chair) Simona Ronchi della Rocca Dates and Submission Paper submission deadline: May 23 Author notification: June 30 Camera ready: July 31st Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA 2011 page at EasyChair until the submission deadline in May 23, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using EPTCS style. 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 (tbc). 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. A special issue of the first edition of the workshop appeared in the Journal of Algorithms, a special issue of the second edition of the workshop appeared in the J.IGPL and a special edition of TCS is being prepared with selected contributions from the third and the forth editions of LSFA. At least one of the authors should register at the conference. The paper presentation should be in English. Venue Belo Horizonte is the capital of the state of Minas Gerais and the third-largest metropolitan area in Brazil. A city surrounded by mountains, quite big, but still with this countryside town air. Contact Information For more information please contact the chairs The web page of the event can be reached at: http://www.mat.ufmg.br/LSFA2011/ 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 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- From jarvi at cse.tamu.edu Wed May 11 23:10:25 2011 From: jarvi at cse.tamu.edu (=?iso-8859-1?Q?Jaakko_J=E4rvi?=) Date: Wed, 11 May 2011 22:10:25 -0500 Subject: [TYPES/announce] CFP: WGP 2011 - Workshop on Generic Programming Message-ID: <3B8C049B-37B8-40DF-84D6-972A90A66A16@cse.tamu.edu> ====================================================================== CALL FOR PAPERS WGP 2011 7th ACM SIGPLAN Workshop on Generic Programming Tokyo, Japan Sunday, September 18th, 2011 http://flolac.iis.sinica.edu.tw/wgp11/ Collocated with the International Conference on Functional Programming (ICFP 2011) ====================================================================== Deadline for submission ----------------------- Monday, June 6th, 2011 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, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Jaakko J?rvi, Texas A&M University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee ------------------- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway Akimasa Morihata, Tohoku University, Japan Pablo Nogueira, Universidad Polit??cnica de Madrid, Spain Ulf Norell, Chalmers University of Technology and University of Gothenberg, Sweden Ross Paterson, City University London, UK Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands Sibylle Schupp, Technische Universit??t Hamburg-Harburg, Germany Andrew Sutton, Kent State University, USA Tarmo Uustalu, Institute of Cybernetics, Estonia Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Monday 2011-06-06 Notification of acceptance: Tuesday 2011-07-01 Final submission due: Monday 2011-07-25 Workshop: Sunday 2011-09-18 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP11 EasyChair instance by the above deadline. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Tokyo, Japan 2011 (affiliated with ICFP11) Earlier Workshops on Generic Programming have been held in * 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). Additional information: The WGP steering committee consists of J. Gibbons, R. Hinze, P. Jansson, J. J?rvi, J. Jeuring, B. Oliveira, S. Schupp, and M. Zalewski From gopalan at cs.umn.edu Thu May 12 12:44:19 2011 From: gopalan at cs.umn.edu (Gopalan Nadathur) Date: Thu, 12 May 2011 11:44:19 -0500 Subject: [TYPES/announce] LFMTP 2011 Call for Papers (2nd Call) Message-ID: [LFMTP 2011 Reminder: Abstracts due by May 16, papers due by May 23] Sixth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'11) http://lfmtp11.cs.umn.edu Nijmegen, The Netherlands, August 27, 2011 Affiliated with Interactive Theorem Proving (ITP 2011) CALL FOR PAPERS ------------------------------------------------------------- IMPORTANT DATES Abstract submission: May 16, 2011 Paper submission: May 23, 2011 Author notification: June 22, 2011 Final versions due: August 1, 2011 Workshop day: August 27, 2011 ------------------------------------------------------------- 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'11 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://lfmtp11.cs.umn.edu. From gjbarthe at gmail.com Sat May 14 10:36:34 2011 From: gjbarthe at gmail.com (Gilles Barthe) Date: Sat, 14 May 2011 16:36:34 +0200 Subject: [TYPES/announce] CFP: FAST2011 - 8th International Workshop on Formal Aspects of Security & Trust Message-ID: The 8th International Workshop on Formal Aspects of Security & Trust (FAST2011) Leuven, Belgium. September 15-16, 2011 http://www.iit.cnr.it/FAST2011 FAST2011 is co-located with European Symposium on Research in Computer Security (ESORICS 2011) Leuven, Belgium 12-14 September, 2011 OVERVIEW The eighth International Workshop on Formal Aspects of Security and Trust (FAST2011) aims at continuing the successful efforts of the previous FAST workshops, fostering cooperation among researchers in the areas of security and trust. Computing and network infrastructures have become pervasive, and now support a great deal of economic activity. Thus, society needs suitable security and trust mechanisms. Interactions increasingly span several enterprises and involve loosely structured communities of individuals. Participants in these activities must control interactions with their partners based on trust policies and business logic. Trust-based decisions effectively determine the security goals for shared information and for access to sensitive or valuable resources. FAST focuses on the formal models of security and trust that are needed to state goals and policies for these interactions. We also seek new and innovative techniques for establishing consequences of these formal models. Implementation approaches for such techniques are also welcome. IMPORTANT DATES Title/Abstract Submission: 1 June 2011 Paper submission: 5 June 2011 Author Notification: 20 July 2011 Pre-proceedings version: 1 September 2011 Workshop: 15-16 September 2011 Post-proceedings version: 1 November 2011 Invited speakers: Andy Gordon (Microsoft Research) Fabio Massacci (University of Trento) PROGRAMME COMMITTEE Gilles Barthe, IMDEA Software, Spain (co-chair) Konstantinos Chatzikokolakis, ?cole Polytechnique, France Stephen Chong, Harvard University, USA Michael Clarkson, Cornell University, USA Ricardo Corin, FaMAF, Universidad Nacional de C?rdoba, Argentina Cas Cremers, ETH Zurich, Switzerland Anupam Datta, Carnegie Mellon University, USA (co-chair) Sandro Etalle, TU Eindhoven and Univ. of Twente, Netherlands (co-chair) Cedric Fournet, Microsoft Research, UK Deepak Garg, Carnegie Mellon University, USA Peter Herrmann, NTNU Trondheim, Norway Bart Jacobs, Radboud University Nijmegen, Netherlands Christian Damsgaard Jensen, Technical University of Denmark, Denmark Steve Kremer, LSV, ENS Cachan, CNRS, INRIA, France Fabio Martinelli, CNR, Italy Fabio Massacci, University of Trento, Italy Sjouke Mauw, University of Luxemburg, Luxembourg Mogens Nielsen, Aarhus, Denmark Mark Ryan, University of Birmingham, UK Ron van der Meyden, University of New South Wales, Australia Luca Vigano', Universita` di Verona, Italy ORGANIZERS Gilles Barthe, IMDEA Software, Spain Anupam Datta, Carnegie Mellon University, USA Sandro Etalle, TU Eindhoven and Univ. of Twente CONTACTS Organizers can be reached at fast-2011'at'lists.andrew.cmu.edu Latest updates about FAST 2011 will be regularly posted to security'at'fosad.org PAPER SUBMISSION Suggested submission topics include, but are not limited to: Formal models for security, trust and reputation Security protocol design and analysis Logics for security and trust Trust-based reasoning Distributed trust management systems Digital asset protection Data protection Privacy and ID management issues Information flow analysis Language-based security Security and trust aspects in ubiquitous computing Validation/Analysis tools Web/Grid services security/trust/privacy Security and risk assessment Resource and access control Case studies SUBMISSION GUIDELINES We seek papers presenting original contributions. Two types of submissions are possible: 1) short papers, up to 5 pages in LNCS format. 2) full papers, up to 15 pages in LNCS format. Submissions should clearly state their category (1 or 2). Author's full name, address, and e-mail must appear on the first page. Short papers as well as full papers will be included in the informal proceedings distributed at the workshop. After the workshop, authors of short papers which are judged mature enough for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures, and accepted papers will be published in the post-proceedings in LNCS. Simultaneous submission of full papers to a journal or conference/workshop with formal proceedings justifies rejection. Short papers at FAST are not formally published, so this restriction does not apply to them. However, related publications and overlapping submissions must be cited explicitly in short papers. Papers should be submitted via the EasyChair system: http://www.easychair.org/conferences/?conf=fast2011 PROCEEDINGS As done for the previous issues of FAST, the post-proceedings of the workshop will be published in LNCS. A special journal issue is also planned. From pangjun at gmail.com Mon May 16 03:58:06 2011 From: pangjun at gmail.com (Jun PANG) Date: Mon, 16 May 2011 09:58:06 +0200 Subject: [TYPES/announce] SecCo 2011: 2nd Call for Papers Message-ID: +-------------------------------------------------------------------------+ ! ! ! SecCo 2011 ! ! Aachen, Germany ! ! Monday, September 5th, 2011 ! ! http://www.lix.polytechnique.fr/~kostas/SecCo2011/ ! ! ! ! Affiliated with CONCUR 2011 ! ! ! +-------------------------------------------------------------------------+ IMPORTANT DATES =============== Papers due: June 3rd, 2011 Notification: July 8th, 2011 Final paper due: July 22nd, 2011 Workshop: September 5th, 2011 BACKGROUND, AIM AND SCOPE ========================= Emerging trends in concurrency theory require the definition of models and languages adequate for the design and management of new classes of applications, mainly to program either WANs (like Internet) or smaller networks of mobile and portable devices (which support applications based on a dynamically reconfigurable communication structure). Due to the openness of these systems, new critical aspects come into play, such as the need to deal with malicious components or with a hostile environment. Current research on network security issues (e.g. secrecy, authentication, etc.) usually focuses on opening cryptographic point-to-point tunnels. Therefore, the proposed solutions in this area are not always exploitable to support the end-to-end secure interaction between entities whose availability or location is not known beforehand. The aim of the workshop is to cover the gap between the security and the concurrency communities. More precisely, the workshop promotes the exchange of ideas, trying to focus on common interests and stimulating discussions on central research questions. In particular, we look for papers dealing with security issues -- such as authentication, integrity, privacy, confidentiality, access control, denial of service, service availability, safety aspects, fault tolerance, trust, language-based security, probabilistic and information theoretic models -- in emerging fields like web services, mobile ad-hoc networks, agent-based infrastructures, peer-to-peer systems, context-aware computing, global/ubiquitous/pervasive computing. SecCo 2011 follows the success of SecCo'03 (affiliated to ICALP'03), SecCo'04 (affiliated to CONCUR'04), SecCo'05 (affiliated to CONCUR'05), SecCo'07 (affiliated to CONCUR'07), SecCo'08 (affiliated to CONCUR'08), SecCo'09 (affiliated to CONCUR'09) and SecCo'10 (affiliated to CONCUR'10). Note that this is SecCo's last year as an independent workshop. Starting from next year, SecCo is merging with several other workshops in the field to form the Conference on Security and Trust Foundations (STF) which will be part of the European Joint Conferences on Theory and Practice of Software (ETAPS). SUBMISSION ========== The workshop proceedings will be published in the new EPTCS series (Electronic Proceedings in Theoretical Computer Science, see http://www.cse.unsw.edu.au/~rvg/EPTCS/ and http://www.informatik.uni-trier.de/~ley/db/series/eptcs/index.html for the list of all published EPTCS volumes); we thus encourage submissions already in that format (A4 size). Submissions may be of two kinds: - Normal submissions, included in the EPTCS proceedings. - Presentation-only submissions. These could overlap with submissions to other conferences or journals, and will not be included in the proceedings. These provide an opportunity to present innovative ideas and get feedback from a technically competent audience. The page limit is 18 pages including the bibliography but excluding well-marked appendices. The page limit is the same for both kinds of submissions, please indicate clearly whether you intend you paper to be included in the proceedings or not. Papers must be submitted electronically at the following URL: http://www.easychair.org/conferences/?conf=secco11 A special issue of Journal of Computer Security (JCS) has been arranged in collaboration with TOSCA (ARSPA-WITS) 2011. Selected papers from both workshops will be invited for submission, and will be peer-reviewed according to the standard policy of JCS. PROGRAM COMMITTEE ================= * Miguel E. Andres (Ecole Polytechnique, France) * Kostas Chatzikokolakis (Ecole Polytechnique, France; co-chair) * Stephanie Delaune (ENS Cachan, France) * Ralf Kuesters (University of Trier, Germany) * Gavin Lowe (University of Oxford, UK) * Jun Pang (University of Luxembourg, Luxembourg; co-chair) * Mark Ryan (University of Birmingham, UK) * Dominique Unruh (Saarland University, Germany) * Luca Vigano (University of Verona, Italy) * Chenyi Zhang (University of New South Wales, Australia) From pmt6sbc at maths.leeds.ac.uk Mon May 16 06:45:01 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Mon, 16 May 2011 11:45:01 +0100 (BST) Subject: [TYPES/announce] Final Call for Papers - Developments in Computational Models 2011 Message-ID: ================================================================ Final Call for Papers DCM 2011 7th International Workshop on Developments in Computational Models July 3, 2011 Zurich, Switzerland http://www.pps.jussieu.fr/~jkrivine/conferences/DCM2011/DCM_2011.html A satellite event of ICALP 2011 - http://icalp11.inf.ethz.ch/ Extended Deadline for submissions: 30 May, 2011 ================================================================ DCM 2011 is the seventh in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. The goal of DCM is to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2011 will be a one-day satellite event of ICALP 2011 in Zurich, Switzerland. TOPICS OF INTEREST: ------------------- Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modeling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - comparisons of different models of computations; - information-theoretic ideas in computing. IMPORTANT DATES: ---------------- Paper Submission: May 30, 2011 Notification: June 15, 2011 Workshop July 03, 2011 SUBMISSIONS: ------------ Please submit a paper via the conference EasyChair submission page: http://www.easychair.org/conferences/?conf=dcm2011 Submissions should be at most 12 pages, in PDF format. Please use the EPTCS macro package and follow the instructions of EPTCS: http://eptcs.org/ http://style.eptcs.org/ A submission may contain an appendix, but reading the appendix should should not be necessary to assess the merits of a submission. PUBLICATION: ------------ Accepted contributions will appear in EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, quality permitting full versions of selected papers will be invited for a special issue in an internationally leading journal. INVITED SPEAKER: Matthias Christandl, Swiss Federal Institute of Technology, Switzerland ----------------- PROGRAMME COMMITTEE: -------------------- Erika Andersson, Heriot-Watt University, UK Nachum Dershowitz, Tel Aviv University, Israel Eleni Diamanti, CNRS & Telecom ParisTech, France Lucas Dixon, Google, USA Elham Kashefi, University of Edinburgh, UK (Co-chair) Delia Kesner, CNRS & Universite Paris Diderot, France Helene Kirchner, INRIA, France Heinz Koeppl, ETH Zurich, Switzerland Jean Krivine, CNRS & Universite Paris Diderot, France (Co-chair) Michael Mislove, Tulane University, USA Mio Murao, University of Tokyo, Japan Vincent van Oostrom, Utrecht University, The Netherlands Femke van Raamsdonk, VU University Amsterdam, The Netherlands (Co-chair) Paul Ruet, CNRS & Institut de Mathematiques de Luminy, France Aaron Stump, University of Iowa, USA ================================================================ Further information: Elham Kashefi Jean Krivine Femke van Raamsdonk ================================================================ From olivier.laurent at ens-lyon.fr Mon May 16 16:10:16 2011 From: olivier.laurent at ens-lyon.fr (Olivier Laurent) Date: Mon, 16 May 2011 22:10:16 +0200 Subject: [TYPES/announce] Post-doctoral position at ENS Lyon Message-ID: <4DD184A8.8050602@ens-lyon.fr> LIP computer science research department at Ecole Normale Superieure de Lyon is offering a postdoctoral position for the academic year 2011-2012. All teams are concerned. In particular the Plume team focussing on logic, types and formal semantics of programming languages. LIP is a joint department with CNRS, INRIA, ENS and UCBL (U. Lyon). Our main strength is the creative interaction between long-term fundamental research, innovative software and hardware design, and transfer through industrial collaborations. This interaction provides a unique research context and fosters new trends, both theoretical and practical, with two main transverse areas: * Mathematical computer science models, methods, and algorithms; * Addressing the challenges of future computational and communication architectures. Applications until June 17th. See http://www.ens-lyon.fr/LIP/web for further informations. Olivier Laurent. -- Olivier LAURENT www : http://perso.ens-lyon.fr/olivier.laurent/ From dianne.nguyen at monash.edu Tue May 17 03:14:43 2011 From: dianne.nguyen at monash.edu (Dianne Nguyen) Date: Tue, 17 May 2011 17:14:43 +1000 Subject: [TYPES/announce] Call for Papers - Solomonoff 85th Memorial Conference Message-ID: 3rd Call for Papers Apologies for cross posting Solomonoff 85th Memorial Conference http://www.Solomonoff85thMemorial.monash.edu/ Proceedings of this multi-disciplinary conference will be published by Springer in the prestigious LNAI (LNCS) series. ************************************************************************************************************************************* Dear Colleague You are cordially invited to submit a paper and participate at Solomonoff 85th Memorial Conference which, will be held in Melbourne, Australia, between 30 November - 2 December 2011 with the possibility of a tutorial/workshop being organised on the 29th November 2011. This multi-disciplinary Conference will be run back to back with the AI 2011 Conference in Perth, Australia. This is a multi-disciplinary conference based on the wide range of applications of work related to or inspired by that of Ray Solomonoff. The contributions sought for this conference include, but are not restricted to, the following:- Statistical inference and prediction, Econometrics (including time series and panel data), in Principle proofs of financial market inefficiency, Theories of (quantifying) intelligence and new forms of (universal) intelligence test (for robotic, terrestrial and extra-terrestrial life), the Singularity (or infinity point), Philosophy of science, the Problem of induction, Evolutionary (tree) models in biology and linguistics, Geography, Climate modelling and bush-fire detection, Environmental science, Image processing, Spectral analysis, Engineering, Artificial intelligence, Machine learning, Statistics and Philosophy, Mathematics, Linguistics, Computer science, Data mining, Bioinformatics, Computational intelligence, Computational science, Life sciences, Physics, Knowledge discovery, Ethics, Computational biology, Computational linguistics, Collective intelligence, structure and computing connectivity of random nets, effect of Heisenberg's principle on channel capacity, Arguments that entropy is not the arrow of time, and etc. See also Ray Solomonoff's Publications (and his obituary). (For more details, please see Extended Call for Papers.) General and Program Chair David Dowe, Monash University, Australia Program Committee Andrew Barron, Statistics, Yale University, USA Greg Chaitin, IBM T.J. Watson Research Center, USA Fouad Chedid, Notre Dame University, Lebanon Bertrand Clarke, Medical Statistics, University of Miami, USA A. Phil Dawid, Statistics, Cambridge University, UK Peter Gacs, Boston University, USA Alex Gammerman, Royal Holloway, University of London, UK John Goldsmith, Linguistics, University of Chicago, USA Marcus Hutter, Australian National University, Australia Leonid Levin, Boston University, USA Ming Li, Mathematics, University of Waterloo, Canada John McCarthy, Stanford University, USA (Turing Award winner) Marvin Minsky, MIT, USA (Turing Award winner) Kee Siong Ng, ANU & EMC Corp, Australia Teemu Roos, University of Helsinki, Finland Juergen Schmidhuber, IDSIA, Switzerland Farshid Vahid, Econometrics, Monash University, Australia Paul Vitanyi, CWI, The Netherlands Vladimir Vovk, Royal Holloway, University of London, UK Co-ordinator Dianne Nguyen, Monash University, Australia You will find more information about the Conference at the following Website: http://www.Solomonoff85thMemorial.monash.edu/ For more details on how to submit a paper(s), please refer to the Submission Page at: http://www.Solomonoff85thMemorial.infotech.monash.edu/submission.html Important Dates Deadline of Paper Submission: (20 May 2011) Extended Deadline of Paper Submission: 16 June 2011 (New) Notification of Acceptance of Paper: 10 August 2011 Receipt of Camera-Ready Copy: 5 September 2011 Conference Dates: 30 Nov. - 2 Dec. 2011 I look forward to receiving your valuable paper contribution and attendance at the Conference. David Dowe General Chairman -------------- next part -------------- An HTML attachment was scrubbed... URL: From A.G.Setzer at swansea.ac.uk Wed May 18 19:58:52 2011 From: A.G.Setzer at swansea.ac.uk (Anton Setzer) Date: Thu, 19 May 2011 00:58:52 +0100 Subject: [TYPES/announce] PhD studentships on Programming Language Components and Specifications Message-ID: <4DD45D3C.6010703@swansea.ac.uk> The following studentships should be of high interest to type theoretists ~~ PLanCompS: Programming Language Components and Specifications Two fully-funded, full time PhD studentships ============================================ Applications are invited for two PhD studentships in connection with a joint EPSRC research project: A. Modularisation and multi-phase translation ****************************************** Centre for Software Language Engineering Royal Holloway, University of London B. Foundations of component-based language specification ***************************************************** Department of Computer Science Swansea University Candidates from the UK, EU and overseas are welcome to apply. *** Application deadline: 31st May 2011 *** ABOUT THE PLANCOMPS PROJECT [www.plancomps.org] =============================================== This exciting and highly ambitious project will develop and test a novel component-based framework for the design, specification and implementation of programming languages. It includes: * Specification of a collection of highly reusable language components called funcons (fundamental constructs); * Translation of major general-purpose programming languages (C#, Java, F#) and domain-specific languages to funcons; * Validation of funcon and language specifications by testing generated prototype implementations; * Design and implementation of an Integrated Development Environment (IDE) for component-based specification; and * Creation of a digital library of language specifications. PLanCompS is currently recruiting (preferably post-doctoral) research assistants as well as PhD students. THESIS TOPICS ============= A. Modularisation and multi-phase translation This PhD student will conduct research into the use of modular grammars described in the LDT formalism and into applications of Tear-Insert-Fold (TIF) annotations to Context Free Grammars. The TIF operators allow (i) a limited set of local tree-rewrites to be applied to a derivation tree and (ii) a new grammar (the TIF-Transformed Grammar, or TTG) which describes the transformed trees. The TTG could be used to automatically generate tree walkers, and as the input to a further phase of processing. Our goal is to ease the development of Domain Specific Language translators for non-expert users. Prior knowledge of the LDT and TIF formalisms is not required, but a familiarity with context free parser generators is desirable. B. Foundations of component-based language specification This PhD student will carry out foundational research related to the semantic specification frameworks used in the project, and will be supervised by Professor Peter Mosses. This theoretical research will extend and refine the semantic formalisms used for specifying funcons. We aim to give an I-MSOS for a revised version of the action notation used in action semantics, prove various algebraic laws for action notation, investigate how to specify continuation-handling constructs in I-MSOS, and integrate the notation, modular structure and foundations of the I-MSOS and action semantic formalisms. We will also develop I-MSOS bisimulation theory. Prior knowledge of action semantics and I-MSOS is not required, but familiarity with some form of structural operational semantics is desirable. ELIGIBILITY =========== * Candidates should have a first or upper-second (2:1) class honours degree (or equivalent) in Computer Science or a closely related area. * Candidates from the UK, EU and overseas are welcome to apply. AWARD VALUE =========== * Each studentship will cover UK/EU Tuition Fees for 42 months full-time (starting 1st October 2011 or 1st January 2012) plus stipend of GBP 13,590 p.a. tax free * International candidates will have to cover the difference between the UK/EU-level fees and international-level fees * The studentship will cover the cost of attending two overseas conferences each year HOW TO APPLY ============ A. Modularisation and multi-phase translation For general information on the research environment at Royal Holloway, see http://www.rhul.ac.uk/studyhere/researchdegrees/home.aspx and the CSLE home page at http://www.rhul.ac.uk/computerscience/research/CSLE/CSLEhome.aspx For details of this PhD project and the application process, please see http://www.rhul.ac.uk/computerscience/research/CSLE/PlanCompsPhD.aspx Informal enquiries to A.Johnstone at rhul.ac.uk B. Foundations of component-based language specification For general information on the research environment in Computer Science at Swansea, see http://www.swan.ac.uk/compsci/research/ For details of this PhD project and the application process, please see http://www.swansea.ac.uk/scholarships/research/whoiseligible,58266,en.php Informal enquiries to P.D.Mosses at swansea.ac.uk ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ From A.G.Setzer at swansea.ac.uk Thu May 19 17:34:37 2011 From: A.G.Setzer at swansea.ac.uk (Anton Setzer) Date: Thu, 19 May 2011 22:34:37 +0100 Subject: [TYPES/announce] RA positions in Swansea, UK on Programming Language Components and Specifications Message-ID: <4DD58CED.7080400@swansea.ac.uk> Dear all, here in Swansea there are 2 RA positions in the area of Programming Language Components and Specifications available which should be of great interest to type theoretists. Anton Setzer Two 3-year Research Assistant Posts PLanCompS: Programming Language Components and Specifications Department of Computer Science, Swansea University Salary scale: GBP 26,629 to 29,972 per annum. Closing date: 09 Jun 2011 These two posts will support the EPSRC joint research project PLanCompS: Programming Language Components and Specifications. The Swansea team led by Professor Mosses at the Department of Computer Science, Swansea University will be working with teams from Royal Holloway, University of London and City University London; Microsoft Research Cambridge is a project partner. The Department of Computer Science at Swansea University has a strong and long-established record in the area of fundamentals of computing. The project will develop and test a novel component-based framework for design, specification and implementation of programming languages. It includes: * specification of a collection of highly reusable language components called funcons (fundamental constructs); * translation of major general-purpose programming languages (C#, Java, F#) and domain-specific languages to funcons; * validation of funcon and language specifications by testing generated prototype implementations; * design and implementation of an Integrated Development Environment (IDE) for component-based specification; and * creation of a digital library of language specifications. See the preliminary project page at www.plancomps.org for a more detailed overview. The posts provide an excellent opportunity for researchers interested in the formal specification and implementation of programming languages, and in the tools needed to support practical language development based on formal semantics. They would particularly suit candidates with a background in theoretical computer science who are interested in practical applications; a further post based at Royal Holloway focussing on the IDE, frontend and backend tooling is expected to be advertised shortly. Candidates for the posts at Swansea are required to have a first degree in Computer Science (or a closely related subject), to have actively engaged in and contributed to writing and publishing research papers, to be able to understand and specify formal semantics of programming languages, and to be able to program in C# or Java as well as in a functional or logic programming language. Candidates who already have (or will soon complete) a PhD in Computer Science (or a closely related subject) will be preferred. It is anticipated that interviews will be held on Thursday 23 June 2011. Informal enquiries may be made to Professor Peter Mosses at P.D.Mosses at swansea.ac.uk. For details of how to apply, see the vacancy announcement at www.swansea.ac.uk/personnel/vacancies/research/posttitle,58343,en.php The PLanCompS project is currently recruiting also two PhD students - see www.plancomps.org for links to the announcements. From maffei at cs.uni-saarland.de Fri May 20 03:55:42 2011 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Fri, 20 May 2011 09:55:42 +0200 Subject: [TYPES/announce] Final call for participation: 2011 COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2011) Message-ID: ============================================================ 2011 COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2011) --- Domaine de l'Abbaye des Vaux de Cernay, France , June 27-29, 2011 --- CSF associated workshops: ASA-5, FCC11 Website: http://csf2011.inria.fr/ *** Registration will close on May 31 *** --- 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 talks: Speaker: Patrick McDaniel, Penn State University Title: tba Speaker: Gerwin Klein, University of New South Wales Title: Towards Provable OS Security --- List of accepted papers: Obstruction-free Authorization Enforcement: Aligning Security With Business Objectives David Basin, Samuel J. Burri and G?nter Karjoth Integrated Specification and Verification of Security Protocols and Policies Simone Frau and Mohammad Torabi Dashti Modular Protections Against Non-control Data Attacks Cole Schlesinger, Karthik Pattabiraman, Nikhil Swamy, David Walker and Benjamin Zorn Vertical Protocol Composition Thomas Gross and Sebastian Moedersheim Formal analysis of protocols based on TPM state registers St?phanie Delaune, Steve Kremer, Mark D. Ryan and Graham Steel Automated proofs for Diffie-Hellman-based key exchanges Long Ngo, Colin Boyd and Juan Gonzalez Nieto Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols Fran?ois Dupressoir, Andrew D. Gordon, Jan J?rjens and David A. Naumann Security for Key Management Interfaces Steve Kremer, Graham Steel and Bogdan Warinschi Attacking and fixing Helios: An analysis of ballot secrecy Ben Smyth and V?ronique Cortier Local Memory via Layout Randomization Radha Jagadeesan, Corin Pitcher, Julian Rathke and James Riely Termination-Insensitive Computational Indistinguishability (and applications to computational soundness) Dominique Unruh Veri?cation of stateful processes in ProVerif Myrto Arapinis, Mark Ryan and Eike Ritter Resource-aware Authorization Policies for Statically Typed Cryptographic Protocols Michele Bugliesi, Stefano Calzavara, Fabienne Eigner and Matteo Maffei Static analysis for efficient hybrid information-flow control Scott Moore and Stephen Chong The Complexity of Quantitative Information Flow Problems Pavol Cerny, Krishnendu Chatterjee and Thomas A. Henzinger Assumptions and Guarantees for Compositional Noninterference Heiko Mantel, David Sands and Henning Sudbrock A Statistical Test for Information Leaks Using Continuous Mutual Information Tom Chothia and Apratim Guha Regret Minimizing Audits: A Learning-theoretic Basis for Privacy Protection Jeremiah Blocki, Nicolas Christin, Anupam Datta and Arunesh Sinha Information-theoretic Bounds for Differentially Private Mechanisms Gilles Barthe and Boris K?pf Dynamic Enforcement of Knowledge-based Security Policies Piotr Mardziel, Stephen Magill, Michael Hicks, Mudhakar Srivatsa A formal framework for provenance security James Cheney --- Registration: For online registration, please follow the link on the CSF website at http://csf2011.inria.fr/registration Registration is now open. Registration will close on May 31. Accomodation: The registration fee does not include hotel rooms. However, the registration website allows you to reserve a room at one of the two conference hotels : - Abbaye des Vaux-de-Cernay - H?tel des Harras Both hotels are in the grounds of the Abbaye des Vaux de Cernay, adjacent to each other. As availability is limited, a first-come, first-served policy will be applied. (Register quickly!) For details, please see http://csf2011.inria.fr/registration --- CSF Program Chairs: - Michael Backes: Saarland University and Max Planck Institute for Software Systems, Germany - Steve Zdancewic: University of Pennsylvania CSF General Chair: - Steve Kremer: INRIA, LSV, CNRS & ENS Cachan From s.p.luttik at tue.nl Fri May 20 04:56:42 2011 From: s.p.luttik at tue.nl (Bas Luttik) Date: Fri, 20 May 2011 10:56:42 +0200 Subject: [TYPES/announce] EXPRESS 2011: Call for Papers Message-ID: <4DD62CCA.7060504@tue.nl> ------------------------------------------------------------ 18th International Workshop on Expressiveness in Concurrency EXPRESS 2011 ------------------------------------------------------------ September 5, 2011, Aachen (Germany) Affiliated with CONCUR 2011 http://www.lix.polytechnique.fr/comete/EXPRESS11/ Submission of abstracts: Friday May 27, 2011 Submission of papers: Friday June 3, 2011 ------------------------------------------------------------ SCOPE AND TOPICS: The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. Their focus has traditionally been on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, and rewrite systems) on the basis of their relative expressive power. The EXPRESS workshop series has run successfully since 1994 and over the years this focus has become broadly construed. Since EXPRESS'09 we have made this development "official": we are now aiming to bring together researchers who are interested in the expressiveness and comparison of formal models that broadly relate to concurrency. In particular, this includes emergent fields such as logic and interaction, game-theoretic models, and service-oriented computing. SUBMISSION GUIDELINES: We solicit two types of submissions: * Short papers (up to 5 pages, not included in the final 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'11 EASYCHAIR server (http://www.easychair.org/conferences/?conf=express2011). The final versions of accepted full papers will be published in EPTCS. Furthermore, authors of the very best full papers will be invited to submit an extended version to a special issue of a high-quality journal. INVITED SPEAKERS: Wan Fokkink (Vrije Universiteit Amsterdam, NL) - joint invited speaker with SOS 2011 Bj?rn Victor (Uppsala University, SE) IMPORTANT DATES: Abstract submission: May 27, 2011 Paper submission: June 3, 2011 Notification date: July 11, 2011 Camera ready version: July 29, 2011 WORKSHOP CO-CHAIRS: Bas Luttik (Eindhoven University of Technology, NL) Frank Valencia (LIX, CNRS& Ecole Polytechnique, FR) PROGRAMME COMMITTEE: Filippo Bonchi (CNRS& ENS Lyon, FR) Sibylle Fr?schle (Universit?t Oldenburg, DE) Rob van Glabbeek (NICTA, Sydney, AU) Cosimo Laneve (University of Bologna, IT) Sergio Maffeis (Imperial College London, UK) Faron Moller (Swansea University, UK) Philippe Schnoebelen (LSV, CNRS& ENS Cachan, FR) Jiri Srba (Aalborg University, DK) Jan Strej?ek(Masaryk University, Brno, CZ) Alwen Tiu (ANU, Canberra, AU) From Peter.OHearn at eecs.qmul.ac.uk Fri May 20 10:13:24 2011 From: Peter.OHearn at eecs.qmul.ac.uk (Peter O'Hearn) Date: Fri, 20 May 2011 15:13:24 +0100 Subject: [TYPES/announce] Lectureship at Queen Mary, Univ of London Message-ID: <1AA63BAC-A5D2-41D4-B678-1FD51B29256E@dcs.qmul.ac.uk> ----------- Lectureship in Computer Science, with focus on Logic, Verification, Program Analysis... ----------- Queen Mary, University of London is looking to appoint a full time permanent Lecturer in the School of Electronic Engineering and Computer Science. This lectureship is to strengthen the School's work in the broad area of mathematical logic and program verification and analysis. We are particularly looking for applicants that complement our existing strengths in separation logic, shape analysis and liveness analysis. Areas of interest include, but are not limited to, probabilistic verification, verification for dynamical systems, concurrency, automata, abstract interpretation, theorem proving and constraint solving. The successful applicant will work in the Theoretical Computer Science group headed by Professor Peter O'Hearn. This group includes a range of academics whose work relates to logic and program verification, underpinned by research funding of over ?8m. The group maintains strong links with Imperial College London, University of Oxford and Microsoft Research Cambridge. See http://www.dcs.qmul.ac.uk/research/logic/QM-EECS-TCS/Welcome.html for more information on our research. The closing date for applications is 20th June 2011. Salary will be in the range of ?37,669 - ?46,938 per annum. More details on the post and the application procedure may be found on http://webapps.qmul.ac.uk/hr/vacancies/jobs.php?id=2378 From maon at eecs.qmul.ac.uk Sat May 21 08:40:31 2011 From: maon at eecs.qmul.ac.uk (Noam Rinetzky) Date: Sat, 21 May 2011 13:40:31 +0100 Subject: [TYPES/announce] Call for Papers: APLAS 2011 (The 9th Asian Symposium on Programming Languages and Systems) Message-ID: ========================================================== APLAS 2011 Call For Papers Ninth Asian Symposium on Programming Languages and Systems Kenting, Taiwan, December 5--7, 2011 (co-located with CPP 2011) http://flolac.iis.sinica.edu.tw/aplas11/ ========================================================== 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 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 6461, 5904, 5356, 4807, 4279, 3780, 3302, and 2895. The 2011 edition will be held at Kenting, a seaside resort in Southern Taiwan. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: + semantics, logics, foundational theory; + design of languages and foundational calculi; + type systems; + compilers, interpreters, abstract machines; + program derivation and transformation; + program analysis, verification, model-checking, software security; + concurrency, constraints, domain-specific languages; + tools for programming, verification, implementation. APLAS 2011 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. IMPORTANT DATES: Abstract Deadline: June 13, 2011 Submission Deadline: June 17, 2011 (GMT) Notification: August 29, 2011 Camera-Ready: September 19, 2011 INVITED SPEAKERS: Nikolaj Bjorner, Microsoft Research Redmond Ranjit Jhala, UC San Diego Peter O'Hearn, Queen Mary U. London Sriram Rajamani, Microsoft Research India SUBMISSION INFORMATION: We solicit submissions in two categories: 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. 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 at http://www.easychair.org/conferences/?conf=aplas2011. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings are planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. GENERAL CHAIR: Tyng-Ruey Chuang, Academia Sinica, Taiwan PROGRAM CHAIR: Hongseok Yang, U. Oxford aplas2011 at easychair.org PROGRAM COMMITTEE: Lars Birkedal (ITU, Denmark) James Brotherston (Imperial College, UK) Kung Chen (National Chengchi U., Taiwan) Wenguang Chen (Tsinghua U., China) Wei-Ngan Chin (NUS, Singapore) Javier Esparza (TUM, Germany) Xinyu Feng (USTC, China) Jerome Feret (INRIA, France) Matthew Fluet (RIT, USA) Rajiv Gupta (UC Riverside, USA) Masahito Hasegawa (Kyoto U., Japan) Radha Jagadeesan (Depaul U., USA) Naoki Kobayashi (Tohoku U., Japan) Daniel Kroening (U. Oxford, UK) Rupak Majumdar (MPI-SWS, Germany) Andrzej Murawski (U. Leicester, UK) Paulo Oliva (Queen Mary U. London, UK) Doron Peled (Bar Ilan U., Israel) Sukyoung Ryu (KAIST, Korea) Sriram Sankaranarayanan (U. Colorado, USA) Armando Solar-Lezama (MIT, USA) Sam Staton (U. Cambridge, UK) Viktor Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (U. Oxford, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam Rinetzky, Queen Mary U. London (Publicity chair) Yih-Kuen Tsay, National Taiwan University (Finance chair) From elaine at mat.ufmg.br Sun May 22 09:45:06 2011 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Sun, 22 May 2011 13:45:06 +0000 (UTC) Subject: [TYPES/announce] LSFA 2011 - Deadline extended and call for posters (new!) Message-ID: ***** Deadline extended ***** LSFA 2011 - Sixth Workshop on Logical and Semantic Frameworks, with Applications August 27th, 2011, Belo Horizonte, Minas Gerais, Brazil Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and 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 o Proof theory o Type theory o Automated deduction * Semantic frameworks o Specification languages and meta-languages o Formal semantics of languages and systems o Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA 2011 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. Invited Speakers 01 Pete Manolios (Northeastern University) 02 Arnon Avron (Tel-Aviv University) 03 Luiz Carlos Pereira (PUC-Rio) Program Committee Simona Ronchi della Rocca (co-chair, UNITO, Italy) Elaine Gouvea Pimentel (co-chair, UFMG, Brazil) Luis Farinas del Cerro (IRIT, France) Edward Hermann Haeusler (PUC-Rio, Brazil) Mauricio Ayala-Rincon (UnB, Brazil) Mario Benevides (Coppe-UFRJ, Brazil) Eduardo Bonelli (UNQ, Argentina) Marcelo Correa (IM-UFF, Brazil) Clare Dixon (Liverpool, UK) Gilles Dowek (Polytechnique-Paris, France) William Farmer (Mcmaster, Canada) Maribel Fernandez (King's College, UK) Marcelo Finger (IME-USP, Brazil) Alwyn Goodloe (NASA LaRC) Fairouz Kamareddine (Heriot-Watt Univ, UK) Delia Kesner (Paris-Jussieu, France) Luis da Cunha Lamb (UFRGS, Brazil) Joao Marcos (UFRN, Brazil) Flavio L. C. de Moura (UnB, Brazil) Ana Teresa Martins (UFC, Brazil) Martin Musicante (UFRN, Brazil) Claudia Nalon (UnB, Brazil) Vivek Nigam (Ludwig-Maximilians-Universitat Munchen) Luca Paolini (UNITO, Italy) Jonathan Seldin (Univ-Lethbridge , Canada) Luis Menasche Schechter (UFRJ, Brazil) Organizing Committee Mauricio Ayala-Rincon Edward Hermann Hauesler PUC-Rio Elaine Pimentel (Local-chair) Simona Ronchi della Rocca Dates and Submission Paper submission deadline: May 31st (new) Author notification: June 30 Camera ready: July 31st Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA 2011 page at EasyChair until the submission deadline in May 23, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using EPTCS style. 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 (tbc). 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. A special issue of the first edition of the workshop appeared in the Journal of Algorithms, a special issue of the second edition of the workshop appeared in the J.IGPL and a special edition of TCS is being prepared with selected contributions from the third and the forth editions of LSFA. At least one of the authors should register at the conference. The paper presentation should be in English. Venue Belo Horizonte is the capital of the state of Minas Gerais and the third-largest metropolitan area in Brazil. A city surrounded by mountains, quite big, but still with this countryside town air. ********Call for posters (new)********* For the first time since its first edition, a poster session will be part of the programme of LSFA. Submissions should be in English, in the form of a one page abstract. The deadline for posters submission is June 15. Contact Information For more information please contact the chairs The web page of the event can be reached at: http://www.mat.ufmg.br/LSFA2011/ 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 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- From bywang at iis.sinica.edu.tw Mon May 23 00:27:42 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Mon, 23 May 2011 12:27:42 +0800 Subject: [TYPES/announce] CPP 2011 - Call for Papers Message-ID: <20110523122742.19593lk04my1qh4u@webmail.iis.sinica.edu.tw> The First International Conference on Certified Programs and Proofs (CPP 2011) CALL FOR PAPERS Kenting, Taiwan December 7--9, 2011 http://formes.asia/cpp (co-located with APLAS 2011) 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. 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; and teaching mathematics and computer science with proof assistants. INVITED SPEAKERS: * Andrew Appel (Princeton University) * Nikolaj Bj?rner (Microsoft Research) * Peter O'Hearn (Queen Mary, University of London) * Vladimir Voevodsky (Institute for Advanced Study, Princeton University) 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: Monday, June 13, 2011 Paper Submission Deadline: Friday, June 17, 2011 Author Notification: Monday, August 29, 2011 Camera Ready: Monday, September 19, 2011 Conference: December 7-9, 2011 SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2011 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. AWARD FOR BEST PAPER: An award will be given for the best accepted paper, as judged by the program committee. The committee may decline to make the award or split it among several papers. PROGRAM CO-CHAIRS: Jean-Pierre Jouannaud (INRIA and Tsinghua University) Zhong Shao (Yale University) Email: cpp2011pc at gmail.com GENERAL CHAIR: Yih-Kuen Tsay (National Taiwan University) PROGRAM COMMITTEE: Andrea Asperti (University of Bologna) Gilles Barthe (IMDEA Software Institute) Xiao-Shan Gao (Chinese Academy of Sciences) Georges Gonthier (Microsoft Research Cambridge) Chris Hawblitzel (Microsoft Research Redmond) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (INRIA and Tsinghua University) Akash Lal (Microsoft Research India) Xavier Leroy (INRIA Paris-Rocquencourt) Yasuhiko Minamide (University of Tsukuba) Shin-Cheng Mu (Academia Sinica) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Sandip Ray (University of Texas at Austin) Natarajan Shankar (SRI International) Zhong Shao (Yale University) Christian Urban (TU Munich) Viktor Vafeiadis (Max Planck Institute for Software Systems) Stephanie Weirich (University of Pennsylvania) Kwangkeun Yi (Seoul National University) PUBLICITY CHAIR: Bow-Yaw Wang (Academia Sinica, INRIA and Tsinhua University) ORGANIZING COMMITTEE: Tyng-Ruey Chuang (chair), Shin-Cheng Mu, Yih-Kuen Tsay (Academia Sinica and National Taiwan University) Email: cpp2011oc at gmail.com ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From Lutz.Schroeder at dfki.de Mon May 23 07:22:38 2011 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Mon, 23 May 2011 13:22:38 +0200 Subject: [TYPES/announce] FHIES 2011: Deadline Extended Message-ID: <4DDA437E.5020006@dfki.de> [Thanks for distributing the announcement below.] The submission deadlines for the International Symposium on Foundations of Health Information Engineering and Systems FHIES 2011 have been extended to Abstract Submission: 12 June 2011 Paper Submission: 19 June 2011 The call for papers is below. ---------------------------------------------------------------------------- FHIES 2011 International Symposium on Foundations of Health Information Engineering and Systems (http://www.ictac.net/FHIES2011/) 27-29 August 2011 Mabalingwe Nature Reserve, South Africa (Colocated with ICTAC 2011) Information and communication technology plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world, that are the concern of the United Nations, its Peoples and Members States. The use of software in medical devices is already raising issues in relation to safety and efficacy for manufacturers and regulators. Health information systems raise issues of both privacy and confidentiality, on the one hand, and, increasingly, patient safety on the other. Hospital and other information systems raise important issues of efficacy and interoperability. However, to capitalize on the potential of this technology in reshaping healthcare demands focused research on sound and safe development techniques from software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. Aims ===== The purpose of the new symposium series on Foundations of Software Engineering Health Informatics (FHIES) is to promote a nascent research area that aims to develop and apply theories and techniques in computing science and software engineering to modelling, building and certifying software based systems in the application domain of healthcare. Many of these systems are already regulated in many jurisdictions and many more of them will become regulated in the future. Research on theories, techniques and tools of software modelling, verification and validation has been an important area of computer science and software engineering, known as Formal Methods. This research addresses the challenging problem of design and certification of safety or mission critical software systems through abstraction and decomposition techniques based on the use of mathematical modelling theories and sound engineering methods. Formal methods have primarily addressed the correctness of systems used in the industrial, financial, and defence applications. However, they have recently found application in modelling and analysis of complex systems that involve interacting behaviour of many kinds of objects and agents, including software systems, physical objects and humans. The models of these systems have both discrete and continuous behaviour, and both qualitative and quantitative (e.g., spatial timing and probabilistic) properties. It is believed that these methods can be used for modelling problems of health informatics, which presents the challenge of scalability. Software plays a critical role in sustainable health care, both as part of the solution and as part of the problem. Software intensive information systems are needed to support the collection and processing of vast amounts of data via different devices, and allow policy makers to access and share these data, and to support their decision making and validation. Software systems can be developed for managing, controlling and monitoring policies, processes and workflows in medical systems. Software systems can be developed to help create the sophisticated medical devices that are simply impossible to build without the software. On the other hand, the application of software raises challenging issues in safety, security and privacy, and increases the complexity of healthcare workflows and the need for new business policies. Paper Submissions ============== We solicit high quality submissions reporting on 1. original research contributions (18 pages maximum in LNCS format) 2. application experience, case studies and software prototypes (18 pages maximum in LNCS format) 3. surveys, comparisons, and state-of-the-art reports (18 pages maximum in LNCS format) 4. position papers that define research projects with identified challenges and milestones (10 pages maximum in LNCS format) 5. proposals for panel discussions, with at least three named panellists, about a topical question (5 pages maximum in LNCS format). All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions should be in English, prepared in the LNCS format. Papers should be submitted at http://www.easychair.org/conferences/?conf=fhies2011. Submission constitutes a commitment to attend and present a paper, if accepted. All accepted papers will be included in the pre-event proceedings of the symposium and considered for EXCEPT FOR the proposals for panel discussions inclusion in a special issue of the Springer Innovations in Systems and Software Engineering (ISSE), following revision and re-review. Important Dates =========== Abstract Submission 12 June 2011 Paper Submission 19 June 2011 Notification of acceptance 18 July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 Organization ========= General Chairs * Peter Haddawy, UNU-IIST, Macao * Tom Maibaum, McMaster University, Canada Programme Chairs * Zhiming Liu, UNU-IIST, Macao * Alan Wassyng, McMaster University, Canada Organising Chair * Hao Wang, UNU-IIST, Macao Program Committee * Syed Mohamed Aljunid, UNU-IIGH * Sebastian Fischmeister, University of Waterloo, Canada * Peter Haddawy, UNU-IIST, Macao * Jozef Hooman, Embedded Systems Institute and Radboud University Nijmegen, The Netherlands * Michaela Huhn, TU Clausthal, Germany * Mark Lawford, McMaster University, Canada * Insup Lee, University of Pennsylvania, USA * Martin Leucker, TU Munich, Germany * Wendy MacCaull, St. Francis Xavier University, Canada * Tom Maibaum, McMaster University, Canada * Dominique Mery, LORIA and Universite Henri Poincare Nancy 1, France * Jun Pang, University of Luxembourg, Luxembourg * David Robertson, University of Edinburgh, UK * Lutz Schr?der, DFKI Bremen and University of Bremen, Germany * Jens H. Weber, University of Victoria, Canada * Liang Xiao, Hubei University of Technology, P.R.China -- -------------------------------------- Prof. Dr. Lutz Schr?der Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder at dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum f?r K?nstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch?ftsf?hrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From bruni at di.unipi.it Mon May 23 09:48:38 2011 From: bruni at di.unipi.it (Roberto Bruni) Date: Mon, 23 May 2011 15:48:38 +0200 Subject: [TYPES/announce] CfP TGC 2011 Message-ID: <4DDA65B6.1030202@di.unipi.it> An HTML attachment was scrubbed... URL: From haskellsymp at gmail.com Wed May 25 17:53:01 2011 From: haskellsymp at gmail.com (Haskell Symposium) Date: Wed, 25 May 2011 23:53:01 +0200 Subject: [TYPES/announce] 2nd CFP -- Haskell Symposium 2011 Message-ID: "Haskell 2011" ACM SIGPLAN Haskell Symposium 2011 Tokyo, Japan 22nd September, 2011 2nd CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2011/ The ACM SIGPLAN Haskell Symposium 2011 will be co-located with the 2011 International Conference on Functional Programming (ICFP), in Tokyo, Japan. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Practice and Experience, general experience with Haskell in education and industry. 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. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Submission Details * Submission Deadline: Monday, 6th June 2011 * Author Notification: Friday, 1st July 2011 * Final Papers Due : Sunday, 10th July 2011 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2011, the 2011 Haskell Symposium web page. * http://www.icfpconference.org/icfp2011, the ICFP 2011 web page. * https://www.easychair.org/conferences/?conf=haskell2011 the EasyChair submission site Programme Committee * Koen Claessen, Chalmers University of Technology (chair) * Conal Elliott, LambdaPix * Andy Gill, University of Kansas * Ralf Hinze, Oxford University * Graham Hutton, University of Nottingham * John Launchbury, Galois, Inc. * Sam Lindley, University of Edinburgh * Rita Loogen, Philipps-Universit?t Marburg * Neil Mitchell, Standard Chartered * Matthew Naylor, University of York * Bruno Oliveira, Seoul National University * Dimitrios Vytiniotis, Microsoft Research * Steve Zdancewic, University of Pennsylvania From frederic.loulergue at univ-orleans.fr Thu May 26 05:07:36 2011 From: frederic.loulergue at univ-orleans.fr (=?ISO-8859-1?Q?Fr=E9d=E9ric_Loulergue?=) Date: Thu, 26 May 2011 11:07:36 +0200 Subject: [TYPES/announce] Cfp: HLPP 2011 (ACM SIGPLAN Workshop on High-level Parallel Programming and Applications) Message-ID: <4DDE1858.8070500@univ-orleans.fr> 5th ACM SIGPLAN Workshop on High-level Parallel Programming and Applications Tokyo, September 18, 2011 Affiliated to ICFP 2011 http://www.icfpconference.org/icfp2011 Sponsored by ACM SIGPLAN http://www.hlpp-workshop.org/hlpp2011 AIMS AND SCOPE As processor and system manufacturers adjust their roadmaps towards increasing levels of both inter and intra-chip parallelism, so the urgency of reorienting the mainstream software industry towards these architectures grows. At present, popular parallel and distributed programming methodologies are dominated by low-level techniques such as send/receive message passing, or equivalently unstructured shared memory mechanisms. Higher-level, structured approaches offer many possible advantages and have a key role to play in the scalable exploitation of ubiquitous parallelism. This workshop provides a forum for discussion and research about such high-level approaches to parallel programming. TOPICS We welcome submission of original, unpublished papers in English on topics including (but not limited to) the following aspects of multi-core, parallel, distributed, grid and cloud computing: * High-level programming and performance models (BSP, CGM, LogP, MPM, etc.) and tools * Declarative parallel programming methodologies * Algorithmic skeletons and constructive methods * Declarative parallel programming languages and libraries: semantics and implementation * Verification of declarative parallel and distributed programs * Applications using high-level languages and tools * Teaching experience with high-level tools and methods PROGRAMME COMMITTEE * PC Chair: Kiminori Matsuzaki (Kochi University of Technology, Japan) * PC Members: o Jeremiah Willcock (Indiana University, USA) o Pavan Balaji (Argonne National Laboratory, USA) o Rita Loogen (University of Marburg, Germany) o Shinichi Yamagiwa (Kochi University of Technology, Japan) o Susanna Pelagatti (University of Pisa, Italy) o Sven-Bodo Scholz (University of Herfordshire, UK) o Tasuku Hiraishi (Kyoto University, Japan) o Wei Ngan Chin (National University of Singapore, Singapore) IMPORTANT DATES * Submission: *June 16th, 2011 at 23:59 GMT* * Notification: July 1st, 2011 * Final version: July 11th, 2011 From pangjun at gmail.com Thu May 26 07:20:17 2011 From: pangjun at gmail.com (Jun PANG) Date: Thu, 26 May 2011 13:20:17 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at SAC'12: 1st CfP Message-ID: ================================================== 27th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 25 - 29, 2012, Riva del Garda (Trento), Italy More information: http://www.win.tue.nl/sacsvt12/ and http://www.acm.org/conferences/sac/sac2012/ =================================================== Important dates --------------- * August 31th 2011: Submission deadline * October 12th 2011: Notification of acceptance/rejection * November 2nd 2011: 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-six years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2012 is sponsored by SIGAPP and will be hosted by the Microsoft Research - University of Trento Researcher Centre for Computational and Systems Biology, at Riva del Garda (Trento), Italy. 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/sac2012/. 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 2012 proceedings. A special issue of Innovations in Systems and Software Engineering (ISSE) has been. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of ISSE. Program committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Chris Hankin, Imperial College, UK 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, Oxford University, UK Martin Steffen, University of Oslo, Norway Marielle Stoelinga, University of Twente, the Netherlands Tim Willemse, Eindhoven University of Technology, The Netherlands From gvidal at dsic.upv.es Thu May 26 07:30:04 2011 From: gvidal at dsic.upv.es (German Vidal) Date: Thu, 26 May 2011 13:30:04 +0200 Subject: [TYPES/announce] LOPSTR 2011 - call for participation Message-ID: <50E811D6-00B9-4A4C-BB63-CBBE50A4F707@dsic.upv.es> (our apologies if you receive multiple copies of this message) ============================================================ CALL FOR PARTICIPATION 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011, AAIP 2011 and WFLP 2011) ============================================================ ONLINE REGISTRATION IS OPEN: http://www.imada.sdu.dk/~petersk/OLP/registration.html EARLY REGISTRATION DEADLINE: May 30, 2011 (next Monday!) The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. SYMPOSIUM PROGRAM (tentative): Monday, July 18, 2011: 14:00 - 15:00: Session 1 * Thomas Stroeder, Peter Schneider-Kamp, J?rgen Giesl, Fabian Emmes and Carsten Fuhs. A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog * Olivier Namet, Maribel Fernandez and Helene Kirchner. A Strategy Language for Graph Rewriting Coffee break 15:30 - 17:30: Session 2 * Paulo Moura. Meta-Predicate Semantics * Jose F. Morales, Manuel Hermenegildo and R?my Haemmerl?. Modular Extensions for Modular (Logic) Languages * Nik Sultana. A prototype refactoring tool based on a mechanically-verified core * C?line Dandois and Wim Vanhoof. Clones in logic programs and how to detect them Tuesday, July 19, 2011: 09:00 - 10:00: LOPSTR Invited Talk * John Gallagher. Coffee break 10:30 - 12:30: Session 3 * Wim Vanhoof. On the partial deduction of non-ground meta-interpreters * Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni. Using Real Relaxations During Program Specialization * Hirohisa Seki. Proving Properties of Co-logic Programs by Unfold/Fold Transformations * Rafael Caballero, Adrian Riesco, Alberto Verdejo and Narciso Marti- Oliet. Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees Lunch break 14:00 - 15:00: Session 4 * Giovanni Bacci, Marco Comini, Marco A. Feli? and Alicia Villanueva. Automatic Synthesis of Specifications for Curry Programs * Jesus Almendros-Jimenez, Rafael Caballero, Yolanda Garc?a-Ruiz and Fernando Saenz-Perez. A Declarative Embedding of XQuery in a Functional-Logic Language Coffee break 15:30 - 17:30: Session 5 * Elvira Albert, Miguel Gomez-Zamalloa and Jos? Miguel Rojas Siles. Resource-driven CLP-based Test Case Generation * Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano and Isao Sasano. Marker-directed optimization of UnCAL graph transformations * Sneyers and Daniel De Schreye. Probabilistic Termination of CHRiSM Programs * Paolo Pilozzi and Daniel De Schreye. Improved termination analysis of CHR using self-sustainability analysis Wednesday, July 20, 2011: 9:00 - 10:00: PPDP/LOPSTR Invited Talk * Fritz Henglein. Coffee break 10:30 - 11:30: PPDP/LOPSTR Invited Talk * Vitaly Lagoon. The Challenges of Constraint-Based Test Generation Coffee break 11:30 - 12:30: Session 6: * Pedro Cabalar and Stephane Demri. Automata-based Computation of Temporal Equilibrium Models * Demeyer and Wim Vanhoof. Proper Granularity for Atomic Sections in Concurrent Programs Lunch and Excursion ============================================================ From peterol at ifi.uio.no Thu May 26 15:19:42 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Thu, 26 May 2011 21:19:42 +0200 Subject: [TYPES/announce] 2nd CfP: 8th International Symposium on Formal Aspects of Component Software Message-ID: --------------------------------------------------------------------- Call for Papers FACS 2011 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- *** Springer LNCS proceedings *** *** Science of Computer Programming special issue *** *** Abstract submission deadline: June 10 *** Aims and Scope: The component-based software development approach has emerged as a promising paradigm to cope with the complexity of present-day software systems by bringing sound engineering principles into software engineering. However, many challenging conceptual and technological issues still remain in component-based software development theory and practice. Moreover, the advent of service-oriented computing has brought to the fore new dimensions, such as quality of service and robustness to withstand inevitable faults, that require revisiting established component-based concepts in order to meet the new requirements of the service-oriented paradigm. FACS 2011 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The symposium seeks to address the applications of formal methods in all aspects of software components and services. Specific topics include, but are not limited to: - formal models for software components and their interaction - formal aspects of services, service oriented architectures, and business processes - design and verification methods for software components and services - composition and deployment: models, calculi, languages - formal methods and modeling languages for components and services - model based and GUI based testing of components and services - component/service re-engineering and reuse - models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services - components for real-time, safety-critical, secure, and/or embedded systems - industrial or experience reports, and case studies - update and reconfiguration of component and service architectures - component systems evolution and maintenance - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self-adaptive systems Past Events: FACS'11 is the eighth event in a series of events founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The previous workshops in the FACS series were held in Pisa (September 2003, co-located with FM'03), Macau (October 2005), Prague (September 2006), Sophia-Antipolis (September 2007), Malaga (September 2008), Eindhoven (October 2009, held as part of the Formal Methods Week), and Guimaraes (October 2010). Invited speakers: Jose Meseguer (University of Illinois at Urbana-Champaign) John Rushby (SRI International) Submission: We solicit high-quality submissions reporting on: A- original research contributions (18 pages max, LNCS format); B- applications and experiences (18 pages max, LNCS format); C- surveys, comparisons, and state-of-the-art reports (18 pages max, LNCS format); D- tool papers (6 pages max, LNCS format); related to the topics mentioned above. In addition, we also solicit submissions to the Doctoral Track of FACS 2011, in the form of abstracts (2 pages, LNCS format) concisely capturing PhD-work-in-progress, related theme, context, research questions, envisaged contributions, and partial results. 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=facs2011. The final version of the paper must be prepared in LaTeX, adhering to the LNCS format. Publication: All accepted papers will appear in the pre-proceedings of FACS 2011. Revised versions of accepted papers in the categories A-D above will appear in the post-proceedings of the symposium that will be published as a volume in Springer's Lecture Notes in Computer Science series. 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: Categories A-D abstract submission: June 10, 2011 Categories A-D submission: June 17, 2011 Categories A-D acceptance notification: August 9, 2011 Doctoral Track submission: August 12, 2011 Doctoral Track acceptance notification: August 20, 2011 Symposium: September 14-16, 2011 Venue: FACS 2011 is hosted by the Department of Informatics at the University of Oslo. The symposium will take place in the new modern computer science building on the main campus of the university. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Program chairs: Farhad Arbab (Leiden University and CWI, The Netherlands) and Peter Olveczky (University of Oslo, Norway) Program committee: Erika Abraham (RWTH Aachen University, Germany) Farhad Arbab (Leiden University and CWI, The Netherlands) Christel Baier (Technical University of Dresden, Germany) Luis Barbosa (University of Minho, Portugal) Mihaela Bobaru (NASA/JPL, USA) Frank de Boer (CWI, The Netherlands) Christiano Braga (Universidade Federal Fluminense, Brazil) Roberto Bruni (University of Pisa, Italy) Carlos Canal (University of Malaga, Spain) Francisco Duran (University of Malaga, Spain) Rolf Hennicker (Ludwig-Maximilians-Universitaet Munich, Germany) Alexander Knapp (Augsburg University, Germany) Zhiming Liu (IIST UNU, Macau) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia Antipolis, France) Sun Meng (Peking University, China) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Frantisek Plasil (Charles University, Czech Republic) Gwen Salaun (Grenoble INP - INRIA, France) Bernhard Schaetz (fortiss GmbH, Germany) Wolfram Schulte (Microsoft Research, Redmond, USA) Nishant Sinha (NEC Labs, Princeton, USA) Marjan Sirjani (Reykjavik University, Iceland) Volker Stolz (University of Oslo, Norway) Carolyn Talcott (SRI International, USA) Emilio Tuosto (University of Leicester, UK) Steering Committee: Zhiming Liu (coordinator) (IIST UNU, Macau) Farhad Arbab (Leiden University and CWI, The Netherlands) Luis Barbosa (University of Minho, Portugal) Carlos Canal (University of Malaga, Spain) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia-Antipolis, France) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Bernhard Schaetz (fortiss GmbH, Germany) Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From Klaus.Havelund at jpl.nasa.gov Thu May 26 15:58:20 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (318M)) Date: Thu, 26 May 2011 12:58:20 -0700 Subject: [TYPES/announce] [fm-announcements] RV 2011 final CfP -- paper deadline extension: June 12, 2011 Message-ID: ******** Paper submission deadline extended to June 12, 2011 ******** International Conference on Runtime Verification (RV 2011) September 27 - 30, 2011 San Francisco, California, USA at the Historic Fairmont Hotel http://rv2011.eecs.berkeley.edu/ Runtime verification (RV) is concerned with monitoring and analysis of software or hardware system executions. The field is often referred to under different names, such as runtime verification, runtime monitoring, runtime checking, runtime reflection, runtime analysis, dynamic analysis, runtime symbolic analysis, trace analysis, log file analysis, etc. RV can be used for many purposes, such as security or safety policy monitoring, debugging, testing, verification, validation, profiling, fault protection, behavior modification (e.g., recovery), etc. A running system can be abstractly regarded as a generator of execution traces, i.e., sequences of relevant states or events. Traces can be processed in various ways, e.g., checked against formal specifications, analyzed with special algorithms, visualized, etc. Topics of interest include, but are not limited to: * program instrumentation techniques * specification languages for writing monitors * dynamic program slicing * record-and-replay * trace simplification for debugging * extraction of monitors from specifications * APIs for writing monitors * programming language constructs for monitoring * model-based monitoring and reconfiguration * the use of aspect oriented programming for dynamic analysis * algorithmic solutions to minimize runtime monitoring impact * combination of static and dynamic analysis * full program verification based on runtime verification * intrusion detection, security policies, policy enforcement * log file analysis * model-based test oracles * observation-based debugging techniques * fault detection and recovery * model-based integrated health management and diagnosis * program steering and adaptation * dynamic concurrency analysis * dynamic specification mining * metrics and statistical information gathered during runtime * program execution visualization * data structure repair for error recovery * parallel algorithms for efficient monitoring * monitoring for effective fault localization and program repair The RV series of events started in 2001, as an annual workshop. The RV'01 to RV'05 proceedings were published in ENTCS. Since 2006, the RV proceedings have been published in LNCS. In year 2010, RV became an international conference. Links to past RV events can be found at the permanent URL: http://runtime-verification.org INVITED SPEAKERS Dawson Engler, Stanford University Title: "Making Finite Verification of Raw C Code Easier than Writing a Test Case" Cormac Flanagan, University of California, Santa Cruz Title: "Efficient and Precise Dynamic Detection of Destructive Races" Wolfgang Grieskamp, Google Title: "Utilizing Protocol Contracts for Verifying Services in the Cloud" Sharad Malik, Princeton University Title: "Runtime Verification: A Computer Architecture Perspective" Vern Paxson, University of California, Berkeley Title: "Approaches and Challenges for Detecting Network Attacks in Real-Time" Steven P. Reiss, Brown University Title: "What is My Program Doing? Program Dynamics in Programmer's Terms" PAPER SUBMISSION RV will have two research paper categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. * Regular papers (up to 15 pages) should present original unpublished results. Applications of runtime verification are particularly welcome. A Best Paper Award (USD 300) will be offered. * Short papers (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (5-10 minutes) and poster sessions. In addition to short and regular papers, tool demonstration papers and tutorial proposals are welcome. * Tool demonstration papers (up to 5 pages) should briefly introduce the problem solved by the tool and give the outline of the demonstration. A Best Tool Award (USD 200) will be offered. * Tutorial proposals (up to 2 pages) on any of the topics above, as well as on topics at the boundary between RV and other domains, are welcome. Accepted tutorials will be allocated up to 15 pages in the conference proceedings. Tutorial presentations will be at least 2 hours. All accepted papers, including tutorial and tool papers, will appear in the LNCS proceedings. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'11 to present the paper. Papers must be submitted electronically using the EasyChair system. A link to the electronic submission page will be made available on the RV'11 web page. IMPORTANT DATES June 12, 2011 - Submission of regular and short papers (Firm Deadline) June 12, 2011 - Submission of tutorial and tool demonstration proposals July 24, 2011 - Notification for regular, short, and tool papers August 21, 2011 - Submission of camera-ready versions of accepted papers September 27-30, 2011 - RV 2011 Conference and tutorials ORGANIZERS Programme committee chairs: Sarfraz Khurshid (University of Texas at Austin, USA) Koushik Sen (University of California at Berkeley, USA) Local organization chairs: Jacob Burnim (University of California at Berkeley, USA) Nicholas Jalbert (University of California at Berkeley, USA) PROGRAM COMMITTEE Howard Barringer (University of Manchester, UK) Eric Bodden (Technical University Darmstadt, Germany) Rance Cleaveland (University of Maryland, USA) Mads Dam (Kungliga Tekniska h?gskolan, Sweden) Brian Demsky (University of California at Irvine, USA) Bernd Finkbeiner (Saarland University, Germany) Cormac Flanagan (University of California at Santa Cruz, USA) Patrice Godefroid (Microsoft Research Redmond, USA) Jean Goubault-Larrecq (ENS Cachan, France) Susanne Graf (Verimag, France) Radu Grosu (State University of New York at Stony Brook, USA) Lars Grunske (University of Kaiserslautern, Germany) Aarti Gupta (NEC Laboratories America, USA) Rajiv Gupta (University of California at Riverside, USA) Klaus Havelund (NASA/JPL, USA) Mats Heimdahl (University of Minnesota, USA) Gerard Holzmann (NASA/JPL, USA) Sarfraz Khurshid (University of Texas at Austin, USA) (co-chair) Viktor Kuncak (?cole Polytechnique F?d?rale De Lausanne, Switzerland) Kim Larsen (Aalborg University, Denmark) Martin Leucker (University of Luebeck, Germany) Rupak Majumdar (Max Planck Institute Germany and University of California at Los Angeles USA) Greg Morrisett (Harvard University, USA) Mayur Naik (Intel Berkeley Labs, USA) Brian Nielsen (Aalborg University, Denmark) Klaus Ostermann (University of Marburg, Germany) Corina Pasareanu (NASA Ames, USA) Wim De Pauw (IBM T. J. Watson, USA) Doron Peled (Bar Ilan University, Israel) Suzette Person (NASA Langley, USA) Gilles Pokam (Intel, Santa Clara, USA) Shaz Qadeer (Microsoft Research Redmond, USA) Derek Rayside (University of Waterloo, Canada) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Wolfram Schulte (Microsoft Research Redmond, USA) Manu Sridharan (IBM T. J. Watson, USA) Koushik Sen (University of California, Berkeley, USA) (co-chair) Peter Sestoft (IT University of Copenhagen, Denmark) Scott Smolka (State University of New York at Stony Brook, USA) Oleg Sokolsky (University of Pennsylvania, USA) Mana Taghdiri (Karlsruhe Institute of Technology, Germany) Serdar Tasiran (Koc University, Turkey) Nikolai Tillmann (Microsoft Research Redmond, USA) Shmuel Ur (Shmuel Ur Innovation, Israel) Willem Visser (University of Stellenbosch, South Africa) Mahesh Viswanathan (University of Illinois at Urbana-Champaign, USA) Xiangyu Zhang (Purdue University, USA) RV STEERING COMMITTEE Howard Barringer (University of Manchester, UK) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Insup Lee (University of Pennsylvania, USA) Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Oleg Sokolsky (University of Pennsylvania, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From antonio at iist.unu.edu Thu May 26 22:02:27 2011 From: antonio at iist.unu.edu (Antonio Cerone) Date: Fri, 27 May 2011 10:02:27 +0800 (CST) Subject: [TYPES/announce] ICTAC 2011 School on Software Engineering: Call for Participants and Applications of Scholarship Message-ID: CALL FOR APPLICATIONS - ICTAC School International School on Software Engineering Associated with ICTAC Jointly Organised by UNU-IIST and University of the Witwatersrand, Johannesburg 22-26 August 2011, Johannesburg, South Africa URL: http://www.ictac.net/ICTAC2011_School/ COURSES 1. Structured Wide-Area Programming (Jayadev Misra) 2. Verification of FreeRTOS (Jim Woodcock and Deepak D'Souza) 3. Model-based Development with Formula (Ethan Jackson) 4. Program Analysis via Symbolic Execution (Willem Visser and Matthew B. Dwyer) 5. rCOS: a Formal Model-Driven Engineering Method for Component- Based Software (Zhiming Liu) REQUIREMENTS We welcome applications from postgraduate students and researchers from academia and industry who have obtained at least an undergraduate degree in Computer Science or in a related discipline. APPLICATION AND DEADLINES An application must include * completed Application Form (please download from http://www.ictac.net/ICTAC2011_School/School-ApplForm.txt) * scanned copy of the university transcript for the completed undergraduate degree (mandatory only for applicants who do not hold an academic position); * list of publications (mandatory only for applicants who hold an academic position); * any further qualifications and information that should be taken into account. Applications should be emailed (plain text only) to school_applications at iist.unu.edu. Although the latest deadline to receive applications is 20 July 2011, the selection process will start on 15 May 2011. Each application will normally require several weeks to be processed and the applicant will be notified the acceptance or rejection of the application as soon as the application is assessed and no later than 5 August 2011. Given the limited number of positions available, early applications are strongly encouraged, especially for those applicants who intend to request financial support. The organisers may decide to close the application submission and the selection process earlier than 20 July 2011 if all available positions are filled. Accepted applicants will be required to confirm their attendance and send via fax (Fax No. +853-2871-2940; Att. Ms. Alice Pun - School Registration) * copy of current passport; * evidence of payment of registration fee (when applicable); no later than 15 days after being notified acceptance. REGISTRATION FEE There is no registration fee for accepted applicants who * are citizens of a developing country not belonging to the European Union; * do not hold any position in an industrialised country or in a country belonging to the European Union; and * are employed in academic institutions, other public research institutions or NGOs. All other accepted applicants will be requested to pay USD 400 registration fee. Lunches during the 5 day school are included in the registration fee. Developing countries are those countries whose economies are classified as low income, lower-middle income or upper-middle income by The World Bank Group. FINANCIAL SUPPORT Applicants should, where possible, try to obtain funding for their travel expenses and accommodation from academic/research institutions, government or NGOs. Applicants who need financial support must explicitly request it in the Application Form. The School Sponsors will provide financial support to a limited number of applicants who have requested it and * are citizens of a developing country not belonging to the European Union, * do not hold any position in an industrialised country or in a country belonging to the European Union, and * do not work in a private company. The financial support consists of * the reimbursement of the travel expenses for a return trip from the location of the participant's institution to the course venue up to a maximum amount decided by UNU-IIST, which will be communicated to the accepted applicants, and * accommodation for consecutive nights in Johannesburg arranged by the organising committee and starting on Sunday 21 August 2011. Participants who have been granted financial support will be reimbursed in US dollars, according to the UN official exchange rate, upon presentation of original receipts (which will be kept by UNU-IIST) up to a maximum amount decided by UNU-IIST and communicated at the time of the notification. Such a maximum amount may represent only a partial reimbursement of the travel expenses for participants from outside the Southern African region. Travel expenses will be reimbursed only for the cheapest transportation along the most direct route. Only 2nd class tickets will be reimbursed for train trips and only economy class airfares will be reimbursed for air trips. No reimbursements will be given for meals, local transportation, taxi, fuel and road toll. All UNU-IIST decisions regarding reimbursements are final. ACCOMMODATION For those participants who have been granted financial support, accommodation will be organised in shared rooms by the organising committee. All other participants who need accommodation * may request the accommodation (subject to availability) provided by the School organising committee (information and rates will be soon available at the General Information page). * may choose to organise accommodation on their own. EXAMINATION AND CERTIFICATE There is no mandatory examination associated with the school and participants who have attended all courses will receive an attendance certificate. Participants who are interested in taking an examination for credit purpose on the topics presented at the school must explicitly request it in the Application Form and submit their application no later than 15 June 2011. Participants who will pass the examination will receive a certificate suitable for credit recognition, according to the information they have provided in the Application Form. IMPORTANT DATES 20 April 2011 - Application submission opening 15 May 2011 - Selection process starting 15 June 2011 - Deadline to request for an examination 20 July 2011 - Latest deadline for application submission 5 August 2011 - Selection process closing (application submission and selection process may close earlier if all available positions are filled) ORGANISERS * Antonio Cerone, United Nations University, UNU-IIST, Macau SAR China * Zhiming Liu, United Nations University, UNU-IIST, Macau SAR China * Pekka Pihlajasaari, Data Abstraction (Pty) Ltd, South Africa * David Sherwell, University of the Witwatersrand, Johannesburg, South Africa SPONSORS * University of the Witwatersrand, Johannesburg * International Institute for Software Technology of the United Nations University (UNU-IIST) * Microsoft Research From gabriel at info.uaic.ro Fri May 27 14:47:52 2011 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Fri, 27 May 2011 21:47:52 +0300 (EEST) Subject: [TYPES/announce] MeCBIC 2011 Call for Papers (August 2011, Paris-Fontainebleau) Message-ID: Apologies for multiple copies. ---------------------------------------------------------------- Call for Papers MeCBIC 2011 5th Workshop on Membrane Computing and Biologically Inspired Process Calculi 23-24 August 2011, Paris(Fontainebleau) http://www.info.uaic.ro/~mecbic/mecbic2011/ ================================================================ *** IMPORTANT DATES *** Title and Abstract: 18 June, 2011 Paper Submission: 25 June, 2011 Notification: 01 August, 2011 Revised version: 11 August, 2011 The main aim of the workshop is to bring together researchers working in membrane computing, in biologically inspired process calculi (ambients, brane calculi, etc.) and in other related fields to present recent results and to discuss new ideas concerning such formalisms, their properties and relationships. Original research papers (including significant work-in-progress) on the membrane systems or biologically inspired process calculi are sought. Papers on the relationship between membrane systems and biologically inspired process calculi are particularly welcome. Related formal approaches in which cell compartments play an important role are also within the scope of the workshop. Topics of interest include (but are not limited to): * Biologically inspired models and calculi; * Biologically inspired systems and their applications; * Analysis of properties of biologically inspired models; * Theoretical links and comparison between different models. Invited Speaker: Cosimo Laneve (University of Bologna) Reversible Structures (joint work with Luca Cardelli) *** 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=mecbic2011. We also encourage the submission of short papers (around 8 pages) presenting new tools or platforms related to the topics of MeCBIC 2011. *** DISSEMINATION *** The workshop proceedings will be available during the meeting, and will be posted on arXiv.org. After the workshop, selected papers will be published in Scientific Annals of Computer Science, an open access journal indexed by SCOPUS, MathSciNet, DOAJ, DBLP, etc. Depending on the quality of the papers, we plan to have each two years a special issue of a well-known journal including a selection of (extended and additionally refereed) papers. This year will be published a special issue of Theoretical Computer Science which will include selected papers accepted and presented at MeCBIC 2009 and MeCBIC 2010. *** PROGRAM COMMITTEE *** * Roberto Barbuti, University of Pisa, Italy * Marco Bernardo, University of Urbino, Italy * Paola Bonizzoni, University of Milano-Bicocca, Italy * Gabriel Ciobanu, ICS, Romanian Academy, Iasi (chair) * Jean-Louis Giavitto, IRCAM CNRS, Paris, France * S.N. Krishna, IIT Bombay, Mumbai, India * Jean Krivine, University Paris 7, France * Paolo Milazzo, University of Pisa, Italy * Gethin Norman, University of Glasgow, UK * Andrew Phillips, Microsoft Research, Cambridge, UK * G. Michele Pinna, University of Cagliari, Italy * Franck Pommereau, University of Evry, France * Jason Steggles, Newcastle University, UK * Angelo Troina, University of Torino, Italy * Sergey Verlan, University Paris 12, France * Gianluigi Zavattaro, University of Bologna, 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), and EPTCS volumes 11 and 40 (2009, 2010). From giannini at di.unipmn.it Mon May 30 06:05:04 2011 From: giannini at di.unipmn.it (Paola Giannini) Date: Mon, 30 May 2011 12:05:04 +0200 Subject: [TYPES/announce] Call for Participation CS2Bio'11 Message-ID: <4DE36BD0.9090205@di.unipmn.it> ================================================================ Call for Participation CS2Bio'11 2nd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'11 9th of June 2011 Reykjavik, Iceland Programme available http://cs2bio11.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. In particular we want to encourage presentation of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present an attempt at modeling a specific biological phenomenon using formal techniques, or a technical innovation that can be applied to a range of potential biological systems. In the latter case, some emphasis on the scalability of the method will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. *** INVITED TALKS *** - Jasmin Fisher (Microsoft Research - Cambridge, UK): Model Checking Cell Fate Decisions - Gordon Plotkin (Lab for Foundation of Computer Science Edinburgh, UK): Towards a rational reconstruction of kappa *** PROGRAM COMMITTEE *** - Luca Cardelli - Francesca Cordero - Erik de Vink - Fran?ois Fages - J?r?me Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Jean-Louis Giavitto - Ion Petre - Gordon Plotkin - Angelo Troina - Verena Wolf - Gianluigi Zavattaro -- 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 M.R.Mousavi at tue.nl Mon May 30 11:28:19 2011 From: M.R.Mousavi at tue.nl (Mousavi, M.) Date: Mon, 30 May 2011 17:28:19 +0200 Subject: [TYPES/announce] Foundations of Coordination Languages and Software Architectures (Extended Deadline: June 10) Message-ID: <7DF2365FF07C0E4E89419D65CCC93C9E018E3F93BAA4@EXCHANGE11.campus.tue.nl> *************************************************** The 10th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2011) A Satellite Workshop of CONCUR 2011 Aachen (Germany), September 10, 2011 http://foclasa.lcc.uma.es/ Extended Submission Deadline: June 10th, 2011 (Abstract: June 3rd, 2011) *************************************************** Abstract ====== Computation nowadays is becoming inherently concurrent, either because of characteristics of the hardware (with multicore processors becoming omnipresent) or due to the ubiquitous presence of distributed systems (incarnated in the Internet). Computational systems are therefore typically distributed, concurrent, mobile, and often involve composition of heterogeneous components. To specify and reason about such systems and go beyond the functional correctness proofs, e.g., by supporting reusability and improving maintainability, approaches such as coordination languages and software architecture are recognised as fundamental. The goal of the FOCLASA workshop is to put together researchers and practitioners of the aforementioned fields, to share and identify common problems, and to devise general solutions in the context of coordination languages and software architectures. Topics of interest ============ Topics of interest include (but are not limited to): * Theoretical models (of coordination, of component composition, of open, concurrent, and distributed systems) * Specification, refinement, and analysis of software systems (architectures, patterns and styles, verification of functional and non-functional properties via logics or types) * Languages for interaction, coordination, architectures, and interface definition (syntax and semantics, implementation, usability, domain-specific languages) * Dynamic software architectures (mobile agents, self-organizing/adaptive/reconfigurable systems) * Tools and environments for the development of applications. In particular, practice, experience and methodologies from the following areas are solicited as well: * Service-Oriented computing * Multi-agent systems * Peer-to-peer systems * Grid computing * Component-based systems Invited Talk ======== Joe Armstrong, Ericsson, Sweden. Submissions ======== FOCLASA 2011 is a satellite workshop of the 22nd International Conference on Concurrency Theory (CONCUR 2011). It provides 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 software architecture, and explore together and disseminate solutions. 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: click here. Important Dates =========== Abstract submission: June 3rd, 2011 (**Extended**) Paper submission: June 10th, 2011 (**Extended**) Notification: July 4th, 2011 Final version due: July 18th, 2011 Workshop: September 10th, 2011 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 edition, a special issue of an international scientific journal will be devoted to FOCLASA 2011. 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 and we plan to devote a special issue of the same journal to FOCLASA 2011. Program Committee Chairs ================== MohammadReza Mousavi Eindhoven University of Technology, The Netherlands Ant?nio Ravara New University of Lisbon, Portugal Program Committee ============= Jonathan Aldrich, Carnegie Mellon University, USA Luis Barbosa, University of Minho, Portugal Bernhard Beckert, Karlsruhe Institute of Technology, Germany Antonio Brogi, University of Pisa, Italy Carlos Canal, University of M?laga, Spain Vittorio Cortellessa, University of L'Aquila, Italy Gregor Goessler, INRIA Grenoble - Rh?ne-Alpes, France Ludovic Henrio, INRIA Sophia Antipolis, France Paola Inverardi, Universit? dell'Aquila, Italy MohammadReza Mousavi, Eindhoven University of Technology, The Netherlands Jaco van de Pol, University of Twente, The Netherlands Ant?nio Ravara, Technical University of Lisbon, Portugal Gwen Sala?n, Grenoble INP - INRIA - LIG, France Carolyn Talcott, SRI International, USA Emilio Tuosto, University of Leicester, UK Mirko Viroli, University of Bologna, Italy From bruni at di.unipi.it Mon May 30 12:20:09 2011 From: bruni at di.unipi.it (Roberto Bruni) Date: Mon, 30 May 2011 18:20:09 +0200 Subject: [TYPES/announce] Last CfP TGC 2011: extended deadline Message-ID: <4DE3C3B9.4000804@di.unipi.it> An HTML attachment was scrubbed... URL: From cc2 at ecs.soton.ac.uk Mon May 30 12:48:14 2011 From: cc2 at ecs.soton.ac.uk (Corina Cirstea) Date: Mon, 30 May 2011 17:48:14 +0100 Subject: [TYPES/announce] CALCO 2011: First Call for Participation References: <20110530164814.GA10090@login.ecs.soton.ac.uk> Message-ID: ========================================================================= CALL FOR PARTICIPATION: CALCO 2011 4th International Conference on Algebra and Coalgebra in Computer Science August 29 - September 2, 2011 Winchester, UK http://calco2011.ecs.soton.ac.uk/ ========================================================================= !! REGISTRATION NOW OPEN !! Early registration deadline: July 15, 2011 ========================================================================= CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. This is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy, 2009). The fourth edition will be held in the city of Winchester (UK), a historic cathedral city and the ancient capital of Wessex and the Kingdom of England. CALCO 2011 will be preceded by the CALCO Young Researchers Workshop, CALCO-Jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. The programme of CALCO will also comprise presentations of tools based on algebraic and/or coalgebraic principles, that have been selected in the context of a dedicated workshop, CALCO-Tools. -- INVITED SPEAKERS -- * Vincent Danos (UK): Energy as Syntax * Javier Esparza (Germany): Solving Fixed-Point Equations by Derivation Tree Analysis * Philippa Gardner (UK): Abstract Local Reasoning about Program Modules * Gopal Gupta (USA): Infinite Computation, Coinduction and Computational Logic -- CALCO ACCEPTED PAPERS -- * Clement Fumex, Neil Ghani and Patricia Johann. Indexed Induction and Coinduction, Fibrationally * Jort Bergfeld and Yde Venema. Model constructions for Moss' coalgebraic logic * Jiri Adamek, Mahdie Haddadi and Stefan Milius. From Corecursive Algebras to Corecursive Monads * Sergey Goncharov and Lutz Schroeder. A Counterexample to Tensorability of Effects * Camilo Rocha and Jose Meseguer. Proving Safety Properties of Rewrite Theories * Ekaterina Komendantskaya and John Power. Coalgebraic semantics for derivations in logic programming * Adriana Balan and Alexander Kurz. Finitary Functors: from Set to Preord and Poset * Joost Winter, Marcello Bonsangue and Jan Rutten. Context-Free Languages, Coalgebraically * Marta Bilkova, Alexander Kurz, Daniela Petrisan and Jiri Velebil. Relation Liftings on Preorders * Murdoch Gabbay, Tadeusz Litak and Daniela Petrisan. Stone duality for nominal Boolean algebras with `new': topologising Banonas * Bart Jacobs. Bases as Coalgebras * Thorsten Altenkirch, Peter Morris, Fredrik Nordvall Forsberg and Anton Setzer. A categorical semantics for inductive-inductive definitions * Jun Kohjina, Toshimitsu Ushio and Yoshiki Kinoshita. Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata * Ichiro Hasuo. The Microcosm Principle and Compositionality of GSOS-Based Component Calculi * Mihai Codescu and Till Mossakowski. Refinement trees: calculi, tools and applications * Baltasar Trancon Y Widemann and Hauhs Michael. Distributive-Law Semantics for Cellular Automata and Agent-Based Models * Corina Cirstea. Model Checking Linear Coalgebraic Temporal Logics: an Automata-Theoretic Approach * Katsuhiko Sano. Generalized Product of Coalgebraic Hybrid Logics * Rasmus Ejlers Mogelberg and Sam Staton. Linearly-used state in models of call-by-value * Fredrik Dahlqvist and Dirk Pattinson. On the fusion of coalgebraic modal logics * Manuel A. Martins, Alexandre Madeira, Razvan Diaconescu and Luis Barbosa. Hybridization of Institutions -- CALCO-Tools ACCEPTED PAPERS -- * Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac and Anna Ingolfsdottir. PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates * Pawel Sobocinski and Jennifer Lantair. WiCcA: LTS generation tool for wire calculus * Francisco Duran, Camilo Rocha and Jose Maria Alvarez. Tool Interoperability in the Maude Formal Environment * Andre Martins, Luis Barbosa and Nuno Rodrigues. SHACC: A functional animator for a component calculus * Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg and Monika Seisenberger. Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras * Musab Alturki and Jose Meseguer. PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool -- LOCATION -- Winchester is a beautiful historic city in southern England, known for its 11th-century cathedral and 12th-century castle. It is located just under an hour by rail from London Waterloo, and 15 minutes by road or rail from Southampton Airport. London Heathrow is 50 miles away and London Gatwick 72 miles away. -- GRANTS -- CALCO has limited funds to support the attendance of PhD students. Details on how to apply are available on the CALCO 2011 website. -- FURTHER INFORMATION -- Queries should be emailed to calco2011 at ecs.soton.ac.uk . From eeide at cs.utah.edu Mon May 30 22:27:58 2011 From: eeide at cs.utah.edu (Eric Eide) Date: Mon, 30 May 2011 20:27:58 -0600 Subject: [TYPES/announce] CFP: PLOS '11: 6th Workshop on Programming Languages and Operating Systems Message-ID: <19940.21038.123213.133223@bas.flux.utah.edu> If you apply type-based or other advanced language ideas in the implementation of operating systems, we hope you will consider submitting a paper to PLOS '11. See the CFP below, or visit the Web site at http://plosworkshop.org/2011/ Best wishes --- Eric, Gilles, and Olaf The PLOS 2011 Organizing Committee ------------------------------------------------------------------------------- CALL FOR PAPERS Sixth Workshop on Programming Languages and Operating Systems (PLOS 2011) October 23, 2011 Hotel Cascais Miragem / Cascais, Portugal http://plosworkshop.org/2011/ Sponsored by ACM SIGOPS In conjunction with SOSP 2011 http://www.sigops.org/sosp/sosp11/ Paper submission deadline: June 17, 2011 Notification of acceptance: July 31, 2011 Final papers due: September 9, 2011 Workshop: October 23, 2011 Historically, operating system development and programming language development went hand-in-hand. Cross-fertilization was the norm. Challenges in one area were often approached using ideas or techniques developed in the other, and advances in one enabled new capabilities in both. Today, although the systems community at large retains an iron grip on C, modern programming language ideas continue to spark innovations in OS design and construction. Conversely, the systems field continues to provide a wealth of challenging problems and practical results that should lead to advances in programming languages, software designs, and idioms. This workshop will bring together researchers and developers from the programming language and operating system domains to discuss recent work at the intersection of these fields. It will be a platform for discussing new visions, challenges, experiences, problems, and solutions arising from the application of advanced programming and software engineering concepts to operating systems construction, and vice versa. Suggested paper topics include, but are not restricted to: * critical evaluations of new programming language ideas in support of OS construction * domain-specific languages for operating systems * type-safe languages for operating systems * object-oriented and component-based operating systems * language-based approaches to crosscutting system concerns, such as security and run-time performance * language support for system verification * language support for OS testing and debugging * static/dynamic configuration of operating systems * static/dynamic specialization within operating systems * the use of OS abstractions and techniques in language runtimes AGENDA The workshop will be a highly interactive event with an agenda designed to promote focused and lively discussions. Each potential participant should submit a paper as described below. The set of accepted papers will be made available to registered attendees in advance of the workshop. Participants should come to the workshop prepared with questions and comments. The workshop organizers will use the accepted papers and input from participants to compile a list of topics for working groups, to be held during the workshop. The set of topics may be extended or changed during the workshop, based on the presentation and discussion of the workshop papers. SUBMISSION GUIDELINES PLOS welcomes research, experience, and position papers; papers describing industrial experience are particularly encouraged. All papers must be written in English and should be formatted according to the ACM proceedings format. Submissions must not be more than five (5) pages in length---this limit will be strictly enforced, and shorter papers are encouraged. Papers must be submitted in PDF format via the workshop Web site. They will be reviewed by the workshop program committee and designated external reviewers. Papers will be evaluated based on technical quality, originality, relevance, and presentation. Accepted papers will be published electronically in the ACM Digital Library. The authors of accepted papers will be required to sign ACM copyright release forms. The publication of a paper in the PLOS workshop proceedings is not intended to replace future conference publication. PROGRAM COMMITTEE Yolande Berbers, KU Leuven Eric Eide, University of Utah Michael Franz, UC Irvine Robert Grimm, New York University Thomas Gross, ETH Zurich Tim Harris, Microsoft Research Cambridge Julia Lawall, University of Copenhagen Gilles Muller, INRIA/LIP6 Wolfgang Schroeder-Preikschat (chair), University of Erlangen Olaf Spinczyk, Technische Universitaet Dortmund ORGANIZING COMMITTEE Eric Eide, University of Utah Gilles Muller, INRIA/LIP6 Olaf Spinczyk, Technische Universitaet Dortmund From icfp.publicity at googlemail.com Tue May 31 04:42:58 2011 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 31 May 2011 10:42:58 +0200 Subject: [TYPES/announce] DTP 2011: Second call for talks Message-ID: Dependently Typed Programming 2011 Call for Papers 27 of August 2011 Nijmegen, The Netherland In association with ITP 2011 Deadline for submission: 10 June 2011 http://www.cs.ru.nl/dtp11 Dependently typed programming is here today: where will it go tomorrow? On the one hand, dependent type theories have grown programming languages; on the other hand, the type systems of programming languages like Haskell (and even C#) are incorporating some kinds of type-level data. When types involve data, they can capture relationships between data, internalising invariants necessary for appropriate computation. When data describe types, we can express patterns of programming in code. We're beginning to see how to take advantage of the power and precision which dependent types afford, but there are still plenty of problems to address and issues to resolve. The design space is large: this workshop is a forum for researchers who are exploring it. We hope that the workshop will attract people who work on the design and implementation of dependently typed programming languages and development environments, or who are using existing systems to develop dependently typed programs and libraries. * Submissions * If you want to give a talk or a demo at the workshop, please send us a title and an abstract before 10 June 2011 to w.swierstra{at}cs.ru.nl. Slots will be of 30 minutes (unless you ask for less). We will try to fit as many talks as possible. We aim to publish post-proceedings containing refereed papers related to the topic of the workshop in a suitable journal. More information about this will come after the workshop. * Important Dates * 10 June 2011: Submission deadline 25 June 2011: Notification of acceptance 27 August 2011: DTP workshop * Program Committee * Ana Bove, Chalmers, Sweden Matthieu Sozeau, INRIA, France Wouter Swierstra, Radboud University, The Netherlands From dario.dellamonica at uniud.it Tue May 31 09:18:50 2011 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Tue, 31 May 2011 15:18:50 +0200 Subject: [TYPES/announce] GandALF 2011: call for partecipation Message-ID: <4DE4EABA.4060404@uniud.it> [We apologize if you have received multiple copies of this message] ******************************************************************************** --------------------- GandALF 2011 -------------------- ******************************************************************************** Second International Symposium on Games, Automata, Logics, and Formal Verification Minori, Amalfi Coast, Italy, June 15-17, 2011 http://gandalf.dia.unisa.it/ ************************************************ | CALL FOR PARTECIPATION | ************************************************ 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 concrete applications, and to stimulate cross-fertilization. INVITED SPEAKERS Thomas Colcombet (CNRS, Paris FRANCE): /The monadic theory of linear orders/ Erich Graedel (RWTH Aachen University, GERMANY): /Dependence, Independence, and Incomplete Information/ Moshe Vardi (Rice University, Houston USA): /The Rise and Fall of LTL/ PROGRAMME http://gandalf.dia.unisa.it/2011/index.php?page=program.inc. REGISTRATION The registration fee for GandALF 2011 amounts to 250 euro and includes: conference participation, proceedings, coffee-breaks, conference banquet, and excursion. Extra banquet tickets will be available on site at 50 euro each. To register, go to http://gandalf.dia.unisa.it /2011/index,php?page=registration.inc and follow the instructions. The * social event *is scheduled for June 16th. Participants will enjoy a boat trip to Amalfi, where an official guide will lead the GandALF 2011 "gang" through a tour of the Amalfi Cathedral and Diocesan Museum. The social dinner will be held at the end of the tour in a typical Amalfitan restaurant. After the dinner, return to Minori by coach. Please visit the conference website (http://gandalf.dia.unisa.it ) for more information. -------------- next part -------------- An HTML attachment was scrubbed... URL: From alain.girault at inria.fr Tue May 31 16:09:04 2011 From: alain.girault at inria.fr (Alain Girault) Date: Tue, 31 May 2011 22:09:04 +0200 Subject: [TYPES/announce] PhD grant in Grenoble (France) on advanced dataflow programming for embedded systems at INRIA and ST Microelectronics Message-ID: <4DE54AE0.4010606@inria.fr> Proposal for a PhD position =========================== Title ===== Advanced dataflow programming for embedded systems: analyses for scheduling and power optimization. Location ======== Grenoble (France): INRIA Grenoble (Pop Art Team). Supervisors =========== INRIA Grenoble: Pascal FRADET and Alain GIRAULT. ST Microelectronics Ottawa: Ali-Erdem OZCAN and Pierre PAULIN. Application =========== The PhD grant is for 36 months. The gross income (i.e., before tax) is around 2.400 ? per month (29.000 ? per year) and includes health insurance. Please send your CV and recommendation letters to alain.girault at inria.fr and pascal.fradet at inria.fr. Abstract ======== In this project, we focus on dataflow models of computation to program applications for a new embedded many-core platform designed by ST Microelectronics, called P2012. The static dataflow model of computation (SDF) is widely used because it allows analysis (deadlock and boundedness) and scheduling. SDF has a clean semantics and leads to efficient implementations but it cannot express many dynamic features. In particular, it cannot express dynamic input/output rate modifications, nor dynamic topology modifications. With ST Microelectronics, we have been working on a variant of SDF able to express dynamicity while remaining verifiable (for deadlock and buffer boundedness) and schedulable. The goal of the PhD is to study analyses and code generation for this new dataflow model of computation. The purpose of these analyses is to generate distributed schedules for P2012, optimizing the power consumption and the execution time. Each computing island of P2012 is equipped with a hardware mechanism for DVFS (dynamic voltage and frequency scaling). Required Skills =============== A Master in computer science or computer engineering, with knowledge in formal methods, embedded systems, and/or real-time programming. A knowledge of dataflow programming, semantics, code generation, and/or distributed scheduling would be a plus. Context ======= The context of this work is the ST Microelectronics Platform 2012 initiative (P2012). P2012 is a many-core platform that integrates multiple clusters of processors and HW accelerators with a hierarchical memory architecture and a NoC. The position is likely to involve travels between Grenoble (INRIA) and Ottawa (ST Microelectronics). The main goal of the POP ART team (http://pop-art.inrialpes.fr) is the safe design of real-time embedded systems. We explore that area according to several research directions: programming languages, models of computation, static analysis, formal verification, implementation, ... The research within POP ART concerns: - design (component and interaction models for real-time systems, heterogeneity); - programming (synchronous, domain specific and aspect-oriented languages); - verification and correctness by construction (controller synthesis, compositionally, ...); - code generation (scheduling, fault-tolerance, compilation, ...). -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From koehler at informatik.uni-hamburg.de Wed Jun 1 04:55:10 2011 From: koehler at informatik.uni-hamburg.de (=?iso-8859-1?Q?=22Dr=2E_Michael_K=F6hler-Bussmeier=22?=) Date: Wed, 1 Jun 2011 10:55:10 +0200 Subject: [TYPES/announce] Last Call for Papers: 4th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM'11) Message-ID: <8547B8BA-621D-403C-A061-D753945147E0@informatik.uni-hamburg.de> Last Call for Papers: 4th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM'11), 10 September 2011, Aachen, Germany, organised as satellite workshop at the Twenty-Second International Conference on CONCURRENCY THEORY (CONCUR 2011). Workshop Homepage: http://web.me.com/farwer/LAM11 * Important Dates * Submission Deadline: 13 June 2011 --> Notification: 21 July 2011 --> Final Version: 17 August 2011 Workshop: 10 Sept 2011 * 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. 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 against 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 scientific and technological challenges for the modelling and programming of such large-scale, open and highly-dynamic distributed systems. 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 verification of mobile agent systems. In the past two or three years, some logics have been proposed that would be able to handle certain aspects of these requirements, but 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 the areas outlined above with a focus on logics and other formalisms for the specification 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 - 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 * 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 organiser as an introduction to the workshop. The workshop will contain invited talks, contributed talks, and a discussion session. The latter is 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?11 workshop. Submissions should not exceed 15 pages, preferably using the LaTeX article.sty class. The following formats are accepted: PDF, PS. Please send your submission electronically via EasyChair: http://www.easychair.org/conferences/?conf=lam11 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. -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 1725 bytes Desc: not available URL: From Marc.Bezem at ii.uib.no Wed Jun 1 10:02:55 2011 From: Marc.Bezem at ii.uib.no (Marcus Aloysius Bezem) Date: Wed, 01 Jun 2011 16:02:55 +0200 Subject: [TYPES/announce] TYPES 2011 in Bergen 8 - 11 Sept: Deadline for abstracts 19 June Message-ID: Types Meeting 2011 Bergen, 8 - 11 September 2011 http://www.types.name The 18-th Workshop "Types for Proofs and Programs" will take place in Bergen, Norway from 8 to 11 September 2011. CSL'11 will take place in Bergen from 12 to 15 September: http://www.eacsl.org/csl11 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: * Georges Gonthier, Cambridge * Dag Normann, Oslo * Vladimir Voevodsky, Princeton We encourage 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. The talks may be based on newly published papers, work submitted for publication, but also work-in-progress. There are no formal pre-proceedings. More details on http://www.types.name Deadline for abstracts: June 19 Submission site: https://www.easychair.org/conferences/?conf=typespre2011 Marc Bezem, University of Bergen Bengt Nordstr?m, Chalmers _________________________________________________________________________ From m.huisman at utwente.nl Wed Jun 1 10:47:02 2011 From: m.huisman at utwente.nl (Marieke Huisman) Date: Wed, 01 Jun 2011 16:47:02 +0200 Subject: [TYPES/announce] PhD position on "Semantics and Verification of Accelerator Programming" Message-ID: <4DE650E6.8080901@utwente.nl> The research group Formal Methods and Tools at the University of Twente (Enschede - The Netherlands) is looking for a PhD researcher (4 years) to work on the EU Strep project CARP (Correct and Efficient Accelerator Programming), funded by the European Union. Within the context of the CARP project, the PhD student will work in particular on: - requirements analysis for accelerator programming - the formal semantics of an intermediate programming language for describing accelerator algorithms - developing logic-based verification techniques for this intermediate programming language, taking into account common accelerator programming patterns =============================================================== Our research: ------------- In recent years, massively parallel accelerator processors, primarily GPUs, have become widely available to end-users. Accelerators offer tremendous compute power at a low cost, and tasks such as media processing, simulation, medical imaging and eye-tracking can be accelerated to beat CPU performance by orders of magnitude. Performance is gained in energy efficiency and execution speed, allowing intensive media processing software to run in low-power consumer devices. Accelerators present a serious challenge for software developers. A system may contain one or more of the plethora of accelerators on the market, with many more products anticipated in the immediate future. Applications must exhibit portable correctness, operating correctly on any configuration of accelerators, and portable performance, exploiting processing power and energy efficiency offered by a wide range of devices. The overall aims of CARP are to design techniques and tools for correct and efficient accelerator programming: - Novel & attractive methods for constructing system-independent accelerator programs - Advanced code generation techniques to produce highly optimised system-specific code from system-independent programs - Scalable static techniques for analysing system-independent and system-specific accelerator programs, both qualitatively and quantitatively The PhD candidate we are looking for is expected to work on the development of tools and techniques for correct accelerator programming. Within the consortium an intermediate programming language for accelerator programming will be developed. The PhD candidate is expected to develop a solid formal semantics for this language, together with appropriate verification techniques. An important focus of the verification work is that it will focus on bug finding, without too many false negatives, rather than on developing full correctness proofs. For the verification, it is expected that the logical basis will be permission-based concurrent separation logic. Sometimes the intermediate programming language will not provide the required efficiency, and programs will be written in a low-level language as OpenCL. Therefore, the verification techniques also will be extended to this lower level. We seek: -------- An enthusiastic PhD student with an MSc degree in Computer Science (or an equivalent qualification). The candidate should have a thorough theoretical background, a demonstrable interest in program semantics and verification, and some knowledge about multithreaded programming (in Java/C/C++). We are looking for a researcher with an independent mind who is willing to cooperate in our team. It is understood that he or she works on the topics listed above, and contributes to the expected deliverables for the project. Further we ask for good communicative and good collaboration skills. Candidates should be prepared to prove their English language skills. As a research outcome we expect publications, (prototype) tools, and a PhD thesis. Starting date of the position: December 1st, 2011, or as soon as possible thereafter. We offer: --------- - A PhD position for four years (38 hrs/week) - A stimulating scientific environment - Gross salary ranging from EUR 2042 tot E 2612 (4th yr) per month - Holiday allowance (8%), end-of-year bonus (8.3%) - Good secondary conditions, in accordance with the collective labour agreement CAO-NU for Dutch universities - A green Campus with lots of sports facilities You will be a member of the Twente Graduate School in the research programme 'Dependable and Secure Computing' under the leadership of Prof Dr Jaco van de Pol. The research programme offers advanced courses to deepen your scientific knowledge in preparation to your future career (within or outside academia). We provide our PhD students with excellent opportunities to broaden their personal knowledge and to professionalise their academic skills. Participation in national and/or international summer schools and workshops, and visits to other prestigious research institutes and universities can be part of this programme. Further information: -------------------- - FMT group: http://fmt.cs.utwente.nl/ - Dr. Marieke Huisman (Marieke.Huisman at ewi.utwente.nl) Application: ------------ Please submit your application before 1st of July, 2011 via http://www.utwente.nl/vacatures/en/. We strongly encourage interested applicants to send in their applications as soon as possible. Your application should consist of: - a cover letter (explain your specific interest and qualifications); - a full Curriculum Vitae, including a list of all courses + marks, and a short description of your MSc thesis; and - references (contact information) of two scientific staff members. From bcpierce at cis.upenn.edu Thu Jun 2 08:46:37 2011 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Thu, 2 Jun 2011 08:46:37 -0400 Subject: [TYPES/announce] Postdoc in differential privacy at the University of Pennsylvania Message-ID: <734E9EFC-9816-4296-8141-B97FF24D2D67@cis.upenn.edu> Applications are invited for a postdoc position in the theory and practice of differential privacy at the University of Pennsylvania. An outline of the hosting project is below. The ideal candidate 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. The position is for one year in the first instance, with possible renewal up to four years. Starting date is negotiable. Applications from women and members of other under-represented groups are particularly welcome. To apply, please send a CV, research statement, and the names of four people who can be asked for letters of reference to Benjamin Pierce (bcpierce at cis.upenn.edu). Inquiries can be directed to any of the PIs: Andreas Haeberlen Benjamin C. Pierce Aaron Roth ------------------------------------------------------------------------------------------------- Putting Differential Privacy to Work 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 different 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. From pangjun at gmail.com Thu Jun 2 14:45:20 2011 From: pangjun at gmail.com (Jun PANG) Date: Thu, 2 Jun 2011 20:45:20 +0200 Subject: [TYPES/announce] SecCo 2011: Last CfP (extended deadline June 12th) Message-ID: +-------------------------------------------------------------------------+ ! ! ! SecCo 2011 ! ! 9th International Workshop on Security Issues in Concurrency ! ! Aachen, Germany ! ! Monday, September 5th, 2011 ! ! http://www.lix.polytechnique.fr/~kostas/SecCo2011/ ! ! ! ! Affiliated with CONCUR 2011 ! ! ! +-------------------------------------------------------------------------+ IMPORTANT DATES =============== Papers due: June 12th, 2011 (extended) Notification: July 8th, 2011 Final paper due: July 22nd, 2011 Workshop: September 5th, 2011 BACKGROUND, AIM AND SCOPE ========================= Emerging trends in concurrency theory require the definition of models and languages adequate for the design and management of new classes of applications, mainly to program either WANs (like Internet) or smaller networks of mobile and portable devices (which support applications based on a dynamically reconfigurable communication structure). Due to the openness of these systems, new critical aspects come into play, such as the need to deal with malicious components or with a hostile environment. Current research on network security issues (e.g. secrecy, authentication, etc.) usually focuses on opening cryptographic point-to-point tunnels. Therefore, the proposed solutions in this area are not always exploitable to support the end-to-end secure interaction between entities whose availability or location is not known beforehand. The aim of the workshop is to cover the gap between the security and the concurrency communities. More precisely, the workshop promotes the exchange of ideas, trying to focus on common interests and stimulating discussions on central research questions. In particular, we look for papers dealing with security issues -- such as authentication, integrity, privacy, confidentiality, access control, denial of service, service availability, safety aspects, fault tolerance, trust, language-based security, probabilistic and information theoretic models -- in emerging fields like web services, mobile ad-hoc networks, agent-based infrastructures, peer-to-peer systems, context-aware computing, global/ubiquitous/pervasive computing. SecCo 2011 follows the success of SecCo'03 (affiliated to ICALP'03), SecCo'04 (affiliated to CONCUR'04), SecCo'05 (affiliated to CONCUR'05), SecCo'07 (affiliated to CONCUR'07), SecCo'08 (affiliated to CONCUR'08), SecCo'09 (affiliated to CONCUR'09) and SecCo'10 (affiliated to CONCUR'10). Note that this is SecCo's last year as an independent workshop. Starting from next year, SecCo is merging with several other workshops in the field to form the Conference on Security and Trust Foundations (STF) which will be part of the European Joint Conferences on Theory and Practice of Software (ETAPS). SUBMISSION ========== The workshop proceedings will be published in the new EPTCS series (Electronic Proceedings in Theoretical Computer Science, see http://www.cse.unsw.edu.au/~rvg/EPTCS/ and http://www.informatik.uni-trier.de/~ley/db/series/eptcs/index.html for the list of all published EPTCS volumes); we thus encourage submissions already in that format (A4 size). Submissions may be of two kinds: - Normal submissions, included in the EPTCS proceedings. - Presentation-only submissions. These could overlap with submissions to other conferences or journals, and will not be included in the proceedings. These provide an opportunity to present innovative ideas and get feedback from a technically competent audience. The page limit is 18 pages including the bibliography but excluding well-marked appendices. The page limit is the same for both kinds of submissions, please indicate clearly whether you intend you paper to be included in the proceedings or not. Papers must be submitted electronically at the following URL: http://www.easychair.org/conferences/?conf=secco11 A special issue of Journal of Computer Security (JCS) has been arranged in collaboration with TOSCA (ARSPA-WITS) 2011. Selected papers from both workshops will be invited for submission, and will be peer-reviewed according to the standard policy of JCS. PROGRAM COMMITTEE ================= * Miguel E. Andres (Ecole Polytechnique, France) * Kostas Chatzikokolakis (Ecole Polytechnique, France; co-chair) * Stephanie Delaune (ENS Cachan, France) * Ralf Kuesters (University of Trier, Germany) * Gavin Lowe (University of Oxford, UK) * Jun Pang (University of Luxembourg, Luxembourg; co-chair) * Mark Ryan (University of Birmingham, UK) * Dominique Unruh (Saarland University, Germany) * Luca Vigano (University of Verona, Italy) * Chenyi Zhang (University of New South Wales, Australia) From carbonem at itu.dk Thu Jun 2 16:14:13 2011 From: carbonem at itu.dk (Marco Carbone) Date: Thu, 2 Jun 2011 22:14:13 +0200 Subject: [TYPES/announce] WS-FM 2011 - Final Call for Papers (Deadline: 12h June 2011) Message-ID: Dear colleagues, Please find below the WS-FM'11 Call for Papers. Yours, Marco Carbone and Jean-Marc Petit Co-chairs of WS-FM'11. ---------------------- WS-FM 2011 8th International Workshop on Web Services and Formal Methods September 1-2, 2011, Clemont-Ferrand, France http://itu.dk/wsfm2011/ Co-located with BPM 2011 http://bpm2011.isima.fr/ === Important Dates === June 5, 2011................Full Paper Abstract Submission June 12, 2011:.............Full Paper Submission July 22, 2010:..............Notification Acceptance August 5, 2010:...........Camera-ready due September 1-2, 2011:...Workshop in Clemont-Ferrand === Scope === Service Oriented Computing (SOC) provides standard mechanisms and protocols for describing, locating and invoking services over the Internet. Although there are existing SOC infrastructures that support specification of service interfaces, access policies, behaviors and compositions, there are still many active research areas in SOC such as the support and management of interactions with stateful and long-running services, large farms of services and quality of service delivery. Moreover, emerging paradigm of cloud computing provides a new platform for service delivery, enabling the development of services that are configurable based on client requirements, service level guarantee mechanisms, and extended services based on virtualization (Software as a Service, Platform as a Service, Infrastructure as a Service). The convergence of SOC and cloud computing is accelerating the adoption of both of these technologies, making the service dependability and trustworthiness a crucial and urgent problem. Formal methods can play a fundamental role in this research area. They can help us define unambiguous semantics for the languages and protocols that underpin existing web service infrastructures, and provide a basis for checking the conformance and compliance of bundled services. They can also empower dynamic discovery and binding with compatibility checks against behavioral properties and quality of service requirements. Formal analysis of security properties and performance is also essential in cloud computing and in application areas including e-science, e-commerce, workflow, business process management, etc. Moreover, the challenges raised by this new area can offer opportunities for extending the state of the art in formal techniques. The aim of the WS-FM workshop series is to bring together researchers working on SOC, cloud computing and formal methods in order to catalyze fruitful collaboration. The scope of the workshop is not only limited to technological aspects. In fact, the WS-FM series has a strong tradition of attracting submissions on formal approaches to enterprise systems modeling in general, and business process modeling in particular. Potentially, this could have a significant impact on the on-going standardization efforts for SOC and cloud computing technologies. Topics of interest include but are not limited to: Trust and Dependability in service oriented and cloud computing Multi-tenancy, Adaptability and Evolvability in cloud systems Formal approaches to service-oriented analysis and design Formal approaches to enterprise modeling and business process modeling Model-driven development, testing, and analysis of web services/clouds Web services for business process management Security, performance and quality of web services/clouds Web service coordination and transactions Web service ontologies and semantic description Goal-driven discovery and composition of web services Complex event processing in service-oriented architectures Continuous query processing in presence of web services Semi-structured data management and XML technology Types and logics for web services/clouds Innovative application scenarios for web services/clouds Data services Data centric process modeling === Submission Guidelines === Submissions must be original and should not have been published previously nor be under consideration for publication while being evaluated for this workshop. All papers must be submitted at the following submission site, handled by EasyChair, ----------- https://www.easychair.org/conferences/?conf=wsfm11 ----------- using the Springer LNCS style. Papers should not exceed 15 pages in length. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The workshop proceedings will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS). === Program Committee === Marco Carbone, IT University of Copenhagen, Denmark (co-chair) Jean-Marc Petit, University of Lyon/CNRS, France (co-chair) Karthikeyan Bhargavan INRIA, France Maria Grazia Buscemi IMT Lucca, Italy Marco Carbone IT University, Copenhagen, Denmark Florian Daniel Universita' di Trento, Italy Pierre-Malo Danielou Imperial College London, UK Giuseppe De Giacomo SAPIENZA Universita' di Roma, Italy Rocco De Nicola Universita' di Firenze, Italy Marlon Dumas University of Tartu, Estonia Jos? Luiz Fiadeiro University of Leicester, UK Xiang Fu Hofstra University, USA Serge Haddad ENS Cachan, France Sylvain Hall? Universit? du Qu?bec ? Chicoutimi, Canada Thomas Hildebrandt IT University of Copenhagen, Denmark Manuel Mazzara Newcastle University, UK Luca Padovani Universita' di Torino, Italy Jean-Marc Petit University of Lyon/CNRS, France Steve Ross-Talbot Pi4Tech, UK Hagen Voelzer IBM Research - Zurich, Switzerland Nobuko Yoshida Imperial College London, UK Fatiha Zaidi Universit? Paris-Sud XI, France Gianluigi Zavattaro Universita' di Bologna, IT === Contact === wsfm11 at easychair.org === Previous editions === WS-FM 2010 in Hoboken, co-chaired by Mario Bravetti and Tevfik Bultan WS-FM 2009 in Bologna, co-chaired by Cosimo Laneve and Jianwen Su WS-FM 2008 in Milan, co-chaired by Roberto Bruni and Karsten Wolf WS-FM 2007 in Brisbane, co-chaired by Marlon Dumas and Reiko Heckel WS-FM 2006 in Wien, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2005 in Versailles, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2004 in Pisa, co-chaired by Mario Bravetti and Gianluigi Zavattaro -------------- next part -------------- An HTML attachment was scrubbed... URL: From eijiro.sumii at gmail.com Thu Jun 2 20:36:50 2011 From: eijiro.sumii at gmail.com (Eijiro Sumii) Date: Fri, 3 Jun 2011 09:36:50 +0900 Subject: [TYPES/announce] ICFP Programming Contest starting in two weeks Message-ID: This is a reminder that the ICFP Programming Contest 2011 will be starting in two weeks. See: http://www.icfpcontest.org/2011/05/contest-announcement.html Participants would need to prepare some virtual (or physical) machine running Debian squeeze. See: http://www.icfpcontest.org/2011/05/judges-machine-and-system-environment.html (You would only need an environment compatible with the guest, not the host. There exists various virtual machine software such as VirtualBox and VMware Player.) We look forward to your participation! ICFPC 2011 Oraganizers On Fri, May 6, 2011 at 5:52 PM, Eijiro Sumii wrote: > Dear Types subscribers, > > I believe this would be relevant to many people in the Types > community. ?Thanks! > > ? ? ? ?Eijiro > > ---------------------------------------------------------------------- > ? ? ? ? ? ? ? ? ? ?ICFP Programming Contest 2011 > > ? ? ? ? ? ? ? ? ? ? http://www.icfpcontest.org/ > > The ICFP Programming Contest 2011 is the 14th instance of the annual > programming contest series sponsored by The ACM SIGPLAN International > Conference on Functional Programming. ?This year, the contest starts > at 00:00 June 17 Friday UTC (= 24:00 June 16 Thursday UTC) and ends at > 00:00 June 20 Monday UTC (= 24:00 June 19 Sunday UTC). ?Unlike in > previous years, there is no 24-hour lightning division. > > The task description will be published in this blog when the contest > starts. ?Solutions to the task must be submitted online before the > contest ends. ?Details of the submission procedure will be announced > along with the contest task. > > This is an open contest. ?Anybody may participate except for the > contest organizers and members of the same laboratory as the the > contest chair's. ?No advance registration or entry fee is required. > > Participants may form teams. ?A team consists of every person who > contributes ideas and/or code towards a submission. ?Teams may have > any number of members. ?Individuals may only be members of a single > team and teams may not divide or collaborate with each other once the > contest has begun. > > Any programming language(s) may be used as long as the submitted > program can be run by the judges on a standard Linux environment with > no network connection. ?Details of the judges' environment will be > announced later. > > There will be prizes for the first (US$1,000) and second ($500) place > teams as well as a discretionary judges' prize ($500). ?There will > also be a total of $6,000 travel support. ?(The prizes and travel > support are subject to the budget plan of ICFP 2011 pending approval > by ACM.) > > In addition, the organizers will declare during the conference that: > > - the first place team's language is "the programming language of > ?choice for discriminating hackers", > > - the second place team's language is "a fine tool for many > ?applications", > > - and the team winning the judges' prize is "an extremely cool bunch > ?of hackers". > > Additional announcements about the contest will be made at > http://www.icfpcontest.org/. ?Questions can be posted as comments to > the blog or e-mailed to icfpc2011-blogger AT kb.ecei.tohoku.ac.jp > (please replace AT with @). > > We look forward to your participation! > > The contest organizers: Hidehiko Abe, Yumi Arai, Kenichi Asai > (observer), Noriko Hirota, Atsushi Igarashi (observer), Lintaro Ina, > Kazuhiro Inaba, Arisa Iwai, Chihiro Kaneko, Shinya Kawanaka, Moe > Masuko, Yasuhiko Minamide (observer), Ryosuke Sato, Yu Shibata, Yu > Sugawara, Takeshi Tsukada, Kanae Tsushima, Yayoi Ueda, and Eijiro > Sumii (chair). > ---------------------------------------------------------------------- > From gjbarthe at gmail.com Fri Jun 3 03:39:08 2011 From: gjbarthe at gmail.com (Gilles Barthe) Date: Fri, 3 Jun 2011 09:39:08 +0200 Subject: [TYPES/announce] FAST'11: deadline extension Message-ID: Dear colleague, The deadline for FAST 2011 has been extended by 2 weeks. The new deadlines for abstract and paper submission are as follows: Title/Abstract Submission: 15 June 2011 Paper submission: 19 June 2011 The complete CFP is included below. Best regards, Gilles Barthe, Anupam Datta, Sandro Etalle FAST 2011 Program Chairs ----------- The 8th International Workshop on Formal Aspects of Security & Trust (FAST2011) Leuven, Belgium. September 15-16, 2011 http://www.iit.cnr.it/FAST2011 FAST2011 is co-located with European Symposium on Research in Computer Security (ESORICS 2011) Leuven, Belgium 12-14 September, 2011 OVERVIEW The eighth International Workshop on Formal Aspects of Security and Trust (FAST2011) aims at continuing the successful efforts of the previous FAST workshops, fostering cooperation among researchers in the areas of security and trust. Computing and network infrastructures have become pervasive, and now support a great deal of economic activity. Thus, society needs suitable security and trust mechanisms. Interactions increasingly span several enterprises and involve loosely structured communities of individuals. Participants in these activities must control interactions with their partners based on trust policies and business logic. Trust-based decisions effectively determine the security goals for shared information and for access to sensitive or valuable resources. FAST focuses on the formal models of security and trust that are needed to state goals and policies for these interactions. We also seek new and innovative techniques for establishing consequences of these formal models. Implementation approaches for such techniques are also welcome. IMPORTANT DATES Title/Abstract Submission: 15 June 2011 Paper submission: 19 June 2011 Author Notification: 30 July 2011 Pre-proceedings version: 1 September 2011 Workshop: 15-16 September 2011 Post-proceedings version: 1 November 2011 Invited speakers: Andy Gordon (Microsoft Research) Fabio Massacci (University of Trento) PROGRAMME COMMITTEE Gilles Barthe, IMDEA Software, Spain (co-chair) Konstantinos Chatzikokolakis, ?cole Polytechnique, France Stephen Chong, Harvard University, USA Michael Clarkson, Cornell University, USA Ricardo Corin, FaMAF, Universidad Nacional de C?rdoba, Argentina Cas Cremers, ETH Zurich, Switzerland Anupam Datta, Carnegie Mellon University, USA (co-chair) Sandro Etalle, TU Eindhoven and Univ. of Twente, Netherlands (co-chair) Cedric Fournet, Microsoft Research, UK Deepak Garg, Carnegie Mellon University, USA Peter Herrmann, NTNU Trondheim, Norway Bart Jacobs, Radboud University Nijmegen, Netherlands Christian Damsgaard Jensen, Technical University of Denmark, Denmark Steve Kremer, LSV, ENS Cachan, CNRS, INRIA, France Fabio Martinelli, CNR, Italy Fabio Massacci, University of Trento, Italy Sjouke Mauw, University of Luxemburg, Luxembourg Mogens Nielsen, Aarhus, Denmark Mark Ryan, University of Birmingham, UK Ron van der Meyden, University of New South Wales, Australia Luca Vigano', Universita` di Verona, Italy ORGANIZERS Gilles Barthe, IMDEA Software, Spain Anupam Datta, Carnegie Mellon University, USA Sandro Etalle, TU Eindhoven and Univ. of Twente CONTACTS Organizers can be reached at fast-2011'at'lists.andrew.cmu.edu Latest updates about FAST 2011 will be regularly posted to security at fosad.org (a mailing list for the scientific community interested in computer security). PAPER SUBMISSION Suggested submission topics include, but are not limited to: Formal models for security, trust and reputation Security protocol design and analysis Logics for security and trust Trust-based reasoning Distributed trust management systems Digital asset protection Data protection Privacy and ID management issues Information flow analysis Language-based security Security and trust aspects in ubiquitous computing Validation/Analysis tools Web/Grid services security/trust/privacy Security and risk assessment Resource and access control Case studies SUBMISSION GUIDELINES We seek papers presenting original contributions. Two types of submissions are possible: 1) short papers, up to 5 pages in LNCS format. 2) full papers, up to 15 pages in LNCS format. Submissions should clearly state their category (1 or 2). Author's full name, address, and e-mail must appear on the first page. Short papers as well as full papers will be included in the informal proceedings distributed at the workshop. After the workshop, authors of short papers which are judged mature enough for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures, an:d accepted papers will be published in the post-proceedings in LNCS. Simultaneous submission of full papers to a journal or conference/workshop with formal proceedings justifies rejection. Short papers at FAST are not formally published, so this restriction does not apply to them. However, related publications and overlapping submissions must be cited explicitly in short papers. PROCEEDINGS As done for the previous issues of FAST, the post-proceedings of the workshop will be published in LNCS. A special journal issue is also planned. From zucca at disi.unige.it Fri Jun 3 06:46:47 2011 From: zucca at disi.unige.it (Elena Zucca) Date: Fri, 3 Jun 2011 12:46:47 +0200 Subject: [TYPES/announce] CFP: FOOL'11 Message-ID: [Apologies for cross-postings] CALL FOR PAPERS: 2011 International Workshop on Foundations of Object-Oriented Languages (FOOL'11) Portland, Oregon, USA, 23 October 2011 During the workshop days of SPLASH/OOPSLA http://www.disi.unige.it/person/ZuccaE/FOOL2011 IMPORTANT DATES Abstract submission: Friday, 5 August 2011 Paper submission: Friday, 12 August 2011 Notification: Monday, 5 September 2011 Final version: Friday, 7 October 2011 WORKSHOP DESCRIPTON 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. The FOOL workshops bring together researchers to share new ideas and results in these areas. The next workshop, FOOL'11, will be held in Portland, Oregon, USA on Sunday, 23 October 2011, during the workshop days at the beginning of SPLASH. Submissions for this event are invited in the general area of foundations of object-oriented languages, including integration with other paradigms and extensions, such as aspects, components, meta-programming. Topics of interest include language semantics, type systems, program analysis and verification, formal calculi, concurrent and distributed languages, databases, software adaptation, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as an informal electronic proceedings. Historically, presentation at FOOL 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. SUBMISSION INSTRUCTIONS We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy (http://www.acm.org/sigs/sigplan/republicationpolicy.htm). Submissions should be PDF or PostScript in standard SIGPLAN 9pt conference format for a US-letter size page. Templates are available at http://www.acm.org/sigs/sigplan/authorInformation.htm While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. More detailed submission instructions will be announced on the workshop web site at http://www.disi.unige.it/person/ZuccaE/FOOL2011/ Program Chair: Elena Zucca (University of Genova, Italy) e-mail: zucca at disi.unige.it Program Committee: Wei Ngan Chin (University of Singapore, Singapore), Ferruccio Damiani (University of Torino, Italy), Werner M. Dietl (University of Washington, USA), Dino Distefano (Queen Mary University of London and Monoidics Ltd, UK), Sophia Drossopoulou (Imperial College London, UK), Erik Ernst (Aarhus University, Denmark), Atsushi Igarashi (Kyoto University, Japan), Donna Malayeri (EPFL, Switzerland), Jan Smans (Katholieke Universiteit Leuven, Belgium) Steering Committee: Jonathan Aldrich (Carnegie Mellon University) [Chair], Viviana Bono (University of Torino, Italy), Atsushi Igarashi (Kyoto University, Japan), James Noble (University of Wellington, New Zealand), John Reppy (University of Chicago, USA), Jeremy Siek (University of Colorado, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From damiani at di.unito.it Fri Jun 3 16:49:32 2011 From: damiani at di.unito.it (Ferruccio Damiani) Date: Fri, 03 Jun 2011 22:49:32 +0200 Subject: [TYPES/announce] CFP: FoVeOOS 2011 (Turin, Italy, October 5-7, 2011) Message-ID: <4DE948DC.5090409@di.unito.it> FoVeOOS 2011 2nd International Conference on Formal Verification of Object-Oriented Software October 5-7, 2011, Turin, Italy http://foveoos2011.cost-ic0701.org *CALL FOR PAPERS* SCOPE Formal software verification has outgrown the area of academic case studies, and industry is showing serious interest. The logical next goal is the verification of industrial software products. Most programming languages used in industrial practice (such as Java, C++, and C#) are object-oriented. The International Conference on Formal Verification of Object-Oriented Software (FoVeOOS) aims to foster collaboration and interactions among researchers in this area. ORGANIZATION The conference is organised by COST Action IC0701 (http://www.cost-ic0701.org/) but it goes beyond the framework of this action. This conference is open to the whole scientific community around the following topics, and also encourages people close to industrial applications to submit papers and participate. The Action may provide travel grants (see the web page for details). TOPICS Topics include but are not limited to: * Logic-based methods for formal - verification - specification and description - construction, - analysis and validation, of object-oriented software * Technologies such as - logics - calculi - type systems for the formal verification of object-oriented software * Modularisation and verification of components * Verification of - adaptable and reusable - concurrent - distributed object-oriented software * Tool descriptions * Experience reports * Case studies * Teaching formal verification IMPORTANT DATES August 3, 2011 Abstract submission deadline August 10, 2011 Paper submission deadline September 7, 2011 Acceptance notification September 21, 2011 Final version due October 5-7, 2011 Conference SUBMISSIONS Submissions should describe previously unpublished work (completed or in progress). Contributions are invited in these categories: A Research papers (reporting original theoretical and/or experimental research or applications) B System descriptions C Experience reports, case studies D Position papers and brief reports on work in progress All submissions will be reviewed by peers, typically members of the program committee. Papers must be written in English and not exceed 18 pages in LNCS format (http://www.springer.de/comp/lncs/authors.html). Submission of papers is via EasyChair at http://www.easychair.org/conferences/?conf=foveoos2011 PROCEEDINGS The conference will use a two-stage process for the publication of proceedings, allowing for a very brief period between submission of papers and the conference and, thus, a speedy dissemination of results. All accepted papers will appear in pre-proceedings published as a Technical Report that will be available at the conference. Post-conference proceedings are planned to be published within Springer's LNCS series. For this second stage, papers will be selected as follows: first, authors of papers that were definitely accepted in the first stage will submit a new version with minor revisions only; second, authors of papers that were only conditionally accepted (typically position papers) will be able to submit a new version with major revisions, which will be reviewed again. BEST STUDENT PRESENTATION AWARD Based on the comments given by the reviewers in the first stage of reviewing, and the presentation at the conference, the programme committee will give a best student presentation award. Eligible papers are those whose presentation is given by a PhD student. PROGRAM CO-CHAIRS Ferruccio Damiani, U of Torino, Italy Dilian Gurov, KTH Stockholm, Sweden PROGRAMME COMMITTEE Bernhard Beckert, Karlsruhe Institute of Technology, Germany Frank S. de Boer, CWI, The Netherlands Marcello Bonsangue, U Leiden (LIACS), The Netherlands Einar Broch Johnsen, U of Oslo, Norway Gabriel Ciobanu, U Alexandru Ioan Cuza, Romania Mads Dam, KTH Stockholm, Sweden Ferruccio Damiani, U of Torino, Italy Sophia Drossopoulou, Imperial College, UK Paola Giannini, U Piemonte Orientale, Italy Dilian Gurov, KTH Stockholm, Sweden Reiner Haehnle, Chalmers U of Technology, Gothenburg, Sweden Marieke Huisman, U of Twente, The Netherlands Bart Jacobs, Katholieke Universiteit Leuven, Belgium Ioannis Kassios, ETH Zurich, Switzerland Joe Kiniry, ITU Copenhagen, Denmark Dorel Lucanu, U Alexandru Ioan Cuza, Romania Maria del Mar Gallardo Melgarejo, U of Malaga, Spain Claude Marche, INRIA Saclay-Ile-de-France, France Julio Marino, U Politecnica de Madrid, Spain Marius Minea, Politehnica U of Timisoara, Romania Anders Moeller, U Aarhus, Denmark Rosemary Monahan, NUI Maynooth, Ireland James Noble, Victoria U of Wellington, New Zealand Bjarte M. Ostvold, Norwegian Computing Center, Norway Olaf Owe, U of Oslo, Norway Matthew Parkinson, Cambridge U, UK David Pichardie, IRISA, France Frank Piessens, Katholieke U Leuven, Belgium Arnd Poetzsch-Heffter, U of Kaiserslautern, Germany Erik Poll, U of Nijmegen, The Netherlands Antonio Ravara, New University of Lisbon, Portugal Rene Rydhof Hansen, U of Aalborg, Denmark Peter H. Schmitt, Karlsruhe Institute of Technology, Germany Aleksy Schubert, U of Warsaw, Poland Gheorghe Stefanescu, U of Bucharest, Romania Bent Thomsen, U of Aalborg, Denmark Shmuel Tyszberowicz, U of Tel Aviv, Israel Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia Wolfgang Reif, U of Augsburg, Germany Amiram Yehudai, U of Tel Aviv, Israel Elena Zucca, U of Genova, Italy CONTACT Email: foveoos2011 at cost-ic0701.org Web: http://foveoos2011.cost-ic0701.org -- Prof. Ferruccio Damiani Dipartimento di Informatica |Phone: (+39) 011 670 6719 Universit? degli Studi di Torino |Fax : (+39) 011 75 16 03 C.so Svizzera 185 |Email: damiani at di.unito.it I-10149 Torino, Italy |URL : http://www.di.unito.it/~damiani From cristi at ifi.uio.no Sat Jun 4 05:57:53 2011 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Sat, 04 Jun 2011 11:57:53 +0200 Subject: [TYPES/announce] last cfp: Doctoral Symposium at FCT 2011 Message-ID: I am sorry if you receive this announcement through several means. Please forward this call for abstracts and presentations to interested students in your group or department. !! NEW !! * scholarships available for student participants * DS abstract submission page is open * main FCT accepted papers on the web Tuesday 7th * scientific official opening of new dept. building is starting the FCT program with invited talks and panel discussion --------------------------------------------------------------------- Call for Abstracts Doctoral Symposium affiliated with the 18th International Symposium on Fundamentals of Computation Theory Oslo, NORWAY August 26, 2011 web: http://fct11.ifi.uio.no/index.php?n=Workshops.DoctoralSymposium ----- Important Dates ----- Submission Deadline: Sunday, 12. June 2011 Author Notification: Sunday, 26. June 2011 Camera ready abstract: Friday 1. July 2011 DS day: Friday 26. August 2011 FCT days: 22 - 25. August 2011 ----- NEWS ----- * The abstract submission web-page of the Doctoral Symposium is now open. * With courtesy of our sponsors we are in the position of offering a limited number of scholarships to student participants in the main FCT or in the affiliated events. See the registration page of FCT for info on eligibility and application process. * FCT is part of the scientific program related to the official opening of the new "Ole-Johan Dahl building" of the Department of Informatics. This event takes the whole FCT morning of Monday 22nd. It will include invited talks and discussion panel on mainly theory and future of programming languages. * The accepted papers in the main FCT event will be listed on the web Tuesday 7th. ----- Description of the Event ----- The aim of the Doctoral Symposium @ FCT'11 is to provide a platform for PhD students and young researchers who recently completed their doctoral studies, to present new results related to the foundations of computing theory and receive feedback on their research. Excellent master students working in theoretical fields of CS are also encouraged to contribute. Moreover, the DS wants to offer students the opportunity to attend talks in the main conference and to interact with established researchers in their fields. It is warmly encouraged that FCT participants attend the DS also. A non-exhaustive list of topics of interest is available at the FCT home. http://fct11.ifi.uio.no The acceptance of the presentations is based on a two page abstract (incl. references). The accepted abstracts will be available at the workshop and published together in a technical report by the University of Oslo. It is allowed (and encouraged) to send results that have been published at other conferences or journals or that are work in progress. Acceptance is conditioned on one of the student authors holding a 15-25 min (exact time slot to be decided later) presentation in the doctoral symposium. Student reductions of participation fees and scholarships are planned; see the registration page for updates. ----- Submissions ----- Authors are encouraged to submit a 2 page extended abstract prepared according to Springer's guidelines for the LNCS series, preferably using LaTeX with the llncs document class. Please do not modify font size, spacing, margins, etc of the llncs document class. The abstracts should be authored by young researchers (i.e., PhD students, excellent master students, or researchers that defended their PhD in 2010). If a senior researcher (like supervisor) must be listed as author, her/his contribution to the present abstract should be minimal and should be backed by a letter sent by her/him via e-mail to the organizers of the doctoral symposium stating this fact. Please submit your paper as a PDF file using the EasyChair system at the link below (the page will be opened for submissions on 1st June): https://www.easychair.org/conferences/?conf=dsfct2011 ----- Submission Guidelines ----- Do NOT use runningheaders (i.e., your documentclass declaration could look like this: \documentclass[10pt]{llncs}). The submitted abstracts are encouraged to follow an outline like: 1. Problem Description and Motivation: Describe the research problem you are addressing and motivate why this is relevant for FCT community. 2. Brief Overview of Related Work: Briefly argument that this problem and your work has not been done by others before. Possibly discuss the gaps in the current related research literature. 3. Proposed Solution: Give a high-level overview of your proposed solution to the problem identified in part 1. Describe any hypotheses that you have formulated. Describe the research method you are using or plan to use. ----- Program Committee ----- Sergiu Bursuc (U. of Birmingham, UK) Andrea Corradini (U. of Pisa, Italy) Clemens Grabmayer (Utrecht University, Netherlands) Magne Haveraaen (U. of Bergen, Norway) Martin Leucker (T.U. Munchen, Germany) Andrzej Lingas (Lund University, Sweden) Daniel Lokshtanov (U. of California, USA) Cristian Prisacariu (U. of Oslo, Norway) Gerardo Schneider (U. of Gothenburg, Sweden) Alexandra Silva (CWI, The Netherlands) Tomoyuki Suzuki (U. of Leicester, UK) Edsko de Vries (Trinity College, Ireland) ----- For further advertising one may use this .txt CFP, downloadable at http://fct11.ifi.uio.no/documents/cfp_DS_FCT11.txt or the .pdf posters http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A4.pdf (A4 format) http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A3.pdf (A3 format) ----- From carbonem at itu.dk Sun Jun 5 13:08:50 2011 From: carbonem at itu.dk (Marco Carbone) Date: Sun, 5 Jun 2011 19:08:50 +0200 Subject: [TYPES/announce] WS-FM 2011 - Deadline Extended to 19 June 2011 Message-ID: Dear colleagues, Please find below the WS-FM'11 Call for Papers. We have extended deadlines by one week. . Apologies for multiple copies. Yours, Marco Carbone and Jean-Marc Petit Co-chairs of WS-FM'11. ---------------------- WS-FM 2011 8th International Workshop on Web Services and Formal Methods September 1-2, 2011, Clemont-Ferrand, France http://itu.dk/wsfm2011/ Co-located with BPM 2011 http://bpm2011.isima.fr/ === Important Dates === June 12,2011................Full Paper Abstract Submission (extended) June 19, 2011:.............Full Paper Submission (extended) July 22, 2010:..............Notification Acceptance August 5, 2010:...........Camera-ready due September 1-2, 2011:...Workshop in Clemont-Ferrand === Scope === Service Oriented Computing (SOC) provides standard mechanisms and protocols for describing, locating and invoking services over the Internet. Although there are existing SOC infrastructures that support specification of service interfaces, access policies, behaviors and compositions, there are still many active research areas in SOC such as the support and management of interactions with stateful and long-running services, large farms of services and quality of service delivery. Moreover, emerging paradigm of cloud computing provides a new platform for service delivery, enabling the development of services that are configurable based on client requirements, service level guarantee mechanisms, and extended services based on virtualization (Software as a Service, Platform as a Service, Infrastructure as a Service). The convergence of SOC and cloud computing is accelerating the adoption of both of these technologies, making the service dependability and trustworthiness a crucial and urgent problem. Formal methods can play a fundamental role in this research area. They can help us define unambiguous semantics for the languages and protocols that underpin existing web service infrastructures, and provide a basis for checking the conformance and compliance of bundled services. They can also empower dynamic discovery and binding with compatibility checks against behavioral properties and quality of service requirements. Formal analysis of security properties and performance is also essential in cloud computing and in application areas including e-science, e-commerce, workflow, business process management, etc. Moreover, the challenges raised by this new area can offer opportunities for extending the state of the art in formal techniques. The aim of the WS-FM workshop series is to bring together researchers working on SOC, cloud computing and formal methods in order to catalyze fruitful collaboration. The scope of the workshop is not only limited to technological aspects. In fact, the WS-FM series has a strong tradition of attracting submissions on formal approaches to enterprise systems modeling in general, and business process modeling in particular. Potentially, this could have a significant impact on the on-going standardization efforts for SOC and cloud computing technologies. Topics of interest include but are not limited to: Trust and Dependability in service oriented and cloud computing Multi-tenancy, Adaptability and Evolvability in cloud systems Formal approaches to service-oriented analysis and design Formal approaches to enterprise modeling and business process modeling Model-driven development, testing, and analysis of web services/clouds Web services for business process management Security, performance and quality of web services/clouds Web service coordination and transactions Web service ontologies and semantic description Goal-driven discovery and composition of web services Complex event processing in service-oriented architectures Continuous query processing in presence of web services Semi-structured data management and XML technology Types and logics for web services/clouds Innovative application scenarios for web services/clouds Data services Data centric process modeling === Submission Guidelines === Submissions must be original and should not have been published previously nor be under consideration for publication while being evaluated for this workshop. All papers must be submitted at the following submission site, handled by EasyChair, ----------- https://www.easychair.org/conferences/?conf=wsfm11 ----------- using the Springer LNCS style. Papers should not exceed 15 pages in length. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The workshop proceedings will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS). === Program Committee === Marco Carbone, IT University of Copenhagen, Denmark (co-chair) Jean-Marc Petit, University of Lyon/CNRS, France (co-chair) Karthikeyan Bhargavan INRIA, France Maria Grazia Buscemi IMT Lucca, Italy Marco Carbone IT University, Copenhagen, Denmark Florian Daniel Universita' di Trento, Italy Pierre-Malo Danielou Imperial College London, UK Giuseppe De Giacomo SAPIENZA Universita' di Roma, Italy Rocco De Nicola Universita' di Firenze, Italy Marlon Dumas University of Tartu, Estonia Jos? Luiz Fiadeiro University of Leicester, UK Xiang Fu Hofstra University, USA Serge Haddad ENS Cachan, France Sylvain Hall? Universit? du Qu?bec ? Chicoutimi, Canada Thomas Hildebrandt IT University of Copenhagen, Denmark Manuel Mazzara Newcastle University, UK Luca Padovani Universita' di Torino, Italy Jean-Marc Petit University of Lyon/CNRS, France Steve Ross-Talbot Pi4Tech, UK Hagen Voelzer IBM Research - Zurich, Switzerland Nobuko Yoshida Imperial College London, UK Fatiha Zaidi Universit? Paris-Sud XI, France Gianluigi Zavattaro Universita' di Bologna, IT === Contact === wsfm11 at easychair.org === Previous editions === WS-FM 2010 in Hoboken, co-chaired by Mario Bravetti and Tevfik Bultan WS-FM 2009 in Bologna, co-chaired by Cosimo Laneve and Jianwen Su WS-FM 2008 in Milan, co-chaired by Roberto Bruni and Karsten Wolf WS-FM 2007 in Brisbane, co-chaired by Marlon Dumas and Reiko Heckel WS-FM 2006 in Wien, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2005 in Versailles, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2004 in Pisa, co-chaired by Mario Bravetti and Gianluigi Zavattaro -------------- next part -------------- An HTML attachment was scrubbed... URL: From peterol at ifi.uio.no Sun Jun 5 14:29:31 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Sun, 5 Jun 2011 20:29:31 +0200 Subject: [TYPES/announce] Final CfP: 8th International Symposium on Formal Aspects of Component Software Message-ID: <88F1B5D8-9620-42CA-9884-49F7C17E42D8@ifi.uio.no> --------------------------------------------------------------------- Call for Papers FACS 2011 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- *** Springer LNCS proceedings *** *** Science of Computer Programming special issue *** *** Abstract submission deadline: June 10 *** Aims and Scope: The component-based software development approach has emerged as a promising paradigm to cope with the complexity of present-day software systems by bringing sound engineering principles into software engineering. However, many challenging conceptual and technological issues still remain in component-based software development theory and practice. Moreover, the advent of service-oriented computing has brought to the fore new dimensions, such as quality of service and robustness to withstand inevitable faults, that require revisiting established component-based concepts in order to meet the new requirements of the service-oriented paradigm. FACS 2011 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The symposium seeks to address the applications of formal methods in all aspects of software components and services. Specific topics include, but are not limited to: - formal models for software components and their interaction - formal aspects of services, service oriented architectures, and business processes - design and verification methods for software components and services - composition and deployment: models, calculi, languages - formal methods and modeling languages for components and services - model based and GUI based testing of components and services - component/service re-engineering and reuse - models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services - components for real-time, safety-critical, secure, and/or embedded systems - industrial or experience reports, and case studies - update and reconfiguration of component and service architectures - component systems evolution and maintenance - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self-adaptive systems Past Events: FACS'11 is the eighth event in a series of events founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The previous workshops in the FACS series were held in Pisa (September 2003, co-located with FM'03), Macau (October 2005), Prague (September 2006), Sophia-Antipolis (September 2007), Malaga (September 2008), Eindhoven (October 2009, held as part of the Formal Methods Week), and Guimaraes (October 2010). Invited speakers: Jose Meseguer (University of Illinois at Urbana-Champaign) John Rushby (SRI International) Submission: We solicit high-quality submissions reporting on: A- original research contributions (18 pages max, LNCS format); B- applications and experiences (18 pages max, LNCS format); C- surveys, comparisons, and state-of-the-art reports (18 pages max, LNCS format); D- tool papers (6 pages max, LNCS format); related to the topics mentioned above. In addition, we also solicit submissions to the Doctoral Track of FACS 2011, in the form of abstracts (2 pages, LNCS format) concisely capturing PhD-work-in-progress, related theme, context, research questions, envisaged contributions, and partial results. 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=facs2011. The final version of the paper must be prepared in LaTeX, adhering to the LNCS format. Publication: All accepted papers will appear in the pre-proceedings of FACS 2011. Revised versions of accepted papers in the categories A-D above will appear in the post-proceedings of the symposium that will be published as a volume in Springer's Lecture Notes in Computer Science series. 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: Categories A-D abstract submission: June 10, 2011 Categories A-D submission: June 17, 2011 Categories A-D acceptance notification: August 9, 2011 Doctoral Track submission: August 12, 2011 Doctoral Track acceptance notification: August 20, 2011 Symposium: September 14-16, 2011 Venue: FACS 2011 is hosted by the Department of Informatics at the University of Oslo. The symposium will take place in the new modern computer science building on the main campus of the university. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Program chairs: Farhad Arbab (Leiden University and CWI, The Netherlands) and Peter Olveczky (University of Oslo, Norway) Program committee: Erika Abraham (RWTH Aachen University, Germany) Farhad Arbab (Leiden University and CWI, The Netherlands) Christel Baier (Technical University of Dresden, Germany) Luis Barbosa (University of Minho, Portugal) Mihaela Bobaru (NASA/JPL, USA) Frank de Boer (CWI, The Netherlands) Christiano Braga (Universidade Federal Fluminense, Brazil) Roberto Bruni (University of Pisa, Italy) Carlos Canal (University of Malaga, Spain) Francisco Duran (University of Malaga, Spain) Rolf Hennicker (Ludwig-Maximilians-Universitaet Munich, Germany) Alexander Knapp (Augsburg University, Germany) Zhiming Liu (IIST UNU, Macau) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia Antipolis, France) Sun Meng (Peking University, China) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Frantisek Plasil (Charles University, Czech Republic) Gwen Salaun (Grenoble INP - INRIA, France) Bernhard Schaetz (fortiss GmbH, Germany) Wolfram Schulte (Microsoft Research, Redmond, USA) Nishant Sinha (NEC Labs, Princeton, USA) Marjan Sirjani (Reykjavik University, Iceland) Volker Stolz (University of Oslo, Norway) Carolyn Talcott (SRI International, USA) Emilio Tuosto (University of Leicester, UK) Steering Committee: Zhiming Liu (coordinator) (IIST UNU, Macau) Farhad Arbab (Leiden University and CWI, The Netherlands) Luis Barbosa (University of Minho, Portugal) Carlos Canal (University of Malaga, Spain) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia-Antipolis, France) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Bernhard Schaetz (fortiss GmbH, Germany) Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From jfoster at cs.umd.edu Mon Jun 6 10:09:37 2011 From: jfoster at cs.umd.edu (Jeff Foster) Date: Mon, 6 Jun 2011 07:09:37 -0700 Subject: [TYPES/announce] PASTE 2011 Call for Participation, Lightning Talks, and Posters References: Message-ID: <179A8996-8D2F-4118-8ABC-AFE2C531108E@cs.umd.edu> [PASTE welcomes submissions for lightning talks and posters on topics related to types.] 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) Call for Participation in PASTE 2011 featuring technical papers, keynote, lightning talks, and posters Szeged, Hungary September 5-6, 2011 co-located with ESEC/FSE'11 https://sites.google.com/site/paste2011/ PASTE 2011 is the tenth workshop in a series that brings together the program analysis, software tools, and software engineering communities to focus on applications of program analysis techniques in software tools. This year, PASTE will include both a lightning talks session and a poster session; see the call at the bottom of this message for more details. ------- KEYNOTE: SUMIT GULWANI, Microsoft Research "Program Synthesis for Automating End-user Programming and Education" Recent research in program synthesis has made it possible to effectively synthesize small programs in a variety of domains. In this talk, I will describe two useful applications of this technology that have the potential to influence daily lives of billions of people. One application involves automating end-user programming using examples, which can allow non-programmers to effectively use computational devices such as computers, cell-phones (and in the future robots) to perform a variety of repetitive tasks. Another application involves building automated tutoring systems that can help students with problem solving in math and science domains. BIO: Sumit Gulwani is a senior researcher in the RiSE group at Microsoft Research, Redmond. His primary research interest is in the area of program synthesis with applications to automating end user programming and building intelligent tutoring systems. Sumit obtained his PhD in computer science from UC-Berkeley in 2005, and was awarded the C.V. Ramamoorthy Award and the ACM SIGPLAN Outstanding Doctoral Dissertation Award. He obtained his BTech in computer science and engineering from the Indian Institute of Technology (IIT) Kanpur in 2000 and was awarded the President's Gold Medal. ------- ACCEPTED PAPERS Labeling Library Functions in Stripped Binaries E. Jacobson, N. Rosenblum, B. Miller An Evaluation of Change-Based Coverage Criteria M. Fisher II, J. Wloka, F. Tip, B. Ryder, A. Luchansky Anywhere, Any-Time Binary Instrumentation A. Bernat, B. Miller Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection through Symbolic Execution M. von Detten Locating Failure-Inducing Environment Changes D. Qi, M. Ngo, T. Sun, A. Roychoudhury Assessing Modularity via Usage Changes Y. Mileva, A. Zeller ------- CALL FOR LIGHTNING TALKS AND POSTERS This year, PASTE will include both a lightning talks session and a poster session. Lightning talks and posters can describe early research ideas or results, research perspectives or positions, and other topics of interest to the PASTE community. Tool demonstrations are also welcome. Students are strongly encouraged to participate in the poster session, which will be held during lunch. Lightning talks will be allocated 10 minute slots, which will consist of 5 minutes for presentation and 5 minutes for discussion. Submissions Researchers who would like to present a lightning talk should send the following information to paste11 at cs.umd.edu by Friday, June 24, 2011: * Presenter name, affiliation, and email address * Proposed title * A short paragraph describing the talk * Please include "PASTE lightning talk submission" in the email title Researchers who would like to present a poster should send the following information to paste11 at cs.umd.edu by Friday, June 24, 2011: * Title, author names, and affiliations * Name and email address of the presenter * A PDF abstract of the research to be described in the poster. The abstract should be at most 1 page in the normal PASTE submission format. * Please include "PASTE poster submission" in the email title Lightning talks and posters will be accepted based on relevance to the workshop. Selected presenters will be notified via email by July 1, 2011. Presenters may, at their option, have their abstract included in the official PASTE proceedings. From nielson at imm.dtu.dk Tue Jun 7 03:12:39 2011 From: nielson at imm.dtu.dk (Flemming Nielson) Date: Tue, 7 Jun 2011 09:12:39 +0200 Subject: [TYPES/announce] PhD Scholarships in Semantics, Analysis, Verification Message-ID: <126C9B5E-7526-43C3-9ADE-81BB16791D34@imm.dtu.dk> PhD Scholarships in Semantics, Analysis, Verification We are looking for enthusiastic students with a strong background in semantics, analysis and verification that would like to become part of our Centre of Excellence www.MT-LAB.dk and our Danish-Chinese Research Center www.idea4.dk Candidates are expected to have a background within one or more of - process calculi and automata - logical formalisms - static program analysis - model checking - prototype construction - algorithms and datastructures. A PhD Scholarship is for three years; you will be part of an international research group lbt.imm.dtu.dk whose dainly language is English, you will be paid about 3300? per month, and you would be expected to spend up to half a year in a relevant research group outside of Denmark. If you are interested - please perform steps 1-7 listed on http://www2.imm.dtu.dk/~nielson/Scholarship-2011-Announcement.pdf We look forward to your enquiries. Flemming Nielson -------------- next part -------------- An HTML attachment was scrubbed... URL: From ggrov at staffmail.ed.ac.uk Tue Jun 7 03:29:40 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Tue, 7 Jun 2011 08:29:40 +0100 Subject: [TYPES/announce] VSTTE 2012 : First Call for Papers Message-ID: 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. A verification competition will be held in parallel to the conference. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter M?ller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE To be announced PUBLICITY CHAIR Gudmund Grov, University of Edinburgh STEERING COMMITTEE Tony Hoare, Microsoft Research Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From davide at disi.unige.it Tue Jun 7 16:17:44 2011 From: davide at disi.unige.it (Davide Ancona) Date: Tue, 07 Jun 2011 22:17:44 +0200 Subject: [TYPES/announce] OOPS track at SAC 2012: Call for Papers Message-ID: <4DEE8768.8080509@disi.unige.it> OOPS 2012 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS12 Special Track at the 27th ACM Symposium on Applied Computing, SAC 2012 http://www.acm.org/conferences/sac/sac2012 The Microsoft Research - University of Trento Centre for Computational and Systems Biology (COSBI) Riva del Garda (Trento), Italy March 25-29, 2012 - Important Dates (deadlines are strict) August 31, 2011 Paper submission October 12, 2011 Author notification November 2, 2011 Camera-ready copies March 25-29, 2012 SAC 2012 - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, University of Genova, Italy Shigeru Chiba (chiba at is.titech.ac.jp) Tokyo Institue of Technology, Japan Atsushi Igarashi (igarashi at kuis.kyoto-u.ac.jp) Kyoto University, Japan Andy Kellens (akellens at vub.ac.be) Vrije Universiteit Brussel, Belgium - Program Committee (to be completed) * Walter Binder, University of Lugano, Switzerland * Sara Capecchi, University of Torino, Italy * Wei-Ngan Chin, National University of Singapore, Singapore * Erik Ernst, Aarhus University, Denmark * Kathryn Gray, University of Cambridge, UK * Robert Hirschfeld, Hasso-Plattner-Institut, University of Potsdam, Germany * Jaakko J?rvi, Texas A&M University, USA * Doug Lea, Suny Oswego, USA * Hidehiko Masuhara, University of Tokyo, Japan * Sean McDirmid, Microsoft Research Asia, Beijin * Rosemary Monahan, National University of Ireland Maynooth, Ireland * Manuel Oriol, University of York, UK * David Pearce, Victoria University of Wellington, New Zealand * Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea * Ina Schaefer, Technical University Braunschweig, Germany * Jeremy Singer, University of Glasgow, UK - SAC 2012 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 2012 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Trento, Italy. - OOPS Track The object-oriented (OO) paradigm is extensively used to design and implement today's large scale software systems. However, existing OO languages and platforms need to evolve to better support features like interoperability, software reuse, dynamic software adaptation, efficiency on multicore hardware, security, and safety. The aim of OOPS is to foster the development of extensions to existing OO languages and platforms, as well as the design and implementation of new languages and platforms embracing and enhancing the object-oriented paradigm. Particularly of interest for OOPS are papers that provide a thorough analysis covering most of the following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Language design and implementation * Type systems, static analysis, formal methods * Integration with other paradigms * Aspects, components, and modularity * Reflection, meta-programming * Databases and persistence * Distributed, concurrent or parallel systems * Interoperability, versioning and software adaptation Besides being an event expressly organized for researchers in OOP who seek to bridge theory and practice, OOPS at SAC offers the opportunity for exploiting cross-fertilization between the different branches of computer science, and for keeping in touch with recent trends in computer science, since almost all research areas are represented by 34 different tracks. - 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 August 31, 2011. For more information please visit the SAC 2012 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as extended 3-page abstracts in the same proceedings; the **third page** only 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 the conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, we are planning to organize a journal special issue hosting the extended versions of the best papers of the track. From pangjun at gmail.com Wed Jun 8 09:11:27 2011 From: pangjun at gmail.com (Jun PANG) Date: Wed, 8 Jun 2011 15:11:27 +0200 Subject: [TYPES/announce] FHIES 2011: final Call for Papers Message-ID: ``Apologize if you receive more than one copy'' Important Dates =============== Abstract Submission 12 June 2011 Paper Submission 19 June 2011 Notification of acceptance 18 July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 FHIES 2011 International Symposium on Foundations of Health Information Engineering and Systems (http://www.iist.unu.edu/ICTAC/FHIES2011/) 27-29 August 2011 Mabalingwe Nature Reserve, South Africa (Colocated with ICTAC 2011) Information and communication technology plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world, that are the concern of the United Nations, its Peoples and Members States. The use of software in medical devices is already raising issues in relation to safety and efficacy for manufacturers and regulators. Health information systems raise issues of both privacy and confidentiality, on the one hand, and, increasingly, patient safety on the other. Hospital and other information systems raise important issues of efficacy and interoperability. However, to capitalize on the potential of this technology in reshaping healthcare demands focused research on sound and safe development techniques from software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. Aims ===== The purpose of the new symposium series on Foundations of Software Engineering Health Informatics (FHIES) is to promote a nascent research area that aims to develop and apply theories and techniques in computing science and software engineering to modelling, building and certifying software based systems in the application domain of healthcare. Many of these systems are already regulated in many jurisdictions and many more of them will become regulated in the future. Research on theories, techniques and tools of software modelling, verification and validation has been an important area of computer science and software engineering, known as Formal Methods. This research addresses the challenging problem of design and certification of safety or mission critical software systems through abstraction and decomposition techniques based on the use of mathematical modelling theories and sound engineering methods. Formal methods have primarily addressed the correctness of systems used in the industrial, financial, and defense applications. However, they have recently found application in modelling and analysis of complex systems that involve interacting behaviour of many kinds of objects and agents, including software systems, physical objects and humans. The models of these systems have both discrete and continuous behaviour, and both qualitative and quantitative (e.g., spatial timing and probabilistic) properties. It is believed that these methods can be used for modelling problems of health informatics, which presents the challenge of scalability. Software plays a critical role in sustainable health care, both as part of the solution and as part of the problem. Software intensive information systems are needed to support the collection and processing of vast amounts of data via different devices, and allow policy makers to access and share these data, and to support their decision making and validation. Software systems can be developed for managing, controlling and monitoring policies, processes and workflows in medical systems. Software systems can be developed to help create the sophisticated medical devices that are simply impossible to build without the software. On the other hand, the application of software raises challenging issues in safety, security and privacy, and increases the complexity of healthcare workflows and the need for new business policies. Paper Submissions ============== We solicit high quality submissions reporting on 1. original research contributions (18 pages maximum in LNCS format) 2. application experience, case studies and software prototypes (18 pages maximum in LNCS format) 3. surveys, comparisons, and state-of-the-art reports (18 pages maximum in LNCS format) 4. position papers that define research projects with identified challenges and milestones (10 pages maximum in LNCS format) 5. proposals for panel discussions, with at least three named panellists, about a topical question (5 pages maximum in LNCS format). All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions should be in English, prepared in the LNCS format (see here for details). Submission constitutes a commitment to attend and present a paper, if accepted. All accepted papers will be included in the pre-event proceedings of the symposium and considered for EXCEPT FOR the proposals for panel discussions inclusion in a special issue of the Springer Journal "Innovations in Systems and Software Engineering" (ISSE), following revision and re-review. The post proceedings will include a brief summary of panel discussions. Important Dates =========== Abstract Submission 12 June 2011 Paper Submission 19 June 2011 Notification of acceptance 18 July 2011 Final copy for proceedings 7 August 2011 FHIES 2011 29-30 August 2011 Organization ========= General Chairs * Peter Haddawy, UNU-IIST, Macao * Tom Maibaum, McMaster University, Canada Programme Chairs * Zhiming Liu, UNU-IIST, Macao * Alan Wassyng, McMaster University, Canada Organising Chair * Hao Wang, UNU-IIST, Macao Program Committee * Syed Mohamed Aljunid, UNU-IIGH * Sebastian Fischmeister, University of Waterloo, Canada * Peter Haddawy, UNU-IIST, Macao * Jozef Hooman, Embedded Systems Institute and Radboud University Nijmegen, The Netherlands * Michaela Huhn, TU Clausthal, Germany * Mark Lawford, McMaster University, Canada * Insup Lee, University of Pennsylvania, USA * Martin Leucker, TU Munich, Germany * Wendy MacCaull, St. Francis Xavier University, Canada * Tom Maibaum, McMaster University, Canada * Dominique Mery, LORIA and Universite Henri Poincare Nancy 1, France * Jun Pang, University of Luxembourg, Luxembourg * David Robertson, University of Edinburgh, UK * Lutz Schroeder, DFKI Bremen and University of Bremen, Germany * Jens H. Weber, University of Victoria, Canada * Liang Xiao, Hubei University of Technology, P.R.China From ccshan at cs.rutgers.edu Wed Jun 8 12:47:34 2011 From: ccshan at cs.rutgers.edu (Chung-chieh Shan) Date: Wed, 8 Jun 2011 18:47:34 +0200 Subject: [TYPES/announce] Deadline June 17: ACM SIGPLAN Workshop on ML Message-ID: <20110608164734.GA4486@mantle.bostoncoop.net> ACM SIGPLAN Workshop on ML Sunday, 18 September 2011, Tokyo, Japan (co-located with ICFP) http://conway.rutgers.edu/ml2011/ CALL FOR CONTENT The ML family of programming languages includes dialects known as Standard ML, Objective Caml, and F#. These languages have inspired a large amount of computer-science research, both practical and theoretical. This workshop aims to provide a forum for discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of ML 2011 will continue the return in 2010 to a more informal model: a workshop with presentations selected from submitted abstracts. Presenters will be invited to submit working notes, source code, and extended papers for distribution to the attendees, but 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. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. In the abstract submission, describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. (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. We plan to make videos of the presentations available on ACM Digital Library. SUBMISSION INSTRUCTIONS Email submissions to ccshan AT cs.rutgers.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a one-paragraph synopsis suitable for inclusion in the workshop program. IMPORTANT DATES * 2011-06-17: Submission * 2011-07-22: Notification * 2011-09-18: Workshop PROGRAM COMMITTEE Amal Ahmed (Indiana University) Andrew Tolmach (Portland State University) Anil Madhavapeddy (University of Cambridge) Chung-chieh Shan (chair) (Rutgers University) Joshua Dunfield (Max Planck Institute for Software Systems) Julia Lawall (University of Copenhagen) Keisuke Nakano (University of Electro-Communications) Martin Elsman (SimCorp) Walid Taha (Halmstad University) STEERING COMMITTEE Eijiro Sumii (chair) (Tohoku University) Andreas Rossberg (Google) Jacques Garrigue (Nagoya University) Matthew Fluet (Rochester Institute of Technology) Robert Harper (Carnegie Mellon University) Yaron Minsky (Jane Street) From fmontesi at italianasoftware.com Fri Jun 10 03:39:25 2011 From: fmontesi at italianasoftware.com (Fabrizio Montesi) Date: Fri, 10 Jun 2011 09:39:25 +0200 Subject: [TYPES/announce] CFP: SAC 2012 track on Service Oriented Architectures and Programming (SOAP) Message-ID: SOAP Service-Oriented Architectures and Programming http://www.itu.dk/acmsac2012-soap/ ACM SAC 2012 For the past twenty-seven 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 2012 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Trento, Italy. 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 different 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) August 31, 2011: Paper submissions October 12, 2011: Author notification November 2, 2011: Camera-Ready Copy March 25-29, 2012: 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 2012 Website: http://www.acm.org/conferences/sac/sac2012/ 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. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Maurice ter Beek, ISTI-CNR, Pisa (Italy) Jesper Bengtson, IT University of Copenhagen (Denmark) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Francisco Martins, University of Lisbon (Portugal) Michele Mazzucco, University of Tartu (Estonia) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. (Italy) Paolo Missier, Newcastle University (UK) Bardia Mohabbati, Simon Fraser University (Canada) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Rosario Pugliese, University of Firenze (Italy) Jean-Bernard Stefani, INRIA Grenoble (France) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Olaf Zimmermann, IBM Research - Zurich (Switzerland) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy From gabriel at info.uaic.ro Fri Jun 10 07:18:25 2011 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Fri, 10 Jun 2011 14:18:25 +0300 (EEST) Subject: [TYPES/announce] Last CfP 5th MeCBIC, 23-24 August 2011, Paris (Fontainebleau) Message-ID: Apologies for multiple copies. ---------------------------------------------------------------- Call for Papers MeCBIC 2011 5th Workshop on Membrane Computing and Biologically Inspired Process Calculi 23-24 August 2011, Paris(Fontainebleau) http://www.info.uaic.ro/~mecbic/mecbic2011/ ================================================================ *** IMPORTANT DATES *** Title and Abstract: 18 June, 2011 Paper Submission: 25 June, 2011 Notification: 01 August, 2011 Revised version: 11 August, 2011 The main aim of the workshop is to bring together researchers working in membrane computing, in biologically inspired process calculi (ambients, brane calculi, etc.) and in other related fields to present recent results and to discuss new ideas concerning such formalisms, their properties and relationships. Original research papers (including significant work-in-progress) on the membrane systems or biologically inspired process calculi are sought. Related formal approaches in which cell compartments play an important role are also within the scope of the workshop. Topics of interest include (but are not limited to): * Biologically inspired models and calculi; * Biologically inspired systems and their applications; * Analysis of properties of biologically inspired models; * Theoretical links and comparison between different models. Invited Speaker: Cosimo Laneve (University of Bologna) Reversible Structures (joint work with Luca Cardelli) *** 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=mecbic2011. We also encourage the submission of short papers (around 8 pages) presenting new tools or platforms related to the topics of MeCBIC 2011. The workshop proceedings will be available during the meeting, and will be posted on arXiv.org. After the workshop, selected papers will be published in Scientific Annals of Computer Science, an open access journal indexed by SCOPUS, MathSciNet, DOAJ, DBLP, etc. Depending on the quality of the papers, we plan to have each two years a special issue of a well-known journal including a selection of (extended and additionally refereed) papers. This year will be published a special issue of Theoretical Computer Science which will include selected papers accepted and presented at MeCBIC 2009 and MeCBIC 2010. *** PROGRAM COMMITTEE *** * Bogdan Aman, A.I.Cuza University of Iasi * Roberto Barbuti, University of Pisa, Italy * Marco Bernardo, University of Urbino, Italy * Paola Bonizzoni, University of Milano-Bicocca, Italy * Gabriel Ciobanu, ICS, Romanian Academy, Iasi (chair) * Jean-Louis Giavitto, IRCAM CNRS, Paris, France * S.N. Krishna, IIT Bombay, Mumbai, India * Jean Krivine, University Paris 7, France * Paolo Milazzo, University of Pisa, Italy * Gethin Norman, University of Glasgow, UK * Andrew Phillips, Microsoft Research, Cambridge, UK * G. Michele Pinna, University of Cagliari, Italy * Franck Pommereau, University of Evry, France * Jason Steggles, Newcastle University, UK * Angelo Troina, University of Torino, Italy * Sergey Verlan, University Paris 12, France * Gianluigi Zavattaro, University of Bologna, 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), and EPTCS volumes 11 and 40 (2009, 2010). A special issue of Theoretical Computer Science including selected papers accepted and presented at MeCBIC in 2009 and 2010 will be published this year. From bywang at iis.sinica.edu.tw Fri Jun 10 07:48:04 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Fri, 10 Jun 2011 19:48:04 +0800 Subject: [TYPES/announce] Final CFP - CPP 2011 Message-ID: <20110610194804.484866zd72tqyz5g@webmail.iis.sinica.edu.tw> The First International Conference on Certified Programs and Proofs (CPP 2011) FINAL CALL FOR PAPERS Kenting, Taiwan December 7--9, 2011 http://formes.asia/cpp (co-located with APLAS 2011) 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. 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; and teaching mathematics and computer science with proof assistants. INVITED SPEAKERS: * Andrew Appel (Princeton University) * Nikolaj Bj?rner (Microsoft Research) * Peter O'Hearn (Queen Mary, University of London) * Vladimir Voevodsky (Institute for Advanced Study, Princeton University) 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: Monday, June 13, 2011 Paper Submission Deadline: Friday, June 17, 2011 Author Notification: Monday, August 29, 2011 Camera Ready: Monday, September 19, 2011 Conference: December 7-9, 2011 SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2011 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. AWARD FOR BEST PAPER: An award will be given for the best accepted paper, as judged by the program committee. The committee may decline to make the award or split it among several papers. PROGRAM CO-CHAIRS: Jean-Pierre Jouannaud (INRIA and Tsinghua University) Zhong Shao (Yale University) Email: cpp2011pc at gmail.com GENERAL CHAIR: Yih-Kuen Tsay (National Taiwan University) PROGRAM COMMITTEE: Andrea Asperti (University of Bologna) Gilles Barthe (IMDEA Software Institute) Xiao-Shan Gao (Chinese Academy of Sciences) Georges Gonthier (Microsoft Research Cambridge) Chris Hawblitzel (Microsoft Research Redmond) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (INRIA and Tsinghua University) Akash Lal (Microsoft Research India) Xavier Leroy (INRIA Paris-Rocquencourt) Yasuhiko Minamide (University of Tsukuba) Shin-Cheng Mu (Academia Sinica) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Sandip Ray (University of Texas at Austin) Natarajan Shankar (SRI International) Zhong Shao (Yale University) Christian Urban (TU Munich) Viktor Vafeiadis (Max Planck Institute for Software Systems) Stephanie Weirich (University of Pennsylvania) Kwangkeun Yi (Seoul National University) PUBLICITY CHAIR: Bow-Yaw Wang (Academia Sinica, INRIA and Tsinhua University) ORGANIZING COMMITTEE: Tyng-Ruey Chuang (chair), Shin-Cheng Mu, Yih-Kuen Tsay (Academia Sinica and National Taiwan University) Email: cpp2011oc at gmail.com ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From ccshan at cs.rutgers.edu Fri Jun 10 10:30:15 2011 From: ccshan at cs.rutgers.edu (Chung-chieh Shan) Date: Fri, 10 Jun 2011 16:30:15 +0200 Subject: [TYPES/announce] Second CFP: Continuation Workshop 2011 Message-ID: <20110610143015.GA32381@mantle.bostoncoop.net> Submission deadline: June 25, 2011 Invited speakers: Mats Rooth (Cornell), Noam Zeilberger (Universite' Paris 7) There will be a tutorial session in the evening before the workshop. ACM SIGPLAN Continuation Workshop 2011 http://logic.cs.tsukuba.ac.jp/cw2011/ co-located with ICFP 2011, Tokyo, Japan Saturday, September 24, 2011 Call for Contributions Continuations have been discovered many times, which highlights their many applications in programming language semantics and program analysis, linguistics, logic, parallel processing, compilation and web programming. Recently, there has been a surge of interest specifically in delimited continuations: new implementations (in Scala, Ruby, OCaml, Haskell), new applications (to probabilistic programming, event-driven distributed processing), substructural and constructive logics, natural language semantics. The goal of the Continuation Workshop is to make continuations more accessible and useful -- to practitioners and to researchers in various areas of computer science and outside computer science. We wish to promote communication among the implementors and users in many fields. We would like to publicize the applications of continuations in academic (logic, linguistics) and practical fields and various programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc). Continuation Workshop 2011 will be informal. We aim at accessible presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. The workshop will have no published proceedings; submissions of short abstracts are preferred. Invited speakers ---------------- Mats Rooth, Cornell University http://conf.ling.cornell.edu/mr249/ Noam Zeilberger, Universite' Paris 7 http://www.pps.jussieu.fr/~noam/ Tutorials --------- In the evening before the workshop, there will be a tutorial session on delimited continuations and their main applications. Tutorial date and time: Friday, September 23, 2011, 19:00-21:00 Tutorial place: IIJ (next to NII, the place of the ICFP conference) Tutorial speakers: Kenichi Asai and Oleg Kiselyov Important dates --------------- Submission: June 25, 2011 Notification: August 8, 2011 Tutorials: September 23, 2011 Workshop: September 24, 2011 Format ------ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ----- We seek several types of presentations on topics related to continuations. We especially encourage presentations that describe work in progress, outline a future research agenda, or encourage lively discussion. Research presentations on: - implementations of continuations - semantics - type systems and logics - meta-theory and its mechanization - code generation with continuations or effects - distributed programming - systems programming and security - pearls Research presentations must be broadly accessible and should describe new ideas, experimental results, significant advances in the theory or application of continuations, or informed positions regarding new control operators. Application presentations, or status reports These broadly accessible presentations should describe interesting applications of continuations in research, industry or open source. We encourage presentations of applications from areas outside of programming language research -- such as linguistics, logics, AI, computer graphics, operating systems, etc. These presentations need not present original research, but should deliver information that is new or that is unfamiliar to the general ICFP audience. (A broadly accessible version of research presented elsewhere, with the most recent results and more discussion of future work may be acceptable as a CW 2011 status report.) The abstract submission should justify, to a general reader, why an application is interesting. Demos and work-in-progress reports Live demonstrations or presentations of preliminary results are intended to show new developments, interesting prototypes, or work in progress. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes, and a work-in-progress report should take about 5 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Presenters will have to bring all the software and hardware for their demonstration; the workshop organizers are only able to provide a projector.) Submission Guidelines and Instructions -------------------------------------- Unlike the previous Continuation Workshops, we do not require the submission of complete research papers. We will select presentations based on submitted abstracts, up to 2 (A4 or US letter) pages long in the PDF format (with the optional supplementary material, up to 8 PDF pages). Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Email submissions to cw2011-submit at logic.cs.tsukuba.ac.jp Organizers ---------- Yukiyoshi Kameyama, University of Tsukuba Chung-chieh Shan, Rutgers University Oleg Kiselyov Program Committee ----------------- Kenichi Asai, Ochanomizu University, Japan Malgorzata Biernacka, University of Wroclaw, Poland Hugo Herbelin, PPS - pi.r2, INRIA, France Oleg Kiselyov Julia Lawall, University of Copenhagen, Denmark Tiark Rompf, EPFL, Switzerland Chung-chieh Shan, Rutgers University (Chair) Hayo Thielecke, University of Birmingham, UK -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 190 bytes Desc: Digital signature URL: From henglein at diku.dk Sun Jun 12 09:36:11 2011 From: henglein at diku.dk (Fritz Henglein) Date: Sun, 12 Jun 2011 15:36:11 +0200 Subject: [TYPES/announce] 1 faculty and 6 postdoc/Ph.D. positions in functional high-performance computing Message-ID: [The theory, design and application of type systems and attendant type technology for functional (FP) and domain-specific (DSL) languages are expected to be a cornerstone of the DSL and FP research areas, which constitute 50% of HIPERFIT. Candidates with knowledge and interest in type systems are particularly encouraged to apply.] The recently established Research Center for Functional High-Performance Computing for Financial Information Technology (HIPERFIT) at the University of Copenhagen has openings for 1 permanent faculty position and 6 postdoc or Ph.D. scholar positions, starting September 1st or later this year. The faculty position is at the assistant or associate professor position, depending on the applicant's seniority. The postdoc positions are for up to 3 years, and the Ph.D. scholar positions are full-time salaried positions for either 3 or 4 years. Applicants with documented knowledge of functional programming and/or domain-specific languages are highly encouraged to apply. Deadline: July 4th, 2011. Position start: September 1, 2011, or later. HIPERFIT gathers researchers from mathematical finance (MF), domain-specific languages (DSL), functional programming (FP) and high-performance systems (HPS) and experts from financial sector institutions to solve the simultaneous challenges of high transparency, high computational performance and high productivity in finance by mapping high-level models and languages directly onto the evolving crop of inexpensive highly parallel computer architectures such as GPGPUs. Candidates are expected to have a solid academic background within one or more of the 4 research areas (MF, DSL, FP, HPS) as demonstrated by documented knowledge related to: Multidimensional diffusion stock market models (MF) Bond market theory and credit risk theory (MF) Jump-diffusion models and stochastic volatility models (MF) Functional programming, other declarative programming paradigms (FP, DSLs and HPS) Formal semantics, type theory and type systems, program logics and verification (FP, DSLs and HPS) Program analysis and transformation, programming language implementation (FP, DSLs and HPS) Theory and practice of parallel and/or concurrent programming (FP, DSLs and HPS) Computer architecture (HPS). They are also expected to take an active interest in cooperating with researchers in the other areas. (Putting it informally: You are demonstrably at home in one of the areas -- one is enough, more are welcome -- and you are excited, rather than put off, worried or indifferent, about learning about and engaging yourself with specialists from the other areas.) HIPERFIT deliberately pursues high-risk research with a potentially disruptive strategic impact on high-performance computing practice, viewing the dramatic changes in commodity computing platforms from being sequential to massively parallel as an opportunity for ``naturally'' parallel high-level programming languages to effectively bridge problem/solution specifications on the one side and evolving parallel computer architectures on the other. In this fashion HIPERFIT complements the prevalent retrofitting and adaptation of existing code bases and low-level coding for specific parallel machine architectures. Applicants with a background in functional programming and declarative domain-specific languages are thus particularly encouraged to apply. For more information on HIPERFIT, see http://www.hiperfit.dk. For detailed information on the position announcements, including application details and contact information, see http://www.offentlige-stillinger.dk/sites/cfml/kbhuni/kbhuniVis.cfm?plugin=1&englishJobs=NO&nJobNo=196679&nLangNo=1. From carlos.martin at urv.cat Sun Jun 12 10:03:46 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Sun, 12 Jun 2011 16:03:46 +0200 Subject: [TYPES/announce] FSFLA 2011: 1st announcement Message-ID: ********************************************************************* 2011 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS FSFLA 2011 (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain October 31 ? November 4, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/fsfla2011/ ********************************************************************* ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. The previous event was SSFLA 2011 (http://grammars.grlmc.com/ssfla2011/). COURSES AND PROFESSORS: - Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours] - Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours] - Max H. Garzon (Memphis), DNA Codeword Design and DNA Languages [introductory/intermediate, 10 hours] - Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours] - Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours] - Michael Moortgat (Utrecht), Type-logical Grammars: Expressivity, Parsing Complexity [introductory/advanced, 8 hours] - Helmut Seidl (Technische M?nchen), Macro Treetransducers for XML Processing [intermediate, 6 hours] - Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] - Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/fsfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until July 31, 2011), - 15 euros (for payments after July 31, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention FSFLA 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. For early reduced rates, please notice that the date that counts is the date of the arrival of the fees to the School?s account. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the completion of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: June 4, 2011 Starting of the registration: June 4, 2011 Early registration deadline: July 31, 2011 Starting of the School: October 31, 2011 End of the School: November 4, 2011 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/fsfla2011/ POSTAL ADDRESS: FSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputaci? de Tarragona Universitat Rovira i Virgili From peterol at ifi.uio.no Sun Jun 12 17:05:17 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Sun, 12 Jun 2011 23:05:17 +0200 Subject: [TYPES/announce] Deadline extension: 8th International Symposium on Formal Aspects of Component Software Message-ID: <25424093-6ABF-461E-B2E2-FD7586326422@ifi.uio.no> --------------------------------------------------------------------- Call for Papers FACS 2011 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- *** Extended submission deadline: June 26 *** *** Springer LNCS proceedings *** *** Science of Computer Programming special issue *** Aims and Scope: The component-based software development approach has emerged as a promising paradigm to cope with the complexity of present-day software systems by bringing sound engineering principles into software engineering. However, many challenging conceptual and technological issues still remain in component-based software development theory and practice. Moreover, the advent of service-oriented computing has brought to the fore new dimensions, such as quality of service and robustness to withstand inevitable faults, that require revisiting established component-based concepts in order to meet the new requirements of the service-oriented paradigm. FACS 2011 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The symposium seeks to address the applications of formal methods in all aspects of software components and services. Specific topics include, but are not limited to: - formal models for software components and their interaction - formal aspects of services, service oriented architectures, and business processes - design and verification methods for software components and services - composition and deployment: models, calculi, languages - formal methods and modeling languages for components and services - model based and GUI based testing of components and services - component/service re-engineering and reuse - models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services - components for real-time, safety-critical, secure, and/or embedded systems - industrial or experience reports, and case studies - update and reconfiguration of component and service architectures - component systems evolution and maintenance - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self-adaptive systems Past Events: FACS'11 is the eighth event in a series of events founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The previous workshops in the FACS series were held in Pisa (September 2003, co-located with FM'03), Macau (October 2005), Prague (September 2006), Sophia-Antipolis (September 2007), Malaga (September 2008), Eindhoven (October 2009, held as part of the Formal Methods Week), and Guimaraes (October 2010). Invited speakers: Jose Meseguer (University of Illinois at Urbana-Champaign) John Rushby (SRI International) Submission: We solicit high-quality submissions reporting on: A- original research contributions (18 pages max, LNCS format); B- applications and experiences (18 pages max, LNCS format); C- surveys, comparisons, and state-of-the-art reports (18 pages max, LNCS format); D- tool papers (6 pages max, LNCS format); related to the topics mentioned above. In addition, we also solicit submissions to the Doctoral Track of FACS 2011, in the form of abstracts (2 pages, LNCS format) concisely capturing PhD-work-in-progress, related theme, context, research questions, envisaged contributions, and partial results. 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=facs2011. The final version of the paper must be prepared in LaTeX, adhering to the LNCS format. Publication: All accepted papers will appear in the pre-proceedings of FACS 2011. Revised versions of accepted papers in the categories A-D above will appear in the post-proceedings of the symposium that will be published as a volume in Springer's Lecture Notes in Computer Science series. 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: Categories A-D submission: June 26, 2011 (extended and final deadline!) Categories A-D acceptance notification: August 9, 2011 Doctoral Track submission: August 12, 2011 Doctoral Track acceptance notification: August 20, 2011 Symposium: September 14-16, 2011 Venue: FACS 2011 is hosted by the Department of Informatics at the University of Oslo. The symposium will take place in the new modern computer science building on the main campus of the university. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Program chairs: Farhad Arbab (Leiden University and CWI, The Netherlands) and Peter Olveczky (University of Oslo, Norway) Program committee: Erika Abraham (RWTH Aachen University, Germany) Farhad Arbab (Leiden University and CWI, The Netherlands) Christel Baier (Technical University of Dresden, Germany) Luis Barbosa (University of Minho, Portugal) Mihaela Bobaru (NASA/JPL, USA) Frank de Boer (CWI, The Netherlands) Christiano Braga (Universidade Federal Fluminense, Brazil) Roberto Bruni (University of Pisa, Italy) Carlos Canal (University of Malaga, Spain) Francisco Duran (University of Malaga, Spain) Rolf Hennicker (Ludwig-Maximilians-Universitaet Munich, Germany) Alexander Knapp (Augsburg University, Germany) Zhiming Liu (IIST UNU, Macau) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia Antipolis, France) Sun Meng (Peking University, China) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Frantisek Plasil (Charles University, Czech Republic) Gwen Salaun (Grenoble INP - INRIA, France) Bernhard Schaetz (fortiss GmbH, Germany) Wolfram Schulte (Microsoft Research, Redmond, USA) Nishant Sinha (NEC Labs, Princeton, USA) Marjan Sirjani (Reykjavik University, Iceland) Volker Stolz (University of Oslo, Norway) Carolyn Talcott (SRI International, USA) Emilio Tuosto (University of Leicester, UK) Steering Committee: Zhiming Liu (coordinator) (IIST UNU, Macau) Farhad Arbab (Leiden University and CWI, The Netherlands) Luis Barbosa (University of Minho, Portugal) Carlos Canal (University of Malaga, Spain) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia-Antipolis, France) Peter Olveczky (University of Oslo, Norway) Corina Pasareanu (NASA Ames, USA) Bernhard Schaetz (fortiss GmbH, Germany) Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From bywang at iis.sinica.edu.tw Sun Jun 12 23:26:38 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Mon, 13 Jun 2011 11:26:38 +0800 Subject: [TYPES/announce] Call for Papers: APLAS+CPP (new deadlines) Message-ID: <20110613112638.198727shsrqi60ry@webmail.iis.sinica.edu.tw> Dear colleagues, To accommodate recent requests, we are extending the submission deadlines of APLAS 2011 (Ninth Asian Symposium on Programming Languages and Systems) and CPP 2011 (First International Conference on Certified Programs and Proofs) by four days. New Dates: # Abstract Deadline (new): June 17, 2011 (23:59 GMT) # Submission Deadline (new): June 21, 2011 (23:59 GMT) # Notification: August 29, 2011 # Camera-Ready: September 19, 2011 Six invited speakers (APLAS and CPP combined): * Andrew Appel (Princeton University) * Nikolaj Bjorner (Microsoft Research) * Ranjit Jhala (UC San Diego) * Peter O'Hearn (Queen Mary, University of London) * Sriram Rajamani (Microsoft Research India) * Vladimir Voevodsky (Institute for Advanced Study, Princeton) Conference Details: Ninth Asian Symposium on Programming Languages and Systems (APLAS) Kenting, Taiwan, December 5-7, 2011 http://flolac.iis.sinica.edu.tw/aplas11/ First International Conference on Certified Programs and Proofs (CPP) Kenting, Taiwan, December 7?9, 2011 http://formes.asia/cpp/ Please kindly help circulate the CFPs. Thank you! best regards, APLAS and CPP 2011 PC Chairs and Organizers ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. -------------- next part -------------- ========================================================== APLAS 2011 Call For Papers Ninth Asian Symposium on Programming Languages and Systems Kenting, Taiwan, December 5--7, 2011 (co-located with CPP 2011) http://flolac.iis.sinica.edu.tw/aplas11/ ========================================================== 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 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 6461, 5904, 5356, 4807, 4279, 3780, 3302, and 2895. The 2011 edition will be held at Kenting, a seaside resort in Southern Taiwan. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: + semantics, logics, foundational theory; + design of languages and foundational calculi; + type systems; + compilers, interpreters, abstract machines; + program derivation and transformation; + program analysis, verification, model-checking, software security; + concurrency, constraints, domain-specific languages; + tools for programming, verification, implementation. APLAS 2011 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. IMPORTANT DATES: Abstract Deadline (new): June 17, 2011 (23:59 GMT) Submission Deadline (new): June 21, 2011 (23:59 GMT) Notification: August 29, 2011 Camera-Ready: September 19, 2011 INVITED SPEAKERS: Nikolaj Bjorner, Microsoft Research Redmond Ranjit Jhala, UC San Diego Peter O'Hearn, Queen Mary U. London Sriram Rajamani, Microsoft Research India SUBMISSION INFORMATION: We solicit submissions in two categories: 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. 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 at http://www.easychair.org/conferences/?conf=aplas2011. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings are planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. GENERAL CHAIR: Tyng-Ruey Chuang, Academia Sinica, Taiwan PROGRAM CHAIR: Hongseok Yang, U. Oxford aplas2011 at easychair.org PROGRAM COMMITTEE: Lars Birkedal (ITU, Denmark) James Brotherston (Imperial College, UK) Kung Chen (National Chengchi U., Taiwan) Wenguang Chen (Tsinghua U., China) Wei-Ngan Chin (NUS, Singapore) Javier Esparza (TUM, Germany) Xinyu Feng (USTC, China) Jerome Feret (INRIA, France) Matthew Fluet (RIT, USA) Rajiv Gupta (UC Riverside, USA) Masahito Hasegawa (Kyoto U., Japan) Radha Jagadeesan (Depaul U., USA) Naoki Kobayashi (Tohoku U., Japan) Daniel Kroening (U. Oxford, UK) Rupak Majumdar (MPI-SWS, Germany) Andrzej Murawski (U. Leicester, UK) Paulo Oliva (Queen Mary U. London, UK) Doron Peled (Bar Ilan U., Israel) Sukyoung Ryu (KAIST, Korea) Sriram Sankaranarayanan (U. Colorado, USA) Armando Solar-Lezama (MIT, USA) Sam Staton (U. Cambridge, UK) Viktor Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (U. Oxford, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam Rinetzky, Queen Mary U. London (Publicity chair) Yih-Kuen Tsay, National Taiwan University (Finance chair) -------------- next part -------------- The First International Conference on Certified Programs and Proofs (CPP 2011) FINAL CALL FOR PAPERS (with extended deadlines) Kenting, Taiwan December 7--9, 2011 http://formes.asia/cpp (co-located with APLAS 2011) 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. 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; and teaching mathematics and computer science with proof assistants. INVITED SPEAKERS: * Andrew Appel (Princeton University) * Nikolaj Bj?rner (Microsoft Research) * Peter O'Hearn (Queen Mary, University of London) * Vladimir Voevodsky (Institute for Advanced Study, Princeton University) 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: Monday, June 17, 2011 (new) Paper Submission Deadline: Friday, June 21, 2011 (new) Author Notification: Monday, August 29, 2011 Camera Ready: Monday, September 19, 2011 Conference: December 7-9, 2011 SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2011 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. AWARD FOR BEST PAPER: An award will be given for the best accepted paper, as judged by the program committee. The committee may decline to make the award or split it among several papers. PROGRAM CO-CHAIRS: Jean-Pierre Jouannaud (INRIA and Tsinghua University) Zhong Shao (Yale University) Email: cpp2011pc at gmail.com GENERAL CHAIR: Yih-Kuen Tsay (National Taiwan University) PROGRAM COMMITTEE: Andrea Asperti (University of Bologna) Gilles Barthe (IMDEA Software Institute) Xiao-Shan Gao (Chinese Academy of Sciences) Georges Gonthier (Microsoft Research Cambridge) Chris Hawblitzel (Microsoft Research Redmond) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (INRIA and Tsinghua University) Akash Lal (Microsoft Research India) Xavier Leroy (INRIA Paris-Rocquencourt) Yasuhiko Minamide (University of Tsukuba) Shin-Cheng Mu (Academia Sinica) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Sandip Ray (University of Texas at Austin) Natarajan Shankar (SRI International) Zhong Shao (Yale University) Christian Urban (TU Munich) Viktor Vafeiadis (Max Planck Institute for Software Systems) Stephanie Weirich (University of Pennsylvania) Kwangkeun Yi (Seoul National University) PUBLICITY CHAIR: Bow-Yaw Wang (Academia Sinica, INRIA and Tsinhua University) ORGANIZING COMMITTEE: Tyng-Ruey Chuang (chair), Shin-Cheng Mu, Yih-Kuen Tsay (Academia Sinica and National Taiwan University) Email: cpp2011oc at gmail.com From nswamy at microsoft.com Sun Jun 12 23:36:38 2011 From: nswamy at microsoft.com (Nikhil Swamy) Date: Mon, 13 Jun 2011 03:36:38 +0000 Subject: [TYPES/announce] Call for participation: CAV 2011 Message-ID: <55B8BB41BB08654590C07B5D630FD93A0877C3C9@TK5EX14MBXC218.redmond.corp.microsoft.com> I'm posting this to the list on behalf of Shaz Qadeer and Ganesh Gopalakrishnan, the chairs of CAV 2011. CAV this year includes a number of workshops and tutorials in which types feature prominently. --Nikhil -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: cav-participation.txt URL: From f.rabe at jacobs-university.de Tue Jun 14 06:19:41 2011 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Tue, 14 Jun 2011 12:19:41 +0200 Subject: [TYPES/announce] Last Call for Papers: 3rd Workshop on Modules and Libraries for Proof Assistants (affiliated with ITP 2011) Message-ID: <2E29836AD16BA68B6AFF30C7@[10.71.173.78]> Third International Workshop on Modules and Libraries for Proof Assistants (MLPA'11) http://kwarc.info/frabe/events/mlpa-11/index.html Affiliated with ITP Nijmegen, The Netherlands, August 22-27, 2011 CALL FOR PAPERS ----------------------------------------------------------------------- Submission deadline: 20 June 2011 Author Notification: 1 July 2011 Final Version: 11 July 2011 Workshop day: 26 August 2011 ----------------------------------------------------------------------- MLPA'11 is the third International Workshop on Modules and Libraries for Proof Assistants. Previous meetings were held at CADE 2009 and at FLoC 2010. MLPA aims at bringing together researchers and practitioners with background and experience in module systems from different logic-based systems, such as theorem provers, proof assistants, and programming languages. It will provide a fertile venue for the exchange of ideas and experiences and has the potential to impact the way we organize proofs and programs in the future. We want to foster discussion of state-of-the-art results and techniques, from theory and practice of module systems. This includes but is not limited to: * The design of module systems for programming languages and proof systems. * System descriptions of existing module systems, for example ML modules, type classes, Coq's, Isabelle's, or Agda's module system. * The implementation of formal digital libraries. * Case studies regarding information retrieval, sharing, and management of change. * Experience reports of industrial practitioners, using e.g., HOL, PVS, or other proof assistants. Program Committee: * Gerwin Klein, NICTA * Dale Miller, INRIA * Brigitte Pientka, McGill University * Florian Rabe, Jacobs University Bremen (chair) * Claudio Sacerdoti Coen, University of Bologna * Carsten Sch?rmann, IT University of Copenhagen (chair) Invited Speakers * Derek Dreyer, Max Planck Institute for Software Systems * Aleks Nanevski, IMDEA Software Submission Categories: * Category A: Detailed accounts of novel research - up to 15 pages. * Category B: Abstracts and short descriptions of current work and proposed directions - up to 5 pages. * Category C: System descriptions presenting an implemented tool and its features - up to 5 pages. Shorter papers are welcome. Submission is electronic via easychair. The submission site is https://www.easychair.org/conferences/?conf=mlpa11 Proceedings are published informally and will be available to the participants at the workshop. Formal post-proceedings will be considered depending on the number and quality of submissions. Authors of accepted papers are expected to present their work at the workshop. System descriptions should be accompanied with a demo. Organizers: Florian Rabe Carsten Schuermann f.rabe at jacobs-university.de carsten at itu.dk Jacobs University IT University of Copenhagen Bremen, Germany Copenhagen, Denmark From Marc.Bezem at ii.uib.no Tue Jun 14 10:26:19 2011 From: Marc.Bezem at ii.uib.no (Marcus Aloysius Bezem) Date: Tue, 14 Jun 2011 16:26:19 +0200 Subject: [TYPES/announce] TYPES/CSL'11: registration open, TYPES deadline approaching Message-ID: TYPES (8-11 September) and CSL'11 (12-15 September) 2011 in Bergen, Norway. NEWS: - Registration for TYPES/CSL'11 is now open: https://registrer.app.uib.no/csl - Booking a hotel room at a reduced rate can be done via: booking at ght.no See also: http://www.eacsl.org/csl11/#accommodation - Deadline for submitting a talk to TYPES is approaching: https://www.easychair.org/conferences/?conf=typespre2011 For more information on TYPES, see http://www.types.name/ - Pre-conference workshop "Epsilon Calculus and Constructivity": Sunday 11 September, 11h00-16h00 Invited speakers: Richard Zach, Daniel Weller and Rosalie Iemhoff Organizer: Matthias Baaz Free admission for TYPES/CSL'11 participants - A preliminary program for CSL'11 is now available: http://www.eacsl.org/csl11/program.pdf From frederic.loulergue at univ-orleans.fr Wed Jun 15 05:59:47 2011 From: frederic.loulergue at univ-orleans.fr (=?ISO-8859-1?Q?Fr=E9d=E9ric_Loulergue?=) Date: Wed, 15 Jun 2011 11:59:47 +0200 Subject: [TYPES/announce] PhD position on "Certified Compilation for High Level Parallel Programming" Message-ID: <4DF88293.9090104@univ-orleans.fr> The Computer Science Laboratory of Orleans in the University of Orleans (France) and the School of Information in the Kochi University of Technology are looking for a PhD researcher (3 years: 2 in France, 1 in Japan) to work on the "Parallel Program Development with Algorithmic Skeletons" project (PaPDAS) funded by the Agence Nationale de la Recherche (ANR) and the Japan Science and Technology agency (JST). The deadline for application is the 20th of June, 2011. Further information and application requirements: http://traclifo.univ-orleans.fr/PaPDAS From pierre.geneves at inria.fr Thu Jun 16 10:42:20 2011 From: pierre.geneves at inria.fr (Pierre Geneves) Date: Thu, 16 Jun 2011 16:42:20 +0200 Subject: [TYPES/announce] Junior Research Engineer Position at INRIA Grenoble Message-ID: <4DFA164C.5000507@inria.fr> The WAM research project at INRIA Grenoble Rhone-Alpes invites applications for one junior research engineer (2 years contract) on developing an XQuery Programming Environment. -- Theme -- In the recent years, huge amounts of information from various application domains are stored, exchanged, and presented using XML. In this context, the ability to safely, efficiently and uniformly query XML data on different platforms such as mobile devices on a variety of data sources becomes increasingly important. XQuery is the W3C standard for querying XML data. It is increasingly popular and one of the challenges in web software development today is to help achieving a good level of quality in terms of programming frameworks, code size and runtime performance. In particular, with the recent advances in document formats such as the advent of HTML5, SVG and other UI oriented formats together with the increasing interaction between browsers and remote services, a general purpose, uniform and reliable alternative to JavaScript can be played with languages such as XQuery. -- Topic -- The topic of this research engineer position consists in implementing a programming environment for XQuery that can offer the following features: - A type inference system for XQuery - A Static type checker for XQuery - Automatic code optimization and dead-code analysis Based on these features, other applications can be built to offer security features for data manipulation such as path-based access control policies. The foundations are based on newly developed formal programming language verification techniques [1,2], which are now mature enough to be introduced in the context of software development. The WAM project seeks to establish logical foundations and automated reasoning techniques with applications concerning, but not limited to, static analysis of programs manipulating XML documents, pointer and heap analysis, program verification. Information about previous relevant research is available online: http://wam.inrialpes.fr/web-solver/webinterface.html -- References -- [1] Efficient Static Analysis of XML Paths and Types. Pierre Geneves, Nabil Layaida and Alan Schmitt. PLDI'07. [2] Impact of XML Schema Evolution. Pierre Geneves, Nabil Layaida and Vincent Quint. TOIT'11. [3] XQuery in the browser. Ghislain Fourny, Donald Kossmann, Tim Kraska, Markus Pilman, and Daniela Florescu. SIGMOD '08. -- Keywords -- XQuery, static analysis, type system, security, mobile computing -- How to apply -- Please contact Pierre Geneves and Nabil Layaida before submitting your application through the link below: http://www.inria.fr/institut/recrutement-metiers/offres/ingenieurs-jeunes-diplomes/%28view%29/details.html?id=PGTFK026203F3VBQB6G68LONZ&LOV5=4510&ContractType=4545&LG=FR&Resultsperpage=20&nPostingID=5414&nPostingTargetID=10500&option=52&sort=DESC&nDepartmentID=10 ________________________________________________ Pierre Geneves www.pierresoft.com/pierre.geneves From marcel.kyas at fu-berlin.de Thu Jun 16 17:05:31 2011 From: marcel.kyas at fu-berlin.de (Marcel Kyas) Date: Thu, 16 Jun 2011 23:05:31 +0200 Subject: [TYPES/announce] WOCSD: Call for Papers Message-ID: <4DFA701B.6000407@fu-berlin.de> [ Apologies if you receive more than one copy of this CFP. Please share it with students and colleagues who may be interested. ] Workshop on Overcoming Challenges for Security and Dependability 26 August 2011, Oslo, Norway Call for Papers Affiliated with FCT 2011 http://www.mi.fu-berlin.de/secdep/workshop/2011/cfp.html Today, designers of computing systems face major challenges in building resilient and secure computing systems. We observe three trends. First, attackers organize themselves and increase their funding and resources. Consequently, their chances of success is increasing tremendously. Second, software was generally not designed to defend against attacks but to perform their function reasonably well. Software quality is decreasing, because its complexity is increasing, necessitated by increasing complexity of their requirements. Third, devices within computers became programmable, opening up new opportunities for attackers to compromise systems. The aim of this workshop is to bring together practitioners and researchers from academia, industry and government to discuss approaches for: * How to decrease software complexity and specification complexity to increase resilience and security * How to ensure correctness, safety, dependability and security of computer systems * How to certify software for todays heterogeneous computer platforms Topics of interest include, but are not limited to, the following areas: * Formalisms for expressing safety, security and dependability requirements * Methods for software certification * Models to express and analyze safety and security * Trade-off analysis * Methods and Tools for qualitative and quantitative analysis of security and dependability * Methods and tools for integrating software certification into design, implementation and validation processes * Experimental studies of system security and dependability * Case studies of qualitative and quantitative security and dependability evaluation * Secure and dependable protocols, embedded systems and networks * Formal and informal models and methods for human interaction and risks associated with social engineering Important Dates 1 July 2011 Submissions due 15 July 2011 Notification of acceptance 26 August 2011 Workshop Submission Submissions must be original work and not been published or submitted elsewhere, including but not limited to extended abstracts or extended versions of the work in other proceedings or journals. Submissions should be no longer than 6 pages, formatted in LaTeX using the eptcs macro package . Please submit your abstract at . A technical report containing all accepted contributions will be made available at the event. Presenters will be invited to submit an extended version that integrates results of the discussion at the workshop. The extended contributions may be up to 20 pages. We negotiate with Electronic Proceedings in Theoretical Computer Science for publishing post proceedings. Program Committee * Allesandro Aldini, University of Bologna, Italy * Marcel Kyas, Freie Universit?t Berlin, Germany * Dusko Pavlovic, Royal Holloway University of London, UK * Volker Roth, Freie Universit?t Berlin, Germany * Nigel Thomas, Newcastle University, UK * Katinka Wolter, Freie Universit?t Berlin, Germany * Stephen Wolthusen, Royal Holloway University of London, UK and Gj?vik University College, Norway Organizers * Marcel Kyas, Freie Universit?t Berlin, Germany * Volker Roth, Freie Universit?t Berlin, Germany * Katinka Wolter, Freie Universit?t Berlin, Germany -- Prof. Dr. Marcel Kyas, Freie Universit?t Berlin, Institut f?r Informatik, Takustr. 9, DE-14195 Berlin, Germany Tel.: +49 30 838 75141 Fax.: +49 30 838 75194 WWW: http://cst.mi.fu-berlin.de/staff/kyas.html From a.ricci at unibo.it Fri Jun 17 05:42:40 2011 From: a.ricci at unibo.it (Alessandro Ricci) Date: Fri, 17 Jun 2011 09:42:40 +0000 Subject: [TYPES/announce] Typing Actors, Agents in AGERE! at SPLASH Message-ID: <045E0994-2039-4997-AB96-650CC36E592A@unibo.it> Dear Types forum we are organizing a workshop at SPLASH 2011 called AGERE! Programming Systems, Languages, and Applications based on Agents, Actors, and Decentralized Control http://agere2011.apice.unibo.it The workshop is meant to foster the research on actor/agent oriented programming as evolution of mainstream paradigms, bringing together researchers working on the models, languages and technologies, and practitioners developing real-world systems and applications. A main topic of interest for the workshop is related to the investigation and definition of suitable type systems for actor-oriented and agent-oriented programming languages. You can read more about this, including the CFP, on AGERE! site (http://agere2011.apice.unibo.it). Besides, we solicit who is interested to actively contribute to the discussion of the themes, topics, workshop organization, ideas, to join the following Google group: AGERE! at SPLASH https://groups.google.com/forum/#!forum/agere-at-splash The basic idea is "to start the workshop now", having the opportunity to raise discussions, exchanging ideas and possibly also setup shared papers/docs to be discussed then during the event. Best Alessandro LA RICERCA C?? E SI VEDE: 5 per mille all'Universit? di Bologna - C.F.: 80007010376 http://www.unibo.it/Vademecum5permille.htm Questa informativa ? inserita in automatico dal sistema al fine esclusivo della realizzazione dei fini istituzionali dell?ente. From seidl at in.tum.de Sat Jun 18 11:26:05 2011 From: seidl at in.tum.de (Helmut Seidl) Date: Sat, 18 Jun 2011 17:26:05 +0200 Subject: [TYPES/announce] PhD Fellowships in "Program and Model Analysis" Message-ID: <4DFCC38D.8020605@in.tum.de> [[We apologize if you receive multiple copies!]] PhD Fellowships in the Doctorate Programme: ``Program and Model Analysis'' http://puma.in.tum.de The German Research Council (DFG) funds 12 doctoral fellowships through the new Doctorate Programme (Graduiertenkolleg) ``Program and Model Analysis''. The programme has started in July 2008. Applications for up to 5 positions welcome. Hosting institutions. The programme is hosted by the Technische Universit?t and Ludwig-Maximilians-Universit?t M?nchen, two of the three universities selected in the first round of the highly competitive Excellence Initiative. Their Computer Science departments are among the oldest and most reputed in Germany. The Professors involved in the programme are: Manfred Broy, Javier Esparza, Martin Hofmann, Alois Knoll, Tobias Nipkow, Andrey Rybalchenko, Helmut Seidl and Martin Wirsing. Objective. The programme will help PhD students to conduct excellent research on methods, algorithms and tools for the analysis of programs and models of information systems. The research topics seek to establish and exploit links between the four leading approaches for this task (theorem proving, model checking, abstract interpretation and type systems) and to apply them to software-intensive systems. PhD students will get excellent supervision, and will participate in a structured programme of courses and seminars offered by world experts. Positions. The doctorate programme offers doctoral fellowships for a period of three years. Retribution is according to Level 13 of the TV-L German salary scale. This amounts to an initial gross salary of 3100 Euro per month, increased to 3450 Euro per month after one year. Doctoral degrees are awarded by the Technische Universit?t or the Ludwig-Maximilians-Universit?t. Possible starting dates are negotiable.ligibility. Eligibility. Applicants should be at most 28 years old and hold a MSc (or an equivalent degree) in computer science or related disciplines (typically mathematics, physics, or engineering). Applications from MSc candidates who expect to get their degrees within the next months are also welcome. Fluency in spoken and written English or German is required. Applications. Applications will be considered until all positions are filled. They should contain a full curriculum vitae, a statement on the candidate's scientific interests, names and contact information of 2 references, and should be sent to Graduiertenkolleg PUMA, c/o. Prof. Dr. Helmut Seidl Technische Universit?t M?nchen Institut f?r Informatik, Boltzmannstra?e 3 85748 Garching Email: puma at in.tum.de Shortlisted applicants will usually be invited to visit M?nchen and give a talk on their Master's Thesis or on a scientific topic to be agreed upon. The decision on admission will be communicated shortly after the talk. From carlos.martin at urv.cat Sun Jun 19 11:10:50 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Sun, 19 Jun 2011 17:10:50 +0200 Subject: [TYPES/announce] SSLST 2011: 2nd announcement Message-ID: 2011 INTERNATIONAL SUMMER SCHOOL IN LANGUAGE AND SPEECH TECHNOLOGIES (SSLST 2011) (formerly International PhD School in Language and Speech Technologies) Tarragona, Spain, August 29 ? September 2, 2011 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/sslst2011/ ****************************************** AIM: SSLST 2011 offers a broad and intensive series of lectures on language and speech technologies at different levels. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate their career in research. ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Linguistics. Other students (for instance, from Mathematics, Electrical Engineering, Philosophy, or Cognitive Science) are welcome too. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. COURSES AND PROFESSORS: Walter Daelemans (Antwerpen), Computational Stylometry [advanced, 4 hours] Robert Dale (Macquarie), Automated Writing Assistance: Grammar Checking and Beyond [intermediate, 8 hours] Christiane Fellbaum (Princeton), Computational Lexical Semantics [introductory/intermediate, 8 hours] Ralph Grishman (New York), Information Extraction [intermediate, 8 hours] Daniel Jurafsky (Stanford), Computational Extraction of Social and Interactional Meaning [introductory/advanced, 8 hours] Chin-Hui Lee (Georgia Tech), A Short Course on Digital Speech Processing and Applications [intermediate, 8 hours] Yuji Matsumoto (Nara), Syntax and Parsing: Phrase Structure and Dependency Parsing [introductory/intermediate, 8 hours] Diana Maynard (Sheffield), Text Mining [introductory/intermediate, 8 hours] Dan Roth (Urbana-Champaign), Predicting Structures in NLP: Constrained Conditional Models and Integer Linear Programming in NLP [intermediate/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/sslst2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until June 5, 2011), - 15 euros (for payments after June 5, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention SSLST 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration process earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: April 21, 2011 Starting of the registration: April 25, 2011 Early registration deadline: June 5, 2011 Starting of the School: August 29, 2011 End of the School: September 2, 2011 QUESTIONS AND FURTHER INFORMATION: Florentina-Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/sslst2011/ POSTAL ADDRESS: SSLST 2011 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From swarat at cse.psu.edu Sun Jun 19 23:00:12 2011 From: swarat at cse.psu.edu (Swarat Chaudhuri) Date: Sun, 19 Jun 2011 23:00:12 -0400 Subject: [TYPES/announce] Postdoctoral researcher position at Rice University Message-ID: <4DFEB7BC.5090900@cse.psu.edu> Applications are now invited for a postdoctoral position at Rice University on automated program analysis and synthesis. The ideal candidate will have a passion for bringing together theory and practice, and deep expertise in automated verification (abstract interpretation and/or model checking). The position is for one year initially, but can be renewed to up to three years. The start date can be as early as September 2011, but is negotiable. To be considered for this position, please send a CV, a brief statement of interest, and the names of two references to Swarat Chaudhuri (swarat.chaudhuri at gmail.com). Further inquiries--for example, questions about specific project topics--are also welcome. From luigi.santocanale at lif.univ-mrs.fr Mon Jun 20 09:53:36 2011 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Mon, 20 Jun 2011 15:53:36 +0200 Subject: [TYPES/announce] TACL 2011 : Call for participation Message-ID: <4DFF50E0.9030207@lif.univ-mrs.fr> [apologies for multiple posting] =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) Call for participation =============================================================================== July 26-30, 2011 Universit?s Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Latest informations ------------------- * Program. The complete list of talks, including short abstracts, is available at the url http://www.lif.univ-mrs.fr/tacl2011/talks * Registration site. You can register to the conference through the url http://www.lif.univ-mrs.fr/tacl2011/registration * Early registration deadline: July 1, 2011. Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Invited speakers ---------------- * Steve Awodey, Carnegie Mellon University * Lev Beklemishev, Steklov Mathematical Institute Moscow * David Gabelaia, Tbilisi Razmadze Mathematical Institute * Nikolaos Galatos, University of Denver * Pierre Gillibert, Charles University Prague * Jean Goubault-Larrecq, ENS Cachan, CNRS, INRIA * Rosalie Iemhoff, Utrecht University * Mamuka Jibladze, Tbilisi Razmadze Mathematical Institute * Vincenzo Marra, Universit? degli Studi di Milano * Thomas Streicher, Technical University Darmstadt Esakia session -------------- The Fifth International Conference on Topology, Algebra and Categories in Logic is dedicated to the memory of Leo Esakia (1934-2010). In Leo's honour there will be a special session during the conference; three of the invited speakers will be giving their talk in this session: Lev Beklemishev, David Gabelaia, and Mamuka Jibladze. In addition, a memorial talk on the life and work of Leo Esakia will delivered by the chair of this session, Guram Bezhanishvili. Important dates --------------- July 1,2011: Early registration deadline July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Universit? degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Universit? Aix-Marseille II Tadeusz Litak, University of Leicester Paul-Andr? Melli?s, CNRS Paris Diderot George Metcalfe, Universitat Bern Nicola Olivetti, Universit? Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Universit? Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Universit? de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011 at lif.univ-mrs.fr =============================================================================== -- Luigi Santocanale LIF/CMI Marseille T?l: 04 13 55 13 08 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 13 55 13 02 From kaustuv.chaudhuri at inria.fr Mon Jun 20 15:35:16 2011 From: kaustuv.chaudhuri at inria.fr (Kaustuv Chaudhuri) Date: Mon, 20 Jun 2011 21:35:16 +0200 Subject: [TYPES/announce] Junior engineer position at INRIA Saclay/Ecole Polytechnique, Paris, France In-Reply-To: References: Message-ID: The Parsifal research team at INRIA Saclay and the Ecole Polytechnique has an open call for one junior engineer position (2 years). The main task of the recruited engineer will be to work on the integration and further development of a number of computational logic systems designed and built by the team members in recent years. Some tasks involved are: ?- Designing and implementing a common formal framework for ? ?communication between the Abella proof assistant, the Bedwyr ? ?symbolic model checker, and the Tac inductive theorem prover. ?- Using the Teyjus implementation of the Lambda Prolog programming ? ?language to represent and animate logical specifications of ? ?deductive and computational systems. ?- Investigating a number of application domains including the formal ? ?meta-theory of computational systems (programming languages, ? ?process calculi, etc.), and the use of formal proofs as ? ?certificates (eg. proof-carrying code, marketplace of proofs). Candidates should have a bachelor's degree in computer science, be familiar with the OCaml programming language (or similar high-level programming languages), and have a background in logic, formal methods, and symbolic computing. As this engineer will work with a team of international researchers, the candidate should be fluent in English. Knowledge of French is desirable but not mandatory. The position should begin in October 2011. Interested candidates are encouraged to contact the following people: ?Dale Miller . ?Kaustuv Chaudhuri Some links: Official announcements: ?http://www.lix.polytechnique.fr/parsifal/dokuwiki/doku.php?id=engineer ?http://en.inria.fr/institute/recruitment/offers/young-graduate-engineers Parsifal team web page: ?http://www.lix.polytechnique.fr/parsifal/ System descriptions: ?Bedwyr ?http://slimmer.gforge.inria.fr/bedwyr/ ?Abella ?http://abella.cs.umn.edu/ ?Tac ? ? http://slimmer.gforge.inria.fr/tac/ ?Teyjus ?http://teyjus.cs.umn.edu/ From dianne.nguyen at monash.edu Tue Jun 21 03:53:34 2011 From: dianne.nguyen at monash.edu (Dianne Nguyen) Date: Tue, 21 Jun 2011 17:53:34 +1000 Subject: [TYPES/announce] Final Call for Papers - Solomonoff 85th Memorial Conference Message-ID: *Final Call for Papers* Apologies for cross posting *Extended Deadline of Paper Submission: 2 July 2011 (NEW) * Solomonoff 85th Memorial Conference http://www.Solomonoff85thMemorial.monash.edu.au/ Proceedings of this multi-disciplinary conference will be published by Springer in the prestigious LNAI (LNCS) series ******************************************************************************************** Dear Colleague You are cordially invited to submit a paper and participate at Solomonoff 85th Memorial Conference which, will be held in Melbourne, Australia, between 30 November - 2 December 2011 with the possibility of a tutorial/workshop being organised on the 29th November 2011. This multi-disciplinary Conference will be run back to back with the AI 2011 Conference in Perth, Australia. This is a multi-disciplinary conference based on the wide range of applications of work related to or inspired by that of Ray Solomonoff. The contributions sought for this conference include, but are not restricted to, the following:- Statistical inference and prediction, Econometrics *(including time series and panel data)*, in Principle proofs of financial market inefficiency, Theories of (quantifying) intelligence and new forms of *(universal)*intelligence test *(for robotic, terrestrial and extra-terrestrial life)*, the Singularity(or infinity point , when machine intelligence surpasses that of humans), the future of science, Philosophy of science, the Problem of induction, Evolutionary (tree) models in biology and linguistics, Geography, Climate modelling and bush-fire detection, Environmental science, Image processing, Spectral analysis, Engineering, Artificial intelligence, Machine learning, Statistics and Philosophy, Mathematics, Linguistics, Computer science, Data mining, Bioinformatics, Computational intelligence, Computational science, Life sciences, Physics, Knowledge discovery, Ethics, Computational biology, Computational linguistics, Collective intelligence, structure and computing connectivity of random nets, effect of Heisenberg's principle on channel capacity, Arguments that entropy is not the arrow of time, and etc. See also Ray Solomonoff's Publications (and his obituary ). (For more details, please see Extended Call for Papers .) *General and Program Chair* David Dowe, Monash University, Australia *Program Committee* Andrew Barron, Statistics, Yale University, USA Greg Chaitin, IBM T.J. Watson Research Center, USA Fouad Chedid, Notre Dame University, Lebanon Bertrand Clarke, Medical Statistics, University of Miami, USA A. Phil Dawid, Statistics, Cambridge University, UK Peter Gacs, Boston University, USA Alex Gammerman, Royal Holloway, University of London, UK John Goldsmith, Linguistics, University of Chicago, USA Marcus Hutter, Australian National University, Australia Leonid Levin, Boston University, USA Ming Li, Mathematics, University of Waterloo, Canada John McCarthy, Stanford University, USA *(Turing Award winner)* Marvin Minsky, MIT, USA *(Turing Award winner)* Kee Siong Ng, ANU & EMC Corp, Australia David Paganin, Physics, Monash University, Australia Teemu Roos, University of Helsinki, Finland Juergen Schmidhuber, IDSIA, Switzerland Farshid Vahid, Econometrics, Monash University, Australia William Uther, NICTA and University of New South Wales, Australia Paul Vitanyi, CWI, The Netherlands Vladimir Vovk, Royal Holloway, University of London, UK *Co-ordinator* Dianne Nguyen, Monash University, Australia You will find more information about the Conference at the following Website: http://www.Solomonoff85thMemorial.monash.edu.au/ For more details on how to submit a paper(s), please refer to the Submission Page at: http://www.Solomonoff85thMemorial.infotech.monash.edu/submission.html *Important Dates* Extended Deadline of Paper Submission: *2 July 2011* Notification of Acceptance of Paper: *10 August 2011* Receipt of Camera-Ready Copy: *5 September 2011* Conference Dates: *30 Nov. - 2 Dec. 2011* I look forward to receiving your valuable paper contribution and attendance at the Conference. David Dowe General Chairman -------------- next part -------------- An HTML attachment was scrubbed... URL: From Pieter.Philippaerts at cs.kuleuven.be Tue Jun 21 04:39:09 2011 From: Pieter.Philippaerts at cs.kuleuven.be (Pieter Philippaerts) Date: Tue, 21 Jun 2011 10:39:09 +0200 Subject: [TYPES/announce] CFP - International Symposium on Engineering Secure Software and Systems (ESSoS) Message-ID: <001701cc2fee$b340ebc0$19c2c340$@Philippaerts@cs.kuleuven.be> Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos2012/ February 16 - 17, 2012, Eindhoven, The Netherlands In cooperation with ACM SIGSAC and SIGSOFT and (pending) IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Unfortunately, the Internet is too. 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 fourth 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 - support for assurance, certification and accreditation SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag 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. Two types of papers will be accepted: Full papers (max 12 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). Proposals for both tutorials and workshops are welcome. Further guidelines will appear on the website of the symposium. IMPORTANT DATES Abstract submission: September 18, 2011 Paper submission: September 25, 2011 Author notification: November 19, 2011 Camera-ready: December 11, 2011 PROGRAM COMMITTEE Program Committee Co-Chairs Gilles Barthe, IMDEA Software Institute Ben Livshits, Microsoft Research Program Committee Davide Balzarotti, EURECOM David Basin, ETH Zurich Hao Chen, UC Davis Manuel Costa, Microsoft Research Julian Dolby, IBM Research Maritta Heisel, U. Duisburg Essen Thorsten Holz, U. Ruhr Bochum Collin Jackson, CMU Martin Johns, SAP Research Jan J?rjens, TU Dortmund Engin Kirda, NorthEastern U. Javier Lopez, U. Malaga Sergio Maffeis, Imperial College Heiko Mantel, TU Darmstadt Fabio Martinelli, CNR Haris Mouratidis, University of East London Anders M?ller, Aarhus University Frank Piessens, KU Leuven Erik Poll, RU Nijmegen Pierangela Samarati, U. Milano Ketil St?len, SINTEF and U. Oslo Laurie Williams, North Carolina State University Jianying Zhou, Institute for Infocomm Research Singapore Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From smimram at gmail.com Tue Jun 21 10:07:37 2011 From: smimram at gmail.com (Samuel Mimram) Date: Tue, 21 Jun 2011 16:07:37 +0200 Subject: [TYPES/announce] Post-doc position available at CEA Saclay, France Message-ID: ================================================= Post-doc position available at CEA Saclay, France ================================================= The LMeASI laboratory is offering a 1-year post-doctoral position for a post-doctoral researcher to work on verification of concurrent programs, funded by the PANDA ANR. The activities of the laboratory range from the implementation of program analyzers to theoretical developments using tools originating in algebraic topology. The candidate should have a PhD thesis in computer science or mathematics and knowledge in one or more of the following areas: * concurrency theory * programming (especially in OCaml) * algebraic topology * category theory The research subject shall be related to the activities of the laboratory and will be discussed in details with applicants. The post-doc will take place in the Saclay center of CEA (Commissariat ? l'?nergie Atomique) in the LMeASI laboratory, and will be supervised by ?ric Goubault, Emmanuel Haucourt and Samuel Mimram. Candidates should send a resume to Samuel Mimram . The deadline for application is September 1, 2011. From beffara at iml.univ-mrs.fr Wed Jun 22 05:42:14 2011 From: beffara at iml.univ-mrs.fr (Emmanuel Beffara) Date: Wed, 22 Jun 2011 11:42:14 +0200 Subject: [TYPES/announce] LI2012: first announcement Message-ID: <20110622094214.GC28687@iml244> FIRST ANNOUNCEMENT LOGIC AND INTERACTIONS 2012 (LI2012) WINTER SCHOOL and WORKSHOPS Monday January 30 - Friday March 2 CIRM[1], Luminy, Marseille, France http://li2012.univ-mrs.fr/ We are organizing a 5 week session at the CIRM in Luminy: ?Logic and interactions 2012?. This event will gather researchers in various fields of ?logic in computer science?, following on the success of the Geocal meeting in 2006 [2]. The meeting will run five consecutive weeks, from 30 January to 2 March 2012, each dedicated to a particular area of logic and its interactions, as described below. Each week will include lectures, invited talks and contributed talks, together with work sessions. Lectures are aimed primarily at PhD students and non-specialist researchers. * Complexity (30 January - 2 February) Algorithmic complexity, implicit complexity, light logics, etc. * Logic and interaction (5 - 10 February) Geometry of interaction, ludics, games, linguistics, etc. * Proofs and programs (12 - 17 February) Realizability, semantics, program extraction, classical logic, effects and references, concurrent features, etc. * Quantitative approaches (19 - 24 February) Differential linear logic, quantitative semantics, stochastic systems, quantum computation, algebraic lambda-calculi, etc. * Algebra and computation (26 February - 2 March) Algebraic invariants of computation, rewriting, model structures, type theory and homotopy, ordered structures, etc. Obviously these themes are not disjoint, so we encourage participants, especially students, to participate to several consecutive weeks. Lodging at the CIRM[1] will be available for participants. A number of fundings, especially for students, will be available as well. Preregistration will open on the web site[3] after the summer. [1] http://www.cirm.univ-mrs.fr/ [2] http://iml.univ-mrs.fr/geocal06/ [3] http://li2012.univ-mrs.fr/ -- Emmanuel Beffara and Lionel Vaux Institut de Math?matiques de Luminy From pmt6sbc at maths.leeds.ac.uk Thu Jun 23 11:35:17 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Thu, 23 Jun 2011 16:35:17 +0100 (BST) Subject: [TYPES/announce] Turing Centenary Research Competition - Call for Proposals Message-ID: THE TURING CENTENARY RESEARCH PROJECT: MIND, MECHANISM AND MATHEMATICS Research Fellowship and Scholar Competition http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408 Submission deadline - December 16, 2011 More than any other figure, Turing has left a coherent scientific agenda related to many of the 'Big Questions' concerning the relationship between the human mind, mechanism in nature, and the mathematics required to clarify and answer these questions. The very breadth and fundamental nature of Turing's impact makes the centenary celebration a hugely opportune period in which to reassert the role of basic thinking in relation to deep and intractable problems facing science. 'The Turing Centenary Research Project - Mind, Mechanism and Mathematics', supported by a major grant from the John Templeton Foundation, arises from the above-mentioned scientific agenda, and is aimed at researchers still within ten years of receiving their Ph.D. The participants in the research project will be the winners of the 'Mind, Mechanism and Mathematics' competition, designed to provide significant funding support for eight young researchers. Five of the winners will become JTF 'Turing Research Fellows' with an award of ?75,000 each; and awards of ?45,000 will be for JTF 'Turing Research Scholars' in the 16 to 25 age-group. The competition is organised in conjunction with the Turing Centenary Celebration, to be held June 22-25, 2012, at the Manchester City Hall and the University of Manchester. The award winners will be duly honoured on the June 23, 2012 centenary of Turing's birth. Further details: __________________________________________________________________________ Honorary Chairs: Rodney Brooks and Sir Roger Penrose Submission deadline - December 16, 2011 Award Notification - March 31, 2012 Award Ceremony - Turing Centenary Day, June 23, 2012 Commencement of the research project - July 1, 2012 Proposals will be judged relative to four research themes: Chair of the Judges: S Barry Cooper (Leeds) The Judges for Research Theme 1 (The Mathematics of Emergence: The Mysteries of Morphogenesis): Luca Cardelli (Microsoft Research, Cambridge) Stuart Kauffman (Vermont/Santa Fe) Cris Moore (New Mexico/Santa Fe) The Judges for Research Theme 2 (Possibility of Building a Brain: Intelligent Machines, Practice and Theory): Luciano Floridi (Oxford/Hertfordshire) Barbara Grosz (Harvard) Aaron Sloman (Birmingham) The Judges for Research Theme 3 (Nature of Information: Complexity, Randomness, Hiddenness of Information): Eric Allender (Rutgers) Rodney Downey (Wellington) Manindra Agrawal (Kanpur) The Judges for Research Theme 4 (How should we compute? New Models of Logic and Computation): Samson Abramsky (Oxford) Gordon Plotkin (Edinburgh) Robert I. Soare (Chicago) Proposals should be made via the EasyChair submission page at: http://www.easychair.org/conferences/?conf=turingresearch2012 For further details, see: http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408 __________________________________________________________________________ ALAN TURING YEAR http://www.turingcentenary.eu _________________ 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 __________________________________________________________________________ From sylvain.salvati at labri.fr Fri Jun 24 03:15:52 2011 From: sylvain.salvati at labri.fr (Salvati Sylvain) Date: Fri, 24 Jun 2011 09:15:52 +0200 Subject: [TYPES/announce] Post-doc LaBRI, Bordeaux Message-ID: <4E0439A8.7060604@labri.fr> Post-doctoral position: ANR project Frontiers of RECognizability (FREC) Subject: Recognizability, Lambda-calculus, Higher-order languages} Summary: Some generalizations of context-free grammars (resp. pushdown automata) were proposed in the seventies by Aho (1968,1969). Later on, Maslov (1974,1976) defined the infinite hierarchy of ``Higher-order pushdown automata'' which extends further the above notions. The hierarchy of OI languages, defined by means of ``higher-order grammars'', based on lambda-calculus was introduced by Damm (1982). This hierarchy turned out to be strongly linked with the one defined by higher-order p.d.a. (Damma and Goerdt, 1986). As the study of OI languages and their decidable properties require to express strong invariants about higher-order pushdown automata, it may be interesting to use the grammatical presentation of higher-order OI languages by means of lambda-terms and try to express these invariants on the lambda-terms directly. Indeed, doing so one can benefit from the good understanding of the models of simply typed lambda-calculus so as to express the invariants in a more elegant and powerful way. Thus, the subject of this postdoc pertains to bridging the world of higher-order pushdown automata with that of lambda-calculus. This bridging can be done with several applications in mind. A first kind of application could be the generalisation of the result of decidability of the equality of deterministic context-free languages to certain higher-order grammars. It could also be the study of equations in the lambda-calculus etc ... Background: The candidate should have a strong background in theoretical computer science. In particular he/she should have knowledge in formal language theory, automata and lambda-calculus. Founding: The post-doctoral position will be paid around 2090 euros, free of charges, per month. Location: LaBRI, Bordeaux 1 university, FRANCE http://www.labri.fr/ Dates: Applications must be sent, by email, before 17/07/2011. The Post Doctoral position would take place Sept. 1st 2011 - Aug. 31st 2012 (not strict). More Information is on the web site: http://frec.labri.fr/ (go to the ``news'' page) Contact: S. Salvati, G. S?nizergues. emails:salvati at labri.fr, ges at labri.fr From Simon.Gay at glasgow.ac.uk Mon Jun 27 05:38:01 2011 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 27 Jun 2011 10:38:01 +0100 Subject: [TYPES/announce] CFP: Special Journal Issue on Behavioural Types Message-ID: <4E084F79.9060001@glasgow.ac.uk> MSCS special issue on Behavioural Types: call for papers -------------------------------------------------------- In sequential computational settings, since they were proposed, types have been interpreted as predicates, i.e., abstract behavioural specifications of a program. In the context of object-oriented programming, types are used to statically guarantee semantic interoperability, capturing behavioural aspects of the specified systems. In the context of polymorphic functional languages, effect system, extending type systems to statically describe the dynamic behaviour of a computation (its effect), are used to control resource usage, such as memory manipulation. When such languages are concurrent, effects resemble processes, and the effect system is akin to a labelled transition system. Process calculi are useful to statically describe, reason about, and discipline the dynamic behaviour of open, concurrent, and distributed systems, as they provide a language with rigorous semantics, allowing the proof of relevant properties. Moreover, such calculi are equipped with a large tool box of proof methods and theoretical results. Ideas, concepts, and techniques from lambda-calculi and from process calculi have been successfully applied to the study of behavioural properties of such systems, and of type systems for concurrent (functional and/or object-oriented) languages. Behavioural type systems in general, and in particular those based on typestate, are attracting a lot of attention as they are able to ensure more than the usual safety guarantees of static analysis. On one hand they provide a specification language to describe the dynamic behaviour of the components. On the other hand, the type systems guarantee a wide range of properties, from protocol compatibility, to resource-usage analysis, to deadlock-freedom and race-freedom. We invite prospective authors to submit to a special issue of the journal Mathematical Structures in Computer Science (MSCS) http://journals.cambridge.org/action/displayJournal?jid=MSC on the theme "Behavioural Types for Object-Oriented, Concurrent and/or Distributed Systems". Expressions of interest, including a preliminary title, abstract, and list of authors, should be sent to us no later than September 19th, 2011. Full submissions should be sent to us no later than November 28th, 2011. The editors of the special issue, Simon Gay (Univ. of Glasgow, U.K., Simon.Gay at glasgow.ac.uk) and Ant?nio Ravara (New Univ. of Lisbon, Portugal, aravara at fct.unl.pt) -------------------------------------------------------------------- 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 -------------------------------------------------------------------- ________________________________ The University of Glasgow, charity number SC004401 -------------- next part -------------- An HTML attachment was scrubbed... URL: From georg.moser at uibk.ac.at Mon Jun 27 08:31:39 2011 From: georg.moser at uibk.ac.at (Georg Moser) Date: Mon, 27 Jun 2011 14:31:39 +0200 Subject: [TYPES/announce] postdoctoral position in rewriting Message-ID: <4E08782B.9030201@uibk.ac.at> Within the ANR-FWF project STRUCTURAL there is a 2 year position as postdoctoral researcher at the Computational Logic group of the Institute of Computer Science, University of Innsbruck, Austria. It might be possible to extend the position to a 3 year position. Candidates are required to hold a PhD degree. A strong background in the themes of the STRUCTURAL project is an asset. This project is about bringing together different aspects and developments in structural proof theory, namely "deep inference", the "Curry-Howard correspondence", "term rewriting", and "Hilbert's epsilon-calculus". Candidates with a strong theoretical background in related areas are also encouraged to apply. Candidates are expected to contribute to research within the project. Knowledge of German is an advantage but not essential. The annual gross salary is approximately EUR 46,000. Applications (including CV, publication list, and two references) may be sent by email, to georg.moser at uibk.ac.at no later than August 20, 2011. Informal inquiries are also welcome at the same email address. Further information is available from the following links: *) Project STRUCTURAL: http://cl-informatik.uibk.ac.at/research/projects/structural-and-computational-proof-theory/ *) Institute of Computer Science: http://informatik.uibk.ac.at/ *) University of Innsbruck: http://www.uibk.ac.at/ --- Associate Professor Georg Moser Institute of Computer Science, University of Innsbruck Technikerstr. 21a, 6020 Innsbruck, Austria phone: +43 512 507 6435 fax: +43 512 507 9887 From might at cs.utah.edu Mon Jun 27 15:12:35 2011 From: might at cs.utah.edu (Matt Might) Date: Mon, 27 Jun 2011 13:12:35 -0600 Subject: [TYPES/announce] PLDI 2012: Preliminary call for papers and workshops Message-ID: ** Important Dates ** Paper submission: 6 November 2011 Notification: 2 February 2012 Conference: 11-16 June 2012 In 2012, the SIGPLAN conference on Programming Language Design and Implementation will be hosted in Beijing, China, and it will be co-located with ECOOP, LCTES, ISMM, TRANSACT, STOP, ASAIC and more! The organizers strongly encourage paper submissions related to: - Language designs and extensions - Static and dynamic analysis of programs - Domain-specific languages and tools - Performance analysis, evaluation, and tools - Program transformation and optimization - Interaction of compilers/runtimes with underlying systems - Checking or improving the security or correctness of programs - Program synthesis - Memory management - Program understanding - Novel programming models - Debugging techniques and tools - Type systems and program logics - Parallelism, both implicit and explicit (Submissions are by no means restricted to these topics.) ====================================== Proposals are also invited for workshops and tutorials. Co-located events will be held on June 15 or June 16, 2012. Proposals should be submitted by email to (xyzhang at cs.purdue.edu) and (cwu at ict.ac.cn). Proposals will be evaluated as they arrive. Proposal acceptance will be made on a first-come-first-served basis limited by the available hotel conference rooms. More information at: http://pldi12.cs.purdue.edu/content/calls/#cfwt For more information on PLDI, please see the PLDI 2012 web site: http://pldi12.cs.purdue.edu/ Sincerely, Matt Might (on behalf of the PLDI 2012 organizers) From ricardo at sip.ucm.es Tue Jun 28 09:36:53 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Tue, 28 Jun 2011 15:36:53 +0200 Subject: [TYPES/announce] Open Call for a Springer LNCS Volume on Resource Analysis Message-ID: <4E09D8F5.6070600@sip.ucm.es> *************************************************************************** * * OPEN CALL FOR A SPRINGER LNCS VOLUME ON RESOURCE ANALYSIS * * To be evaluated in conjunction with the selected papers of the 2nd International * Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** Resource analysis is a live research area where people from several research communities converge. The snd Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) covering many of these aspects was held in Madrid on May 2011. See http://dalila.sip.ucm.es/fopara11/ for looking at the program and at the rest of details of this workshop. We want to open the call for selected papers of FOPARA 2011 and invite other researchers in the area to submit papers. The results must be unpublished and not submitted for publication elsewhere. We will publish a volume of the Springer series Lecture Notes in Computer science containing both kinds of selected papers. The Program Committee of the open call will be that of FOPARA 2011. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The submission page is http://www.easychair.org/conferences/?conf=fopara2011 and it can also be accessed through the official FOPARA 2011 website. It will remain open from now to September 5th. Important dates --------------- Submission deadline: September 5th, 2011 Notification to authors: October 24th, 2011 LNCS camera ready deadline: November 18th Expected volume publication: January 2012 Program Committee ----------------- . Puri Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/?cole normale sup?rieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tam?s Kozsik (E?tv?s Lor?nd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL) From Jean-Yves.Marion at loria.fr Tue Jun 28 15:34:20 2011 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Tue, 28 Jun 2011 21:34:20 +0200 Subject: [TYPES/announce] Post-doctoral research position at Nancy University on ICC Message-ID: <3C259357-8055-45C1-849B-978135E99B7B@loria.fr> Post-doctoral position at Nancy University, INRIA-LORIA, France on Implicit computational complexity (ICC) Applications are now invited for a postdoctoral position on ICC. Candidates are expected to contribute to research within the ANR project COMPLICE. The ideal candidate will have interest on type systems, logics, and complexity. The position is for one year. The start date is negotiable. To be considered for this position, please send a CV, list of publications, a brief statement of interest, and the names of two references to Jean-Yves Marion (Jean-Yves.Marion at loria.fr). Further inquiries--for example, questions about specific project topics--are also welcome. COMPLICE is a four-year project whose partner sites are ENS Lyon, Universit? Paris 13 and LORIA-Nancy. The project's goal is to investigate the foundations and applications of implicit computational complexity (ICC), along the lines of semantics and logic, functional programming, program extraction from proofs, quantitative properties and ICC for concurrent systems. http://www.loria.fr/ http://en.inria.fr/inria-research-centre/nancy-grand-est http://www-lipn.univ-paris13.fr/complice/spip.php?auteur2 From s.j.thompson at kent.ac.uk Wed Jun 29 10:30:22 2011 From: s.j.thompson at kent.ac.uk (Simon Thompson) Date: Wed, 29 Jun 2011 15:30:22 +0100 Subject: [TYPES/announce] PEPM 2012: call for papers Message-ID: ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) Call For Papers http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of principled program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 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 and other support. 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 may later on be invited for a journal special issue dedicated to PEPM'12. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers TBD Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Labs) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea) Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From cristi at ifi.uio.no Thu Jun 30 07:48:19 2011 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Thu, 30 Jun 2011 13:48:19 +0200 Subject: [TYPES/announce] call for participation: FCT 2011 in Oslo Message-ID: !Please forgive us if you receive this announcement several times! -------------------------------------------------------------------- Call for Participation FCT 2011 18th International Symposium on Fundamentals of Computer Theory August 22-25, 2011, Oslo, Norway http://fct11.ifi.uio.no/ Established in 1977, the biennial Symposium on Fundamentals of Computation Theory is an international forum for researchers interested in all aspects of theoretical computer science. ----------------------------------------------------------------------------- REGISTRATION OPEN Early registration deadline: July 31, 2011 A limited amount of student sponsorships are available on application. INVITED SPEAKERS: - Yuri Gurevich (Microsoft Research, Redmond USA) "Impugning Randomness, Convincingly" - Daniel Lokshtanov (University of California, USA) "Kernelization; an Overview" - Jose Meseguer (University of Illinois at Urbana-Champaign, USA) "The Rewriting Logic Semantics Project: A Progress Report" - Andrew P. Black (Portland State University, USA) TBA The accepted papers are listed below. They are arranged in sessions covering ---------------------------------------------- o Complexity theory o Parametrized algorithms o Computation models o Calculi and programs o Graph algorithms o Fundamentals of Computing ---------------------------------------------- For the schedule of the program, see the FCT web-site. 1. A.N. Trahtman. Modifying the upper bound on the length of minimal synchronizing word 2. Annabell Berger and Matthias Mueller-Hannemann. Dag Realizations of Directed Degree Sequences 3. Bart M. P. Jansen and Stefan Kratsch. Data Reduction for Graph Coloring Problems 4. Chia-Jung Lee, Chi-Jen Lu and Shi-Chun Tsai. Computational Randomness from Generalized Hardcore Sets 5. Elliot Fairweather, Maribel Fernandez and Murdoch Gabbay. Principal types for nominal theories 6. Fabien Givors and Gregory Lafitte. Sub-Computabilities 7. Ferdinando Cicalese, Martin Milanic and Ugo Vaccaro. Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs 8. Florian Corzilius and Erika Abraham. Virtual Substitution for SMT Solving 9. Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli and Vangelis Paschos. Online maximum k-coverage 10. Gregory Gutin, Mark Jones and Anders Yeo. A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application 11. Guillaume Malod. Succinct algebraic branching programs characterizing non-uniform complexity classes 12. Jacques Bahi, Jean-Francois Couchot, Christophe Guyeux and Adrien Richard. On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems 13. Jos Baeten, Bas Luttik and Paul Van Tilburg. Reactive Turing Machines 14. Klaus Meer. Almost transparent short proofs for NP over the reals 15. Krishnendu Chatterjee, Laurent Doyen and Rohit Singh. On Memoryless Quantitative Objectives 16. Ludwig Staiger. Constructive dimension and Hausdorff dimension: the case of exact dimension 17. Mamadou Moustapha Kante, Vincent Limouzy, Arnaud Mary and Lhouari Nourine. Enumeration of Minimal Dominating Sets and Variants 18. Marius Zimand. On the optimal compression of sets in PSPACE 19. Martin Ebbesen, Paul Fischer and Carsten Witt. Edge-matching Problems with Rotations 20. Mila Dalla Preda and Cinzia Di Giusto. Hunting distributed malware with the k-calculus 21. Nathaniel Charlton and Bernhard Reus. Specification patterns and proofs for recursion through the store 22. Paul Hunter. LIFO-search on digraphs: A searching game for cycle-rank 23. Petr Golovach, Daniel Paulusma and Jian Song. Coloring graphs without short cycles and long induced paths 24. Pinar Heggernes, Pim Van 'T Hof, Bart Jansen, Stefan Kratsch and Yngve Villanger. Parameterized Complexity of Vertex Deletion into Perfect Graph Classes 25. Robert Bredereck, Andre Nichterlein, Rolf Niedermeier and Geevarghese Philip. The Effect of Homogeneity on the Complexity of k-Anonymity 26. Sergey Goncharov and Lutz Schroeder. A Coinductive Calculus for Asynchronous Side-effecting Processes 27. Stephen Fenner. Functions that preserve p-randomness 28. Stephane Bessy and Anthony Perez. Polynomial kernels for Proper Interval Completion and related problems EVENTS * FCT is part of the program related to the scientific opening of the new "Ole-Johan Dahl building" of the Department of Informatics. This part takes the morning of Monday 22nd. It will include invited talks and discussion panel on mainly theory and future of programming languages. * The social dinner takes place in the Gamle Logen, the place where the King of Norway hands each year the Abel Prize for life-long achievements in Mathematics. * An excursion is organized in the second afternoon of the conference. From freek at cs.ru.nl Fri Jul 1 16:39:18 2011 From: freek at cs.ru.nl (Freek Wiedijk) Date: Fri, 1 Jul 2011 22:39:18 +0200 Subject: [TYPES/announce] ITP 2011 (Call for Participation) Message-ID: <20110701203918.GA7703@cs.ru.nl> CALL FOR PARTICIPATION ITP 2011: 2nd International Conference on Interactive Theorem Proving 22-25 August 2011, Nijmegen, The Netherlands http://itp2011.cs.ru.nl/ ----- Important dates: _____________ Early registration deadline: July 15th 2011 Conference: 22-25 August 2011 Affiliated workshops: 26-27 August 2011 ----- Registration and Hotel ____________________ Registration open. Instruction on the ITP web-site: http://itp2011.cs.ru.nl/ITP2011/Registration_-_Open.html Hotel reservation is also open. Note the special rate of 60 Euros/night including breakfast. More information at: http://itp2011.cs.ru.nl/ITP2011/Hotel_Reservation.html ----- Conference __________ ITP brings together researchers working in all areas of interactive theorem proving. It combines the communities of two venerable meetings: the TPHOLs conference and the ACL2 workshop. The inaugural meeting of ITP was held on 11-14 July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC, 9-21 July 2010). The second edition of ITP will take place in Nijmegen, The Netherlands, on 22-25 August 2011. The final programme will include 21 regular paper presentations and 4 rough diamonds presentations. It will also include 4 invited talks by renown speakers from industry and academia. ITP 2011 has 8 affiliated workshops. Submission to some workshops is still open. ITP will finally feature two system demo's presenting the use of ACL2 and KeY on large examples. This will give ITP experts the opportunity to get insight into the practical use of two ITP systems. This call for participations contain the list of accepter papers, invited speakers, system demos, and affiliated workshops. Accepted Papers ______________ David Monniaux and Pierre Corbineau. On the Generation of Positivstellensatz Witnesses in Degenerate Cases Anthony Fox. LCF-style Bit-Blasting in HOL4 Johannes H?lzl and Armin Heller. Three Chapters of Measure Theory in Isabelle/HOL Andreas Lochbihler and Lukas Bulwahn. Animating the Formalised Semantics of a Java-like Language Jesper Bengtson, Jonas Braband Jensen, Filip Sieczkowski and Lars Birkedal. Verifying object-oriented programs with higher-order separation logic in Coq Alexander Krauss, Christian Sternagel, Ren? Thiemann, Carsten Fuhs and J?rgen Giesl. Termination of Isabelle Functions via Termination of Rewriting Anne-Gwenn Bosser, Pierre Courtieu, Julien Forest and Marc Cavazza. Structural Analysis of Narratives with the Coq Proof Assistant Ond?ej Kun?ar. Proving Valid Quantified Boolean Formulas in HOL Light Lennart Beringer. Relational decomposition Laureano Lamb?n, Francisco-Jes?s Mart?n-Mateos, Julio Rubio and Jose-Luis Ruiz-Reina. Applying ACL2 to the Formalization of Algebraic Topology: Simplicial Polynomials Peter Gammie. Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments Scott Owens, Peter Boehm, Francesco Zappa Nardelli and Peter Sewell. Lightweight Tools for Heavyweight Semantics Peter Reid and Ruben Gamboa. Automatic Differentiation in ACL2 Magnus O. Myreen and Jared Davis. A verified runtime for a verified theorem prover Sylvain Heraud and David Nowak. A Formalization of Polytime Functions Chunhan Wu, Xingyuan Zhang and Christian Urban. A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof Pearl) Renaud Clavel, Laurence Pierre and Regis Leveugle. Towards Robustness Analysis using PVS Matej Urbas and Mateja Jamnik. Heterogeneous Proofs: Spider Diagrams meet Higher-Order Provers Phil Scott and Jacques Fleuriot. Composable Discovery Engines for Interactive Theorem Proving Tobias Nipkow. Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism Georges Gonthier. Point-free, set-free concrete linear alegbra Tarek Mhamdi, Osman Hasan and Sofiene Tahar. Formalization of Entropy Measures in HOL Thomas Sewell, Simon Winwood, Peter Gammie, Toby Murray, June Andronick and Gerwin Klein. seL4 Enforces Integrity Ramana Kumar and Tjark Weber. Validating QBF Validity in HOL4 Michael Norrish. Mechanised Computability Theory Invited Speakers _______________ Don Batory (UT Austin, USA) Bart Jacobs (Radboud University Nijmegen) Georges Gonthier (Microsoft) Mike Kishinevsky (Intel) Invited System Demos ______________________ ACL2 by Warren Hunt (UT Austin / Centaur) KeY by Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Peter H. Schmitt Affiliated Workshops ___________________ ** The third Coq workshop (Coq-3) ** http://www.cs.ru.nl/~spitters/coqw.html Workshop day(s): August 26 Submission deadline: May 16 Notification to authors: June 8 ** The 6th International Workshop on Systems Software Verification (SSV'11) ** https://es.fbk.eu/events/ssv2011/index.php Workshop day(s): August 26 Submission deadline: May 29 Notification to authors: June 30 ** The ITP 2011 Workshop on Mathematical Wikis (MathWikis-2011) ** http://www.cs.ru.nl/mwitp/ Workshop day(s): August 27 Submission deadline: May 30 Notification to authors: June 23 ** The 3rd workshop on Modules and Libraries for Proof Assistans (MLPA-11) ** http://kwarc.info/frabe/events/mlpa-11/index.html Workshop day(s): August 26 Submission deadline: June 20 *********** submission still open ******************** Notification to authors: July 1 ** The 3rd workshop on Dependently Typed Programming (DTP-11) ** http://www.cs.ru.nl/dtp11/ Workshop day(s): August 27 Submission deadline: June 10 Notification to authors: June 25 Contact: lfmtp2011 at easychair.org ** The 10th KEY Symposium (KeY-11). ** http://www.key-project.org/keysymposium11/ Workshop day(s): August 26 and 27 ** The 6th International Workshop on Logical Frameworks and ** Meta-languages: Theory and Practice (LFMTP-11) ** http://lfmtp11.cs.umn.edu/Site/Welcome.html Workshop day(s): August 27 Submission deadline: May 23 Notification to authors: June 22 From marcel.kyas at fu-berlin.de Fri Jul 1 16:48:52 2011 From: marcel.kyas at fu-berlin.de (Marcel Kyas) Date: Fri, 01 Jul 2011 22:48:52 +0200 Subject: [TYPES/announce] WOCSD: Final Call for Papers (Deadline Extended) Message-ID: <1309553332.8446.2.camel@linna> [ Apologies if you receive more than one copy of this CFP. Please share it with students and colleagues who may be interested. ] Workshop on Overcoming Challenges for Security and Dependability 26 August 2011, Oslo, Norway Call for Papers Affiliated with FCT 2011 http://www.mi.fu-berlin.de/secdep/workshop/2011/cfp.html Today, designers of computing systems face major challenges in building resilient and secure computing systems. We observe three trends. First, attackers organize themselves and increase their funding and resources. Consequently, their chances of success is increasing tremendously. Second, software was generally not designed to defend against attacks but to perform their function reasonably well. Software quality is decreasing, because its complexity is increasing, necessitated by increasing complexity of their requirements. Third, devices within computers became programmable, opening up new opportunities for attackers to compromise systems. The aim of this workshop is to bring together practitioners and researchers from academia, industry and government to discuss approaches for: * How to decrease software complexity and specification complexity to increase resilience and security * How to ensure correctness, safety, dependability and security of computer systems * How to certify software for todays heterogeneous computer platforms Topics of interest include, but are not limited to, the following areas: * Formalisms for expressing safety, security and dependability requirements * Methods for software certification * Models to express and analyze safety and security * Trade-off analysis * Methods and Tools for qualitative and quantitative analysis of security and dependability * Methods and tools for integrating software certification into design, implementation and validation processes * Experimental studies of system security and dependability * Case studies of qualitative and quantitative security and dependability evaluation * Secure and dependable protocols, embedded systems and networks * Formal and informal models and methods for human interaction and risks associated with social engineering Important Dates 8 July 2011 Submissions due (Extended Deadline) 15 July 2011 Notification of acceptance 26 August 2011 Workshop Submission Submissions must be original work and not been published or submitted elsewhere, including but not limited to extended abstracts or extended versions of the work in other proceedings or journals. Submissions should be no longer than 6 pages, formatted in LaTeX using the eptcs macro package . Please submit your abstract at . A technical report containing all accepted contributions will be made available at the event. Presenters will be invited to submit an extended version that integrates results of the discussion at the workshop. The extended contributions may be up to 20 pages. We negotiate with Electronic Proceedings in Theoretical Computer Science for publishing post proceedings. Program Committee * Allesandro Aldini, University of Bologna, Italy * Marcel Kyas, Freie Universit?t Berlin, Germany * Dusko Pavlovic, Royal Holloway University of London, UK * Volker Roth, Freie Universit?t Berlin, Germany * Nigel Thomas, Newcastle University, UK * Katinka Wolter, Freie Universit?t Berlin, Germany * Stephen Wolthusen, Royal Holloway University of London, UK and Gj?vik University College, Norway Organizers * Marcel Kyas, Freie Universit?t Berlin, Germany * Volker Roth, Freie Universit?t Berlin, Germany * Katinka Wolter, Freie Universit?t Berlin, Germany -- Prof. Dr. Marcel Kyas, Freie Universit?t Berlin, Institut f?r Informatik, Takustr. 9, DE-14195 Berlin, Germany Tel.: +49 30 838 75141 Fax.: +49 30 838 75194 WWW: http://cst.mi.fu-berlin.de/staff/kyas.html From koba at kb.ecei.tohoku.ac.jp Sun Jul 3 21:20:44 2011 From: koba at kb.ecei.tohoku.ac.jp (koba) Date: Mon, 04 Jul 2011 10:20:44 +0900 (JST) Subject: [TYPES/announce] Postdoc Position on Higher-Order Model Checking and Program Verification Message-ID: <20110704.102044.41638226.koba@kb.ecei.tohoku.ac.jp> A new postdoc position is available for 5-year project "Higher-Order Model Checking and its Applications" (see the project description below), at Tohoku University, Japan. The appointment can start as early as in October 2011 (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 JPY (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 ecei.tohoku.ac.jp), no later than August 15th, 2011. Project Description -------------------- Project Title: Higher-Order Model Checking and its Applications Principal Investigator: Naoki Kobayashi Project 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, "Higher-Order Model Checking: From Theory to Practice", Invited paper in Proceedings of LICS, 2010. (A very brief survery of the field) From b.i.kavanagh at sms.ed.ac.uk Mon Jul 4 07:37:40 2011 From: b.i.kavanagh at sms.ed.ac.uk (Benedict Kavanagh) Date: Mon, 4 Jul 2011 12:37:40 +0100 Subject: [TYPES/announce] LFCS Free Topos Seminar, Phil Scott, 13 July, Edinburgh, Scotland Message-ID: <0C0E9339-48FB-42F9-A185-B899EE044980@sms.ed.ac.uk> If you will be in Scotland on July 13 please consider attending an afternoon of lectures on the free topos by Philip Scott. You will find the announcement below. -Ben ------------------------------------------------------------------------------ Laboratory for Foundations of Computer Science (LFCS), University of Edinburgh presents: ***** What is the free topos? ***** by Philip Scott, Dept. of Mathematics and Statistics, University of Ottawa SICSA Distinguished Visiting Fellow More information available at: http://wcms.inf.ed.ac.uk/lfcs/events/prof.-phil-scott-free-topos-lecture Location: Informatics Forum, Room 4.31/33, School of Informatics, University of Edinburgh, Scotland. Time: 14:00-17:00, 13 July 2011. Abstract: The free topos is a model of intutionistic higher order logic, and may be thought of as a universe of sets for a moderate intuitionist. In this lecture, we give an introduction to free topoi (on graphs); in particular, we discuss metamathematical properties of the free topos (generated by the empty graph), which is an initial object in the category of all toposes with logical functors. The free topos satisfies many interesting properties corresponding to proof-theoretic principles of intuitionistic higher-order logic, and indeed allows us to reprove these properties in an elegant algebraic way. This includes such familiar properties as the existence and disjunction properties, uniformity principles, independence of premisses, as well as various choice principles. We shall discuss uniform categorical proofs, based on gluing methods of Peter Freyd, as well as connections with realizability. If time permits, we discuss more recent results. ----------------------- -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From peterol at ifi.uio.no Mon Jul 4 19:24:42 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Tue, 5 Jul 2011 01:24:42 +0200 Subject: [TYPES/announce] 1st Call for Abstracts: Doctoral Track at FACS 2011 Message-ID: --------------------------------------------------------------------- Call for Abstracts FACS-DT 2011 Doctoral Track at the 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- *** Submission deadline: August 12 *** We solicit submissions to the Doctoral Track of FACS 2011, in the form of abstracts (2 pages, LNCS format) describing PhD-work-in-progress, related theme, context, research questions, envisaged contributions, and partial results related to the topics of FACS. All accepted abstracts will appear in the pre-proceedings of FACS 2011. Paper submission will be done electronically via EasyChair at https://www.easychair.org/conferences/?conf=facsdt2011 FACS Aims and Scope: FACS 2011 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The symposium seeks to address the applications of formal methods in all aspects of software components and services. Specific topics include, but are not limited to: - formal models for software components and their interaction - formal aspects of services, service oriented architectures, and business processes - design and verification methods for software components and services - composition and deployment: models, calculi, languages - formal methods and modeling languages for components and services - model based and GUI based testing of components and services - component/service re-engineering and reuse - models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services - components for real-time, safety-critical, secure, and/or embedded systems - industrial or experience reports, and case studies - update and reconfiguration of component and service architectures - component systems evolution and maintenance - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self-adaptive systems Past Events: FACS'11 is the eighth event in a series of events founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The previous workshops in the FACS series were held in Pisa (September 2003, co-located with FM'03), Macau (October 2005), Prague (September 2006), Sophia-Antipolis (September 2007), Malaga (September 2008), Eindhoven (October 2009, held as part of the Formal Methods Week), and Guimaraes (October 2010). FACS invited speakers: Jose Meseguer (University of Illinois at Urbana-Champaign) John Rushby (SRI International) Important dates: Doctoral Track submission: August 12, 2011 Doctoral Track acceptance notification: August 20, 2011 Symposium: September 14-16, 2011 Venue: FACS 2011 is hosted by the Department of Informatics at the University of Oslo. The symposium will take place in the new modern computer science building on the main campus of the university. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Doctoral Track program chairs: Farhad Arbab (Leiden University and CWI, The Netherlands) and Peter Olveczky (University of Oslo, Norway) Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From fmontesi at italianasoftware.com Tue Jul 5 04:33:25 2011 From: fmontesi at italianasoftware.com (Fabrizio Montesi) Date: Tue, 5 Jul 2011 10:33:25 +0200 Subject: [TYPES/announce] Second CFP: SAC 2012 track on Service-Oriented Architectures and Programming (SOAP) Message-ID: SOAP Service-Oriented Architectures and Programming http://www.itu.dk/acmsac2012-soap/ ACM SAC 2012 For the past twenty-seven 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 2012 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Trento, Italy. 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 different 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) August 31, 2011: Paper submissions October 12, 2011: Author notification November 2, 2011: Camera-Ready Copy March 25-29, 2012: 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 2012 Website: http://www.acm.org/conferences/sac/sac2012/ 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. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Maurice ter Beek, ISTI-CNR, Pisa (Italy) Jesper Bengtson, IT University of Copenhagen (Denmark) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Francisco Martins, University of Lisbon (Portugal) Michele Mazzucco, University of Tartu (Estonia) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. (Italy) Paolo Missier, Newcastle University (UK) Bardia Mohabbati, Simon Fraser University (Canada) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Rosario Pugliese, University of Firenze (Italy) Jean-Bernard Stefani, INRIA Grenoble (France) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Olaf Zimmermann, IBM Research - Zurich (Switzerland) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy From damiano.mazza at lipn.univ-paris13.fr Wed Jul 6 03:50:18 2011 From: damiano.mazza at lipn.univ-paris13.fr (Damiano Mazza) Date: Wed, 06 Jul 2011 09:50:18 +0200 Subject: [TYPES/announce] Post-doc position in Implicit Computational Complexity at LIPN, Paris 13 Message-ID: <4E1413BA.4000605@lipn.univ-paris13.fr> _______________________________________________________ Post-doctoral position at LIPN, Universit? Paris 13 Implicit computational complexity and linear logic http://www-lipn.univ-paris13.fr/complice/ ________________________________________________________ A 12-month post-doctoral position is vacant at the Laboratoire d'Informatique de Paris Nord (LIPN), Universit? Paris 13, within the research project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction, http://www-lipn.univ-paris13.fr/complice/), funded by the French national research agency (ANR). Please note that the position is to be filled relatively quickly, so the deadline is quite short: deadline for applications : 12 July 2011 (next week!) notification : 13 July 2011 starting date : 1 October 2011 (no later than 1 Dec 2011) _______________________________________________________ ________________ Scientific context ___________________ COMPLICE is a four-year project whose partner sites are ENS Lyon, Universit? Paris 13 and LORIA-Nancy. The project's goal is to investigate the foundations and applications of implicit computational complexity (ICC), along the lines of semantics and logic, functional programming, program extraction from proofs, quantitative properties and ICC for concurrent systems. _______________________________________________________ ______________________ Location _______________________ LIPN (http://www-lipn.univ-paris13.fr/?lang=uk) plays a major role in research in computer science within the northern Paris area. The post-doc researcher will work within the Logic, Computation and Reasoning group (http://www-lipn.univ-paris13.fr/LCR/?lang=uk), among whose main research directions there are proof theory, linear logic, lambda-calculus, implicit computational complexity, denotational semantics, and system specification and verification. LIPN is situated in Villetaneuse, in the northern suburbs of Paris, within the campus of the University Paris 13 (about 45 minutes from the city center by public transportation). Interaction with the other sites of the COMPLICE project is possible, as with other sites in the Paris area (PPS, LIX, etc.). _______________________________________________________ ________________ Salary and benefits __________________ The monthly salary will be around 2000 EUR. This is then subject to income tax. The position is for 12 months. The post-doc researchers will be affiliated to the French social security system, and will be entitled to unemployment benefit at the end of the contract. _______________________________________________________ ____________________ Requirements _____________________ The applicants must hold a PhD. We are especially interested in candidates with background in one or several of the following fields: - linear logic (proof nets, geometry of interaction, ludics) - rewriting theory (lambda-calculus, interaction nets) - denotational semantics (category theory, games semantics, vectorial semantics) - implicit computational complexity (light logics, type systems for complexity) _______________________________________________________ _______________ Application procedure _________________ Applicants should send a detailed resume by email EXCLUSIVELY, to the addresses Damiano.Mazza at lipn.univ-paris13.fr Virgile.Mogbil at lipn.univ-paris13.fr preferably with the subject containing the words "Complice Application" (to be sure that the application is not accidentally eaten by spam filters...). -- Damiano Mazza Charg? de recherche CNRS Laboratoire d'Informatique de Paris Nord http://www-lipn.univ-paris13.fr/~mazza ________________________________________________________ The best evidence of intelligent life out there is that none of them have contacted us. -- John Fistere, from the National Geographic Forum From james at cs.ioc.ee Thu Jul 7 01:23:19 2011 From: james at cs.ioc.ee (James Chapman) Date: Thu, 7 Jul 2011 08:23:19 +0300 Subject: [TYPES/announce] SPLST 2011 - Call for Papers In-Reply-To: References: <482433EB-921A-4188-9F81-EA30902D58F2@cs.ioc.ee> Message-ID: Dear all, Please consider submitting a short or long paper to this symposium to be held in Tallinn in October. The symposium is timed to coincide with the next (more informal) Estonian Theory Days meeting so authors are welcome to attend both events. ?The symposium is local in a linguistic sense and alternates between Estonia, Finland and Hungary. After the symposium selected authors will be invited to revise their papers for a journal special issue published by the Estonian Academy of Sciences. We would be delighted to see submissions from the Types community! See below for further information. Regards, James Chapman ? ? ? ? ? ? ? ? ? ? ?Call for Papers ? ? ? ? ? ? ? ? ? ? ? ? ? SPLST'11 ?12th Symposium on Programming Languages and Software Tools ? ? ? ? ? ? ? ? ? ? ?http://www.cs.ioc.ee/splst11/ ? ? ? ? ? ? ? October 5-7, 2011, Tallinn, Estonia ? ? ? ?IMPORTANT DATES ? ? ? ?Submission Deadline: ? ? ? ? ? ?Monday, ?August 22 ? ? ? ?Author Notification: ? ? ? ? ? ? ? ? ? ?Saturday, September 10 ? ? ? ?Camera ready manuscript: ? ? ? ?Monday, September 19 ? ? ? ?Registration: ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? Monday, September 19 ? ? ? ?BACKGROUND This symposium is the twelfth in a series of conferences which started in 1989 in Szeged, Hungary. Since then it has been organized biannually. The twelfth symposium will be hosted by the Institute of Cybernetics at Tallinn University of Technology (IoC) and organized in co-operation with the Estonian Centre of Excellence in Computer Science (EXCS). ? ? ? ?AIMS AND SCOPE The Symposium on Programming Languages and Software Tools will provide a forum for software scientists to present and discuss recent research and development in computer science. The scope of the symposium covers ongoing research related to languages, tools and methods for software development. Topics of interest include, but are not limited to: programming and modeling languages and systems, formal methods and algorithms, parallel and distributed systems, techniques for embedded, database, web and ubiquitous systems, techniques and tools for software engineering, model-driven software engineering, software evolution, refactoring ?and re-engineering, software architectures and software processes, etc. ? ? ? ?PROCEEDINGS All accepted papers will be published in the conference proceedings as a report of IoC with ISBN. The authors of selected talks will be invited to revise their papers in order to be published as a special issue of the Proceedings of the Estonian Academy of Sciences (http://www.eap.ee/proceedings) in 2012. The papers submitted to this special issue will undergo standard journal referee process. ? ? ? ?SUBMISSIONS Authors are invited to submit full research papers (at most 12 pages) or short research papers (4-6 pages) in PDF-format before August 22nd. Submissions should be written in English and formatted using the easychair.cls LaTeX class (can be obtained from http://www.easychair.org/easychair.zip). All submitted papers will be reviewed by members of the program committee and the accepted papers must be presented at the workshop by one of the authors. Submissions should contain sufficient detail to allow to evaluate its validity, quality, originality and relevance. Simultaneous submission to other conferences with published proceedings or journals is not allowed. Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=splst11 ? ? ? ?PROGRAM COMMITTEE James ?Chapman - Institute of Cybernetics, Estonia Hassan Charaf - Budapest University of Technology and Economics, Hungary Marlon Dumas - University of Tartu, Estonia Tibor Gyim?thy - University of Szeged, Hungary Zolt?n Horv?th - E?tv?s Lor?nd University, Hungary Akos Kiss - University of Szeged, Hungary Kai Koskimies - Tampere University of Technology, Finland Tamas Kozsik - E?tv?s Lor?nd University, Hungary Merik Meriste - University of Tartu, Estonia Erkki M?kinen - University of Tampere, Finland Jukka Paakki - University of Helsinki, Finland Andr?s Pataricza - Budapest University of Technology and Economics, Hungary Jaan Penjam - Institute of Cybernetics, Estonia Jari Peltonen - Tampere University of Technology, Finland Attila Peth? - University of Debrecen, Hungary Luigia Petre - ?bo Akademi University, Finland Kari Smolander - Lappeenranta University of Technology, Finland Tarja Syst? - Tampere University of Technology, Finland Jorma Tarhio - Aalto University, Finland Kuldar Taveter - Tallinn University of Technology, Estonia Tarmo Uustalu - Institute of Cybernetics, Estonia Margus Veanes - Microsoft Research, Redmond USA Varmo Vene - University of Tartu, Estonia ? ? ? ?STEERING COMMITTEE Kai Koskimies - Tampere University of Technology, Finland Zolt?n Horv?th - E?tv?s Lor?nd University, Hungary Jaan Penjam - Institute of Cybernetics, Estonia The SPLST?11 symposium will be followed by the Estonian Computer Science Theory Days on October 7- 9, 2011. The SPLST participants interested are welcome to join (see http://cs.ioc.ee/excs/tdays/ ). -------------- next part -------------- A non-text attachment was scrubbed... Name: CFP.pdf Type: application/pdf Size: 65392 bytes Desc: not available URL: From crusso at microsoft.com Thu Jul 7 08:11:57 2011 From: crusso at microsoft.com (Claudio Russo) Date: Thu, 7 Jul 2011 12:11:57 +0000 Subject: [TYPES/announce] CFP: PADL'12 - Practical Aspects of Declarative Languages 2012 Message-ID: <88D1F4047EA9A2468BCC6B743186880F58234E06@DB3EX14MBXC309.europe.corp.microsoft.com> [Apologies if you receive multiple copies.] Call for Papers =============== 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 Abstract/Paper submission deadline: September 10th/17th, 2011 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'12 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, January 25-27. The symposium will be held in Philadelphia, Pennsylvania, USA. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2011 Paper Submission: September 17, 2011 Notification: October 22, 2011 Camera-ready: November 5, 2011 Symposium: January 23-24, 2011 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 chairs 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. PADL'12 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 15 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. Program Committee ================= Marcello Balduccini, Intelligent Systems Department, Kodak Research Labs Edwin Brady, University of St Andrews, Scotland Henning Christiansen, Roskilde University, Denmark Agostino Dovier, University of Udine, Italy Matthew Flatt, University of Utah, USA Gopal Gupta, University of Texas at Dallas, USA John Hughes, Chalmers University of Technology, Sweden; Quviq AB Gabriele Keller, University of New South Wales, Australia Lunjin Lu, Oakland University, USA Marc Pouzet, ?cole normale sup?rieure, France Ricardo Rocha, University of Porto, Portugal Andreas Rossberg, Google Germany GmbH, Germany Claudio Russo, Microsoft Research Cambridge, UK (co-chair) Kostis Sagonas, Uppsala Univeristy, Sweden Satnam Singh, Microsoft Research Cambridge, UK Zoltan Somogyi, University of Melbourne, Australia Eijiro Sumii, Tohoku University, Japan Terrance Swift, Universidade Nova de Lisboa, Portugal; Johns Hopkins University, USA Andrew Tolmach, Portland State University, USA Jan Wielemaker, University of Amsterdam, The Netherlands Roland Yap, National University of Singapore, Republic of Singapore Kwangkeun Yi, Seoul National University, Korea Neng-Fa Zhou, Brooklyn College, City University of New York, USA (co-chair) Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Claudio Russo Microsoft Research Cambridge,UK Email: crusso microsoft com Neng-Fa Zhou Brooklyn College, The City University of New York, USA Email: zhou sci brooklyn cuny edu With the Cooperation of ======================= The Association for Logic Programming (ALP) ACM SIGPLAN =================================== From cc2 at ecs.soton.ac.uk Thu Jul 7 19:49:57 2011 From: cc2 at ecs.soton.ac.uk (Corina Cirstea) Date: Fri, 8 Jul 2011 00:49:57 +0100 Subject: [TYPES/announce] *** CALCO 2011: Early registration deadline approaching *** References: <20110707234957.GA19639@login.ecs.soton.ac.uk> Message-ID: ========================================================================= CALL FOR PARTICIPATION: CALCO 2011 4th International Conference on Algebra and Coalgebra in Computer Science August 29 - September 2, 2011 Winchester, UK http://calco2011.ecs.soton.ac.uk/ ========================================================================= *** Early registration deadline: July 15, 2011 *** (accommodation only guaranteed until July 15) *** Programme now available from the website *** ========================================================================= CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. This is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy, 2009). The fourth edition will be held in the city of Winchester (UK), a historic cathedral city and the ancient capital of Wessex and the Kingdom of England. CALCO 2011 will be preceded by the CALCO Young Researchers Workshop, CALCO-Jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. The programme of CALCO also comprises presentations of tools based on algebraic and/or coalgebraic principles, that have been selected in the context of a dedicated workshop, CALCO-Tools. -- INVITED SPEAKERS -- * Javier Esparza (Germany): Solving Fixed-Point Equations by Derivation Tree Analysis * Philippa Gardner (UK): Abstract Local Reasoning about Program Modules * Gopal Gupta (USA): Infinite Computation, Coinduction and Computational Logic -- CALCO ACCEPTED PAPERS -- * Clement Fumex, Neil Ghani and Patricia Johann. Indexed Induction and Coinduction, Fibrationally * Jort Bergfeld and Yde Venema. Model constructions for Moss' coalgebraic logic * Jiri Adamek, Mahdie Haddadi and Stefan Milius. From Corecursive Algebras to Corecursive Monads * Sergey Goncharov and Lutz Schroeder. A Counterexample to Tensorability of Effects * Camilo Rocha and Jose Meseguer. Proving Safety Properties of Rewrite Theories * Ekaterina Komendantskaya and John Power. Coalgebraic semantics for derivations in logic programming * Adriana Balan and Alexander Kurz. Finitary Functors: from Set to Preord and Poset * Joost Winter, Marcello Bonsangue and Jan Rutten. Context-Free Languages, Coalgebraically * Marta Bilkova, Alexander Kurz, Daniela Petrisan and Jiri Velebil. Relation Liftings on Preorders * Murdoch Gabbay, Tadeusz Litak and Daniela Petrisan. Stone duality for nominal Boolean algebras with `new': topologising Banonas * Bart Jacobs. Bases as Coalgebras * Thorsten Altenkirch, Peter Morris, Fredrik Nordvall Forsberg and Anton Setzer. A categorical semantics for inductive-inductive definitions * Jun Kohjina, Toshimitsu Ushio and Yoshiki Kinoshita. Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata * Ichiro Hasuo. The Microcosm Principle and Compositionality of GSOS-Based Component Calculi * Mihai Codescu and Till Mossakowski. Refinement trees: calculi, tools and applications * Baltasar Trancon Y Widemann and Hauhs Michael. Distributive-Law Semantics for Cellular Automata and Agent-Based Models * Corina Cirstea. Model Checking Linear Coalgebraic Temporal Logics: an Automata-Theoretic Approach * Katsuhiko Sano. Generalized Product of Coalgebraic Hybrid Logics * Rasmus Ejlers Mogelberg and Sam Staton. Linearly-used state in models of call-by-value * Fredrik Dahlqvist and Dirk Pattinson. On the fusion of coalgebraic modal logics * Manuel A. Martins, Alexandre Madeira, Razvan Diaconescu and Luis Barbosa. Hybridization of Institutions -- CALCO-Tools ACCEPTED PAPERS -- * Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac and Anna Ingolfsdottir. PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates * Pawel Sobocinski and Jennifer Lantair. WiCcA: LTS generation tool for wire calculus * Francisco Duran, Camilo Rocha and Jose Maria Alvarez. Tool Interoperability in the Maude Formal Environment * Andre Martins, Luis Barbosa and Nuno Rodrigues. SHACC: A functional animator for a component calculus * Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg and Monika Seisenberger. Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras * Musab Alturki and Jose Meseguer. PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool -- LOCATION -- Winchester is a beautiful historic city in southern England, known for its 11th-century cathedral and 12th-century castle. It is located just under an hour by rail from London Waterloo, and 15 minutes by road or rail from Southampton Airport. London Heathrow is 50 miles away and London Gatwick 72 miles away. -- FURTHER INFORMATION -- Queries should be emailed to calco2011 at ecs.soton.ac.uk . From w.swierstra at cs.ru.nl Fri Jul 8 09:04:18 2011 From: w.swierstra at cs.ru.nl (Wouter Swierstra) Date: Fri, 8 Jul 2011 15:04:18 +0200 Subject: [TYPES/announce] Call for participation: DTP 2011 Message-ID: Dependently Typed Programming 2011 Call for Participation 27 of August 2011 Nijmegen, The Netherland In association with ITP 2011 http://www.cs.ru.nl/dtp11 Please consider registering for DTP 2011: http://itp2011.cs.ru.nl/ITP2011/Registration_-_Open.html Note that early bird registration is only open till July 15th. The preliminary program is now available from http://www.cs.ru.nl/dtp11/program.html Invited Talk: Edwin Brady, "Systems Programming with Dependent Types" Contributed Talks: Bob Atkey, "Reifying Parametricity" Steven Keuchel, "Generic Programming with Binders and Scope" Josh Ko, "Modularising Inductive Families" Pedro Magalhaes, "Formally Comparing Approaches to Datatype-generic Programming, using Agda" Conor McBride, "Crude but Effective Stratification" Duckki Oe, "versat: A Verified Modern SAT Solver" Brigitte Pientka, "Covering all Bases: Design and Implementation of a Coverage Checker for Contextual Objects" Venanzio Capretta, "The Polymorphic Representation of Induction-recursion" Kai Trojahner, "Qube: Array Programming with Dependent Types" Cezar Ionescu, "Dependently-typed Programming in Economic Modelling" See you in Nijmegen, Ana Bove, Chalmers, Sweden Matthieu Sozeau, INRIA, France Wouter Swierstra, Radboud University, The Netherlands From elaine at mat.ufmg.br Fri Jul 8 09:44:19 2011 From: elaine at mat.ufmg.br (Elaine Pimentel) Date: Fri, 8 Jul 2011 13:44:19 +0000 (UTC) Subject: [TYPES/announce] LSFA 2011 - call for participation Message-ID: ========================================================================= CALL FOR PARTICIPATION: LSFA 2011 6th Workshop on Logical and Semantic Frameworks with Applications August 27, 2011 Belo Horizonte - MG - Brazil http://www.mat.ufmg.br/LSFA2011 ========================================================================= *** Early registration deadline: July 31st, 2011 *** *** Call for grants open *** *** Preliminary program now available from the website *** ========================================================================= Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and 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 o Proof theory o Type theory o Automated deduction * Semantic frameworks o Specification languages and meta-languages o Formal semantics of languages and systems o Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA 2011 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. Invited Speakers - Pete Manolios (Northeastern University) - Arnon Avron (Tel-Aviv University) - Luiz Carlos Pereira (PUC-Rio) Program Committee Simona Ronchi della Rocca (co-chair, UNITO, Italy) Elaine Gouvea Pimentel (co-chair, UFMG, Brazil) Luis Farinas del Cerro (IRIT, France) Edward Hermann Haeusler (PUC-Rio, Brazil) Mauricio Ayala-Rincon (UnB, Brazil) Mario Benevides (Coppe-UFRJ, Brazil) Eduardo Bonelli (UNQ, Argentina) Marcelo Correa (IM-UFF, Brazil) Clare Dixon (Liverpool, UK) Gilles Dowek (Polytechnique-Paris, France) William Farmer (Mcmaster, Canada) Maribel Fernandez (King's College, UK) Marcelo Finger (IME-USP, Brazil) Alwyn Goodloe (NASA LaRC) Fairouz Kamareddine (Heriot-Watt Univ, UK) Delia Kesner (Paris-Jussieu, France) Luis da Cunha Lamb (UFRGS, Brazil) Joao Marcos (UFRN, Brazil) Flavio L. C. de Moura (UnB, Brazil) Ana Teresa Martins (UFC, Brazil) Martin Musicante (UFRN, Brazil) Claudia Nalon (UnB, Brazil) Vivek Nigam (Ludwig-Maximilians-Universitat Munchen) Luca Paolini (UNITO, Italy) Jonathan Seldin (Univ-Lethbridge , Canada) Luis Menasche Schechter (UFRJ, Brazil) Organizing Committee Mauricio Ayala-Rincon Edward Hermann Hauesler PUC-Rio Elaine Pimentel (Local-chair) Simona Ronchi della Rocca Dates Early registration: July 31st Call for grants: July 31st LSFA: August 27th At least one of the authors should register at the conference. The paper presentation will be in English. Venue Belo Horizonte is the capital of the state of Minas Gerais and the third-largest metropolitan area in Brazil. A city surrounded by mountains, quite big, but still with this countryside town air. Contact Information For more information please contact the chairs. The web page of the event can be reached at: http://www.mat.ufmg.br/LSFA2011/ 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 Fax: 55 31 3409-5692 http://www.mat.ufmg.br/~elaine ------------------------------------------------- From dezani at di.unito.it Sun Jul 10 03:44:03 2011 From: dezani at di.unito.it (Mariangiola Dezani) Date: Sun, 10 Jul 2011 09:44:03 +0200 Subject: [TYPES/announce] 3 year PhD position in Computer Science at Torino University Message-ID: Please find here: http://www.unito.it/accessorapido/phd_competition the advertisement for 3 year PhD positions in Computer Science funded by the University of Torino. The deadline for application is 28th July 2011 at Midday - Italian time. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Mariangiola Dezani-Ciancaglini Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : dezani at di.unito.it phone: 39-011-6706850 fax : 39-011-751603 mobile: 39-320-4359903 http://www.di.unito.it/~dezani ********************************************************************** Unless unavoidable, no Word, Excel or PowerPoint attachments, please. See http://www.gnu.org/philosophy/no-word-attachments.html ********************************************************************** "L'ITALIA RIPUDIA LA GUERRA come strumento di offesa alla libert? degli altri popoli e come mezzo di risoluzione delle controversie internazionali." (Art. 11 della Costituzione della Repubblica Italiana) -------------- next part -------------- An HTML attachment was scrubbed... URL: From pangjun at gmail.com Tue Jul 12 07:26:56 2011 From: pangjun at gmail.com (Jun PANG) Date: Tue, 12 Jul 2011 13:26:56 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at SAC'12: 2nd CfP Message-ID: ================================================== 27th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 25 - 29, 2012, Riva del Garda (Trento), Italy More information: http://www.win.tue.nl/sacsvt12/ and http://www.acm.org/conferences/sac/sac2012/ =================================================== Important dates --------------- * August 31th 2011: Submission deadline * October 12th 2011: Notification of acceptance/rejection * November 2nd 2011: 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-six years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2012 is sponsored by SIGAPP and will be hosted by the Microsoft Research - University of Trento Researcher Centre for Computational and Systems Biology, at Riva del Garda (Trento), Italy. 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/sac2012/. 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 2012 proceedings. A special issue of Innovations in Systems and Software Engineering (ISSE) has been. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of ISSE. Program committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Chris Hankin, Imperial College, UK 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, Oxford University, UK Martin Steffen, University of Oslo, Norway Marielle Stoelinga, University of Twente, the Netherlands Tim Willemse, Eindhoven University of Technology, The Netherlands From ggrov at staffmail.ed.ac.uk Tue Jul 12 10:23:22 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Tue, 12 Jul 2011 15:23:22 +0100 Subject: [TYPES/announce] VSTTE 2012 : Third Call for Papers Message-ID: 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 will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter M?ller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Sup?rieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Universit? Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter M?ller, ETH Zurich Tobias Nipkow, Technische Universit?t M?nchen Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Universit? Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From U.Berger at swansea.ac.uk Tue Jul 12 13:32:17 2011 From: U.Berger at swansea.ac.uk (Ulrich Berger) Date: Tue, 12 Jul 2011 18:32:17 +0100 Subject: [TYPES/announce] Domains X 2011: Call for Participation Message-ID: <4E1C8521.8030108@swansea.ac.uk> Workshop Announcement and Call for Participation D O M A I N S X http://www.cs.swan.ac.uk/domains2011/ Swansea University, Wales, UK, 5-7 September 2011 Deadline for abstracts of short talks: 25 July 2011 Deadline for Student Grants: 25 July 2011 Registration Deadline: 29 July 2011 INTRODUCTION The Workshop on Domains is aimed at computer scientists and mathematicians alike who share an interest in the mathematical foundations of computation. The workshop will focus on domains, their applications and related topics. Previous meetings were held in Darmstadt (94,99,04), Braunschweig (96), Munich (97), Siegen (98), Birmingham (02), Novosibirsk (07) and Brighton (08). Besides its traditional topics Domains X will have the special themes 'Modelling Computational Effects' and 'Modelling Continuous Data.' The emphasis at Domains workshops is on the exchange of ideas between participants similar in style to Dagstuhl seminars. In particular, talks on subjects presented at other conferences and workshops are acceptable. INVITED SPEAKERS Lars Birkedal University of Copenhagen (Denmark) Nick Benton Microsoft Research Cambridge (UK) Margarita Korovina University of Manchester (UK) Dag Normann University of Oslo (Norway) John Power University of Bath (UK) Matija Pretnar University of Ljubljana (Slovenia) Thomas Streicher University of Darmstadt (Germany) Jeff Zucker McMaster University (Canada) CONTRIBUTED TALKS See http://www.cs.swan.ac.uk/domains2011/ Submission of abstracts for short talks will be considered until July 25. Please submit a one-page abstract via Easychair https://www.easychair.org/conferences/?conf=domainsx2011 SCOPE Domain theory has had applications to programming language semantics and logics (lambda-calculus, PCF, LCF), recursion theory (Kleene-Kreisel countable functionals), general topology (injective spaces, function spaces, locally compact spaces, Stone duality), topological algebra (compact Hausdorff semilattices) and analysis (measure, integration, dynamical systems). Moreover, these applications are related - for example, Stone duality gives rise to a logic of observable properties of computational processes. As such, domain theory is highly interdisciplinary. Topics of interaction with domain theory for this workshop include, but are not limited to: program semantics program logics probabilistic computation exact computation over the real numbers lambda calculus games models of sequential computation constructive mathematics recursion theory realizability real analysis and computability topology, metric spaces and domains locale theory category theory topos theory type theory REGISTRATION Please register before July 29, 2011. We offer a standard package including workshop fee, 3 nights en-suite accommodation including breakfast and lunches for 220 pounds. Details can be found on the workshop website http://www.cs.swan.ac.uk/domains2011/ STUDENT GRANTS A limited number of grants for UK-based research students, funded by the London Mathematical Society, are available. Please apply before July 25, 2011. Details can be found on the workshop website http://www.cs.swan.ac.uk/domains2011/ VENUE AND ACCOMMODATION The Domains X workshop will take place at Swansea University, Department of Computer Science, Robert Recorde Room (2nd floor, Faraday Building). En-suite accommodation will be on Campus in House Oxwich. For details see the workshop website http://www.cs.swan.ac.uk/domains2011/ PROGRAMME COMMITTEE Ulrich Berger Swansea University (Co-Chair) Jens Blanck Swansea University Martin Escardo University of Birmingham (Co-Chair) Achim Jung University of Birmingham Klaus Keimel TU Darmstadt Bernhard Reus University of Sussex John Tucker Swansea University ORGANIZING COMMITTEE Ulrich Berger Swansea University Jens Blanck Swansea University Monika Seisenberger Swansea University PUBLICATION We plan to publish proceedings of the workshop in a special volume of a journal. There will be a call for papers after the workshop. The papers will be refereed according to normal publication standards. From Peter.OHearn at eecs.qmul.ac.uk Tue Jul 12 20:36:09 2011 From: Peter.OHearn at eecs.qmul.ac.uk (Peter O'Hearn) Date: Tue, 12 Jul 2011 21:36:09 -0300 Subject: [TYPES/announce] Postdoc Position in Program Verification and Analysis Message-ID: Queen Mary, University of London is looking to appoint a Post Doctoral Research Assistant the area of Program Verification and Analysis. The successful applicant will be supervised by Professor Byron Cook, and will work in the Theoretical Computer Science group headed by Professor Peter O'Hearn. The work of the group is underpinned by funding of over ?8m, and this post will be part of an EPSRC Programme Grant for ?3.2m on verification with partners at Imperial College London and Oxford. The group maintains strong links with Microsoft Research Cambridge as well in joint work on program verification and analysis. The post is full time for 24 months, starting from 1 Oct 2011 or as soon as possible thereafter. Starting salary will be in the range ?32,023 - ?33,794 per annum inclusive of London Allowance. Informal enquiries should be addressed to Professor Byron Cook < byroncook at gmail.com>. Further details including how to apply may be found on http://webapps.qmul.ac.uk/hr/vacancies/jobs.php?id=2442 The closing date for applications is 12 noon on 1 August 2011. Applications received after this time might not be considered. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Pieter.Philippaerts at cs.kuleuven.be Fri Jul 15 09:07:36 2011 From: Pieter.Philippaerts at cs.kuleuven.be (Pieter Philippaerts) Date: Fri, 15 Jul 2011 15:07:36 +0200 Subject: [TYPES/announce] CFP: International Symposium on Engineering Secure Software and Systems (ESSoS) Message-ID: <008c01cc42f0$2c20c0b0$84624210$@Philippaerts@cs.kuleuven.be> Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos2012/ February 16 - 17, 2012, Eindhoven, The Netherlands In cooperation with ACM SIGSAC and SIGSOFT and (pending) IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Unfortunately, the Internet is too. 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 fourth 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 - support for assurance, certification and accreditation SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag 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. Two types of papers will be accepted: Full papers (max 12 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). Proposals for both tutorials and workshops are welcome. Further guidelines will appear on the website of the symposium. IMPORTANT DATES Abstract submission: September 18, 2011 Paper submission: September 25, 2011 Author notification: November 19, 2011 Camera-ready: December 11, 2011 PROGRAM COMMITTEE Program Committee Co-Chairs Gilles Barthe, IMDEA Software Institute Ben Livshits, Microsoft Research Program Committee Davide Balzarotti, EURECOM David Basin, ETH Zurich Hao Chen, UC Davis Manuel Costa, Microsoft Research Julian Dolby, IBM Research Maritta Heisel, U. Duisburg Essen Thorsten Holz, U. Ruhr Bochum Collin Jackson, CMU Martin Johns, SAP Research Jan J?rjens, TU Dortmund Engin Kirda, NorthEastern U. Javier Lopez, U. Malaga Sergio Maffeis, Imperial College Heiko Mantel, TU Darmstadt Fabio Martinelli, CNR Haris Mouratidis, University of East London Anders M?ller, Aarhus University Frank Piessens, KU Leuven Erik Poll, RU Nijmegen Pierangela Samarati, U. Milano Ketil St?len, SINTEF and U. Oslo Laurie Williams, North Carolina State University Jianying Zhou, Institute for Infocomm Research Singapore Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From ccshan at cs.rutgers.edu Fri Jul 15 12:40:15 2011 From: ccshan at cs.rutgers.edu (Chung-chieh Shan) Date: Fri, 15 Jul 2011 12:40:15 -0400 Subject: [TYPES/announce] Domain-Specific Languages: Call for Participation Message-ID: <20110715164015.GA10854@mantle.bostoncoop.net> DSL 2011: IFIP Working Conference on Domain-Specific Languages 6-8 September 2011, Bordeaux, France **** Call for Participation: Online registration deadline July 30, 2011 **** Details of the program and accommodation are available at http://dsl2011.bordeaux.inria.fr. == Invited Speakers == - Jeremy Gibbons - University of Oxford, UK. - Claude Kirchner - INRIA, France. == Distilled Tutorials on Domain-Specific Languages == The purpose of these tutorials are not to give a general overview, but to make the attendees aware of one point and to make them master it. - Jerzy Karczmarczuk. Specific "scientific" data structures, and their processing. - Oleg Kiselyov. Implementing explicit and finding implicit sharing in embedded DSL. - Keiko Nakata. A total interpreter for While with interactive I/O. - Josef Svenningsson. Combining deep and shallow embeddings for EDSLs. - Walid Taha. Accurate programming: thinking about programs in terms of properties. - William Cook. Build your own partial evaluator in 90 minutes. == DSL Technical Papers == - Basile Starynkevitch. MELT a Translated Domain Specific Language Embedded in the GCC Compiler. - Azer Bestavros and Assaf Kfoury. A Domain-Specific Language for the Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks. - Tiark Rompf, Kevin J. Brown, Hassan Chafi, Hyoukjoong Lee, Arvind K. Sujeeth, Martin Odersky and Kunle Olukotun. Building-Blocks for Performance Oriented DSLs. - Dominic Orchard and Alan Mycroft. Efficient and Correct Stencil Computation via Pattern Matching and Static Typing. - Tim Bauer, Martin Erwig, Alan Fern and Jervis Pinto. Adaptation-Based Programming in Haskell. - Eric Walkingshaw and Martin Erwig. A DSEL for Studying and Explaining Causation. - Lucas Beyak and Jacques Carette. SAGA: A DSL for story management. -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 190 bytes Desc: Digital signature URL: From carlos.martin at urv.cat Sun Jul 17 05:14:43 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Sun, 17 Jul 2011 11:14:43 +0200 Subject: [TYPES/announce] LATA 2012: 1st call for papers Message-ID: ********************************************************************* 1st Call for Papers 6th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2012 A Coru?a, Spain March 5-9, 2012 http://grammars.grlmc.com/LATA2012/ ********************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). VENUE: LATA 2012 will take place in A Coru?a, at the northwest of Spain. The venue will be the Faculty of Computer Science, University of A Coru?a. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - automatic structures - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - foundations of XML - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - symbolic neural networks - term rewriting - transducers - trees, tree languages and tree automata - weighted automata STRUCTURE: LATA 2012 will consist of: - 3 invited talks - 2 invited tutorials - peer-reviewed contributions INVITED SPEAKERS: To be announced PROGRAMME COMMITTEE: Eric Allender (Rutgers) Miguel ?. Alonso (A Coru?a) Amihood Amir (Bar-Ilan) Dana Angluin (Yale) Franz Baader (Dresden) Patricia Bouyer (Cachan) John Case (Delaware) Volker Diekert (Stuttgart) Paul Gastin (Cachan) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Janusz Kacprzyk (Warsaw) Victor Khomenko (Newcastle) Bakhadyr Khoussainov (Auckland) Claude Kirchner (Paris) Maciej Koutny (Newcastle) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n-Vide (Tarragona, chair) Giancarlo Mauri (Milano Bicocca) Aart Middeldorp (Innsbruck) Faron Moller (Swansea) Angelo Montanari (Udine) Joachim Niehren (Lille) Mitsunori Ogihara (Miami) Enno Ohlebusch (Ulm) Dominique Perrin (Marne-la-Vall?e) Alberto Policriti (Udine) Alexander Rabinovich (Tel Aviv) Mathieu Raffinot (Paris) J?rg Rothe (D?sseldorf) Olivier H. Roux (Nantes) Yasubumi Sakakibara (Keio) Eljas Soisalon-Soininen (Aalto) Frank Stephan (Singapore) Jens Stoye (Bielefeld) Howard Straubing (Boston) Masayuki Takeda (Kyushu) Wolfgang Thomas (Aachen) Sophie Tison (Lille) Jacobo Tor?n (Ulm) Tayssir Touili (Paris) Esko Ukkonen (Helsinki) Frits Vaandrager (Nijmegen) Manuel Vilares (Vigo) Todd Wareham (Newfoundland) Pierre Wolper (Li?ge) Hans Zantema (Eindhoven) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Miguel ?. Alonso (A Coru?a, co-chair) Adrian Horia Dediu (Tarragona) Carlos G?mez Rodr?guez (A Coru?a) Jorge Gra?a (A Coru?a) Carlos Mart?n-Vide (Tarragona, co-chair) Bianca Truthe (Magdeburg) Jes?s Vilares (A Coru?a) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2012 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since July 16, 2011 until March 5, 2012. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2012/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On-site registration fees: 580 Euro On-site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by December 5, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before December 5, 2011 (resp. February 24, 2012) to the conference series account at Uno-e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin-Vide ? LATA 2012; address: Av. Catalunya, 35, 43002 Tarragona, Spain). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. People claiming early registration will be requested to prove that they gave the transfer order to the bank by the deadline. On-site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: October 7, 2011 (23:59h, CET) Notification of paper acceptance or rejection: November 18, 2011 Final version of the paper for the LNCS proceedings: November 27, 2011 Early registration: December 5, 2011 Late registration: February 24, 2012 Starting of the conference: March 5, 2012 Submission to the post-conference special issue: June 9, 2012 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2012 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From meriem at lcc.uma.es Sun Jul 17 10:59:10 2011 From: meriem at lcc.uma.es (Meriem Ouederni) Date: Sun, 17 Jul 2011 16:59:10 +0200 Subject: [TYPES/announce] =?utf-8?q?Call_For_Participation_***_=5BFLACOS_2?= =?utf-8?q?011=5D=3A_Workshop_on_Formal_Languages_and_Analysis_of_C?= =?utf-8?q?ontract-Oriented_Software_=28M=C3=A1laga=2C_Spain=29?= Message-ID: Please accept our apologies if you receive multiple copies of this Call for Participation. =========================================================================== CALL FOR PATICIPATION Fifth Workshop on Formal Languages and Analysis of Contract-Oriented Software (FLACOS'11) Malaga, Spain, 22-23 September, 2011 http://flacos2011.lcc.uma.es ABOUT FLACOS: The aim of this workshop is to bring together researchers and practitioners working on language-based solutions to the above issues through formalization of contracts, design of appropriate abstraction mechanisms, and formal analysis of contract languages and software. Such languages include, but are not limited to SLA, BPEL, behavioral interfaces, deontic logic for services, social contracts (multi-agent systems), formalised legal contracts and other prescriptive formalisms. The scientific program will include invited talks, papers, and panels. IMPORTANT DATES: Registration: is due on July 25th, 2011 Workshop: will be held between September 22th to 23th, 2011 We would like to warmly welcome you at M?laga for this FLACOS 2011 experience. CONTACT INFORMATION: For more information about the venue, program, registration, and travel please visit the workshop homepage at http://flacos2011.lcc.uma.es or contact us at info.flacos2011 at lcc.uma.es From fraguas at sip.ucm.es Mon Jul 18 01:19:00 2011 From: fraguas at sip.ucm.es (FRANCISCO JAVIER LOPEZ FRAGUAS) Date: Mon, 18 Jul 2011 07:19:00 +0200 Subject: [TYPES/announce] Summer School on Rigorous Methods (Madrid, September 19-21) Message-ID: =========================================== ?????????? FIRST PROMETIDOS-CM SUMMER SCHOOL ? http://gpd.sip.ucm.es/trac/gpd/wiki/FirstPrometidosSummerSchool ?????????? ================================= ????? (Free assistance? -- no registration fees!) ???????????????? 19-21 September 2011 ? Facultad de Inform?tica, Universidad Complutense de Madrid ??????????????????? Madrid, Spain PROMETIDOS-CM ("Madrid Program in Rigorous Methods for the Development of Software") is a R+D program funded by the regional government of Madrid, Spain, that involves some leading research groups in Computer Science in the region (IMDEA-Software, CLIP-UPM, BABEL-UPM, FADOSS-UCM, GPD-UCM). The scientific interests of PROMETIDOS-CM cover all aspects of development of software based on modular, scalable and realistic rigorous methods. One of the strategic purposes of PROMETIDOS-CM is the realization of effective training actions to introduce young post-graduate and PhD students in the research area of rigorous methods. The announced Summer School attempts to be a contribution in this sense. STRUCTURE OF THE SCHOOL ======================= The First PROMETIDOS-CM Summer School will consist of a series of talks given by experienced researchers affiliated to the program partners.? The talks are intended to be both attractive and rigorous. Some of them will be include practical demonstrations. LIST OF SPEAKERS/TALKS ====================== * David de Frutos (UCM) Semantics of Concurrent Processes: Unification and new Directions. * Ricardo Pe?a (UCM) Static Analysis and Certification of Safety Properties of Memory Usage * Rafael Caballero (UCM) Declarative Debugging * Fernando S?enz (UCM) Deductive Databases * Elvira Albert? (UCM) Test Case Generation and Cost Analysis in Java-like Languages * Julio Mari?o (UPM) Modeling and verification of concurrent systems using shared resources * Lars-?ke Fredlund (UPM) Erlang and the McErlang model checker * Boris K?pf (IMDEA-Software) Quantitative Information-Flow Analysis * C?sar Kunz (IMDEA-Software) Relational Verification Using Product Programs * Alexander Malkis (IMDEA-Software) Modular verification of threads * Jose Francisco Morales (UPM) Optimizing Compilation Techniques for Logic Programming * Manuel Carro Li?ares (UPM) Tabled Logic Programming and Applications REGISTRATION ============ This? Summer School is organized in a quite lightweight way. There are neither attendance fees nor a formal on-line registration. You only need to send a message to the organizers: Francisco Lopez-Fraguas (fraguas at sip.ucm.es) Narciso Mart? (narciso at sip.ucm.es). Certificates of assistance will be given at the end of the School. LUNCH AND ACCOMMODATION ======================= They are not provided by the organization. Having lunch at the Faculty cafeteria is easy and inexpensive (5 euro for a three courses meal). Regarding accomodation, the organization can help as follows: * We have reserved some (very few) places in double rooms to share in a student residence hall in the Campus (~ 25 euro approx. per night and person) ; Please contact the organizers if you are interested in these. * Some hotels not far from the Campus have agreed with the University some reduced prices (around 90 euro/night for a single? room) with respect their normal rates. Please contact the organizers to get more information. But some people prefer to spend some googling time to get some other (maybe cheaper) accommodation options in the city center. Please visit ? http://gpd.sip.ucm.es/trac/gpd/wiki/FirstPrometidosSummerSchool from time to time to see if some new information (location maps, programme,...) is given there. ******************************** Francisco J. Lopez Fraguas Dep. Sistemas Informaticos y Computacion Fac. Informatica U. Complutense Madrid Prof. Jose Garcia Santesmases s/n 28040 Madrid Spain fraguas at sip.ucm.es Tel: +34 91 3947630 Fax: +34 91 3947529 ******************************** ******************************** Francisco J. Lopez Fraguas Dep. Sistemas Informaticos y Computacion Fac. Informatica U. Complutense Madrid Prof. Jose Garcia Santesmases s/n 28040 Madrid Spain fraguas at sip.ucm.es Tel: +34 91 3947630 Fax: +34 91 3947529 ******************************** -------------- next part -------------- An HTML attachment was scrubbed... URL: From fernandez at iiia.csic.es Mon Jul 18 09:18:22 2011 From: fernandez at iiia.csic.es (Jose Luis Fernandez Marquez) Date: Mon, 18 Jul 2011 15:18:22 +0200 Subject: [TYPES/announce] 2nd CFP - Coordination Models, Languages and Applications - CM track at ACM SAC 2012 Message-ID: <4E24329E.5020803@iiia.csic.es> CfP: ACM SAC Special Track on Coordination Models, Languages and Applications ----------------------------------------------------------------------- 2nd CALL FOR PAPERS ----------------------------------------------------------------------- Coordination Models, Languages and Applications Special Track of the 27th Symposium On Applied Computing (SAC 2012) March 25 - 29, 2012, Riva del Garda (Trento), Italy http://sac2012.apice.unibo.it ----------------------------------------------------------------------- IMPORTANT DATES Aug. 31, 2011: Paper submissions Oct. 12, 2011: Author notification Nov. 2, 2011: Camera-Ready Copy ----------------------------------------------------------------------- AIMS & SCOPE Building on the success of the thirteen previous editions (1998-2011), a special track on coordination models, languages and applications will be held at SAC 2012. Over the last decade, we have witnessed the emergence of models, formalisms and mechanisms to describe concurrent and distributed computations and systems based on the concept of coordination. The purpose of a coordination model is to enable the integration of a number of, possibly heterogeneous, components (processes, objects, agents) in such a way that the resulting ensemble can execute as a whole, forming a software system with desired characteristics and functionalities which possibly takes advantage of parallel and distributed systems. The coordination paradigm is closely related to other contemporary software engineering approaches such as multi-agent systems, service-oriented architectures, component-based systems and related middleware platforms. Furthermore, the concept of coordination exists in many other Computer Science areas such as workflow systems, cooperative information systems, distributed artificial intelligence, and Internet technologies. After more than a decade of research, the coordination paradigm is gaining increased momentum in state-of-the-art engineering paradigms such as multi-agent systems and service-oriented architectures: in the first case, coordination abstractions are perceived as essential to design and support the working activities of agent societies; in the latter case, service coordination, orchestration, and choreography are going to be essential aspects of the next generations of systems based on Web services. The Special Track on Coordination Models, Languages and Applications takes a deliberately broad view of what constitutes coordination. Accordingly, major topics of interest this year will include: - Novel models, languages, programming and implementation techniques - Applications - Internet, Web, and pervasive computing coordinated systems - Coordination of multi-agent systems, including mobile agents, intelligent agents, and agent-based simulations - Languages for service description and composition - Models, frameworks and tools for Group Decision Making - All aspects related to Cooperative Information Systems (e.g. workflow management, CSCW) - Software architectures and software engineering techniques - Configuration and Architecture Description Languages - Middleware platforms - Self-organising and nature-inspired coordination approaches - Coordination technologies, systems and infrastructures - Relationship with other computational models such as object oriented, declarative (functional, logic, constraint) programming or their extensions with coordination capabilities - Formal aspects (semantics, type systems, reasoning, verification) - Coordination models and specification in Service-Oriented Architectures, Web Service technologies (orchestration, choreography, etc), and Pervasive Computing. ----------------------------------------------------------------------- PROCEEDINGS Papers accepted for the Special Track on Coordination Models, Languages and Applications will be published by ACM both in the SAC 2012 proceedings and in the Digital Library. A Special Issue on an International Journal (with IF) based on selected papers is planned just after the conference. ----------------------------------------------------------------------- PAPER SUBMISSION All papers should represent original and previously unpublished works that currently are not under review in any conference or journal. The author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. This is to facilitate blind review. Only the title should be shown at the first page without the author's information. Submitted papers must be no longer than 6 pages and in the ACM two-column page format (doc template, pdf template, latex template). It will be possible to have up to 2 extra pages in the proceeding at a charge of $80 per page (total 8 pages maximum). Submission is entirely automated via the STAR Submission System, which is available from the main SAC Web Site: http://www.acm.org/conferences/sac/sac2012/. ----------------------------------------------------------------------- TRACK CO-CHAIR Mirko Viroli, Alma Mater Studiorum - Universita di Bologna, Italy Gabriella Castelli, University of Modena and Reggio Emilia, Italy Jose Luis Fernandez-Marquez, IIIA-CSIC, Spain ----------------------------------------------------------------------- PROGRAM COMMITTEE Farhad Arbab, CWI Amsterdam and Leiden University, Netherlands Marcello Bonsangue, Leiden University, Netherlands Dave Clarke, Katholieke Universiteit Leuven, Belgium Ferruccio Damiani, University of Torino, Italy Rocco De Nicola, University of Firenze, Italy Simon Dobson, University of St Andrews, Scotland Keith Harrison-Broninski, Role Modellers Ltd, UK Manuel Mazzara, Newcastle University, UK Henry Muccini, University of l'Aquila, Italy Andrea Omicini, University of Bologna, Italy Manuel Oriol, University of York, UK Antonio Porto, University of Porto, Portugal Rosario Pugliese, University of Florence, Italy Alessandro Ricci, University of Bologna, Italy Davide Rossi, University of Bologna, Italy Norman Salazar, Artificial Intelligence Research Institute, Spain Michael Ignaz Schumacher, University of Applied Sciences, Switzerland Yasuyuki Tahara, National Institute of Informatics, Japan Carolyn Talcott, SRI International, USA Paul Tarau, University of North Texas, USA Robert Tolksdorf, Freie Universitaet Berlin, Germany Emilio Tuosto, University of Leicester, UK Meritxell Vinyals, Artificial Intelligence Research Institute, Spain George Wells, Rhodes University, South Africa Herbert Wiklicky, Imperial College London, UK Pawel T. Wojciechowski, Poznan University of Technology, Poland Franco Zambonelli, University of Modena and Reggio Emilia, Italy From cc2 at ecs.soton.ac.uk Tue Jul 19 07:31:49 2011 From: cc2 at ecs.soton.ac.uk (Corina Cirstea) Date: Tue, 19 Jul 2011 12:31:49 +0100 Subject: [TYPES/announce] *** CALCO 2011: Early registration extended until July 27 *** References: <20110719113149.GA9563@login.ecs.soton.ac.uk> Message-ID: [Please forward to PhD students and young researchers.] ========================================================================= CALL FOR PARTICIPATION: CALCO 2011 4th International Conference on Algebra and Coalgebra in Computer Science August 29 - September 2, 2011 Winchester, UK http://calco2011.ecs.soton.ac.uk/ ========================================================================= *** Early registration extended until Wednesday 27 July, 2011 *** ========================================================================= CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. This is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007) and Udine (Italy, 2009). The fourth edition will be held in the city of Winchester (UK), a historic cathedral city and the ancient capital of Wessex and the Kingdom of England. CALCO 2011 will be preceded by the CALCO Young Researchers Workshop, CALCO-Jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years. The programme of CALCO also comprises presentations of tools based on algebraic and/or coalgebraic principles, that have been selected in the context of a dedicated workshop, CALCO-Tools. -- INVITED SPEAKERS -- * Javier Esparza (Germany): Solving Fixed-Point Equations by Derivation Tree Analysis * Philippa Gardner (UK): Abstract Local Reasoning about Program Modules * Gopal Gupta (USA): Infinite Computation, Coinduction and Computational Logic -- CALCO ACCEPTED PAPERS -- * Clement Fumex, Neil Ghani and Patricia Johann. Indexed Induction and Coinduction, Fibrationally * Jort Bergfeld and Yde Venema. Model constructions for Moss' coalgebraic logic * Jiri Adamek, Mahdie Haddadi and Stefan Milius. From Corecursive Algebras to Corecursive Monads * Sergey Goncharov and Lutz Schroeder. A Counterexample to Tensorability of Effects * Camilo Rocha and Jose Meseguer. Proving Safety Properties of Rewrite Theories * Ekaterina Komendantskaya and John Power. Coalgebraic semantics for derivations in logic programming * Adriana Balan and Alexander Kurz. Finitary Functors: from Set to Preord and Poset * Joost Winter, Marcello Bonsangue and Jan Rutten. Context-Free Languages, Coalgebraically * Marta Bilkova, Alexander Kurz, Daniela Petrisan and Jiri Velebil. Relation Liftings on Preorders * Murdoch Gabbay, Tadeusz Litak and Daniela Petrisan. Stone duality for nominal Boolean algebras with `new': topologising Banonas * Bart Jacobs. Bases as Coalgebras * Thorsten Altenkirch, Peter Morris, Fredrik Nordvall Forsberg and Anton Setzer. A categorical semantics for inductive-inductive definitions * Jun Kohjina, Toshimitsu Ushio and Yoshiki Kinoshita. Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata * Ichiro Hasuo. The Microcosm Principle and Compositionality of GSOS-Based Component Calculi * Mihai Codescu and Till Mossakowski. Refinement trees: calculi, tools and applications * Baltasar Trancon Y Widemann and Hauhs Michael. Distributive-Law Semantics for Cellular Automata and Agent-Based Models * Corina Cirstea. Model Checking Linear Coalgebraic Temporal Logics: an Automata-Theoretic Approach * Katsuhiko Sano. Generalized Product of Coalgebraic Hybrid Logics * Rasmus Ejlers Mogelberg and Sam Staton. Linearly-used state in models of call-by-value * Fredrik Dahlqvist and Dirk Pattinson. On the fusion of coalgebraic modal logics * Manuel A. Martins, Alexandre Madeira, Razvan Diaconescu and Luis Barbosa. Hybridization of Institutions -- CALCO-Tools ACCEPTED PAPERS -- * Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac and Anna Ingolfsdottir. PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates * Pawel Sobocinski and Jennifer Lantair. WiCcA: LTS generation tool for wire calculus * Francisco Duran, Camilo Rocha and Jose Maria Alvarez. Tool Interoperability in the Maude Formal Environment * Andre Martins, Luis Barbosa and Nuno Rodrigues. SHACC: A functional animator for a component calculus * Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg and Monika Seisenberger. Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras * Musab Alturki and Jose Meseguer. PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool -- LOCATION -- Winchester is a beautiful historic city in southern England, known for its 11th-century cathedral and 12th-century castle. It is located just under an hour by rail from London Waterloo, and 15 minutes by road or rail from Southampton Airport. London Heathrow is 50 miles away and London Gatwick 72 miles away. -- FURTHER INFORMATION -- Queries should be emailed to calco2011 at ecs.soton.ac.uk . From bcpierce at cis.upenn.edu Tue Jul 19 10:18:31 2011 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Tue, 19 Jul 2011 10:18:31 -0400 Subject: [TYPES/announce] TLDI 2012 - Call for Papers and Contributed Talks Message-ID: TLDI 2012 CALL FOR PAPERS AND CONTRIBUTED TALKS The Seventh ACM SIGPLAN Workshop on Types in Language Design and Implementation Saturday, January 28, 2012 Philadelphia, PA, USA To be held in conjunction with POPL 2012 Submission deadline: October 10th, 2011 Submission site: http://tldi12.cis.upenn.edu IMPORTANT: This year TLDI is introducing a significant change to the workshop organization. There will be two distinct submission categories: full papers (with a published proceedings, as always) and 2-page proposals for talks on more speculative or unfinished work. The aim is to foster a more informal atmosphere in which new ideas can be discussed while maintaining the TLDI tradition of presentations of polished technical work. __________________________________________________________________ Scope The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2012 is the seventh workshop in the series and will be co-located with POPL in Philadelphia, Pennsylvania in January 2012. Submissions for TLDI 2012 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2012 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented or dynamic languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: * Typed intermediate languages and type-directed compilation * Type-based language support for safety and security * Types for interoperability * Type systems for system programming languages * Type-based program analysis, transformation, and optimization * Dependent types and type-based proof assistants * Types for security protocols, concurrency, and distributed computing * Type inference and type reconstruction * Type-based specifications of data structures and program invariants * Type-based memory management * Proof-carrying code and certifying compilation * Types and objects This is not meant to be an exhaustive list; papers on novel aspects or uses of types are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. __________________________________________________________________ Submission Guidelines Full papers should be no more than 12 pages (including bibliography and appendices). They will be judged on the usual criteria of novelty, usefulness, correctness, and clarity of exposition. Informal talk proposals should be no more than 2 pages (including bibliography). These can be either technical or more general in nature; they will be judged on their promise of leading to an exciting or provocative talk. The deadline for both submission categories is Monday, October 10, 2011. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page (http://www.sigplan.org/authorInformation.htm), along with a LaTeX class file and template. Papers must be submitted electronically via the workshop website (http://tldi12.cis.upenn.edu/) in Adobe Portable Document Format (PDF) and must be formatted for printing on US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy (http://www.sigplan.org/republicationpolicy.htm). Submissions should contain original research not published or submitted for publication elsewhere. __________________________________________________________________ Publication As in previous years, accepted full papers will be published by the ACM and appear in the ACM digital library. __________________________________________________________________ Important Dates Submission deadline October 10, 2011 (Monday) Notification November 10, 2011 (Thursday) Workshop January 28, 2012 (Saturday) __________________________________________________________________ Program Chair: Benjamin C. Pierce University of Pennsylvania bcpierce atsign cis dot upenn dot edu Program Committee: Jonathan Aldrich CMU Adam Chlipala MIT Pierre-Malo Deni?lou Imperial College London Kathleen Fisher Tufts University Chris Hawblitzel Microsoft Research (Redmond) Dan Licata CMU Greg Morrisett Harvard University Benjamin C. Pierce University of Pennsylvania Dimitrios Vytiniotis Microsoft Research (Cambridge) Steering Committee: Amal Ahmed Indiana University Nick Benton Microsoft Research, Cambridge Derek Dreyer MPI-SWS Andrew Kennedy Microsoft Research, Cambridge Francois Pottier INRIA Paris-Rocquencourt Stephanie Weirich University of Pennsylvania From cbraga at ic.uff.br Tue Jul 19 21:22:54 2011 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 19 Jul 2011 22:22:54 -0300 Subject: [TYPES/announce] SBLP 2011 - 1st. Call for participation Message-ID: <78EAA821-EF98-4828-8275-49C2DEABDA3D@ic.uff.br> [Apologies for multiple copies of this call.] SBLP 2011: Call For Participation 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 29-30, 2011 http://www.each.usp.br/cbsoft2011/ *** Registration *** http://www.each.usp.br/cbsoft2011/ingles/inscricoes_en.html The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" ACCEPTED PAPERS FOR PRESENTATION AND PUBLICATION "From Regular Expressions to PEGs" S?rgio Medeiros (Universidade Federal de Sergipe); Fabio Mascarenhas (Universidade Federal do Rio de Janeiro); Roberto Ierusalimschy (PUC-Rio) "The Design and Implementation of a Non-Iterative Range Analysis Algorithm on a Production Compiler" Douglas Teixeira, Fernando Pereira (Universidade Federal de Minas Gerais) "Controlling the scope of instances in Haskell" Marco Silva, Carlos Camar?o (Universidade Federal de Minas Gerais) "Functional Fixpoint Evaluators for Partially Circular Attribute Grammars" Juan F. Cardona-Mccormick (Universidad EAFIT, Colombia), Doaitse S. Swierstra (Universiteit Utrecht, The Netherlands); Francisco J. Correa-Zabala (Universidad EAFIT, Colombia) "Parsing Expression Grammars for Structured Data" Fabio Mascarenhas (Universidade Federal do Rio de Janeiro); S?rgio Medeiros (Universidade Federal de Sergipe); Roberto Ierusalimschy (PUC-Rio) "First Class Overloading via Intersection Type Parameters" Elton Cardoso, Carlos Camar?o (Universidade Federal de Minas Gerais); Lucilia Figueiredo (Universidade Federal de Ouro Preto) "Making aspect-oriented refactoring safer" Gustavo Soares, Diego Cavalcanti, Rohit Gheyi (Universidade Federal de Campina Grande) "The Denotational, Operational, and Static, Semantics of a Domain-Specific Language for the Design of Flow Networks" Assaf Kfoury (Boston University, USA) "On the Use of Feature-Oriented Programming for Evolving Software Product Lines ? A Comparative Study" Gabriel Ferreira, Felipe Gaia (Universidade Federal de Uberl?ndia); Eduardo Figueiredo (Universidade Federal de Minas Gerais); Marcelo Maia (Universidade Federal de Uberl?ndia) "Staged Concurrency in Lua - Introducing Leda" Tiago L. Salmito, Noemi Rodriguez, Ana L?cia Moura (PUC-Rio) "Modular Contracts with Procedures, Annotations, Pointcuts and Advice" Henrique Reb?lo, Ricardo Massa Ferreira Lima (Universidade Federal do Pernambuco); Gary T. Leavens (University of Central Florida, USA) "An Experimental Evaluation of Compiler Optimizations on Code Size" Juliano Foleiss, Anderson Faustino Da Silva, Linnyer Beatryz Ruiz (Universidade Estadual de Maring?) ACCEPTED PAPER FOR PRESENTATION "How do programmers use Concurrency? An Investigation of a Large-Scale Java Open Source Code Repository" Benito Fernades, Weslley Torres, Jo?o Paulo Dos Santos Oliveira, Filipe Ximenes, Fernando Castor (Universidade Federal de Pernambuco) From sakai at is.nagoya-u.ac.jp Wed Jul 20 06:25:23 2011 From: sakai at is.nagoya-u.ac.jp (Masahiko Sakai) Date: Wed, 20 Jul 2011 19:25:23 +0900 (JST) Subject: [TYPES/announce] RTA 2012: Call for Workshop Proposals Message-ID: <20110720.192523.65536059.sakai@is.nagoya-u.ac.jp> RTA 2012 23rd International Conference on Rewriting Techniques and Applications Monday, May 28 - Saturday, Jun 2, 2012, Nagoya, Japan http://rta2012.trs.cm.is.nagoya-u.ac.jp/ ----------------------------------------------------------------------- Call for Workshop Proposals ----------------------------------------------------------------------- RTA is the major forum for the presentation of research on all aspects of rewriting. Previous RTA meetings were held in Dijon (1985), Bordeaux (1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), Seattle (2006), Paris (2007), Hagenberg/Linz (2008), Brasilia (2009), Edinburgh (2010) and Novi Sad (2011). We solicit proposals for satellite workshops of RTA 2012 that are related in topics to RTA. Workshops should have a length of 1 or 2 days. It is tradition at RTA that attendance to workshops is open to participants of parallel events, similar to the way FLoC workshops are run. There will be three days (Monday, Tuesday and Saturday) reserved for workshops. Please submit your workshop proposal by email to rta2012-workshop at trs.cm.is.nagoya-u.ac.jp Proposals should be written in plain text. The proposal should cover the following topics: 1. Name of workshop 2. A statement of the topics and goals of the workshop 3. Names and addresses of the organizers 4. Pointers to descriptions of previous editions of the workshop, if any 5. A description of the submission selection process 6. Plans for the publication of proceedings (informal proceedings distributed to participants, electronic journal, proceedings with separate selection process, ...) 7. Plans for invited speakers or special sessions (round-table discussion, tutorials, ...) 8. Expected length of the workshop 9. Expected number of attendees 10. Any special needs (for system demonstrations ...) Workshop Selection Committee: Ashish Tiwari (RTA 2012 program chair) Masahiko Sakai (RTA 2012 general chair). Important Dates -------------------------------------------------- |September 19, 2011 | deadline for proposals | -------------------------------------------------- |September 30, 2011 | notification of acceptance | -------------------------------------------------- Prospective workshop organizers are welcome to contact the workshop selection committee in advance before sending in a formal submission and to discuss any questions. RTA http://rewriting.loria.fr/rta/ --- From rybal at in.tum.de Wed Jul 20 09:07:34 2011 From: rybal at in.tum.de (Andrey Rybalchenko) Date: Wed, 20 Jul 2011 15:07:34 +0200 Subject: [TYPES/announce] VMCAI 2012 CALL FOR PAPERS Message-ID: VMCAI 2012 CALL FOR PAPERS 13th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) http://lara.epfl.ch/vmcai2012/ January 22-24, 2012, Philadelphia, USA Collocated with POPL 2012 ( http://www.cse.psu.edu/popl/12/ ) 39th 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'12 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 12, 2011 Paper Submission: August 19, 2011 Acceptance Notification: October 10, 2011 Conference: January 22-24, 2012 (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 2012 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=vmcai2012 PROGRAM COMMITTEE Josh Berdine Nikolaj Bjorner Bor-Yuh Evan Chang Wei-Ngan Chin Radhia Cousot Sophia Drossopoulou Philippa Gardner Patricia Hill Marieke Huisman Radu Iosif Daniel Kr?ning Viktor Kuncak Barbara K?nig Francesco Logozzo Rupak Majumdar Greg Morrisett Corina Pasareanu Andreas Podelski Sriram Rajamani Andrey Rybalchenko Mooly Sagiv Sriram Sankaranarayanan Helmut Veith Heike Wehrheim Eran Yahav Lenore Zuck PC CHAIRS Viktor Kuncak, EPFL, Switzerland Andrey Rybalchenko, TUM, Germany VMCAI STEERING COMMITTEE Agostino Cortesi, Universita' Ca' Foscari, Venice, Italy Patrick Cousot, ?cole Normale Sup?rieure, France E. Allen Emerson, University of Texas at Austin, USA Giorgio Levi, University of Pisa, Italy 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://lara.epfl.ch/vmcai2012/ or contact PC chairs. From pmt6sbc at maths.leeds.ac.uk Thu Jul 21 06:18:21 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Thu, 21 Jul 2011 11:18:21 +0100 (BST) Subject: [TYPES/announce] COMPUTABILITY - The Journal of the Association CiE Message-ID: _______________________________________________________________________ COMPUTABILITY The Journal of the Association CiE Now Accepting Submissions! First volume to be published in 2012 as part of the celebrations of the Alan Turing Year http://www.computability.de/journal/ _______________________________________________________________________ Aims and Scope Computability is the journal of the Association Computability in Europe and it is published by IOS Press in Amsterdam. The journal Computability is a peer reviewed international journal that is devoted to publishing original research of highest quality, which is centered around the topic of computability. The subject is understood from a multidisciplinary perspective, recapturing the spirit of Alan Turing (1912-1954) by linking theoretical and real-world concerns from computer science, mathematics, biology, physics, computational neuroscience, history and the philosophy of computing. Editor-in-Chief Vasco Brattka (Cape Town, South Africa) Managing Editors Paola Bonizzoni (Milan, Italy) S. Barry Cooper (Leeds, UK) Benedikt Loewe (Amsterdam, The Netherlands) Elvira Mayordomo (Zaragoza, Spain) Editorial Board Samson Abramsky (Oxford, UK) Manindra Agrawal (Kanpur, India) Eric Allender (Piscataway, USA) Jeremy Avigad (Pittsburgh, USA) Arnold Beckmann (Swansea, UK) Olivier Bournez (Palaiseau, France) Alessandra Carbone (Paris, France) Karine Chemla (Paris, France) Bruno Codenotti (Pisa, Italy) Stephen A. Cook (Toronto, Canada) Anuj Dawar (Cambridge, UK) Rodney G. Downey (Wellington, New Zealand) Natasha Jonoska (Tampa, USA) Ulrich Kohlenbach (Darmstadt, Germany) Russell Miller (New York, USA) Andrei Morozov (Novosibirsk, Russia) Prakash Panangaden (Montreal, Canada) Frank Stephan (Singapore) Vlatko Vedral (Oxford, UK) Rineke Verbrugge (Groningen, The Netherlands) Ning Zhong (Cincinnati, USA) Submission Guidelines The journal Computability invites submission of full papers of highest quality on all research topics related to computability. Computability accepts only submissions of original research papers that have not been published previously and that are not currently submitted elsewhere. Full versions of papers that have already been published in conference proceedings are eligible only if the conference version is clearly cited and the full version enhances the conference version significantly. Authors are requested to submit PDF manuscripts electronically via the online submission system. Authors can indicate non-binding wishes regarding Editorial Board Members who should handle their submission. Final versions of accepted papers have to be prepared using the journal style file and they need to be submitted together with all source files. Authors submitting a manuscript do so on the understanding that they have read and agreed to the terms of the IOS Press Author Copyright Agreement and that all persons listed as authors have given their approval for the submission of the paper. http://www.computability.de/journal/ _______________________________________________________________________ From carlos.martin at urv.cat Thu Jul 21 09:05:00 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Thu, 21 Jul 2011 15:05:00 +0200 Subject: [TYPES/announce] FSFLA 2011: 2nd announcement Message-ID: ********************************************************************* 2011 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS FSFLA 2011 (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain October 31 ? November 4, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/fsfla2011/ ********************************************************************* ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the schedule of the courses. The previous event was SSFLA 2011 (http://grammars.grlmc.com/ssfla2011/). COURSES AND PROFESSORS: - Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours] - Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours] - Max H. Garzon (Memphis), DNA Codeword Design and DNA Languages [introductory/intermediate, 10 hours] - Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours] - Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours] - Michael Moortgat (Utrecht), Type-logical Grammars: Expressivity, Parsing Complexity [introductory/advanced, 8 hours] - Helmut Seidl (Technische M?nchen), Macro Treetransducers for XML Processing [intermediate, 6 hours] - Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] - Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/fsfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until July 31, 2011), - 15 euros (for payments after July 31, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; account holder's address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention FSFLA 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. For early reduced rates, please notice that the date that counts is the date of the arrival of the fees to the School?s account. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the completion of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: June 4, 2011 Starting of the registration: June 4, 2011 Early registration deadline: July 31, 2011 Starting of the School: October 31, 2011 End of the School: November 4, 2011 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/fsfla2011/ POSTAL ADDRESS: FSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputaci? de Tarragona Universitat Rovira i Virgili From ricardo at sip.ucm.es Fri Jul 22 10:31:55 2011 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Fri, 22 Jul 2011 16:31:55 +0200 Subject: [TYPES/announce] (2nd) Open Call for a Springer LNCS Volume on Resource Analysis Message-ID: <4E2989DB.8030807@sip.ucm.es> *************************************************************************** * * OPEN CALL FOR A SPRINGER LNCS VOLUME ON RESOURCE ANALYSIS * * To be evaluated in conjunction with the selected papers of the 2nd International * Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** Resource analysis is a live research area where people from several research communities converge. The snd Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) covering many of these aspects was held in Madrid on May 2011. See http://dalila.sip.ucm.es/fopara11/ for looking at the program and at the rest of details of this workshop. We want to open the call for selected papers of FOPARA 2011 and invite other researchers in the area to submit papers. The results must be unpublished and not submitted for publication elsewhere. We will publish a volume of the Springer series Lecture Notes in Computer science containing both kinds of selected papers. The Program Committee of the open call will be that of FOPARA 2011. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The submission page is http://www.easychair.org/conferences/?conf=fopara2011 and it can also be accessed through the official FOPARA 2011 website. It will remain open from now to September 5th. Important dates --------------- Submission deadline: September 5th, 2011 Notification to authors: October 24th, 2011 LNCS camera ready deadline: November 18th Expected volume publication: January 2012 Program Committee ----------------- . Puri Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/?cole normale sup?rieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tam?s Kozsik (E?tv?s Lor?nd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL) From guttman at WPI.EDU Sun Jul 24 22:31:31 2011 From: guttman at WPI.EDU (Joshua D. Guttman) Date: Sun, 24 Jul 2011 22:31:31 -0400 Subject: [TYPES/announce] Principles of Security and Trust (New ETAPS main conference) Message-ID: <86pqkz9jlo.fsf@guttman2.cs.wpi.edu> [ POST strongly encourages submissions relating programming languages and security, and area where type systems have played a venerable role. We'd warmly welcome submissions from the TYPES readership! ] POST -- Principles of Security and Trust -- is a new main conference at ETAPS. ETAPS, the European joint conferences on Theory and Practice of Software, has been a group of five very well-regarded conferences that have met together every March or April since 1998. POST will be the first addition to ETAPS since it started. Our invited speaker will be Cynthia Dwork of Microsoft Research. We would encourage you to send in submissions. We believe that POST will promptly become a very highly regarded venue for work on security and trust. We want to focus on the principles of the subject, emphasizing how practical problems motivate the foundations, and how foundations help to reshape practice. URL: http://web.cs.wpi.edu/~guttman/post12/ Location: Tallinn, Estonia Last week of March, 2012 Submissions Abstract: 7 Oct Papers: 14 Oct Rebuttal: 28 -- 30 Nov Notification: 16 Dec Your submissions will help create a high-value meeting place for our community. Thanks! Joshua ~~~~~~~~~~~~~~~~ POST 2012 First Conference on Principles of Security and Trust Tallinn, Estonia A Main Conference of ETAPS European joint conferences on Theory and Practice of Software http://www.etaps.org/2012 http://web.cs.wpi.edu/~guttman/post12/ Conference Description Principles of Security and Trust is a broad forum related to the theoretical and foundational aspects of security and trust. Papers of many kinds are welcome: new theoretical results, practical applications of existing foundational ideas, and innovative theoretical approaches stimulated by pressing practical problems. POST combines and replaces a number of successful and longstanding workshops in this area: Automated Reasoning and Security Protocol Analysis (ARSPA), Formal Aspects of Security and Trust (FAST), Security in Concurrency (SecCo), and the Workshop on Issues in the Theory of Security (WITS). A subset of these events met jointly as an event affiliated with ETAPS in 2011 under the name Theory of Security and Applications (TOSCA). POST is now 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 2012 is the 15th joint conference in this series. Call for Papers We seek submissions proposing theories to clarify security and trust within computer science; submissions establishing new results in existing theories; and also submissions raising fundamental concerns about existing theories. We welcome new techniques and tools to automate reasoning within such theories, or to solve security and trust problems. Case studies that reflect the strengths and limitations of foundational approaches are also welcome, as are more exploratory presentations on open questions. Areas of interest include: Access control Anonymity Authentication Availability Cloud security Confidentiality Covert channels Crypto foundations Economic issues Information flow Integrity Languages for security Malicious code Mobile code Models and policies Privacy Provenance Reputation and trust Resource usage Risk assessment Security architectures Security protocols Trust management Web service security Productive techniques have included automated reasoning, compositionality and transformation, language-based methods, logical formalization, quantitative methods, and static analysis. Rebuttal phase Authors will be given a 60 hour period to read and respond to the reviews of their papers before the PC meeting. This process will not, however, provide additional iterations. Submission Guidelines Papers must be written in English, unpublished and not submitted for publication elsewhere. The proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science series (currently pending). Submissions must be in PDF format, formatted in the LNCS style (as specified on this page) and at most 20 pages long. The 20 pages must include references and all material intended for publication. Additional material, that is not to be included in the final version, but may help assessing the merits of the submission - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices, and papers must be understandable without them. Papers are submitted via the Easychair conference management system (not yet open). A special issue of the Journal of Computer Security will be devoted to selected papers of POST 2012. Submissions will be solicited after the meeting. Important Dates 7 October 2011: Submission deadline for abstracts (strict) 14 October 2011: Submission deadline for full papers (strict) 28 November 2011: Rebuttal phase begins 30 November 2011: Rebuttal phase ends 16 December 2011: Notification of acceptance 6 January 2012: Camera-ready versions due The submission deadline for papers is strict (site will close at 23:59 GMT-11). Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn. Invited Speaker Cynthia Dwork, Microsoft Research Programme Committee Michael Backes, Saarland and MPI-SWS, DE Anindya Banerjee, IMDEA Software Institute, ES Gilles Barthe, IMDEA Software Institute, ES David Basin, ETH Zurich, CH Veronique Cortier, CNRS, Loria, FR Pierpaolo Degano, Universit? di Pisa, IT (co-chair) Andrew Gordon, Microsoft Research and University of Edinburgh, UK Joshua Guttman, WPI, USA (co-chair) Ralf K?sters, Universit?t Trier, DE Steve Kremer, INRIA, ENS Cachan, FR Peeter Laud, Cybernetica AS and University of Tartu, EE Gavin Lowe, Oxford University, UK Heiko Mantel, Technische Universit?t Darmstadt, DE Sjouke Mauw, Universit? du Luxembourg, LU Catherine Meadows, NRL, USA John C Mitchell, Stanford, USA Sebastian M?dersheim, DTU, DK Carroll Morgan, University of New South Wales, AU Mogens Nielsen, University of Aarhus, DK Catuscia Palamidessi, INRIA, ?cole Polytechnique, FR Andrei Sabelfeld, Chalmers, SE Nikhil Swamy, Microsoft Research, USA Luca Vigan?, Universit? di Verona, IT -- Joshua D. Guttman WPI, Computer Science From damiani at di.unito.it Mon Jul 25 07:56:49 2011 From: damiani at di.unito.it (Ferruccio Damiani) Date: Mon, 25 Jul 2011 13:56:49 +0200 Subject: [TYPES/announce] CFP: FoVeOOS 2011 (post-proceeding will be published on Spinger LNCS) In-Reply-To: <4DE948DC.5090409@di.unito.it> References: <4DE948DC.5090409@di.unito.it> Message-ID: <4E2D5A01.5000609@di.unito.it> ====================================================================== *Springer agreed to publish the post-proceedings of FoVeOOS 2011 on LNCS* Submission deadline of FoVeOOS 2011 is approaching: - August 3, 2011 Abstract submission deadline - August 10, 2011 Paper submission deadline CONTACT Email: foveoos2011 at cost-ic0701.org Web: http://foveoos2011.cost-ic0701.org ====================================================================== FoVeOOS 2011 2nd International Conference on Formal Verification of Object-Oriented Software October 5-7, 2011, Turin, Italy http://foveoos2011.cost-ic0701.org *CALL FOR PAPERS* SCOPE Formal software verification has outgrown the area of academic case studies, and industry is showing serious interest. The logical next goal is the verification of industrial software products. Most programming languages used in industrial practice (such as Java, C++, and C#) are object-oriented. The International Conference on Formal Verification of Object-Oriented Software (FoVeOOS) aims to foster collaboration and interactions among researchers in this area. ORGANIZATION The conference is organised by COST Action IC0701 (http://www.cost-ic0701.org/) but it goes beyond the framework of this action. This conference is open to the whole scientific community around the following topics, and also encourages people close to industrial applications to submit papers and participate. The Action may provide travel grants (see the web page for details). TOPICS Topics include but are not limited to: * Logic-based methods for formal - verification - specification and description - construction, - analysis and validation, of object-oriented software * Technologies such as - logics - calculi - type systems for the formal verification of object-oriented software * Modularisation and verification of components * Verification of - adaptable and reusable - concurrent - distributed object-oriented software * Tool descriptions * Experience reports * Case studies * Teaching formal verification IMPORTANT DATES August 3, 2011 Abstract submission deadline August 10, 2011 Paper submission deadline September 7, 2011 Acceptance notification September 21, 2011 Final version due October 5-7, 2011 Conference SUBMISSIONS Submissions should describe previously unpublished work (completed or in progress). Contributions are invited in these categories: A Research papers (reporting original theoretical and/or experimental research or applications) B System descriptions C Experience reports, case studies D Position papers and brief reports on work in progress All submissions will be reviewed by peers, typically members of the program committee. Papers must be written in English and not exceed 18 pages in LNCS format (http://www.springer.de/comp/lncs/authors.html). Submission of papers is via EasyChair at http://www.easychair.org/conferences/?conf=foveoos2011 PROCEEDINGS The conference will use a two-stage process for the publication of proceedings, allowing for a very brief period between submission of papers and the conference and, thus, a speedy dissemination of results. All accepted papers will appear in pre-proceedings published as a Technical Report that will be available at the conference. Post-conference proceedings are planned to be published within Springer's LNCS series. For this second stage, papers will be selected as follows: first, authors of papers that were definitely accepted in the first stage will submit a new version with minor revisions only; second, authors of papers that were only conditionally accepted (typically position papers) will be able to submit a new version with major revisions, which will be reviewed again. BEST STUDENT PRESENTATION AWARD Based on the comments given by the reviewers in the first stage of reviewing, and the presentation at the conference, the programme committee will give a best student presentation award. Eligible papers are those whose presentation is given by a PhD student. PROGRAM CO-CHAIRS Ferruccio Damiani, U of Torino, Italy Dilian Gurov, KTH Stockholm, Sweden PROGRAMME COMMITTEE Bernhard Beckert, Karlsruhe Institute of Technology, Germany Frank S. de Boer, CWI, The Netherlands Marcello Bonsangue, U Leiden (LIACS), The Netherlands Einar Broch Johnsen, U of Oslo, Norway Gabriel Ciobanu, U Alexandru Ioan Cuza, Romania Mads Dam, KTH Stockholm, Sweden Ferruccio Damiani, U of Torino, Italy Sophia Drossopoulou, Imperial College, UK Paola Giannini, U Piemonte Orientale, Italy Dilian Gurov, KTH Stockholm, Sweden Reiner Haehnle, Chalmers U of Technology, Gothenburg, Sweden Marieke Huisman, U of Twente, The Netherlands Bart Jacobs, Katholieke Universiteit Leuven, Belgium Ioannis Kassios, ETH Zurich, Switzerland Joe Kiniry, ITU Copenhagen, Denmark Dorel Lucanu, U Alexandru Ioan Cuza, Romania Maria del Mar Gallardo Melgarejo, U of Malaga, Spain Claude Marche, INRIA Saclay-Ile-de-France, France Julio Marino, U Politecnica de Madrid, Spain Marius Minea, Politehnica U of Timisoara, Romania Anders Moeller, U Aarhus, Denmark Rosemary Monahan, NUI Maynooth, Ireland James Noble, Victoria U of Wellington, New Zealand Bjarte M. Ostvold, Norwegian Computing Center, Norway Olaf Owe, U of Oslo, Norway Matthew Parkinson, Cambridge U, UK David Pichardie, IRISA, France Frank Piessens, Katholieke U Leuven, Belgium Arnd Poetzsch-Heffter, U of Kaiserslautern, Germany Erik Poll, U of Nijmegen, The Netherlands Antonio Ravara, New University of Lisbon, Portugal Rene Rydhof Hansen, U of Aalborg, Denmark Peter H. Schmitt, Karlsruhe Institute of Technology, Germany Aleksy Schubert, U of Warsaw, Poland Gheorghe Stefanescu, U of Bucharest, Romania Bent Thomsen, U of Aalborg, Denmark Shmuel Tyszberowicz, U of Tel Aviv, Israel Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia Wolfgang Reif, U of Augsburg, Germany Amiram Yehudai, U of Tel Aviv, Israel Elena Zucca, U of Genova, Italy CONTACT Email: foveoos2011 at cost-ic0701.org Web: http://foveoos2011.cost-ic0701.org -- Prof. Ferruccio Damiani Dipartimento di Informatica |Phone: (+39) 011 670 6719 Universit? degli Studi di Torino |Fax : (+39) 011 75 16 03 C.so Svizzera 185 |Email: damiani at di.unito.it I-10149 Torino, Italy |URL : http://www.di.unito.it/~damiani From Thomas.Agotnes at infomedia.uib.no Mon Jul 25 15:39:03 2011 From: Thomas.Agotnes at infomedia.uib.no (=?ISO-8859-1?Q?Thomas_=C5gotnes?=) Date: Mon, 25 Jul 2011 21:39:03 +0200 Subject: [TYPES/announce] CFP: Studia Logica special issue on Logic and Games Message-ID: <8CF3FC13-3DA5-4B32-A70E-E3D2BFC12A75@infomedia.uib.no> Call for Papers Special Issue of Studia Logica on Logic and Games Guest editor: Thomas ?gotnes (University of Bergen) Formal logic and game theory can meet in many ways. While the use of games-for-logic, e.g., to define semantics of quantifiers or to compare logical models, goes back a long time, logic-for-games is a more recent and currently very active research direction which has been precipitated by the introduction of the notion of (multi-)agency in logic. If agents are assumed to be self-interested and to act rationally, then reasoning about action in a multi-agent setting requires reasoning about game theoretic concepts. Furthermore, logics capturing, e.g., the principles of action, belief, knowledge, time, preference and so on, can help explaining the foundations of game theoretic solutions, algorithms, etc. The goal of the special issue of Studia Logica on Logic and Games is to illustrate current trends and present recent advances in this field. We invite submissions on all topics in the intersection between formal logic and game theory, including the following topics (not an exhaustive list): o Logical formalisations of game properties o Logics for reasoning about strategic interaction o The use of logic to characterise or explain concepts, solutions, algorithms, etc., relevant for games o Logical-epistemic foundations of solution concepts o Reasoning about preferences o Logical aspects of social choice o Judgment aggregation o Game semantics Model comparison games (e.g., for comparing expressiveness, succinctness) The special issue will contain contributions from the following invited authors, in addition to selected submitted contributions: o Johan van Benthem, University of Amsterdam/Stanford University o Rohit Parikh, City University of New York o Michael Wooldridge, University of Liverpool Submission details: submitted papers should be between 15 and 20 pages long (including bibliography), and should be formatted according to the Studia Logica LaTex style. Only electronic submissions will be accepted. The authors should send an email with subject "Studia Logica Submission" to the guest editor (Thomas Agotnes, thomas.agotnes at infomedia.uib.no), with the file of the paper as an attachment, and the following information in the body of the email in plain text: paper title, author names, surface mail, email address of the contact author and a short abstract. Submission deadline: 15 August 2011 All papers will be refereed according to the standards of the journal. For more details, see http://www.ifispan.waw.pl/studialogica/si-logic-and-games.html From icfp.publicity at googlemail.com Tue Jul 26 05:00:08 2011 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 26 Jul 2011 11:00:08 +0200 Subject: [TYPES/announce] ICFP 2011: Call for participation Message-ID: ===================================================================== Call for Participation The 16th ACM SIGPLAN International Conference on Functional Programming (ICFP 2011) http://www.icfpconference.org/icfp2011/ Tokyo, Japan September 19-21, 2011 ===================================================================== ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. * Program: http://www.icfpconference.org/icfp2011/program.html * Registration link: https://regmaster3.com/2011conf/ICFP11/register.php * Local arrangements (including travel and accommodation): http://www.biglab.org/icfp11local/index.html Schedule including related events: September 18 Workshop on Generic Programming (WGP) Workshop on High-Level Parallel Programming and Applications (HLPP) Workshop on ML September 19-21 ICFP September 22 Commercial Users of Functional Programming ? Day 1 (CUFP Tutorials) Haskell Symposium September 23 Commercial Users of Functional Programming ? Day 2 (CUFP Tutorials) Erlang Workshop Haskell Implementors' Workshop September 24 Commercial Users of Functional Programming ? Day 3 (CUFP Talks) Continuation Workshop Conference organizers: * General Co-Chairs: Manuel Chakravarty, University of New South Wales Zhenjiang Hu, National Institute of Informatics * Program Chair: Olivier Danvy, Aarhus University * Local Arrangements Chair: Soichiro Hidaka, National Institute of Informatics * Workshop Co-Chairs: Gabriele Keller, University of New South Wales Derek Dreyer, MPI-SWS * Programming Contest Chair: Eijiro Sumii, Tohoku University * Publicity Chair: Wouter Swierstra, Radboud Universiteit Nijmegen ===================================================================== From pangjun at gmail.com Tue Jul 26 08:20:14 2011 From: pangjun at gmail.com (Jun PANG) Date: Tue, 26 Jul 2011 14:20:14 +0200 Subject: [TYPES/announce] SecCo 2011: Call for Participation Message-ID: +-------------------------------------------------------------------------+ ! Call for Participation ! ! SecCo 2011 ! ! 9th International Workshop on Security Issues in Concurrency ! ! Aachen, Germany ! ! Monday, September 5th, 2011 ! ! http://www.lix.polytechnique.fr/~kostas/SecCo2011/ ! ! ! ! Affiliated with CONCUR 2011 ! +-------------------------------------------------------------------------+ PROGRAM ======= This year, we have three invited speakers: Carroll Morgan (University of New South Wales) Catuscia Palamidessi (INRIA and LIX, Ecole Polytechnique) David Rajchenbach-Teller (MLstate) The workshop program is avaiable at http://www.lix.polytechnique.fr/~kostas/SecCo2011/program.php REGISTRATION ============ Online registration at: http://concur2011.rwth-aachen.de/registration (through CONCUR'11) Kind reminder: early bird registration closes on July 31, 2011! BACKGROUND, AIM AND SCOPE ========================= Emerging trends in concurrency theory require the definition of models and languages adequate for the design and management of new classes of applications, mainly to program either WANs (like Internet) or smaller networks of mobile and portable devices (which support applications based on a dynamically reconfigurable communication structure). Due to the openness of these systems, new critical aspects come into play, such as the need to deal with malicious components or with a hostile environment. Current research on network security issues (e.g. secrecy, authentication, etc.) usually focuses on opening cryptographic point-to-point tunnels. Therefore, the proposed solutions in this area are not always exploitable to support the end-to-end secure interaction between entities whose availability or location is not known beforehand. The aim of the workshop is to cover the gap between the security and the concurrency communities. More precisely, the workshop promotes the exchange of ideas, trying to focus on common interests and stimulating discussions on central research questions. In particular, we look for papers dealing with security issues -- such as authentication, integrity, privacy, confidentiality, access control, denial of service, service availability, safety aspects, fault tolerance, trust, language-based security, probabilistic and information theoretic models -- in emerging fields like web services, mobile ad-hoc networks, agent-based infrastructures, peer-to-peer systems, context-aware computing, global/ubiquitous/pervasive computing. PROGRAM COMMITTEE ================= * Miguel E. Andres (Ecole Polytechnique, France) * Kostas Chatzikokolakis (Ecole Polytechnique, France; co-chair) * Stephanie Delaune (ENS Cachan, France) * Ralf Kuesters (University of Trier, Germany) * Gavin Lowe (University of Oxford, UK) * Jun Pang (University of Luxembourg, Luxembourg; co-chair) * Mark Ryan (University of Birmingham, UK) * Dominique Unruh (Saarland University, Germany) * Luca Vigano (University of Verona, Italy) * Chenyi Zhang (University of New South Wales, Australia) From cristi at ifi.uio.no Wed Jul 27 08:05:27 2011 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Wed, 27 Jul 2011 14:05:27 +0200 Subject: [TYPES/announce] Early registration deadline approaching for FCT 2011 - Fundamentals of Computation Theory in Oslo Message-ID: Please excuse if you receive multiple coppies of this anouncement! -------------------------------------------------------------------- Call for Participation FCT 2011 18th International Symposium on Fundamentals of Computer Theory August 22-25, 2011, Oslo, Norway http://fct11.ifi.uio.no/ Established in 1977, the biennial Symposium on Fundamentals of Computation Theory is an international forum for researchers interested in all aspects of theoretical computer science. -------------------------------------------------------------------- REGISTRATION OPEN Early registration deadline: July 31, 2011 A limited amount of student sponsorships are available on application. INVITED SPEAKERS: - Yuri Gurevich (Microsoft Research, Redmond USA) "Impugning Randomness, Convincingly" - Daniel Lokshtanov (University of California, USA) "Kernelization; an Overview" - Jose Meseguer (University of Illinois at Urbana-Champaign, USA) "The Rewriting Logic Semantics Project: A Progress Report" - Andrew P. Black (Portland State University, USA) TBA The accepted papers are listed below. They are arranged in sessions covering ---------------------------------------------- o Complexity theory o Parametrized algorithms o Computation models o Calculi and programs o Graph algorithms o Fundamentals of Computing ---------------------------------------------- For the schedule of the program, see the FCT web-site. 1. A.N. Trahtman. Modifying the upper bound on the length of minimal synchronizing word 2. Annabell Berger and Matthias Mueller-Hannemann. Dag Realizations of Directed Degree Sequences 3. Bart M. P. Jansen and Stefan Kratsch. Data Reduction for Graph Coloring Problems 4. Chia-Jung Lee, Chi-Jen Lu and Shi-Chun Tsai. Computational Randomness from Generalized Hardcore Sets 5. Elliot Fairweather, Maribel Fernandez and Murdoch Gabbay. Principal types for nominal theories 6. Fabien Givors and Gregory Lafitte. Sub-Computabilities 7. Ferdinando Cicalese, Martin Milanic and Ugo Vaccaro. Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs 8. Florian Corzilius and Erika Abraham. Virtual Substitution for SMT Solving 9. Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli and Vangelis Paschos. Online maximum k-coverage 10. Gregory Gutin, Mark Jones and Anders Yeo. A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application 11. Guillaume Malod. Succinct algebraic branching programs characterizing non-uniform complexity classes 12. Jacques Bahi, Jean-Francois Couchot, Christophe Guyeux and Adrien Richard. On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems 13. Jos Baeten, Bas Luttik and Paul Van Tilburg. Reactive Turing Machines 14. Klaus Meer. Almost transparent short proofs for NP over the reals 15. Krishnendu Chatterjee, Laurent Doyen and Rohit Singh. On Memoryless Quantitative Objectives 16. Ludwig Staiger. Constructive dimension and Hausdorff dimension: the case of exact dimension 17. Mamadou Moustapha Kante, Vincent Limouzy, Arnaud Mary and Lhouari Nourine. Enumeration of Minimal Dominating Sets and Variants 18. Marius Zimand. On the optimal compression of sets in PSPACE 19. Martin Ebbesen, Paul Fischer and Carsten Witt. Edge-matching Problems with Rotations 20. Mila Dalla Preda and Cinzia Di Giusto. Hunting distributed malware with the k-calculus 21. Nathaniel Charlton and Bernhard Reus. Specification patterns and proofs for recursion through the store 22. Paul Hunter. LIFO-search on digraphs: A searching game for cycle-rank 23. Petr Golovach, Daniel Paulusma and Jian Song. Coloring graphs without short cycles and long induced paths 24. Pinar Heggernes, Pim Van 'T Hof, Bart Jansen, Stefan Kratsch and Yngve Villanger. Parameterized Complexity of Vertex Deletion into Perfect Graph Classes 25. Robert Bredereck, Andre Nichterlein, Rolf Niedermeier and Geevarghese Philip. The Effect of Homogeneity on the Complexity of k-Anonymity 26. Sergey Goncharov and Lutz Schroeder. A Coinductive Calculus for Asynchronous Side-effecting Processes 27. Stephen Fenner. Functions that preserve p-randomness 28. Stephane Bessy and Anthony Perez. Polynomial kernels for Proper Interval Completion and related problems EVENTS * FCT is part of the program related to the scientific opening of the new "Ole-Johan Dahl building" of the Department of Informatics. This part takes the morning of Monday 22nd. It will include invited talks and discussion panel on mainly theory and future of programming languages. * The social dinner takes place in the Gamle Logen, the place where the King of Norway hands each year the Abel Prize for life-long achievements in Mathematics. * An excursion is organized in the second afternoon of the conference. From james.cheney at gmail.com Wed Jul 27 11:25:38 2011 From: james.cheney at gmail.com (James Cheney) Date: Wed, 27 Jul 2011 16:25:38 +0100 Subject: [TYPES/announce] PODS 2012 Call for Papers Message-ID: [PODS is the leading database theory conference. This year PODS explicitly solicits work "emerging database environments and applications", including topics involving types and programming languages. --James] CALL FOR PAPERS 31st ACM SIGMOD-SIGACT-SIGART Symposium on PRINCIPLES OF DATABASE SYSTEMS (PODS 2012) May 21-May 23 2012, Scottsdale, Arizona, USA The PODS symposium series, held in conjunction with the SIGMOD conference series, provides a premier annual forum for the communication of new advances in the theoretical foundations of database systems. For the 31st edition, original research papers providing new insights in the specification, design, or implementation of data-management tools are called for. Topics of Interest Topics that fit the interests of the symposium include the following (as they pertain to databases): -- languages for semi-structured data; search query languages; -- distributed and parallel aspects of databases; -- dynamic aspects of databases; -- incompleteness, inconsistency, and uncertainty in databases; -- schema and query extraction; data integration; data exchange; -- provenance; workflows; metadata management; meta-querying; -- data mining and machine learning techniques for databases; -- constraints; privacy and security; Web services; -- automatic verification of database-driven systems; -- model theory, logics, algebras and computational complexity; -- data modeling; data structures and algorithms for data management; -- design, semantics, and optimization of query and database languages; -- domain-specific databases (multi-media, scientific, spatial, temporal, text). In addition, we especially welcome papers addressing *emerging database environments and applications*. An External Review Committee will assist the Core PC (listed further below) in reviewing papers in the following multi-disciplinary areas of particular interest to this edition of PODS. -- Querying and Mining of Unstructured Data: Anhai Doan (Kosmix & U. Wisconsin), Aristides Gionis (Yahoo! Labs), Djoerd Hiemstra (Twente), Stefano Leonardi (University of Rome La Sapienza), Evimaria Terzi (Boston University) -- Web Services, Web Programming and Data-Centric Workflow: Wil van der Aalst (Eindhoven), Anders M?ller (Aarhus), Farouk Toumani (ISIMA), David Walker (Princeton), Karsten Wolf (Rostock) -- Learning of Data Models and Queries: Deepak Agarwal (Yahoo! Labs), James Cussens (York U.), Amol Deshpande (U. Maryland), Kristian Kersting (Fraunhofer Institute IAIS, U. Bonn) -- Cloud Computing and Next-generation Distributed Query Processing: Shivnath Babu (Duke), Phillip Gibbons (Intel Labs), Monica Lam (Stanford), Boon Thau Loo (U. Penn), Volker Markl (TU Berlin) -- Semantic, Linked, Networked, and Crowdsourced Data: Panos Ipeirotis (NYU), David Karger (MIT), Carsten Lutz (Bremen), Boris Motik (Oxford) Important Dates: Abstract submission: 20 November 2011 Manuscript submission: 27 November 2011 Notification: 15 February 2012 Submission Guidelines Submitted papers should be at most twelve pages, including bibliography, using reasonable page layout and font size of at least 9pt (note that the SIGMOD style file does not have to be followed). Additional details may be included in an appendix, which, however, will be read at the discretion of the PC. Papers longer than twelve pages (excluding the appendix) or in font size smaller than 9pt risk rejection without consideration of their merits. The submission process will be through the website. Note that, unlike the SIGMOD conference, PODS does not use double-blind reviewing, and therefore PODS submissions should be eponymous (i.e., the names and affiliations of authors should be listed on the paper). The results must be unpublished and not submitted elsewhere, including the formal proceedings of other symposia or workshops. Authors of an accepted paper will be expected to sign copyright release forms, and one author is expected to present it at the conference. Best Paper Award: An award will be given to the best submission, as judged by the PC. Best Student Paper Award: There will also be an award for the best submission, as judged by the PC, written exclusively by a student or students. An author is considered as a student if at the time of submission, the author is enrolled in a program at a university or institution leading to a doctoral/master's/bachelor's degree. Organization: PODS General Chair: Maurizio Lenzereni (University of Rome La Sapienza) PODS Program Chair: Michael Benedikt (Oxford) Publicity & Proceedings Chair: Markus Kroetzsch (Oxford) Core Program Committee: Mikhail Atallah (Purdue) Toon Calders (Eindhoven) Diego Calvanese (Free U. Bolzano) James Cheney (Edinburgh) Graham Cormode (AT&T Labs) Alin Deutsch (UC San Diego) Gianluigi Greco (Calabria) T.J. Green (UC Davis) Martin Grohe (HU Berlin) Marc Gyssens (Hasselt) T.S. Jayram (IBM Almaden & IBM India) Daniel Kifer (Penn State) Phokion Kolaitis (UC Santa Cruz & IBM Almaden) Rasmus Pagh (Copenhagen) Luc Segoufin (INRIA Cachan) Pierre Senellart (Telecom ParisTech) Sophie Tison (Lille) Victor Vianu (UC San Diego) David Woodruff (IBM Almaden) SIGMOD/PODS Webpage: http://www.sigmod.org/2012/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From zucca at disi.unige.it Thu Jul 28 11:08:14 2011 From: zucca at disi.unige.it (Elena Zucca) Date: Thu, 28 Jul 2011 17:08:14 +0200 Subject: [TYPES/announce] Final CFP: FOOL'11 Message-ID: <84087C6E-3B2B-4BC3-9984-DBAF5F51C4AC@disi.unige.it> [Apologies for cross-postings] CALL FOR PAPERS: 2011 International Workshop on Foundations of Object-Oriented Languages (FOOL'11) Portland, Oregon, USA, 23 October 2011 During the workshop days of SPLASH/OOPSLA http://www.disi.unige.it/person/ZuccaE/FOOL2011 IMPORTANT DATES Abstract submission: Friday, 5 August 2011 Paper submission: Friday, 12 August 2011 Notification: Monday, 5 September 2011 Final version: Friday, 7 October 2011 WORKSHOP DESCRIPTON 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. The FOOL workshops bring together researchers to share new ideas and results in these areas. The next workshop, FOOL'11, will be held in Portland, Oregon, USA on Sunday, 23 October 2011, during the workshop days at the beginning of SPLASH. Submissions for this event are invited in the general area of foundations of object-oriented languages, including integration with other paradigms and extensions, such as aspects, components, meta-programming. Topics of interest include language semantics, type systems, program analysis and verification, formal calculi, concurrent and distributed languages, databases, software adaptation, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as an informal electronic proceedings. Historically, presentation at FOOL 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. SUBMISSION INSTRUCTIONS We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy (http://www.acm.org/sigs/sigplan/republicationpolicy.htm). Submissions should be PDF or PostScript in standard SIGPLAN 9pt conference format for a US-letter size page. Templates are available at http://www.acm.org/sigs/sigplan/authorInformation.htm While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. More detailed submission instructions are available on the workshop web site at http://www.disi.unige.it/person/ZuccaE/FOOL2011/ Program Chair: Elena Zucca (University of Genova, Italy) e-mail: zucca at disi.unige.it Program Committee: Wei Ngan Chin (University of Singapore, Singapore), Ferruccio Damiani (University of Torino, Italy), Werner M. Dietl (University of Washington, USA), Dino Distefano (Queen Mary University of London and Monoidics Ltd, UK), Sophia Drossopoulou (Imperial College London, UK), Erik Ernst (Aarhus University, Denmark), Atsushi Igarashi (Kyoto University, Japan), Donna Malayeri (EPFL, Switzerland), Jan Smans (Katholieke Universiteit Leuven, Belgium) Steering Committee: Jonathan Aldrich (Carnegie Mellon University) [Chair], Viviana Bono (University of Torino, Italy), Atsushi Igarashi (Kyoto University, Japan), James Noble (University of Wellington, New Zealand), John Reppy (University of Chicago, USA), Jeremy Siek (University of Colorado, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From luca.vigano at univr.it Thu Jul 28 13:37:13 2011 From: luca.vigano at univr.it (Luca Vigano`) Date: Thu, 28 Jul 2011 19:37:13 +0200 Subject: [TYPES/announce] PhD Program in Computer Science (5+5 positions) at the University of Verona, Italy Message-ID: <0640BD4E-2B7E-4017-8E0E-EF82AA843C67@univr.it> Duration: 3 years (starting January 1st, 2012) Available fellowships: 5 Additional positions: 5 Application deadline: August 31st, 2011 Contact: Prof. Luca VIGAN? Tel. +39 045 8027070 luca.vigano at univr.it www.sdsim.univr.it Google: verona school sciences engineering medicine -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: locandinadottoratoInformatica_2012.pdf Type: application/pdf Size: 242024 bytes Desc: not available URL: -------------- next part -------------- An HTML attachment was scrubbed... URL: From leucker at in.tum.de Fri Jul 29 04:14:41 2011 From: leucker at in.tum.de (Martin Leucker) Date: Fri, 29 Jul 2011 10:14:41 +0200 Subject: [TYPES/announce] CfPart: TIME'11 Message-ID: <20110729081441.GA30651@sunsvr01.isp.uni-luebeck.de> TIME 2011 Call for Participation Eighteenth International Symposium on Temporal Representation and Reasoning Luebeck, Germany, September 12-14, 2011 http://www.isp.uni-luebeck.de/time11/ * DATES Registration: 18 June - 14 August 2011 Late Registration: from 15 August 2011 TIME Symposium: 12 - 14 September 2011 * THE CONFERENCE 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. This year, TIME will feature a special track on interval temporal logics. The conference will span three days, and will be organized as a combination of technical paper presentations, keynote lectures, and tutorials. * INVITED SPEAKERS Nir Piterman (University of Leicester, UK) p-Automata and Obligation Games Gerhard Schellhorn (Universit?t Augsburg, Germany) Extending ITL with Interleaved Programs for Interactive Verification Kristen Brent Venable (Universit? di Padova, Italy) Temporal Preferences Jef Wijsen (Universit? de Mons, Belgium): Towards a Foundation of Data Currency * TOPICS The main topics of the conference are: Temporal Representation and Reasoning in AI Temporal Database Management Temporal Logic and Verification in Computer Science Interval Temporal Logics * FEES Registration: 330 ? Late registration: 370 ? * CONFERENCE OFFICERS General Chair: Carlo Combi, University of Verona, Italy Program Committee Chairs: Martin Leucker, University of Luebeck, Germany Frank Wolter, University of Liverpool, United Kingdom Organization Chair: Martin Leucker, Universitaet Luebeck, Germany * PROGRAM COMMITTEE Alessandro Artale (Free University of Bozen-Bolzano, Italy) Philippe Balbiani (IRIT, CNRS, France) Claudio Bettini (Universit? di Milano, Italy) Benedikt Bollig (LSV, CNRS, France) Lubo? Brim (Masaryk University, Czech Republic) Antonio Cau (De Montfort University, UK) Dang Van Hung(VNU, Vietnam) Clare Dixon (University of Liverpool, UK) Rajeev Gor? (ANU, Australia) Dimitar Guelev (BAS, Bulgaria) Peter Habermehl (University Paris Diderot, LIAFA , France) Ian Hodkinson (Imperial College London, UK) Roman Kontchakov (Birkbeck, University of London, UK) Salvatore La Torre (Universit? di Salerno, Italy) Ranko Lazic (University of Warwick, UK) Martin Leucker (Universit?t zu L?beck, Germany) Kamal Lodaya (IMSc, India) Nicolas Markey (CNRS, ENS Cachan, France) Angelo Montanari (Universit? di Udine, Italy) Ben Moszkowski (DMU, UK) Dirk Nowotka (Universit?t Stuttgart, Germany) Paritosh K. Pandya (Tata Institute of Fundamental Research, India) Jean-Francois Raskin (Universit? Libre de Bruxelles, Belgium) Peter Revesz (University of Nebraska-Lincoln, USA) Mark Reynolds (University of Western Australia, Australia) Martin Sachenbacher (TUM, Germany) C?sar S?nchez (IMDEA, CSIC, Spain) Christian Schallhart (Oxford University, UK) Stefan W?lfl (Albert-Ludwigs-Universit?t Freiburg, Germany) Frank Wolter (University of Liverpool, UK) Naijun Zhan (ISCAS, China) Esteban Zim?nyi (Universit? Libre de Bruxelles, Belgium) * FURTHER INFORMATION Questions related to submission, reviewing, and program: time11 at isp.uni-luebeck.de Questions related to local organization: time11-org at isp.uni-luebeck.de From baskar at mais.informatik.tu-darmstadt.de Fri Jul 29 09:55:13 2011 From: baskar at mais.informatik.tu-darmstadt.de (Baskar) Date: Fri, 29 Jul 2011 15:55:13 +0200 Subject: [TYPES/announce] =?windows-1252?q?Positions_for_PhD=96students_an?= =?windows-1252?q?d_PostDocs?= Message-ID: <4E32BBC1.3020208@mais.informatik.tu-darmstadt.de> Positions for PhD?students and PostDocs ************************************** The TU Darmstadt is one of Germany?s top technical universities with an outstanding nation-wide and international reputation in research and education. Being part of Theoretical Computer Science, the chair Modeling and Analysis of Information Systems ( MAIS) is currently offering positions for PhD-students and PostDocs. What are the positions about? **************************** Our aim is to make IT systems more reliable and secure than they are today. Due to the complexity of today?s information systems and the manifold possibilities to attack these systems, the development of secure systems is a big technological challenge. To address this challenge, we develop formal methods and supporting tools that can be applied in the software-development process and at runtime. We test our approaches in case-studies in our Mobile Devices Lab and in practice. In particular, we are working on stepwise software development, information flow security, side-channel analysis and runtime monitoring. Currently, we are looking for candidates who are interested in formal approaches for information security in any of the above areas. The position ************ Suitable candidates should have a Master?s degree (or equivalent) in Computer Science or Mathematics. For all our research topics, a solid background in formal methods or logic is required. A background in information security will be helpful, but is not a prerequisite. Prior knowledge in any of the following areas is also a plus: Automated Verification, Model Checking, Model-based Software Development, Concurrency Theory, Program Analysis, Side-channel Analysis, Runtime Monitoring. Candidates should be highly motivated to tackle challenging research topics and to contribute to an open-minded team. We offer a productive and continuously evolving research environment, in which you can discuss ideas and collaborate with team members who are working on related research topics. Our international connections as well as our involvement in interesting research projects, for example the DFG priority programme Reliably Secure Software Systems (RS3 ) and the Center for Advanced Security Research Darmstadt (CASED), provide further opportunities for inspiration and collaborations. The publication of your research results at highly ranked conferences will be expected and supported. The positions offered are regular jobs with social benefits. The salary will be based on the TV-TU Darmstadt public service salary scale (equivalent to former BAT IIa and TV-L). German language skills are not required in the beginning, but the willingness to learn German within the first year is expected. How to apply ? ************** Please submit your application, preferably on paper, including your detailed CV (including your language skills in English and German), complete educational transcripts with grades and degrees (copies, no originals), description of your background and your research interests, and, if possible, the contact information of one or two references to Prof. Dr. Heiko Mantel, TU Darmstadt, Department of Computer Science, MAIS Group, Hochschulstra?e 10, 64289 Darmstadt, Germany. Deadline for applications is the 9. August 2011. However, we will consider applications until the position is filled. The position is available immediately but a later start is also possible. TU Darmstadt is an equal opportunities employer and welcomes applications from women. Disabled persons having the same qualification will be preferred. More information is available at http://www.mais.informatik.tu-darmstadt.de. In case of questions, please contact us by e-mail (recruiting at mais.informatik.tu-darmstadt.de). From yahave at cs.technion.ac.il Sat Jul 30 01:17:15 2011 From: yahave at cs.technion.ac.il (Eran Yahav) Date: Sat, 30 Jul 2011 08:17:15 +0300 Subject: [TYPES/announce] SAS early registration ends August 10, student travel grants available Message-ID: <4E3393DB.4020600@cs.technion.ac.il> The 18th International Static Analysis Symposium September 14-16, Venice, Italy Static Analysis is increasingly recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The Eighteenth International Static Analysis Symposium (SAS 2011) will be held in Venice, Italy. * Invited Speakers Jerome Feret, Ecole Normale Superieure, France Daniel Kaestner, AbsInt, Germany Ken McMillan, Microsoft Research John Mitchell, Stanford Sriram Rajamani, Microsoft Research India * Co-located Workshops The International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2011) - September 13th The International Workshop on Static Analysis and Systems Biology (SASB 2011) - September 13th The International Workshop on Tools for Automatic Program AnalysiS (TAPAS 2011) - September 17th * Early Registration - Until August 1st http://sas2011.cs.technion.ac.il/registration.html * Student Travel Grants Available Apply by sending email to yahave at cs.technion.ac.il * Hotel Information Being mid September very high season, participants must book the lodging for their stay as soon as possible. http://sas2011.cs.technion.ac.il/hotels.html From carbonem at itu.dk Sat Jul 30 11:54:40 2011 From: carbonem at itu.dk (Marco Carbone) Date: Sat, 30 Jul 2011 17:54:40 +0200 Subject: [TYPES/announce] WS-FM'11 Call for Participation (last chance for early registration) Message-ID: ********************************** Apologies for multiple copies ********************************** ---------------------- WS-FM 2011 8th International Workshop on Web Services and Formal Methods September 1-2, 2011, Clemont-Ferrand, France http://itu.dk/wsfm2011/ Co-located with BPM 2011 http://bpm2011.isima.fr/ === Deadlines for Registration === Jul 30, 2011: EARLY Registration Aug 20, 2011: Normal Registration ** You can register on the **BPM 2011** web page: http://bpm2011.isima.fr/registration.html ** === Invited Speakers === - Kohei Honda === Scope of the Workshop === Service Oriented Computing (SOC) provides standard mechanisms and protocols for describing, locating and invoking services over the Internet. Although there are existing SOC infrastructures that support specification of service interfaces, access policies, behaviors and compositions, there are still many active research areas in SOC such as the support and management of interactions with stateful and long-running services, large farms of services and quality of service delivery. Moreover, emerging paradigm of cloud computing provides a new platform for service delivery, enabling the development of services that are configurable based on client requirements, service level guarantee mechanisms, and extended services based on virtualization (Software as a Service, Platform as a Service, Infrastructure as a Service). The convergence of SOC and cloud computing is accelerating the adoption of both of these technologies, making the service dependability and trustworthiness a crucial and urgent problem. Formal methods can play a fundamental role in this research area. They can help us define unambiguous semantics for the languages and protocols that underpin existing web service infrastructures, and provide a basis for checking the conformance and compliance of bundled services. They can also empower dynamic discovery and binding with compatibility checks against behavioral properties and quality of service requirements. Formal analysis of security properties and performance is also essential in cloud computing and in application areas including e-science, e-commerce, workflow, business process management, etc. Moreover, the challenges raised by this new area can offer opportunities for extending the state of the art in formal techniques. The aim of the WS-FM workshop series is to bring together researchers working on SOC, cloud computing and formal methods in order to catalyze fruitful collaboration. The scope of the workshop is not only limited to technological aspects. In fact, the WS-FM series has a strong tradition of attracting submissions on formal approaches to enterprise systems modeling in general, and business process modeling in particular. Potentially, this could have a significant impact on the on-going standardization efforts for SOC and cloud computing technologies. === Program Committee === Marco Carbone, IT University of Copenhagen, Denmark (co-chair) Jean-Marc Petit, University of Lyon/CNRS, France (co-chair) Karthikeyan Bhargavan INRIA, France Maria Grazia Buscemi IMT Lucca, Italy Marco Carbone IT University, Copenhagen, Denmark Florian Daniel Universita' di Trento, Italy Pierre-Malo Danielou Imperial College London, UK Giuseppe De Giacomo SAPIENZA Universita' di Roma, Italy Rocco De Nicola Universita' di Firenze, Italy Marlon Dumas University of Tartu, Estonia Jos? Luiz Fiadeiro University of Leicester, UK Xiang Fu Hofstra University, USA Serge Haddad ENS Cachan, France Sylvain Hall? Universit? du Qu?bec ? Chicoutimi, Canada Thomas Hildebrandt IT University of Copenhagen, Denmark Manuel Mazzara Newcastle University, UK Luca Padovani Universita' di Torino, Italy Jean-Marc Petit University of Lyon/CNRS, France Steve Ross-Talbot Pi4Tech, UK Hagen Voelzer IBM Research - Zurich, Switzerland Nobuko Yoshida Imperial College London, UK Fatiha Zaidi Universit? Paris-Sud XI, France Gianluigi Zavattaro Universita' di Bologna, IT === Contact === wsfm11 at easychair.org === Previous editions === WS-FM 2010 in Hoboken, co-chaired by Mario Bravetti and Tevfik Bultan WS-FM 2009 in Bologna, co-chaired by Cosimo Laneve and Jianwen Su WS-FM 2008 in Milan, co-chaired by Roberto Bruni and Karsten Wolf WS-FM 2007 in Brisbane, co-chaired by Marlon Dumas and Reiko Heckel WS-FM 2006 in Wien, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2005 in Versailles, co-chaired by Mario Bravetti and Gianluigi Zavattaro WS-FM 2004 in Pisa, co-chaired by Mario Bravetti and Gianluigi Zavattaro From Aart.Middeldorp at uibk.ac.at Wed Aug 3 08:24:04 2011 From: Aart.Middeldorp at uibk.ac.at (Aart Middeldorp) Date: Wed, 03 Aug 2011 14:24:04 +0200 Subject: [TYPES/announce] postdoctoral researcher position in Innsbruck Message-ID: <4E393DE4.1090301@uibk.ac.at> The University of Innsbruck invites applications for a 6 year position as postdoctoral researcher at the Computational Logic research group. Candidates must hold a PhD degree in computer science. A strong background in computational logic (in particular SMT, automated and interactive theorem proving) is desired. The ideal candidate complements existing strengths and enjoys working with students at all levels. Candidates are expected to conduct research leading to a habilitation and contribute to teaching and administration. Knowledge of German is not essential. The position is a full-time "B1/3 position" with teaching obligations of 4 hours per semester. The annual gross salary is approximately EUR 46,000. The official job advert appeared in the "Mitteilungsblatt" of the University on 3 August 2011 (code MIP-6659) http://orawww.uibk.ac.at/public_prod/owa/karriereportal.home Applications (including CV, publication list, and two references) may be mailed to the address stated there or, by email, to aart.middeldorp at uibk.ac.at no later than 24 August 2011. Informal inquiries are also welcome at the same email address. The preferred starting date is 2 November 2011. The city of Innsbruck, which hosted the Olympic Winter Games in 1964 and 1976, 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. The University of Innsbruck has a long tradition dating back to the 16th century and offers a wide spectrum of research and teaching activities with interesting opportunities for interdisciplinary collaboration. 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/ --- Univ.-Prof. Dr. Aart Middeldorp Institute of Computer Science, University of Innsbruck Technikerstr. 21a, 6020 Innsbruck, Austria phone: +43 512 507 6430 fax: +43 512 507 9887 -------------- next part -------------- A non-text attachment was scrubbed... Name: Aart_Middeldorp.vcf Type: text/x-vcard Size: 293 bytes Desc: not available URL: From jnfoster at cs.cornell.edu Wed Aug 3 12:06:20 2011 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Wed, 3 Aug 2011 12:06:20 -0400 Subject: [TYPES/announce] DBPL '11 Call for Participation Message-ID: The 13th International Symposium on Database Programming Languages http://www.cs.cornell.edu/conferences/dbpl2011 Seattle, Washington, USA August 29, 2011 co-located with VLDB 2011 Call for Participation For over 20 years, DBPL has established itself as the principal venue for publishing and discussing new ideas at the intersection of databases and programming languages. Many key contributions in query languages for object-oriented data, persistent databases, nested relational data, semistructured data, as well as fundamental ideas in types for query languages were first announced at DBPL. Today, the emergence of new data management applications such as Semantic Web and Web services, XML processing, Social and Sensor Networks, Cloud Computing and Peer-to-peer data management has lead to a new flurry of creative research in this area. DBPL is an established destination for such new ideas. ---------------- INVITED SPEAKERS ---------------- * Philip Wadler (Edinburgh) Databases and Programming Languages: Together again for the first time * Christopher Olsten (Bionica Human Computing) Programming and Debugging Large-Scale Data Processing Workflows --------------- ACCEPTED PAPERS --------------- * Temporal Data Model for Program Debugging Demian Lessa, Bharat Jayaraman, Jan Chomicki * DBWiki: A Database Wiki prototyped in Links James Cheney, Sam Lindley, Heiko Mueller * Chasing One's Tail: XPath Containment Under Cyclic DTDs Peter Wood, Mahtab Montazerian * On guarded simulations and acyclic first-order languages George Fletcher, Jan Hidders, Stijn Vansummeren, Yongming Luo, Francois Picalausa, Paul De Bra * Remote Batch Invocation for Database Access William Cook, Ben Wiedermann * PSPARQL Query Containment Melisachew Wudage Chekol, Jerome Euzenat, Pierre Geneves, Nabil Layaida * Next Generation Database Programming and Execution Environment Dirk Habich, Matthias Boehm, Maik Thiele, Benjamin Schlegel, Ulrike Fischer, Hannes Voigt, Wolfgang Lehner * Validity of Positive XPath Queries with Wildcard in the Presence of DTDs Kenji Hashimoto, Yohei Kusunoki, Yasunori Ishihara, Toru Fujiwara ------------ REGISTRATION ------------ Registration and local arrangements are being handled through the main VLDB conference. * Registration: http://www.vldb.org/2011/?q=node/20 * Local Arrangements: http://www.vldb.org/2011/?q=node/21 ---------- ORGANIZERS ---------- Nate Foster, Cornell University (Co-chair) Anastasios Kementsietsidis, IBM (Co-chair) Yanif Ahmad, Johns Hopkins Gavin Bierman, MSR-Cambridge Martin Bravenboer, LogicBlox Songyun Duan, IBM Floris Geerts, Edinburgh Pierre Geneves, CNRS Giorgio Ghelli, Pisa Todd Green, UC Davis Fritz Henglein, DIKU Feifei Li, Florida State Lipyeow Lim, Hawaii Sam Lindley, Edinburgh Kim Nguyen, LRI, Paris-Sud 11 Jorge Perez, UChile Dimitris Theodoratos, NJIT Yannis Velegrakis, Trento From ggrov at staffmail.ed.ac.uk Wed Aug 3 12:34:10 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Wed, 3 Aug 2011 17:34:10 +0100 Subject: [TYPES/announce] VSTTE 2012 : Fourth Call for Papers - 4 weeks to go Message-ID: 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 will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter M?ller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Sup?rieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Universit? Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter M?ller, ETH Zurich Tobias Nipkow, Technische Universit?t M?nchen Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Universit? Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From bcpierce at cis.upenn.edu Thu Aug 4 07:50:32 2011 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Thu, 4 Aug 2011 07:50:32 -0400 Subject: [TYPES/announce] New release of Software Foundations text Message-ID: I'm delighted to announce that the Software Foundations team has recently released a new revision of our online textbook: http://www.cis.upenn.edu/~bcpierce/sf/ The book covers a semester-long course on basic Coq usage, constructive logic, and core topics in the theory of programming languages. It is being used for graduate and advanced undergraduate courses at several institutions, as well as by many individuals for self-study. The main novelty is that every line is formalized: the whole book is a Coq script. Enjoy, - Benjamin From a.ricci at unibo.it Sat Aug 6 00:50:15 2011 From: a.ricci at unibo.it (Alessandro Ricci) Date: Sat, 6 Aug 2011 04:50:15 +0000 Subject: [TYPES/announce] CFP: AGERE! at SPLASH - UPDATES Message-ID: <2DCC542D-84FE-4095-A66A-72C6E77A35D8@unibo.it> AGERE! CALL FOR PAPERS - UPDATES Event: AGERE! International Workshop at SPLASH 2011- Programming Systems, Languages, and Applications based on Agents, Actors, and Decentralized Control (http://agere2011.apice.unibo.it) IMPORTANT DATES **UPDATED**: Papers can now be submitted in two different moments: Early Submissions (to apply for the early SPLASH registration) - Deadlines: Paper Submission: Friday, 19 August 2011 Notification: Monday, 19 September 2011 Early SPLASH registration: Friday, 23 September 2011 Final version: Monday, 10 October 2011 Late Submissions - Deadlines: Paper Submission: Friday, 9 September 2011 Notification: Monday, 3 October 2011 Final version: Monday, 10 October 2011 Demo Demo submission: Friday, 9 September 2011 Demo notification: Monday, 19 September 2011 Workshop date: Monday, 24 October 2011 ABSTRACT The fundamental turn of software into concurrency and distribution is not only a matter of performance, but also of design and abstraction, calling for programming paradigms that would allow more naturally than the current ones to think, design, develop, execute, debug and profile programs exhibiting different degrees of concurrency, reactiveness, autonomy, decentralization of control, distribution. This workshop aims at exploring programming approaches explicitly providing a level of abstraction that promotes a decentralized mindset in solving problems and programming systems. To this end, the abstractions of agents and actors (and systems of agents and actors) are taken as a natural reference: the objective of the workshop is then to foster the research in all aspects of agent-oriented programming and actor-oriented programming as evolution of mainstream paradigms (such as OOP), including 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. Read more at: http://agere2011.apice.unibo.it Join the group: https://groups.google.com/group/agere-at-splash to contribute to ongoing discussions about the AGERE! topics and workshop organization. ("Starting the workshop Now!" initiative) From peterol at ifi.uio.no Sat Aug 6 16:16:26 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Sat, 6 Aug 2011 22:16:26 +0200 Subject: [TYPES/announce] Final CfP: Doctoral Track at FACS 2011 Message-ID: <67E01BE9-B2C8-462F-8CAB-35BC7762A3F4@ifi.uio.no> --------------------------------------------------------------------- Call for Abstracts FACS-DT 2011 Doctoral Track at the 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- *** Submission deadline: August 12 *** We solicit submissions to the Doctoral Track of FACS 2011, in the form of abstracts (2 pages, LNCS format) describing PhD-work-in-progress, related theme, context, research questions, envisaged contributions, and partial results related to the topics of FACS. All accepted abstracts will appear in the pre-proceedings of FACS 2011. Paper submission will be done electronically via EasyChair at https://www.easychair.org/conferences/?conf=facsdt2011 FACS Aims and Scope: FACS 2011 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The symposium seeks to address the applications of formal methods in all aspects of software components and services. Specific topics include, but are not limited to: - formal models for software components and their interaction - formal aspects of services, service oriented architectures, and business processes - design and verification methods for software components and services - composition and deployment: models, calculi, languages - formal methods and modeling languages for components and services - model based and GUI based testing of components and services - component/service re-engineering and reuse - models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services - components for real-time, safety-critical, secure, and/or embedded systems - industrial or experience reports, and case studies - update and reconfiguration of component and service architectures - component systems evolution and maintenance - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self-adaptive systems Past Events: FACS'11 is the eighth event in a series of events founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The previous workshops in the FACS series were held in Pisa (September 2003, co-located with FM'03), Macau (October 2005), Prague (September 2006), Sophia-Antipolis (September 2007), Malaga (September 2008), Eindhoven (October 2009, held as part of the Formal Methods Week), and Guimaraes (October 2010). FACS invited speakers: Jose Meseguer (University of Illinois at Urbana-Champaign) John Rushby (SRI International) Important dates: Doctoral Track submission: August 12, 2011 Doctoral Track acceptance notification: August 20, 2011 Symposium: September 14-16, 2011 Venue: FACS 2011 is hosted by the Department of Informatics at the University of Oslo. The symposium will take place in the new modern computer science building on the main campus of the university. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Doctoral Track program chairs: Farhad Arbab (Leiden University and CWI, The Netherlands) and Peter Olveczky (University of Oslo, Norway) Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From katoen at cs.rwth-aachen.de Sun Aug 7 15:22:49 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Sun, 07 Aug 2011 21:22:49 +0200 Subject: [TYPES/announce] ETAPS 2012: First Call for Papers Message-ID: <4E3EE609.1040800@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** FIRST CALL FOR PAPERS: 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 -- (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 * TACAS: Tools and Algorithms for the Construction and Analysis of Systems * New! POST: Principles of Security and Trust -- INVITED SPEAKERS -- * Bruno Blanchet (INRIA / ENS / CNRS, France), * Georg Gottlob (Univ. of Oxford, UK) * Franois Bodin (IRISA and CAPS Entreprise, France) * Bjarne Stroustrup (Texas A&M Univ., USA) * Wil van der Aalst (Techn. Univ. of Eindhoven, Netherlands) * Glynn Winskel (Univ. of Cambridge, UK) * Holger Hermanns (Univ. of Saarland, Germany) * Cynthia Dwork (Microsoft Research, Silicon Valley, USA) -- IMPORTANT DATES -- * 7 October 2011: Submission deadline for abstracts (strict) * 14 October 2010: Submission deadline for full papers (strict) * 16 December 2011: Notification of acceptance * 6 January 2012: Camera-ready versions due Some conferences will use a rebuttal (author response) phase. -- GENERAL SUBMISSION INFORMATION -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. (TACAS has more categories, see below.) A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. - Research papers Different ETAPS 2012 conferences have different page limits. Specifically, FASE, FOSSACS and TACAS have a page limit of 15 pages, whereas CC, ESOP and POST allow at most 20 pages. Additional material intended for the referee but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. TACAS solicits not only regular research papers, but also case study papers. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most four pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool (this part will be included in the proceedings). * The second part, at most six pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) FOSSACS does not accept tool demonstration papers. In addition to tool demonstration papers (max 6 pages in their case), TACAS solicits also longer tool papers (max 15 pages) adhering to specific instructions about content and organization. -- SATELLITE EVENTS -- 20 satellite workshops will take place before or after ETAPS 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 4 kms from the city centre. -- ORGANIZERS * General chair: Tarmo Uustalu * Workshop chair: Keiko Nakata * Organizing committee: James Chapman, 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 selinger at mathstat.dal.ca Sun Aug 7 20:11:59 2011 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Sun, 7 Aug 2011 21:11:59 -0300 (ADT) Subject: [TYPES/announce] postdoc position, immediately Message-ID: <20110808001159.802098C016F@chase.mathstat.dal.ca> Dear colleagues, I invite applications for one postdoctoral position, starting September 1 or as soon as possible, at Dalhousie University under my supervision. The position is initially for 1 year, and can be extended for a second year. The salary is CAD $50,000 per year. The successful applicant will be part of a government-funded research team spanning Dalhousie and several U.S. institutions. The overall goal of the project is "to design a quantum programming environment, and to accurately estimate and significantly reduce the computational resources required to implement quantum algorithms on a realistic quantum computer". Here at Dalhousie University, we will be primarily responsible for the design of a quantum programming language. The project is structured as a research contract with specific milestones and deadlines. The nominal start date for this project is August 1, 2011 (yes, this is in the past). Familiarity with the design of programming languages, type systems, and/or semantics will be a prerequisite for this postdoc. Familiarity with quantum computing will be helpful, but is neither necessary nor sufficient for this position - the main emphasis is on programming languages. Interested applicants should contact Peter Selinger at selinger at mathstat.dal.ca as soon as possible, and in any case before August 11. I can provide more details about the research project to interested applicants on request. Thanks, -- Peter From selinger at mathstat.dal.ca Sun Aug 7 20:13:19 2011 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Sun, 7 Aug 2011 21:13:19 -0300 (ADT) Subject: [TYPES/announce] QPL2011 workshop, Nijmegen Message-ID: <20110808001319.59B658C016F@chase.mathstat.dal.ca> The following annoucement may be of interest to some type theorists. One of the focuses of this workshop is structures, programming languages, and semantics for quantum computing, including type systems. 8th workshop on QUANTUM PHYSICS AND LOGIC (QPL 2011) Nijmegen, October 27-29, 2011. http://qpl.science.ru.nl/ Call for submissions. * This event will bring together researchers working on mathematical foundations of quantum physics, quantum computing and information, and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science methods for the study physical behaviour in general. Over the past few years, there has been growing activity in these foundational approaches, together with a renewed interest in the foundations of quantum theory, which complement the more mainstream research in quantum computation. Invited Speakers: Hans Maassen (Nijmegen) Urs Schreiber (Utrecht) Rob Spekkens (Perimeter Institute) Deadlines: Submission: Aug 27 Notification of authors: Sep 20 Corrected papers due: Oct 13 Submission: Prospective speakers are invited to submit a 5-12 page extended abstract that provides sufficient evidence of results of genuine interest and provides sufficient detail to allows the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Submissions should be prepared using LaTeX, and must be submitted in PDF format at http://www.easychair.org/conferences/?conf=qpl11 Proceedings: Extended versions of accepted talks will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the workshop. Program committee: Thorsten Altenkirch (Nottingham) John Baez (UC Riverside and CQT Singapore) Dan Browne (UCL - London) Bob Coecke (Oxford) Giulio Chiribella (Perimeter Institute) Andreas D?ring (Oxford) Simon Gay (University of Glasgow) Bart Jacobs (Nijmegen, co-chair) Klaas Landsman (Nijmegen) Prakash Panangaden (McGill) Simon Perdrix (CNRS - Grenoble) Mehrnoosh Sadrzadeh (Oxford) Peter Selinger (Dalhousie, co-chair) Bas Spitters (Nijmegen) Local organizers: Bart Jacobs (Nijmegen) Bas Spitters (Nijmegen) Steering committee: Bob Coecke (Oxford) Prakash Panangaden (McGill) Peter Selinger (Dalhousie) Previous meetings: Previous QPL workshops were held in Ottawa (2003), Turku (2004), Chicago (2005), Oxford (2006), Reykjavik (2008), Oxford (2009), Oxford (2010). Websites: http://qpl.science.ru.nl/ (Workshop Homepage) http://www.easychair.org/conferences/?conf=qpl11 (Submission) * Contact: For more information, please contact Bart Jacobs and Peter Selinger at qpl11 at easychair.org. From Patricia.Johann at cis.strath.ac.uk Mon Aug 8 12:14:14 2011 From: Patricia.Johann at cis.strath.ac.uk (Patricia Johann) Date: Mon, 8 Aug 2011 17:14:14 +0100 (BST) Subject: [TYPES/announce] PhD Position availalble Message-ID: PhD Position in Category Theory and Functional Programming Department of Computer and Information Sciences University of Strathclyde, Scotland Applications are invited for one PhD position within the Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, Dr. Conor McBride, Dr. Peter Hancock, Dr. Robert Atkey, and six PhD students. The PhD project centres around applications of categorical methods to functional programming languages. The project is under the direction of Patricia Johann. The successful applicant will have either a first-class degree or an MSc in Mathematics or Computing Science or a related subject with a strong Mathematics or Computing Science component. Ideally, they will also have a strong, documented interest in doing research. Strong mathematical background and problem-solving skills are essential; good programming skills are a plus. Prior knowledge of category theory and/or functional programming is an advantage, but is not required. The PhD position is for 3 years; it starts in January 2012. The position is a fully-funded post for a UK or EU student, and includes both coverage of fees and an EPSRC-level stipend for each of the three years. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is located in the heart of Glasgow, which Lonely Planet Travel Guides hail as "one of Britain's largest, liveliest and most interesting cities" (see http://www.lonelyplanet.com/worldguide/scotland/glasgow/). Southern Scotland provides a particularly stimulating environment for researchers in theoretical computer science, with active groups in this area at Heriot-Watt University, the University of Edinburgh, the University of Glasgow, the University of St. Andrews, and the University of Strathclyde. Requests for further information and other informal enquiries can be sent to: Patricia Johann patricia at cis.strath.ac.uk Those interested in the position are asked to send e-mail to the address given above in the next short while. From crusso at microsoft.com Tue Aug 9 11:21:03 2011 From: crusso at microsoft.com (Claudio Russo) Date: Tue, 9 Aug 2011 15:21:03 +0000 Subject: [TYPES/announce] Second CFP: PADL'12 - Practical Aspects of Declarative Languages 2012 Message-ID: <88D1F4047EA9A2468BCC6B743186880F6404A393@DB3EX14MBXC311.europe.corp.microsoft.com> [Apologies if you receive multiple copies.] Call for Papers =============== 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 Abstract/Paper submission deadline: September 10th/17th, 2011 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'12 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, January 25-27. The symposium will be held in Philadelphia, Pennsylvania, USA. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2011 Paper Submission: September 17, 2011 Notification: October 22, 2011 Camera-ready: November 5, 2011 Symposium: January 23-24, 2012 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 chairs 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. PADL'12 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 15 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. Program Committee ================= Marcello Balduccini, Intelligent Systems Department, Kodak Research Labs Edwin Brady, University of St Andrews, Scotland Henning Christiansen, Roskilde University, Denmark Agostino Dovier, University of Udine, Italy Matthew Flatt, University of Utah, USA Gopal Gupta, University of Texas at Dallas, USA John Hughes, Chalmers University of Technology, Sweden; Quviq AB Gabriele Keller, University of New South Wales, Australia Lunjin Lu, Oakland University, USA Marc Pouzet, ?cole normale sup?rieure, France Ricardo Rocha, University of Porto, Portugal Andreas Rossberg, Google Germany GmbH, Germany Claudio Russo, Microsoft Research Cambridge, UK (co-chair) Kostis Sagonas, Uppsala Univeristy, Sweden Satnam Singh, Microsoft Research Cambridge, UK Zoltan Somogyi, University of Melbourne, Australia Eijiro Sumii, Tohoku University, Japan Terrance Swift, Universidade Nova de Lisboa, Portugal; Johns Hopkins University, USA Andrew Tolmach, Portland State University, USA Jan Wielemaker, University of Amsterdam, The Netherlands Roland Yap, National University of Singapore, Republic of Singapore Kwangkeun Yi, Seoul National University, Korea Neng-Fa Zhou, Brooklyn College, City University of New York, USA (co-chair) Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Claudio Russo Microsoft Research Cambridge,UK Email: crusso microsoft com Neng-Fa Zhou Brooklyn College, The City University of New York, USA Email: zhou sci brooklyn cuny edu With the Cooperation of ======================= The Association for Logic Programming (ALP) ACM SIGPLAN Microsoft Research, Cambridge =================================== From s.j.thompson at kent.ac.uk Wed Aug 10 04:11:54 2011 From: s.j.thompson at kent.ac.uk (Simon Thompson) Date: Wed, 10 Aug 2011 09:11:54 +0100 Subject: [TYPES/announce] PEPM 2012 Second call for papers Message-ID: <4376F06D-7910-42E1-A353-B32D52E9C532@kent.ac.uk> Please accept in our apologies for multiple postings of this announcement. ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) Call For Papers Paper submission deadline: Mon, October 10, 2011, 23:59, GMT http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 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 and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press and will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers - Markus Pueschel (ETH Zurich, Switzerland) - Martin Berger (University of Sussex, UK) Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Research, USA) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea) Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From ccshan at post.harvard.edu Wed Aug 10 18:54:34 2011 From: ccshan at post.harvard.edu (Chung-chieh Shan) Date: Wed, 10 Aug 2011 18:54:34 -0400 Subject: [TYPES/announce] Continuation Workshop: Call for Participation (register early by August 15) Message-ID: <20110810225434.GA14988@mantle.bostoncoop.net> ACM SIGPLAN Continuation Workshop 2011 http://logic.cs.tsukuba.ac.jp/cw2011/ co-located with ICFP 2011, Tokyo, Japan Saturday, September 24, 2011 Call for Participation Early Registration deadline is August 15! Continuations have been discovered many times, which highlights their many applications in programming language semantics and program analysis, linguistics, logic, parallel processing, compilation and web programming. Recently, there has been a surge of interest specifically in delimited continuations: new implementations (in Scala, Ruby, OCaml, Haskell), new applications (to probabilistic programming, event-driven distributed processing), substructural and constructive logics, natural language semantics. The goal of the Continuation Workshop is to make continuations more accessible and useful -- to practitioners and to researchers in various areas of computer science and outside computer science. We wish to promote communication among the implementors and users in many fields. We would like to publicize the applications of continuations in academic (logic, linguistics) and practical fields and various programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc.). Invited talks ------------- Mats Rooth, Cornell University http://conf.ling.cornell.edu/mr249/ From Logic to Effects and Back Noam Zeilberger, Universite' Paris 7 http://www.pps.jussieu.fr/~noam/ Tutorials --------- In the evening before the workshop, there will be a tutorial session ``Introduction to Programming with Shift and Reset'' Tutorial date and time: Friday, September 23, 2011, 19:00-21:00 Tutorial place: IIJ (next to NII, the place of the ICFP conference) Tutorial speakers: Kenichi Asai and Oleg Kiselyov Presentations ------------- Non-Deterministic Search Library Kenichi ASAI, Chihiro KANEKO `Focus movement' by delimited continuations Daisuke BEKKI Swarm: transparent scalability through portable continuations James DOUGLAS Correctness of Functions with Shift and Reset Noriko HIROTA, Kenichi ASAI Yield, the control operator: applications and a conjecture Roshan P. JAMES, Amr SABRY Demonstration of Continuation based C on GCC Shinji KONO Modular rollback through free monads Conor McBRIDE, Olin SHIVERS, Aaron TURON Using delimited continuations for distributed computing with the CIEL engine Derek G. MURRAY, Malte SCHWARZKOPF, Christopher SMOWTON, Steven SMITH, Anil MADHAVAPEDDY, Steven HAND The limit of the CPS hierarchy Josef SVENNINGSSON Visualizing continuations Naoki TAKASHIMA, Yukiyoshi KAMEYAMA -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 190 bytes Desc: Digital signature URL: From kos at informatik.uni-marburg.de Thu Aug 11 05:41:41 2011 From: kos at informatik.uni-marburg.de (Klaus Ostermann) Date: Thu, 11 Aug 2011 11:41:41 +0200 Subject: [TYPES/announce] Open PhD and Postdoc Positions at Marburg University Message-ID: 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 (e.g. by founding their own junior research group). For the PostDoc positions, we expect applicants to have demonstrated scientific excellence in areas related to our own research. For PhD positions, we expect evidence of the potential for scientific excellence. Knowledge of German is not required; the 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). We are flexible with regard to the starting date, but generally the sooner the better. We are looking forward to hearing from you. Best wishes, Klaus Ostermann on behalf of the PS group at Marburg University http://www.uni-marburg.de/fb12/ps From P.B.Levy at cs.bham.ac.uk Thu Aug 11 10:15:41 2011 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Thu, 11 Aug 2011 15:15:41 +0100 Subject: [TYPES/announce] short notice: posts available in Birmingham Message-ID: <0CE7F5F0-8F29-4AF5-ACCA-57FA43F675F8@cs.bham.ac.uk> Dear all, I just realized that this job opportunity hadn't been announced on this list. Sorry for the short notice, but you've still got almost three weeks to apply. We have a very good culture in type theory, semantics, category theory and logic in Birmingham. Our researchers in the School of Computer Science include Martin Escardo, Dan Ghica, Achim Jung, me, Uday Reddy, Eike Ritter, Steve Vickers and Hayo Thielecke. Please feel free to ask any questions. regards, Paul -- Paul Blain Levy School of Computer Science, University of Birmingham +44 (0)121 414 4792 http://www.cs.bham.ac.uk/~pbl ------------------------------------------------------------------------------------------------------- Birmingham Fellows: +++++++++++++++ The University of Birmingham is making a major investment to recruit post-doctoral fellows of the very highest calibre. We are conducting a global search to recruit up to 50 Birmingham Fellows in priority and interdisciplinary areas across the university. The Birmingham Fellows will be outstanding post-doctoral researchers who are on a trajectory to become the next generation of research and academic leaders. The Birmingham Fellowships have been designed to support the Fellows as they establish themselves as rounded and mature academics at the University of Birmingham.The Fellowships will be five-year appointments, giving the Fellows the time they need to engage in serious research and to establish themselves within the academic community at Birmingham, nationally and internationally. Fellows who meet their potential and perform according to the expectations agreed at the beginning of their fellowship term will be offered a permanent post at the end of the fellowship term. Although research-focused, Fellows will be appointed to research and teaching contracts, reflecting our commitment to teaching as an integral part of an academic career. At the start of the Fellowship period, the emphasis will be on consolidating an already-outstanding research trajectory, but Fellows will be expected to engage in PhD supervision and to develop a growing teaching portfolio over their five-year term. Fellows will not be expected to engage in substantive academic management or administration during their Fellowship term. The School of Computer Science, The University of Birmingham, UK ++++++++++++++++++++++++++++++++++++++++++++++++++ Computer Science at Birmingham dates back to the late 1950?s with the School of Computer Science becoming one of the first academic departments in the UK to undertake research and teaching in this field. The School has around 40 academic staff, 25 research fellows, 80 PhD students and approximately 400 undergraduate and postgraduate students. Our research programmes are supported by a wide range of bodies, including UK and EU research councils, overseas governments and universities and UK and multi-national companies.The School is proud to provide and sustain a lively and purposeful research culture. It is ranked in the top ten UK computer science departments by the Research Evaluation Exercise 2008, conducted by the UK government. Within the School of Computer Science there are strong groups working on Nature-Inspired and Intelligent Computation, Intelligent Robotics, Computing Systems, Theoretical Computer Science, Software Engineering, Medical Imaging, and Human-Computer Interaction. There is considerable interaction between different areas, and several people work in two or more groups. The School has no divisive fragmentation into separately managed subgroups, and maintains a friendly and collaborative atmosphere with a highly consultative management style. There are normally three or four research seminars each week, with a good balance between visiting and internal speakers and between formality and informality. A significant proportion of the School's budget is used for research support, including provision for modern computing facilities, a school library to complement the main university library, funding or travel for conferences, regular visiting seminar speakers, and guest positions. Birmingham Fellows at the School of Computer Science +++++++++++++++++++++++++++++++++++++++++ Outstanding candidates in all fields of computer science are welcome to apply as long as they can demonstrate how their work will complement and enhance excellence at the school. In particular, we invite outstanding applicants in areas related to the school research strength: Nature-Inspired and Intelligent Computation: The main interests of this group are natural computation, machine learning and data mining, medical image interpretation, theorem proving. Intelligent Robotics: Interests include computer vision, recognition, task planning, reasoning under uncertainty, and cognitive architectures. Computer Security: The research interests of this group include security protocols, access control systems, applied cryptography, software security. Theoretical Computer Science: The focus of this group is on mathematical foundations of computer science such as domain theory, exact numerical computation, computational logic and logic of topology and toposes, as well as on the semantics and formal methods for programming languages. Foundational Theory of Computation: programming languages and semantics (including concurrent systems); domain theory and applications of topology to computation (for example, exact real-number computation); topos theory (especially as applied to quantum physics and quantum computation). Logic and Algebra: algebraic structures (such as loops and quasi-groups); computational algebra and theorem-proving; logic and model-checking (with applications to security); topological aspects of logic. Algorithms: optimization and heuristic search (design of algorithms and their run-time analysis); theory of evolutionary computation; data analysis and data mining. Software Engineering: Cloud software engineering, requirements, software architectures, model-driven engineering, automated software engineering and tools, security software engineering, search-based software engineering, and/or robotics software engineering. Medical Imaging and Interpretation: focus on optical imaging for the detection of skin cancer, early signs of retinopathies, colon and breast cancer; optical tomographic imaging of the human brain and multi-modality imaging, and image coregistration. Human-Computer Interaction: including mobile computing; interaction technologies; usability and design; research on natural language processing and understanding; document and text analysis. For more information about the school: http://www.cs.bham.ac.uk/ Further particulars and how to apply to be a Birmingham Fellow: http://www.birmingham.ac.uk/staff/excellence/fellows/apply/index.aspx From wcook at cs.utexas.edu Sat Aug 13 10:22:04 2011 From: wcook at cs.utexas.edu (William Cook) Date: Sat, 13 Aug 2011 09:22:04 -0500 Subject: [TYPES/announce] Onward! 2011 Call for Essay Workshop (NEW) Message-ID: <4E46888C.5070001@cs.utexas.edu> Note: Onward! did not accept any Essays this year. In order to encourage more essayists, Onward! is issuing a special call for an Onward! Essay Workshop http://onward-conference.org/2011/essays-call.html October 23, 2011 Co-located with ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'11) Portland, Oregon Sponsored by ACM SIGPLAN Onward! is looking for ideas ? interesting, challenging, and provocative ideas ? and are looking to Onward! Essays to provide them. While SPLASH and Onward! authors are adept at writing technical papers, the essay form has proven to be more elusive. This year the Essays Track will take the form of a writer?s workshop. Authors are invited to submit a proto-essay, a draft, of their idea. Selection for the workshop will be simple: does the idea look interesting and does the draft show potential. We will also ask if the author is committed to the development of the idea and completion of the draft at the workshop. There are no absolute limits as to page length but authors should heed the following guidelines. Two-to-three pages are probably ideal. Less than one page hints that the idea is insufficiently conceived. Four pages is close to the limit for valuable and detailed feedback. Ideas that make it through the workshop and become essays will be published in the ACM Digital Library as part of the Onward! Companion. == Important Dates: == Friday September 23rd ? Ideas submitted. (Early submission is encouraged. You will receive prompt notification and feedback that would allow for revision and resubmission before the final deadline - if necessary.) Friday September 30 ? Final notification of acceptance. Wednesday October 5 - Accepted Author(s) must register to attend. Monday, October 10 ? Workshop groups formed, authors supplied with copies of all essays in their group. Sunday October 23: Essay Workshop at SPLASH, 1-5pm Thursday October 27: Essay Presentations at SPLASH (Time TBD) == Submission == Essay drafts should be sent directly to the Essay Committee Chair - Dr. David West atprofwest at fastmail.fm == Discussion == If you wish more background for composing your draft, consider Robert Atwan's comments on writing essays, especially the second paragraph. The point of the workshop is to help authors, and readers, use the essay as "an act of discovery, an opportunity to say [think] something they had never before thought of saying." "Years ago, when I was instructing college freshmen in the humble craft of writing essays - or "themes," as we called them - I noticed that many students had already been taught how to manufacture the Perfect Theme. It began with an introductory paragraph that contained a "thesis statement" and often cited someone named Webster; it then pursued its expository path through three paragraphs that "developed the main idea" until it finally reached a "concluding" paragraph that diligently summarized all three previous paragraphs. The conclusion usually began, "Thus we see that?." If the theme told a personal story, it usually concluded with the narrative cliche, "Suddenly I realized that?." Epiphanies abounded. What was especially maddening about the typical five-paragraph theme had less to do with its tedious structure than with its implicit message that writing should be the end product of thought and not the enactment of its process. My students seemed unaware that writing could be an act of discovery, an opportunity to say something they had never before thought of saying. The worst themes were largely the products of premature conclusions, of unearned assurances, of minds made up.? So perhaps it did make more sense to call these productions themes and not essays, since what was being written had almost no connection with the original sense of "essaying" - trying out ideas and attitudes, writing out of a condition of uncertainty, of not-knowing?. The five-paragraph theme was also a charade. It not only paraded relentlessly to its conclusion, it began with its conclusion. It was all about its conclusion. Its structure permitted no change of direction, no reconsideration, no wrestling with ideas. It was - and still is - the perfect vehicle for the sort of reader who likes to ask: "And your point is?." -- William Cook Associate Professor, Computer Science University of Texas at Austin From ccshan at post.harvard.edu Sat Aug 13 11:00:57 2011 From: ccshan at post.harvard.edu (Chung-chieh Shan) Date: Sat, 13 Aug 2011 11:00:57 -0400 Subject: [TYPES/announce] ML Workshop: register early by August 15 Message-ID: <20110813150057.GE16191@mantle.bostoncoop.net> ACM SIGPLAN Workshop on ML Sunday, 18 September 2011, Tokyo, Japan (co-located with ICFP) http://conway.rutgers.edu/ml2011/ CALL FOR PARTICIPATION * Early Registration deadline is August 15! * The ML family of programming languages includes dialects known as Standard ML, Objective Caml, and F#. These languages have inspired a large amount of computer-science research, both practical and theoretical. This workshop aims to provide a forum for discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of ML 2011 will continue the return in 2010 to a more informal model: a workshop with presentations selected from submitted abstracts. Presenters will be invited to submit working notes, source code, and extended papers for distribution to the attendees, but 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. INVITED SPEAKERS Naoki Kobayashi (Tohoku University) Atsushi Ohori (Tohoku University) ACCEPTED TALKS Efficiently scrapping boilerplate code in OCaml Dmitri Boulytchev, Sergey Mechtaev Implementing implicit self-adjusting computation (short talk) Yan Chen, Joshua Dunfield, Matthew A. Hammer, Umut A. Acar Lightweight typed customizable unmarshaling Pascal Cuoq, Damien Doligez, Julien Signoles Adding GADTs to OCaml: the direct approach Jacques Garrigue, Jacques Le Normand A demo of Coco: a compiler of monadic coercions in ML (short talk) Nataliya Guts, Michael Hicks, Nikhil Swamy, Daan Leijen Verifying liveness properties of ML programs M. M. Lester, R. P. Neatherway, C.-H. L. Ong, S. J. Ramsay MixML remixed Andreas Rossberg, Derek Dreyer Report on OCaml type debugger Kanae Tsushima, Kenichi Asai Camomile: a Unicode library for OCaml (short talk) Yoriyuki Yamagata PROGRAM COMMITTEE Amal Ahmed (Indiana University) Andrew Tolmach (Portland State University) Anil Madhavapeddy (University of Cambridge) Chung-chieh Shan (chair) Joshua Dunfield (Max Planck Institute for Software Systems) Julia Lawall (University of Copenhagen) Keisuke Nakano (University of Electro-Communications) Martin Elsman (SimCorp) Walid Taha (Halmstad University) STEERING COMMITTEE Eijiro Sumii (chair) (Tohoku University) Andreas Rossberg (Google) Jacques Garrigue (Nagoya University) Matthew Fluet (Rochester Institute of Technology) Robert Harper (Carnegie Mellon University) Yaron Minsky (Jane Street) -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 190 bytes Desc: Digital signature URL: From manuel.mazzara at newcastle.ac.uk Sun Aug 14 05:15:34 2011 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Sun, 14 Aug 2011 10:15:34 +0100 Subject: [TYPES/announce] Last CFP: SAC 2012 track on Service-Oriented Architectures and Programming In-Reply-To: <64AAE0CF1D20CD4185CC828F6A8EBA306677422AEF@EXSAN01.campus.ncl.ac.uk> References: <64AAE0CF1D20CD4185CC828F6A8EBA306677422AEE@EXSAN01.campus.ncl.ac.uk>, <64AAE0CF1D20CD4185CC828F6A8EBA306677422AEF@EXSAN01.campus.ncl.ac.uk> Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA306677422AF1@EXSAN01.campus.ncl.ac.uk> SOAP Service-Oriented Architectures and Programming http://www.itu.dk/acmsac2012-soap/ ACM SAC 2012 For the past twenty-seven 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 2012 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Trento, Italy. 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 different 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) August 31, 2011: Paper submissions October 12, 2011: Author notification November 2, 2011: Camera-Ready Copy March 25-29, 2012: 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 2012 Website: http://www.acm.org/conferences/sac/sac2012/ 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. PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Maurice ter Beek, ISTI-CNR, Pisa (Italy) Jesper Bengtson, IT University of Copenhagen (Denmark) Roberto Bruni, University of Pisa (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Tim Hallwyl, Visma Sirius (Denmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Marcello La Rosa, Queensland University of Technology (Australia) Francisco Martins, University of Lisbon (Portugal) Michele Mazzucco, University of Tartu (Estonia) Hernan Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Engineering Ingegneria Informatica S.p.A. (Italy) Paolo Missier, Newcastle University (UK) Bardia Mohabbati, Simon Fraser University (Canada) Kevin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Rosario Pugliese, University of Firenze (Italy) Jean-Bernard Stefani, INRIA Grenoble (France) Emilio Tuosto, University of Leicester (UK) Mirko Viroli, University of Bologna (Italy) Olaf Zimmermann, IBM Research - Zurich (Switzerland) Sebastian Wieczorek, SAP (Germany) Peter Wong, Fredhopper - Amsterdam (Netherlands) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com IT University of Copenhagen, Denmark / italianaSoftware s.r.l., Italy From pangjun at gmail.com Tue Aug 16 08:23:40 2011 From: pangjun at gmail.com (Jun PANG) Date: Tue, 16 Aug 2011 14:23:40 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at SAC'12: last CfP (deadline Aug. 31) Message-ID: ================================================== 27th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 25 - 29, 2012, Riva del Garda (Trento), Italy More information: http://www.win.tue.nl/sacsvt12/ and http://www.acm.org/conferences/sac/sac2012/ =================================================== Important dates --------------- * August 31th 2011: Submission deadline * October 12th 2011: Notification of acceptance/rejection * November 2nd 2011: 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-six years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2012 is sponsored by SIGAPP and will be hosted by the Microsoft Research - University of Trento Researcher Centre for Computational and Systems Biology, at Riva del Garda (Trento), Italy. 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/sac2012/. 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 2012 proceedings. A special issue of Innovations in Systems and Software Engineering (ISSE) has been. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of ISSE. Program committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Chris Hankin, Imperial College, UK 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, Oxford University, UK Martin Steffen, University of Oslo, Norway Marielle Stoelinga, University of Twente, the Netherlands Tim Willemse, Eindhoven University of Technology, The Netherlands From gabriel at info.uaic.ro Tue Aug 16 15:00:09 2011 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Tue, 16 Aug 2011 22:00:09 +0300 (EEST) Subject: [TYPES/announce] Call for Participation MeCBIC 2011 (Fontainebleau, 23 August) Message-ID: =============================================================== CALL FOR PARTICIPATION 5th Workshop on Membrane Computing and Biologically Inspired Process Calculi 23rd August 2011, Fontainebleau, France http://www.info.uaic.ro/~mecbic/mecbic2011 =============================================================== All papers and more information are available from the above web site. INVITED TALKS: * Reversibility in Massive Concurrent Systems Luca Cardelli, Cosimo Laneve * Petri Nets and Bio-Modelling - and how to benefit from their synergy Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg CONTRIBUTED TALKS: * A Testing Framework for P Systems Roberto Barbuti, Diletta Romana Cacciagrano, Andrea Maggiolo-Schettini, Paolo Milazzo, Luca Tesei * A Spatial Calculus of Wrapped Compartments Livio Bioglio, Cristina Calcagno, Mario Coppo, Ferruccio Damiani, Eva Sciacca, Salvatore Spinella, Angelo Troina * Brane Calculi Systems: A Static Preview of their Possible Behaviour Chiara Bodei, Linda Brodo * Synchronization of P Systems with Simplex Channels Radu Nicolescu, Ionut-Mihai Niculescu, Liviu Stefan, Florentin Ipate * Further Results on Languages of Membrane Structures H. Ramesh, Raghavan Rama, Marian Gheorghe, Shankara Narayanan Krishna * Generalized Communicating P Systems Working in Fair Sequential Mode Antoine Spicher, Sergey Verlan * Abstracting Asynchronous Multi-Valued Networks: An Initial Investigation Jason Steggles * Multiscale Modelling: A Mobile Membrane Approach Federico Buti, Massimo Callisto De Donato, Flavio Corradini, Emanuela Merelli, Luca Tesei * Modelling of Genetic Regulatory Mechanisms with GReg Nicolas Sedlmajer, Didier Buchs, Steve Hostettler, Alban Linard, Edmundo Lopez, Alexis Marechal * Time-Lengths in Time Petri Net Models for Steady States in Biochemical Systems. Louchka Popova-Zeugmann and Elisabeth Pelz. REGISTRATION: We estimate the registration fee around 90 euro; it could be paid by cash (paying with credit card is not supported at the venue of the workshop) in the morning of the workshop. *** Programme Committee *** * Bogdan Aman, Iasi, RO * Roberto Barbuti, Pisa, Italy * Marco Bernardo, Urbino, Italy * Paola Bonizzoni, Milano, Italy * Gabriel Ciobanu, Iasi, RO (chair) * Jean-Louis Giavitto, Paris, France * S.N. Krishna, Mumbai, India * Jean Krivine, Paris, France * Paolo Milazzo, Pisa, Italy * Gethin Norman, Glasgow, UK * Andrew Phillips, Cambridge, UK * G. Michele Pinna, Cagliari, Italy * Franck Pommereau, Evry, France * Jason Steggles, Newcastle, UK * Angelo Troina, Torino, Italy * Sergey Verlan, Paris, France * Gianluigi Zavattaro, Bologna, Italy ****************************************** From Robert.Atkey at cis.strath.ac.uk Wed Aug 17 07:09:19 2011 From: Robert.Atkey at cis.strath.ac.uk (Robert Atkey) Date: Wed, 17 Aug 2011 12:09:19 +0100 Subject: [TYPES/announce] 6 Month Postdoc Position Message-ID: <1313579359.1960.2.camel@quicksilver> 6 Month Postdoc Position Mathematically Structured Programming Group University of Strathclyde Scotland We have the potential to apply for funds for a 6 month post doctoral position. The idea is that the successful candidate would spend those 6 months writing a full scale grant to fund themselves for the next 3 years. The postdoctoral position would be within the Mathematically Structured Programing group at the University of Strathclyde whose research focusses on category theory, type theory and functional programming. Current staff include Neil Ghani, Patricia Johann, Conor McBride, Peter Hancock, Robert Atkey and 6 PhD students. The candidate we are looking for should be highly self motivated and appreciate that without beauty, we are lost. Unfortunately, the deadline is extremely short and so any interested candidates should contact me immediately. I can then tell you more about what we would need to do. >From more information, please contact: Professor Neil Ghani ng at cis.strath.ac.uk http://personal.cis.strath.ac.uk/~ng/ http://msp.cis.strath.ac.uk/ From f.rabe at jacobs-university.de Wed Aug 17 08:40:09 2011 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Wed, 17 Aug 2011 14:40:09 +0200 Subject: [TYPES/announce] Call for Participation: LFMTP/MLPA, August 26, Nijmegen Message-ID: [Note the change of date for LFMTP] The 6th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2011) http://lfmtp11.cs.umn.edu/ and The 3rd Workshop on Modules and Libraries for Proof Assistants (MLPA-11) http://kwarc.info/frabe/events/mlpa-11/ will take place jointly August 26, 2011 Nijmegen, The Netherlands after the Conference on Interactive Theorem Proving (ITP 2011) Invited speakers * Henk Barendregt * Derek Dreyer * Aleksandar Nanevski * Michael Norrish The combined LFMTP/MLPA workshop offers a joint program and joint registration for the LFMTP and MLPA workshops affiliated with ITP. Program: http://lfmtp11.cs.umn.edu/Site/Programme.html Registration: http://itp2011.cs.ru.nl/ITP2011/Registration_-_Open.html Organizers * Herman Geuvers * Gopalan Nadathur * Florian Rabe * Carsten Schuermann From ggrov at staffmail.ed.ac.uk Wed Aug 17 11:24:42 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Wed, 17 Aug 2011 16:24:42 +0100 Subject: [TYPES/announce] VSTTE 2012: Final Call for Papers - Submission Deadline: August 31 Message-ID: <8875E944-67DA-4D60-9FBA-15E4893D3724@staffmail.ed.ac.uk> 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 will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter M?ller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Sup?rieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Universit? Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter M?ller, ETH Zurich Tobias Nipkow, Technische Universit?t M?nchen Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Universit? Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From A.M.Silva at cwi.nl Wed Aug 17 12:18:48 2011 From: A.M.Silva at cwi.nl (A.M.Silva at cwi.nl) Date: Wed, 17 Aug 2011 18:18:48 +0200 Subject: [TYPES/announce] CMCS 2012: First call for papers Message-ID: <20110817161848.GA3586@doorgang.cwi.nl> [- Apologies for multiple copies -] ------------------------------------------------------------------------------ CMCS 2012 call for papers ------------------------------------------------------------------------------ The 11th International Workshop on Coalgebraic Methods in Computer Science 31 March - 1 April 2012, Tallinn, Estonia (co-located with ETAPS 2012) www.coalg.org/cmcs12 *** Proceedings to be published in Springer LNCS *** Aims and scope -------------- In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and probabilistic variants), Markov chains, and game-based systems, can be treated uniformly as coalgebras. Coalgebra has developed into a field of its own interest presenting a deep mathematical foundation, a growing field of applications, and interactions with various other fields such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal and description logics, artificial intelligence, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). Keynote Speaker --------------- Samson Abramsky, Oxford University, UK Invited Speakers ---------------- Marcello Bonsague, Leiden University, The Netherlands Pawel Sobocinski, University of Southampton, UK Submissions ----------- Submission is electronic via the easychair system at http://www.easychair.org/conferences/?conf=cmcs2012 following the submission guidelines below. We solicit two types of contributions: (a) Regular papers to be evaluated by the PC for publication in the proceedings: They must have a length no greater than 20 pages, formatted in LNCS style (http://www.springer.de/comp/lncs/authors.html). They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. (b) Short contributions: These will not be published in the proceedings but will be bundled in a technical report. They should be no more than two pages in LNCS format and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Proceedings Publication ----------------------- The proceedings of CMCS 2012 will be published in Springer Lecture Notes in Computer Science. The final proceedings will be published post-conference and feature revised versions of the accepted regular papers. Preliminary proceedings will be made available at the conference in electronic form. Depending on the number and quality of submissions, we will consider publishing extended and revised papers as a journal special issue, subject to the usual reviewing procedure. Previous special issues of CMCS have appeared in high-ranking journals including Information and Computation and Theoretical Computer Science. Important dates --------------- * 10 January 2012: strict submission deadline regular papers * 13 February 2012: notification regular papers * 15 February 2012: deadline early registration * 20 February 2012: final version * 27 February 2012: strict submission deadline short contributions * 6 March 2010: notification short contributions * 31 March - 1 April 2012: the workshop Programme Committee ------------------- Luis Barbosa, University of Minho, Braga, Portugal Filippo Bonchi, LIP ENS-Lyon, France Josee Desharnais, Universit? Laval, Canada Mai Gehrke, Radboud University Nijmegen, The Netherlands H. Peter Gumm, University of Marburg, Germany Ichiro Hasuo, University of Tokyo, Japan Patricia Johann, University of Strathclyde, Glasgow, Scotland, UK Ekaterina Komendantskaya, University of Dundee, Scotland, UK Dexter Kozen, Cornell University, Ithaca, NY, USA Dorel Lucanu, Alexandru Ioan Cuza University, Iasi, Romania Stefan Milius, Technical University of Braunschweig, Germany Larry Moss, Indiana University, Bloomington, USA Prakash Panangaden, McGill University, Montreal, Canada Dirk Pattinson, Imperial College London, UK (co-chair) Dusko Pavlovic, Royal Holloway, London, UK Daniela Petrisan, University of Leicester, UK Grigore Rosu, University of Illinois at Urbana-Champaign, USA Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands Luigi Santocanale, University of Provence, Marseille, France Lutz Schr?der, DFKI GmbH, Bremn, Germany (co-chair) Alexandra Silva, CWI, Amsterdam, The Netherlands Ana Sokolova, University of Salzburg, Austria Sam Staton, University of Cambridge, UK Yde Venema, University of Amsterdam, The Netherlands Steering Committee ------------------ Jiri Adamek, Technical University of Braunschweig, Germany Corina Cirstea, University of Southampton, UK H. Peter Gumm (chair), University of Marburg, Germany Bart Jacobs, Radboud University Nijmegen, The Netherlands Alexander Kurz, University of Leicester, UK Marina Lenisa, University of Udine, Italy Ugo Montanari, University of Pisa, Italy Larry Moss, Indiana University, Bloomington, USA Dirk Pattinson, Imperial College London, UK John Power, University of Bath, UK Horst Reichel, Technical University of Dresden, Germany Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands Lutz Schr?der, DFKI GmbH and University of Bremen, Germany . From Klaus.Havelund at jpl.nasa.gov Wed Aug 17 12:51:37 2011 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (318M)) Date: Wed, 17 Aug 2011 09:51:37 -0700 Subject: [TYPES/announce] [fm-announcements] RV'11 San Francisco - Call for Participation In-Reply-To: Message-ID: CALL FOR PARTICIPATION 2nd International Conference on Runtime Verification (RV) September 27 - 30, 2011 San Francisco, California at the Historic Fairmont Hotel http://rv2011.eecs.berkeley.edu ** Early registration deadline: September 4, 2011 ** The 2011 Runtime Verication conference is a forum for researchers and industrial practitioners for presenting theories and tools for monitoring and analysis of software or hardware system executions, as well as a forum for presenting applications of such tools to practical problems. The field is often referred to under different names, such as runtime verification, runtime monitoring, runtime checking, runtime reflection, runtime analysis, dynamic analysis, runtime symbolic analysis, trace analysis, log file analysis, etc. RV can be used for many purposes, such as security or safety policy monitoring, debugging, testing, verification, validation, profiling, fault protection, behavior modification (e.g., recovery), etc. A running system can be abstractly regarded as a generator of execution traces, i.e., sequences of relevant states or events. Traces can be processed in various ways, e.g., checked against formal specifications, analyzed with special algorithms, visualized, etc. RV 2011 is conducted over 4 days. The first day offers 4 tutorials. The remaining three days offer 6 invited talks, and presentation of 28 regular papers, short papers and tool demonstrations. INVITED SPEAKERS: Dawson Engler, Stanford University Title: "Making finite verification of raw C code easier than writing a test case" Cormac Flanagan, University of California, Santa Cruz Title: "Efficient and Precise Dynamic Detection of Destructive Races" Wolfgang Grieskamp, Google Title: "Utilizing Protocol Contracts for Verifying Services in the Cloud" Sharad Malik, Princeton University Title: "Runtime Verification: A Computer Architecture Perspective" Vern Paxson, University of California, Berkeley Title: "Approaches and Challenges for Detecting Network Attacks in Real-Time" Steven P. Reiss, Brown University Title: "What is My Program Doing? Program Dynamics in Programmer's Terms" TUTORIALS: - Internal versus External DSLs for Trace Analysis by: Howard Barringer and Klaus Havelund - Runtime Monitoring of Time-sensitive Systems by: Borzoo Bonakdarpour and Sebastian Fischmeister - Teaching Runtime Verification by: Martin Leucker - Predicting Concurrency Failures in Generalized Traces of x86 Executables by: Chao Wang and Malay Ganai VENUE: The accommodation and conference venue is the Historic Fairmont Hotel, San Francisco, California, USA. A special rate has been secured for a limited number of rooms at this gorgeous venue. The hotel reservation cut-off date is September 6, 2011. Please see the conference website for further details: http://rv2011.eecs.berkeley.edu/Book_Hotel.html REGISTRATION: The registration is open at: http://rv2011.eecs.berkeley.edu/Registration.html - Early registration fee, before or on 4 September: $575 - Late registration fee, after 4 September: $725 - Tutorial registration fee is $200 before or on September 4 and $300 after that STUDENTS: RV 2011 is providing a discount of $150 on the registration fee to students. ORGANIZATION: Program Chairs: - Sarfraz Khurshid, University of Texas at Austin, USA - Koushik Sen, University of California, Berkeley, USA Local organization chairs: - Jacob Burnim, University of California, Berkeley, USA - Nicholas Jalbert, University of California, Berkeley, USA RV Steering Committee: - Howard Barringer, University of Manchester, UK - Klaus Havelund, NASA/JPL, USA - Gerard Holzmann, NASA/JPL, USA - Insup Lee, University of Pennsylvania, USA - Grigore Rosu, University of Illinois at Urbana-Champaign, USA - Oleg Sokolsky, University of Pennsylvania, USA SPONSORS: RV 2011 is sponsored by: - Microsoft Research - The ARTIST Network of Excellence on Embedded Systems Design - Intel - Google - The Penn Research in Embedded Computing and Integrated Systems - Laboratory for Reliable Software at the Jet Propulsion Laboratory We look forward to welcoming you at the 2nd International Conference on Runtime Verification. ========================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From Yves.Bertot at inria.fr Fri Aug 19 22:41:43 2011 From: Yves.Bertot at inria.fr (bertot) Date: Sat, 20 Aug 2011 04:41:43 +0200 Subject: [TYPES/announce] CfPart: School on Formalization of Mathematics (March 12-16, 2012, Sophia Antipolis, France) Message-ID: <4E4F1EE7.4000103@inria.fr> International Spring School on FORMALIZATION OF MATHEMATICS Sophia Antipolis, France March 12-16, 2012 http://www.inria.fr/sophia/marelle/Map-Spring-School.html 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 practicionner 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-colour 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 aim of this school is to give mathematicians and mathematically inclined researchers the keys to the Coq system and the Mathematical Components library. The topics covered are: Formal proof techniques Structuration of libraries Encoding of common mathematical structures Formal description of algorithms An overview of advanced projects: * The odd order theorem * Constructive algebraic topology * Kepler's conjecture, * Computational analysis, * Foundational investigations. 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. Speakers The current list of speakers is: Georges Gonthier (Microsoft Research) Thomas C. Hales (University of Pittsburgh) Julio Rubio (Universidad de La Rioja) Bas Spitters (Radboud Universiteit, Nijmegen) Vladimir Voevodsky (Institute for advanced study, Princeton) Yves Bertot (INRIA) Assia Mahboubi (INRIA) Laurence Rideau (INRIA) Enrico Tassi (MSR-INRIA common laboratory) Laurent Th?ry (INRIA) Registration The expected registration fee will be between 150 and 200 Euros. Information about registration will be available in the page around september 2011. http://www.inria.fr/sophia/marelle/Map-Spring-School.html From peterol at ifi.uio.no Tue Aug 23 06:09:53 2011 From: peterol at ifi.uio.no (=?iso-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Tue, 23 Aug 2011 12:09:53 +0200 Subject: [TYPES/announce] FACS 2011: First Call for Participation Message-ID: <5EB019EF-CE39-4D88-97E3-95BC28B4E386@ifi.uio.no> --------------------------------------------------------------------- Call for Participation FACS 2011 8th International Symposium on Formal Aspects of Component Software Oslo, Norway, September 14-16, 2011 http://facs2011.ifi.uio.no --------------------------------------------------------------------- *** Early registration deadline: September 2 *** FACS 2011 is concerned with the application of formal methods in component-based and service-oriented software development. FACS 2011 is hosted by the Department of Informatics at the University of Oslo. Oslo is the capital city of Norway, and is mentioned as one of the "31 places to go to in 2010" by The New York Times. Invited speakers: Jose Meseguer (University of Illinois at Urbana-Champaign) John Rushby (SRI International) Ketil St?len (SINTEF) Registration: Please register at http://facs2011.ifi.uio.no/index.php?n=General.Registration Early registration deadline: September 2 Accepted appers: The list of accepted papers can be found at http://facs2011.ifi.uio.no/index.php?n=Conference.AcceptedPapers Contact: (web) http://facs2011.ifi.uio.no (email) facs-2011 at ifi.uio.no From giuseppemag at gmail.com Tue Aug 23 10:05:24 2011 From: giuseppemag at gmail.com (Giuseppe Maggiore) Date: Tue, 23 Aug 2011 16:05:24 +0200 Subject: [TYPES/announce] Book on functional programming and game development Message-ID: Hi! I am writing here in the hope that it may be of interest to some; functional programming is very often regarded as a difficult, academic topic with very few fun or realistic applications. I have just finished co-authoring a book, Friendly F#, that shows just how that may not be true. The book aims at teaching the F# language through a series of samples that are fully centered on game development and simulations. Each one of the first 5 chapters describes a problem, shows and discusses its solution in F# and then discusses in depth the constructs used. From this point of view the book is relatively unique, in that it completely focuses on a problem-solution approach where everything is explained because of how well it works in solving the problem, and not just "because". The 5 problems are: - a bouncing ball - the Saturn V rocket - an asteroid field - a large asteroid field optimized with quad trees - a police starship that must fight off a pirate ship attacking a cargo freighter In the first 5 chapters we will learn (listed chapter-by-chapter): - basic control flow, tuples, functions - basic data structures and information flow (records and units of measure) - lists and sequences - trees and discriminated unions - computation expressions (monads) and coroutines to build State Machines and AIs In the last two chapters we will see how to build first a 2D and then a 3D renderer for two of the samples we have seen. These renderers are made in XNA, of which we show the basics in terms of the SpriteBatch, the Model class, input management and audio. The book is recommended for programmers who are already familiar with (at least) an imperative programming language; a little bit of knowledge of object-orientation may help in the latest chapters, but it is by no means required. The book may also be read by complete beginners to programming, but in that case the reader should expect to have to *study* the book and not just read it; studying the materials of the book though is not particularly unexpected, given their origin: both authors teach Computer Science with F# and games at Ca' Foscari University of Venice, and thanks to this we have already battle tested many of the examples and the general approach used in the book. Chapter 5 in particular should be of interested even for advanced (functional) programmers, given the in-depth treatment of computation expressions (monads) for creating small languages embedded inside F#. We are planning on using the book extensively in the classroom next year, and we hope that somebody else can find it of use. If anybody is interested in using the book to try and teach a "fun fun course" (pun intended) then by all means drop me a line at "giuseppemag AT gmail DOT com". The samples may be downloaded freely at: http://fsharpgamedev.codeplex.com/ Best regards, -- Giuseppe Maggiore From pmt6sbc at maths.leeds.ac.uk Wed Aug 24 06:55:20 2011 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Wed, 24 Aug 2011 11:55:20 +0100 (BST) Subject: [TYPES/announce] Computability: Contribute to the Inaugural Issue! Message-ID: Dear Colleagues We plan to launch the inaugural issue of Computability in June 2012, as part of the celebrations of the Alan Turing Centenary! See the announcement of our new journal below! The online submission system should be fully functional by now and we have already received a number of promising submissions that are currently in the reviewing process. However, there is still the opportunity to contribute to the inaugural issue and papers which are submitted by 1 October 2011 have a chance to be considered for the first issue! We are looking forward to all submissions of high quality! Further instructions regarding the electronic submission process are available on our web page: http://www.computability.de/journal/ Regards Vasco Brattka ________________________________________________________________________ COMPUTABILITY The Journal of the Association CiE Now Accepting Submissions! First volume to be published in 2012 as part of the celebrations of the Alan Turing Year http://www.computability.de/journal/ _________________________________________________________________________ Aims and Scope Computability is the journal of the Association Computability in Europe and it is published by IOS Press in Amsterdam. The journal Computability is a peer reviewed international journal that is devoted to publishing original research of highest quality, which is centered around the topic of computability. The subject is understood from a multidisciplinary perspective, recapturing the spirit of Alan Turing (1912-1954) by linking theoretical and real-world concerns from computer science, mathematics, biology, physics, computational neuroscience, history and the philosophy of computing. Editor-in-Chief Vasco Brattka (Cape Town, South Africa) Managing Editors Paola Bonizzoni (Milan, Italy) S. Barry Cooper (Leeds, UK) Benedikt L?we (Amsterdam, The Netherlands) Elvira Mayordomo (Zaragoza, Spain) Editorial Board Samson Abramsky (Oxford, UK) Manindra Agrawal (Kanpur, India) Eric Allender (Piscataway, USA) Jeremy Avigad (Pittsburgh, USA) Arnold Beckmann (Swansea, UK) Olivier Bournez (Palaiseau, France) Alessandra Carbone (Paris, France) Karine Chemla (Paris, France) Bruno Codenotti (Pisa, Italy) Stephen A. Cook (Toronto, Canada) Anuj Dawar (Cambridge, UK) Rodney G. Downey (Wellington, New Zealand) Natasha Jonoska (Tampa, USA) Ulrich Kohlenbach (Darmstadt, Germany) Russell Miller (New York, USA) Andrei Morozov (Novosibirsk, Russia) Prakash Panangaden (Montreal, Canada) Frank Stephan (Singapore) Vlatko Vedral (Oxford, UK) Rineke Verbrugge (Groningen, The Netherlands) Ning Zhong (Cincinnati, USA) Submission Guidelines The journal Computability invites submission of full papers of highest quality on all research topics related to computability. Computability accepts only submissions of original research papers that have not been published previously and that are not currently submitted elsewhere. Full versions of papers that have already been published in conference proceedings are eligible only if the conference version is clearly cited and the full version enhances the conference version significantly. Authors are requested to submit PDF manuscripts electronically via the online submission system. Authors can indicate non-binding wishes regarding Editorial Board Members who should handle their submission. Final versions of accepted papers have to be prepared using the journal style file and they need to be submitted together with all source files. Authors submitting a manuscript do so on the understanding that they have read and agreed to the terms of the IOS Press Author Copyright Agreement and that all persons listed as authors have given their approval for the submission of the paper. _________________________________________________________________________ Members of the Association CiE will have free access to the journal Association CiE: http://www.computability.org.uk/ CiE Membership Application: http://www.cs.swan.ac.uk/acie/ Journal: http://www.computability.de/journal/ _________________________________________________________________________ From carlos.martin at urv.cat Thu Aug 25 11:23:05 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Thu, 25 Aug 2011 17:23:05 +0200 Subject: [TYPES/announce] LATA 2012: 2nd call for papers Message-ID: ********************************************************************* 2nd Call for Papers 6th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2012 A Coru?a, Spain March 5?9, 2012 http://grammars.grlmc.com/LATA2012/ ********************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). VENUE: LATA 2012 will take place in A Coru?a, at the northwest of Spain. The venue will be the Faculty of Computer Science, University of A Coru?a. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: ? algebraic language theory ? algorithms for semi?structured data mining ? algorithms on automata and words ? automata and logic ? automata for system analysis and programme verification ? automata, concurrency and Petri nets ? automatic structures ? cellular automata ? combinatorics on words ? computability ? computational complexity ? computational linguistics ? data and image compression ? decidability questions on words and languages ? descriptional complexity ? DNA and other models of bio?inspired computing ? document engineering ? foundations of finite state technology ? foundations of XML ? fuzzy and rough languages ? grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) ? grammars and automata architectures ? grammatical inference and algorithmic learning ? graphs and graph transformation ? language varieties and semigroups ? language?based cryptography ? language?theoretic foundations of artificial intelligence and artificial life ? parallel and regulated rewriting ? parsing ? pattern recognition ? patterns and codes ? power series ? quantum, chemical and optical computing ? semantics ? string and combinatorial issues in computational biology and bioinformatics ? string processing algorithms ? symbolic dynamics ? symbolic neural networks ? term rewriting ? transducers ? trees, tree languages and tree automata ? weighted automata STRUCTURE: LATA 2012 will consist of: ? 3 invited talks ? 2 invited tutorials ? peer?reviewed contributions INVITED SPEAKERS: Eugene Asarin (Paris 7) Bernard Boigelot (Li?ge) Gilles Dowek (INRIA), tutorial Rodney Downey (Wellington), tutorial Jack Lutz (Iowa State) PROGRAMME COMMITTEE: Eric Allender (Rutgers) Miguel ?. Alonso (A Coru?a) Amihood Amir (Bar?Ilan) Dana Angluin (Yale) Franz Baader (Dresden) Patricia Bouyer (Cachan) John Case (Delaware) Volker Diekert (Stuttgart) Paul Gastin (Cachan) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Janusz Kacprzyk (Warsaw) Victor Khomenko (Newcastle) Bakhadyr Khoussainov (Auckland) Claude Kirchner (Paris) Maciej Koutny (Newcastle) Gregory Kucherov (Marne?la?Vall?e) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n?Vide (Tarragona, chair) Giancarlo Mauri (Milano Bicocca) Aart Middeldorp (Innsbruck) Faron Moller (Swansea) Angelo Montanari (Udine) Joachim Niehren (Lille) Mitsunori Ogihara (Miami) Enno Ohlebusch (Ulm) Dominique Perrin (Marne?la?Vall?e) Alberto Policriti (Udine) Alexander Rabinovich (Tel Aviv) Mathieu Raffinot (Paris) J?rg Rothe (D?sseldorf) Olivier H. Roux (Nantes) Yasubumi Sakakibara (Keio) Eljas Soisalon?Soininen (Aalto) Frank Stephan (Singapore) Jens Stoye (Bielefeld) Howard Straubing (Boston) Masayuki Takeda (Kyushu) Wolfgang Thomas (Aachen) Sophie Tison (Lille) Jacobo Tor?n (Ulm) Tayssir Touili (Paris) Esko Ukkonen (Helsinki) Frits Vaandrager (Nijmegen) Manuel Vilares (Vigo) Todd Wareham (Newfoundland) Pierre Wolper (Li?ge) Hans Zantema (Eindhoven) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Miguel ?. Alonso (A Coru?a, co?chair) Adrian Horia Dediu (Tarragona) Carlos G?mez Rodr?guez (A Coru?a) Jorge Gra?a (A Coru?a) Carlos Mart?n?Vide (Tarragona, co?chair) Bianca Truthe (Magdeburg) Jes?s Vilares (A Coru?a) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single?spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0?40209?0?0?0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2012 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer?reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since July 16, 2011 until March 5, 2012. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2012/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On?site registration fees: 580 Euro On?site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by December 5, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before December 5, 2011 (resp. February 24, 2012) to the conference series account at Uno?e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin?Vide ? LATA 2012; account holder?s address: Av. Catalunya, 35, 43002 Tarragona, Spain). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. People claiming early registration will be requested to prove that they gave the bank transfer order by the deadline. On?site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: October 7, 2011 (23:59h, CET) Notification of paper acceptance or rejection: November 18, 2011 Final version of the paper for the LNCS proceedings: November 27, 2011 Early registration: December 5, 2011 Late registration: February 24, 2012 Starting of the conference: March 5, 2012 Submission to the post?conference special issue: June 9, 2012 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2012 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34?977?559543 Fax: +34?977?558386 From georg.granstrom at gmail.com Thu Aug 25 12:59:37 2011 From: georg.granstrom at gmail.com (=?ISO-8859-1?Q?Johan_Georg_Granstr=F6m?=) Date: Thu, 25 Aug 2011 18:59:37 +0200 Subject: [TYPES/announce] Treatise on Intuitionistic Type Theory Message-ID: Hi, I am writing to promote my book "Treatise on Intuitionistic Type Theory", recently published by Springer. This book is based on my PhD thesis, supervised by Per Martin-L?f. Many of the ideas embraced in the book are influenced by Martin-L?f. I imagine that some readers of this list could be sympathetic to such a book and take the liberty to promote it outright. Here is a link to the book's official page: http://www.springer.com/philosophy/book/978-94-007-1735-0 Best regards, - Johan G. Granstr?m From davide at disi.unige.it Fri Aug 26 05:49:32 2011 From: davide at disi.unige.it (Davide Ancona) Date: Fri, 26 Aug 2011 11:49:32 +0200 Subject: [TYPES/announce] OOPS track at SAC 2012: One week deadline extension Message-ID: <4E576C2C.80708@disi.unige.it> Please take note that the deadline extension has been extended to September 7th, 2011. OOPS 2012 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS12 Special Track at the 27th ACM Symposium on Applied Computing, SAC 2012 http://www.acm.org/conferences/sac/sac2012 The Microsoft Research - University of Trento Centre for Computational and Systems Biology (COSBI) Riva del Garda (Trento), Italy March 25-29, 2012 - Important Dates (deadlines are strict) September 7, 2011 <<<<< EXTENDED DEADLINE Paper submission October 12, 2011 Author notification November 2, 2011 Camera-ready copies March 25-29, 2012 SAC 2012 - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, University of Genova, Italy Shigeru Chiba (chiba at is.titech.ac.jp) Tokyo Institue of Technology, Japan Atsushi Igarashi (igarashi at kuis.kyoto-u.ac.jp) Kyoto University, Japan Andy Kellens (akellens at vub.ac.be) Vrije Universiteit Brussel, Belgium - Program Committee (to be completed) * Walter Binder, University of Lugano, Switzerland * Sara Capecchi, University of Torino, Italy * Wei-Ngan Chin, National University of Singapore, Singapore * Erik Ernst, Aarhus University, Denmark * Kathryn Gray, University of Cambridge, UK * Robert Hirschfeld, Hasso-Plattner-Institut, University of Potsdam, Germany * Jaakko J?rvi, Texas A&M University, USA * Doug Lea, Suny Oswego, USA * Hidehiko Masuhara, University of Tokyo, Japan * Sean McDirmid, Microsoft Research Asia, Beijin * Rosemary Monahan, National University of Ireland Maynooth, Ireland * Manuel Oriol, University of York, UK * David Pearce, Victoria University of Wellington, New Zealand * Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea * Ina Schaefer, Technical University Braunschweig, Germany * Jeremy Singer, University of Glasgow, UK - SAC 2012 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 2012 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Trento, Italy. - OOPS Track The object-oriented (OO) paradigm is extensively used to design and implement today's large scale software systems. However, existing OO languages and platforms need to evolve to better support features like interoperability, software reuse, dynamic software adaptation, efficiency on multicore hardware, security, and safety. The aim of OOPS is to foster the development of extensions to existing OO languages and platforms, as well as the design and implementation of new languages and platforms embracing and enhancing the object-oriented paradigm. Particularly of interest for OOPS are papers that provide a thorough analysis covering most of the following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Language design and implementation * Type systems, static analysis, formal methods * Integration with other paradigms * Aspects, components, and modularity * Reflection, meta-programming * Databases and persistence * Distributed, concurrent or parallel systems * Interoperability, versioning and software adaptation Besides being an event expressly organized for researchers in OOP who seek to bridge theory and practice, OOPS at SAC offers the opportunity for exploiting cross-fertilization between the different branches of computer science, and for keeping in touch with recent trends in computer science, since almost all research areas are represented by 34 different tracks. - 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 August 31, 2011. For more information please visit the SAC 2012 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as extended 3-page abstracts in the same proceedings; the **third page** only 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 the conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, we are planning to organize a journal special issue hosting the extended versions of the best papers of the track. From fernandez at iiia.csic.es Fri Aug 26 17:57:37 2011 From: fernandez at iiia.csic.es (Jose Luis Fernandez Marquez) Date: Fri, 26 Aug 2011 23:57:37 +0200 Subject: [TYPES/announce] CFP (Deadline Extended to Sept. 7th) - Coordination Models, Languages and Applications - CM track at ACM SAC 2012 Message-ID: <4E5816D1.9020500@iiia.csic.es> CfP (Extended Deadline): ACM SAC Special Track on Coordination Models, Languages and Applications ----------------------------------------------------------------------- Final CALL FOR PAPERS ----------------------------------------------------------------------- Coordination Models, Languages and Applications Special Track of the 27th Symposium On Applied Computing (SAC 2012) March 25 - 29, 2012, Riva del Garda (Trento), Italy http://sac2012.apice.unibo.it ----------------------------------------------------------------------- IMPORTANT DATES Sep. 7, 2011: Paper submissions (Extended Deadline) Oct. 12, 2011: Author notification Nov. 2, 2011: Camera-Ready Copy ----------------------------------------------------------------------- AIMS& SCOPE Building on the success of the thirteen previous editions (1998-2011), a special track on coordination models, languages and applications will be held at SAC 2012. Over the last decade, we have witnessed the emergence of models, formalisms and mechanisms to describe concurrent and distributed computations and systems based on the concept of coordination. The purpose of a coordination model is to enable the integration of a number of, possibly heterogeneous, components (processes, objects, agents) in such a way that the resulting ensemble can execute as a whole, forming a software system with desired characteristics and functionalities which possibly takes advantage of parallel and distributed systems. The coordination paradigm is closely related to other contemporary software engineering approaches such as multi-agent systems, service-oriented architectures, component-based systems and related middleware platforms. Furthermore, the concept of coordination exists in many other Computer Science areas such as workflow systems, cooperative information systems, distributed artificial intelligence, and Internet technologies. After more than a decade of research, the coordination paradigm is gaining increased momentum in state-of-the-art engineering paradigms such as multi-agent systems and service-oriented architectures: in the first case, coordination abstractions are perceived as essential to design and support the working activities of agent societies; in the latter case, service coordination, orchestration, and choreography are going to be essential aspects of the next generations of systems based on Web services. The Special Track on Coordination Models, Languages and Applications takes a deliberately broad view of what constitutes coordination. Accordingly, major topics of interest this year will include: - Novel models, languages, programming and implementation techniques - Applications - Internet, Web, and pervasive computing coordinated systems - Coordination of multi-agent systems, including mobile agents, intelligent agents, and agent-based simulations - Languages for service description and composition - Models, frameworks and tools for Group Decision Making - All aspects related to Cooperative Information Systems (e.g. workflow management, CSCW) - Software architectures and software engineering techniques - Configuration and Architecture Description Languages - Middleware platforms - Self-organising and nature-inspired coordination approaches - Coordination technologies, systems and infrastructures - Relationship with other computational models such as object oriented, declarative (functional, logic, constraint) programming or their extensions with coordination capabilities - Formal aspects (semantics, type systems, reasoning, verification) - Coordination models and specification in Service-Oriented Architectures, Web Service technologies (orchestration, choreography, etc), and Pervasive Computing. ----------------------------------------------------------------------- PROCEEDINGS Papers accepted for the Special Track on Coordination Models, Languages and Applications will be published by ACM both in the SAC 2012 proceedings and in the Digital Library. A Special Issue on an International Journal (with IF) based on selected papers is planned just after the conference. ----------------------------------------------------------------------- PAPER SUBMISSION All papers should represent original and previously unpublished works that currently are not under review in any conference or journal. The author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. This is to facilitate blind review. Only the title should be shown at the first page without the author's information. Submitted papers must be no longer than 6 pages and in the ACM two-column page format (doc template, pdf template, latex template). It will be possible to have up to 2 extra pages in the proceeding at a charge of $80 per page (total 8 pages maximum). Submission is entirely automated via the STAR Submission System, which is available from the main SAC Web Site:http://www.acm.org/conferences/sac/sac2012/. ----------------------------------------------------------------------- TRACK CO-CHAIR Mirko Viroli, Alma Mater Studiorum - Universita di Bologna, Italy Gabriella Castelli, University of Modena and Reggio Emilia, Italy Jose Luis Fernandez-Marquez, IIIA-CSIC, Spain ----------------------------------------------------------------------- PROGRAM COMMITTEE Farhad Arbab, CWI Amsterdam and Leiden University, Netherlands Marcello Bonsangue, Leiden University, Netherlands Dave Clarke, Katholieke Universiteit Leuven, Belgium Ferruccio Damiani, University of Torino, Italy Rocco De Nicola, University of Firenze, Italy Simon Dobson, University of St Andrews, Scotland Keith Harrison-Broninski, Role Modellers Ltd, UK Manuel Mazzara, Newcastle University, UK Henry Muccini, University of l'Aquila, Italy Andrea Omicini, University of Bologna, Italy Manuel Oriol, University of York, UK Antonio Porto, University of Porto, Portugal Rosario Pugliese, University of Florence, Italy Alessandro Ricci, University of Bologna, Italy Davide Rossi, University of Bologna, Italy Norman Salazar, Artificial Intelligence Research Institute, Spain Michael Ignaz Schumacher, University of Applied Sciences, Switzerland Yasuyuki Tahara, National Institute of Informatics, Japan Carolyn Talcott, SRI International, USA Paul Tarau, University of North Texas, USA Robert Tolksdorf, Freie Universitaet Berlin, Germany Emilio Tuosto, University of Leicester, UK Meritxell Vinyals, Artificial Intelligence Research Institute, Spain George Wells, Rhodes University, South Africa Herbert Wiklicky, Imperial College London, UK Pawel T. Wojciechowski, Poznan University of Technology, Poland Franco Zambonelli, University of Modena and Reggio Emilia, Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From ggrov at staffmail.ed.ac.uk Mon Aug 29 03:59:51 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Mon, 29 Aug 2011 08:59:51 +0100 Subject: [TYPES/announce] VSTTE 2012: Extended deadline for paper submission: September 10 Message-ID: <860397B4-A7A3-4FA0-BFB0-D1A7E7A6801A@staffmail.ed.ac.uk> 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/ (*** NEW SUBMISSION DEADLINE: September 10, 2011 ***) 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 will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES September 10, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter M?ller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Sup?rieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Universit? Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter M?ller, ETH Zurich Tobias Nipkow, Technische Universit?t M?nchen Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Universit? Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From pangjun at gmail.com Mon Aug 29 04:16:27 2011 From: pangjun at gmail.com (Jun PANG) Date: Mon, 29 Aug 2011 10:16:27 +0200 Subject: [TYPES/announce] Software Verification and Testing Track at SAC'12: One week deadline extension Message-ID: ================================================== 27th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 25 - 29, 2012, Riva del Garda (Trento), Italy More information: http://www.win.tue.nl/sacsvt12/ and http://www.acm.org/conferences/sac/sac2012/ =================================================== Important dates --------------- * September 7th 2011: Submission deadline (EXTENDED!!!) * October 12th 2011: Notification of acceptance/rejection * November 2nd 2011: 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-six years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2012 is sponsored by SIGAPP and will be hosted by the Microsoft Research - University of Trento Researcher Centre for Computational and Systems Biology, at Riva del Garda (Trento), Italy. 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/sac2012/. 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 2012 proceedings. A special issue of Innovations in Systems and Software Engineering (ISSE) has been. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of ISSE. Program committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Chris Hankin, Imperial College, UK 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, Oxford University, UK Martin Steffen, University of Oslo, Norway Marielle Stoelinga, University of Twente, the Netherlands Tim Willemse, Eindhoven University of Technology, The Netherlands From md466 at cam.ac.uk Tue Aug 30 18:23:18 2011 From: md466 at cam.ac.uk (Mike Dodds) Date: Tue, 30 Aug 2011 23:23:18 +0100 Subject: [TYPES/announce] Call for Poster Presentations: APLAS 2011 (9th Asian Symposium on Programming Languages and Systems) Message-ID: CALL FOR POSTER PRESENTATIONS The Ninth Asian Symposium on Programming Languages and Systems (APLAS 2011) http://flolac.iis.sinica.edu.tw/aplas11/ 5-7th December 2011 Kenting, Taiwan Deadline for Abstract Submission: 30 September, 2011 APLAS 2011 will include a poster 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. SCOPE: Poster 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, analysis, transformation; - software security, safety, verification; - concurrency, constraints, domain-specific languages; - tools for programming, verification, implementation. FORMAT: A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. If you need more space, contact the poster chair (mike.dodds AT cl.cam.ac.uk). To prepare a good poster, search the Web for "poster presentation" and you will find many useful resources. REGISTRATION INFORMATION: Each presenter should e-mail a 1-2 page abstract in PDF or PostScript to the poster chair (Mike Dodds: mike.dodds AT cl.cam.ac.uk) by September 30th 2011. The abstract should include the title, author(s), affiliation(s), and summary of the work. A LaTeX template is available at http://www.cl.cam.ac.uk/~md466/aplas2011/aplas_poster_template.tex . The program of the poster session will be announced by October 21st, 2011. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. IMPORTANT DATES: - 1-2 pages abstract submission 30th September 2011 - announcement of poster session program 21st October 2011 - conference 5th-7th December 2011 CONTACT INFORMATION: For additional information, clarifications, questions, or special requirements, please contact the APLAS 2011 Poster Chair, Mike Dodds (mike.dodds AT cl.cam.ac.uk). From yahave at cs.technion.ac.il Tue Aug 30 23:56:18 2011 From: yahave at cs.technion.ac.il (Eran Yahav) Date: Wed, 31 Aug 2011 06:56:18 +0300 Subject: [TYPES/announce] The 18th International Static Analysis Symposium (SAS'11) - Call for Participation Message-ID: <4E5DB0E2.7020103@cs.technion.ac.il> The 18th International Static Analysis Symposium September 14-16, Venice, Italy http://sas2011.cs.technion.ac.il Static Analysis is increasingly recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The Eighteenth International Static Analysis Symposium (SAS 2011) will be held in Venice, Italy. * Invited Speakers Jerome Feret, Ecole Normale Superieure, France Daniel Kaestner, AbsInt, Germany Ken McMillan, Microsoft Research John Mitchell, Stanford Sriram Rajamani, Microsoft Research India * Co-located Workshops The International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2011) - September 13th The International Workshop on Static Analysis and Systems Biology (SASB 2011) - September 13th The International Workshop on Tools for Automatic Program AnalysiS (TAPAS 2011) - September 17th * Registration http://sas2011.cs.technion.ac.il/registration.html * Hotel Information Being mid September very high season, participants must book the lodging for their stay as soon as possible. http://sas2011.cs.technion.ac.il/hotels.html From a.ricci at unibo.it Thu Sep 1 09:39:14 2011 From: a.ricci at unibo.it (Alessandro Ricci) Date: Thu, 1 Sep 2011 13:39:14 +0000 Subject: [TYPES/announce] Final CFP: AGERE! @ SPLASH 2011 - Typing Actors and Agents at SPLASH Message-ID: <2603B7A7-BF6C-4465-8FC5-63222A7DCA20@unibo.it> FINAL CALL FOR PAPERS AGERE! @ SPLASH - International ACM SPLASH 2011 Workshop on Programming Systems, Languages, and Applications based on Actors, Agents, and Decentralized Control Important Dates: Paper Submission: Friday, 9 September 2011 Notification: Monday, 3 October 2011 Final version: Monday, 10 October 2011 Demo submission: Friday, 9 September 2011 Demo notification: Monday, 19 September 2011 Workshop date: Monday, 24 October 2011 ABSTRACT: The fundamental turn of software into concurrency and distribution is not only a matter of performance, but also of design and abstraction, calling for programming paradigms that would allow more naturally than the current ones to think, design, develop, execute, debug and profile programs exhibiting different degrees of concurrency, reactiveness, autonomy, decentralization of control, distribution. This workshop aims at exploring programming approaches explicitly providing a level of abstraction that promotes a decentralized mindset in solving problems and programming systems. To this end, the abstractions of agents and actors (and systems of agents and actors) are taken as a natural reference: the objective of the workshop is then to foster the research in all aspects of agent-oriented programming and actor-oriented programming as evolution of mainstream paradigms (such as OOP), including 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. Read more at: http://agere2011.apice.unibo.it "Start the workshop Now!" - join the group: https://groups.google.com/group/agere-at-splash to contribute to ongoing discussions about the AGERE! topics and workshop organization ORGANIZING COMMITTEE Gul Agha, University of Illinois at Urbana-Champaign, USA Rafael H. Bordini, Federal University of Rio Grande do Sul, Brazil Alessandro Ricci, University of Bologna, Italy PROGRAM COMMITTEE (in alphabetic order, to be completed) Gul Agha, University of Illinois at Urbana-Champaign, USA Joe Armstrong, SICS / Ericsson, Sweden Olivier Boissier, LSTI ENS Mines Saint-Etienne, France Rafael Bordini, Federal University of Rio Grande do Sul, Brazil Jean-Pierre Briot, LIP6, Paris 6, France Rem Collier, UCL, Dublin Mehdi Dastani, Utrecht University, The Netherlands Jurgen Dix, Technical University of Clausthal, Germany Koen Hindriks, Delft University of Technology, The Netherlands Tom Holvoet, Dept. Computer Science K.U.Leuven, Belgium Jomi Hubner, Federal University of Santa Catarina, Brazil Joao Leite, New University of Lisbon, Portugal Jamali Nadeem, University of Saskatchewan, Saskatoon, Canada Ravi Pandya, Microsoft Jens Palsberg, UCLA, Los Angeles, USA Alessandro Ricci, University of Bologna, Italy Birna van Riemsdijk, Delft University of Technology, The Netherlands Giovanni Rimassa, Whitestein Technologies Amal El Fallah Seghrouchni, LIP6 - University Pierre and Marie Curie Munindar Singh, North Carolina State University, USA Akinori Yonezawa, University of Tokyo, Japan ... From nickie at softlab.ntua.gr Fri Sep 2 08:39:06 2011 From: nickie at softlab.ntua.gr (Nikolaos S. Papaspyrou) Date: Fri, 02 Sep 2011 15:39:06 +0300 Subject: [TYPES/announce] Postdoctoral and PhD positions at NTUA/ICCS Message-ID: <4E60CE6A.5080705@softlab.ntua.gr> Applications are now invited for: - one postdoctoral position (total budget: 21K?/year), and - up to three Ph.D. positions (total budget: 17K?/year) at the National Technical University of Athens (NTUA), School of Electrical and Computer Engineering (ECE), in collaboration with the Institute of Communication and Computer Systems (ICCS). Preference will be given to filling the postdoctoral position. The decision to fill all Ph.D. positions will depend on the applicants' qualifications. All positions will be funded by the three-year FP7-ICT-2011-7 project "RELEASE: A High-level Paradigm for Reliable Large-scale Server Software". The successful applicants will join the research team of the Software Engineering Laboratory, under the supervision of Assist. Prof. Nikolaos Papaspyrou and Assoc. Prof. Konstantinos Sagonas. The postdoc will not have any teaching duty. The start date can be as early as October 2011. Requirements: ------------- Applicants should have an undergraduate degree and, in the case of the postdoctoral position, a recent Ph.D. in Computer Science or a closely related field. They should have a strong background in programming languages and operating systems, with emphasis on the following fields: functional programming, compiler construction, virtual machines, concurrency, parallelism, program analysis. Knowledge of Greek is a plus but not a prerequisite. English is our working language for research. How to apply: ------------- Prospective applicants are requested to send an email containing a short letter of interest, a CV, and references for recommendations to Assist. Prof. Nikolaos Papaspyrou . Informal enquiries should be sent to the same address. Applications will be considered until the positions are filled. Moreover, the PhD positions are administered through the NTUA/ECE Postgraduate Secretariat. Candidates must also apply for the NTUA/ECE Ph.D. programme. The deadline for applications is September 23, 2011. Details and application forms are available here: http://www.ece.ntua.gr/index.php?option=com_content&id=530%3A-2011-2012 Project description: -------------------- The exponential growth in the number of cores requires radically new software development technologies. Many expect 100,000-core platforms to become commonplace, and the best predictions are that core failures on such an architecture will be common, perhaps one an hour. Hence we require programming models that are not only highly scalable but also reliable. The project aim is to scale the radical concurrency-oriented programming paradigm to build reliable general-purpose software, such as server-based systems, on massively parallel machines. The trend-setting language we will use is Erlang/OTP which has concurrency and robustness designed in. Currently Erlang/OTP has inherently scalable computation and reliability models, but in practice scalability is constrained by aspects of the language and virtual machine. Moreover existing profiling & debugging tools don't scale. The RELEASE consortium is uniquely qualified to tackle these challenges and we propose to work at three levels: - evolving the Erlang virtual machine so that it can work effectively on large scale multicore systems; - evolving the language to Scalable Distributed (SD) Erlang, and adapting the OTP framework to provide both constructs like locality control, and reusable coordination patterns to allow SD Erlang to effectively describe computations on large platforms, while preserving performance portability; - developing a scalable Erlang infrastructure to integrate multiple, heterogeneous clusters. We will develop state of the art tools that allow programmers to understand the behaviour of massively parallel SD Erlang programs. We will demonstrate the effectiveness of the RELEASE approach using demonstrators and two large case studies on a Blue Gene. Erlang is a beacon language for distributed computing, influencing both other languages and actor libraries and frameworks. Hence we expect the project to make a strong and enduring impact on computing practice in the two decades. -- Nikolaos S. Papaspyrou, Assistant Professor | Tel: +30-210-7723393, fax: 2519 National Technical University of Athens | Home: +30-210-7524801 School of Electrical & Computer Engineering |---------------------------------- Software Engineering Laboratory | E-mail: nickie at softlab.ntua.gr 15780 Zografou, Athens, Greece | URL: www.softlab.ntua.gr/~nickie/ From carlos.martin at urv.cat Sun Sep 4 10:03:17 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Sun, 04 Sep 2011 16:03:17 +0200 Subject: [TYPES/announce] FSFLA 2011: final announcement Message-ID: ********************************************************************* 2011 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS FSFLA 2011 (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain October 31 ? November 4, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/fsfla2011/ ********************************************************************* ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There will be no overlap in the class schedule. The previous event was SSFLA 2011 (http://grammars.grlmc.com/ssfla2011/). COURSES AND PROFESSORS: - Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours] - Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours] - Max H. Garzon (Memphis), DNA Codeword Design and DNA Languages [introductory/intermediate, 10 hours] - Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours] - Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours] - Michael Moortgat (Utrecht), Type-logical Grammars: Expressivity, Parsing Complexity [introductory/advanced, 8 hours] - Helmut Seidl (Technische M?nchen), Macro Treetransducers for XML Processing [intermediate, 6 hours] - Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] - Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/fsfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until July 31, 2011), - 15 euros (for payments after July 31, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; account holder's address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention FSFLA 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. Students may be refunded only in the case when a course gets cancelled due to the unavailability of the instructor. For early reduced rates, please notice that the date that counts is the date of the arrival of the fees to the School?s account. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the completion of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: June 4, 2011 Starting of the registration: June 4, 2011 Early registration deadline: July 31, 2011 Starting of the School: October 31, 2011 End of the School: November 4, 2011 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/fsfla2011/ POSTAL ADDRESS: FSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputaci? de Tarragona Universitat Rovira i Virgili From crusso at microsoft.com Sun Sep 4 18:45:19 2011 From: crusso at microsoft.com (Claudio Russo) Date: Sun, 4 Sep 2011 22:45:19 +0000 Subject: [TYPES/announce] Final CFP: PADL'12 - Practical Aspects of Declarative Languages 2012 Message-ID: <88D1F4047EA9A2468BCC6B743186880F6409413C@DB3EX14MBXC313.europe.corp.microsoft.com> [Apologies if you receive multiple copies.] Final Call for Papers ===================== 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 Abstract/Paper submission deadline: September 10th/17th, 2011 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'12 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, January 25-27. The symposium will be held in Philadelphia, Pennsylvania, USA. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2011 Paper Submission: September 17, 2011 Notification: October 22, 2011 Camera-ready: November 5, 2011 Symposium: January 23-24, 2012 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 chairs 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. PADL'12 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 15 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. Program Committee ================= Marcello Balduccini, Intelligent Systems Department, Kodak Research Labs Edwin Brady, University of St Andrews, Scotland Henning Christiansen, Roskilde University, Denmark Agostino Dovier, University of Udine, Italy Matthew Flatt, University of Utah, USA Gopal Gupta, University of Texas at Dallas, USA John Hughes, Chalmers University of Technology, Sweden; Quviq AB Gabriele Keller, University of New South Wales, Australia Lunjin Lu, Oakland University, USA Marc Pouzet, ?cole normale sup?rieure, France Ricardo Rocha, University of Porto, Portugal Andreas Rossberg, Google Germany GmbH, Germany Claudio Russo, Microsoft Research Cambridge, UK (co-chair) Kostis Sagonas, Uppsala University, Sweden; NTUA, Greece Satnam Singh, Microsoft Research Cambridge, UK Zoltan Somogyi, University of Melbourne, Australia Eijiro Sumii, Tohoku University, Japan Terrance Swift, Universidade Nova de Lisboa, Portugal; Johns Hopkins University, USA Andrew Tolmach, Portland State University, USA Jan Wielemaker, University of Amsterdam, The Netherlands Roland Yap, National University of Singapore, Republic of Singapore Kwangkeun Yi, Seoul National University, Korea Neng-Fa Zhou, Brooklyn College, City University of New York, USA (co-chair) Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Claudio Russo Microsoft Research Cambridge,UK Email: crusso microsoft com Neng-Fa Zhou Brooklyn College, The City University of New York, USA Email: zhou sci brooklyn cuny edu With the Cooperation of ======================= The Association for Logic Programming (ALP) ACM SIGPLAN Microsoft Research, Cambridge =================================== From nswamy at microsoft.com Sun Sep 4 18:56:49 2011 From: nswamy at microsoft.com (Nikhil Swamy) Date: Sun, 4 Sep 2011 22:56:49 +0000 Subject: [TYPES/announce] Call for papers: Programming languages meets program verification Message-ID: <55B8BB41BB08654590C07B5D630FD93A0B52B2D6@TK5EX14MBXC288.redmond.corp.microsoft.com> PLPV 2012 The Sixth ACM SIGPLAN Workshop Programming Languages meets Program Verification 24th January, 2012 Philadelphia, USA (Affiliated with POPL 2012) http://research.microsoft.com/en-us/um/people/nswamy/plpv12 -------------------------------------------------------------------------------- Overview The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications or 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 cross-pollination between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (Type-based, Hoare-logic-based, Abstract Interpretation-based, etc.), target different kinds of programming languages (functional, imperative, object-oriented, etc.), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc.). -------------------------------------------------------------------------------- Important Dates: Submission: 11th October, 2011 Notification: 8th November, 2011 Final Version: 15th November, 2011 Workshop: 24th January, 2012 -------------------------------------------------------------------------------- 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 (http://www.sigplan.org/authorInformation.htm). Submitted papers must adhere to the SIGPLAN republication policy (http://www.sigplan.org/republicationpolicy.htm). Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. To submit a paper, access the submission site at http://www.easychair.org/conferences/?conf=plpv2012. -------------------------------------------------------------------------------- Publication Accepted papers will be published by the ACM and will appear in the ACM Digital library. -------------------------------------------------------------------------------- Program Committee Amal Ahmed Indiana University Lennart Augustsson Standard Chartered Koen Claessen Chalmers (co-chair) Martin Giese University of Oslo Daniel Licata Carnegie Mellon University Peter M??ller ETH Zurich Aleksandar Nanevski IMDEA Matthieu Sozeau INRIA Nikhil Swamy Microsoft Research (co-chair) David Walker Princeton University Dana Xu INRIA -------------------------------------------------------------------------------- Previous PLPVs: http://plpv.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From jnfoster at cs.cornell.edu Sun Sep 4 22:21:15 2011 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Sun, 4 Sep 2011 22:21:15 -0400 Subject: [TYPES/announce] Postdoc positions at Cornell/Princeton in programming languages and networks 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 three 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 dallago at cs.unibo.it Mon Sep 5 04:17:54 2011 From: dallago at cs.unibo.it (Ugo Dal Lago) Date: Mon, 05 Sep 2011 10:17:54 +0200 Subject: [TYPES/announce] DICE 2012 - First Call for Papers Message-ID: <4E6485B2.2050105@cs.unibo.it> (Our apologies for multiple copies) =============================================================== FIRST CALL FOR PAPERS 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). _______________________________________________________________ INVITED SPEAKERS . Yuri Gurevich (Microsoft Research and University of Michigan) . Ulrich Schoepp (LMU Munich) _______________________________________________________________ SUBMISSION The following deadlines are strict: . Paper Submission (full papers): December 23rd, 2011; . Notification (full papers): January 20th, 2012; . Final Version (full papers): February 5th, 2012; . Submission (extended abstracts): February 18th, 2012; . Notification (extended abstracts): February 28th, 2012. There will be two categories of submissions: . Full papers, of up to 15 pages; . Extended abstracts for short presentations (not included in the proceedings), of up to 3 pages. Authors must indicate if their submission belongs to the second category (by adding "(Extended Abstract)" in the title). Papers must be submitted electronically, as pdf files, at the following page: https://www.easychair.org/conferences/?conf=dice2012. Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). Submissions of papers authored by PC members are allowed and encouraged. Proceedings will be published in EPTCS. _______________________________________________________________ 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) _______________________________________________________________ -------------- next part -------------- An HTML attachment was scrubbed... URL: From mvelev at gmail.com Mon Sep 5 13:37:08 2011 From: mvelev at gmail.com (Miroslav Velev) Date: Mon, 5 Sep 2011 12:37:08 -0500 Subject: [TYPES/announce] =?utf-8?b?Mm5kIENGUHM6IENvbnN0cmFpbnTigIvigItz?= =?utf-8?q?_in_Formal_Verificati=E2=80=8B=E2=80=8Bon_2011?= Message-ID: Call for papers: CFV'11: Seventh International Workshop on Constraints in Formal Verification DoubleTree Hotel, San Jose, California, November 10, 2011 A satellite event of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD). 2011 Abstract submission deadline: September 25, 2011 Paper submission deadline: September 30, 2011 Date of workshop: November 10, 2011 (right after ICCAD?11) Overview --------------------------------------------- Formal verification is of crucial significance in the development of hardware and software systems. In the last few years, tremendous progress was made in both the speed and capacity of constraint technology. Most notably, SAT solvers have become orders of magnitude faster and capable of handling problems that are orders of magnitude bigger, thus enabling the formal verification of more complex computer systems. As a result, the formal verification of hardware and software has become a promising area for research and industrial applications. The main goals of the Constraints in Formal Verification workshop are to bring together researchers from the CSP/SAT and the formal verification communities, to describe new applications of constraint technology to formal verification, to disseminate new challenging problem instances, and to propose new dedicated algorithms for hard formal verification problems. This workshop will be of interest to researchers from both academia and industry, working on constraints or on formal verification and interested in the application of constraints to formal verification. Scope --------------------------------------------- The scope of the workshop includes topics related to the application of constraint technology to formal verification, namely: - application of constraint solvers to hardware verification; - application of constraint solvers to software verification; - dedicated solvers for formal verification problems; - challenging formal verification problems. Submissions --------------------------------------------- Submissions should be in the IEEE format and in one of the following types: - a regular paper of up to 6 pages; - a short paper of up to 4 pages, describing an industrial experience. Workshop papers should be submitted electronically in pdf format. Abstract and paper submissions should be e-mailed to the workshop chair at: mvelev at gmail.com Important Dates --------------------------------------------- - abstract submission deadline: September 25, 2011 - paper submission deadline: September 30, 2011 - notification of acceptance: October 10, 2011 - camera-ready version deadline: October 25, 2011 - workshop date: November 10, 2011 Invited Speaker --------------------------------------------- Carl Seger, Intel, U.S.A. Natarajan Shankar, SRI, U.S.A. Workshop Chair --------------------------------------------- Miroslav Velev, Aries Design Automation, U.S.A. Program Committee -------------------------------------------- Maciej Ciesielski, University of Massachusetts, U.S.A. Masahiro Fujita, University of Tokyo, Japan Alex Groce, Oregon State University, U.S.A. Daniel Grosse, University of Bremen, Germany Michael Hsiao, Virginia Tech, U.S.A. Sumit Jha, University of Central Florida, U.S.A. Robert Jones, Intel, U.S.A. Peter-Michael Seidel, AMD, U.S.A. Andreas Veneris, University of Toronto, Canada Markus Wedler, University of Kaiserslautern, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From Jean-Yves.Marion at loria.fr Tue Sep 6 06:52:55 2011 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Tue, 6 Sep 2011 12:52:55 +0200 Subject: [TYPES/announce] Post-doctoral research position at Nancy University on ICC Message-ID: <5898E0E3-9453-429E-8832-A4352E0D84C4@loria.fr> Post-doctoral position at Nancy University, INRIA-LORIA, France on Implicit computational complexity (ICC) Applications are now invited for a postdoctoral position on ICC. Candidates are expected to contribute to research within the ANR project COMPLICE. The ideal candidate will have interest on type systems, logics, and complexity. The position is for one year. The start date is negotiable. To be considered for this position, please send a CV, list of publications, a brief statement of interest, and the names of two references to Jean-Yves Marion (Jean-Yves.Marion at loria.fr). Further inquiries--for example, questions about specific project topics--are also welcome. COMPLICE is a four-year project whose partner sites are ENS Lyon, Universit? Paris 13 and LORIA-Nancy. The project's goal is to investigate the foundations and applications of implicit computational complexity (ICC), along the lines of semantics and logic, functional programming, program extraction from proofs, quantitative properties and ICC for concurrent systems. http://www.loria.fr/ http://en.inria.fr/inria-research-centre/nancy-grand-est http://www-lipn.univ-paris13.fr/complice/spip.php?auteur2 From Pieter.Philippaerts at cs.kuleuven.be Tue Sep 6 10:08:56 2011 From: Pieter.Philippaerts at cs.kuleuven.be (Pieter Philippaerts) Date: Tue, 6 Sep 2011 16:08:56 +0200 Subject: [TYPES/announce] CFP: International Symposium on Engineering Secure Software and Systems (ESSoS) -- deadline approaching! Message-ID: <00fb01cc6c9e$844eefa0$8ceccee0$@Philippaerts@cs.kuleuven.be> Online submission for papers is now available through EasyChair, at http://www.easychair.org/conferences/?conf=essos12 Abstracts should be submitted before September 18th, and papers before September 25th! Call For Papers International Symposium on Engineering Secure Software and Systems (ESSoS) http://distrinet.cs.kuleuven.be/events/essos2012/ February 16 - 17, 2012, Eindhoven, The Netherlands In cooperation with ACM SIGSAC and SIGSOFT and (pending) IEEE CS (TCSE). CONTEXT AND MOTIVATION Trustworthy, secure software is a core ingredient of the modern world. Unfortunately, the Internet is too. 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 fourth 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 - support for assurance, certification and accreditation SUBMISSION AND FORMAT The proceedings of the symposium are published by Springer-Verlag 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. Online submission for papers is available through EasyChair, at http://www.easychair.org/conferences/?conf=essos12 Two types of papers will be accepted: Full papers (max 12 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). Proposals for both tutorials and workshops are welcome. IMPORTANT DATES Abstract submission: September 18, 2011 Paper submission: September 25, 2011 Author notification: November 19, 2011 Camera-ready: December 11, 2011 PROGRAM COMMITTEE Program Committee Co-Chairs Gilles Barthe, IMDEA Software Institute Ben Livshits, Microsoft Research Program Committee Davide Balzarotti, EURECOM David Basin, ETH Zurich Hao Chen, UC Davis Manuel Costa, Microsoft Research Julian Dolby, IBM Research Maritta Heisel, U. Duisburg Essen Thorsten Holz, U. Ruhr Bochum Collin Jackson, CMU Martin Johns, SAP Research Jan J?rjens, TU Dortmund Engin Kirda, NorthEastern U. Javier Lopez, U. Malaga Sergio Maffeis, Imperial College Heiko Mantel, TU Darmstadt Fabio Martinelli, CNR Haris Mouratidis, University of East London Anders M?ller, Aarhus University Frank Piessens, KU Leuven Erik Poll, RU Nijmegen Pierangela Samarati, U. Milano Ketil St?len, SINTEF and U. Oslo Laurie Williams, North Carolina State University Jianying Zhou, Institute for Infocomm Research Singapore Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From nswamy at microsoft.com Tue Sep 6 12:04:08 2011 From: nswamy at microsoft.com (Nikhil Swamy) Date: Tue, 6 Sep 2011 16:04:08 +0000 Subject: [TYPES/announce] CFP: PLPV'12 - Programming languages meets program verification Message-ID: <55B8BB41BB08654590C07B5D630FD93A0B52B9D7@TK5EX14MBXC288.redmond.corp.microsoft.com> ???????? ??????????????????????PLPV 2012 ????????? ???????????The Sixth ACM SIGPLAN Workshop ????????????Programming Languages meets Program Verification 24th January, 2012 Philadelphia, USA (Affiliated with POPL 2012) http://research.microsoft.com/en-us/um/people/nswamy/plpv12 -------------------------------------------------------------------------------- Overview? The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications or 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 cross-pollination between different communities, we seek a broad scope for PLPV.? In particular, submissions may have diverse foundations for verification (Type-based, Hoare-logic-based, Abstract Interpretation-based, etc.), target different kinds of programming languages (functional, imperative, object-oriented, etc.), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc.). -------------------------------------------------------------------------------- Important Dates: Submission:??? 11th October,? 2011? Notification:? 8th November,? 2011? Final Version: 15th November, 2011? Workshop:????? 24th January,? 2012? -------------------------------------------------------------------------------- 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 (http://www.sigplan.org/authorInformation.htm). Submitted papers must adhere to the SIGPLAN republication policy (http://www.sigplan.org/republicationpolicy.htm). Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. To submit a paper, access the submission site at http://www.easychair.org/conferences/?conf=plpv2012. -------------------------------------------------------------------------------- Publication Accepted papers will be published by the ACM and will appear in the ACM Digital library. -------------------------------------------------------------------------------- Program Committee Amal Ahmed?????? ???? Northeastern University Lennart Augustsson??? Standard Chartered Koen Claessen???????? Chalmers (co-chair) Martin Giese????????? University of Oslo Daniel Licata???????? Carnegie Mellon University Peter M??ller???????? ETH Zurich Aleksandar Nanevski ??IMDEA Matthieu Sozeau?????? INRIA Nikhil Swamy????????? Microsoft Research (co-chair) David Walker????????? Princeton University Dana Xu?????????????? INRIA -------------------------------------------------------------------------------- Previous PLPVs: http://plpv.org From Jeremy.Gibbons at comlab.ox.ac.uk Wed Sep 7 06:48:13 2011 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons at comlab.ox.ac.uk) Date: Wed, 7 Sep 2011 11:48:13 +0100 (BST) Subject: [TYPES/announce] Mathematics of Program Construction - first call for papers Message-ID: <201109071048.p87AmDho013382@merc3.comlab.ox.ac.uk> FIRST CALL FOR PAPERS 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 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. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), and Qu?bec City, Canada (2010, colocated with AMAST). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. INVITED SPEAKERS To be arranged. IMPORTANT DATES * Submission of abstracts 09 January 2012 * Submission of full papers 16 January 2012 * Notification to authors: 19 March 2012 * Final version: 16 April 2012 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 09 January 2012. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 16 January 2012. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=mpc2012). Papers must report previously unpublished work, and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2012 at easychair.org with any questions about academic matters. The proceedings of MPC 2012 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, we plan that the authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. 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 Macquarie University, 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 Radboud Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA VENUE The conference will take place in Madrid, the capital of Spain, in the Facultad de Medicina of Universidad Complutense de Madrid. The Faculty of Medicine is located in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation will be available in nearby hotels. 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 gerardo at ifi.uio.no Wed Sep 7 08:41:38 2011 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Wed, 7 Sep 2011 14:41:38 +0200 Subject: [TYPES/announce] CfPar: SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11) Message-ID: [Please accept our apologies if you receive multiple copies of this Call for Participation] ++++++++++++++++++++++++++++++++++++++++++++++++++ CALL FOR PARTICIPATION The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11) 14-18 November 2011 Montevideo, Uruguay http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ REGISTRATION IS NOW OPEN! To register please follow the instructions given at http://www.fing.edu.uy/inco/eventos/SEFM2011/index.html#registration A PRELIMINARY PROGRAM is already available at http://www.fing.edu.uy/inco/eventos/SEFM2011/program.html +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Holger Hermanns, Saarland University, Germany Title of the talk: "Formal Methods in Energy Informatics" * Mike Hinchey, Lero, Ireland Title of the talk: "Developing Model-Checking Mechanisms for ASSL: An Experience Report" * Daniel Le M?tayer - INRIA, France Title of the talk: "Formal methods as a link between software code and legal rules" SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development". All queries about the special track should be sent to: sefm2011-msd at iist.unu.edu. The special track will have as keynote speaker: * Matteo Pedercini, Millennium Institute, USA Title of the talk: "Models and Communication in the Policy Process" LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (R?o de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. CONTACT All queries should be sent to: sefm2011 at fing.edu.uy. ++++++++++++++++++++++++++++++++++++++++++++++++++ SEFM SCHOOL The associated school to the conference will be held November 7-11, 2011. For further information send an email to sefm2011 at fing.edu.uy (a separate call will be sent soon). The program of the school is available from http://www.fing.edu.uy/inco/eventos/SEFM2011/school.html ++++++++++++++++++++++++++++++++++++++++++++++++++ COMMITTEES Conference Chair * Alberto Pardo, Universidad de la Rep?blica, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering, Graz University of Technology, Austria * Luis Barbosa, University of Minho, Portugal * Gilles Barthe, IMDEA Software, Spain * Thomas Anung Basuki, Parahyangan Catholic University, Indonesia * Alexandre Bergel, University of Chile, Chile * Gustavo Betarte, Universidad de la Rep?blica, Uruguay * Ana Cavalcanti, University of York, UK * Pedro R. D'Argenio, Univ. Nacional de C?rdoba, Argentina * Van Hung Dang, Vietnam National University, Vietnam * George Eleftherakis, SEERC, Greece * Jos? Luiz Fiadeiro, University of Leicester, UK * Martin Fr?nzle, Oldenburg University, Germany * Stefania Gnesi, ISTI-CNR, Italy * Rob Hierons, Brunel University, UK * Paola Inverardi, University of L'Aquila, UK * Jean-Marie Jacquet, University of Namur, Belgium * Tomasz Janowski, UNU-IIST, China * Jean-Marc Jezequel, IRISA, France * Joseph Kiniry, IT University of Copenhagen, Denmark * Paddy Krishnan, Bond University, Australia * Martin Leucker, University of L?beck, Germany * Xuandong Li, Nanjing University, China * Peter Lindsay, The University of Queensland, Australia * Ant?nia Lopes, University of Lisbon, Portugal * Nenad Medvidovic, University of Southern California, USA * Mercedes Merayo, Universidad Complutense de Madrid, Spain * Stephan Merz, INRIA Nancy, France * Madhavan Mukund, Chennai Mathematical Institute, India * C?sar Mu?oz, NASA, USA * Mart?n Musicante, UFRN, Brazil * Mizuhito Ogawa, JAIST, Japan * Olaf Owe, University of Oslo, Norway * Gordon Pace, University of Malta, Malta * Ernesto Pimentel, University of M?laga, Spain * Sanjiva Prasad, Indian Institute of Technology Delhi, India * Anders Ravn, Aalborg University, Denmark * Leila Ribeiro, UFRGS, Brazil * Augusto Sampaio, UFPE, Brazil * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden * Sebasti?n Uchitel, Imperial College London, UK, and UBA, Argentina * Willem Visser, University of Stellenbosch, South Africa * Sergio Yovine, UBA and CONICET, Argentina Organising Committee * Carlos Luna, Universidad de la Rep?blica, Uruguay * Alberto Pardo, Universidad de la Rep?blica, Uruguay * Luis Sierra, Universidad de la Rep?blica, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR China * Mike Hinchey, Lero, Ireland * Mathai Joseph, TRDDC, India * Zhiming Liu, UNU-IIST, Macao SAR China * Andrea Maggiolo-Schettini, Pisa University, Italy ++++++++++++++++++++++++++++++++++++++++++++++++++ --- Gerardo Schneider Department 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 cormac at cs.ucsc.edu Wed Sep 7 13:54:32 2011 From: cormac at cs.ucsc.edu (Cormac Flanagan) Date: Wed, 7 Sep 2011 10:54:32 -0700 Subject: [TYPES/announce] TACAS 2012 Call for Papers In-Reply-To: References: Message-ID: TACAS 2012: 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems http://www.etaps.org/2012/tacas TACAS is a forum for researchers, developers and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference serves to bridge the gaps between different communities that share common interests in, and techniques for, tool development and its algorithmic foundations. The research areas covered by such communities include but are not limited to formal methods, software and hardware verification, static analysis, programming languages, software engineering, real-time systems, communications protocols, and biological systems. The TACAS forum provides a venue for such communities at which common problems, heuristics, algorithms, data structures and methodologies can be discussed and explored. In doing so, TACAS aims to support researchers in their quest to improve the utility, reliability, flexibility and efficiency of tools and algorithms for building systems. Tool descriptions and case studies with a conceptual message, as well as theoretical papers with clear relevance for tool construction are all encouraged. The specific topics covered by the conference include, but are not limited to, the following: ? ?Specification and verification techniques for finite and infinite-state systems; ? ?Software and hardware verification; ? ?Theorem-proving and model-checking; ? ?System construction and transformation techniques, ? ?Static and run-time analysis; ? ?Abstraction techniques for modeling and validation; ? ?Compositional and refinement-based methodologies; ? ?Testing and test-case generation; ? ?Analytical techniques for safety, security, or dependability; ? ?Analytical techniques for real-time, hybrid, or stochastic systems; ? ?Integration of formal methods and static analysis in high-level ? ? ? ?hardware design or software environments; ? ?Tool environments and tool architectures; ? ?SAT and SMT solvers; ? ?Applications and case studies. Competition on Software Verification ------------------------------------ Associated with TACAS '12 there will be a competition on software verification. TACAS '12 hosts the first such competition event with the goal to evaluate the technology transfer and compare state-of-the-art software verifiers with respect to effectiveness and efficiency. The competition is performed and presented by the TACAS Competition Chair Dirk Beyer. Successful competition candidates are granted a demonstration slot for their tool in the TACAS program, and their contribution paper will be included in the TACAS conference proceedings. ?Important dates and submission See the common call for papers of ETAPS 2012 at http://www.etaps.org/2012/call-for-papers. Submit your paper via the TACAS 2012 author interface of Easychair. Submission guidelines --------------------- TACAS will accept the following kinds of submissions: * Research papers cover one or more of the topics above, including ?tool development and case studies from a perspective of scientific ?research. They have a maximum of 15 pages. * Case study papers report on case studies (preferably in a "real ?life" setting) are also welcome. They should focus on providing ?sufficiently detailed information about the following aspects: the ?system being studied and why it is of interest, the goals of the ?study, the challenges the system poses to automated analysis, ?research methodologies and the approach used, the degree to which ?goals were attained, and how the results can be generalized to other ?problems and domains. Case study papers have a maximum of 15 pages. * Regular tool papers present a new tool, a new tool component, or ?novel extensions to an existing tool. They focus primarily on ?engineering aspects, with special emphasis on important design and ?implementation concerns. A thorough discussion of theoretical ?foundations is not required, although the paper should provide with ?a summary of such, with relevant citations. A tool paper should ?describe the tool's software architecture and core data structures ?and algorithms, and also give a clear account of its ?functionality. The paper should discuss the tool's practical ?capabilities with reference to the type and size of problems it can ?handle, and experience with realistic case studies. Papers that ?present extensions to existing tools should clearly focus on the ?improvements or extensions with respect to previously published ?versions of the tool, preferably substantiated by data on ?enhancements in terms of resources and capabilities. Tool papers are ?evaluated by the TACAS Tool Chair with the help of the Programme ?Committee. Tool papers have a maximum of 15 pages. * Tool demonstration papers present tools based on aforementioned ?technologies (e.g., theorem-proving, model-checking, static ?analysis, or other formal methods) or falling into relevant ?application areas (e.g., system construction and transformation, ?testing, analysis of real-time, hybrid or biological systems, etc.) ?and focus on the usage aspects of the tool. Tool demonstration ?papers are evaluated by the TACAS Tool Chair with the help of the ?Programme Committee. Tools presented in tool demonstration papers ?must be publicly available. Tool demo papers have a maximum of 6 ?pages. Submitted papers in all categories must: * be in English, * present original research which is unpublished and not submitted ?elsewhere (conferences or journals) - in particular, simultaneous ?submission of the same contribution to multiple ETAPS conferences is ?forbidden, * use the Springer LNCS style, * fit within the page limit, including figures and bibliography ?(papers may include an optional appendix containing ancillary ?material such as proofs, but TACAS referees are at liberty to ignore ?appendices, and * be submitted electronically in pdf via the TACAS 2012 Easychair author interface. Invited speaker --------------- Holger Hermanns (Univ. of Saarland, Germany) Programme chairs ---------------- Cormac Flanagan (Univ. of California at Santa Cruz, USA) Barbara K?nig (Univ. of Duisburg-Essen,Germany) Programme committee ------------------- Rajeev Alur (Univ. of Pennsylvania, USA) Armin Biere ( Johannes Kepler Univ., Austria) Alessandro Cimatti (FBK-irst, Italy) (Tool chair) Rance Cleaveland (Univ. of Maryland and Fraunhofer USA, USA) Giorgio Delzanno (Univ. of Genova, Italy) Javier Esparza (Techn. Univ. of Munich, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Susanne Graf (Verimag, France) Orna Grumberg (Technion, Israel) Aarti Gupta (NEC Labs, USA) Michael Huth (Imperial College London, UK) Ranjit Jhala (Univ. of California at San Diego, USA) Vineet Kahlon (Univ. of Texas at Austin, USA) Daniel Kroening (Univ. of Oxford, UK) Marta Kwiatkowska (Univ. of Oxford, UK) Kim G. Larsen (Aalborg Univ., Denmark) Rustan Leino (Microsoft Research, Redmond, USA) Matteo Maffei (Univ. of Saarland, Germany) Ken McMillan (Cadence Berkeley Labs, USA) Doron Peled (Bar Ilan University, Israel) Anna Philippou (Univ. of Cyprus) Arend Rensink (Univ. of Twente, Netherlands) Andrey Rybalchenko (Techn. Univ. of Munich, Germany) Stefan Schwoon (ENS Cachan, France) Bernhard Steffen (Techn. Univ. of Dortmund, Germany) Serdar Tasiran (Koc University, Turkey) Lenore Zuck (Univ. of Illinois at Chicago, USA) From bcpierce at cis.upenn.edu Thu Sep 8 08:52:11 2011 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Thu, 8 Sep 2011 08:52:11 -0400 Subject: [TYPES/announce] Workshop on Bidirectional Transformations (BX 2012) Message-ID: <25AECB5C-C569-4322-87BF-AECF3B992E71@cis.upenn.edu> CALL FOR PAPERS First International Workshop on Bidirectional Transformations (BX 2012) Tallinn, Estonia Sun, March 25, 2012 (co-located with ETAPS 2012) http://www.program-transformation.org/BX12 =============================================================== INVITED SPEAKERS: * Juan de Lara (Autonomous University of Madrid, Spain) * second invited speaker still to be decided IMPORTANT DATES: * Paper submission: Mon, December 19, 2011 * Author notification: Tue, January 24, 2012 * Camera-ready papers: Sun, February 5, 2012 To facilitate smooth organization of the review process, authors are asked to submit a short abstract by December 12, 2011. SUBMISSION CATEGORIES: * Regular submissions (max. 15 pages, formal proceedings) * Short papers (max. 8 pages, informal proceedings) * Lightning talks (extended abstract) Submissions can be in LNCS or EC-EASST style. More details can be found on the webpage. PROCEEDINGS: There will be formal proceedings containing all accepted regular papers, published as a volume of EC-EASST (Electronic Communications of the European Association of Software Science and Technology, http://journal.ub.tu-berlin.de/eceasst). Short papers will be included in informal proceedings distributed at the workshop, and their authors may be invited to extend their contribution to a full paper for inclusion in the formal proceedings. SCOPE: Bidirectional transformations (bx) are a mechanism for maintaining the consistency of two (or perhaps more) related sources of information. Such sources can be databases, software models, documents, or their abstract models like graphs or trees. 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. The aim of the workshop is to bring together researchers, from all relevant areas, 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 2012 include, but are not limited to: * (coupled) software/model transformations * software-model synchronization * data-schema co-evolution and data synchronization * consistency analysis * language-based approaches * analysis/classification of requirements for bx technologies * case studies and tool support * comparison of bx technologies * efficiency of algorithms and benchmarks Regular submissions (11-15 pages) 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 For details about short papers and lightning talks, please consult the webpage. PROGRAM CO-CHAIRS: * Frank Hermann (Technical University of Berlin, Germany; University of Luxembourg, Luxembourg) * Janis Voigtl?nder (University of Bonn, Germany) PROGRAM COMMITTEE MEMBERS: * Paolo Atzeni (Roma Tre University, Italy) * Benjamin Braatz (University of Luxembourg, Luxembourg) * Anthony Cleve (University of Namur, Belgium) * Alcino Cunha (University of Minho, Portugal) * Carlo Curino (Massachusetts Institute of Technology, USA) * Davide Di Ruscio (University of L'Aquila, Italy) * Zinovy Diskin (University of Waterloo, Canada) * Ulrike Golas (Zuse Institute Berlin, Germany) * Ekkart Kindler (Technical University of Denmark, Denmark) * Kazutaka Matsuda (Tohoku University, Japan) * Fernando Orejas (Technical University of Catalonia, Spain) * Benjamin Pierce (University of Pennsylvania, USA) * Andy Sch?rr (Technical University of Darmstadt, Germany) * Perdita Stevens (University of Edinburgh, UK) * James Terwilliger (Microsoft, USA) * Antonio Vallecillo (University of M?laga, Spain) * Yingfei Xiong (University of Waterloo, Canada) From Patricia.Johann at cis.strath.ac.uk Thu Sep 8 14:29:17 2011 From: Patricia.Johann at cis.strath.ac.uk (Patricia Johann) Date: Thu, 8 Sep 2011 19:29:17 +0100 (BST) Subject: [TYPES/announce] PhD position available at Strathclyde Message-ID: ** New: Later start date possible! ** PhD Position in Category Theory and Functional Programming Department of Computer and Information Sciences University of Strathclyde, Scotland Applications are invited for one PhD position within the Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, Dr. Conor McBride, Dr. Peter Hancock, Dr. Robert Atkey, and six PhD students. The PhD project centres around applications of categorical methods to functional programming languages. The project is under the direction of Patricia Johann. The successful applicant will have either a first-class degree or an MSc in Mathematics or Computing Science or a related subject with a strong Mathematics or Computing Science component. Ideally, they will also have a strong, documented interest in doing research. Strong mathematical background and problem-solving skills are essential; good programming skills are a plus. Prior knowledge of category theory and/or functional programming is an advantage, but is not required. The PhD position is for 3 years; it must be started before September 2012 at the latest, but will preferably be started earlier. The position is a fully-funded post for a UK or EU student, and includes both coverage of fees and an EPSRC-level stipend for each of the three years. Fees for non-EU students are covered only at the UK or EU student level. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is located in the heart of Glasgow, which Lonely Planet Travel Guides hail as "one of Britain's largest, liveliest and most interesting cities" (see http://www.lonelyplanet.com/worldguide/scotland/glasgow/). Southern Scotland provides a particularly stimulating environment for researchers in theoretical computer science, with active groups in this area at Heriot-Watt University, the University of Edinburgh, the University of Glasgow, the University of St. Andrews, and the University of Strathclyde. Requests for further information and other informal enquiries can be sent to: Patricia Johann patricia at cis.strath.ac.uk Those interested in the position are asked to send e-mail to the address given above in the next short while. From paulo.oliva at eecs.qmul.ac.uk Thu Sep 8 15:04:51 2011 From: paulo.oliva at eecs.qmul.ac.uk (Paulo Oliva) Date: Thu, 8 Sep 2011 20:04:51 +0100 Subject: [TYPES/announce] 12th Wessex Theory Seminar - Thu 15 September Message-ID: Dear All, some of you might want to participate in this meeting which is taking place at Queen Mary (University of London) next week. If so, please send me an email so I can add you to the list of participants. Yours, Paulo. Begin forwarded message: > From: Paulo Oliva > Date: 8 September 2011 1:56:56pm GMT+01:00 > To: wessex-theory at cs.bath.ac.uk > Subject: 12th Wessex Theory Seminar - Thu 15 September > > Dear All, > > The programme for the Wessex Theory Seminar at QM next week has been finalised: > 12:00 Lunch (at Mucci's) > 13:00 Coffee (Computer Science 3rd floor, The Hub) > 13:30 Timothy Griffin (Cambridge): Building Algebraic Structures with Combinators. > 14:15 Martin Escardo (Birmingham): A Proof of Omniscience in Agda > 15:00 Coffee Break > 15:30 Florent Balestieri (Nottingham): Partial Polymorphic Stream Functions > 16:15 Peter O'Hearn (QMUL): Locality, Exchange and Processes > 17:00 Closing > > Please see the webpage of the seminar for further details: > > https://wiki.bath.ac.uk/display/wessex/12th+Wessex+Theory+Seminar > > If you have problems during the day finding your way around the Queen Mary > campus, or getting to the seminar room or The Hub, please don't hesitate to > contact me on my mobile 07772472213. > > Best wishes, > -- > Paulo Oliva > Royal Society University Research Fellow > Queen Mary University of London > London E1 4NS > +44 (0) 207 882 5255 > http://www.dcs.qmul.ac.uk/~pbo -------------- next part -------------- An HTML attachment was scrubbed... URL: From seidl at in.tum.de Fri Sep 9 04:30:35 2011 From: seidl at in.tum.de (Helmut Seidl) Date: Fri, 09 Sep 2011 10:30:35 +0200 Subject: [TYPES/announce] CFP ESOP 2012 Message-ID: <4E69CEAB.60708@in.tum.de> -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: cfp URL: From Simon.Gay at glasgow.ac.uk Fri Sep 9 04:48:32 2011 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Fri, 9 Sep 2011 09:48:32 +0100 Subject: [TYPES/announce] 2nd CFP: Special Journal Issue on Behavioural Types Message-ID: <4E69D2E0.9010807@glasgow.ac.uk> MSCS special issue on Behavioural Types: 2nd call for papers ------------------------------------------------------------ In sequential computational settings, since they were proposed, types have been interpreted as predicates, i.e., abstract behavioural specifications of a program. In the context of object-oriented programming, types are used to statically guarantee semantic interoperability, capturing behavioural aspects of the specified systems. In the context of polymorphic functional languages, effect system, extending type systems to statically describe the dynamic behaviour of a computation (its effect), are used to control resource usage, such as memory manipulation. When such languages are concurrent, effects resemble processes, and the effect system is akin to a labelled transition system. Process calculi are useful to statically describe, reason about, and discipline the dynamic behaviour of open, concurrent, and distributed systems, as they provide a language with rigorous semantics, allowing the proof of relevant properties. Moreover, such calculi are equipped with a large tool box of proof methods and theoretical results. Ideas, concepts, and techniques from lambda-calculi and from process calculi have been successfully applied to the study of behavioural properties of such systems, and of type systems for concurrent (functional and/or object-oriented) languages. Behavioural type systems in general, and in particular those based on typestate, are attracting a lot of attention as they are able to ensure more than the usual safety guarantees of static analysis. On one hand they provide a specification language to describe the dynamic behaviour of the components. On the other hand, the type systems guarantee a wide range of properties, from protocol compatibility, to resource-usage analysis, to deadlock-freedom and race-freedom. We invite prospective authors to submit to a special issue of the journal Mathematical Structures in Computer Science (MSCS) http://journals.cambridge.org/action/displayJournal?jid=MSC on the theme "Behavioural Types for Object-Oriented, Concurrent and/or Distributed Systems". Expressions of interest, including a preliminary title, abstract, and list of authors, should be sent to us no later than September 19th, 2011. Full submissions should be sent to us no later than November 28th, 2011. The editors of the special issue, Simon Gay (Univ. of Glasgow, U.K., Simon.Gay at glasgow.ac.uk) and Ant?nio Ravara (New Univ. of Lisbon, Portugal, aravara at fct.unl.pt) -------------------------------------------------------------------- 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 -------------------------------------------------------------------- ________________________________ The University of Glasgow, charity number SC004401 -------------- next part -------------- An HTML attachment was scrubbed... URL: From damiani at di.unito.it Fri Sep 9 09:35:23 2011 From: damiani at di.unito.it (Ferruccio Damiani) Date: Fri, 09 Sep 2011 15:35:23 +0200 Subject: [TYPES/announce] FMCO 2011 and FoVeOOS 2011 call for participation In-Reply-To: <4DE948DC.5090409@di.unito.it> References: <4DE948DC.5090409@di.unito.it> Message-ID: <4E6A161B.3030500@di.unito.it> =========================================================================================== FMCO 2011 (International Symposium on Formal Methods for Components and Objects) October 3-5, 2011, Turin, Italy http://fmco.liacs.nl/fmco11.html and FoVeOOS 2011 (International Conference on Formal Verification of Object-Oriented Software) October 5-7, 2011, Turin, Italy http://foveoos2011.cost-ic0701.org =========================================================================================== *CALL FOR PARTICIPATION* FMCO 2011 and FoVeOOS 2011 are co-located, with a half-day joint session on Wednesday (October 5) morning. - Program of the FMCO Symposium: http://formal.iti.kit.edu/fmco2011/2011/program.html FMCO participating projetcs: http://fmco.liacs.nl/fmco11.html - Program of the FoVeOOS conference: http://foveoos2011.cost-ic0701.org/programme FoVeOSS invited talks: http://foveoos2011.cost-ic0701.org/invited-talks Registration to FMCO and/or FoVeOSS is now open: http://foveoos2011.cost-ic0701.org/registration *Early registration until 18 September, 2011* -- Prof. Ferruccio Damiani Dipartimento di Informatica |Phone: (+39) 011 670 6719 Universit? degli Studi di Torino |Fax : (+39) 011 75 16 03 C.so Svizzera 185 |Email: damiani at di.unito.it I-10149 Torino, Italy |URL : http://www.di.unito.it/~damiani From katoen at cs.rwth-aachen.de Fri Sep 9 09:49:11 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Fri, 09 Sep 2011 15:49:11 +0200 Subject: [TYPES/announce] ETAPS 2012: Call for Papers Message-ID: <4E6A1957.4000803@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** CALL FOR PAPERS: 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 -- (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 * TACAS: Tools and Algorithms for the Construction and Analysis of Systems * New! POST: Principles of Security and Trust -- INVITED SPEAKERS -- * Bruno Blanchet (INRIA / ENS / CNRS, France), * Georg Gottlob (Univ. of Oxford, UK) * Franois Bodin (IRISA and CAPS Entreprise, France) * Bjarne Stroustrup (Texas A&M Univ., USA) * Wil van der Aalst (Techn. Univ. of Eindhoven, Netherlands) * Glynn Winskel (Univ. of Cambridge, UK) * Holger Hermanns (Saarland University, Germany) * Cynthia Dwork (Microsoft Research, Silicon Valley, USA) -- IMPORTANT DATES -- * 7 October 2011: Submission deadline for abstracts (strict) * 14 October 2011: Submission deadline for full papers (strict) * 16 December 2011: Notification of acceptance * 6 January 2012: Camera-ready versions due Some conferences will use a rebuttal (author response) phase. -- GENERAL SUBMISSION INFORMATION -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. (TACAS has more categories, see below.) A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. - Research papers Different ETAPS 2012 conferences have different page limits. Specifically, FASE, FOSSACS and TACAS have a page limit of 15 pages, whereas CC, ESOP and POST allow at most 20 pages. Additional material intended for the referee but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. TACAS solicits not only regular research papers, but also case study papers. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most four pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool (this part will be included in the proceedings). * The second part, at most six pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) FOSSACS does not accept tool demonstration papers. In addition to tool demonstration papers (max 6 pages in their case), TACAS solicits also longer tool papers (max 15 pages) adhering to specific instructions about content and organization. -- SATELLITE EVENTS -- 20 satellite workshops will take place before or after ETAPS 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 4 kms from the city centre. -- ORGANIZERS * General chair: Tarmo Uustalu * Workshop chair: Keiko Nakata * Organizing committee: James Chapman, 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 scott.west at inf.ethz.ch Tue Sep 13 05:17:07 2011 From: scott.west at inf.ethz.ch (Scott West) Date: Tue, 13 Sep 2011 11:17:07 +0200 Subject: [TYPES/announce] CFP - TOOLS Europe 2012 Message-ID: <4E6F1F93.8020005@inf.ethz.ch> ====================================================================== CALL FOR PAPERS (Paper submission: 13 January 2012) TOOLS Europe 2012 50th International Conference on Objects, Models, Components, Patterns Co-located with: International Conference on Model Transformation (ICMT 2012) International Conference on Software Composition (SC 2012) International Conference on Tests and Proofs (TAP 2012) Prague, Czech Republic, 29-31 May 2012 http://toolseurope2012.fit.cvut.cz/ ====================================================================== 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 an emphasis on practically useful results, has contributed to making it mainstream and ubiquitous. TOOLS Europe encourages contributions on all aspects of object technology and related fields. In particular, every topic in advanced software technology falls within the scope of TOOLS. Contributions demonstrating practical applications backed up by formal analysis and thorough experimental evaluation are particularly welcome. Topics ====== Topics of interest include, but are not limited to: * Object technology, programming techniques, languages, tools * Language implementation techniques, compilers, run-time systems * Distributed and concurrent object systems, multicore programming * Patterns, pattern languages and tool support for patterns * Program verification and analysis techniques * Trusted, reliable and secure components * Testing of object-oriented systems * Component-based programming, modeling, tools * Model-driven development * Empirical studies on programming models and techniques * Domain specific languages and language design * Aspect-oriented programming and modeling * Industrial-strength experience reports * Real-time object-oriented programming and design Submissions =========== TOOLS Europe 2012 welcomes submissions in the following categories: * Full research papers (up to 16 pages) * Tool demonstration papers (up to 8 pages) * Short papers, such as experience reports or position statements (up to 8 pages) Submitted papers must be written in English and present original research. They must be unpublished and not submitted for publication elsewhere. Submissions must be in LNCS format (see Springer's instructions at http://www.springer.de/comp/lncs/authors.html). The page limits above include figures and bibliographic references. Additional material intended for referees but not for publication in the final version -- for example details of proofs -- may be placed in a clearly marked appendix that is not included in the page limit. Referees will be at liberty to ignore appendices, and papers must be understandable without them. Papers must be submitted in PDF format via http://www.easychair.org/conferences/?conf=toolseurope2012. All contributions will be subject to a rigorous selection process, with a stress on significance, originality and clarity. Accepted papers will be published as conference proceedings by Springer in the Lecture Notes in Computer Science (LNCS) series. At least one author of every accepted paper (in every category) is required to present the paper at the conference. Authors of selected papers will be invited to submit an extended version to a special issue of the Journal of Object Technology (JOT). Outstanding submissions will be considered for the EAPLS best paper award of TOOLS 2012. Important Dates =============== * Abstract submission: 6 January 2012 * Full paper submission: 13 January 2012 * Acceptance notification: 2 March 2012 * Camera-ready copy: 23 March 2012 * Conference: 29-31 May 2012 Committees ========== Program Chairs: * Carlo A. Furia, ETH Zurich, Switzerland * Sebastian Nanz, ETH Zurich, Switzerland Program Committee: * Jonathan Aldrich, Carnegie Mellon University, USA * Gilles Barthe, IMDEA Software Institute, Spain * Lorenzo Bettini, University of Torino, Italy * Yuriy Brun, University of Washington, USA * S.C. Cheung, The Hong Kong University of Science and Technology, China * Gordon Fraser, Saarland University, Germany * John Gallagher, Roskilde University, Denmark * Angelo Gargantini, University of Bergamo, Italy * Michael Goedicke, University of Duisburg-Essen, Germany * Susanne Graf, VERIMAG, France * Mark Harman, University College London, United Kingdom * Michael Huth, Imperial College London, United Kingdom * Yves Le Traon, University of Luxembourg, Luxembourg * Yang Liu, National University of Singapore, Singapore * Tiziana Margaria, University of Potsdam, Germany * Jerzy Nawrocki, Poznan University of Technology, Poland * Nathaniel Nystrom, University of Lugano, Switzerland * Manuel Oriol, University of York, United Kingdom * Alessandro Orso, Georgia Institute of Technology, USA * Richard Paige, University of York, United Kingdom * Alexander K. Petrenko, Moscow State University, Russia * Grigore Rosu, University of Illinois, USA * Peter Sestoft, IT University of Copenhagen, Denmark * Andrey Terekhov, St. Petersburg State University, Russia * Zdenek Tronicek, Czech Technical University in Prague, Czech Republic * Naoyasu Ubayashi, Kyushu University, Japan * Antonio Vallecillo, University of Malaga, Spain * Kapil Vaswani, Microsoft Research, Bangalore, India * Tao Xie, North Carolina State University, USA * Amiram Yehudai, Tel Aviv University, Israel * Michal Young, University of Oregon, USA * Jian Zhang, Chinese Academy of Sciences, China * Lu Zhang, Peking University, China Conference Chair: * Bertrand Meyer, ETH Zurich and Eiffel Software Local Organization: * Pavel Tvrdik, CTU Prague, Czech Republic * Michal Valenta, CTU Prague, Czech Republic * Jindra Vojikova, CTU Prague, Czech Republic * Jan Chrastina, CTU Prague, Czech Republic Publicity Chair: * Scott West, ETH Zurich, Switzerland From A.M.Silva at cwi.nl Tue Sep 13 15:41:01 2011 From: A.M.Silva at cwi.nl (A.M.Silva at cwi.nl) Date: Tue, 13 Sep 2011 21:41:01 +0200 Subject: [TYPES/announce] CMCS 2012: call for papers and revised dates Message-ID: <20110913194101.GA7066@doorgang.cwi.nl> [- Please note new submission deadline January 4 2011 -] ------------------------------------------------------------------------------ CMCS 2012 call for papers ------------------------------------------------------------------------------ The 11th International Workshop on Coalgebraic Methods in Computer Science 31 March - 1 April 2012, Tallinn, Estonia (co-located with ETAPS 2012) www.coalg.org/cmcs12 *** Proceedings to be published in Springer LNCS *** Aims and scope -------------- In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and probabilistic variants), Markov chains, and game-based systems, can be treated uniformly as coalgebras. Coalgebra has developed into a field of its own interest presenting a deep mathematical foundation, a growing field of applications, and interactions with various other fields such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal and description logics, artificial intelligence, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). Keynote Speaker --------------- Samson Abramsky, Oxford University, UK Invited Speakers ---------------- Marcello Bonsangue, Leiden University, The Netherlands Pawel Sobocinski, University of Southampton, UK Submissions ----------- Submission is electronic via the easychair system at http://www.easychair.org/conferences/?conf=cmcs2012 following the submission guidelines below. We solicit two types of contributions: (a) Regular papers to be evaluated by the PC for publication in the proceedings: They must have a length of at most 20 pages, formatted in LNCS style (http://www.springer.de/comp/lncs/authors.html). They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. (b) Short contributions: These will not be published in the proceedings but will be bundled in a technical report. They should be no more than two pages in LNCS format and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Proceedings Publication ----------------------- The proceedings of CMCS 2012 will be published in Springer Lecture Notes in Computer Science. The final proceedings will be published post-conference and consist of revised versions of the accepted regular papers. Preliminary proceedings will be made available at the conference in electronic form. Depending on the number and quality of submissions, we will consider publishing extended and revised papers as a journal special issue, subject to the usual reviewing procedure. Previous special issues of CMCS have appeared in high-ranking journals including Information and Computation and Theoretical Computer Science. Important dates --------------- !!Please note earlier submission deadline!! ( for regular papers ) * 4 January 2012: submission deadline (strict) * 3 February 2012: author notification * 7 February 2012: final version ( for short contributions ) * 27 February 2012: submission deadline (strict) * 6 March 2010: author notification ( workshop ) * 31 March - 1 April 2012 Programme Committee ------------------- Luis Barbosa, University of Minho, Braga, Portugal Filippo Bonchi, LIP ENS-Lyon, France Josee Desharnais, Universit? Laval, Canada Mai Gehrke, Radboud University Nijmegen, The Netherlands H. Peter Gumm, University of Marburg, Germany Ichiro Hasuo, University of Tokyo, Japan Patricia Johann, University of Strathclyde, Glasgow, Scotland, UK Ekaterina Komendantskaya, University of Dundee, Scotland, UK Dexter Kozen, Cornell University, Ithaca, NY, USA Dorel Lucanu, Alexandru Ioan Cuza University, Iasi, Romania Stefan Milius, Technical University of Braunschweig, Germany Larry Moss, Indiana University, Bloomington, USA Prakash Panangaden, McGill University, Montreal, Canada Dirk Pattinson, Imperial College London, UK (co-chair) Dusko Pavlovic, Royal Holloway, London, UK Daniela Petrisan, University of Leicester, UK Grigore Rosu, University of Illinois at Urbana-Champaign, USA Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands Luigi Santocanale, University of Provence, Marseille, France Lutz Schr?der, DFKI GmbH, Bremn, Germany (co-chair) Alexandra Silva, Radboud University Nijmegen and CWI, The Netherlands Ana Sokolova, University of Salzburg, Austria Sam Staton, University of Cambridge, UK Yde Venema, University of Amsterdam, The Netherlands Steering Committee ------------------ Jiri Adamek, Technical University of Braunschweig, Germany Corina Cirstea, University of Southampton, UK H. Peter Gumm (chair), University of Marburg, Germany Bart Jacobs, Radboud University Nijmegen, The Netherlands Alexander Kurz, University of Leicester, UK Marina Lenisa, University of Udine, Italy Ugo Montanari, University of Pisa, Italy Larry Moss, Indiana University, Bloomington, USA Dirk Pattinson, Imperial College London, UK John Power, University of Bath, UK Horst Reichel, Technical University of Dresden, Germany Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands Lutz Schr?der, DFKI GmbH and University of Bremen, Germany . From s.j.thompson at kent.ac.uk Wed Sep 14 10:12:56 2011 From: s.j.thompson at kent.ac.uk (Simon Thompson) Date: Wed, 14 Sep 2011 15:12:56 +0100 Subject: [TYPES/announce] Final call for papers PEPM 2012 Message-ID: <39C3A26D-DE21-4BAD-BC70-47CBAA9B37EB@kent.ac.uk> Apologies for multiple postings of this announcement. Final Call For Papers Paper submission deadline: Mon, October 10, 2011, 23:59, GMT ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 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 and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press and will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers - Markus Pueschel (ETH Zurich, Switzerland) - Martin Berger (University of Sussex, UK) Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Research, USA) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea) Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From cbraga at ic.uff.br Wed Sep 14 11:11:31 2011 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 14 Sep 2011 12:11:31 -0300 Subject: [TYPES/announce] SBLP 2011 - Final call for participation Message-ID: [Apologies for multiple copies of this call.] SBLP 2011: Call For Participation 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 29-30, 2011 http://www.each.usp.br/cbsoft2011/ *** Registration *** http://www.each.usp.br/cbsoft2011/ingles/inscricoes_en.html The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" ACCEPTED PAPERS FOR PRESENTATION AND PUBLICATION "From Regular Expressions to PEGs" S?rgio Medeiros (Universidade Federal de Sergipe); Fabio Mascarenhas (Universidade Federal do Rio de Janeiro); Roberto Ierusalimschy (PUC-Rio) "The Design and Implementation of a Non-Iterative Range Analysis Algorithm on a Production Compiler" Douglas Teixeira, Fernando Pereira (Universidade Federal de Minas Gerais) "Controlling the scope of instances in Haskell" Marco Silva, Carlos Camar?o (Universidade Federal de Minas Gerais) "Functional Fixpoint Evaluators for Partially Circular Attribute Grammars" Juan F. Cardona-Mccormick (Universidad EAFIT, Colombia), Doaitse S. Swierstra (Universiteit Utrecht, The Netherlands); Francisco J. Correa-Zabala (Universidad EAFIT, Colombia) "Parsing Expression Grammars for Structured Data" Fabio Mascarenhas (Universidade Federal do Rio de Janeiro); S?rgio Medeiros (Universidade Federal de Sergipe); Roberto Ierusalimschy (PUC-Rio) "First Class Overloading via Intersection Type Parameters" Elton Cardoso, Carlos Camar?o (Universidade Federal de Minas Gerais); Lucilia Figueiredo (Universidade Federal de Ouro Preto) "Making aspect-oriented refactoring safer" Gustavo Soares, Diego Cavalcanti, Rohit Gheyi (Universidade Federal de Campina Grande) "The Denotational, Operational, and Static, Semantics of a Domain-Specific Language for the Design of Flow Networks" Assaf Kfoury (Boston University, USA) "On the Use of Feature-Oriented Programming for Evolving Software Product Lines ? A Comparative Study" Gabriel Ferreira, Felipe Gaia (Universidade Federal de Uberl?ndia); Eduardo Figueiredo (Universidade Federal de Minas Gerais); Marcelo Maia (Universidade Federal de Uberl?ndia) "Staged Concurrency in Lua - Introducing Leda" Tiago L. Salmito, Noemi Rodriguez, Ana L?cia Moura (PUC-Rio) "Modular Contracts with Procedures, Annotations, Pointcuts and Advice" Henrique Reb?lo, Ricardo Massa Ferreira Lima (Universidade Federal do Pernambuco); Gary T. Leavens (University of Central Florida, USA) "An Experimental Evaluation of Compiler Optimizations on Code Size" Juliano Foleiss, Anderson Faustino Da Silva, Linnyer Beatryz Ruiz (Universidade Estadual de Maring?) ACCEPTED PAPER FOR PRESENTATION "How do programmers use Concurrency? An Investigation of a Large-Scale Java Open Source Code Repository" Benito Fernades, Weslley Torres, Jo?o Paulo Dos Santos Oliveira, Filipe Ximenes, Fernando Castor (Universidade Federal de Pernambuco) From cesar.a.munoz at nasa.gov Wed Sep 14 15:24:16 2011 From: cesar.a.munoz at nasa.gov (MUNOZ, CESAR (LARC-D320)) Date: Wed, 14 Sep 2011 14:24:16 -0500 Subject: [TYPES/announce] NFM 2012 Call For Papers Message-ID: NFM 2012 FIRST CALL FOR PAPERS Fourth NASA Formal Methods Symposium Norfolk, Virginia, USA April 3 - 5, 2012 http://shemesh.larc.nasa.gov/nfm2012/ nasa-nfm2012 at mail.nasa.gov -------------------------------------------------- Theme of 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. -------------------------------------------------- Topics of Interest: -------------------------------------------------- * Formal verification, including theorem proving, model checking, and static analysis * Automated test generation and testing techniques for safety-critical systems * Model-based development * Techniques and algorithms for scaling formal methods, such as abstraction and symbolic methods, compositional techniques, as well as parallel and distributed techniques * Monitoring and runtime verification * Code generation from formally verified models * Significant applications of formal methods to aerospace systems * Modeling and verification aspects of cyber-physical systems * Safety cases * Accident/safety analysis * Formal approaches to fault tolerance * Theoretical advances and empirical evaluations of formal methods * Techniques for safety-critical systems, including hybrid and embedded systems * Formal methods in systems engineering -------------------------------------------------- Submissions: -------------------------------------------------- There are two categories of submissions: * Regular papers describing fully developed work and complete results (15 pages/30 minute talks) * Short papers describing tools, experience reports, or descriptions of work in progress or?preliminary results (6 pages/15 minute talks) 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 the LNCS style and be put in PDF format in anticipation that we will publish accepted papers (including regular papers and short papers) in a formal proceedings. Papers should be submitted through the following link: http://www.easychair.org/conferences/?conf=nfm2012 ------------------------------------------------------- Program Chairs: ------------------------------------------------------- Alwyn Goodloe, NASA Langley Research Center Suzette Person, NASA Langley Research Center ------------------------------------------------------- Steering Committee: ------------------------------------------------------- Ewen Denney, NASA Ames Research Center Ben Di Vito, NASA Langley Research Center Dimitra Giannakopoulou, NASA Ames Research Center Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Cesar Munoz, NASA Langley Research Center Corina Pasareanu, NASA Ames Research Center James Rash, NASA Goddard Kristin V. Rozier, NASA Ames Research Center ------------------------------------------------------- Important Dates: ------------------------------------------------------- Submission: 11 December 2011 Notification: 21 January 2012 Final Version: 4 February 2012 Conference: 3 - 5 April 2012 ------------------------------------------------------- Location and Cost: ------------------------------------------------------- The symposium will take place at the Norfolk Waterside Marriott in Norfolk, Virginia, USA. April 3-5, 2012. 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. From marzia.buscemi at imtlucca.it Thu Sep 15 16:16:13 2011 From: marzia.buscemi at imtlucca.it (Marzia Buscemi) Date: Thu, 15 Sep 2011 22:16:13 +0200 Subject: [TYPES/announce] 12 PhD position on CSE at IMT Lucca - Deadline for Application Sept. 28. Message-ID: [ Applications from students interested in types, semantics and logics are particularly welcome. ] The institute for advanced studies IMT Lucca (Italy) announces 12 PhD positions in Computer Science and Engineering. The deadline for applications is September 28, 2011. IMT (http://www.imtlucca.it/) is a research institute located in Lucca (Italy); courses are taught exclusively in English. The PhD Program (https://www.imtlucca.it/phd_programs/computer_science_engineering/) coordinated by Rocco De Nicola aims at preparing researchers and professionals with broad training in the foundations of informatics as well as in applications to a variety of cutting-edge systems and disciplines. A number of PhD students will be selected for working within the the two newly founded Research Unit: SysMA (http://sysma.lab.imtlucca.it/) lead by Rocco De Nicola doing research on concurrent (distributed, mobile, autonomic) systems modelling and analysis and Dysco (http://dysco.lab.imtlucca.it/) lead by Alberto Bemporad doing research on control and optimization technologies. In addition, students will be selected to work on topics related to medical imaging, and imaging for the life sciences http://users.eecs.northwestern.edu/~stsaft/#Openings We hope that you may consider applying for and/or signaling these opportunities to colleagues and collaborators. ======= DETAILS ON THE ADVERTISED POSITIONS ======= 6 IMT scholarship (12.423 EUR after taxes) plus accommodation and free meals (lunch and dinner). 1 MIUR scholarship (12.423 EUR after taxes) plus free meals (lunch and dinner). 5 positions to be funded with internal projects or third-party scholarships (negotiable salary) that come with a research budget of 3.000 EUR offered by IMT and free meals (lunch and dinner). For further information please visit http://www.imtlucca.it/phd_programs/call_for_applications/index.php and/or contact the sender of this mail. From zucca at disi.unige.it Mon Sep 19 08:53:54 2011 From: zucca at disi.unige.it (Elena Zucca) Date: Mon, 19 Sep 2011 14:53:54 +0200 Subject: [TYPES/announce] FOOL'11: CALL FOR PARTICIPATION Message-ID: <52C6114E-A2A1-4A02-AA3A-2D89735A80BB@disi.unige.it> [Apologies for cross-postings] CALL FOR PARTICIPATION: 2011 International Workshop on Foundations of Object-Oriented Languages (FOOL'11) 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. The FOOL workshops bring together researchers to share new ideas and results in these areas. Portland, Oregon, USA, 23 October 2011 During the workshop days of SPLASH/OOPSLA The list of invited talks and accepted papers is now available on the workshop website: http://www.disi.unige.it/person/ZuccaE/FOOL2011 Registration is now open: http://splashcon.org/2011/attending/registering (early registration ends September, 23). ======================================================== Elena Zucca | tel.: +39-010-353 6730 DISI | fax: +39-010-353 6699 Univ. di Genova | email: zucca at disi.unige.it via Dodecaneso 35 | ftp: ftp.disi.unige.it/person/ZuccaE 16146 Genova, ITALY | http://www.disi.unige.it/person/ZuccaE ======================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From gerardo at ifi.uio.no Mon Sep 19 12:51:14 2011 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Mon, 19 Sep 2011 18:51:14 +0200 Subject: [TYPES/announce] CfPar: School on Software Engineering and Formal Methods (Nov 2011) Message-ID: <60D70526-2D33-49C8-A5F4-2AD9AA7C8CB3@ifi.uio.no> +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ CALL FOR PARTICIPATION SEFM School 2011 4th International School on SOFTWARE ENGINEERING AND FORMAL METHODS Montevideo, Uruguay, 7-11 November 2011 http://www.fing.edu.uy/inco/eventos/SEFM2011/school.html *** REGISTRATION IS OPEN *** +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ The 4th International School on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM 2011) will take place in Montevideo from 7th till 11th of November, 2011. The aim of the school is to offer courses to graduate students and young researchers interested in formal techniques applied to the design, specification, and verification of software systems. PROGRAM The SEFM School 2011 will consist of five courses: * Bisimulation, Coinduction, and their proof method Davide Sangiorgi (Focus Team, Inria/University of Bologna) * Computer-aided Verification of Security Systems Yassine Lakhnech (Universit? Joseph Fourier, France) * Modelling Software Product Lines with the HATS Abstract Behavioural Modelling Language Dave Clarke (Katholieke Universiteit Leuven, Belgium) * Practicing coinduction: Big-step semantics and Hoare logics for nontermination Tarmo Uustalu (Institute of Cybernetics, Tallinn, Estonia) * Runtime Verification Klaus Havelund (Jet Propulsion Laboratory, Laboratory for Reliable Software, USA) Martin Leucker (Universit?t zu L?beck, Germany) VENUE The SEFM School will be held at the NH Columbia Hotel, located close to the financial center of Montevideo and enjoying excellent views of the Plata river (R?o de la Plata). REGISTRATION To register, fill in the registration form at https://www.fing.edu.uy/inco/eventos/SEFM2011/registration-school.html The deadline for registration is October 3, 2011. Early registration is strongly encouraged. In case the number of registrations exceeds the number of positions available, registrations will be subject to a selection process. Acceptance or rejection of the registration to the school will be notified no later than October 10, 2011. FEES The registration fee is 150 USD (US dollars). A special fee reduction is applied to participants of the associated conference (SEFM'11: http://www.fing.edu.uy/inco/eventos/SEFM2011/). The registration does not cover accommodation. GRANTS The school shall be able to offer a fee reduction to a limited number of students. Priority will be given to students from Latin America. Students applying for a grant are required to provide additional information as part of the registration form. Deadline for grant application is October 3, 2011. Early application is strongly encouraged. Acceptance or rejection of grant applications will be notified by October 10, 2011. SCHOOL ORGANISERS Gilles Barthe (IMDEA Software, Spain) Alberto Pardo (Universidad de la Rep?blica, Uruguay) Gerardo Schneider (Chalmers | University of Gothenburg, Sweden) LOCAL ORGANISATION Juan Diego Campo Carlos Luna Alberto Pardo Luis Sierra Instituto de Computaci?n Facultad de Ingenier?a Universidad de la Rep?blica Montevideo, Uruguay --- Gerardo Schneider Chalmers | University of Gothenburg University of Oslo http://www.cse.chalmers.se/~gersch/ From bcpierce at cis.upenn.edu Mon Sep 19 22:34:27 2011 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Mon, 19 Sep 2011 22:34:27 -0400 Subject: [TYPES/announce] TLDI 2012 - Call for Papers and Contributed Talks (updated) Message-ID: ===> UPDATE: The submission site is now open! <=== TLDI 2012 CALL FOR PAPERS AND CONTRIBUTED TALKS The Seventh ACM SIGPLAN Workshop on Types in Language Design and Implementation Saturday, January 28, 2012 Philadelphia, PA, USA To be held in conjunction with POPL 2012 Submission deadline: October 10th, 2011 Submission site: http://tldi12.cis.upenn.edu IMPORTANT: This year TLDI is introducing a significant change to the workshop organization. There will be two distinct submission categories: full papers (with a published proceedings, as always) and 2-page proposals for talks on more speculative or unfinished work. The aim is to foster a more informal atmosphere in which new ideas can be discussed while maintaining the TLDI tradition of presentations of polished technical work. __________________________________________________________________ Scope The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2012 is the seventh workshop in the series and will be co-located with POPL in Philadelphia, Pennsylvania in January 2012. Submissions for TLDI 2012 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2012 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented or dynamic languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: * Typed intermediate languages and type-directed compilation * Type-based language support for safety and security * Types for interoperability * Type systems for system programming languages * Type-based program analysis, transformation, and optimization * Dependent types and type-based proof assistants * Types for security protocols, concurrency, and distributed computing * Type inference and type reconstruction * Type-based specifications of data structures and program invariants * Type-based memory management * Proof-carrying code and certifying compilation * Types and objects This is not meant to be an exhaustive list; papers on novel aspects or uses of types are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. __________________________________________________________________ Submission Guidelines The submission site: http://tldi12.cis.upenn.edu Full papers should be no more than 12 pages (including bibliography and appendices). They will be judged on the usual criteria of novelty, usefulness, correctness, and clarity of exposition. Informal talk proposals should be no more than 2 pages (including bibliography). These can be either technical or more general in nature; they will be judged on their promise of leading to an exciting or provocative talk. The deadline for both submission categories is Monday, October 10, 2011. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page (http://www.sigplan.org/authorInformation.htm), along with a LaTeX class file and template. Papers must be submitted electronically via the workshop website (http://tldi12.cis.upenn.edu/) in Adobe Portable Document Format (PDF) and must be formatted for printing on US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy (http://www.sigplan.org/republicationpolicy.htm). Submissions should contain original research not published or submitted for publication elsewhere. __________________________________________________________________ Publication As in previous years, accepted full papers will be published by the ACM and appear in the ACM digital library. __________________________________________________________________ Important Dates Submission deadline October 10, 2011 (Monday) Notification November 10, 2011 (Thursday) Workshop January 28, 2012 (Saturday) __________________________________________________________________ Program Chair: Benjamin C. Pierce University of Pennsylvania bcpierce atsign cis dot upenn dot edu Program Committee: Jonathan Aldrich CMU Adam Chlipala MIT Pierre-Malo Deni?lou Imperial College London Kathleen Fisher Tufts University Chris Hawblitzel Microsoft Research (Redmond) Dan Licata CMU Greg Morrisett Harvard University Benjamin C. Pierce University of Pennsylvania Dimitrios Vytiniotis Microsoft Research (Cambridge) Steering Committee: Amal Ahmed Indiana University Nick Benton Microsoft Research, Cambridge Derek Dreyer MPI-SWS Andrew Kennedy Microsoft Research, Cambridge Francois Pottier INRIA Paris-Rocquencourt Stephanie Weirich University of Pennsylvania From emilio at mcs.le.ac.uk Tue Sep 20 06:48:36 2011 From: emilio at mcs.le.ac.uk (Emilio Tuosto) Date: Tue, 20 Sep 2011 11:48:36 +0100 Subject: [TYPES/announce] CONCUR 2012: Call for workshops Message-ID: <201109201148.38653.emilio@mcs.le.ac.uk> [Apologies for cross-postings] * CONCUR 2012 * Call for affiliated workshops The 23rd Conference on Concurrency Theory (CONCUR 2012) will be held September 4th to September 7th 2012, in Newcastle upon Tyne, UK. It will co-locate with 21st Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS, September 4th to September 6th, 2012), and the 7th Workshop on Trustworthy Global Computing (TGC, September 7th to September 8th, 2012). Researchers and practitioners are invited to submit proposals for workshops to be affiliated to CONCUR 2012, on topics related to concurrency theory and its applications. Example topics include: semantics, logics, verification techniques for concurrent systems, and cross-fertilization between industry and academia. 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://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, September 3rd and Saturday, September 9th, 2012. Proposals should include: * The name and the preferred date of the proposed workshop. * 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: Monday, October 24, 2011 Notification of acceptance: Wednesday, November 9, 2011 Workshops: September 3rd, 2012 and September 8th, 2012 Submissions to: Jason Steggles and Emilio Tuosto 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 (jason.steggles at newcastle.ac.uk and emilio at mcs.le.ac.uk) The CONCUR 2012 workshop chairs, Jason Steggles and Emilio Tuosto From vladimir at ias.edu Tue Sep 20 09:56:58 2011 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Tue, 20 Sep 2011 09:56:58 -0400 Subject: [TYPES/announce] Univalent Foundations program 2012-2013 Message-ID: <8234BF16-0CCF-4E9E-B4AC-DDC9D1EB4BB7@ias.edu> Hello, and my apologies for multiple postings. A new announcement for the special program on Univalent Foundations of Mathematics at the Institute for Advanced Study in Princeton, NJ has been put on the institute web-page http://www.math.ias.edu/ . The new announcement contains info on how to apply for the program. Vladimir Voevodsky. -------------- next part -------------- An HTML attachment was scrubbed... URL: From birkedal at itu.dk Wed Sep 21 10:05:13 2011 From: birkedal at itu.dk (Lars Birkedal) Date: Wed, 21 Sep 2011 16:05:13 +0200 Subject: [TYPES/announce] CFP FoSSaCS 2012 Message-ID: <4E79EF19.7060606@itu.dk> CFP: 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) 2012, 24 March - 1 April. Tallinn, Estonia. http://itu.dk/research/fossacs-2012/ The submission site is now open! FoSSaCS seeks 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, transformation, and verification of programs and software systems. The specific topics covered by the conference include, but are not limited to, the following: Automata and language theory; Behavioural equivalences; Categorical models; Infinite state systems; Modal, spatial, and temporal logics; Models of concurrent, reactive, distributed, hybrid, and mobile systems; Process algebras and calculi; Semantics of programming languages; Software specification and refinement; Type systems and type theory; Fundamentals of security; Semi-structured data; Program correctness and verification. As a part of ETAPS, FoSSaCS adheres to ETAPS submission and notification deadlines, but FoSSaCS will also include an author response period: Friday, October 7, 2011 (23:59 Apia, Samoa time): Deadline for submission of abstracts. Friday, October 14, 2011, 23:59 Apia, Samoa time: Deadline for submission of full papers. Thursday and Friday, December 8-9, 2011: Author Response Friday, December 16, 2011: Notification of acceptance Friday, January 6, 2012: Camera-ready paper versions due March 24 - April 1, 2012: FoSSaCS 2012 Conference The paper submission deadline is STRICT. Making the deadline for submission of abstracts a week early allows the programme committee to start work before full versions are available. Obviously, there is no need to wait with submission of the full version until the final deadline. Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the final deadline will be treated as withdrawn, but authors are strongly encouraged, in this case, to explicitly withdraw their submission by sending an e-mail to the chairman. Programme chair Lars Birkedal (IT Univ. of Copenhagen, Denmark) Invited speaker: Glynn Winskel (Univ. of Cambridge, UK) Programme committee: Luca Aceto (Reykjavik Univ., Iceland) Roberto Amadio (Univ. of Paris 7, France) Torben Amtoft (Kansas State Univ., USA) Lars Birkedal (IT Univ. of Copenhagen, Denmark) Mikolaj Bojanczyk (Warsaw University, Poland) Thierry Coquand (Chalmers Univ. of Technology, Sweden) Andrea Corradini (Univ. of Pisa, Italy) Volker Diekert (Univ. of Stuttgart, Germany) Maribel Fernandez (King's College London, UK) Kohei Honda (Queen Mary, Univ. of London, UK) Bart Jacobs (Radboud Univ. of Nijmegen, Netherlands) Joost-Pieter Katoen (RWTH Aachen, Germany) Olivier Laurent (ENS Lyon, France) Rupak Majumdar (Max Planck Inst. for Software Systems, Germany) Markus M?ller-Olm (Univ. of M?nster, Germany) Joachim Parrow (Uppsala Univ., Sweden) Du?ko Pavlovi? (Univ. of Oxford, UK) Hanne Riis Nielson (Technical Univ. of Denmark) Alex Simpson (Univ. of Edinburgh, UK) Carolyn Talcott (SRI International, USA) Yde Venema (Univ. of Amsterdam, Netherlands) Thom?? Vojnar (Brno University, Czech Republic) Websites: http://www.itu.dk/research/fossacs-2012/ http://www.etaps.org/2012/fossacs From carlos.martin at urv.cat Thu Sep 22 11:25:21 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Thu, 22 Sep 2011 17:25:21 +0200 Subject: [TYPES/announce] LATA 2012: final call for papers Message-ID: ********************************************************************* Final Call for Papers 6th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2012 A Coru?a, Spain March 5?9, 2012 http://grammars.grlmc.com/LATA2012/ ********************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). VENUE: LATA 2012 will take place in A Coru?a, at the northwest of Spain. The venue will be the Faculty of Computer Science, University of A Coru?a. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: ? algebraic language theory ? algorithms for semi?structured data mining ? algorithms on automata and words ? automata and logic ? automata for system analysis and programme verification ? automata, concurrency and Petri nets ? automatic structures ? cellular automata ? combinatorics on words ? computability ? computational complexity ? computational linguistics ? data and image compression ? decidability questions on words and languages ? descriptional complexity ? DNA and other models of bio?inspired computing ? document engineering ? foundations of finite state technology ? foundations of XML ? fuzzy and rough languages ? grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) ? grammars and automata architectures ? grammatical inference and algorithmic learning ? graphs and graph transformation ? language varieties and semigroups ? language?based cryptography ? language?theoretic foundations of artificial intelligence and artificial life ? parallel and regulated rewriting ? parsing ? pattern recognition ? patterns and codes ? power series ? quantum, chemical and optical computing ? semantics ? string and combinatorial issues in computational biology and bioinformatics ? string processing algorithms ? symbolic dynamics ? symbolic neural networks ? term rewriting ? transducers ? trees, tree languages and tree automata ? weighted automata STRUCTURE: LATA 2012 will consist of: ? 3 invited talks ? 2 invited tutorials ? peer?reviewed contributions INVITED SPEAKERS: Eugene Asarin (Paris 7), Measuring Information in Timed Languages Bernard Boigelot (Li?ge), Automata-based Symbolic Representation of Polyhedra Gilles Dowek (INRIA), tutorial Around the Physical Church Thesis: Cellular Automata, Graphs, Formal Languages and Quantum Theory Rodney Downey (Wellington), tutorial 20 Years of Parameterized Complexity Jack Lutz (Iowa State), to be announced PROGRAMME COMMITTEE: Eric Allender (Rutgers) Miguel ?. Alonso (A Coru?a) Amihood Amir (Bar?Ilan) Dana Angluin (Yale) Franz Baader (Dresden) Patricia Bouyer (Cachan) John Case (Delaware) Volker Diekert (Stuttgart) Paul Gastin (Cachan) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Janusz Kacprzyk (Warsaw) Victor Khomenko (Newcastle) Bakhadyr Khoussainov (Auckland) Claude Kirchner (Paris) Maciej Koutny (Newcastle) Gregory Kucherov (Marne?la?Vall?e) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n?Vide (Tarragona, chair) Giancarlo Mauri (Milano Bicocca) Aart Middeldorp (Innsbruck) Faron Moller (Swansea) Angelo Montanari (Udine) Joachim Niehren (Lille) Mitsunori Ogihara (Miami) Enno Ohlebusch (Ulm) Dominique Perrin (Marne?la?Vall?e) Alberto Policriti (Udine) Alexander Rabinovich (Tel Aviv) Mathieu Raffinot (Paris) J?rg Rothe (D?sseldorf) Olivier H. Roux (Nantes) Yasubumi Sakakibara (Keio) Eljas Soisalon?Soininen (Aalto) Frank Stephan (Singapore) Jens Stoye (Bielefeld) Howard Straubing (Boston) Masayuki Takeda (Kyushu) Wolfgang Thomas (Aachen) Sophie Tison (Lille) Jacobo Tor?n (Ulm) Tayssir Touili (Paris) Esko Ukkonen (Helsinki) Frits Vaandrager (Nijmegen) Manuel Vilares (Vigo) Todd Wareham (Newfoundland) Pierre Wolper (Li?ge) Hans Zantema (Eindhoven) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Miguel ?. Alonso (A Coru?a, co?chair) Adrian Horia Dediu (Tarragona) Carlos G?mez Rodr?guez (A Coru?a) Jorge Gra?a (A Coru?a) Carlos Mart?n?Vide (Tarragona, co?chair) Bianca Truthe (Magdeburg) Jes?s Vilares (A Coru?a) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single?spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0?40209?0?0?0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2012 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer?reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since July 16, 2011 until March 5, 2012. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2012/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On?site registration fees: 580 Euro On?site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by December 5, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before December 5, 2011 (resp. February 24, 2012) to the conference series account at Uno?e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin?Vide ? LATA 2012; account holder?s address: Av. Catalunya, 35, 43002 Tarragona, Spain). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. People claiming early registration will be requested to prove that they gave the bank transfer order by the deadline. On?site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: October 7, 2011 (23:59h, CET) Notification of paper acceptance or rejection: November 18, 2011 Final version of the paper for the LNCS proceedings: November 27, 2011 Early registration: December 5, 2011 Late registration: February 24, 2012 Starting of the conference: March 5, 2012 Submission to the post?conference special issue: June 9, 2012 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2012 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34?977?559543 Fax: +34?977?558386 From selinger at mathstat.dal.ca Thu Sep 22 14:20:50 2011 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Thu, 22 Sep 2011 15:20:50 -0300 (ADT) Subject: [TYPES/announce] QPL 2011 workshop, Nijmegen, Oct 27-29 Message-ID: <20110922182050.DE3418C0167@chase.mathstat.dal.ca> The following annoucement may be of interest to some type theorists. One of the focuses of this workshop is semantics for quantum computing, including type systems. 8th workshop on QUANTUM PHYSICS AND LOGIC (QPL 2011) Nijmegen, October 27-29, 2011. http://qpl.science.ru.nl/ Call for participation. * This event will bring together researchers working on mathematical foundations of quantum physics, quantum computing and information, and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science methods for the study physical behaviour in general. Over the past few years, there has been growing activity in these foundational approaches, together with a renewed interest in the foundations of quantum theory, which complement the more mainstream research in quantum computation. REGISTRATION AND LOCAL INFORMATION: Please register for the workshop by October 3, 9:00 CET. The organizers need the number of participants in order to make proper arrangements. Information on registration, travel, and accommodations can be found on the workshop website at http://qpl.science.ru.nl/. STUDENT SUPPORT: We encourage participation by graduate students at the workshop. Students will pay a reduced registration fee. We will also be able to provide limited financial support to students for travel and accommodations; if you are interested in this, please email i.haerkens at cs.ru.nl by October 3rd, 9:00 CET.. Please also arrange for a brief letter of recommendation from your supervisor, to be sent to the same email address before the deadline. Your supervisor's letter should also state whether you have access to funding from other sources, and how much. Invited Speakers: Hans Maassen (Nijmegen) Urs Schreiber (Utrecht) Rob Spekkens (Perimeter Institute) List of accepted talks: Samson Abramsky and Shane Mansfield. "The Cohomology of Non-Locality and Contextuality: Preliminary Version" James Barratt. "On the Automation of Encoding Processes in the Quantum IO Monad" Jacob Biamonte, Stephen R. Clark and Dieter Jaksch. "Categorical Tensor Network States" Bob Coecke and Chris Heunen. "Pictures of complete positivity in arbitrary dimension" Bob Coecke and Raymond Lal. "Categorical quantum mechanics meets the Pavia principles: towards a representation theorem for CQM constructions" John Corbett. "A Topos Theory Foundation for Quantum Mechanics" Ugo Dal Lago and Claudia Faggian. "On Multiplicative Linear Logic, Modality and Quantum Circuits" Timothy Davidson, Simon Gay, Rajagopal Nagarajan and Ittoop Vergheese Puthoor. "Analysis of a Quantum Error Correcting Code using Quantum Process Calculus" Ichiro Hasuo and Naohiko Hoshino. "Semantics of Higher-Order Quantum Computation via Geometry of Interaction" Chris Heunen and Sergio Boixo. "Completely positive classical structures and sequentializable quantum protocols" Anne Hillebrand. "Superdense Coding and Quantum Direct Communication with GHZ in the ZX-calculus" Kentaro Honda. "Graphical Classification of Entangled Qutrits" Peter Janotta. "Generalizations of boxworld" Alex Lang and Bob Coecke. "Trichromatic Open Digraphs for Understanding Qubits" Jorik Mandemaker and Bart Jacobs. "The expectation monad" Joost Nuiten. "Bohrification of local nets of observables" Robert Raussendorf, Pradeep Sarvepalli, Tzu-Chieh Wei and Poya Haghnegahdar. "Measurement-based quantum computation--a quantum-mechanical toy model for spacetime?" Yun Shang, Xian Lu and Ruqian Lu. "Turing machine based on unsharp quantum logic" Susan Stepney, Viv Kendon, Peter Hines and Angelika Sebald. "A Framework for Heterotic Computing" Benno Van Den Berg and Chris Heunen. "No-go theorems for functorial localic spectra of noncommutative rings" Steve Vickers, Bertfried Fauser and Guillaume Raynaud. "The Born rule as structure of spectral bundles" Alexander Wilce. "Symmetry and Self-Duality in Categories of Probabilistic Models" Program committee: Thorsten Altenkirch (Nottingham) John Baez (UC Riverside and CQT Singapore) Dan Browne (UCL - London) Bob Coecke (Oxford) Giulio Chiribella (Perimeter Institute) Andreas D?ring (Oxford) Simon Gay (University of Glasgow) Bart Jacobs (Nijmegen, co-chair) Prakash Panangaden (McGill) Simon Perdrix (CNRS - Grenoble) Mehrnoosh Sadrzadeh (Oxford) Peter Selinger (Dalhousie, co-chair) Bas Spitters (Nijmegen) Local organizers: Bart Jacobs (co-chair) Bas Spitters (co-chair) Klaas Landsman Dion Coumans Hans Maassen Jorik Mandemaker Michael M?ger Sander Wolters Steering committee: Bob Coecke (Oxford) Prakash Panangaden (McGill) Peter Selinger (Dalhousie) Previous meetings: Previous QPL workshops were held in Ottawa (2003), Turku (2004), Chicago (2005), Oxford (2006), Reykjavik (2008), Oxford (2009), Oxford (2010). Sponsors: We gratefully acknowledge financial support from: * The EPSRC Network on Computer Science and Physics (C/\P) * The Netherlands Organisation for Scientific Research (NWO) Website: http://qpl.science.ru.nl/ (Workshop Homepage) * Contact: For more information, please contact Bart Jacobs and Peter Selinger at qpl11 at easychair.org. From Simon.Gay at glasgow.ac.uk Fri Sep 23 04:48:55 2011 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Fri, 23 Sep 2011 09:48:55 +0100 Subject: [TYPES/announce] PLACES 2012 Call For Papers Message-ID: <4E7C47F7.9030002@glasgow.ac.uk> [ In previous years' PLACES workshops, type-theoretic techniques for specifying and verifying communication behaviour have been very prominent. ] CALL FOR PAPERS 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/ 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, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Invited Speaker ** Benedict Gaster, AMD ** Submission Guidelines ** Authors should submit a title and a 200 word abstract by Wednesday 14th December 2011, to help the PC chairs assign reviewers to papers. Papers of up to five pages in length should be submitted in PDF format by Wednesday 21st December 2011 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=places2012 Preliminary proceedings will be available at the workshop. We intend to publish a post-proceedings in EPTCS. The submission deadline is strict and will not be extended. Enquiries can be sent to the PC co-chairs. ** Important Dates ** Abstract (title & 200 words max): 14th December 2011 Paper Submission: 23:59 (GMT) 21st December 2011 Paper Notification: 23rd January 2012 Final versions of papers: 3rd February 2012 ** 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) 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 The University of Glasgow, charity number SC004401 From dale at lix.polytechnique.fr Fri Sep 23 07:06:08 2011 From: dale at lix.polytechnique.fr (Dale Miller) Date: Fri, 23 Sep 2011 13:06:08 +0200 Subject: [TYPES/announce] IJCAR 2012: Call for Papers Message-ID: Call For Papers --- IJCAR 2012 6th International Joint Conference on Automated Reasoning Manchester, UK, June 26-July 1, 2012 http://ijcar.cs.manchester.ac.uk/ Important Dates (all in 2012) Abstract submission January 23 Final version due April 16 Paper submission January 30 Conference dates June 26-29 Notification March 26 Satellite events June 30-July 1 IJCAR is the premier international joint conference on all topics in automated reasoning. IJCAR 2012, the 6th International Joint Conference on Automated Reasoning, is a merger of leading events in automated reasoning: CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), FTP (International Workshop on First-order Theorem Proving), and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). Previous editions of IJCAR took place in Siena (2001), Cork (2004), Seattle (2006), Sydney (2008) and Edinburgh (2010), cf. http:/ /www.ijcar.org/. IJCAR 2012 is held as part of the Alan Turing Year 2012 just after The Alan Turing Centenary Conference in Manchester. Scope: IJCAR 2012 invites submissions related to all aspects of automated reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems are solicited. Logics of interest include: propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, metalogics, type theory, and set theory. Methods of interest include: tableaux, sequent calculi, resolution, model- elimination, connection method, inverse method, paramodulation, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, AI-related methods for deductive systems, proof presentation, efficient datastructures and indexing, integration of computer algebra systems and automated theorem provers, and combination of logics or decision procedures. Applications of interest include: verification, formal methods, program analysis and synthesis, computer mathematics, declarative programming, deductive databases, knowledge representation, natural language processing, linguistics, robotics, and planning. Submission: Submission is electronic through https://www.easychair.org/?conf=ijcar2012. Authors are strongly encouraged to use LaTeX and the Springer llncs class file, which can be obtained from http://www.springer.de/comp/lncs/authors.html. The page limit is 15 pages for full papers and 7 pages for system descriptions. All papers will be evaluated according to originality, significance, technical quality, and readability. Submitted papers must be original and not submitted for publication elsewhere. For more details concerning submission see the conference web site. The proceedings of IJCAR 2012 will be published by Springer-Verlag in the LNAI/LNCS series. Student Travel Awards: Travel awards will be available to enable selected students to attend the conference. Details will be available in early 2012. Further Information: For further and up-to-date information about IJCAR 2012 visit http://ijcar.cs.manchester.ac.uk/. Program Chairs: Bernhard Gramlich (TU Wien) Dale Miller (INRIA Saclay -- Ile-de-France) Ulrike Sattler (Univ. of Manchester) -------------- next part -------------- An HTML attachment was scrubbed... URL: From eernst at cs.au.dk Fri Sep 23 08:16:12 2011 From: eernst at cs.au.dk (Erik Ernst) Date: Fri, 23 Sep 2011 13:16:12 +0100 Subject: [TYPES/announce] Deadline in one week: Nominations for the AITO Dahl-Nygaard Prize Message-ID: [Apologies for multiple copies] *** DAHL-NYGAARD PRIZE *** The AITO Dahl-Nygaard Committee hereby requests nominations for the Dahl-Nygaard Prize which is awarded annually to individuals that have made significant technical contributions to the field of Object-Orientation. The prize is named after Ole-Johan Dahl and Kristen Nygaard whose pioneering conceptual and technical work in the sixties shaped that view of programming and modeling which is now known as object-orientation. The prize will be presented at the ECOOP conference in 2012. The prize consists of two awards given to a junior researcher (at most 7 years after obtaining the PhD degree) and a senior researcher. The senior researcher should have made a significant long-term contribution to the field in research or engineering. The junior researcher should have made a promising contribution to the field through a paper, a thesis, or a prototype implementation. *** The deadline for nominations is September 30th, 2011 *** Please send your nominations by email to dahl-nygaard at aito.org along with a short motivation, using the subject 'Dahl-Nygaard junior nomination' or 'Dahl-Nygaard senior nomination'. PS: Did you supervise a brilliant PhD student a few years ago? Then consider a DN junior prize nomination! -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From mvelev at gmail.com Sun Sep 25 13:42:54 2011 From: mvelev at gmail.com (Miroslav Velev) Date: Sun, 25 Sep 2011 12:42:54 -0500 Subject: [TYPES/announce] CFPs: abstracts due today for CFV'11 Workshop at ICCAD'11 Message-ID: Call for papers: CFV'11: Seventh International Workshop on Constraints in Formal Verification DoubleTree Hotel, San Jose, California, November 10, 2011 A satellite event of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD). 2011 Abstract submission deadline: September 25, 2011 Paper submission deadline: September 30, 2011 Date of workshop: November 10, 2011 (right after ICCAD?11) Overview --------------------------------------------- Formal verification is of crucial significance in the development of hardware and software systems. In the last few years, tremendous progress was made in both the speed and capacity of constraint technology. Most notably, SAT solvers have become orders of magnitude faster and capable of handling problems that are orders of magnitude bigger, thus enabling the formal verification of more complex computer systems. As a result, the formal verification of hardware and software has become a promising area for research and industrial applications. The main goals of the Constraints in Formal Verification workshop are to bring together researchers from the CSP/SAT and the formal verification communities, to describe new applications of constraint technology to formal verification, to disseminate new challenging problem instances, and to propose new dedicated algorithms for hard formal verification problems. This workshop will be of interest to researchers from both academia and industry, working on constraints or on formal verification and interested in the application of constraints to formal verification. Scope --------------------------------------------- The scope of the workshop includes topics related to the application of constraint technology to formal verification, namely: - application of constraint solvers to hardware verification; - application of constraint solvers to software verification; - dedicated solvers for formal verification problems; - challenging formal verification problems. Submissions --------------------------------------------- Submissions should be in the IEEE format and in one of the following types: - a regular paper of up to 6 pages; - a short paper of up to 4 pages, describing an industrial experience. Workshop papers should be submitted electronically in pdf format. Abstract and paper submissions should be e-mailed to the workshop chair at: mvelev at gmail.com Important Dates --------------------------------------------- - abstract submission deadline: September 25, 2011 - paper submission deadline: September 30, 2011 - notification of acceptance: October 10, 2011 - camera-ready version deadline: October 25, 2011 - workshop date: November 10, 2011 Invited Speaker --------------------------------------------- Carl Seger, Intel, U.S.A. Natarajan Shankar, SRI, U.S.A. Workshop Chair --------------------------------------------- Miroslav Velev, Aries Design Automation, U.S.A. Program Committee -------------------------------------------- Maciej Ciesielski, University of Massachusetts, U.S.A. Masahiro Fujita, University of Tokyo, Japan Alex Groce, Oregon State University, U.S.A. Daniel Grosse, University of Bremen, Germany Michael Hsiao, Virginia Tech, U.S.A. Sumit Jha, University of Central Florida, U.S.A. Robert Jones, Intel, U.S.A. Peter-Michael Seidel, AMD, U.S.A. Andreas Veneris, University of Toronto, Canada Markus Wedler, University of Kaiserslautern, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From antonio at iist.unu.edu Mon Sep 26 20:15:49 2011 From: antonio at iist.unu.edu (Antonio Cerone) Date: Tue, 27 Sep 2011 08:15:49 +0800 (CST) Subject: [TYPES/announce] OpenCert 2011 - Final Call for Papers Message-ID: Call for Papers OpenCert 2011 5th International Workshop on Foundations and Techniques for OPEN SOURCE SOFTWARE CERTIFICATION Montevideo, Uruguay, 14-15 November 2011 Satellite Event of SEFM 2011 http://opencert.iist.unu.edu/ Abstract submission deadline: 3 October, 2011 (Extended) Paper submission deadline: 3 October, 2011 (Extended) CONTEXT & OBJECTIVES Over the past decade, the Open Source Software (OSS) phenomenon has had a global impact on the way software systems and software-based services are developed, distributed and deployed. Widely acknowledged benefits of OSS include reliability, low development and maintenance costs, as well as rapid code turnover. Linux distributions, Apache and MySQL serve, among many other examples, as a testimony to its success and resilience. However, state-of-the-art OSS, by the very nature of its open, unconventional, distributed development model, make software quality assessment, let alone full certification, particularly hard to achieve and raises important challenges both from the technical/methodological and the managerial points of view. This makes the use of OSS, and, in particular, its integration within complex industrial-strength applications, with stringent security requirements, a risk but also an opportunity and a challenge for rigorous, mathematically based, methods in software analysis and engineering. In such a context, the aim of this workshop is to bring together researchers from academia and industry who are broadly interested in the quality assessment of open source software projects, ultimately leading to the establishment of coherent certification processes, at different levels. Following the success of the four previous editions (collocated to ETAPS'07, in Braga, OSS'08, at IFIP WCC, in Milan, ETAPS'09 in York and SEFM 2010 in Pisa, respectively), the workshop will focus on formal methods and model-based techniques that appear promising to facilitate OSS certification. Foundational, methodological and pragmatic issues will be addressed, through both standard technical communications and reports on concrete case-studies and experimental data. CONTRIBUTIONS Contributions are expected to foster a broad debate on OSS assessment and certification, integrating techniques and elements from areas as different as - product and process certification - certification standards - formal modelling and verification (model checking and theorem proving) - software quality and reverse engineering - static analysis, testing and inspection - safety, security and usability certification - languages and architectures - software evolution and reconfigurability - automated source code analyses - cloud computing - knowledge management - empirical studies SUBMISSION The two-day workshop will feature invited talks, a panel discussion and contributed paper presentations. All contributions, in the form of either full technical papers, between 10 and 16 pages, or short papers up to 5 pages, will undergo a peer-review process. All papers should be written in English and in ECEASST format. Short papers can be positions papers, tool papers or presentation of new ideas or results which are at an early stage of development and which have not yet been thoroughly evaluated. Detailed information on the submission procedure is available at opencert.iist.unu.edu. PUBLICATION Accepted full papers will be published in Electronic Communications of the EASST (ECEASST). Authors of short papers may resubmit a full paper version of their work after the workshop, which will be reviewed for inclusion in the ECEASST final proceedings. Selected extended papers will be invited to appear in a special issue of a reputed journal in the field. A final decision on this issue depends on the number and quality of the submissions. IMPORTANT DATES - Abstract Submission deadline: 3 October 2011 - Paper Submission deadline: 3 October 2011 - Acceptance notification: 20 October 2011 - Final version due: 31 October 2011 WORKSHOP ORGANIZATION PROGRAM CO-CHAIRS Luis Barbosa, Dep. de Inform??tica, Universidade do Minho, Portugal Dimitrios Settas, UNU-IIST, United Nations University, Macau SAR China ORGANISATION CO-CHAIRS Antonio Cerone, Siraj Shaikh, PROGRAM COMMITTEE Luis Barbosa, Dep. de Inform?tica, Universidade do Minho, Portugal (Co-chair) Andrea Capiluppi, University of East London, UK Francisco Carvalho-Junior, Univ. Federal do Cear?, Brazil Antonio Cerone, UNU-IIST, United Nations University, Macau SAR China Ernesto Damiani, Universit? di Milano, Italy Roberto Di Cosmo, Universit? Paris Diderot / INRIA, France Rafael Dueire Lins, Univ. Federal de Pernambuco, Brazil George Eleftherakis, CS Department, City College, Thessaloniki, Greece Elsa Estevez, UNU-IIST, United Nations University, Macau SAR China Fabrizio Fabbrini, ISTI-CNR, Italy Andrei Formiga, Univ. Federal da Para?ba, Brazil Dan Ghica, University of Birmingham, UK Rene Rydhof Hansen, Aalborg University, Denmark Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Panagiotis Katsaros, Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece Tim Kelly, York University, UK Paddy Krishnan, Bond University, Australia Paolo Milazzo, Dipartimento di Informatica, Universit? di Pisa, Italy Jose Miranda, MULTICERT, Portugal John Noll, LERO, Ireland Alexander K. Petrenko, ISP, Russian Academy of Science, Russian Federation Alejandro Sanchez, Univ. Nacional de San Luis, Argentina Dimitrios Settas, UNU-IIST, United Nations University, Macau SAR China (Co-chair) Sulayman K. Sowe, UNU-IAS, Japan Ioannis Stamelos, Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece Ralf Treinen, PPS, Universit? Paris Diderot, France From agata at logic.at Wed Sep 28 05:14:48 2011 From: agata at logic.at (Agata Ciabattoni) Date: Wed, 28 Sep 2011 11:14:48 +0200 (CEST) Subject: [TYPES/announce] 2-YEAR POSTDOCTORAL POSITION ON STRUCTURAL PROOF THEORY Message-ID: 2-YEAR POSTDOCTORAL POSITION ON STRUCTURAL PROOF THEORY * The Vienna University of Technology is looking to recruit one Postdoctoral Research Assistant to work on the FWF-funded project "Nonclassical Proofs: theory, applications and tools", under the direction of Agata Ciabattoni. * The work will take place within the Institute of Computer Languages (Theory and Logic group) of the Vienna University of Technology. * The post is for an appointment of up to 24 months and is available from January 2012. * Applicants should have (or shortly expect to receive) a PhD in Mathematics, Computer Science or a closely related field, a strong background in structural proof theory, nonclassical logics, and, preferably, knowledge of universal algebra or complexity theory. Ability to work independently but also with academic colleagues and PhD students, flexibility and teamwork, are all important qualifications for this position. * Further particulars, including details of how to apply, are available from: http://www.logic.at/staff/agata/positions.html. * Potential applicants are also welcome to send informal inquiries to Agata Ciabattoni (agata at logic.at) * The closing date for applications is Thursday, December 1st 2011. From spf at cs.unm.edu Wed Sep 28 11:08:13 2011 From: spf at cs.unm.edu (Stephan Falke) Date: Wed, 28 Sep 2011 17:08:13 +0200 Subject: [TYPES/announce] CfP: COMPUTING 2011 - Symposium on 75 Years of Turing Machine and Lambda-Calculus Message-ID: <4E83385D.50100@cs.unm.edu> ============================================================================= Call for Participation COMPUTING 2011 Symposium on 75 Years of Turing Machine and Lambda-Calculus KIT, Karlsruhe, Germany, October 20-21, 2011 http://baldur.iti.kit.edu/Computing2011 ============================================================================= The Institute of Cryptography and Security and the Institute of Theoretical Informatics of Karlsruhe Institute of Technology (KIT) announce COMPUTING 2011, a symposium devoted to the 75th anniversary of two pioneering works on the theory of computation: ?On Computable Numbers, with an Application to the Entscheidungsproblem? by Alan Turing and ?An Unsolvable Problem of Elementary Number Theory? by Alonzo Church. The symposium will review the work of Church and Turing and its influence on contemporary Theoretical Computer Science. Talks at the symposium are intended to cover--among others--topics like * Different Models of Computing (including, e.g., Parallel, Quantum, and Molecular/DNA Computing), * Complexity (including Computational and Parameterized Complexity), * Decidability of various Logical and Computational Systems, * Termination Analysis, * Computational Geometry. The symposium will consist of invited talks given by both established and junior scientists. Keynote Speakers ---------------- * Henk Barendregt, Radboud University Nijmegen, The Netherlands * Christof Teuscher, Portland State University, USA * Wolfgang Thomas, RWTH Aachen University, Germany Registration ------------ We invite you to attend COMPUTING 2011. Registration is open at http://baldur.iti.kit.edu/Computing2011/registration.html Organization ------------ COMPUTING 2011 is organized by the Institute of Cryptography and Security (IKS) and the Institute of Theoretical Informatics (ITI) of Karlsruhe Institute of Technology. Symposium Chair / Contact ------------------------- Olga Tveretina, olga at ira.uka.de Program / Organizing Committee ------------------------------ Bernhard Beckert, ITI Jacques Calmet, IKS Stephan Falke, ITI Christoph Gladisch, ITI Dennis Hofheinz, IKS J?rn M?ller-Quade, IKS Peter H. Schmitt, ITI Carsten Sinz, ITI Mana Taghdiri, ITI Olga Tveretina, ITI Roland Vollmar, IKS Thomas Worsch, IKS COMPUTING 2011 will be co-located with Deduktionstreffen 2011 (http://baldur.iti.kit.edu/deduktionstreffen11). The symposium is sponsored by KIT's Karlsruhe House of Young Scientists (KHYS). From james at cs.ioc.ee Wed Sep 28 16:04:54 2011 From: james at cs.ioc.ee (James Chapman) Date: Wed, 28 Sep 2011 21:04:54 +0100 Subject: [TYPES/announce] MSFP 2012: Call for Papers Message-ID: <23FAEDB2-DE68-4CB9-8269-7240E94E5EFD@cs.ioc.ee> 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. Important Dates: ================ Submission of papers: 16 December 2011 Notification: 20 January 2012 Final versions due: 3 Feburary 2012 Workshop: 25 March 2012 Invited Speakers: ================= To be arranged. Submission: =========== Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). After the workshop, there might be an opportunity to publish selected papers in a journal special issue. All submissions must be in PDF format and use the EPTCS style files. Submissions can be made through the EasyChair website, at http://www.easychair.org/conferences/?conf=msfp2012 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 giuseppemag at gmail.com Thu Sep 29 08:49:36 2011 From: giuseppemag at gmail.com (Giuseppe Maggiore) Date: Thu, 29 Sep 2011 14:49:36 +0200 Subject: [TYPES/announce] Friendly F# - lots of free lecture notes/slides available Message-ID: Hi! I wanted to notify whoever may be interested that we have just added a (free) set of slides about the book. The slides *do not* require the book and contain a lot of stuff that is also in the book, and we are going to use them in our next semester courses in game development (Verona) and functional programming (Venezia). The slides can be found at http://fsharpgamedev.codeplex.com/ We hope someone finds them useful or interesting, and if anyone has any notes or corrections to improve the work then please tell us :) -- Giuseppe Maggiore Ph.D. Student (Languages and Games) Windows Phone 7 Italian Metro Trainer Mobile: +393319040031 My book: Friendly F#, fun with game programming My game: Galaxy Wars From eberinge at cs.princeton.edu Thu Sep 29 10:20:33 2011 From: eberinge at cs.princeton.edu ( Lennart Beringer) Date: Thu, 29 Sep 2011 10:20:33 -0400 (EDT) Subject: [TYPES/announce] ITP 2012: Call for workshop proposals In-Reply-To: Message-ID: ITP 2012: Third Conference on Interactive Theorem Proving Princeton, NJ, August 13 - 16, 2012 Conference home page: itp2012.cs.princeton.edu Call for workshop proposals The ITP conference series ------------------------- 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 third ITP conference, ITP 2012, will be held at Princeton University, between August 13th and August 16th, 2012. Scope and organization of workshops ----------------------------------- 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 on university premises. 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. Participants will be able to choose between hotel accommodation or accommodation in university dormitories, both in walking distance to the conference venue. 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 programme ready by July 1st 2012. 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 itp2012 at easychair.org, no later than December 5th, 2011. The workshop selection committee consists of the ITP chairs Andrew Appel, Princeton University Lennart Beringer, Princeton University Amy Felty, University of Ottawa. Selected workshops will be notified by January 9th, 2012. From md466 at cam.ac.uk Thu Sep 29 12:59:45 2011 From: md466 at cam.ac.uk (Mike Dodds) Date: Thu, 29 Sep 2011 17:59:45 +0100 Subject: [TYPES/announce] APLAS'11 poster session - Extended deadline: 7th October Message-ID: <5BB77261-9588-449D-A871-F7D2C595DBCE@cam.ac.uk> APLAS: CALL FOR POSTER PRESENTATIONS *** NEW SUBMISSION DEADLINE: 7th OCTOBER, 2011 *** The Ninth Asian Symposium on Programming Languages and Systems (APLAS 2011) http://flolac.iis.sinica.edu.tw/aplas11/ 5-7th December 2011 Kenting, Taiwan *EXTENDED DEADLINE* for Abstract Submission: 7th October, 2011 APLAS 2011 will include a poster 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. SCOPE: Poster 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, analysis, transformation; - software security, safety, verification; - concurrency, constraints, domain-specific languages; - tools for programming, verification, implementation. FORMAT: A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. If you need more space, contact the poster chair (mike.dodds AT cl.cam.ac.uk). To prepare a good poster, search the Web for "poster presentation" and you will find many useful resources. REGISTRATION INFORMATION: Each presenter should e-mail a 1-2 page abstract in PDF or PostScript to the poster chair (Mike Dodds: mike.dodds AT cl.cam.ac.uk) by October 7th 2011. The abstract should include the title, author(s), affiliation(s), and summary of the work. A LaTeX template is available at http://www.cl.cam.ac.uk/~md466/aplas2011/aplas_poster_template.tex . The program of the poster session will be announced by October 21st, 2011. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. IMPORTANT DATES: - 1-2 pages abstract submission *EXTENDED* 7th October 2011 - announcement of poster session program 21st October 2011 - conference 5th-7th December 2011 CONTACT INFORMATION: For additional information, clarifications, questions, or special requirements, please contact the APLAS 2011 Poster Chair, Mike Dodds (mike.dodds AT cl.cam.ac.uk). From ggrov at staffmail.ed.ac.uk Fri Sep 30 05:52:52 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Fri, 30 Sep 2011 10:52:52 +0100 Subject: [TYPES/announce] VSTTE 2012 verification competition: call for participation Message-ID: VSTTE 2012 Verification Competition ----------------------------------- A software verification competition is organized on behalf of the VSTTE 2012 conference (https://sites.google.com/site/vstte2012). The purposes of this competition are: to help promote approaches and tools, to provide new verification benchmarks, to stimulate further development of verification techniques, and to have fun. The contest takes place during two days, 17-19 November 2011, two months prior to the conference. Problems will be put on the website of the conference. Solutions must be sent by email to the competition organizers. Any programming language, specification language, and verification tool is allowed. Problems -------- There will be several, independent problems. Each problem is presented as an algorithm, using English or pseudocode, and a list of properties to formally prove about it, also expressed in plain English and standard mathematical notation. Evaluation ---------- Submissions are ranked according to the total sum of points they score. Each problem includes several sub-tasks, e.g. safety, termination, behavioral correctness, etc., and each sub-task is given a number of points. While evaluating the submissions, judges take into account the accuracy and thoroughness of solutions as well as their terseness and elegance. A certain degree of subjectivity is inevitable and should be considered as part of the game. Participants ------------ Anybody interested can take part in the contest. Team work is allowed. However, only teams up to 4 members are eligible for the first prize. The technical requirements are as follows: - access to the web to download the problems (PDF file); - access to the email to submit the solutions; - any software used in the solutions should be freely available to the public (this does not exclude closed source programs such as Microsoft's Z3) and usable on an x86 Linux or Windows machine. Submission ---------- A submission is a (possibly compressed) tarball that contains exactly one directory (named by the team, for instance). This directory should contain at least a text file named README, and one directory for each problem solved. Thus it must look like: team/ -+ +- README +- problem1/ +- problem2/ + ... +- problemN/ +- other stuff... The README file should contain the following information: - contact information (email); - detailed description of the submitted solutions: properties that have been specified and/or proved, restrictions and/or generalizations, anything that may facilitate the review; - detailed instructions to replay the solutions, including the software to use, URLs to get it from, compilation commands, etc. Organizers ---------- - Jean-Christophe Filli?tre (CNRS, France) - Andrei Paskevich (Univ Paris Sud, France) - Aaron Stump (University of Iowa, USA) Schedule -------- Thursday 17 Nov 2011, 15:00 UTC - competition starts Saturday 19 Nov 2011, 15:00 UTC - competition stops Monday 12 Dec 2011 - the winner is notified 28-29 Jan 2012 - results are announced at VSTTE 2012 Prize ----- The winner is awarded a talk slot at VSTTE 2012, to present any research of his/her choice of interest for the VSTTE community. In particular, a presentation of solutions to the competition problems and/or of the techniques and system used would be appreciated. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From carlos.martin at urv.cat Fri Sep 30 13:24:45 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Fri, 30 Sep 2011 19:24:45 +0200 Subject: [TYPES/announce] FSFLA 2011: call for participation Message-ID: ********************************************************************* 2011 INTERNATIONAL FALL SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS FSFLA 2011 (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain October 31 ? November 4, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/fsfla2011/ ********************************************************************* ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There is no overlap in the class schedule. The previous event was SSFLA 2011 (http://grammars.grlmc.com/ssfla2011/). COURSES AND PROFESSORS: - Franz Baader (Technische Dresden), Reasoning in Description Logics [intermediate, 6 hours] - Manfred Droste (Leipzig), Weighted Automata and Weighted Logic [introductory/advanced, 8 hours] - Max H. Garzon (Memphis), DNA Codeword Design and DNA Languages [introductory/intermediate, 10 hours] - Venkatesan Guruswami (Carnegie Mellon), The Complexity of Approximate Constraint Satisfaction [intermediate, 6 hours] - Tao Jiang (California Riverside), Average-case Analysis and Lower Bounds by the Incompressibility Method [intermediate, 6 hours] - Michael Moortgat (Utrecht), Type-logical Grammars: Expressivity, Parsing Complexity [introductory/advanced, 8 hours] - Helmut Seidl (Technische M?nchen), Macro Treetransducers for XML Processing [intermediate, 6 hours] - Alan Selman (Buffalo), Probabilistic Complexity Classes [intermediate, 10 hours] - Jeffrey Shallit (Waterloo), Automatic Sequences, Decidability, and Enumeration [intermediate, 6 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/fsfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until July 31, 2011), - 15 euros (for payments after July 31, 2011). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; account holder's address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention FSFLA 2011 and your full name in the subject. A receipt will be provided on site. Bank transfers should not involve any expense for the School. Students may be refunded only in the case when a course gets cancelled due to the unavailability of the instructor. For early reduced rates, please notice that the date that counts is the date of the arrival of the fees to the School?s account. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to complete the registration and the payment earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the completion of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: June 4, 2011 Starting of the registration: June 4, 2011 Early registration deadline: July 31, 2011 Starting of the School: October 31, 2011 End of the School: November 4, 2011 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/fsfla2011/ POSTAL ADDRESS: FSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputaci? de Tarragona Universitat Rovira i Virgili From georg.moser at uibk.ac.at Sat Oct 1 17:08:42 2011 From: georg.moser at uibk.ac.at (Georg) Date: Sat, 01 Oct 2011 23:08:42 +0200 Subject: [TYPES/announce] RTA 2012: First Call For Papers Message-ID: <4E87815A.2030706@uibk.ac.at> ******************************************************** * First Call For Papers * * 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 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) is the major forum for the presentation of research on rewriting. IMPORTANT DATES: Abstract: Jan 04, 2012 Paper Submission: Jan 09, 2012 Notification: Mar 02, 2012 Final version: Mar 26, 2012 RTA 2012 seeks original submissions 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; * Foundations: equational logic; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; combination; * 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; * Implementation: implementation techniques; parallel execution; rewrite and completion tools; confluence and termination checking; certification of rewriting properties; abstract machines; explicit substitutions; BEST PAPER AWARD: An award is given to the best paper or papers as decided by the program committee. STUDENT SUPPORT: Limited student support will be available and announced in future versions of this call. PROGRAMME COMMITTEE CHAIR: * Ashish Tiwari SRI International, Menlo Park, CA http://www.csl.sri.com/users/tiwari PROGRAMME COMMITTEE: * Andreas Abel Ludwig-Maximilians-University Munich * Zena Ariola University of Oregon * Paolo Baldan Universit? degli Studi di Padova * Ahmed Bouajjani University of Paris 7 * Evelyne Contejean LRI Universit? Paris-Sud-CNRS * Ir?ne Anne Durand LaBRI Universit? of Bordeaux * J?rg Endrullis Vrije Universiteit Amsterdam * Silvio Ghilardi Universit? degli Studi di Milano * Guillem Godoy Universidad Polit?cnica de Catalu?a * Nao Hirokawa Japan Advanced Institute of Science and Technology * Deepak Kapur University of New Mexico, Albuquerque, NM * Jordi Levy IIIA - CSIC * Paul-Andre Mellies University of Paris 7 * Pierre-Etienne Moreau Ecole des Mines de Nancy * Joachim Niehren INRIA Lille * Grigore Rosu University of Illinois at Urbana-Champaign * Albert Rubio Universidad Polit?cnica de Catalu?a * Masahiko Sakai Nagoya University * Carolyn Talcott SRI International * Ren? Thiemann University of Innsbruck CONFERENCE CHAIR: * Masahiko Sakai Nagoya University PUBLICATION: RTA 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. STACS, FSTTCS and ICLP proceedings also appear in LIPIcs. See http://www.dagstuhl.de/en/publications/lipics for more information about LIPIcs. Accepted papers will be considered for publication in a special issue of the journal Logical Methods in Computer Science (LMCS). SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers, applications of rewriting techniques, problem sets, and system descriptions. The page limit for submissions is 10 proceedings pages for system descriptions and 15 proceedings pages for all other categories. Additional material may be provided 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. Submissions are accepted in either Postscript or PDF format. Abstracts and papers must be submitted electronically through the EasyChair system at: http://www.easychair.org/conferences/?conf=RTA2012 Questions concerning submissions may be addressed to the PC chair, Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com From guttman at WPI.EDU Sun Oct 2 19:52:19 2011 From: guttman at WPI.EDU (Joshua D. Guttman) Date: Sun, 02 Oct 2011 19:52:19 -0400 Subject: [TYPES/announce] [POST] Principles of Security and Trust: Final CFP Message-ID: <86zkhjosss.fsf@guttman2.cs.wpi.edu> [[ POST: abstracts due Friday, 7 Oct papers due Friday, 14 Oct Language-based security is a highly relevant topic, and people involved in the Types list are extremely welcome to submit papers. ]] POST -- Principles of Security and Trust -- is a new main conference at ETAPS. ETAPS, the European joint conferences on Theory and Practice of Software, has been a group of five very well-regarded conferences that have met together every March or April since 1998. POST will be the first addition to ETAPS since it started. Our invited speaker will be Cynthia Dwork of Microsoft Research. We would encourage you to send in submissions. We believe that POST will promptly become a very highly regarded venue for work on security and trust. We want to focus on the principles of the subject, emphasizing how practical problems motivate the foundations, and how foundations help to reshape practice. URL: http://web.cs.wpi.edu/~guttman/post12/ Location: Tallinn, Estonia Last week of March, 2012 Submissions Abstract: 7 Oct Papers: 14 Oct Rebuttal: 28 -- 30 Nov Notification: 16 Dec Your submissions will help create a high-value meeting place for our community. Thanks! Joshua ~~~~~~~~~~~~~~~~ POST 2012 First Conference on Principles of Security and Trust Tallinn, Estonia A Main Conference of ETAPS European joint conferences on Theory and Practice of Software http://www.etaps.org/2012 http://web.cs.wpi.edu/~guttman/post12/ Conference Description Principles of Security and Trust is a broad forum related to the theoretical and foundational aspects of security and trust. Papers of many kinds are welcome: new theoretical results, practical applications of existing foundational ideas, and innovative theoretical approaches stimulated by pressing practical problems. POST combines and replaces a number of successful and longstanding workshops in this area: Automated Reasoning and Security Protocol Analysis (ARSPA), Formal Aspects of Security and Trust (FAST), Security in Concurrency (SecCo), and the Workshop on Issues in the Theory of Security (WITS). A subset of these events met jointly as an event affiliated with ETAPS in 2011 under the name Theory of Security and Applications (TOSCA). POST is now 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 2012 is the 15th joint conference in this series. Call for Papers We seek submissions proposing theories to clarify security and trust within computer science; submissions establishing new results in existing theories; and also submissions raising fundamental concerns about existing theories. We welcome new techniques and tools to automate reasoning within such theories, or to solve security and trust problems. Case studies that reflect the strengths and limitations of foundational approaches are also welcome, as are more exploratory presentations on open questions. Areas of interest include: Access control Anonymity Authentication Availability Cloud security Confidentiality Covert channels Crypto foundations Economic issues Information flow Integrity Languages for security Malicious code Mobile code Models and policies Privacy Provenance Reputation and trust Resource usage Risk assessment Security architectures Security protocols Trust management Web service security Productive techniques have included automated reasoning, compositionality and transformation, language-based methods, logical formalization, quantitative methods, and static analysis. Rebuttal phase Authors will be given a 60 hour period to read and respond to the reviews of their papers before the PC meeting. This process will not, however, provide additional iterations. Submission Guidelines Papers must be written in English, unpublished and not submitted for publication elsewhere. The proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science series (currently pending). Submissions must be in PDF format, formatted in the LNCS style (as specified on this page) and at most 20 pages long. The 20 pages must include references and all material intended for publication. Additional material, that is not to be included in the final version, but may help assessing the merits of the submission - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices, and papers must be understandable without them. Papers are submitted via the Easychair conference management system at https://www.easychair.org/conferences/?conf=post2012 A special issue of the Journal of Computer Security will be devoted to selected papers of POST 2012. Submissions will be solicited after the meeting. Important Dates 7 October 2011: Submission deadline for abstracts (strict) 14 October 2011: Submission deadline for full papers (strict) 28 November 2011: Rebuttal phase begins 30 November 2011: Rebuttal phase ends 16 December 2011: Notification of acceptance 6 January 2012: Camera-ready versions due The submission deadline for papers is strict (site will close at 23:59 GMT-11). Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn. Invited Speaker Cynthia Dwork, Microsoft Research Programme Committee Michael Backes, Saarland and MPI-SWS, DE Anindya Banerjee, IMDEA Software Institute, ES Gilles Barthe, IMDEA Software Institute, ES David Basin, ETH Zurich, CH Veronique Cortier, CNRS, Loria, FR Pierpaolo Degano, Universit? di Pisa, IT (co-chair) Andrew Gordon, Microsoft Research and University of Edinburgh, UK Joshua Guttman, WPI, USA (co-chair) Ralf K?sters, Universit?t Trier, DE Steve Kremer, INRIA, ENS Cachan, FR Peeter Laud, Cybernetica AS and University of Tartu, EE Gavin Lowe, Oxford University, UK Heiko Mantel, Technische Universit?t Darmstadt, DE Sjouke Mauw, Universit? du Luxembourg, LU Catherine Meadows, NRL, USA John C Mitchell, Stanford, USA Sebastian M?dersheim, DTU, DK Carroll Morgan, University of New South Wales, AU Mogens Nielsen, University of Aarhus, DK Catuscia Palamidessi, INRIA, ?cole Polytechnique, FR Andrei Sabelfeld, Chalmers, SE Nikhil Swamy, Microsoft Research, USA Luca Vigan?, Universit? di Verona, IT -- Joshua D. Guttman WPI, Computer Science From xie at csc.ncsu.edu Sun Oct 2 23:34:42 2011 From: xie at csc.ncsu.edu (Tao Xie) Date: Mon, 3 Oct 2011 11:34:42 +0800 Subject: [TYPES/announce] ECOOP 2012 Call for Workshops Message-ID: ECOOP 2012 Call for Workshops http://ecoop12.cs.purdue.edu/ ECOOP 2012 will host an exciting array of workshops that address a variety of topics in object-oriented technology. A workshop is a forum for exchanging ideas and theories that are still in an evolutionary stage. Typically, a workshop will either address a focused topic in depth or explore connections between object-oriented technologies and other areas of interest. ECOOP 2012 invites proposals for workshops lasting one or two days. ECOOP 2012 workshops will be held 11?C13 June, 2012. Proposals A workshop proposal should include the following information: - Name of the workshop - Duration of the workshop (half-day, full-day, multi-day) - An abstract: 150-200 words describing the workshop, suitable for the ECOOP Web site - A preliminary Call For Workshop Papers describing the workshop's focus and its main topics - A summary of the workshop format: e.g., refereed papers, and/or short papers, and/or invited talks, and/or problem solving, and/or brainstorming sessions. How will papers or other submissions be reviewed? - A description of how the workshop papers and results will be published or otherwise disseminated (see the "Dissemination of Workshop Results" section below) - References to previous editions of the workshop (if any) including information about the number of participants - About each organizer: + Name, affiliation, and contact information + Primary contact: identify one organizer as the primary contact + A brief biography (up to 200 words), focusing on the organizer's expertise in the field and experience as a workshop organizer + Any special requirements that the workshop may have Proposal Submission and Review Workshop proposals should be submitted by email to the ECOOP 2012 workshop organizers, Adam Welc and Patrick Eugster, at ecoop12-workshops at cs.purdue.edu. Proposals will be reviewed by the ECOOP 2012 workshop organizers as they arrive. Notification for a given proposal will be sent two weeks after its submission. Therefore, proposal acceptance will be on a first-come, first-served basis. The number of accepted proposals will be limited by the availability of the conference rooms. Each proposal will be evaluated according to the value and relevance of its workshop topic, the expertise and experience of the workshop organizers, and the potential of the proposed workshop to attract participants and generate useful results. Dissemination of Workshop Results A proposal should clearly state how the results of the workshop, that is the papers and other outcomes, will be made available to participants and others, both before and after the workshop event. The ECOOP 2012 workshop organizers will provide guidance to the organizers of accepted workshops that wish to publish proceedings in the ACM Digital Library. Contact For additional information about this Call for Workshops, please contact the ECOOP 2012 workshop organizers, Adam Welc and Patrick Eugster, at ecoop12-workshops at cs.purdue.edu. -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at itu.dk Tue Oct 4 02:54:38 2011 From: carsten at itu.dk (=?iso-8859-1?Q?Carsten_Sch=FCrmann?=) Date: Tue, 4 Oct 2011 08:54:38 +0200 Subject: [TYPES/announce] PhD Positions on Trustworthy Electronic Elections Message-ID: <45DBEE38-0D88-4ABA-921E-851D053658E4@itu.dk> PhD Positions on Trustworthy Electronic Elections (for more information see http://www.demtech.dk/) The IT University of Copenhagen invites applications for several PhD positions on developing and evaluating trustworthy electronic election technology. With this project, we try to prove that it is possible to modernize the democratic process using information technology without losing the trust of the voters. The PhD positions are concerned with different aspects of this research question, for example, how to design formal techniques to hold machines accountable for their actions, to run trusted code in untrusted environments, to develop software in a trust-preserving way, and to evaluate technology form a societal point of view. Applicants should have a strong background in some combination of the following areas in computer science: cryptography, concurrency, epistemic logics, formal methods, modal logics, proof assistants, logical frameworks, requirement engineering, security protocol design, software engineering, theorem proving, type theory. Successful PhD applicants will want work with epistemic logics and logical frameworks, epistemic logics and cryptography, or with formal trust preserving software engineering techniques. To apply, please visit the project homepage http://www.demtech.dk/. Early expressions of interest are encouraged: Carsten Schuermann (carsten at itu.dk), Joseph Kiniry (kiniry at acm.org), Randi Markussen (rmar at itu.dk), Christopher Gad (chga at itu.dk), or nina Boulus (nbou at itu.dk). Best regards, -- Carsten Schuermann and Joseph Kiniry -------------- next part -------------- An HTML attachment was scrubbed... URL: From hidaka at nii.ac.jp Tue Oct 4 05:47:00 2011 From: hidaka at nii.ac.jp (Soichiro Hidaka) Date: Tue, 04 Oct 2011 18:47:00 +0900 Subject: [TYPES/announce] NII Shonan Meetings - Call for seminar proposals Message-ID: <20111004184700H.hidaka@nii.ac.jp> <<< This is the second post. Proposals are received throughout the year, but the next deadline is December 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 Alex.Simpson at ed.ac.uk Tue Oct 4 10:20:40 2011 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 04 Oct 2011 15:20:40 +0100 Subject: [TYPES/announce] 5th Scottish Category Theory Seminar Message-ID: <20111004152040.14723m4j76q7jmas@www.staffmail.ed.ac.uk> This meeting may be of interest to some readers of the types list. SCOTTISH CATEGORY THEORY SEMINAR http://personal.cis.strath.ac.uk/~ng/sct.html *** Fifth Meeting *** *** Informatics Forum, University of Edinburgh *** *** Friday 25 November 2011, 2.00-5.40pm *** The fifth meeting of the Scottish Category Theory Seminar will feature talks by the following speakers. - Anders Kock (Aarhus University) - Paul-Andre Mellies (CNRS, Universite Paris 7 - Denis Diderot) - Tom Leinster (University of Glasgow) The meeting is open to all. There is no registration, but, if you intend to come, it would be helpful (but is not essential) to let us know by email: scotcats at cis.strath.ac.uk This meeting is generously supported by the Glasgow Mathematical Journal Trust. Alex Simpson (local organizer) (ScotCats organizers: Neil Ghani, Tom Leinster, AS) -- 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 d.pattinson at imperial.ac.uk Tue Oct 4 10:36:15 2011 From: d.pattinson at imperial.ac.uk (Pattinson, Dirk) Date: Tue, 4 Oct 2011 14:36:15 +0000 Subject: [TYPES/announce] Short Notice: Wessex Theory Seminar, *Thu Oct 6*, Imperial College London Message-ID: <28805241-050C-46E8-B04D-379598DECC2A@imperial.ac.uk> Dear all: following the just-in-time approval of the date for a PhD defense, we are making use of the presence of the examiners to hold a small workshop the following day, i.e. on: Thursday, October 6, 2011, 12:00 onwards at: Department of Computing, Imperial College London, 180 Queen's Gate, London, UK in: Room 217/218 (ground floor, Queen's Gate entrance) that everybody is cordially invited to attend. The preliminary schedule is as follows: 12:00 - 1:00 lunch (Coco Momo / Senior Common Rom) 1:00 - 2:00 Alexander Kurz: Regular languages with binders 2:00 - 2:30 coffee 2:30 - 3:15 Dirk Pattinson: Towards Coinductive Fixpoint Logics 3:15 - 4:00 James Brotherston: Craig interpolation in displayable logics 4:00 - 4:30 coffee 4:30 - 5:30 Dexter Kozen: TBA 5:30 - Pub / Dinner If you would like to join us for lunch, please meet us either outside rooms 217/218 or in the (adjacent) foyer of the Queen's Gate entrance. Your best bet to reach the department is to take the underground to Gloucester Road, walk along Gloucester Road and then take a right into Queen's Gate Terrace: http://g.co/maps/dtjhg If you enter the building at 180 Queen's Gate, Rooms 217/218 will be on your immediate left, behind glass double doors. Access to the seminar room is (unfortunately) swipe card only, but we will be able to see you (and let you in) from the seminar room. If there are any questions, please feel free to email me. With all due apologies for the short notice, Dirk. From Andrew.Phillips at microsoft.com Tue Oct 4 11:39:00 2011 From: Andrew.Phillips at microsoft.com (Andrew Phillips) Date: Tue, 4 Oct 2011 15:39:00 +0000 Subject: [TYPES/announce] Contract Position for Biological Modelling Language Development Message-ID: <562F42F98B50CE48A99CE0CA0B045D59451F295B@DB3EX14MBXC304.europe.corp.microsoft.com> Contract Position for Biological Modelling Language Development Microsoft Research, Cambridge, UK - 4th October 2011 Microsoft Research Cambridge has available a 2-year contract position for development of a programming environment for designing and simulating computer models of biological systems. The environment supports a family of modelling languages and simulation algorithms, which are being used in a number of key scientific projects, from building computational circuits in DNA (http://research.microsoft.com/dna) to genetic engineering of living cells (http://research.microsoft.com/gec) to understanding and predicting the response of the human immune system (http://research.microsoft.com/spim). The candidate will be working in an exciting new field at the intersection of computer science and biology, and the results of the project could potentially have an impact on a broad community of researchers, both in academia and industry. The first objective of the position will be to extend existing biological modelling languages with high-level language constructs based on feedback from scientific collaborators in DNA computing, Synthetic Biology, Immunology and Developmental Biology. The language extensions will include high-level interaction mechanisms which mask some of the complexities of the lower-level languages, together with constructs for modelling biological experiments. The candidate will be expected to formalise these extensions using rigorous semantics and carry out the implementation work in F# for release online. If desired, the candidate will have the opportunity to publish the results in leading journals or conferences. The candidate will work closely with a User Interface developer, in order to connect the core language with a web interface, developed in Silverlight. The second objective of the project will be to integrate multiple modelling languages simultaneously within a common language runtime for biology. Preliminary details of this work are available from http://research.microsoft.com/bme/draft.pdf . The work will also involve extending the scope of the runtime to handle state-based and scenario-based modelling languages. The candidate must be willing to work in Cambridge, UK, and the contract is for 2 years. Interested candidates should contact Andrew Phillips (firstname.lastname at microsoft.com) with a CV. The start date is flexible, however the position is available from December 2011. Duration of contract: 2 years Location: Cambridge Education: MS. or Ph.D. in Computer Science. Required skills: * Strong applied functional programming skills in Standard ML, OCaml, F# or Haskell. * In-depth knowledge of programming language theory. * Experience in programming language implementation. * A strong desire to contribute to the scientific community through the development of concise, efficient, scalable languages and tools for modelling and simulation of biological systems. Additional desired skills: * Knowledge of stochastic simulation algorithms such as Gillespie's Direct Method, or ability to understand research articles on related algorithms for subsequent implementation. * Familiarity with process calculi and associated theory. * Experience with implementing inference-based type systems. Background: The candidate will be based in the Biological Computation Group at Microsoft Research in Cambridge. The group is studying biological systems across multiple scales and is tackling fundamental scientific questions across multiple domains. Current projects include designing molecular circuits made of DNA, and programming single cells that cooperate to perform complex functions over time and space. We also aim to understand the computation performed by cells during organ development, and how the adaptive immune system detects viruses and cancers in the human body, focusing on mechanism and function. We are tackling these questions through the development of computational models and domain-specific computational tools, in close collaboration with leading scientific research groups. The tools we develop are being integrated into a common modelling environment. Further information about the group is available at http://research.microsoft.com/biology , including links to our software tools, which are freely available for use by the scientific community. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dpw at cs.princeton.edu Tue Oct 4 14:10:17 2011 From: dpw at cs.princeton.edu (David Walker) Date: Tue, 04 Oct 2011 14:10:17 -0400 (EDT) Subject: [TYPES/announce] Underrepresented Problems for PL Researchers: A New Workshop at POPL 2012 In-Reply-To: Message-ID: <398620e5-f323-4c69-8355-2685e5a64ea1@suckerpunch-mbx-0.CS.Princeton.EDU> Off The Beaten Track (OBT): Underrepresented Problems for Programming Language Researchers Co-Located with POPL 2012 Philadelphia, USA http://www.cs.princeton.edu/~dpw/obt January 28th, 2012 ***IN A NUTSHELL*** Submitting to OBT is easy. Send us a 1-page PDF outlining an interesting, unusual, or controversial off-the-beaten-track problem or idea. We will make room for as many creative 5-minute talks as we can, interleaved with lively discussion. Alternatively, send us a 2-page PDF to apply for a longer talk. See the webpage for details: http://www.cs.princeton.edu/~dpw/obt ***MORE DETAIL*** 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 the goal for Off the Beaten Track. 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. 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. Workshop Structure The one-day workshop will be structured to include the following activities: * Short submitted talks, ~5 minutes long, interleaved with 5-15 minutes of discussion * Longer submitted talks, ~15-30 minutes long, interleaved with discussion * Longer invited talks * A panel The exact structure and length of talks will be decided on by the program chair in consultation with the program committee. For more details on submission requirements, see Important dates Paper submission Monday November 14, 2011 (11:59PM US EST) Author notification Friday December 9, 2011 Conference Saturday January 28, 2012 Program Committee Thomas Ball (Microsoft Research, Redmond) Trevor Jim (AT&T) Julia Lawall (DIKU) Boon Thau Loo (University of Pennsylvania) Geoff Mainland (Microsoft Research, Cambridge) Chung-chieh Shan (Cornell) David Walker (Princeton University, Chair) From nswamy at microsoft.com Wed Oct 5 13:58:21 2011 From: nswamy at microsoft.com (Nikhil Swamy) Date: Wed, 5 Oct 2011 17:58:21 +0000 Subject: [TYPES/announce] PLPV 2012: 2nd Call for papers (updated submission deadline) Message-ID: <55B8BB41BB08654590C07B5D630FD93A0B5A5A9A@TK5EX14MBXC288.redmond.corp.microsoft.com> !!! NB: Submission deadline updated to 14th October, 2011 !!! PLPV 2012 The Sixth ACM SIGPLAN Workshop Programming Languages meets Program Verification 24th January, 2012 Philadelphia, USA (Affiliated with POPL 2012) http://research.microsoft.com/en-us/um/people/nswamy/plpv12 -------------------------------------------------------------------------------- Overview The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications or 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 cross-pollination between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (Type-based, Hoare-logic-based, Abstract Interpretation-based, etc.), target different kinds of programming languages (functional, imperative, object-oriented, etc.), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc.). -------------------------------------------------------------------------------- Important Dates: Submission: 14th October, 2011 Notification: 8th November, 2011 Final Version: 15th November, 2011 Workshop: 24th January, 2012 -------------------------------------------------------------------------------- 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 (http://www.sigplan.org/authorInformation.htm). Submitted papers must adhere to the SIGPLAN republication policy (http://www.sigplan.org/republicationpolicy.htm). Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. To submit a paper, access the submission site at http://www.easychair.org/conferences/?conf=plpv2012. -------------------------------------------------------------------------------- Publication Accepted papers will be published by the ACM and will appear in the ACM Digital library. -------------------------------------------------------------------------------- Program Committee Amal Ahmed Northeastern University Lennart Augustsson Standard Chartered Koen Claessen Chalmers (co-chair) Martin Giese University of Oslo Daniel Licata Carnegie Mellon University Peter M?ller ETH Zurich Aleksandar Nanevski IMDEA Matthieu Sozeau INRIA Nikhil Swamy Microsoft Research (co-chair) David Walker Princeton University Dana Xu INRIA -------------------------------------------------------------------------------- Previous PLPVs: http://plpv.org From cristina.pereira at informatics-europe.org Thu Oct 6 05:53:30 2011 From: cristina.pereira at informatics-europe.org (Cristina Pereira) Date: Thu, 6 Oct 2011 11:53:30 +0200 Subject: [TYPES/announce] Informatics Europe 2011 Curriculum Best Practices Award - Parallelism and Concurrency Message-ID: <4E8D7A9A.50207@informatics-europe.org> The 2011 Curriculum Best Practices Award had its winners recently selected by a committee of international experts in the area of Parallelism and Concurrency. Two proposals have been selected and the winners, to be publicly announced at the 7^th European Computer Science Summit in Milan, will share the 30.000 EUR prize. Created by Informatics Europe to recognize outstanding European educational initiatives that improve the quality of informatics teaching and the attractiveness of the Informatics discipline the Curriculum Best Practices Award is in its first edition in 2011. Sponsored by Intel, the 2011 Award has been dedicated to curriculum initiatives in the research area of Concurrency and Parallelism. The Award committee, including some of the most prestigious worldwide leaders in the field, was chaired by Michel Raynal, from IRISA, and had the difficult task to select a winner among the several excellent proposals submitted. The winners will be publicly announced at the ECSS 2011 in Milan . The Award ceremony is scheduled to November 8, from 14h, at the Politecnico di Milano, Milan, Italy. Informatics Europe ------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From maffei at cs.uni-saarland.de Thu Oct 6 09:28:21 2011 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Thu, 6 Oct 2011 15:28:21 +0200 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 ***************************************************** 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. ***************************************************** 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 michael.mislove at gmail.com Thu Oct 6 09:45:44 2011 From: michael.mislove at gmail.com (Michael Mislove) Date: Thu, 6 Oct 2011 08:45:44 -0500 Subject: [TYPES/announce] Information Security Workshop Message-ID: <0222333D-8E86-42FC-9340-77A98CC3AC0C@gmail.com> Dear Colleagues, The workshop described below may be of interest to members of the Types community. All interested parties are encouraged to attend. best regards, Mike Mislove INFORMATION SECURITY AS A RESOURCE Thursday 13 ? Saturday 15 October, 2011 Oxford University Department of Computer Science website: http://www.cs.ox.ac.uk/ISR11/ contact: ed.blakey at queens.oxon.org Speakers include: Ed Blakey (Oxford) Min Chen (Oxford) Bob Coecke (Oxford) Simon Gay (Glasgow) Michael Huth (Imperial) Bart Jacobs (Radboud) Pasquale Malacaria (Queen Mary) Mike Mislove (Tulane) Dusko Pavlovic (Royal Holloway) Peter Ryan (Luxembourg) Geoff Smith (Florida International) Bogdan Warinschi (Bristol) Karoline Wiesner (Bristol) Glynn Winskel (Cambridge) The workshop aims to bring together researchers with relevant interests, including but by no means limited to: - cryptographic primitives; - non-standard resources, especially as arising in cryptography/informatics; - category- and domain-theoretic techniques suitable for abstracting the relevant properties of security from the incidental details of protocols? implementation. Organisers: Ed Blakey (Oxford) Bob Coecke (Oxford) Mike Mislove (Tulane) Dusko Pavlovic (Royal Holloway) This workshop is funded by the EPSRC grant Complexity and Decidability in Unconventional Computational Models (EP/G003017/1). http://gow.epsrc.ac.uk/ViewGrant.aspx?GrantRef=EP/G003017/1 From cav2012.publicity.chair at gmail.com Thu Oct 6 12:50:04 2011 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Thu, 6 Oct 2011 12:50:04 -0400 Subject: [TYPES/announce] CAV 2012: 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 J.T.Jeuring at uu.nl Fri Oct 7 03:08:27 2011 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Fri, 7 Oct 2011 09:08:27 +0200 Subject: [TYPES/announce] CICM 2012: Call for workshops Message-ID: 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 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 2012 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 (from half a day 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 printing and distributing informal proceedings for workshops that would like this service. All proposals should be sent via email to m.kohlhase at jacobs-university.de for consideration by the CICM 2012 organizers: Serge Autexier (DFKI Bremen): General Co-Chair Michael Kohlhase (Jacobs University): General Co-Chair Johan Jeuring (Utrecht University): Program Chair Important dates: Deadline for proposal submissions: December 7. 2012 Acceptance/rejection notification: January 7, 2012 Workshop dates: July 9-13, 2012 ------------------------------------------------------------------------------ From ggrov at staffmail.ed.ac.uk Fri Oct 7 07:00:30 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Fri, 7 Oct 2011 12:00:30 +0100 Subject: [TYPES/announce] VSTTE 2012 Verification Competition: Change of Dates Message-ID: <515602C7-D8C2-4820-8771-189BA451476B@staffmail.ed.ac.uk> *** Note: due to a clash with SEFM 2011, *** *** we have moved the competition to November 8-10 *** VSTTE 2012 Verification Competition ----------------------------------- A software verification competition is organized on behalf of the VSTTE 2012 conference (https://sites.google.com/site/vstte2012). The purposes of this competition are: to help promote approaches and tools, to provide new verification benchmarks, to stimulate further development of verification techniques, and to have fun. The contest takes place during 48 hours, on 8-10 November 2011, two months prior to the conference. Problems will be put on the website of the conference. Solutions must be sent by email to the competition organizers. Any programming language, specification language, and verification tool is allowed. Problems -------- There will be several, independent problems. Each problem is presented as a sequential algorithm, using English or pseudocode, and a list of properties to formally prove about it, also expressed in plain English and standard mathematical notation. Participants have liberty to implement the proposed algorithms in functional, imperative, object-oriented, or any other programming style. Evaluation ---------- Submissions are ranked according to the total sum of points they score. Each problem includes several sub-tasks, e.g. safety, termination, behavioral correctness, etc., and each sub-task is given a number of points. While evaluating the submissions, judges take into account the accuracy and thoroughness of solutions as well as their terseness and elegance. (Clarity is more important than brevity.) A certain degree of subjectivity is inevitable and should be considered as part of the game. Participants ------------ Anybody interested can take part in the contest. Team work is allowed. Only teams up to 4 members are eligible for the first prize. Individual participants may belong to several teams. However, the same solution cannot appear in different submissions. The technical requirements are as follows: - access to the web to download the problems (PDF file); - access to the email to submit the solutions; - any software used in the solutions should be freely available for noncommercial use to the public. This does not exclude closed source programs (such as Microsoft's Z3). Software must be usable on an x86 Linux or Windows machine. Participants are authorized to modify their tools during the competition. Submission ---------- A submission is a (possibly compressed) tarball that contains exactly one directory (named by the team, for instance). This directory should contain at least a text file named README, and one directory for each problem solved. Thus it must look like: team/ -+ +- README +- problem1/ +- problem2/ + ... +- problemN/ +- other stuff... The README file should contain the following information: - contact information (email); - detailed description of the submitted solutions: properties that have been specified and/or proved, restrictions and/or generalizations, anything that may facilitate the review; - detailed instructions to replay the solutions, including the software to use, URLs to get it from, compilation commands, etc. Several solutions can be submitted for the same problem (for instance, using different tools). They should be stored in separate subdirectories of problemI/. During evaluation, only the best-faring solution will be taken into account. Organizers ---------- - Jean-Christophe Filli?tre (CNRS, France) - Andrei Paskevich (Univ Paris Sud, France) - Aaron Stump (University of Iowa, USA) Schedule -------- Tuesday 8 Nov 2011, 15:00 UTC - competition starts Thursday 10 Nov 2011, 15:00 UTC - competition stops Monday 12 Dec 2011 - the winner is notified 28-29 Jan 2012 - results are announced at VSTTE 2012 Prize ----- The winner is awarded a talk slot at VSTTE 2012, to present any research of his/her choice of interest for the VSTTE community. In particular, a presentation of solutions to the competition problems and/or of the techniques and system used would be appreciated. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From might at cs.utah.edu Fri Oct 7 12:23:44 2011 From: might at cs.utah.edu (Matt Might) Date: Fri, 7 Oct 2011 10:23:44 -0600 Subject: [TYPES/announce] PLDI: Call for papers - one month to go Message-ID: ** Important Dates ** Paper submission: 6 November 2011 (One month away) Author response: 21-23 December 2011 Notification: 2 February 2012 Conference: 11-16 June 2012 In 2012, the SIGPLAN conference on Programming Language Design and Implementation will be hosted in Beijing, China, and it will be co-located with ECOOP, LCTES, ISMM, TRANSACT, STOP, ASAIC and more! The organizers strongly encourage paper submissions related to: - Language designs and extensions - Static and dynamic analysis of programs - Domain-specific languages and tools - Performance analysis, evaluation, and tools - Program transformation and optimization - Interaction of compilers/runtimes with underlying systems - Checking or improving the security or correctness of programs - Program synthesis - Memory management - Program understanding - Novel programming models - Debugging techniques and tools - Type systems and program logics - Parallelism, both implicit and explicit (Submissions are by no means restricted to these topics.) For more information on PLDI, please see the PLDI 2012 web site: http://pldi12.cs.purdue.edu/ Sincerely, Matt Might (on behalf of the PLDI 2012 organizers) From cav2012.publicity.chair at gmail.com Sat Oct 8 09:37:48 2011 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Sat, 8 Oct 2011 09:37:48 -0400 Subject: [TYPES/announce] CAV 2012: Call For Workshops Message-ID: ------------------------------------------------------------------------ ***** CALL FOR WORKSHOP PROPOSALS ******* 24th International Conference on Computer Aided Verification CAV 2012 July 7-13, 2012 Berkeley, California, USA Workshop Chair: Shuvendu Lahiri (Microsoft Research, Redmond) The 2012 Computer-Aided Verification (CAV) Workshops provide an opportunity for participants to discuss topics in the broader verification related domains. CAV 2012 Workshops will be held before the main conference on July 7 and 8. 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 10th, 2011 by email to the Workshop chair. Organizers will be notified by Nov 20th, 2011. 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: Shuvendu Lahiri (CAV2012 Workshop Chair) Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA Phone: 1-425-722-4122 email: shuvendu AT microsoft.com http: http://research.microsoft.com/en-us/people/shuvendu/ ------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From carlos.martin at urv.cat Sat Oct 8 15:57:18 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Sat, 08 Oct 2011 21:57:18 +0200 Subject: [TYPES/announce] LATA 2012: submission deadline extended Message-ID: ********************************************************************* 6th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2012 A Coru?a, Spain March 5?9, 2012 http://grammars.grlmc.com/LATA2012/ ********************************************************************* *** SUBMISSION DEADLINE EXTENDED TO OCTOBER 12 (23:59h, CET) *** AIMS: LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). VENUE: LATA 2012 will take place in A Coru?a, at the northwest of Spain. The venue will be the Faculty of Computer Science, University of A Coru?a. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: ? algebraic language theory ? algorithms for semi?structured data mining ? algorithms on automata and words ? automata and logic ? automata for system analysis and programme verification ? automata, concurrency and Petri nets ? automatic structures ? cellular automata ? combinatorics on words ? computability ? computational complexity ? computational linguistics ? data and image compression ? decidability questions on words and languages ? descriptional complexity ? DNA and other models of bio?inspired computing ? document engineering ? foundations of finite state technology ? foundations of XML ? fuzzy and rough languages ? grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) ? grammars and automata architectures ? grammatical inference and algorithmic learning ? graphs and graph transformation ? language varieties and semigroups ? language?based cryptography ? language?theoretic foundations of artificial intelligence and artificial life ? parallel and regulated rewriting ? parsing ? pattern recognition ? patterns and codes ? power series ? quantum, chemical and optical computing ? semantics ? string and combinatorial issues in computational biology and bioinformatics ? string processing algorithms ? symbolic dynamics ? symbolic neural networks ? term rewriting ? transducers ? trees, tree languages and tree automata ? weighted automata STRUCTURE: LATA 2012 will consist of: ? 3 invited talks ? 2 invited tutorials ? peer?reviewed contributions INVITED SPEAKERS: Eugene Asarin (Paris 7), Measuring Information in Timed Languages Bernard Boigelot (Li?ge), Automata-based Symbolic Representation of Polyhedra Gilles Dowek (INRIA), tutorial Around the Physical Church Thesis: Cellular Automata, Graphs, Formal Languages and Quantum Theory Rodney Downey (Wellington), tutorial 20 Years of Parameterized Complexity Jack Lutz (Iowa State), to be announced PROGRAMME COMMITTEE: Eric Allender (Rutgers) Miguel ?. Alonso (A Coru?a) Amihood Amir (Bar?Ilan) Dana Angluin (Yale) Franz Baader (Dresden) Patricia Bouyer (Cachan) John Case (Delaware) Volker Diekert (Stuttgart) Paul Gastin (Cachan) Reiko Heckel (Leicester) Sanjay Jain (Singapore) Janusz Kacprzyk (Warsaw) Victor Khomenko (Newcastle) Bakhadyr Khoussainov (Auckland) Claude Kirchner (Paris) Maciej Koutny (Newcastle) Gregory Kucherov (Marne?la?Vall?e) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n?Vide (Tarragona, chair) Giancarlo Mauri (Milano Bicocca) Aart Middeldorp (Innsbruck) Faron Moller (Swansea) Angelo Montanari (Udine) Joachim Niehren (Lille) Mitsunori Ogihara (Miami) Enno Ohlebusch (Ulm) Dominique Perrin (Marne?la?Vall?e) Alberto Policriti (Udine) Alexander Rabinovich (Tel Aviv) Mathieu Raffinot (Paris) J?rg Rothe (D?sseldorf) Olivier H. Roux (Nantes) Yasubumi Sakakibara (Keio) Eljas Soisalon?Soininen (Aalto) Frank Stephan (Singapore) Jens Stoye (Bielefeld) Howard Straubing (Boston) Masayuki Takeda (Kyushu) Wolfgang Thomas (Aachen) Sophie Tison (Lille) Jacobo Tor?n (Ulm) Tayssir Touili (Paris) Esko Ukkonen (Helsinki) Frits Vaandrager (Nijmegen) Manuel Vilares (Vigo) Todd Wareham (Newfoundland) Pierre Wolper (Li?ge) Hans Zantema (Eindhoven) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Miguel ?. Alonso (A Coru?a, co?chair) Adrian Horia Dediu (Tarragona) Carlos G?mez Rodr?guez (A Coru?a) Jorge Gra?a (A Coru?a) Carlos Mart?n?Vide (Tarragona, co?chair) Bianca Truthe (Magdeburg) Jes?s Vilares (A Coru?a) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single?spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0?40209?0?0?0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2012 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer?reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since July 16, 2011 until March 5, 2012. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2012/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On?site registration fees: 580 Euro On?site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by December 5, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before December 5, 2011 (resp. February 24, 2012) to the conference series account at Uno?e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 ? Swift/BIC code: UNOEESM1 (account holder: Carlos Martin?Vide ? LATA 2012; account holder?s address: Av. Catalunya, 35, 43002 Tarragona, Spain). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. People claiming early registration will be requested to prove that they gave the bank transfer order by the deadline. On?site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: October 12, 2011 (23:59h, CET) Notification of paper acceptance or rejection: November 18, 2011 Final version of the paper for the LNCS proceedings: November 27, 2011 Early registration: December 5, 2011 Late registration: February 24, 2012 Starting of the conference: March 5, 2012 Submission to the post?conference special issue: June 9, 2012 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2012 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34?977?559543 Fax: +34?977?558386 From marzia.buscemi at imtlucca.it Mon Oct 10 06:48:03 2011 From: marzia.buscemi at imtlucca.it (Marzia Buscemi) Date: Mon, 10 Oct 2011 12:48:03 +0200 Subject: [TYPES/announce] Assistant Professor position in Modelling and Analysis of Concurrent Systems at IMT Lucca (deadline October 31st) Message-ID: [ Applications from candidates with background in types, semantics and logics are particularly welcome. ] The IMT Institute for Advanced Studies Lucca invites applications for an Assistant Professor position in the areas of foundations and formal specification of concurrent (distributed, mobile, autonomic) systems; quantitative and qualitative modelling and analysis of concurrent systems and design and development of software tools to support their formal analysis; applications to socio economic systems. IMT Lucca (http://www.imtlucca.it) is a public international Graduate School and Institute of Technology that acts as a research university with the aim of forming human capital in disciplines characterized by their high potential for concrete applications. IMT strives to reach the fusion of theoretical comprehension and practical relevance. The Assistant Professor will be a part of the Research Unit "System Modelling and Analysis" (SysMA, http://sysma.lab.imtlucca.it/) in the Computer Science and Applications area of the Institute, and will perform research activities, tutorship and mentoring of Ph.D. students, limited teaching of graduate courses and participation in the development of the research activities of the Institute. Appointment compensation packages will depend on the candidates and their records of accomplishment, but are competitive on an international level. Applicants must be able to teach graduate courses in English; knowledge of Italian is not required. The deadline for application is October 31st, 2011 12:00 pm CET. Interested candidates must apply before the deadline by filling in the online application form at http://www.imtlucca.it/faculty/positions under "Junior Faculty Recruitment Program". They will also be asked to submit a CV, a research paper (published or working) and the name and contact details of three referees. For further information about the position, applicants can refer to http://www.imtlucca.it/faculty/positions/junior_faculty_recruitment_program.php#modelling_concurrent_systems or can contact either the sender of this message or Sara Olson: researchers.opening at imtlucca.it. From s.j.thompson at kent.ac.uk Tue Oct 11 05:54:16 2011 From: s.j.thompson at kent.ac.uk (Simon Thompson) Date: Tue, 11 Oct 2011 10:54:16 +0100 Subject: [TYPES/announce] PEPM'12 Deadline Extension Message-ID: <6ECF5AF6-9B05-4013-A96B-092FC74E4F9F@kent.ac.uk> Apologies for multiple postings of this announcement. PEPM'12 - DEADLINE EXTENSION Due to a number of requests for extensions, the deadline for submission to PEPM'12 has been extended until 23:59 GMT on Sunday 16 October. We would like to remind you about three aspects of PEPM. Journal Special Issue There will be a journal special issue for PEPM'12. PEPM'09 has already appeared in Higher-order and Symbolic Computation (HOSC, online-first edition this year), and the special issue based on PEPM'10 papers has just been delivered to the HOSC editorial team. Short papers We're looking for short papers (up to 4pp) and tool papers as well as full research papers. All categories of papers will appear in the formal ACM proceedings. Tool papers The main purpose of a tool paper is to display other researchers in the PEPM community a completed, robust and well-documented tool; more guidance on the format and expected contact is given on the PEPM 2012 web site. In contrast with regular PEPM submissions, PEPM tool demo papers may include work that has been published elsewhere. In the ideal case, the technical foundations of the tool will have been published previously, and the submitted PEPM tool paper will report on follow-on work that has produced a robust tool that has been applied to interesting examples. The PEPM program committee will consider accepting tool demo papers that describe tools that have been presented at other conferences/ workshops if these conferences/ workshops belong to a different community (the authors should acknowledge the previous demos and justify the benefits of presenting the tool again for the PEPM audience). Call For Papers ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) http://www.program-transformation.org/PEPM12 Paper submission deadline: Sunday, October 16, 2011, 23:59, GMT The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 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 and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press and will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Sunday, October 16, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers - Markus Pueschel (ETH Zurich, Switzerland) - Martin Berger (University of Sussex, UK) Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Research, USA) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea) Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From pmt6sbc at maths.leeds.ac.uk Tue Oct 11 07:19:10 2011 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Tue, 11 Oct 2011 12:19:10 +0100 (BST) Subject: [TYPES/announce] Turing Year in China - TAMC 2012 Message-ID: <201110111119.p9BBJAZK011546@maths.leeds.ac.uk> **************************************************************************** FIRST CALL FOR PAPERS: TAMC 2012 9th Annual Conference on Theory and Applications of Models of Computation Turing Centenary Meeting, Chinese Academy of Sciences, Beijing, China May 16-21, 2012 http://turing2012.iscas.ac.cn/tamc2012.html **************************************************************************** VENUE: Institute of Software, Chinese Academy of Sciences. All lectures and talks will be arranged in Building No. 5, Software Park, Chinese Academy of Sciences. CONTACT: Prof. Angsheng Li at angsheng at ios.ac.cn TURING LECTURES 2012: * S. Barry Cooper ( Leeds ) * John Hopcroft( Cornell) * Richard Karp (Berkeley) * Jon Kleinberg (Cornell) * Butler Lampson (Microsoft) * Wei Li (BUAA) * Andrew Chi-Chih Yao (Tsinghua, Beijing) TAMC 2012 INVITED SPECIAL SESSIONS: 1. Algorithms and Information in Networks (Organising Chairs: Zhiyong Liu ) 2. Complexity and Cryptography (Organising Chair: Xiaotie Deng) 3. Models of Computing and Networking (Organising Chairs: Anthony Bonato ) 4. Programming and Verification (Organising Chair: Wenhui Zhang) IMPORTANT DATES: * Submission deadline: 11:59pm EST Jan. 10, 2012. * Notification of authors: Feb. 20, 2012. * Final versions deadline: Due on March 10, 2012. PROCEEDINGS: Accepted papers will be published in the conference proceedings, in the LNCS Series by Springer. 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. SUBMISSION OF PAPERS: * Authors should submit an extended abstract (not a full paper). * 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 TAMC12, 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. PROGRAMME COMMITTEE: * Manindra Agrawal (Co-chair, Indian Institute of Technology Kanpur) * Marat Arslanov (Kazan) * Giorgio Ausiello (Rome, Italy) * George Barmpalias (ISCAS) * Anthony Bonato (Ryerson University, Can.) * Cristian S. Calude (University of Auckland ) * Alessandra Carbone (Paris) * Jianer Chen (Texas A&M University) * Wei Chen (Microsoft Research Asia) * Francis Chin (University of Hong Kong) * S. Barry Cooper (Co-chair, University of Leeds, UK) * Gilles Dowek (Paris) * Zhenhua Duan (Xidian University) * Mike Fellows (Charles Darwin University, Australia) * Kazuo Iwama (Kyoto University) * Andrew Lewis (University of Leeds) * Angsheng Li (Co-chair, Chinese Academy of Sciences) * Zhiyong Liu (Chinese Academy of Sciences) * Weiyi Liu (Yunnan University) * Giuseppe Longo (Paris, France) * Mitsunori Ogihara (Miami) * Luke Ong (Oxford) * Xiaoming Sun (Tsinghua University) * Mingji Xia (ISCAS) * Peng Zhang (Shandong University) * Naijun Zhan (ISCAS) * Yongji Wang (ISCAS) * Hanpin Wang (Beijing University) * Osamu Watanabe (Tokyo Institute of Technology) * Ting Zhang (Iowa State University) LOCAL ORGANIZING COMMITTEE: * George Barmpalias (ISCAS) * Yunfu Cao (ISCAS) * Haiming Chen (ISCAS) * Zhiming Ding (ISCAS) * Angsheng Li (ISCAS, co-chair) * Yucheng Li (ISCAS, co-chair) * Dongdai Lin (ISCAS) * Kelong Liu (ISCAS) * Hongan Wang (ISCAS) * Mingji Xia (ISCAS) * Ye Yang (ISCAS) * Yongji Wang (ISCAS) * Naijun Zhan (ISCAS) 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 TAMC 2012 will be Computability, Complexity, and Algorithms with extensions to information and networks. Typical but not exclusive topics of interest include: * Algorithmic algebra, * Algorithmic graph theory and combinatorics * Algorithms and data structures * Approximation algorithms * Automata and neural networks * Computational biology, and bio-informatics * Computational complexity * Computational game theory, network game theory * Computational geometry * Computable mathematics * Continuous and real computation * Cryptography and complexity * Decidability and undecidability * Derandomization * Error correcting code and locally testable codes * Generalized and higher type computation * Internet mathematics * Learning theory, and intelligent computing * Local test of mathematical properties * Models of computing and networking * Natural computation * Network algorithms * Networking * Networks in nature and society - new laws and principles * Number theory and coding theory * On-line algorithms and parallel algorithms * Physical computability * Programm checking * Programming and verication * Proofs and computation * Quantum computing * Randomized algorithms * Randomness in complexity classes and in nature * Relative computability and degree structures * Robustness and security of networks * Theory of networks and emergence * Turing definability From isabelle.perseil at telecom-paristech.fr Wed Oct 12 12:19:37 2011 From: isabelle.perseil at telecom-paristech.fr (Isabelle Perseil) Date: Wed, 12 Oct 2011 18:19:37 +0200 Subject: [TYPES/announce] ICECCS 2012 - Call for Papers Message-ID: <4decb4d6d0c9c65c442b94c37a0b695b.squirrel@webmail1.telecom-paristech.fr> **************************************************************************** CALL FOR PAPERS: ICECCS 2012 http://www.iceccs.org/ 17th Annual IEEE International Conference on the Engineering of Complex Computer Systems (ICECCS) sponsored by the IEEE Technical Committee on Complexity in Computing (TCCX) Organized under the guidance of the CESAMES non profit organization July 18-20,2012 Ecole Normale Superieure, Paris - FRANCE ***************************************************************************** Submission deadline: February 15, 2012 -------------------------------------- The success of key human activities ranging from research and business to everyday services relies on the use of ever more sophisticated, feature-rich and complex computer systems. These complex computer systems are regularly required to accomplish more, faster and on a broader scale, to adapt dynamically to changing workloads, scenarios and objectives, and to achieve guaranteed levels of performance and dependability. Satisfying such demanding requirements in the presence of the variability, heterogeneity and non-linear behaviour that characterise complex computer systems poses numerous challenges to both their developers and their users. The aim of the conference is to bring together researchers, practitioners and leading experts from academia and industry, to advance the state of the art in the specification, development, validation and verification, and management of complex computer systems. Scope and topics: ================ Authors are invited to submit papers describing original, unpublished research results, case studies and tools. Additionally, submissions of poster papers are sought for two separate poster sessions: an "ongoing research" poster session, and a "PhD research" poster session. Topics of interest include but are not limited to the following aspects of complex computer systems: - Requirement specification and analysis - Verification and validation - Model-driven development - Reverse engineering and refactoring - Achitecture software - Big Data Management - Sensor Networks and Ubiquitous Computing - 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 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 with panels to discuss relationships between industrial and academic research. 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 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 Submission of Papers: ==================== 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. See the submission guidelines on the conference web site. Important Dates: ================ Submission of titles and abstracts February 1, 2012 Submission of all papers February 15, 2012 Notification of acceptance March 30, 2012 Camera-ready material for publication April 15, 2012 Registration deadline for authors May 15, 2012 Early registration deadline for non-authors May 30, 2012 General Chair: ============== Daniel Krob, Laboratoire d'Informatique (LIX), Ecole Polytechnique and CNRS, France Finance Chair: ============== Isabelle Perseil, INSERM, France Publicity Chair: ================ Alice Parisot, CESAMES, France Program Chairs: =============== Karin Breitman, Pontificia Universidade Catolica do Rio de Janeiro, Brazil Isabelle Perseil, INSERM, France Marc Pouzet, ENS-INRIA, France Program Committee: ================== -Mithun Acharya, ABB Corporate Research, United States -Marc Aiguier, Ecole Centrale Paris, France -Yamine Aitameur, LISI/ENSMA, France -Luis Almeida, Fac. de Eng. da Universidade do Porto, Portugal -Keijiro Araki, Kyushu University, Japan -Hernan Astudillo, Universidad Tecnica Federico Santa Mar?a, Chile -Paris Avgeriou, University of Groningen, Netherlands -Luciano Baresi, DEI - Politecnico di Milano, Italy -Thais Batista, Federal University of Rio Grande do Norte, Brazil -Don Batory, The University of Texas at Austin, United States -Larry Bernstein, Stevens Institute of Technology, United States -Domenico Bianculli, University of Lugano - Faculty of Informatics, Switzerland -Jonathan P.Bowen, London South Bank University, United Kingdom -Michele Bugliesi, University of Venice, Italy -Karin Breitman, PUC-Rio, Brazil -Phil Brooke, University of Teesside, United Kingdom -Jean-Michel Bruel, IRIT, France -Michael Butler, University of Southampton, United Kingdom -J?rgen B?rstler, Blekinge Institute of Technology, Sweden -Radu Calinescu, Aston University, United Kingdom -Corina Cirstea, University of Southampton, United Kingdom -Jose Cordeiro, EST Setubal/IPS, Portugal -Agostino Cortesi, Universita' Ca' Foscari di Venezia, Italy -Jim Davies, University of Oxford, United Kingdom -Adriana P. De Medeiros, Universidade Federal Fluminense, Brazil -Julien Delange, European Space Agency, Netherlands -Juan Antonio De La Puente, Universidad Polit?cnica de Madrid, Spain -Felicita Di Giandomenico, ISTI-CNR, Italy -Marco Di Natale, Scuola Superiore SantAnna, Italy -Simone Diniz Junqueira Barboza, PUC-Rio, Brazil -Davide Di Ruscio, Universit? degli Studi dell'Aquila, Italy -Gilles Dowek, INRIA, France -Kerstin Eder, University of Bristol, United Kingdom -Amal El Fallah Seghrouchni, LIP6 - University of Pierre and Marie Curie, France -Vincent Englebert, University of Namur, Belgium -Carolina Felicissimo, Schlumberger Servicos de Petroleo LTDA, Brazil -Bernd Finkbeiner, Saarland University, Germany -Franck Fleurey, SINTEF, Norway -Leo Freitas, Newcastle University, United Kingdom -Carlo Alberto Furia, ETH Zurich, Switzerland -Sebastien Gerard, CEA, LIST, France -Jean-Paul Gibson, Telecom & Management SudParis,France -Martin Gogolla, University of Bremen, Germany -Mark Grechanik, Accenture Labs, United States -Lindsay Groves, Victoria University of Wellington, New Zealand -Esther Guerra, Universidad Aut?noma de Madrid, Spain -Sylvain Hall?, UQAC, Canada -J?r?me Hugues, ISAE, France -Shinji Kikuchi, Fujitsu Laboratories, Japan -Joseph Kiniry, IT University of Copenhagen, Denmark -Daniel Kroening, Computing Laboratory, Oxford University, United Kingdom -Ralf Laemmel, Universit?t Koblenz-Landau, Germany -Regine Laleau, Paris Est Creteil University, France -Phillip Laplante, Penn State University, United States -Kung-Kiu Lau, The University of Manchester, United Kingdom -Insup Lee, University of Pennsylvania, United States -Jing Liu, Software Engineering Institute, East China Normal University, China -Johan Lilius, bo Akademi University, Finland -Jaime Lloret, Polytechnic University of Valencia, Spain -S?rgio F. Lopes, University of Minho, Portugal -Gerald Luettgen, University of Bamberg, Germany -Cristiano Maciel, Universidade Federal do Mato Grosso, Brazil -Tom Maibaum, McMaster University, Canada -Tiziana Margaria, Potsdam University, Germany -Paul Mckee, BT Innovate and Design, United Kingdom -Julie Mccann, Imperial College, United Kingdom -Julio Medina, Universidad de Cantabria, Spain -Dominique Mery, Universit? Henri Poincar? Nancy 1, France -Raffaela Mirandola, Politecnico di Milano, Italy -Thomas Nolte, MRTC/M?lardalen University, Sweden -Andrea Omicini, Universit? di Bologna, Italy -Flavio Oquendo, European University of Brittany ? UBS/VALORIA, France -Laurent Pautet, Telecom Paristech, France -Robert Pettit, The Aerospace Corporation, United States -Alexander K. Petrenko, ISP RAS, Russian Federation -Isabelle Perseil, INSERM, France -Mauro Pezze, University of Lugano, Switzerland -Ivan Porres, ?bo Akademi University, Finland -Marc Pouzet, ENS-INRIA, France -Arend Rensink, University of Twente, Netherlands -Bernhard Rumpe, RWTH Aachen University, Germany -Camille Salinesi, Universit? Paris 1 Panth?on - Sorbonne, France -Ricardo Sanz, Universidad Politecnica de Madrid, Spain -Douglas Schmidt, Vanderbilt University, United States -Cristina Seceleanu, M?lardalen University, Sweden -Bran Selic, Malina Software Corp, Canada -Florian Skopik, AIT Austrian Institute of Technology, Austria -Oleg Sokolsky, University of Pennsylvania, United States -Volker Stolz, University of Oslo, Norway -Jing Sun, The University of Auckland, New Zealand -J?rn Guy S??, ITEE, The University of Queensland, Australia -Clemens Szyperski, Microsoft Research, United States -Kenji Taguchi, AIST, Japan -Dalila Tamzalit, University of Nantes, France -Bedir Tekinerdogan, Bilkent University, Turkey -Massimo Tisi, AtlanMod, INRIA & Ecole des Mines de Nantes, France -Antonio Vallecillo, University of Malaga, Spain -Tullio Vardanega, University of Padua, Italy -Emil Vassev, University College Dublin, Ireland -Evelyne Viegas, Microsoft Research, United States -Jens Weber, University of Victoria, Canada -Jim Woodcock, University of York, United Kingdom -Juan Ye, University of St Andrews, United Kingdom -Bechir Zalila, ReDCAD Laboratory, University of Sfax, Tunisia -Naijun Zhan, Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, China -Miaomiao Zhang, Tongji University, China -Jianjun Zhao, School of Software, Shanghai Jiao Tong University, China -Huibiao Zhu, East China Normal University, China -Steffen Zschaler, King's College London,United Kingdom From m.huisman at utwente.nl Thu Oct 13 04:02:44 2011 From: m.huisman at utwente.nl (Marieke Huisman) Date: Thu, 13 Oct 2011 10:02:44 +0200 Subject: [TYPES/announce] PhD position on "Semantics and Verification of Accelerator Programming" Message-ID: <4E969B24.8020704@utwente.nl> [[Apologies for multiple copies. Dear colleagues, Please forward this message to any potentially interested candidate that you may know. The intended starting date (1st of December, 2011) is very close, but excellent students that are currently working on their Master's thesis and will finish within a couple of months, are also very welcome to apply. Interested candidates can always contact me for further information. I'm looking forward to having many reactions. Thanks to you all for your help! Marieke Huisman University of Twente]] The research group Formal Methods and Tools at the University of Twente (Enschede - The Netherlands) is looking for a PhD researcher (4 years) to work on the EU Strep project CARP (Correct and Efficient Accelerator Programming), funded by the European Union. Other partners in the project are Imperial College, UK; Realeyes, Estonia; ARM, UK; RTWH Aachen, Germany, Monoidics, UK, ENS, France and Rightware, Finland. Within the context of the CARP project, the PhD student will work in particular on: - requirements analysis for accelerator programming - the formal semantics of an intermediate programming language for describing accelerator algorithms - developing logic-based verification techniques for this intermediate programming language, taking into account common accelerator programming patterns =============================================================== *Our research: * In recent years, massively parallel accelerator processors, primarily GPUs, have become widely available to end-users. Accelerators offer tremendous compute power at a low cost, and tasks such as media processing, simulation, medical imaging and eye-tracking can be accelerated to beat CPU performance by orders of magnitude. Performance is gained in energy efficiency and execution speed, allowing intensive media processing software to run in low-power consumer devices. Accelerators present a serious challenge for software developers. A system may contain one or more of the plethora of accelerators on the market, with many more products anticipated in the immediate future. Applications must exhibit portable correctness, operating correctly on any configuration of accelerators, and portable performance, exploiting processing power and energy efficiency offered by a wide range of devices. The overall aims of CARP are to design techniques and tools for correct and efficient accelerator programming: - Novel & attractive methods for constructing system-independent accelerator programs - Advanced code generation techniques to produce highly optimised system-specific code from system-independent programs - Scalable static techniques for analysing system-independent and system-specific accelerator programs, both qualitatively and quantitatively The PhD candidate we are looking for is expected to work on the development of tools and techniques for correct accelerator programming. Within the consortium an intermediate programming language for accelerator programming will be developed. The PhD candidate is expected to develop a solid formal semantics for this language, together with appropriate verification techniques. An important focus of the verification work is that it will focus on bug finding, without too many false negatives, rather than on developing full correctness proofs. For the verification, it is expected that the logical basis will be permission-based concurrent separation logic. Sometimes the intermediate programming language will not provide the required efficiency, and programs will be written in a low-level language as OpenCL. Therefore, the verification techniques also will be extended to this lower level. *We seek:* An enthusiastic PhD student with an MSc degree in Computer Science (or an equivalent qualification). The candidate should have - a thorough theoretical background, - a demonstrable interest in program semantics and verification, and - some knowledge about multithreaded programming (in Java/C/C++). We are looking for a researcher with an independent mind who is willing to cooperate in our team. It is understood that he or she works on the topics listed above, and contributes to the expected deliverables for the project. Further we ask for good communicative and good collaboration skills. Candidates should be prepared to prove their English language skills. As a research outcome we expect publications, (prototype) tools, and a PhD thesis. Starting date of the position: December 1st, 2011, or as soon as possible thereafter. *We offer:* - A PhD position for four years (38 hrs/week) - A stimulating scientific environment - Gross salary ranging from EUR 2042 tot E 2612 (4th yr) per month - Holiday allowance (8%), end-of-year bonus (8.3%) - Good secondary conditions, in accordance with the collective labour agreement CAO-NU for Dutch universities - A green Campus with lots of sports facilities You will be a member of the Twente Graduate School in the research programme 'Dependable and Secure Computing' under the leadership of Prof Dr Jaco van de Pol. The research programme offers advanced courses to deepen your scientific knowledge in preparation to your future career (within or outside academia). We provide our PhD students with excellent opportunities to broaden their personal knowledge and to professionalise their academic skills. Participation in national and/or international summer schools and workshops, and visits to other prestigious research institutes and universities can be part of this programme. *Further information:* - FMT group: http://fmt.cs.utwente.nl/ - Dr. Marieke Huisman (Marieke.Huisman at ewi.utwente.nl) - The CARP project: http://fmt.ewi.utwente.nl/files/projects/CARP.d1.pdf *Application: * Please submit your application before 15th of November, 2011 via http://www.utwente.nl/vacatures/en/. We strongly encourage interested applicants to send in their applications as soon as possible. Your application should consist of: - a cover letter (explain your specific interest and qualifications); - a full Curriculum Vitae, including a list of all courses + marks, and a short description of your MSc thesis; and - references (contact information) of two scientific staff members. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dianne.nguyen at monash.edu Thu Oct 13 00:53:01 2011 From: dianne.nguyen at monash.edu (Dianne Nguyen) Date: Thu, 13 Oct 2011 15:53:01 +1100 Subject: [TYPES/announce] CALL FOR PARTICIPATION - Solomonoff 85th Memorial Conference Message-ID: Apologies for cross posting Solomonoff 85th Memorial Conference http://www.solomonoff85thmemorial.monash.edu/ Dear Colleague The Solomonoff Organising Committee cordially invites you to participate at the upcoming Solomonoff 85th Memorial Conference to be held at Monash University, Clayton Campus, between Wedn 30 November and Fri 2 December 2011. The Conference is being held in honour and memory of Ray Solomonoff (1926-2009). Solomonoff was the father of algorithmic information theory (before Kolmogorov and Chaitin), perhaps the first to advocate probabilistic artificial intelligence, and (in 1985) one of the first to write on the technological singularity. Solomonoff is also mentioned in the recent "New Scientist" magazine article of Sat 10/Sept/2011 (pp42-45) for having the pioneering ideas in the 1960s of modern theories of intelligence. His January 2010 New York Times obituary is linked to from www.csse.monash.edu.au/~dld/MML.html#rjs. Keynote Speakers The Conference program includes three distinguished guest speakers: Prof. Leonid Levin, Boston University, USA - famous for (e.g.) the Cook-Levin theorem of NP-Completeness, the computable Kt complexity approximation to (uncomputable) Kolmogorov complexity, the universal Levin search, etc. Prof. Ming Li, University of Waterloo, Canada - widely known for the Li & Vitanyi "An introduction to Kolmogorov complexity and its Applications" book and for current research in bioinformatics. Grace Solomonoff, USA Program Committee (includes 2 Turing Award winners) Andrew Barron, Statistics, Yale University, USA Greg Chaitin, IBM T.J. Watson Research Center, USA Fouad Chedid, Notre Dame University, Lebanon Bertrand Clarke, Medical Statistics, University of Miami, USA A. Phil Dawid, Statistics, Cambridge University, UK Peter Gacs, Boston University, USA Alex Gammerman, Royal Holloway, University of London, UK John Goldsmith, Linguistics, University of Chicago, USA Marcus Hutter, Australian National University, Australia Leonid Levin, Boston University, USA Ming Li, Mathematics, University of Waterloo, Canada John McCarthy, Stanford University, USA (Turing Award winner) Marvin Minsky, MIT, USA (Turing Award winner) Kee Siong Ng, ANU & EMC Corp, Australia David Paganin, Physics, Monash University, Australia Teemu Roos, University of Helsinki, Finland Juergen Schmidhuber, IDSIA, Switzerland William Uther, NICTA and University of New South Wales, Australia Farshid Vahid, Econometrics, Monash University, Australia Paul Vitanyi, CWI, The Netherlands Vladimir Vovk, Royal Holloway, University of London, UK Theme/Topics This is a multi-disciplinary conference based on the wide range of applications of work related to or inspired by that of Ray Solomonoff. The contributions sought for this conference include, but are not restricted to, the following:- Statistical inference and prediction, Econometrics (including time series and panel data), in Principle proofs of financial market inefficiency, Theories of (quantifying) intelligence and new forms of (universal) intelligence test (for robotic, terrestrial and extra-terrestrial life), the Singularity (or infinity point, when machine intelligence surpasses that of humans), the future of science, Philosophy of science, the Problem of induction, Evolutionary (tree) models in biology and linguistics, Geography, Climate modelling and bush-fire detection, Environmental science, Image processing, Spectral analysis, Engineering, Artificial intelligence, Machine learning, Statistics and Philosophy, Mathematics, Linguistics, Computer science, Data mining, Bioinformatics, Computational intelligence, Computational science, Life sciences, Physics, Knowledge discovery, Ethics, Computational biology, Computational linguistics, Collective intelligence, structure and computing connectivity of random nets, effect of Heisenberg's principle on channel capacity, Arguments that entropy is not the arrow of time, and etc. Registration For information on registration and payment, please visit: http://www.solomonoff85thmemorial.monash.edu/registration.html Please feel at liberty to forward announcement to interested staff and students. I look forward to receiving your registration and participation at the Conference. Kind regards Dr Dianne Q. Nguyen (Co-ordinator) and (chairman) A/Prof. David L. Dowe. -------------- next part -------------- An HTML attachment was scrubbed... URL: From umut at mpi-sws.org Thu Oct 13 01:58:10 2011 From: umut at mpi-sws.org (Umut Acar) Date: Thu, 13 Oct 2011 07:58:10 +0200 Subject: [TYPES/announce] DAMP 2012: Call for Papers Message-ID: Dear Colleague, The DAMP 2012 deadline is approaching. We are looking forward to your papers. ---------------------------------------------------------------------- DAMP 2012: Call for Papers Declarative Aspects of Multicore Programming Philadelphia, PA (colocated with POPL 2012) January 28, 2012 http://www.mpi-sws.org/~umut/damp2012/ ** IMPORTANT: This year DAMP makes a significant change to the workshop organization. There will be two distinct submission categories: long papers (with a published proceedings as before) and 4-page short papers on unfinished work, position statements, etc. Short papers will not be published but will be made available to workshop attendees. The aim is to enable researchers to obtain valuable feedback about ongoing work and to create a lively atmosphere for discussion. ** SUBMISSION DEADLINE: OCTOBER 22, 2011 The advent of multicore architectures has profoundly increased the importance of research in parallel computing. Multicore architectures, now commonplace throughout the market, introduce several new dimensions of variability in both performance guarantees and architectural contracts, such as the memory model, while making it highly attractive and even necessary to develop novel programming languages, models, and paradigms for taking advantage of the benefits of parallelism. Programs written in declarative languages, which control the use of side effects, can greatly simplify development of parallel programs by eliminating or limiting data races. Such languages include purely functional languages, (constraint-) logic programming languages, many data-driven or reactive languages, and other domain specific languages (e.g., MapReduce). DAMP 2012 is the seventh in a series of one-day workshops seeking to explore ideas in declarative programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. Starting this year, we welcome papers on a diverse set of topics ranging from language design to applications and practical experience. To foster discussion and enable exchange of ideas between different communities, we will accept both short and long papers. Short papers aim to provide an opportunity to receive feedback on incomplete, ongoing, or even failed work. We welcome reports of successes as well as failures. Specific topics include, but are not limited to: * language and compiler design and implementation * run-time systems for supporting parallelism (e.g., garbage collection, scheduling) * parallel applications and practical experience * architectural support for parallel languages * type systems and analysis for accurately detecting dependencies, aliasing, side effects, and impure features * languages for the description of data placement and distribution * technology for debugging parallel programs * design and implementation of domain-specific declarative languages for multicore programming ** SUBMISSIONS We welcome both short and long communications. Long papers should not exceed 10 pages in ACM SIGPLAN conference format. Short papers should not exceed 4 pages, and may present work-in-progress, position statements on the state of the art, describe applications of existing systems, or just present proposals for discussion at the workshop. Somewhat unconventionally, we would like to welcome all researchers to consider submitting papers not just on their successful results, but also on their failed attempts with an emphasis on the reasons for failure and what lessons can be learned from them. Both long and short communications will be refereed. Long communications will be published in the ACM Digital Library. Short communications will be made available informally at the DAMP web site but will not be published. Electronic submission can be made at: http://www.easychair.org/conferences/?conf=damp2012 Papers to be published in the ACM Digital Library must adhere to the SIGPLAN Republication Policy: http://www.sigplan.org/republicationpolicy.htm Namely, concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. Additional information about the submission process can be found at the conference web site. ** IMPORTANT DATES Paper submission: Oct. 22 Notification to authors: Nov. 12 Camera ready: Nov. 22 ** COMMITTEES * General Chair: Umut Acar Max-Planck Institute for Software Systems, Germany * Program Chair: Vitor Santos Costa University of Porto * Program Committee: Umut Acar Max-Planck Institute for Software Systems, Germany Guy Blelloch Carnegie Mellon University, USA Maria Garcia de la Banda Monash University, Australia Manuel Carro IMDEA Software Institute and UPM, Spain Kevin Hammond University of St Andrews, UK Leaf Petersen Intel Corporation, USA Enrico Pontelli State University of New Mexico (USA) Christian Schulte KTH - Royal Institute of Technology (Sweden) Mary Sheeran, Chalmers Univ of Technology Ashwin Srinivasan South Asian Univ, India Terry Swift Centria and John Hopkins, USA Lukasz Ziarek Purdue University, USA ---------------------------------------------------------------------- -- Umut -------------- next part -------------- An HTML attachment was scrubbed... URL: From c.grelck at uva.nl Thu Oct 13 12:26:27 2011 From: c.grelck at uva.nl (Clemens Grelck) Date: Thu, 13 Oct 2011 18:26:27 +0200 Subject: [TYPES/announce] CFP: FD-COMA 2012: Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures Message-ID: <4E971133.3050903@uva.nl> Call for Papers: FD-COMA 2012 Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures 7th HiPEAC Conference Paris, France, Jan 23-25, 2012 http://www.project-advance.eu/2011/10/fd-coma-workshop-2012/ http://www.hipeac.org/conference FD-COMA is a one-day workshop during the 7th HiPEAC Conference in Paris, January 23-25, 2012. The workshop is loosely connected to the FP-7 project Advance, but we particularly welcome contributions from outside the project consortium. Scope: Feedback driven optimizations have long proven to be powerful instruments for achieving better hardware utilization, but the on-going multi-core/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 + Compiler representations for feedback information + Performance modeling for feedback, including statistical and constraint-based techniques + Performance measurement using feedback information + Exploiting feedback for heterogeneous multi-core systems + 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. Submit a PDF copy of your manuscript via EasyChair (not yet open). 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 at the workshop in electronic form. Important dates: Submission deadline: 4/11/2011 Notification of acceptance: 18/11/2011 Final version due: 13/1/2012 Workshop organizers: Kevin Hammond, University of St Andrews, United Kingdom Clemens Grelck, University of Amsterdam, Netherlands Sven-Bodo Scholz, Heriott-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 a.ricci at unibo.it Thu Oct 13 19:10:19 2011 From: a.ricci at unibo.it (Alessandro Ricci) Date: Thu, 13 Oct 2011 23:10:19 +0000 Subject: [TYPES/announce] AGERE! @ SPLASH 2011: CALL FOR PARTICIPATION Message-ID: <52E6ADFD-C552-45CC-957C-508067F666B6@unibo.it> CALL FOR PARTICIPATION: AGERE! @ SPLASH 2011 The fundamental turn of software into concurrency and distribution is not only a matter of performance, but also of design and abstraction, calling for programming paradigms that would allow more naturally than the current ones to think, design, develop, execute, debug and profile programs exhibiting different degrees of concurrency, reactiveness, autonomy, decentralization of control, distribution. This workshop aims at exploring programming approaches explicitly providing a level of abstraction based on agents and actors (and systems of agents and actors). The objective of the workshop is then to foster the research in all aspects of agent-oriented programming and actor-oriented programming as evolution of mainstream paradigms (such as OOP), including 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. Portland, Oregon, USA, 24 October 2011 During the workshop days of SPLASH The programme is available on the workshop website: http://agere2011.apice.unibo.it You can follow the pre-workshop discussion on the AGERE! @ SPLASH forum: https://groups.google.com/group/agere-at-splash Programme highlights: - An invited talk: "Everything You Know (About Parallel Programming) is Wrong!: A Wild Screed About the Future" David Ungar (IBM Research, US) joint invited talk with the DLS symposium (http://www.dynamic-languages-symposium.org/dls-11/index.html) - An introductory talk: "Actors and Agents as Programming Paradigms - An Overview" Gul Agha (University of Illinois at Urbana-Champaign, US) Alessandro Ricci (University of Bologna, Italy) - Panel (the list of panelists is partial): "Actors and Agents as Programming Paradigms - Next" Gul Agha (University of Illinois at Urbana-Champaign, US) Mark Miller (Google, US) Alessandro Ricci (University of Bologna, Italy) ... Accepted papers: * Behavioral Programming, Decentralized Control, and Multiple Time Scales David Harel, Assaf Marron, Guy Wiener and Gera Weiss - Weizmann Institute of Science, Ben Gurion University * AF-Raf: An Agent-Oriented Programming Language with Algebraic Data Types Claudia Grigore and Rem Collier - University College Dublin * Cloudscape: Language Support to Coordinate and Control Distributed Applications in the Cloud Andi Bejleri, Andrew Farrell and Patrick Goldsack - Imperial College London, HP Labs, Bristol * An Agent Framework for Agent Societies Kyle Usbeck and Jacob Beal - BBN Technologies * Higher-Order Contracts for Actor Based Languages Christophe Scholliers, Wolfgang De Meuter and Eric Tanter - Vrije Universiteit Brussel, PLEIAD Laboratory * A Feature Model of Actor, Agent, and Object Programming Languages Howell Jordan, Goetz Botterweck, Marc-Philippe Huget and Rem Collier - Lero, University College Dublin, Lero, University of Limerick, University of Savoie, UCD * Designing a General-Purpose Programming Language based on Agent-Oriented Abstractions: The simpAL Project Alessandro Ricci, Andrea Sant * No More Design Patterns for Multi-Agent Systems Mario Henrique Cruz Torres, Tony Van Beers, Tom Holvoet * Potential of Agent Technology in the domain of Health Information Systems Aldo Franco Dragoni * Integrating Jason in a Multi-Agent Platform with support for Interaction Protocols Bexy Alfonso, Emilio Vivancos, Vicent Botti and Ana Garc?a-Fornes Accepted demos: * AmbientTalk: Modern Actors for Modern Networks Tom Van Cutsem - Vrije Universiteit Brussel * Exploiting Intelligent Agent-Based Technologies for Programming Smart Mobile Applications Andrea Santi and Alessandro Ricci - University of Bologna * The GMF-based Syntax Tool of a DSML for the Semantic Web enabled Multi-Agent Systems Sinem Getir, Sebla Demirkol, Moharram Challenger and Geylani Kardas - Ege University International Computer Institute, Turkey * Exploiting the JaCaMo Framework for Realising an Adaptive Room Governance Application Alexandru Sorici, Olivier Boissier, Gauthier Picard and Andrea Santi The full schedule is available here: https://docs.google.com/spreadsheet/ccc?key=0Ai4lSQe0n1R0dGVHYXVFT2JvSEdfc04xa2hldWx1QlE#gid=0 From maffei at cs.uni-saarland.de Fri Oct 14 10:21:43 2011 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Fri, 14 Oct 2011 16:21:43 +0200 Subject: [TYPES/announce] CSF 2012 Call for Workshops Message-ID: ***************************************************** CSF 2012 Call for Workshops 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. ***************************************************** WORKSHOP PROPOSALS The Computer Security Foundations Symposium welcomes colocated workshops on subject related to CSF and of interest for the CSF audience. Organizational support is provided in terms of room booking, etc. Workshop proposals are due November 15th, 2011. Proposals (about 2-3 pages) should be submitted by email to the program chairs. They should contain the satellite event name and acronym; the names and contact information of the organizers; a brief description of the event topic for later use in publicity material; the expected size of the audience and the history of the event, where applicable. ***************************************************** 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 ***************************************************** 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 ***************************************************** 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 katoen at cs.rwth-aachen.de Mon Oct 17 05:12:14 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Mon, 17 Oct 2011 11:12:14 +0200 Subject: [TYPES/announce] ETAPS 2013: Call for Satellite Events Message-ID: <4E9BF16E.20009@cs.rwth-aachen.de> [We apologise for multiple copies.] ------------------------------------------------------------- *** CALL FOR SATELLITE EVENTS *** ETAPS 2013 European Joint Conferences on Theory And Practice of Software March 16th ? 24th, 2013 Rome, Italy ------------------------------------------------------------- -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS is an annual event which takes place in Europe each spring since 1998. The sixteenth conference, ETAPS 2013, takes place between March 16th and 24th, 2013 in Rome, Italy. Rome is the capital of Italy; its history spans over two and a half thousand years. Its architectural and archaeological sites (ranging from ancient Romans to Art Nouveau and Modernism, passing through Renaissance and Baroque), and its rich artistic and historical heritage, contribute to the presence of many UNESCO World Heritage Sites. ETAPS main conferences take place on March 18th-22nd, 2013. They are: - CC: International Conference on Compiler Construction - ESOP: European Symposium on Programming - FASE: Fundamental Approaches to Software Engineering - FOSSACS: Foundations of Software Science and Computation Structures - POST: Principles of Security and Trust - TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- SATELLITE EVENTS -- The ETAPS 2013 Organizing Committee invites proposals for Satellite Events (workshops, tutorials, etc.) that will complement the main conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite Events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. ETAPS 2013 Satellite Events will be held immediately before and after the main conferences, on March 16th-17th and March 23rd-24th, 2013. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize Satellite Events are invited to submit proposals in ASCII, PDF or Postscript format by e-mail to etaps2013-sat at di.uniroma1.it. A proposal should not exceed two pages and should include: ? Satellite Event name / acronym ? names and contact information of the organizers ? preferred period: March 16th-17th or March 23rd-24th ? duration of the workshop: one-day or two-day event ? 120-word description of the workshop topic for later use in publicity material ? a brief explanation of the workshop topic and its relevance to ETAPS ? a schedule for paper submission, notification of acceptance and final versions ? expected number of participants ? any other relevant information, like event format, invited speakers, ? publication policy, demo sessions, special space requirements, etc. The proposals will be evaluated by the ETAPS 2013 organizing committee on the basis of their assessed benefit for prospective participants to ETAPS 2013. The titles and brief information about accepted Satellite Events will be included in the ETAPS 2013 web site, call for papers and call for participation. Satellite Events organizers will be responsible for producing the event's call for papers and call for participations advertising the event through specialist mailing lists etc. to complement publicity for ETAPS as a whole hosting and maintaining a web site for the event reviewing and making acceptance decisions on submitted papers producing the event proceedings, if any; facilities for printing will be made available by the ETAPS organizers scheduling workshop activities in consultation with the local organizers Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2012: http://www.etaps.org/2012/workshops ETAPS 2011: http://www.etaps.org/2011/workshops ETAPS 2010: http://www.etaps10.cs.ucy.ac.cy/ ETAPS 2009: http://www.cs.york.ac.uk/etaps09/ ETAPS 2008: http://etaps08.mit.bme.hu/ ETAPS 2007: http://www.di.uminho.pt/etaps07/ ETAPS 2006: http://www.complang.tuwien.ac.at/etaps06/ ETAPS 2005: http://www.etaps05.inf.ed.ac.uk/ ETAPS 2004: http://www.lsi.upc.es/etaps04/ ETAPS 2003: http://www.mimuw.edu.pl/etaps03/ -- IMPORTANT DATES -- Satellite Event Proposals Deadline: December 16th, 2011 Notification of acceptance: January 10th, 2012 -- FURTHER INFORMATION AND ENQUIRIES -- Please contact Paolo Bottoni or Pietro Cenciarelli (workshops chairs) etaps2013-sat at di.uniroma1.it (preferred) bottoni at di.uniroma1.it, cenciarelli at di.uniroma1.it +---------------------------------------------------------------+ | Joost-Pieter Katoen email: my_last_name[at]cs.rwth-aachen.de | | RWTH Aachen University URL: moves.rwth-aachen.de/~katoen | | LS2: Software Modeling and Verification tel: +49 241 8021200 | | D-52056 Aachen, Germany fax: +49-241 8022217 | +---------------------------------------------------------------+ From m.huisman at utwente.nl Mon Oct 17 09:44:22 2011 From: m.huisman at utwente.nl (Marieke Huisman) Date: Mon, 17 Oct 2011 15:44:22 +0200 Subject: [TYPES/announce] CfP: Bytecode 2012 Message-ID: <4E9C3136.3080706@utwente.nl> CALL FOR PAPERS 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/ 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 a relevant journal. Important Dates =============== Paper submission: January 4, 2012 Notification: January 26, 2012 Final version: February 6, 2012 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 a journal. Invitations will be based on submissions and presentations. Papers can be submitted (as PDF) through easy chair http://www.easychair.org/conferences/?conf=bytecode2012. 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 M?ller, ETH Z?rich, Switzerland Tamara Rezk, INRIA Sophia Antipolis-Mediterranee, France Bernhard Scholz, University of Sydney, Australia Fausto Spoto, University of Verona, Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From maffeis at doc.ic.ac.uk Mon Oct 17 11:58:20 2011 From: maffeis at doc.ic.ac.uk (Sergio Maffeis) Date: Mon, 17 Oct 2011 17:58:20 +0200 Subject: [TYPES/announce] PLAS 2012: Preliminary call for papers Message-ID: <4E9C509C.8060007@doc.ic.ac.uk> [Programming Languages and Analysis for Security has been a major consumer of type systems. Submissions from Types types of people warmly encouraged.] *********************************************************************** Preliminary Call for Papers Seventh ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2012) http://www.doc.ic.ac.uk/PLAS2012 June 14, 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 14, 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 et52 at mcs.le.ac.uk Tue Oct 18 05:14:46 2011 From: et52 at mcs.le.ac.uk (Emilio Tuosto) Date: Tue, 18 Oct 2011 10:14:46 +0100 Subject: [TYPES/announce] CONCUR 2012: Call for workshops / deadline approaching Message-ID: <33A8FF92-59DB-4751-8E67-4420711FB88E@mcs.le.ac.uk> Apologies for cross-posting. * CONCUR 2012 * Call for affiliated workshops The 23rd Conference on Concurrency Theory (CONCUR 2012) will be held September 4th to September 7th 2012, in Newcastle upon Tyne, UK. It will co-locate with 21st Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS, September 4th to September 6th, 2012), and the 7th Workshop on Trustworthy Global Computing (TGC, September 7th to September 8th, 2012). Researchers and practitioners are invited to submit proposals for workshops to be affiliated to CONCUR 2012, on topics related to concurrency theory and its applications. Example topics include: semantics, logics, verification techniques for concurrent systems, and cross-fertilization between industry and academia. 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://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, September 3rd and Saturday, September 9th, 2012. Proposals should include: * The name and the preferred date of the proposed workshop. * 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: Monday, October 24, 2011 Notification of acceptance: Wednesday, November 9, 2011 Workshops: September 3rd, 2012 and September 8th, 2012 Submissions to: Jason Steggles and Emilio Tuosto 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 (jason.steggles at newcastle.ac.uk and emilio at mcs.le.ac.uk) The CONCUR 2012 workshop chairs, Jason Steggles and Emilio Tuosto From ddino at eecs.qmul.ac.uk Tue Oct 18 08:18:05 2011 From: ddino at eecs.qmul.ac.uk (Dino Distefano) Date: Tue, 18 Oct 2011 13:18:05 +0100 Subject: [TYPES/announce] Research Engineer at Monoidics, London, UK Message-ID: Monoidics Ltd (www.monoidics.com), a high-tech SME specialising in automatic formal verification and producer of the INFER static analyzer is looking for a Research Engineer (3 years) to work on the EU Strep project CARP (Correct and Efficient Accelerator Programming), funded by the European Union. Other partners in the project are Imperial College, UK; Realeyes, Estonia; ARM, UK; RTWH Aachen, Germany; University of Twente, The Netherland; ENS, France and Rightware, Finland. Within the context of the CARP project, the research engineer will work on the development of tools and techniques for logic-based verification/static analysis for accelerator programming. Qualifications and Skills required: - PhD degree in Computer Science (or an equivalent qualification). - strong programming skills (in particular OCaml, but also C/C++/Java/system programming/embedded) - good background knowledge of static analysis, verification, concurrency, logic, compilers and formal methods. Starting date: December 1st, 2011, or as soon as possible thereafter. Location: London, UK Salary: Competitive For further information contact: Dr. Dino Distefano (dino.distefano at monoidics.com) =============================================================== About Monoidics: Monoidics is a high-tech SME specialising in automatic formal verification and analysis of software. Founded in the beginning of 2009 by a group of computer scientists from London and Cambridge, Monoidics designs automatic verification technology for safety critical industrial software. Monoidics' 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 players in safety critical systems in Europe, USA, and Japan. =============================================================== About the CARP project: In recent years, massively parallel accelerator processors, primarily GPUs, have become widely available to end-users. Accelerators offer tremendous compute power at a low cost, and tasks such as media processing, simulation, medical imaging and eye-tracking can be accelerated to beat CPU performance by orders of magnitude. Performance is gained in energy efficiency and execution speed, allowing intensive media processing software to run in low-power consumer devices. Accelerators present a serious challenge for software developers. A system may contain one or more of the plethora of accelerators on the market, with many more products anticipated in the immediate future. Applications must exhibit portable correctness, operating correctly on any configuration of accelerators, and portable performance, exploiting processing power and energy efficiency offered by a wide range of devices. The overall aims of CARP are to design techniques and tools for correct and efficient accelerator programming: - Novel & attractive methods for constructing system-independent accelerator programs - Advanced code generation techniques to produce highly optimised system-specific code from system-independent programs - Scalable static techniques for analysing system-independent and system-specific accelerator programs, both qualitatively and quantitatively. -------------- next part -------------- An HTML attachment was scrubbed... URL: From duran at lcc.uma.es Tue Oct 18 12:44:05 2011 From: duran at lcc.uma.es (=?iso-8859-1?Q?Francisco_Dur=E1n?=) Date: Tue, 18 Oct 2011 17:44:05 +0100 Subject: [TYPES/announce] WRLA 2012: Call for papers Message-ID: <5E3D95F0-8AE6-44D3-A0FA-ACC4AA88EA42@lcc.uma.es> 9TH INTERNATIONAL WORKSHOP ON REWRITING LOGIC AND ITS APPLICATIONS WRLA 2012 Tallinn, Estonia, March 24-25, 2012 http://wrla2012.lcc.uma.es/ The workshop will be held in conjunction with ETAPS 2012 14th European Joint Conferences on Theory and Practice of Software March 24 - April 1, 2012 http://www.etaps.org/2012 IMPORTANT DATES December 14, 2011 Deadline for submission January 18, 2012 Author notification Early February, 2010 Final version in electronic form AIMS AND SCOPE Rewriting logic (RL) is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application fields. It also has good properties as a metalogical framework for representing logics. In recent years, several languages based on RL (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the workshop is to bring together researchers with a common interest in RL and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. The topics of the workshop comprise, but are not limited to, - foundations and models of RL; - languages based on RL, including implementation issues; - RL as a logical framework; - RL as a semantic framework, including applications of RL to - object-oriented systems, - concurrent and/or parallel systems, - interactive, distributed, open ended and mobile systems, - specification of languages and systems; - use of RL to provide rigorous support for model-based software engineering; - formalisms related to RL, including - real-time and probabilistic extensions of RL, - rewriting approaches to behavioral specifications, - tile logic; - verification techniques for RL specifications, including - equational and coherence methods, and - verification of properties expressed in first-order, higher-order, modal and temporal logics; - comparisons of RL with existing formalisms having analogous aims; - application of RL to specification and analysis of - distributed systems, - physical systems. PROGRAM COMMITTEE - Emilie Balland, INRIA Bordeaux - Sud-Ouest, France - Artur Boronat, University of Leicester, UK - Mark van den Brand, Eindhoven University of Technology, The Netherlands - Roberto Bruni, University of Pisa, Italy - Manuel Clavel, IMDEA Software & Universidad Complutense de Madrid, Spain - Grit Denker, SRI International, USA - Francisco Duran (chair), Universidad de Malaga, Spain - Steven Eker, SRI International, USA - Santiago Escobar, Universidad Politecnica de Valencia, Spain - Kokichi Futatsugi, JAIST, Japan - Alexander Knapp, Universitat Augsburg, Germany - Dorel Lucanu, Alexandru Ioan Cuza University, Rumania - Salvador Lucas, Universidad Politecnica de Valencia, Spain - Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain - Jose Meseguer, University of Illinois at Urbana-Champaign, USA - Ugo Montanari, Universita di Pisa, Italy - Pierre-Etienne Moreau, Ecole des Mines de Nancy & INRIA Nancy, France - Kazuhiro Ogata, JAIST, Japan - Peter Olveczky, University of Oslo, Norway - Miguel Palomino, Universidad Complutense de Madrid, Spain - Grigore Rosu, University of Illinois at Urbana-Champaign, USA - Vlad Rusu, INRIA Lille Nord-Europe, France - Carolyn Talcott, SRI International, USA - Martin Wirsing, Ludwig-Maximilians-Universit?t, Germany STEERING COMMITTEE - Kokichi Futatsugi, JAIST, Japan - Claude Kirchner, INRIA Research Center Bordeaux - Sud-Ouest, France - Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain - Jose Meseguer, University of Illinois at Urbana-Champaign, USA - Ugo Montanari, Universita di Pisa, Italy - Grigore Rosu, University of Illinois at Urbana-Champaign, USA - Carolyn Talcott, SRI International, USA - Martin Wirsing, Ludwig-Maximillian University, Germany SUBMISSIONS Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere. Papers should not exceed 15 pages, should be formatted according to the guidelines for Springer LNCS papers, and should be submitted electronically using EasyChair. The final program of the workshop will also include system demonstrations and invited presentations to be determined. Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be published by the organization of ETAPS. As for WRLA 2010, we are negotiating the publications of a volume in the Springer's LNCS series as post-proceedings. Depending on the number and the quality of the contributions, we will consider the preparation of a special issue in some scientific journal in the field with extended versions of a selection of the papers of the workshop. CONTACT INFORMATION For more information, please contact the organizers (duran @ lcc . uma . es) or visit the workshop web page http://wrla2012.lcc.uma.es/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From jfoster at cs.umd.edu Wed Oct 19 16:07:32 2011 From: jfoster at cs.umd.edu (Jeff Foster) Date: Wed, 19 Oct 2011 16:07:32 -0400 Subject: [TYPES/announce] Postdoctoral position in program analysis and security at the University of Maryland, College Park References: <45187ED1-4C56-486A-9EDF-56FB960B82A4@cs.umd.edu> 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 language-based security, with an emphasis on static and dynamic analysis. Description ----------- The aim of the project is to apply programming language-based techniques to improve the security of modern software. Our focus is on software running on embedded devices, including Android mobile phones and distributed sensor networks. While many aspects of security are in play, our core interest is developing novel and expressive protections of resource and data privacy, in particular by employing mechanisms to authorize, minimize, and audit (reason about) the flow of information between an application and its environment. The work will include both theoretical development and implementation of practical tools. Requirements ------------ Applicants to this position must have received their PhD, or completed the requirements for their PhD, when the appointment begins. A strong background in at least two of the following research areas is desired (the more, the better!): - Program analysis (with some background in abstract interpretation preferred), including those based on type systems - Formal methods - Software security - Program transformation We also expect that applicants to be good programmers, preferably in either Java or Objective Caml, and with some experience building non-trival software. Some knowledge of Android development or sensor network programming would also be desirable, but is not required. * Application deadline: November 15, 2011 for full consideration. The position will remain open until filled. * Start date: January 31, 2012 (at the earliest; 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. Additional information ---------------------- Questions about this position should be directed to Jeff Foster (jfoster at cs.umd.edu) and Michael Hicks (mwh at cs.umd.edu). For more information about the Maryland PL group, please visit http://www.cs.umd.edu/projects/PL/ The University of Maryland is an equal opportunity, affirmative action employer. Women and minorities are strongly encouraged to apply. From emmanuel.beffara at univmed.fr Thu Oct 20 06:03:00 2011 From: emmanuel.beffara at univmed.fr (Emmanuel Beffara) Date: Thu, 20 Oct 2011 12:03:00 +0200 Subject: [TYPES/announce] LI2012: call for participation Message-ID: <20111020100300.GG2563@iml244> CALL FOR PARTICIPATION LOGIC AND INTERACTIONS 2012 (LI2012) WINTER SCHOOLS and WORKSHOPS Monday January 30 - Friday March 2 CIRM, Luminy, Marseille, France http://li2012.univ-mrs.fr/ The ?Logic and interactions 2012? session is the third such session organized in Marseille on the topic ?logic in computer science?, after "Logic and interactions 2002" and "Geometry of computation 2006". The meeting will run five consecutive weeks, each dedicated to a particular area of logic and its interactions. Each week will include lectures aimed primarily at PhD students and non-specialist researchers, invited and contributed talks addressed to a more specialized audience and work sessions. General programme ================= Obviously the themes of each week are not disjoint, so we encourage participants, especially students, to participate in several weeks. * Winter school in complexity (30 January - 3 February) --------------------------- Implicit complexity, parameterized complexity, boolean circuits, etc. Organizers: Patrick Baillot, Nadia Creignou, Jean-Yves Marion Lecturers and invited speakers: - Martin Hofmann (Munich, Germany) - Yiannis N. Moschovakis (Los Angeles, USA) - Stefan Szeider (Vienna, Austria) - Heribert Vollmer (Hannover, Germany) * Logic and interaction (6 - 10 February) --------------------- Geometry of interaction, ludics, games, linguistics, etc. Organizers: Claudia Faggian, Olivier Laurent, Myriam Quatrini Lecturers and invited speakers: - Michele Abrusci (Roma, Italy) - Ugo Dal Lago (Bologna, Italy) - Christophe Fouquer? (Paris, France) - Dan Ghica (Birmingham, UK) - Jean-Yves Girard (Marseille, France) - Martin Hyland (Cambridge, UK) - Alain Lecomte (Paris, France) - Paolo Pistone (Roma, Italy) - Myriam Quatrini (Marseille, France) - Kurt Ranalter (Munchen, Germany) * Proofs and programs (13 - 17 February) ------------------- Realizability, semantics, program extraction, classical logic, effects and references, concurrent features, etc. Organizers: Olivier Laurent, Alexandre Miquel, Alexis Saurin Lecturers and invited speakers: - Ulrich Berger (Swansea, UK) [to be confirmed] - Hugo Herbelin (INRIA Paris, France) - Guy McCusker (Bath, UK) - Paul-Andr? Melli?s (CNRS, Paris, France) - Alexandre Miquel (ENS Lyon, France) - Jaap van Oosten (Utrecht, Netherlands) - Gordon Plotkin (Edinburgh, UK) - Thomas Streicher (Darmstadt, Germany) * Quantitative approaches (20 - 24 February) ----------------------- Algebraic extensions of lambda-calculi and linear logic, logical approaches to probabilistic and quantum computation,?quantitative semantics,?resource and differential lambda-calculi. Organizers: Michele Pagani, Simon Perdrix, Peter Selinger, Christine Tasson Lecturers and invited speakers: - Rick Blute (Ottawa, Canada) - Ross Duncan (Brussels, Belgium) - Thomas Ehrhard (Paris, France) - Alexander Green (Nottingham, UK) - Elham Kashefi (Edinburgh, UK) - Aleks Kissinger (Oxford, UK) - Prakash Panangaden (McGill, Montr?al, Canada) * Algebra and computation (27 February - 2 March) ----------------------- Rewriting, operads, algebraic invariants of computation, type theory and homotopy, etc. Organizers: Pierre-Louis Curien, Yves Guiraud, Philippe Malbos, Fran?ois M?tayer Lecturers and invited speakers: - Dimitri Ara (Paris, France) - Albert Burroni (Paris, France) - Vladimir Dotsenko (Luxembourg) - Nicola Gambino (Palermo, Italy) - St?phane Gaussent (Nancy, France) - Jean-Louis Loday (CNRS, Strasbourg, France) - Paul-Andr? Melli?s (CNRS, Paris, France) - Samuel Mimram (CEA Saclay, France) - Timothy Porter (University of Wales, Bangor, UK) - Bruno Vallette (Nice-Sophia Antipolis, France) - Michael Warren (IAS, Princeton, USA) Call for contributed talks ========================== Each week, except the last one, will include sessions for contributed talks. Details on the submission procedures can be found on the web page for each week. No publication of proceedings is planned, submission of published work is allowed. Deadlines for submissions: - Complexity: December 15th, 2011 - Logic and interaction: November 30th, 2011 - Proofs and programs: December 15th, 2011 - Quantitative approaches: December 1st, 2011 Registration ============ There are no registration fees. Accomodation at the CIRM should be available for all participants: the only condition is to register on time. Pre-registration is now open on the web site. Once your pre-registration is validated, you will be contacted by the CIRM for the actual registration and booking. FYI: The standard rate for staying at the CIRM, including breakfast and two meals each day is 82 (double room) to 90 (single room) euros per day. Grants ====== We plan to fund the accommodation at the CIRM for all participants requiring it: simply select the appropriate option in the pre-registration form. We might also provide a limited amount of travel grants for students. To apply for such a grant, be sure to check the corresponding box of the pre-registration form: we will contact you directly for further information. -- Emmanuel Beffara and Lionel Vaux Institut de Math?matiques de Luminy From bywang at iis.sinica.edu.tw Thu Oct 20 21:34:09 2011 From: bywang at iis.sinica.edu.tw (bywang at iis.sinica.edu.tw) Date: Fri, 21 Oct 2011 09:34:09 +0800 Subject: [TYPES/announce] Call for Participation: APLAS+CPP Message-ID: <20111021093409.11873z8r8v67pfyp@webmail.iis.sinica.edu.tw> CALL FOR PARTICIPATION APLAS+CPP Kenting, Taiwan December 4 to 9, 2011 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 an essential paradigm for their work. Certification here means formal, mechanized verification of some sort, preferably with production of independently checkable certificates. CPP targets any research promoting formal development of certified software and proofs. For the first time, APLAS and CPP will be held together in Kenting, Taiwan from December 4 to 9, 2011. The six-day event includes two tutorials, six invited talks, and two conferences. We offer a special rate for participants who register to both conferences. For the detailed program of each conference, please go to their respective web sites: http://flolac.iis.sinica.edu.tw/aplas11/doku.php (APLAS) http://formes.asia/cpp/ (CPP) Early Registration (until November 12, 2011) Regular | Student -----------------------+----------- APLAS+CPP: TWD 24000 | TWD 19500 APLAS only: TWD 16500 | TWD 13500 CPP only: TWD 16500 | TWD 13500 Location The conferences will be held in Kenting, a seaside resort and national park in Southern Taiwan. Temperatures in Kenting averaged at 21.4 C in December 2010 (high: 29.5, low: 14.3). It can be a bit windy, but the weather probably is the best in Taiwan in December. You can find more information about the Kenting National Park at Wikipedia and Wikitravel. The conference venue is Howard Beach Resort Kenting. Keynote Speakers o Andrew Appel (Princeton University) VeriSmall: Verified Smallfoot Shape Analysis o Nikolaj Bjorner (Microsoft Research) Engineering Theories with Z3 o Ranjit Jhala (UC San Diego) Software Verification with Liquid Types o Peter O'Hearn (Queen Mary, University of London) Algebra, Logic, Locality, Concurrency o Sriram Rajamani (Microsoft Research India) Program Analysis and Machine Learning: A Win-Win Deal o Vladimir Voevodsky (Institute for Advanced Study, Princeton) Univalent Semantics of Constructive Type Theories Tutorials o Lei Liu (Chinese Academy of Sciences) Parallelizing Legacy Sequential Code o Shin-Cheng Mu (Academia Sinica) Dependently Typed Programming in Adga Panels o Certificates (moderator: Dale Miller) o Teaching with Proof Assistants (moderator: Tobias Nipkow) List of Accepted Papers APLAS o Thao Dang and Thomas Martin Gawlitza. Time Elapse over Template Polyhedra in Polynomial Time through Max-Strategy Iteration o David Monniaux and Martin Bodin. Modular Abstractions of Reactive Nodes using Disjunctive Invariants o Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gomez-Zamalloa and German Puebla. Cost Analysis of Concurrent OO Programs o Benoit Boissinot, Florian Brandner, Alain Darte, Benoit Dupont De Dinechin and Fabrice Rastello. A Non-Iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs o Dmitriy Traytel, Stefan Berghofer and Tobias Nipkow. Extending Hindley-Milner Type Inference with Coercive Subtyping o Patrick Baillot. Elementary linear logic revisited for polynomial time and an exponential time hierarchy o Zhen Cao, Yuan Dong and Shengyuan Wang. Compiler Backend Generation for Application Specific Instruction Set Processors o Akimasa Morihata. Macro Tree Transformations of Linear Size Increase Achieve Cost-optimal Parallelism o Jade Alglave, Daniel Kroening, John Lugton, Vincent Nimal and Michael Tautschnig. Soundness of Data Flow Analyses for Weak Memory Models o Yulei Sui, Sen Ye, Jingling Xue and Pen-Chung Yew. SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA o Keiko Nakata, Tarmo Uustalu and Marc Bezem. A Proof Pearl with the Fan Theorem and Bar Induction: Walking through Infinite Trees with Mixed Induction and Coinduction o Ulrich Schoepp. Computation-by-Interaction with Effects o Ashutosh Gupta, Corneliu Popeea and Andrey Rybalchenko. Solving Recursion-Free Horn Clauses over LI+UIF o Hakjoo Oh and Kwangkeun Yi. Access-based Localization with Bypassing o Yun-Yan Chi and Shin-Cheng Mu. Constructing List Homomorphisms from Proofs o Jonas Magazinius, Aslan Askarov and Andrei Sabelfeld. Decentralized Delimited Release o Filippo Bonchi, Fabio Gadducci and Giacoma Monreale. Towards A General Theory of Barbs, Contexts and Labels o Lukasz Fronc and Franck Pommereau. Towards a Certified Petri Net Model-Checker o Fernando Saenz-Perez. A Deductive Database with Datalog and SQL Query Languages o Yuichiro Kokaji and Yukiyoshi Kameyama. Polymorphic Multi-Stage Language with Control Effects o Ana Milanova and Wei Huang. Static Object Race Detection o Alexander Malkis and Laurent Mauborgne. On the Strength of Owicki-Gries for Resources o Casey Klein, Jay Mccarthy, Steven Jaconette and Robert Bruce Findler. A Semantics for Context-Sensitive Reduction Semantics CPP o Mathieu Boespflug, Maxime D?n?s and Benjamin Gr?goire. Full reduction at full throttle o Thi Minh Tuyen Nguyen and Claude March?. Hardware-Dependent Proofs of Numerical Programs o Dongchen Jiang and Tobias Nipkow. Proof Pearl: The Marriage Theorem o Jean-David Genevaux, Julien Narboux and Pascal Schreck. Formalization of Wu's simple method in Coq o Thomas Braibant. Coquet: a Coq library for verifying hardware o Martin Henz and Aquinas Hobor. Teaching Logic and Formal Methods with Coq o Christian Doczkal and Gert Smolka. Constructive Formalization of Hybrid Logic with Eventualities o Sorin Stratulat and Vincent Demange. Automated Certification of Implicit Induction Proofs o Michael Armand, Germain Faure, Benjamin Gregoire, Chantal Keller, Laurent Th?ry and Benjamin Werner. A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses o Jinjiang Lei and Zongyan Qiu. Verification of Scalable Synchronous Queue o Thomas Braibant and Damien Pous. Tactics for Reasoning modulo AC in Coq o Tom Ridge. Simple, functional, sound and complete parsing for all context-free grammars o Thierry Coquand and Vincent Siles. A Decision Procedure for Regular Expression Equivalence in Type Theory o Pierre Corbineau, Mathilde Duclos and Yassine Lakhnech. Certified Security Proofs of Cryptographic Protocols in the Computational Model : an Application to Intrusion Resilience o Jieung Kim and Sukyoung Ryu. Coq Mechanization of Featherweight Fortress with Multiple Dispatch and Multiple Inheritance o Xiaomu Shi, Jean-Francois Monin, Fr?d?ric Tuong and Fr?d?ric Blanqui. First Steps Towards the Certification of an ARM Simulator o Sascha B?hme, Anthony Fox, Thomas Sewell and Tjark Weber. Reconstruction of Z3's Bit-Vector Proofs in HOL4 and Isabelle/HOL o Cezary Kaliszyk and Henk Barendregt. Reasoning about Constants in Nominal Isabelle, or how to Formalize the Second Fixed Point Theorem o Fr?d?ric Besson, Pierre-Emmanuel Cornilleau and David Pichardie. Modular SMT Proofs for Fast Reflexive Checking inside Coq o Luis Caires, Frank Pfenning and Bernardo Toninho. Proof-Carrying Code in a Session-Typed Process Calculus o Wolfram Kahl. CalcCheck: A Proof Checker for Gries and Schneider's "Logical Approach to Discrete Math" o James Cheney and Christian Urban. Mechanizing the metatheory of mini-XQuery o Dale Miller. A proposal for broad spectrum proof certificates o Michael Backes, Catalin Hritcu and Thorsten Tarrach. Automatically Verifying Typing Constraints for a Data Processing Language ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From ze at inf.u-szeged.hu Fri Oct 21 02:23:29 2011 From: ze at inf.u-szeged.hu (ze at inf.u-szeged.hu) Date: Fri, 21 Oct 2011 08:23:29 +0200 (CEST) Subject: [TYPES/announce] FICS 2012 Call for Papers Message-ID: <59559.163.143.44.35.1319178209.squirrel@webmail.inf.u-szeged.hu> Preliminary Call for Papers/Extended Abstracts FICS 2012 Workshop March 24, 2012, Tallinn, Estonia Satellite workshop to ETAPS 2012 http://www.inf.u-szeged.hu/fics2012/ Important dates: Abstract submission: 4 Dec 2011 Paper submission: 11 Dec 2011 Notification: 21 Jan 2012 Final version: 5 Feb 2012 Background: Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of this workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop) and Brno (2010, MFCS/CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers: TBA Submission: Selection of contributed talks is based on extended abstracts/short papers of 6 pages formatted with easychair.cls. Submission is via EasyChair in two stages: titles and abstracts by 4 December, and extended abstracts/short papers by 11 December. The authors will be notified of acceptance/rejection by 21 January 2012. We will distribute the short papers presented at the meeting via the open source repository EPTCS. Journal publication: If the number and quality of submissions and accepted talks warrant this, a special issue of an internationally recognized journal devoted to the event will be published. FICS Program Committee: PC co-Chairs: * Dale Miller, INRIA-Saclay, France * Zoltan Esik, University of Szeged, Hungary PC members: * Achim Jung, University of Birmingham, UK * Arnaud Carayol, Institut Gaspard-Monge, France * David Baelde, University of Paris 11, France * Fabio Gadducci, University of Pisa, Italy * Igor Walukiewicz, LaBRI Bordeaux, France * Irene Guessarian, University of Paris 7, France * Jan Rutten, Radboud University, Holland * Julian Bradfield, University of Edinburgh, UK * Luigi Santocanale, Universit? Aix-Marseille I, France * Ralph Matthes, IRIT Toulouse, France * Stephan Kreutzer, Technische Universit?t Berlin, Germany * Tarmo Uustalu, Institute of Cybernetics, Estonia * Wan Fokkink, Vrije Universiteit, Holland From kgl at cs.aau.dk Fri Oct 21 02:40:04 2011 From: kgl at cs.aau.dk (Kim G. Larsen) Date: Fri, 21 Oct 2011 08:40:04 +0200 Subject: [TYPES/announce] PhD positions at Aalborg University Message-ID: <4EA113C4.3040204@cs.aau.dk> CISS, Aalborg, Denmark - Several PhD positions ================================================ The IDEA4CPS center (www.idea4cps.dk) is a newly established Danish-Chinese basic research center on the foundations of cyber-physical systems. The center will research and develop 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. In order to pursue this goal, we seek several PhD applicants within the following research themes: ? Specification and modeling formalisms with special focus on resource-aware formalisms. ? Validation and analysis techniques with special emphasis on e.g. refinement and abstraction, quantitative analysis or model based testing and model learning. ? Compositionality with emphasis on components and interfaces for resources. The ideal applicants have both a theoretical background as well as an interest in exploiting the results into algorithms, tools, and applications on selected industrial cases. The center is a joint initiative funded by basic research organizations in Denmark and China, and it involves two partners in each country. This means that international collaboration will be a major theme of the research within the center. Interested candidates may send further questions and a short statement of research interests (possibly with a short CV) to the Danish Principal Investigator Kim Guldstrand Larsen (kgl at cs.aau.dk) or work package leader Arne Skou (ask at cs.aau.dk) before November 15, 2011. -- --------------------------------------------------------------------- Kim G. Larsen Email: kgl at cs.aau.dk Director, CISS URL: www.cs.aau.dk/~kgl Professor, Computer Science Mobile: +45 22171159 Aalborg University Phone: +45 99408893 Selma Lagerl?fsvej 300 Fax: +45 99409794 DK-9220 Aalborg, DENMARK From milner-symposium at inf.ed.ac.uk Fri Oct 21 04:58:50 2011 From: milner-symposium at inf.ed.ac.uk (Milner Symposium) Date: Fri, 21 Oct 2011 09:58:50 +0100 Subject: [TYPES/announce] Milner Symposium, Edinburgh, 16-18 April 2012 - first announcement Message-ID: An embedded and charset-unspecified text was scrubbed... Name: not available URL: From icfp.publicity at googlemail.com Fri Oct 21 05:55:10 2011 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Fri, 21 Oct 2011 11:55:10 +0200 Subject: [TYPES/announce] ICFP 2012: Call for workshops and co-located events Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2012 17th ACM SIGPLAN International Conference on Functional Programming September 9 - 15, 2012 Copenhagen, Denmark http://icfpconference.org/icfp2012/ The 17th ACM SIGPLAN International Conference on Functional Programming will be held in Copenhagen, Denmark on September 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. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2012 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 9 (the day before ICFP) and September 13-15 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 19, 2011 Notification of acceptance: December 17, 2011 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 2012 workshop co-chairs (Patrik Jansson and Gabriele Keller), via email to icfp12-workshops at cse.unsw.edu.au by November 19, 2011. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 17, 2011, 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/icfp2012/icfp12-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 2012 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Gabriele Keller (University of New South Wales) Workshop Co-Chair: Patrik Jansson (Chalmers University of Technology) General Chair : Peter Thiemann (University of Freiburg) Program Chair: Robby Findler (Northwestern University) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Patrik Jansson and Gabriele Keller), via email to icfp12-workshops at cse.unsw.edu.au From hirokawa at jaist.ac.jp Fri Oct 21 09:52:25 2011 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Fri, 21 Oct 2011 22:52:25 +0900 Subject: [TYPES/announce] IWC 2012 & CoCo 2012: First Call for Papers and Provers Message-ID: <20111021225225.8baf8c36.hirokawa@jaist.ac.jp> This is a joint call for papers and provers for IWC 2012 and CoCo 2012. ====================================================================== First Call for Papers 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. IMPORTANT DATES: * submission March 6, 2012 * notification March 20, 2012 * final version April 3, 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 LIPIcs style. Submission will be via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2012 ====================================================================== First 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 - May 15, 2012 * tool submission May 1 - 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/ ORGANISING COMMITTEE: * Takahito Aoto Tohoku University (chair) * Nao Hirokawa JAIST * Harald Zankl University of Innsbruck From sandra at dcc.fc.up.pt Fri Oct 21 10:36:44 2011 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Fri, 21 Oct 2011 15:36:44 +0100 Subject: [TYPES/announce] LINEARITY 2012 - Call for papers Message-ID: <41954557-0215-444E-BCD1-D54C6CCB0BD3@dcc.fc.up.pt> Call for Papers Second International Workshop on Linearity http://sites.google.com/site/linearity2012/ Tallinn, Estonia 1 April 2012 An associated event of ETAPS 2012, European Joint Conferences on Theory and Practice of Software =================================================================== 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. Topics of interest include foundational calculus, models, applications to programming languages and systems. This includes (but is not limited to): * Linear types: session types, etc * Linear calculi; * Functional calculi: lambda-calculus, rho-calculus, term and graph rewriting; * Object calculi; * Interaction-based systems: interaction nets, games; * Concurrent models: process calculi, action graphs; * Calculi expressing locality, mobility, and active data; * Quantum computational models; * Biological or chemical models of computation; Important Dates --------------- * 16 December 2011: Abstract deadline (registration with easychair) * 22 December 2011: Submission deadline * 20 January 2012: Author notification * 3 February 2012: Deadline for final versions of accepted papers * 1 April 2012: Workshop Submission and Publication -------------------------- Authors are invited to submit a short paper (5-7 pages). Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PostScript or PDF format, using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/account/signin.cgi? timeout=1;conf=linearity2012 After the workshop authors are invited to submit a revised version (12 pages) of their presentation. After a second round of refereeing, accepted contributions will appear in an issue of Electronic Proceedings in Theoretical Computer Science (www.eptcs.org). Authors and participants will also be invited to submit an article to a special issue of a Journal. Programme Committee ------------------- * Sandra Alves (co-chair) * Maribel Fern?ndez * M?rio Florido * Martin Hofmann * Ian Mackie (co-chair) * Simone Martini * Valeria de Paiva * Simona Ronchi Della Rocca * Alex Simpson Contact ------- Sandra Alves: sandra at dcc.fc.up.pt Ian Mackie: iancmackie at gmail.com From carlos.martin at urv.cat Sun Oct 23 04:54:13 2011 From: carlos.martin at urv.cat (=?iso-8859-1?Q?=22Carlos_Mart=EDn_Vide=22?=) Date: Sun, 23 Oct 2011 10:54:13 +0200 Subject: [TYPES/announce] WSLST 2012: 2nd announcement Message-ID: ********************************************************************* 2012 INTERNATIONAL WINTER SCHOOL IN LANGUAGE AND SPEECH TECHNOLOGIES WSLST 2012 (formerly International PhD School in Language and Speech Technologies) Tarragona, Spain January 23-27, 2012 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/wslst2012/ ********************************************************************* AIM: WSLST 2012 offers a broad and intensive series of lectures on language and speech technologies at different levels. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate and foster their research career. The previous event in this series was SSLST 2011 (http://grammars.grlmc.com/sslst2011/). ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Linguistics. Other students (for instance, from Mathematics, Electrical Engineering, Philosophy, or Cognitive Science) are welcome too. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. There is no overlap in the class schedule. COURSES AND PROFESSORS: - Eneko Agirre (U Basque Country), Semantic Processing of Text: Word Sense Disambiguation, Entity Linking and Semantic Similarity [introductory/intermediate, 8 hours] - William J. Byrne (Cambridge), Weighted Finite State Transducers in Statistical Machine Translation [introductory/advanced, 6 hours] - Marcello Federico (Fondazione Bruno Kessler, Trento), Statistical Language Modeling [introductory/advanced, 8 hours] - Ralph Grishman (New York), Information Extraction [intermediate, 8 hours] - John Nerbonne (Groningen), Using Edit-Distance to Understand Linguistic Variation [introductory/advanced, 4 hours] - Geoffrey K. Pullum (Edinburgh), The Formal Properties of Human Languages: Description with a View to Implementation [introductory/intermediate, 8 hours] - Jian Su (Institute for Infocomm Research, Singapore), Coreference Resolution and Discourse Relation Recognition [advanced, 4 hours] - Christoph Tillmann (IBM T.J. Watson Research Center), Simple and Effective Algorithms and Models for Non-hierarchical Statistical Machine Translation [intermediate, 6 hours] - David R. Traum (U Southern California), Approaches to Dialogue Systems and Dialogue Management [introductory, 8 hours] - Dekai Wu (Hong Kong U of Science and Technology), Syntactic and Semantic Statistical Machine Translation [introductory/advanced, 8 hours] REGISTRATION: It has to be done on line at http://grammars.grlmc.com/wslst2012/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until November 13, 2011), - 15 euros (for payments after November 13, 2011). PAYMENT PROCEDURE: The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC; account holder?s address: Av. Catalunya, 35, 43002 Tarragona, Spain) Please mention WSLST 2012 and your full name in the subject. A receipt will be provided on site. Remarks: - Bank transfers should not involve any expense for the School. - People claiming early registration will be requested to prove that they gave the bank transfer order by the deadline. - Students may be refunded only in the case when a course gets cancelled due to the unavailability of the instructor. People registering on site at the beginning of the School must pay in cash. For the sake of local organization, however, it is much recommended to do it earlier. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATES: Students will be delivered a certificate stating the courses attended, their contents, and their duration. IMPORTANT DATES: Announcement of the programme: September 26, 2011 Starting of the registration: September 26, 2011 Early registration deadline: November 13, 2011 Starting of the School: January 23, 2012 End of the School: January 27, 2012 QUESTIONS AND FURTHER INFORMATION: Florentina-Lilica Voicu: florentinalilica.voicu at urv.cat WEBSITE: http://grammars.grlmc.com/wslst2012/ POSTAL ADDRESS: WSLST 2012 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputaci? de Tarragona Universitat Rovira i Virgili From herbert at doc.ic.ac.uk Sun Oct 23 15:02:04 2011 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Sun, 23 Oct 2011 20:02:04 +0100 Subject: [TYPES/announce] Call for Papers QAP'12 Message-ID: <4EA464AC.5080306@doc.ic.ac.uk> [Apologies for multiple copies] ******************************************************************************* FIRST CALL FOR PAPERS 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/ ******************************************************************************* SCOPE: Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on: * the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements) * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Jeremy Bradley, Imperial College London, U.K. Topic: To be announced * Boris Koepf, Politechnical University of Madrid/IMDEA Software, Spain Topic: Information Security * Kim G. Larsen, Aalborg University, Denmark Topic: Statistical Model Checking 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=qapl12 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 in the TCS journal for the QAPL 2010 workshop is about to appear. A further journal special issue with selected papers from QAPL 2011 and QAPL 2012 is planned. IMPORTANT DATES: For regular papers: Abstract (optional): December 17, 2012 Submission (regular paper): December 20, 2012 Notification: January 20, 2012 Final version (ETAPS proceedings): February 5, 2012 Workshop: March 31 - April 1, 2012 Final version (EPTCS post proceedings): TBA For presentation reports: Submission: January 23, 2012 Notification: January 25, 2012 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 palmgren at math.su.se Mon Oct 24 10:57:47 2011 From: palmgren at math.su.se (Erik Palmgren) Date: Mon, 24 Oct 2011 16:57:47 +0200 Subject: [TYPES/announce] PhD-student position in Mathematical Logic at Stockholm University Message-ID: PhD-student position in Mathematical Logic The Department of Mathematics at Stockholm University announces a PhD-student position in mathematical logic. A prospective student will have the opportunity to engage in exciting research related to constructive and category-theoretic foundations of mathematics. Possible subjects include for instance: type theory, categorical logic and constructive mathematics and its algorithmic content. The Stockhom-Uppsala area has a longstanding Logic Seminar with many international guests (www.math.uu.se/Research/Seminars/Logic/?languageId=1) For further information and instructions how to apply, see the Department webpage www.math.su.se/pub/jsp/polopoly.jsp?d=14714&a=99997 The deadline for applications is November 20, 2011. Erik Palmgren Professor of Mathematical Logic Department of Mathematics Stockholm University E-mail: palmgren at math.su.se From sebastian.bauer at pst.ifi.lmu.de Tue Oct 25 07:43:48 2011 From: sebastian.bauer at pst.ifi.lmu.de (Sebastian Bauer) Date: Tue, 25 Oct 2011 13:43:48 +0200 Subject: [TYPES/announce] FIT 2012 - Call for Contributions Message-ID: <7536f27b4d3209c502c96431da6ce530.squirrel@imap.ifi.lmu.de> ----------------------------------------------------------------------- FIT 2012 - CALL FOR CONTRIBUTIONS 4th International Workshop on Foundations of Interface Technologies WORKSHOP AT ETAPS 2012 - Tallinn, Estonia Sunday 25th March 2012 Please visit: http://fit2012.pst.ifi.lmu.de/ ----------------------------------------------------------------------- WORKSHOP TOPIC & AIM --------------------------- 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. FIT 2012 is affiliated to ETAPS and will be held in Tallinn, Estonia. TOPICS OF INTEREST --------------------------- * Modeling of rich interfaces, handling aspects like o timeliness o QoS o safety o reliability o fault-tolerance o security o probability o resource constraints * Type systems * Design methods for interfaces, design by contract * Verification and analysis of interfaces: o abstraction o refinement o assume/guarantee reasoning o compositionality o property preservation o adaptation * Domain-specific interfaces, use of interfaces like o product lines o web services SUBMISSIONS ------------------------ FIT embraces an inclusive formula that emphasizes interaction and discussion. Researchers are encouraged to submit new results, work in progress, work already published, or work submitted for publication elsewhere. Submissions will be judged on general quality and prospective interest to workshop participants. Contributions should be typeset in EPTCS format, available at http://style.eptcs.org/ . Two kinds of submissions are considered: * Regular papers (up to 20 pages in EPTCS format), presenting original and unpublished work (which can also be a survey) * Abstracts (up to 3 pages in EPTCS format), presenting published work All papers should be submitted via EasyChair: https://www.easychair.org/conferences/?conf=fit2012 Informal proceedings will be given to registered participants. Regular papers will be published as post-proceedings after the workshop as a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS). IMPORTANT DATES ------------------------ * Submission: Monday, 19th December 2011 * Notification: Thursday, 19th January 2012 * Camera-ready version for the local pre-proceedings: Monday, 6th February 2012 * Workshop: Sunday, 25th March 2012 * Final version for Post-Proceedings (EPTCS): 12th April 2012 INVITED SPEAKERS ---------------------------------------- * Jos? Luiz Fiadeiro (University of Leicester, UK) * Jiri Srba (Aalborg University, Denmark) * Karsten Wolf (Universit?t Rostock, Germany) PROGRAMME COMMITTEE ---------------------------------------- * Tevfik Bultan (University of California, Santa Barbara, USA) * Marco Faella (Universit? di Napoli "Federico II", Italy) * Rolf Hennicker (LMU M?nchen, Germany) * Holger Hermanns (Saarland University, Germany) * Kim G. Larsen (Aalborg University, Denmark) * Axel Legay (INRIA/IRISA Rennes, France) * Thomas Santen (Microsoft Research, Germany) * Sven Schewe (University of Liverpool, UK) * Mari?lle Stoelinga (University of Twente, The Netherlands) * Andrzej Wąsowski (IT University Copenhagen, Denmark) CONTACT ---------------------------------------- Sebastian Bauer (LMU M?nchen, Germany): bauerse at pst.ifi.lmu.de Jean-Baptiste Raclet (University Paul Sabatier-Toulouse III, France): raclet at irit.fr From cav2012.publicity.chair at gmail.com Tue Oct 25 16:12:37 2011 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Tue, 25 Oct 2011 16:12:37 -0400 Subject: [TYPES/announce] CAV 2012: 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 cav2012.publicity.chair at gmail.com Tue Oct 25 16:14:05 2011 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Tue, 25 Oct 2011 16:14:05 -0400 Subject: [TYPES/announce] CAV 2012: Call For Workshops Message-ID: ------------------------------------------------------------------------ ***** CALL FOR WORKSHOP PROPOSALS ******* 24th International Conference on Computer Aided Verification CAV 2012 July 7-13, 2012 Berkeley, California, USA Workshop Chair: Shuvendu Lahiri (Microsoft Research, Redmond) The 2012 Computer-Aided Verification (CAV) Workshops provide an opportunity for participants to discuss topics in the broader verification related domains. CAV 2012 Workshops will be held before the main conference on July 7 and 8. 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 10th, 2011 by email to the Workshop chair. Organizers will be notified by Nov 20th, 2011. 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: Shuvendu Lahiri (CAV2012 Workshop Chair) Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA Phone: 1-425-722-4122 email: shuvendu AT microsoft.com http: http://research.microsoft.com/en-us/people/shuvendu/ ------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From thomas.ehrhard at pps.jussieu.fr Thu Oct 27 06:29:14 2011 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Thu, 27 Oct 2011 12:29:14 +0200 Subject: [TYPES/announce] Postdoc and Graduate School programmes of the FSMP Message-ID: <4EA9327A.30801@pps.jussieu.fr> Dear Colleagues, I would like to draw your attention to the programmes of the FSMP (Paris Foundation of Mathematical Science), please have a look at the web page of the Foundation: http://www.sciencesmaths-paris.fr/index.php?page=16&lien=index.php?page=39&lien=22&lang=en Notice that "Mathematical Sciences" include "Fundamental Computer Science" and that PPS (http://www.pps.jussieu.fr/), as well as LIAFA (http://www.lafa.jussieu.fr) and the CS Department of the ENS (http://http://www.di.ens.fr/) are part of the Foundation. I'd like to insist in particular on: - The post-doc programme, application deadline December 13th: if you have good candidates please tell them to get in touch with me (or with other colleagues of PPS) as soon as possible, deadline for application December 13th. - The Graduate School programme which provides funding for foreign students in the masters of the FSMP, including Computer Science, deadline for application December 14th. The two following Masters, in which PPS is particularly involved, are associated to this programme: MPRI, https://wikimpri.dptinfo.ens-cachan.fr/doku.php LMFI, http://www.logique.jussieu.fr/www.M2-LMFI/ Don't hesitate to ask us for more information on these programmes and on the application process. Best regards, Thomas Ehrhard thomas.ehrhard at pps.jussieu.fr Preuves, Programmes, Syst?mes CNRS and University Paris Diderot From thomas.ehrhard at pps.jussieu.fr Thu Oct 27 09:27:28 2011 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Thu, 27 Oct 2011 15:27:28 +0200 Subject: [TYPES/announce] Postdoc and Graduate School programmes of the FSMP Message-ID: <4EA95C40.5020302@pps.jussieu.fr> My previous message on this topic contained wrong URLs, here are the correct ones: PPS: http://www.pps.jussieu.fr/ LIAFA: http://www.liafa.jussieu.fr/ ENS CS Dept: http://www.di.ens.fr/ Please accept my apologies, Best regards, Thomas Ehrhard %%%%%%%% Corrected announcement: Dear Colleagues, I would like to draw your attention to the programmes of the FSMP (Paris Foundation of Mathematical Science), please have a look at the web page of the Foundation: http://www.sciencesmaths-paris.fr/ Notice that "Mathematical Sciences" include "Fundamental Computer Science" and that PPS (http://www.pps.jussieu.fr/), as well as LIAFA (http://www.liafa.jussieu.fr/) and the CS Department of the ENS (http://www.di.ens.fr/) are part of the Foundation. I'd like to insist in particular on: - The post-doc programme, application deadline December 13th: if you have good candidates please tell them to get in touch with me (or with other colleagues of PPS) as soon as possible, deadline for application December 13th. - The Graduate School programme which provides funding for foreign students in the masters of the FSMP, including Computer Science, deadline for application December 14th. The two following Masters, in which PPS is particularly involved, are associated to this programme: MPRI, https://wikimpri.dptinfo.ens-cachan.fr/doku.php LMFI, http://www.logique.jussieu.fr/www.M2-LMFI/ Don't hesitate to ask us for more information on these programmes and on the application process. Best regards, Thomas Ehrhard thomas.ehrhard at pps.jussieu.fr Preuves, Programmes, Syst?mes CNRS and University Paris Diderot From afelty at site.uottawa.ca Thu Oct 27 15:20:12 2011 From: afelty at site.uottawa.ca (Amy Felty) Date: Thu, 27 Oct 2011 15:20:12 -0400 Subject: [TYPES/announce] ITP 2012: Call for Papers In-Reply-To: <2c1306c1-b8c4-41c4-8c36-7ce6a5a68ba6@suckerpunch-mbx-0.CS.Princeton.EDU> References: <2c1306c1-b8c4-41c4-8c36-7ce6a5a68ba6@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <4EA9AEEC.2020709@site.uottawa.ca> 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 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.); 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 Conference dates: 13-16 August 2012 Web page: http://itp2012.cs.princeton.edu/ Invited Speakers: Lawrence Paulson (Univ. of Cambridge, UK) Others TBA 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 A.M.Silva at cwi.nl Fri Oct 28 18:03:27 2011 From: A.M.Silva at cwi.nl (A.M.Silva at cwi.nl) Date: Sat, 29 Oct 2011 00:03:27 +0200 Subject: [TYPES/announce] CMCS 2012: second call for papers Message-ID: <20111028220327.GA8053@doorgang.cwi.nl> [- Please note submission deadline January 4 2011 -] ------------------------------------------------------------------------------ CMCS 2012 second call for papers ------------------------------------------------------------------------------ The 11th International Workshop on Coalgebraic Methods in Computer Science 31 March - 1 April 2012, Tallinn, Estonia (co-located with ETAPS 2012) www.coalg.org/cmcs12 *** Proceedings to be published in Springer LNCS *** Aims and scope -------------- In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and probabilistic variants), Markov chains, and game-based systems, can be treated uniformly as coalgebras. Coalgebra has developed into a field of its own interest presenting a deep mathematical foundation, a growing field of applications, and interactions with various other fields such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal and description logics, artificial intelligence, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantic models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). Keynote Speaker --------------- Samson Abramsky, Oxford University, UK Invited Speakers ---------------- Marcello Bonsangue, Leiden University, The Netherlands Pawel Sobocinski, University of Southampton, UK Submissions ----------- Submission is electronic via the easychair system at http://www.easychair.org/conferences/?conf=cmcs2012 following the submission guidelines below. We solicit two types of contributions: (a) Regular papers to be evaluated by the PC for publication in the proceedings: They must have a length no greater than 20 pages, formatted in LNCS style (http://www.springer.de/comp/lncs/authors.html). They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. (b) Short contributions: These will not be published in the proceedings but will be bundled in a technical report. They should be no more than two pages in LNCS format and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Proceedings Publication ----------------------- The proceedings of CMCS 2012 will be published in Springer Lecture Notes in Computer Science. The final proceedings will be published post-conference and feature revised versions of the accepted regular papers. Preliminary proceedings will be made available at the conference in electronic form. Depending on the number and quality of submissions, we will consider publishing extended and revised papers as a journal special issue, subject to the usual reviewing procedure. Previous special issues of CMCS have appeared in high-ranking journals including Information and Computation and Theoretical Computer Science. Important dates --------------- ( for regular papers ) * 4 January 2012: submission deadline (strict) * 3 February 2012: author notification * 7 February 2012: final version ( for short contributions ) * 27 February 2012: submission deadline (strict) * 6 March 2010: author notification ( workshop ) * 31 March - 1 April 2012 Programme Committee ------------------- Luis Barbosa, University of Minho, Braga, Portugal Filippo Bonchi, LIP ENS-Lyon, France Josee Desharnais, Universit? Laval, Canada Mai Gehrke, Radboud University Nijmegen, The Netherlands H. Peter Gumm, University of Marburg, Germany Ichiro Hasuo, University of Tokyo, Japan Patricia Johann, University of Strathclyde, Glasgow, Scotland, UK Ekaterina Komendantskaya, University of Dundee, Scotland, UK Dexter Kozen, Cornell University, Ithaca, NY, USA Dorel Lucanu, Alexandru Ioan Cuza University, Iasi, Romania Stefan Milius, Technical University of Braunschweig, Germany Larry Moss, Indiana University, Bloomington, USA Prakash Panangaden, McGill University, Montreal, Canada Dirk Pattinson, Imperial College London, UK (co-chair) Dusko Pavlovic, Royal Holloway, London, UK Daniela Petrisan, University of Leicester, UK Grigore Rosu, University of Illinois at Urbana-Champaign, USA Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands Luigi Santocanale, University of Provence, Marseille, France Lutz Schr?der, DFKI GmbH, Bremen, Germany (co-chair) Alexandra Silva, CWI, Amsterdam, The Netherlands Ana Sokolova, University of Salzburg, Austria Sam Staton, University of Cambridge, UK Yde Venema, University of Amsterdam, The Netherlands Steering Committee ------------------ Jiri Adamek, Technical University of Braunschweig, Germany Corina Cirstea, University of Southampton, UK H. Peter Gumm (chair), University of Marburg, Germany Bart Jacobs, Radboud University Nijmegen, The Netherlands Alexander Kurz, University of Leicester, UK Marina Lenisa, University of Udine, Italy Ugo Montanari, University of Pisa, Italy Larry Moss, Indiana University, Bloomington, USA Dirk Pattinson, Imperial College London, UK John Power, University of Bath, UK Horst Reichel, Technical University of Dresden, Germany Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands Lutz Schr?der, DFKI GmbH and University of Bremen, Germany . From Patricia.Johann at cis.strath.ac.uk Sat Oct 29 10:41:42 2011 From: Patricia.Johann at cis.strath.ac.uk (Patricia Johann) Date: Sat, 29 Oct 2011 15:41:42 +0100 (BST) Subject: [TYPES/announce] CfP: International Workshop on 75 Years of the Lambda Calculus Message-ID: 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 Fairouz Kamareddine, Heriot-Watt University Gordon Plotkin, University of Edinburgh 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 From jv at informatik.uni-bonn.de Sat Oct 29 14:01:08 2011 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Sat, 29 Oct 2011 20:01:08 +0200 Subject: [TYPES/announce] Call for Papers - First International Workshop on Bidirectional Transformations Message-ID: <4EAC3F64.10206@informatik.uni-bonn.de> =============================================================== CALL FOR PAPERS 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 =============================================================== INVITED SPEAKERS: * Juan de Lara (Autonomous University of Madrid, Spain) * Jean-Luc Hainaut (University of Namur, Belgium) IMPORTANT DATES: * Paper submission: Mon, December 19, 2011 * Author notification: Tue, January 24, 2012 * Camera-ready papers: Sun, February 5, 2012 To facilitate smooth organization of the review process, authors are asked to submit a short abstract by December 12, 2011. SUBMISSION CATEGORIES: * Regular submissions (max. 15 pages, formal proceedings) * Short papers (max. 8 pages, informal proceedings) * Lightning talks (extended abstract) Submissions can be in LNCS or EC-EASST style. More details can be found on the webpage. PROCEEDINGS: There will be formal proceedings containing all accepted regular papers, published as a volume of EC-EASST (Electronic Communications of the European Association of Software Science and Technology, http://journal.ub.tu-berlin.de/eceasst). Short papers will be included in informal proceedings distributed at the workshop, and their authors may be invited to extend their contribution to a full paper for inclusion in the formal proceedings. SCOPE: Bidirectional transformations (bx) are a mechanism for maintaining the consistency of two (or perhaps more) related sources of information. Such sources can be databases, software models, documents, or their abstract models like graphs or trees. 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. The aim of the workshop is to bring together researchers, from all relevant areas, 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 2012 include, but are not limited to: * (coupled) software/model transformations * software-model synchronization * data-schema co-evolution and data synchronization * consistency analysis * language-based approaches * analysis/classification of requirements for bx technologies * case studies and tool support * comparison of bx technologies * efficiency of algorithms and benchmarks Regular submissions (11-15 pages) 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 For details about short papers and lightning talks, please consult the webpage. PROGRAM CO-CHAIRS: * Frank Hermann (Technical University of Berlin, Germany; University of Luxembourg, Luxembourg) * Janis Voigtl?nder (University of Bonn, Germany) PROGRAM COMMITTEE MEMBERS: * Paolo Atzeni (Roma Tre University, Italy) * Benjamin Braatz (University of Luxembourg, Luxembourg) * Anthony Cleve (University of Namur, Belgium) * Alcino Cunha (University of Minho, Portugal) * Carlo Curino (Massachusetts Institute of Technology, USA) * Davide Di Ruscio (University of L'Aquila, Italy) * Zinovy Diskin (University of Waterloo, Canada) * Ulrike Golas (Zuse Institute Berlin, Germany) * Ekkart Kindler (Technical University of Denmark, Denmark) * Kazutaka Matsuda (Tohoku University, Japan) * Fernando Orejas (Technical University of Catalonia, Spain) * Benjamin Pierce (University of Pennsylvania, USA) * Andy Sch?rr (Technical University of Darmstadt, Germany) * Perdita Stevens (University of Edinburgh, UK) * James Terwilliger (Microsoft, USA) * Antonio Vallecillo (University of M?laga, Spain) * Yingfei Xiong (University of Waterloo, Canada) From georg.moser at uibk.ac.at Sun Oct 30 19:39:04 2011 From: georg.moser at uibk.ac.at (Georg Moser) Date: Mon, 31 Oct 2011 00:39:04 +0100 Subject: [TYPES/announce] WST 2012: First Call For Papers Message-ID: <4EADE018.8010304@uibk.ac.at> ====================================================================== First Call for Papers WST 2012 12th International Workshop on Termination Feb 19 - 23, 2012, Obergurgl, Innsbruck http://cl-informatik.uibk.ac.at/users/georg/events/wst2012/ ====================================================================== 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. We will work very hard to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications. IMPORTANT DATES: * submission December 18, 2012 * notification January 15, 2012 * final version January 29, 2012 * workshop February 19 - 23, 2012 TOPICS: The 12th International Workshop on Termination welcomes contributions on all aspects of termination and complexity analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) are particularly welcome. Areas of interest to the workshop include, but are not limited to, the following: * Termination of programs * Termination of rewriting * Termination analysis of transition systems * Complexity of programs * Complexity of rewriting * Implicit computational complexity * Implementations of termination and complexity analysis methods * Certification of termination and complexity proofs * Termination orders, well-founded orders, and reduction orders * Termination methods for theorem provers * Strong and weak normalization of lambda calculi * Termination analysis for different language paradigms * Challenging termination problems/proofs * Applications to program transformation and compilation * Other applications of termination methods * Comparisons and classification of termination methods * Non-termination and loop detection * Termination in distributed systems * Proof methods for liveness and fairness * Well-quasi-order theory * Ordinal notations * Subrecursive hierarchies PROGRAM COMMITTEE: * Ugo Dal Lago University of Bologna * Danny De Schreye K.U. Leuven * Samir Genaim The Complutense University * Nao Hirokawa JAIST * Georg Moser University of Innsbruck (chair) * Albert Rubio Universitat Politecnica de Catalunya * Peter Schneider-Kamp University of Southern Denmark * Ren? Thiemann University of Innsbruck 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). From rensink at cs.utwente.nl Mon Oct 31 10:10:02 2011 From: rensink at cs.utwente.nl (Arend Rensink) Date: Mon, 31 Oct 2011 15:10:02 +0100 Subject: [TYPES/announce] EAPLS PhD Award 2011: Call for Nominations Message-ID: <4EAEAC3A.9090604@cs.utwente.nl> EAPLS PhD Award 2011: 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 2010 ? 1 November 2011 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=eaplsphd2011. 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 2011. 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 2011: Deadline for nominations 16 March 2012: 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 jeremy.siek at colorado.edu Mon Oct 31 15:00:27 2011 From: jeremy.siek at colorado.edu (Jeremy Siek) Date: Mon, 31 Oct 2011 13:00:27 -0600 Subject: [TYPES/announce] 2 faculty positions at CU Boulder Message-ID: University of Colorado Boulder: Department of Electrical, Computer, and Energy Engineering (ECEE) seeks outstanding candidates for two tenure-track positions in computer systems. The openings are targeted at the level of Assistant Professor, but experienced candidates with outstanding credentials may be considered for Associate or Full Professor. Candidates interested in rigorous and innovative approaches to the design and analysis of complex computing systems (from embedded and cyberphysical to large-scale distributed systems) should apply. We seek candidates with background in programming languages, concurrency, security, formal methods, verification, or system engineering. Preference will go to researchers whose work spans multiple areas. The positions will help shape the cooperation with the Department of Computer Science on computing systems. Candidates must have a Ph.D. in electrical engineering, computer engineering, computer science, or related discipline; they must have the ability to develop an independent research program, and enthusiasm for working with undergraduate and graduate students. The University of Colorado is an Equal Opportunity Employer committed to building a diverse workforce. We encourage applications from women, minorities candidates, people with disabilities, and veterans. Applications will be evaluated starting December 6, 2011 and until the positions are filled. Applications must include a letter of application specifying the desired position and area of specialization, complete curriculum vitae, statements of research and teaching interests, and names and contact information of three references. Applications must be submitted on-line at http://www.jobsatcu.com/ using posting number #815103 (computer systems). Additional information is available at that site. Best regards, Jeremy Siek, Fabio Somenzi, Dirk Grunwald, Sriram Sankaranarayanan, and Bor-Yuh Evan Chang -- ____________________________________ Jeremy Siek http://ecee.colorado.edu/~siek/ Assistant Professor Dept. of Electrical, Computer, and Energy Engineering University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: From ggrov at staffmail.ed.ac.uk Tue Nov 1 05:15:00 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Tue, 1 Nov 2011 09:15:00 +0000 Subject: [TYPES/announce] VSTTE 2012 Competition: Final Call for Participation - 1 WEEK TO GO! Message-ID: VSTTE 2012 Verification Competition starts Tuesday 8 November 2011! Follow the announcements at the competition Web page: https://sites.google.com/site/vstte2012/compet Join the discussion group or subscribe to our mailing list: http://groups.google.com/group/vstte-2012-verification-competition vstte-2012-verification-competition+subscribe at googlegroups.com VSTTE 2012 Verification Competition ----------------------------------- A software verification competition is organized on behalf of the VSTTE 2012 conference (https://sites.google.com/site/vstte2012). The purposes of this competition are: to help promote approaches and tools, to provide new verification benchmarks, to stimulate further development of verification techniques, and to have fun. The contest takes place during 48 hours, on 8-10 November 2011, two months prior to the conference. Problems will be put on the website of the conference. Solutions must be sent by email to the competition organizers. Any programming language, specification language, and verification tool is allowed. There will be several independent problems. Each problem is presented as a sequential algorithm, using English or pseudocode, and a list of properties to formally prove about it, also expressed in plain English and standard mathematical notation. Participants have liberty to implement the proposed algorithms in functional, imperative, object-oriented, or any other programming style. Anybody interested can take part in the contest. Team work is allowed, but only teams up to 4 members are eligible for the first prize. Individual participants may belong to several teams. However, the same solution cannot appear in different submissions. The winner is awarded a talk slot at VSTTE 2012, to present any research of his/her choice of interest for the VSTTE community. In particular, a presentation of solutions to the competition problems and/or of the techniques and system used would be appreciated. Tuesday 8 Nov 2011, 15:00 UTC - competition starts Thursday 10 Nov 2011, 15:00 UTC - competition stops Monday 12 Dec 2011 - the winner is notified 28-29 Jan 2012 - results are announced at VSTTE 2012 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Lutz.Schroeder at dfki.de Tue Nov 1 07:42:35 2011 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Tue, 01 Nov 2011 12:42:35 +0100 Subject: [TYPES/announce] Research positions at DFKI SKS, Bremen Message-ID: <4EAFDB2B.1090700@dfki.de> The DFKI research department Safe and Secure Cognitive Systems in Bremen, Germany, currently has several vacancies in projects related to logic, formal methods, and ontologies, see http://www.informatik.uni-bremen.de/dfki-sks/vacancies/37-11_BK.pdf Regards, Lutz Schr?der -- -------------------------------------- Prof. Dr. Lutz Schr?der Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder at dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum f?r K?nstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch?ftsf?hrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From maon at eecs.qmul.ac.uk Tue Nov 1 16:00:55 2011 From: maon at eecs.qmul.ac.uk (Noam Rinetzky) Date: Tue, 1 Nov 2011 20:00:55 +0000 Subject: [TYPES/announce] Call for Participation: APLAS'11 (Asian Symposium on Programming Languages and Systems 2011) + CPP'11 (Certified Programs and Proofs 2011) Message-ID: CALL FOR PARTICIPATION APLAS+CPP Kenting, Taiwan December 4 to 9, 2011 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 an essential paradigm for their work. Certification here means formal, mechanized verification of some sort, preferably with production of independently checkable certificates. CPP targets any research promoting formal development of certified software and proofs. For the first time, APLAS and CPP will be held together in Kenting, Taiwan from December 4 to 9, 2011. The six-day event includes two tutorials, six invited talks, and two conferences. We offer a special rate for participants who register to both conferences. For the detailed program of each conference, please go to their respective web sites: http://flolac.iis.sinica.edu.tw/aplas11/doku.php (APLAS) http://formes.asia/cpp/ (CPP) Early Registration (until November 12, 2011) Regular | Student -----------------------+----------- APLAS+CPP: TWD 24000 | TWD 19500 APLAS only: TWD 16500 | TWD 13500 CPP only: TWD 16500 | TWD 13500 Location The conferences will be held in Kenting, a seaside resort and national park in Southern Taiwan. Temperatures in Kenting averaged at 21.4 C in December 2010 (high: 29.5, low: 14.3). It can be a bit windy, but the weather probably is the best in Taiwan in December. You can find more information about the Kenting National Park at Wikipedia and Wikitravel. The conference venue is Howard Beach Resort Kenting. Keynote Speakers o Andrew Appel (Princeton University) VeriSmall: Verified Smallfoot Shape Analysis o Nikolaj Bjorner (Microsoft Research) Engineering Theories with Z3 o Ranjit Jhala (UC San Diego) Software Verification with Liquid Types o Peter O'Hearn (Queen Mary, University of London) Algebra, Logic, Locality, Concurrency o Sriram Rajamani (Microsoft Research India) Program Analysis and Machine Learning: A Win-Win Deal o Vladimir Voevodsky (Institute for Advanced Study, Princeton) Univalent Semantics of Constructive Type Theories Tutorials o Lei Liu (Chinese Academy of Sciences) Parallelizing Legacy Sequential Code o Shin-Cheng Mu (Academia Sinica) Dependently Typed Programming in Adga Panels o Certificates (moderator: Dale Miller) o Teaching with Proof Assistants (moderator: Tobias Nipkow) List of Accepted Papers APLAS o Thao Dang and Thomas Martin Gawlitza. Time Elapse over Template Polyhedra in Polynomial Time through Max-Strategy Iteration o David Monniaux and Martin Bodin. Modular Abstractions of Reactive Nodes using Disjunctive Invariants o Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gomez-Zamalloa and German Puebla. Cost Analysis of Concurrent OO Programs o Benoit Boissinot, Florian Brandner, Alain Darte, Benoit Dupont De Dinechin and Fabrice Rastello. A Non-Iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs o Dmitriy Traytel, Stefan Berghofer and Tobias Nipkow. Extending Hindley-Milner Type Inference with Coercive Subtyping o Patrick Baillot. Elementary linear logic revisited for polynomial time and an exponential time hierarchy o Zhen Cao, Yuan Dong and Shengyuan Wang. Compiler Backend Generation for Application Specific Instruction Set Processors o Akimasa Morihata. Macro Tree Transformations of Linear Size Increase Achieve Cost-optimal Parallelism o Jade Alglave, Daniel Kroening, John Lugton, Vincent Nimal and Michael Tautschnig. Soundness of Data Flow Analyses for Weak Memory Models o Yulei Sui, Sen Ye, Jingling Xue and Pen-Chung Yew. SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA o Keiko Nakata, Tarmo Uustalu and Marc Bezem. A Proof Pearl with the Fan Theorem and Bar Induction: Walking through Infinite Trees with Mixed Induction and Coinduction o Ulrich Schoepp. Computation-by-Interaction with Effects o Ashutosh Gupta, Corneliu Popeea and Andrey Rybalchenko. Solving Recursion-Free Horn Clauses over LI+UIF o Hakjoo Oh and Kwangkeun Yi. Access-based Localization with Bypassing o Yun-Yan Chi and Shin-Cheng Mu. Constructing List Homomorphisms from Proofs o Jonas Magazinius, Aslan Askarov and Andrei Sabelfeld. Decentralized Delimited Release o Filippo Bonchi, Fabio Gadducci and Giacoma Monreale. Towards A General Theory of Barbs, Contexts and Labels o Lukasz Fronc and Franck Pommereau. Towards a Certified Petri Net Model-Checker o Fernando Saenz-Perez. A Deductive Database with Datalog and SQL Query Languages o Yuichiro Kokaji and Yukiyoshi Kameyama. Polymorphic Multi-Stage Language with Control Effects o Ana Milanova and Wei Huang. Static Object Race Detection o Alexander Malkis and Laurent Mauborgne. On the Strength of Owicki-Gries for Resources o Casey Klein, Jay Mccarthy, Steven Jaconette and Robert Bruce Findler. A Semantics for Context-Sensitive Reduction Semantics CPP o Mathieu Boespflug, Maxime D?n?s and Benjamin Gr?goire. Full reduction at full throttle o Thi Minh Tuyen Nguyen and Claude March?. Hardware-Dependent Proofs of Numerical Programs o Dongchen Jiang and Tobias Nipkow. Proof Pearl: The Marriage Theorem o Jean-David Genevaux, Julien Narboux and Pascal Schreck. Formalization of Wu's simple method in Coq o Thomas Braibant. Coquet: a Coq library for verifying hardware o Martin Henz and Aquinas Hobor. Teaching Logic and Formal Methods with Coq o Christian Doczkal and Gert Smolka. Constructive Formalization of Hybrid Logic with Eventualities o Sorin Stratulat and Vincent Demange. Automated Certification of Implicit Induction Proofs o Michael Armand, Germain Faure, Benjamin Gregoire, Chantal Keller, Laurent Th?ry and Benjamin Werner. A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses o Jinjiang Lei and Zongyan Qiu. Verification of Scalable Synchronous Queue o Thomas Braibant and Damien Pous. Tactics for Reasoning modulo AC in Coq o Tom Ridge. Simple, functional, sound and complete parsing for all context-free grammars o Thierry Coquand and Vincent Siles. A Decision Procedure for Regular Expression Equivalence in Type Theory o Pierre Corbineau, Mathilde Duclos and Yassine Lakhnech. Certified Security Proofs of Cryptographic Protocols in the Computational Model : an Application to Intrusion Resilience o Jieung Kim and Sukyoung Ryu. Coq Mechanization of Featherweight Fortress with Multiple Dispatch and Multiple Inheritance o Xiaomu Shi, Jean-Francois Monin, Fr?d?ric Tuong and Fr?d?ric Blanqui. First Steps Towards the Certification of an ARM Simulator o Sascha B?hme, Anthony Fox, Thomas Sewell and Tjark Weber. Reconstruction of Z3's Bit-Vector Proofs in HOL4 and Isabelle/HOL o Cezary Kaliszyk and Henk Barendregt. Reasoning about Constants in Nominal Isabelle, or how to Formalize the Second Fixed Point Theorem o Fr?d?ric Besson, Pierre-Emmanuel Cornilleau and David Pichardie. Modular SMT Proofs for Fast Reflexive Checking inside Coq o Luis Caires, Frank Pfenning and Bernardo Toninho. Proof-Carrying Code in a Session-Typed Process Calculus o Wolfram Kahl. CalcCheck: A Proof Checker for Gries and Schneider's "Logical Approach to Discrete Math" o James Cheney and Christian Urban. Mechanizing the metatheory of mini-XQuery o Dale Miller. A proposal for broad spectrum proof certificates o Michael Backes, Catalin Hritcu and Thorsten Tarrach. Automatically Verifying Typing Constraints for a Data Processing Language From ss.datics at gmail.com Wed Nov 2 05:28:50 2011 From: ss.datics at gmail.com (SS DATICS) Date: Wed, 2 Nov 2011 17:28:50 +0800 Subject: [TYPES/announce] =?utf-8?q?DATICS-IME=E2=80=8BCS=2712_CFP?= In-Reply-To: References: Message-ID: We apologize for multiple copies DATICS-IMECS'12 CFP =================== Dear Sir/Madam, We welcome you to participate as speakers, attendees, sponsors and exhibitors at the DATICS-IMECS'12 (http://datics.nesea-conference.org/datics-imecs2012). We are looking forward for your participation in DATICS-IMECS'12. Please let us know if you have any questions. Please find below the details about DATICS-IMECS'12. Sincerely, DATICS-IMECS'12 =========================================================== International Workshop: DATICS-IMECS'12 CALL FOR PAPERS http://datics.nesea-conference.org/datics-imecs2012 Email: ss.datics at gmail.com Hong Kong, 14-16 March, 2012 =========================================================== DATICS Workshops were initially created by a network of researchers and engineers both from academia and industry in the areas of Design, Analysis and Tools for Integrated Circuits and Systems. Recently, DATICS has been extended to the fields of Communication, Computer Science, Software Engineering and Information Technology. The main target of DATICS-IMECS'12 is to bring together software/hardware engineering researchers, computer scientists, practitioners and people from industry to exchange theories, ideas, techniques and experiences related to all aspects of DATICS. TOPICS Circuits, Systems and Communications: * Design, Simulation and Test of Digital, Analog, Mixed Mode and RF Circuits and Systems * Processor Design and Embedded Systems * VLSI, ASIC, FPGA, SoC and MPSoC * Computer Aided Design and Electronic Design Automation * Circuits and Systems for Communications * Power Systems and Power Electronic Circuits * Nonlinear Circuits and Systems * Control Theory Topics in Circuits and Systems * Signal Processing * Circuits and Systems for Biomedical Applications * Circuits and Systems for Energy Harvesting * Circuits and Systems for Cryptography * Circuits and Systems for Low Power Applications * Computer Aided Verification * Computer Aided Interconnect Analysis and Optimization * Circuit/Device Modeling and Simulation * Formal Modelling and Analysis of Circuits and Systems * SystemC, SystemVerilog and Transcation Level Modelling * Self-Correcting/Self-Healing Circuits and Systems * Cyber-Physical Systems * Battery Management Systems * Photovoltaic System Design Computer Science, Software Engineering and Information Technology: * Formal Methods, Graph Theory, Process Algebras, Petri-Nets, Automaton Theory, BDDs and UML * Equivalence Checking, Model Checking, SAT-based Methods, Compositional Methods and Probabilistic Methods * Average-Case Analysis and Worst-Case Analysis * Numerical Algorithms * Software Developed to Solve Science * Computational Biology and Bioinformatics * Intelligent Systems * Internet and Web Systems * Real-Time, Hybrid, Embedded and Cyber-Physical Systems * Agent and Autonomous Systems * Scientific Computing and Applications * Computer and Information Science * Computer Networks and Data Communications * Distributed Systems, Grid Computing and Services Computing * Design and Programming Methodologies for Network Protocols and Applications * Wireless Sensor Networks * E-Business Design and Applications * Financial Mathematics * Computer-Aided Design and Manufacturing * Computer Architecture * Computer Control and Robotics * Computer Graphics, Animation, and Virtual Reality * Computers in Education and Learning Technologies * Computer Modeling and Simulations * Computer Security and Privacy * Computer Vision and Pattern Recognition IMPORTANT DATES Deadline for full paper submission: 8 December 2011 Notification of acceptance: TBD Deadline for authors' registration: 10 January 2012 Deadline for final manuscript submission: 10 January 2012 Conference Dates: 14-16 March 2012 Paper submission, proceedings, indexing and journal publication information can be found at http://datics.nesea-conference.org/datics-imecs2012 From Simon.Gay at glasgow.ac.uk Thu Nov 3 08:10:41 2011 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Thu, 3 Nov 2011 12:10:41 +0000 Subject: [TYPES/announce] PLACES 2012: 2nd Call For Papers Message-ID: <4EB284C1.5050509@glasgow.ac.uk> 2nd CALL FOR PAPERS 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/ 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, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Invited Speaker ** Benedict Gaster, AMD ** Submission Guidelines ** Authors should submit a title and a 200 word abstract by Wednesday 14th December 2011, to help the PC chairs assign reviewers to papers. Papers of up to five pages in length should be submitted in PDF format by Wednesday 21st December 2011 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=places2012 Preliminary proceedings will be available at the workshop. We intend to publish a post-proceedings in EPTCS. The submission deadline is strict and will not be extended. Enquiries can be sent to the PC co-chairs. ** Important Dates ** Abstract (title & 200 words max): 14th December 2011 Paper Submission: 23:59 (GMT) 21st December 2011 Paper Notification: 23rd January 2012 Final versions of papers: 3rd February 2012 ** 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 rseba at disi.unitn.it Fri Nov 4 04:48:41 2011 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Fri, 4 Nov 2011 09:48:41 +0100 Subject: [TYPES/announce] SAT 2012: Call for Papers Message-ID: <20111104084841.GA25439@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'12: * 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. 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 four (4) 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'12 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 Conference: 17-20/06/2012 PROCEEDINGS =========== The proceedings of SAT?12 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 -- LIF Marseille, France} Leonardo DeMoura -- Microsoft Research, USA John Franco -- University of Cincinnati, USA Malay Ganai -- NEC, USA Enrico Giunchiglia -- Universit? di Genova, Italy Yussef 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 -- University of Wales Swansea, 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 c.grelck at uva.nl Fri Nov 4 05:44:10 2011 From: c.grelck at uva.nl (Clemens Grelck) Date: Fri, 04 Nov 2011 10:44:10 +0100 Subject: [TYPES/announce] CFP: FD-COMA 2012: Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures Message-ID: <4EB3B3EA.2030109@uva.nl> Extended deadline: Nov 11, 2011 !! Call for Papers: FD-COMA 2012 Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures 7th HiPEAC Conference Paris, France, Jan 23-25, 2012 http://www.project-advance.eu/2011/10/fd-coma-workshop-2012/ http://www.hipeac.org/conference FD-COMA is a one-day workshop during the 7th HiPEAC Conference in Paris, January 23-25, 2012. The workshop is loosely connected to the FP-7 project Advance, but we particularly welcome contributions from outside the project consortium. Scope: Feedback driven optimizations have long proven to be powerful instruments for achieving better hardware utilization, but the on-going multi-core/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 + Compiler representations for feedback information + Performance modeling for feedback, including statistical and constraint-based techniques + Performance measurement using feedback information + Exploiting feedback for heterogeneous multi-core systems + 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. Submit a PDF copy of your manuscript via EasyChair (not yet open). 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 at the workshop in electronic form. Important dates: Submission deadline: 11/11/2011 Notification of acceptance: 22/11/2011 Final version due: 13/1/2012 Workshop organizers: Kevin Hammond, University of St Andrews, United Kingdom Clemens Grelck, University of Amsterdam, Netherlands Sven-Bodo Scholz, Heriott-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 vladimir at ias.edu Sun Nov 6 12:01:43 2011 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Sun, 6 Nov 2011 12:01:43 -0500 Subject: [TYPES/announce] an update to Foundations Message-ID: <138B100D-C8BA-4870-926A-6F2B8D994337@ias.edu> Hello, I have posted an update to Foundations library at https://github.com/vladimirias . There is now basic rational arithmetic defined using set quotients of types as well as an extended version of the abstract algebra files, including many results on relations and some results on integral domains and ( geometric ) fields. Vladimir. From lbauer at cmu.edu Mon Nov 7 10:06:37 2011 From: lbauer at cmu.edu (Lujo Bauer) Date: Mon, 7 Nov 2011 10:06:37 -0500 Subject: [TYPES/announce] Call for Papers--17th ACM SACMAT 2012 In-Reply-To: References: 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 have received this more than once) ========================================================= 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 13, 2012 - Paper submission due: January 20, 2012 - Demo proposal submission due: January 20, 2012 - Panel proposal submission due: January 20, 2012 - Notification to authors: March 2, 2012 - Camera-ready submission due: March 23, 2012 -- Lujo Bauer Assistant Research Professor, CyLab and ECE Carnegie Mellon University http://www.ece.cmu.edu/~lbauer -- Lujo Bauer Assistant Research Professor, CyLab and ECE Carnegie Mellon University http://www.ece.cmu.edu/~lbauer From pedro.adao at ist.utl.pt Mon Nov 7 18:38:00 2011 From: pedro.adao at ist.utl.pt (=?iso-8859-1?Q?Pedro_Ad=E3o?=) Date: Mon, 7 Nov 2011 23:38:00 +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 18/Nov/2011) and - one PhD position (deadline 23/Nov/2011) 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 January 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 Tue Nov 8 07:01:25 2011 From: Andrew.Pitts at cl.cam.ac.uk (Andrew Pitts) Date: Tue, 8 Nov 2011 12:01:25 +0000 Subject: [TYPES/announce] ICALP 2012 First Call for Papers Message-ID: ==================================ICALP 2012 - First Call for Papers================================== The 39th International Colloquium on Automata, Languages andProgramming (ICALP 2012), the main conference and annual meeting ofthe 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 Celebrationevents, celebrating the Life and Work, and Legacy of Alan Turing. Themain conference will be preceded by a series of workshops. URL: http://www2.warwick.ac.uk/go/icalp2012 Topics------Papers presenting original research on all aspects of theoreticalcomputer science are sought. Typical but not exclusive topics ofinterest are: Track A: Algorithms, Complexity and Games Algorithmic Game Theory, Approximation Algorithms, CombinatorialOptimization, Combinatorics in Computer Science, ComputationalBiology, 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 ofProgramming Languages, Logics, Formal Methods and Model Checking,Models of Concurrent, Distributed, and Mobile Systems, Models ofReactive, Hybrid and Stochastic Systems, Program Analysis andTransformation, Specification, Refinement and Verification, TypeSystems 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; InternetAlgorithms; Mobile and Complex Networks; Natural and PhysicalAlgorithms; Network Information Management; Sensor, Mesh, and Ad HocNetworks; Social Networks, Viral Marketing; Specification, Semantics,Synchronization; Trust and Reputation; Web Mining and Analysis; WebSearching 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---------------------URL: http://www2.warwick.ac.uk/go/icalp2012/cfp/ Best Paper Awards-----------------As in previous editions of ICALP, there will be best paper and beststudent paper awards for each track of the conference. In order to beeligible for a best student paper award, a paper should be authoredonly 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: ********************************************************** From james.cheney at gmail.com Tue Nov 8 17:05:58 2011 From: james.cheney at gmail.com (James Cheney) Date: Tue, 8 Nov 2011 22:05:58 +0000 Subject: [TYPES/announce] PODS 2012: Second call for papers Message-ID: [PODS is the leading database theory conference. This year PODS explicitly solicits work "emerging database environments and applications", including topics involving types, programming languages, and web or database programming. --James] CALL FOR PAPERS 31st ACM SIGMOD-SIGACT-SIGART Symposium on PRINCIPLES OF DATABASE SYSTEMS (PODS 2012) May 21-May 23 2012, Scottsdale, Arizona, USA Submission is now open at: http://www.easychair.org/conferences/?conf=pods2012 The PODS symposium series, held in conjunction with the SIGMOD conference series, provides a premier annual forum for the communication of new advances in the theoretical foundations of database systems. For the 31st edition, original research papers providing new insights in the specification, design, or implementation of data-management tools are called for. Topics of Interest Topics that fit the interests of the symposium include the following (as they pertain to databases): -- languages for semi-structured data; search query languages; -- distributed and parallel aspects of databases; -- dynamic aspects of databases; -- incompleteness, inconsistency, and uncertainty in databases; -- schema and query extraction; data integration; data exchange; -- provenance; workflows; metadata management; meta-querying; -- data mining and machine learning techniques for databases; -- constraints; privacy and security; Web services; -- automatic verification of database-driven systems; -- model theory, logics, algebras and computational complexity; -- data modeling; data structures and algorithms for data management; -- design, semantics, and optimization of query and database languages; -- domain-specific databases (multi-media, scientific, spatial, temporal, text). In addition, we especially welcome papers addressing *emerging database environments and applications*. An External Review Committee will assist the Core PC (listed further below) in reviewing papers in the following multi-disciplinary areas of particular interest to this edition of PODS. -- Querying and Mining of Unstructured Data: Anhai Doan (Kosmix & U. Wisconsin), Aristides Gionis (Yahoo! Labs), Djoerd Hiemstra (Twente), Stefano Leonardi (University of Rome La Sapienza), Evimaria Terzi (Boston University) -- Web Services, Web Programming and Data-Centric Workflow: Wil van der Aalst (Eindhoven), Anders M?ller (Aarhus), Farouk Toumani (ISIMA), David Walker (Princeton), Karsten Wolf (Rostock) -- Learning of Data Models and Queries: Deepak Agarwal (Yahoo! Labs), James Cussens (York U.), Amol Deshpande (U. Maryland), Kristian Kersting (Fraunhofer Institute IAIS, U. Bonn) -- Cloud Computing and Next-generation Distributed Query Processing: Shivnath Babu (Duke), Phillip Gibbons (Intel Labs), Monica Lam (Stanford), Boon Thau Loo (U. Penn), Volker Markl (TU Berlin) -- Semantic, Linked, Networked, and Crowdsourced Data: Panos Ipeirotis (NYU), David Karger (MIT), Carsten Lutz (Bremen), Boris Motik (Oxford) Important Dates: Abstract submission: 20 November 2011 Manuscript submission: 27 November 2011 Notification: 15 February 2012 Submission Guidelines Submitted papers should be at most twelve pages, including bibliography, using reasonable page layout and font size of at least 9pt (note that the SIGMOD style file does not have to be followed). Additional details may be included in an appendix, which, however, will be read at the discretion of the PC. Papers longer than twelve pages (excluding the appendix) or in font size smaller than 9pt risk rejection without consideration of their merits. The submission process will be through the website. Note that, unlike the SIGMOD conference, PODS does not use double-blind reviewing, and therefore PODS submissions should be eponymous (i.e., the names and affiliations of authors should be listed on the paper). The results must be unpublished and not submitted elsewhere, including the formal proceedings of other symposia or workshops. Authors of an accepted paper will be expected to sign copyright release forms, and one author is expected to present it at the conference. Best Paper Award: An award will be given to the best submission, as judged by the PC. Best Student Paper Award: There will also be an award for the best submission, as judged by the PC, written exclusively by a student or students. An author is considered as a student if at the time of submission, the author is enrolled in a program at a university or institution leading to a doctoral/master's/bachelor's degree. Organization: PODS General Chair: Maurizio Lenzereni (University of Rome La Sapienza) PODS Program Chair: Michael Benedikt (Oxford) Publicity & Proceedings Chair: Markus Kroetzsch (Oxford) Core Program Committee: Mikhail Atallah (Purdue) Toon Calders (Eindhoven) Diego Calvanese (Free U. Bolzano) James Cheney (Edinburgh) Graham Cormode (AT&T Labs) Alin Deutsch (UC San Diego) Gianluigi Greco (Calabria) T.J. Green (UC Davis) Martin Grohe (HU Berlin) Marc Gyssens (Hasselt) T.S. Jayram (IBM Almaden & IBM India) Daniel Kifer (Penn State) Phokion Kolaitis (UC Santa Cruz & IBM Almaden) Rasmus Pagh (Copenhagen) Luc Segoufin (INRIA Cachan) Pierre Senellart (Telecom ParisTech) Sophie Tison (Lille) Victor Vianu (UC San Diego) David Woodruff (IBM Almaden) SIGMOD/PODS Webpage: http://www.sigmod.org/2012/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From dpw at cs.princeton.edu Tue Nov 8 17:10:52 2011 From: dpw at cs.princeton.edu (David Walker) Date: Tue, 08 Nov 2011 17:10:52 -0500 (EST) Subject: [TYPES/announce] Underrepresented Problems for Programming Language Researchers, Final Call for Submissions In-Reply-To: <3c4e9eca-8ee4-49cb-b6d7-aba051f7e7d8@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <7dc4da67-7855-43c4-9bfb-08f43cd96c2c@suckerpunch-mbx-0.CS.Princeton.EDU> Off The Beaten Track (OBT): Underrepresented Problems for Programming Language Researchers Co-Located with POPL 2012 Philadelphia, USA http://www.cs.princeton.edu/~dpw/obt January 28th, 2012 Submissions Due: Monday November 14, 2011 ***IN A NUTSHELL*** Submitting to OBT is easy. Send us a 1-page PDF outlining an interesting, unusual, or controversial off-the-beaten-track problem or idea. We will make room for as many creative 5-minute talks as we can, interleaved with lively discussion. Alternatively, send us a 2-page PDF to apply for a longer talk. The deadline is in a few days: Monday November 14. See the webpage for details: http://www.cs.princeton.edu/~dpw/obt In addition, we are lucky enough to have invited speaker Sep Kamvar talking on Programming Languages for Social Computation. His abstract is here: http://www.cs.princeton.edu/~dpw/obt/obt_abstracts.html ***MORE DETAIL*** 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 the goal for Off the Beaten Track. 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. 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. Workshop Structure The one-day workshop will be structured to include the following activities: * Short submitted talks, ~5 minutes long, interleaved with 5-15 minutes of discussion * Longer submitted talks, ~15-30 minutes long, interleaved with discussion * Longer invited talks * A panel The exact structure and length of talks will be decided on by the program chair in consultation with the program committee. For more details on submission requirements, see Important dates Paper submission Monday November 14, 2011 (11:59PM US EST) Author notification Friday December 9, 2011 Conference Saturday January 28, 2012 Program Committee Thomas Ball (Microsoft Research, Redmond) Trevor Jim (AT&T) Julia Lawall (DIKU) Boon Thau Loo (University of Pennsylvania) Geoff Mainland (Microsoft Research, Cambridge) Chung-chieh Shan (Cornell) David Walker (Princeton University, Chair) From sweirich at cis.upenn.edu Tue Nov 8 20:29:18 2011 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Tue, 8 Nov 2011 20:29:18 -0500 Subject: [TYPES/announce] CRA-W/CDC Programming Languages Mentoring Workshop Message-ID: <7930EB1A-A35F-4A68-8590-A7F9DB56CD53@cis.upenn.edu> CALL FOR PARTICIPATION CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop Philadelphia, PA (co-located with POPL 2012) Tuesday January 24, 2012 http://www.seas.upenn.edu/~sweirich/plmw12/ We are pleased to invite students interested in programming languages research to the first PL mentoring workshop. The goal of this workshop is to introduce senior undergraduate and early graduate students to research topics in programming language theory as well as provide career mentoring advice to help them get through graduate school, land a great job, and succeed. We have recruited leaders from the programming language community to provide overviews of current research topics, and have organized panels of speakers to give students valuable advice about how to thrive in graduate school, search for a job, and cultivate habits and skills that will help them in research careers. 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 and we hope that participants will stay through the entire conference. Through the generous donation of our sponsors, we are able to provide travel scholarships to fund student participation. These travel scholarships will cover reasonable travel expenses (airfare, hotel and registration fees) for attendance at both the workshop and the POPL conference. Anyone may apply for a travel scholarship, but first priority will be given to women and under-represented minority applicants. The workshop registration is open to all. Students with alternative sources of funding for their travel and registration fees are welcome. APPLICATION for TRAVEL SUPPORT: The travel funding application can be accessed from the workshop web site. The deadline for full consideration of funding is December 2, 2011. Selected participants will be notified starting December 9th and will need to register for the workshop by December 24th. ORGANIZERS: Stephanie Weirich, Kathleen Fisher and Ron Garcia SPONSORS: The Computing Research Association's Committee on the Status of Women (CRA-W), the Coalition to Diversify Computing (CDC), and the ACM Special Interest Group on Programming Languages (SIGPLAN). From sakai at is.nagoya-u.ac.jp Wed Nov 9 19:28:45 2011 From: sakai at is.nagoya-u.ac.jp (Masahiko Sakai) Date: Thu, 10 Nov 2011 09:28:45 +0900 Subject: [TYPES/announce] Tenure-track position at Nagoya University Message-ID: <20111110092845.4414c86d.sakai@is.nagoya-u.ac.jp> Call for Applications Dear All, Application deadline for the position at associate professor level in the field of foundation of software science (in particular, rewriting computation and its application) has been extended. New deadline is November 15, 2011 (JST). The position is one of the three positions for which Young Leaders Cultivation Tenure-track Program (YLC-t) of Nagoya University has invited applications. Please refer the following web page for details and for application instructions. //http://www.iar.nagoya-u.ac.jp/ylc-t/ The program welcomes applications from promising young researchers. Dr. Toshiki Sakabe Professor Graduate School of Information Science Nagoya University EMAIL sakabe at is.nagoya-u.ac.jp From tobias.wrigstad at it.uu.se Thu Nov 10 09:02:33 2011 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Thu, 10 Nov 2011 15:02:33 +0100 Subject: [TYPES/announce] Three PhD Positions in Computer Science at Uppsala University Message-ID: <609F3E7D-1B8C-4A31-AA32-24BD1DDA160C@it.uu.se> Three Open PhD Positions in Computer Science at Uppsala University within the UPMARC Center of Excellence. Especially the first position, Programming Languages for Parallel Programming, should be of interest to this list. --Tobias Software Technology for Parallel Programming on Multicore Computer Deadline for applications: Dec. 1 More details below. The Department of Information Technology at Uppsala University, Sweden, is offering three PhD positions in Software Technology for Parallel programming on multicore computer systems, placed within the UPMARC Center of Excellence. UPMARC has been formed to make a broad coordinated attack on the challenges of developing methods and tools to support software development for multicore computer systems, and brings together research groups in complementary areas of computer science: computer architecture, computer networks, parallel scientific computing, programming language technology, real-time and embedded systems, program verification and testing, and modeling of concurrent computation. UPMARC has been awarded a ten year "center of excellence" grant from the Swedish Research Council, as a sign of scientific excellence. The three Ph.D. positions are placed in the below three projects. The positions are fully funded and open to international students. 1. Programming Languages for Parallel Programming ================================================= Multicore processors are bringing parallelism into mainstream computing. As a consequence, programming languages must evolve to simplify and support parallel programming from the ground-up without abandoning the millions of lines of code in the wild using shared memory, threads and locks. The holder of the position will be involved with design and implementation of programming language constructs and tools for a simple, efficient, and safety-focused parallel programming language based on active objects. For further description of the project, see http://upmarc.se/research/pl/facile. Contact: tobias.wrigstad at it.uu.se Link to information and submission instructions: http://www2.personalavd.uu.se/ledigaplatser/2782PhD.html 2. Task-based Programming Systems ================================= Task-based programming provides a layer of abstraction that makes it easier for both programmers and runtime systems to reason about parallelism and performance in heterogeneous parallel systems. Yet to get the most from modern hardware, tasks must be tuned for the processor and memory system, and scheduled to minimize resource contention. This requires an intelligent runtime system that can understand task properties, reason about system performance and resources, and provide feedback to the application about the kind of tasks to create. The holder of the position will be developing methods for improving performance and energy efficiency of task-based programs on homogeneous and heterogeneous systems. This will encompass analyzing task behavior across emerging application domains, developing techniques for feeding back runtime performance information to tune task creation, and using advanced profile information to optimize scheduling for performance and efficiency. The research will include both modeling and implementation, and will leverage the advanced analysis and modeling tools developed by the computer architecture group. Contact: david.black-schaffer at it.uu.se Link to information and submission instructions: http://www2.personalavd.uu.se/ledigaplatser/2783PhD.html 3. Parallelism in event-based models for stochastic chemical kinetics ===================================================================== Inside living cells, biochemical processes are often described with inherent randomness in order to account for a noisy microscopic environment. A common approach for simulating such models is to perform updates to some state-variable whenever certain events happen. These typically include reaction events and molecular movements. The holder of the position will be involved with advancing methods for efficient simulation of event-based models on modern multicore architectures. This includes, but are not limited to, aspects of high-performance computing, a certain amount of software flexibility, and numerically approximate algorithms. The research will initially be centered around the numerical software "URDME" (see http://www.urdme.org), freely available under the GPL-license. This software simulates a quite general event-based stochastic model such that the results are of general interest in computational physics. Contact: stefan.engblom at it.uu.se Link to information and submission instructions: http://www2.personalavd.uu.se/ledigaplatser/2786PhD.html ABOUT PH.D. POSITIONS, APPLICATIONS, AND THE DEPARTMENT. A PhD position requires a Master of Science in Computer Science, Computer Engineering, or equivalent in a field which is relevant for the topic of the PhD thesis. The position is for a maximum of five years and includes departmental duties at a level of at most 20% (typically teaching). The salary amounts currently to about 23.000 SEK per month in the first year. Applications should include a description of research interests and past experience, a CV, copies of exams, degrees and grades, a copy of Master thesis (or a draft thereof), relevant publications, and other relevant documents. Candidates are encouraged to provide letter(s) of recommendation and contact information to reference persons, and further to indicate their preferred research project(s), as well as earliest feasible starting date of employment. (See the submission website for instructions.) Uppsala University 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 is free after a small fee in connection with the first visit to a doctor. The parental benefits in Sweden are very generous, e.g., you can take 13 months of parental leave and extend the length of your Ph.D. studies correspondingly. Childcare is of high quality and very affordable. For more information, see http://www.it.uu.se/research/upmarc (UPMARC), http://www.it.uu.se/ (the department) or contact: Prof. Bengt Jonsson, bengt.jonsson at it.uu.se, or some other member of the UPMARC consortium (see upmarc.se). Union representatives are: Anders Grundstr?m, SACO-r?det, tel +46 18-471 5380, Carin S?derh?ll, OFR-S/ST, tel +46 18-471 1996, Stefan Djurstr?m, SEKO, tel +46 18-471 3315. Information on how to apply for each of the three positions is accessible by clicking these links: * http://www2.personalavd.uu.se/ledigaplatser/2782PhD.html * http://www2.personalavd.uu.se/ledigaplatser/2783PhD.html * http://www2.personalavd.uu.se/ledigaplatser/2786PhD.html ------------------------------------------------------------ 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 alastair.donaldson at imperial.ac.uk Fri Nov 11 06:45:18 2011 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Fri, 11 Nov 2011 11:45:18 +0000 Subject: [TYPES/announce] Research Assistant/Associate position in Verification and Language Support for GPU Programming at Imperial College London Message-ID: <4EBD0ACE.4000909@imperial.ac.uk> Dear all I am looking to recruit a post-doc (or potentially someone who is very close to completing their PhD) to join my new Multicore Programming Group at Imperial College London, to take up a three year RA post investigating verification techniques and programming language support for GPU programming. The post would be especially suitable for someone with a strong background in either verification or programming languages, including a good grasp of theory, but crucially a keen practical interest in designing efficient verification/program analysis tools. The position is funded by the European Union project CARP (Correct and Efficient Accelerator Programming). The purpose of the project is to design programming languages, optimising compilers and formal verification techniques to allow dramatic improvements in the design of software for accelerator processors, particularly GPUs. Imperial College are leading the CARP project, which is in collaboration with seven other outstanding European universities and companies. http://www3.imperial.ac.uk/computing/vacancies#1 If this is of interest then please feel free to contact me informally to discuss further. I'd be very grateful if you might pass this on to others who may interested in the post. The closing date is 12 December. Best wishes Ally Donaldson From dallago at cs.unibo.it Fri Nov 11 09:23:39 2011 From: dallago at cs.unibo.it (Ugo Dal Lago) Date: Fri, 11 Nov 2011 15:23:39 +0100 Subject: [TYPES/announce] DICE 2012 - Second Call for Papers Message-ID: <4EBD2FEB.9020800@cs.unibo.it> (Our apologies for multiple copies) =============================================================== SECOND CALL FOR PAPERS 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). _______________________________________________________________ INVITED SPEAKERS ? Yuri Gurevich (Microsoft Research and University of Michigan) ? Ulrich Schoepp (LMU Munich) _______________________________________________________________ SUBMISSION The following deadlines are strict: ? Paper Submission (full papers): December 23rd, 2011; ? Notification (full papers): January 20th, 2012; ? Final Version (full papers): February 5th, 2012; ? Submission (extended abstracts): February 18th, 2012; ? Notification (extended abstracts): February 28th, 2012. There will be two categories of submissions: ? Full papers, of up to 15 pages; ? Extended abstracts for short presentations (not included in the proceedings), of up to 3 pages. Authors must indicate if their submission belongs to the second category (by adding ?(Extended Abstract)? in the title). Papers must be submitted electronically, as pdf files, at the following page: https://www.easychair.org/conferences/?conf=dice2012. Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). Submissions of papers authored by PC members are allowed and encouraged. Proceedings will be published in EPTCS. _______________________________________________________________ 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 Alex.Simpson at ed.ac.uk Fri Nov 11 10:20:07 2011 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Fri, 11 Nov 2011 15:20:07 +0000 Subject: [TYPES/announce] 5th Scottish Category Theory Seminar: Programme Message-ID: <20111111152007.72644py7v4avt3c4@www.staffmail.ed.ac.uk> This meeting may be of interest to some readers of the types list. SCOTTISH CATEGORY THEORY SEMINAR http://personal.cis.strath.ac.uk/~ng/sct.html *** Fifth Meeting *** *** Informatics Forum, University of Edinburgh *** *** Friday 25 November 2011, 2.00-5.40pm *** The programme for the fifth Scottish Category Theory Seminar has now been finalized. * Invited talk: Anders Kock (Aarhus University) "Introduction to Synthetic Differential Geometry, and some arithmetic with nilpotents" * Invited talk: Paul-Andre Mellies (CNRS, Paris 7) "Braided notions of dialogue categories" * Tom Leinster (University of Glasgow) "Measuring an enriched category" * Invited talk: Anders Kock (Aarhus University) "Commutative monads, and distributions (in a broad sense)" The meeting is open to all. There is no registration, but, if you intend to come please let us know by email: scotcats at cis.strath.ac.uk For more information, see webpage. This meeting is generously supported by the Glasgow Mathematical Journal Trust. Alex Simpson (local organizer) (ScotCats organizers: Neil Ghani, Tom Leinster, AS) -- 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 erwig at eecs.oregonstate.edu Fri Nov 11 14:36:09 2011 From: erwig at eecs.oregonstate.edu (Martin Erwig) Date: Fri, 11 Nov 2011 11:36:09 -0800 Subject: [TYPES/announce] 4 faculty positions at Oregon State University Message-ID: The School of EECS at Oregon State University has four openings for tenure track faculty. Researchers from the programming language community are specifically encouraged to apply. --- Assistant/Associate/Full Professor tenure-track position in Computer Science The School of Electrical Engineering and Computer Science at Oregon State University invites applications for up to four tenure-track positions in Computer Science. We seek strong candidates with a commitment to quality teaching and with research strengths in the areas of programming languages, algorithms with a focus on optimization or probabilistic reasoning, systems-focused HCI, databases with a focus on very large data systems (excluding data mining), and computer security and privacy. Exceptionally strong candidates in other areas of computer science will also be considered. Applicants should demonstrate a strong commitment to collaboration with other research groups in the School of EECS, with other departments at Oregon State, and with other universities. The School of EECS supports a culture of energetic collaboration, and the faculty are committed to excellence in both education and research. With 40 tenure/tenure-track faculty, we enroll 185 Ph.D., 125 MS and 1200 undergraduate students. OSU is recognized for its "very high research activity" by the Carnegie Foundation for the Advancement of Teaching. The School of EECS is housed in the Kelley Engineering Center, a green building designed to support collaboration among faculty and students across campus. Corvallis is a college town renowned for its high quality of life. For Full Consideration Date: 02-16-2012 Closing Date: 06-30-2012 jobs.oregonstate.edu/applicants/Central?quickFind=59535 From Andrew.Pitts at cl.cam.ac.uk Mon Nov 14 04:16:20 2011 From: Andrew.Pitts at cl.cam.ac.uk (Andrew Pitts) Date: Mon, 14 Nov 2011 09:16:20 +0000 Subject: [TYPES/announce] ICALP 2012 Call for Workshop Proposals Message-ID: ======================================ICALP 2012 Call for Workshop Proposals====================================== ICALP 2012?39th International Colloquium on Automata, Languages and Programming 9-13 July 2012, University of Warwick, UKSupported by the European Association for Theoretical Computer Science (EATCS) http://www.warwick.ac.uk/go/icalp2012/ The 39th International Colloquium on Automata, Languages andProgramming (ICALP 2012), the main conference and annual meeting ofthe European Association for Theoretical Computer Science (EATCS),will take place on 9-13 July 2012 at the University of Warwick, UK. The main conference will be preceded by a series of Workshops, takingplace on Sunday 8 July 2012 (i.e., one day before ICALP). Workshop proposals are invited for workshops on topics related to allaspects of theoretical computer science. (A workshop may relate to anyof the three tracks of ICALP, but workshop proposals related to otheraspects of theoretical computer science will be considered as well.) ?Typically, ICALP workshops feature a number of invited speakers and anumber of contributed presentations. ICALP workshops do notnecessarily produce formal proceedings. However, in the past there have been, e.g., LNCS proceedings or special issues of journals basedin part on some ICALP workshops. Workshop proposals should be nolonger than two pages and should include: * Title of the workshop * Person responsible for the workshop (name + email address) * A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the ICALP community. * A discussion of the proposed format and agenda * The proposed duration (how many hours of program) * Procedures for selecting participants and papers * Expected number of participants * If the workshop has taken place before, please provide the following information: - How often the workshop has taken place so far- Which conference(s) the workshop has been collocated with so far- The web address of the last workshop, if available- How many participants took part in the last workshop * Potential invited speakers * Plans for dissemination (for example, journal special issues) Proposals are due on 18 December 2011, and should be submitted by email?to the Conference Chair at . Notifications will be sent by 31 December 2011. Further information:------------------- In accordance with the EATCS policies, any workshop collocated withICALP is expected to be financially independent. However, theregistration fee should be as low as possible. We provide the following aspects of the workshop organisation:- registration- wireless network, conference rooms, etc. (as for ICALP) - a link to the web page of the workshop- on request: organization of coffee breaks- on request: organization of lunches- on request: organization of workshop dinner- hotel reservation We do NOT provide:- management of any scientific aspects of the workshop program?? (the workshop organizers are responsible for call for papers, call? for participation, notification, program, workshop webpage,? publication of workshop proceedings or journal special issues, etc.)?- publicity for the workshop ICALP 2012 is organised by the Centre for Discrete Mathematics and its Applications (DIMAP) and the Department of Computer Scienceat the University of Warwick.Contact: From mfd at kth.se Tue Nov 15 03:12:25 2011 From: mfd at kth.se (Mads Dam) Date: Tue, 15 Nov 2011 09:12:25 +0100 Subject: [TYPES/announce] Postdoc and PhD student positions at KTH Royal Institute of Computer Science, Stockholm Message-ID: <4EC21EE9.40709@kth.se> The Theoretical Computer Science group at KTH Royal Institute of Technology, Stockholm, Sweden, invites applications for the following positions: - 1 postdoc in Provably Secure Virtualization for Embedded Systems - 1 postdoc in Practical Secure Multi-Party Computation, - 1 PhD student in Hypervisor Based Security About the positions and the application procedure: www.kth.se/csc/om/lediga/lediga-tjanster-1.14957?l=en_UK About the TCS group: www.csc.kth.se/tcs Application deadline for all three positions is Dec 12 2011 Enquiries to Prof. Mads Dam, mfd at kth.se From J.T.Jeuring at uu.nl Tue Nov 15 06:24:52 2011 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Tue, 15 Nov 2011 12:24:52 +0100 Subject: [TYPES/announce] First call for papers CICM 2012 - Conference on Intelligent Computer Mathematics Message-ID: <8E7B2E7A-026D-435E-892F-ED967A9EADFC@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. ---------------------------------------------------------------- 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])? *** 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 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 m.huisman at utwente.nl Tue Nov 15 11:09:38 2011 From: m.huisman at utwente.nl (Marieke Huisman) Date: Tue, 15 Nov 2011 17:09:38 +0100 Subject: [TYPES/announce] 2nd CfP: Bytecode 2012 Message-ID: <4EC28EC2.1090003@utwente.nl> CALL FOR PAPERS 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/ NEWS ==== * Science of Computer Programming has agreed to publish a special issue on Bytecode 2012 * Invited speakers: - James Hunt, aicas, Germany (see http://www.aicas.com/), on real-time Java - Diego Garbervetsky, University of Buenos Aires, Argentina (see http://lafhis.dc.uba.ar/~diegog/), on quantitative analysis of bytecode 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 =============== Paper submission: January 4, 2012 Notification: January 26, 2012 Final version: February 6, 2012 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 http://www.easychair.org/conferences/?conf=bytecode2012. 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 igarashi at kuis.kyoto-u.ac.jp Tue Nov 15 21:46:43 2011 From: igarashi at kuis.kyoto-u.ac.jp (Atsushi Igarashi) Date: Wed, 16 Nov 2011 11:46:43 +0900 Subject: [TYPES/announce] Postdoc positions in the "Modularity for Supercomputing" Project Message-ID: New postdoc positions are available for the 5-year JST/CREST project Software development for post petascale supercomputing --- Modularity for supercomputing --- (see the project description below for more details), conducted jointly at the University of Tokyo, Kyushu University, and Kyoto University. The appointment can start as early as in April 2012 (the starting date is negotiable). The contract of appointment will be renewed for each academic year, and can be extended up to March 2017, subject to performance. Salary will be about 4,000,000 upto 5,000,000 JPY (Japanese yen) per year. Applicants should have a PhD in computer science, software engineering, or related fields, and have a strong background in at least one (preferably two or more) of the following topics: programming languages, software engineering, high-performance computing, and theoretical computer science. Interested candidates are invited to send a detailed CV via email to Shigeru Chiba (chiba at is.titech.ac.jp), no later than December 15, 2011. As mentioned above, the whole project consists of four research groups distributed over Japan; we will decide which group he or she will belong to, according the applicant's expertise and preference. -------------------- Project Description -------------------- Project Title: Software development for post petascale supercomputing --- Modularity for supercomputing --- Project Home Page: http://modularity.jp/ Principal Investigator: Shigeru Chiba Collaborators: Hidehiko Masuhara, Naoyasu Ubayashi, Atsushi Igarashi Project Term: October 2011 - March 2017 Appointment: 1 year, can be extended according to performance Software development for supercomputing (SC) is extremely hard, mainly because application programmers require deep knowledge about the architecture, operating system, and middleware of the supercomputer, not to mention the application domain. The goal of our project is to address the difficulties by applying language-based technologies---more specifically, technology based on product line architectures---to software development for supercomputing. Towards our goal, we study programming languages and software development environments in which each individual developer or researcher can easily build their own product lines for their favorite supercomputing applications. Our main research topics are as follows: Chiba's group: Design and implementation of a new programming language that provides functionality for advanced modularity and frameworks in high-performance computing. In particular, with minimal execution overheads and static typing. Masuhara's group: Design and implementation of domain-specific languages (DSLs) for prototyping highly-parallel scientific applications and for experimenting optimization techniques. Particular goals are: (1) DSLs embedded into dynamic programming languages such as Ruby and executable highly-parallel architectures such as GPGPU, and (2) design and implementation of the DSLs' framework to support modular optimization techniques. Ubayashi's group: Domain-specific language (DSL) construction methods based on product-line architecture. We plan to develop a DSL for open source repository mining, one of the important research fields requiring high performance computing. Igarashi's group: Type systems for efficiently checking safety of highly modularized software components, supported by the language devoloped by Chiba's group. Customizable type systems for domain-specific languages. From james at cs.ioc.ee Wed Nov 16 04:17:39 2011 From: james at cs.ioc.ee (James Chapman) Date: Wed, 16 Nov 2011 11:17:39 +0200 Subject: [TYPES/announce] MSFP 2012: Second Call for Papers Message-ID: <9C5E2DFE-FEA0-4DAC-BA07-F5E767E7B4E1@cs.ioc.ee> Dear all, The deadline for MSFP 2012 is exactly a month away! Since sending out the first call we have solicited invited talks from two very interesting speakers! See below. James 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. Important Dates: ================ Submission of papers: 16 December 2011 Notification: 20 January 2012 Final versions due: 3 Feburary 2012 Workshop: 25 March 2012 Invited Speakers: ================= Danko Ilik, Goce Del?ev University of ?tip, Republic of Macedonia Neil Ghani, University of Strathclyde, UK Submission: =========== Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). After the workshop, there might be an opportunity to publish selected papers in a journal special issue. All submissions must be in PDF format and use the EPTCS style files. Submissions can be made through the EasyChair website, at http://www.easychair.org/conferences/?conf=msfp2012 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 herbert at doc.ic.ac.uk Wed Nov 16 05:11:05 2011 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Wed, 16 Nov 2011 10:11:05 +0000 Subject: [TYPES/announce] QAPL 2012: Second Call for Papers (new: Invited Speakers and TCS Special Issue) Message-ID: <4EC38C39.5000904@doc.ic.ac.uk> [Apologies for multiple copies] ******************************************************************************* SECOND CALL FOR PAPERS 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/ ******************************************************************************* SCOPE: Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on: * the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements) * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Jeremy Bradley, Imperial College London, U.K. Topic: Mean field and fluid approaches to Markov chain analysis * Boris Koepf, IMDEA Software Institute, Madrid, Spain Topic: Quantitative Information-flow Analysis * Kim G. Larsen, Aalborg University, Denmark Topic: Statistical Model Checking 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=qapl12 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). SPECIAL ISSUE TCS: A special issue in the journal of Theoretical Computer Science (TCS) for the QAPL editions of 2011 and 2012 is planned. The submission deadline for contributions to this special issue is planned for June 2012. IMPORTANT DATES: For regular papers: Abstract (optional): December 17, 2012 Submission (regular paper): December 20, 2012 Notification: January 20, 2012 Final version (ETAPS proceedings): February 5, 2012 Workshop: March 31 - April 1, 2012 Final version (EPTCS post proceedings): TBA For presentation reports: Submission: January 23, 2012 Notification: January 25, 2012 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 pangjun at gmail.com Thu Nov 17 04:07:00 2011 From: pangjun at gmail.com (Jun PANG) Date: Thu, 17 Nov 2011 10:07:00 +0100 Subject: [TYPES/announce] ICTAC'12: First Call For Papers Message-ID: ==================================================ICTAC 20129th International Colloquium on Theoretical Aspects of ComputingURL: http://www.iiitb.ac.in/ictac24 - 27 September 2012, Bangalore, India================================================== The Colloquium will be held at the International Institute ofInformation Technology (IIIT), which is located in Electronics City ofBangalore. It is two hours by car or taxi from Bangalore InternationalAirport. Bangalore is internationally known as the Silicon Valley ofIndia, with many hi-tech companies and research labs. Holding theconference in the Electronics City of Bangalore gives the conferenceparticipants valuable opportunity to discuss and network with thesoftware practitioners and researchers in India's InformationTechnology (IT) hub. This will be further facilitated via an IndustryDay, 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 Aspectsof Computing, the latest in a series founded by the InternationalInstitute for Software Technology of the United Nations University(UNU-IIST). ICTAC 2012 will bring together practitioners andresearchers from academia, industry and government to present researchand to exchange ideas and experience addressing challenges in boththeoretical aspects of computing and in the exploitation of theorythrough methods and tools for system development. The other mainpurpose is to promote cooperation in research and education betweenparticipants and their institutions, from developing and industrialcountries, 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 beingintroduced to the ICTAC colloquium for the first time. One of the daysof the conference is planned to be marked as Industry Day. Theindustry day will feature technical talks from the industryparticipants. These talks will be drawn from the papers submitted andaccepted to the conference; however any such paper must have at leastone co-author from the Industry and must be clearly marked for`Industry Day' during submission. In addition, we plan to have tooldemonstrations and posters by the companies in the exhibitionfloor. Participants from academia will thus also get a chance tomingle with the industry participants in an informal atmosphere,thereby getting a flavor of the ongoing activities in Bangalore's ITindustry. 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 theseries Lecture Notes in Computer Science (LNCS) and will be availableat the colloquium. A special issue of a journal with extended versionof selected papers from ICTAC 2012 is under negotiation. ?Submissionsto the colloquium must not have been published or be concurrentlyconsidered for publication elsewhere. ?All submissions will be judgedon the basis of originality, contribution to the field, technical andpresentation quality, and relevance to the conference. Submissionscan be either Regular Papers or Short Papers. ?Short papers canpresent recent or ongoing work or discuss new ideas which are at anearly stage of development and have not been thoroughly evaluated yet.Papers should be written in English. Regular Papers should not exceed15 pages and Short Papers should be between 4 and 8 pages in LNCSformat (see http://www.springer.de/comp/lncs/authors.html fordetails). Papers shall be submitted athttp://www.easychair.org/conferences/?conf=ictac2012All queries should be sent to: ictac2012 at iist.unu.edu IMPORTANT DATES-------------------------------------------------Paper submission deadline: ? ? ? ? ? 16 April 2012Paper Accept/Reject Notification: ? ? ?8 June 2012Final 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 mattpark at microsoft.com Fri Nov 18 08:20:54 2011 From: mattpark at microsoft.com (Matthew Parkinson) Date: Fri, 18 Nov 2011 13:20:54 +0000 Subject: [TYPES/announce] MSRC Researcher and Postdoc positions Message-ID: <45F6C1B611EEBE449F713744E6D0330F0F9A5A43@TK5EX14MBXC110.redmond.corp.microsoft.com> The following advertisement might be of interested to readers of the TYPES mailing list. Matt --- Open Research Positions We at MSR-Cambridge are 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. Deadline for applications for the Programming Principles and Tools group is 6th January 2012 for Researchers and 22nd February 2012 for Postdocs. Further information can be found at http://research.microsoft.com/en-us/jobs/fulltime/researcher.aspx Applications are through http://research.microsoft.com/en-us/jobs/fulltime/apply_researcher.aspx -------------- next part -------------- An HTML attachment was scrubbed... URL: From pmt6sbc at maths.leeds.ac.uk Mon Nov 21 14:27:37 2011 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 21 Nov 2011 19:27:37 GMT Subject: [TYPES/announce] Turing Fellowships and Scholarships Message-ID: <201111211927.pALJRbA0006457@maths.leeds.ac.uk> The Turing Fellowships and Scholarships Competition: http://www.turing100.manchester.ac.uk/index.php/fellowships The Turing Centenary Conference in Manchester will see the beginning of the 3-year Turing Centenary Research Project - "Mind, Mechanism and Mathematics", also funded by the John Templeton Foundation. As part of the Alan Turing Year, proposals are invited for: *** Five Turing Research Fellowships for researchers no more than 10 years from the award of a PhD relevant to their proposed research, value 75,000 UK pounds each, and *** Three Turing Scholarships for gifted younger researchers of age up to 25 years old, value 45,000 UK pounds each over the three years. Each Award may be held at a location of the winner's choice, and may be held as a valuable supplement to other funding. For further details of eligibility etc, please see the How to Apply webpage at the Alan Turing Year website: http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?409 The Research Project will address a number of major questions related to the Turing legacy, and are listed at the Turing Centenary Research Project webpage: http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408 under four main headings: 1. The Mathematics of Emergence: The Mysteries of Morphogenesis 2. Possibility of Building a Brain: Intelligent Machines, Practice and Theory 3. Nature of Information: Complexity, Randomness, Hiddenness of Information 4. How should we compute? New Models of Logic and Computation. Important Dates: Submission deadline December 16, 2011 Award Notification March 31, 2012 Award Ceremony Turing Centenary day, June 23, 2012 Commencement of the research project July 1, 2012 Completion of the research project June 30, 2015 Winners will be expected to attend the award ceremony at the Turing Centenary Conference in Manchester, 22 - 25 June, 2012. The members of the Competition Judging Panel are: Samson Abramsky (Oxford) Manindra Agrawal (Kanpur) Eric Allender (Rutgers) Luca Cardelli (Microsoft Research, Cambridge) Rodney Downey (Wellington) Luciano Floridi (Oxford/Hertfordshire) Barbara Grosz (Harvard) Stuart Kauffman (Vermont/Santa Fe) Cris Moore (New Mexico/Santa Fe) Gordon Plotkin (Edinburgh) Aaron Sloman (Birmingham) Robert I. Soare (Chicago) The Judging Panel is Chaired by S. Barry Cooper (Leeds) __________________________________________________________________________ From s.j.thompson at kent.ac.uk Wed Nov 23 03:58:35 2011 From: s.j.thompson at kent.ac.uk (Simon Thompson) Date: Wed, 23 Nov 2011 08:58:35 +0000 Subject: [TYPES/announce] PEPM'12 Call for participation Message-ID: <5D422864-50B2-4CF8-94E7-8AD9FEAE08BF@kent.ac.uk> ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM12 January 23-24, 2012. Philadelphia, PA, USA (co-located with POPL'12) Call For Participation Online registration is open at https://regmaster3.com/2012conf/POPL12/register.php Early registration deadline is December 24, 2011 The PEPM Symposium/Workshop series brings together researchers and practitioners working in the broad area of program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. In addition to the presentations of regular research papers, the PEPM program includes tool demonstrations and `short paper' presentations of exciting if not fully polished research. PEPM has established a Best Paper award. The winner will be announced at the workshop. INVITED TALKS Compiling Math to High Performance Code Markus Pueschel (ETH Zuerich, Switzerland) http://www.inf.ethz.ch/~markusp/index.html Specification and verification of meta-programs Martin Berger (University of Sussex, UK) http://www.informatics.sussex.ac.uk/users/mfb21/ ACCEPTED PAPERS Regular research papers: Naoki Kobayashi, Kazutaka Matsuda and Ayumi Shinohara. Functional Programs as Compressed Data Kazutaka Matsuda, Kazuhiro Inaba and Keisuke Nakano. Polynomial-Time Inverse Computation for Accumulative Functions with Multiple Data Traversals Dana N. Xu. Hybrid Contract Checking via Symbolic Simplification Susumu Katayama. An Analytical Inductive Functional Programming System that Avoids Unintended Programs Roberto Giacobazzi, Neil Jones and Isabella Mastroeni. Obfuscation by Partial Evaluation of Distorted Interpreters Michael Gorbovitski, Yanhong A. Liu, Scott Stoller and Tom Rothamel. Composing Transformations for Instrumentation and Optimization Elvira Albert, Jesus Correas Fernandez, German Puebla and Guillermo Roman-Diez. Incremental Resource Usage Analysis Takumi Goto and Isao Sasano. An approach to completing variable names for implicitly typed functional languages Martin Hirzel and Bugra Gedik. Streams that Compose using Macros that Oblige Vlad Ureche, Tiark Rompf, Arvind Sujeeth, Hassan Chafi and Martin Odersky. StagedSAC: A Case Study in Performance-Oriented DSL Development Markus Degen, Peter Thiemann and Stefan Wehr. The Interaction of Contracts and Laziness Surinder Kumar Jain, Chenyi Zhang and Bernhard Scholz. Translating Flowcharts to Non-Deterministic Languages Francisco Javier Lopez-Fraguas, Enrique Martin-Martin and Juan Rodriguez-Hortala. Well-typed Narrowing with Extra Variables in Functional-Logic Programming Geoff Hamilton and Neil Jones. Superlinear Speedup by Distillation: A Semantic Basis Short papers: Jacques Carette and Aaron Stump. Towards Typing for Small-Step Direct Reflection Janis Voigtlaender. Ideas for Connecting Inductive Program Synthesis and Bidirectionalization Tool demonstration papers: Edvard K. Karlsen, Einar W. Hoest and Bjarte M. Oestvold. Finding and fixing Java naming bugs with the Lancelot Eclipse plugin Adriaan Moors, Tiark Rompf, Philipp Haller and Martin Odersky. Scala-Virtualized Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gomez-Zamalloa and German Puebla. COSTABS: A Cost and Termination Analyzer for ABS Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From baskar at mais.informatik.tu-darmstadt.de Sat Nov 26 07:33:40 2011 From: baskar at mais.informatik.tu-darmstadt.de (Baskar Anguraj) Date: Sat, 26 Nov 2011 13:33:40 +0100 Subject: [TYPES/announce] Positions for PhD and PostDocs Message-ID: <4ED0DCA4.5010405@mais.informatik.tu-darmstadt.de> The TU Darmstadt is one of Germany's top technical universities with an outstanding nation-wide and international reputation in research and education. Being part of Theoretical Computer Science, the chair Modeling and Analysis of Information Systems (MAIS) is currently offering positions for PhD students and PostDocs. What are the positions about? **************************** Our aim is to make IT systems more reliable and secure than they are today. Due to the complexity of today's information systems and the manifold possibilities to attack these systems, the development of secure systems is a big technological challenge. To address this challenge, we develop formal methods and supporting tools that can be applied in the software-development process and at runtime. We test our approaches in case-studies in our Mobile Devices Lab and in practice. In particular, we are working on information flow security, policy languages, refinement of specifications, runtime monitoring, static analysis and security engineering. Currently, we are looking for candidates who are interested in formal approaches for information security in any of the above areas. **The positions ************* Suitable candidates should have a Master's degree (or equivalent) in Computer Science or Mathematics. For all our research topics, a solid background in formal methods or logic is required. A background in information security will be helpful, but is not a prerequisite. Prior knowledge in any of the following areas is also a plus: Automated Verification, Model Checking, Model-based Software Development, Concurrency Theory, Program Analysis, Side-channel Analysis, Runtime Monitoring. Candidates should be highly motivated to tackle challenging research topics and to contribute to an open-minded team. We offer a productive and continuously evolving research environment, in which you can discuss ideas and collaborate with team members who are working on related research topics. Our international connections as well as our involvement in interesting research projects, for example the DFG priority programme Reliably Secure Software Systems (RS3) and the Center for Advanced Security Research Darmstadt (CASED), provide further opportunities for inspiration and collaborations. The publication of your research results at highly ranked conferences will be expected and supported. The positions offered are regular jobs with social benefits. The salary will be based on the TV-TU Darmstadt public service salary scale (equivalent to former BAT IIa and TV-L). German language skills are not required in the beginning, but the willingness to learn German within the first year is expected. ** How to apply? ************* Please submit your application, preferably on paper, including your detailed CV (stating your language skills in English and German), complete educational transcripts with grades and degrees (copies, no originals), description of your background and your research interests, and, if possible, the contact information of one or two references to Prof. Dr. Heiko Mantel, TU Darmstadt, Department of Computer Science, MAIS Group, Hochschulstra?e 10, 64289 Darmstadt, Germany*.* Deadline**for applications is 11 December 2011. However, we will consider applications until the positions are filled. The positions are available immediately but a later start is also possible. TU Darmstadt is an equal opportunities employer and welcomes applications from women. In case of equal qualifications, applicants with a degree of disability of at least 50 or equal will be given preference. More information is available at http://www.mais.informatik.tu-darmstadt.de. In case of questions, please contact us by e-mail recruiting at mais.informatik.tu-darmstadt.de. -------------- next part -------------- An HTML attachment was scrubbed... URL: From swarat at rice.edu Sun Nov 27 14:04:08 2011 From: swarat at rice.edu (Swarat Chaudhuri) Date: Sun, 27 Nov 2011 13:04:08 -0600 Subject: [TYPES/announce] POPL 2012: Call for participation Message-ID: <4ED289A8.1050603@rice.edu> ************************************************************** * ACM SIGPLAN-SIGACT Symposium * on * Principles of Programming Languages * * January 25-27, 2012 * Philadelphia, PA, USA * * Call for Participation * * http://www.cse.psu.edu/popl/12/ *************************************************************** Important dates ------------------------ * Hotel reservation deadline: December 24, 2011 * Early registration deadline: December 24, 2011 * Conference: January 25-27, 2012 * Colocated events: January 22-29, 2012 Registration -------------------------- To register online, please go to https://regmaster3.com/2012conf/POPL12/register.php The early registration deadline is December 24, 2011. Hotel ------------------------- All the conference events will take place at the Sheraton Society Hill Hotel in Philadelphia's historic district. We encourage attendees to stay at the conference hotel. Information about the hotel can be found on the POPL web page: http://www.cse.psu.edu/popl/12/ To be eligible for the special conference rate, bookings must be made by December 24, 2011. However, as the conference rate applies only to a limited number of rooms, attendees are encouraged to make their hotel reservations at the earliest opportunity. Scope ------------------------- The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. Preliminary program -------------------------- A preliminary program can be found at the end of this email in text format, or it can be found here: http://www.cse.psu.edu/popl/12/program.html Program Highlights ------------------------- Invited talks: * Sir Charles Antony Richard Hoare, FRS, FREng, FBCS, Microsoft Research ACM SIGPLAN Programming Languages Achievement Award Interview * J Strother Moore, University of Texas at Austin Meta-Level Features in an Industrial-Strength Theorem Prover * Jennifer Rexford, Princeton University Programming Languages for Programmable Networks Other attractions ------------------------- POPL TutorialFest!: POPL 2012 will have a TutorialFest! event with seven "distilled" 90 minute tutorials. This event is on January 28, immediately following the main POPL conference. The TutorialFest requires separate registration and registrants of TutorialFest may attend any of the tutorials offered throughout the day. More information on the TutorialFest is available at: http://www.cse.psu.edu/popl/12/tutorial.html Affiliated Events -------------------------- * POPL TutorialFest: January 28, 2012 * VMCAI:Verification Model Checking and Abstract Interpretation * January 22-24, 2012 http://lara.epfl.ch/vmcai2012/ * LADA: Languages for Distributed Algorithms * January 23-24, 2012 http://sites.google.com/site/ladameeting/ * PADL: Practical Applications of Declarative Languages * January 23-24, 2012 http://research.microsoft.com/en-us/um/people/crusso/padl12/ * PEPM: Partial Evaluation and Semantics-Based Program Manipulation * January 23-24, 2012 http://www.program-transformation.org/PEPM12 * PLMW: The CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop * January 24, 2012 http://www.cis.upenn.edu/~sweirich/plmw12/ * PLPV: Programming Languages meets Program Verification * January 24, 2012 http://research.microsoft.com/en-us/um/people/nswamy/plpv12/ * DAMP: Declarative Aspects of Multicore Programming * January 28, 2012 http://www.mpi-sws.org/~umut/damp2012/ * OBT: Off the Beaten Track: Underrepresented Problems for Programming Language Researchers * January 28, 2012 http://www.cs.princeton.edu/~dpw/obt/ * TLDI:Types in Language Design and Implementation * January 28, 2012 http://www.cis.upenn.edu/~bcpierce/tldi12/ * VSTTE: Verified Software: Theories, Tools and Experiments * January 28-29, 2012 https://sites.google.com/site/vstte2012/ Travel awards and visa support letters -------------------------------- A limited number of grants are available through the SIGPLAN Professional Activities Committee (PAC) to support students going to POPL. You must be an ACM member to apply. Students that are interested in attending both POPL and the PLMW Workshop should first seek funds via PLMW and then contact PAC if the PLMW grant is not awarded. PLMW grants are explained on the PLMW website. Requests for visa support letters for purposes of attending or presenting at POPL 2012 are handled by ACM. More information is available on the POPL 2012 website. Program --------------------------- Wednesday, January 25 =========================== * 8:30-9:20: Breakfast * 9:20-9:30: Welcome * 9:30-10:30: Invited Talk (Session chairs: Andrew P. Black, Peter O'Hearn) - SIGPLAN Distinguished Achievement Award Presentation and Interview Tony Hoare, Microsoft Research. * 10:30-11:00: Break * 11:00-12:30: Session on Verification (Chair: Ranjit Jhala): -Freefinement (Stephan van Staden, Cristiano Calcagno, and Bertrand Meyer) - Underspecified harnesses and interleaved bugs (Saurabh Joshi, Shuvendu Lahiri, and Akash Lal) - A Program Logic for JavaScript (Philippa Gardner, Sergio Maffeis, and Gareth Smith) * 11:00-12:30: Session on Semantics (Chair: Patricia Johann): - Higher-Order Functional Reactive Programming in Bounded Space (Neelakantan R Krishnaswami and Nick Benton and Jan Hoffmann) - The Marriage of Bisimulations and Kripke Logical Relations (Chung-Kil Hur, Derek Dreyer, Georg Neis, and Viktor Vafeiadis) - Information Effects (Roshan James and Amr Sabry) * 12:30-2:00: Lunch * 2:00-3:30: Session on Privacy and Access Control (Chair: Nikhil Swamy): - A Language for Automatically Enforcing Privacy Policies (Jean Yang, Kuat Yessenov, and Armando Solar-Lezama) - Probabilistic Relational Reasoning for Differential Privacy (Gilles Barthe, Boris K?pf, Federico Olmedo, and Santiago Zanella Beguelin) - Access Permission Contracts for Scripting Languages (Phillip Heidegger, Annette Bieniusa, and Peter Thiemann) * 2:00-3:30: Session on Decision Procedures (Chair: Swarat Chaudhuri): - Recursive Proofs for Inductive Tree Data-Structures (P Madhusudan, Xiaokang Qiu, and Andrei Stefanescu) - Symbolic Finite State Transducers, Algorithms and Applications (Nikolaj Bjorner, Pieter Hooimeijer, and Benjamin Livshits, David Molnar, and Margus Veanes) - Constraints as Control (Ali Sinan K?ksal, Viktor Kuncak, and Philippe Suter) * 3:30-4:15: Break * 4:15-5:15: Session on Security (Chair: Neelakantan Krishnaswami): - Multiple Facets for Dynamic Information Flow (Thomas Austin and Cormac Flanagan) - Defining Code-injection Attacks (Donald Ray and Jay Ligatti) * 4:15-5:15: Session on Complexity for Concurrency (Chair: P. Madhusudan): - Deciding Choreography Realizability (Samik Basu, Tevfik Bultan, and Meriem Ouederni) - Analysis of Recursively Parallel Programs (Ahmed Bouajjani and Michael Emmi) * 5:15-6:00: Break * 6:00-8:00: Student Session (Chair: Tobias Wrigstad) Thursday, January 26 =========================== * 8:30-9:20: Breakfast * 9:20-9:30: Announcements * 9:30-10:30: Invited Talk (Session chair: Michael Hicks) - Programming Languages for Programmable Networks Jennifer Rexford, Princeton University * 10:30-11:00: Break * 11:00-12:30: Session on Medley (Chair: Suresh Jagannathan): - A Compiler and Run-time System for Network Programming Languages (Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker) - Nested Refinements: A Logic For Duck Typing (Ravi Chugh, Patrick M Rondon, and Ranjit Jhala) - An Abstract Interpretation Framework for Termination. (Patrick Cousot and Radhia Cousot) * 11:00-12:30: Session on Mechanized Proofs (Chair: Adam Chlipala): - Playing in the Grey Area of Proofs (Krystof Hoder, Laura Kovacs, and Andrei Voronkov) - Static and User-Extensible Proof Checking (Antonis Stampoulis and Zhong Shao) - Run Your Research: On the Effectiveness of Lightweight Mechanization (Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, and Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, and Robert Bruce Findler) * 12:30-2:00: Lunch * 2:00-3:30: Session on Concurrency (Chair: Matt Parkinson): - Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control (Azadeh Farzan and Zachary Kincaid) -Resource-Sensitive Synchronization Inference by Abduction (Matko Botincan and Mike Dodds and Suresh Jagannathan) - Syntactic Control of Interference for Separation Logic (Uday S Reddy and John C Reynolds) * 2:00-3:30: Session on Type Theory (Chair: Stephanie Weirich): - Canonicity for 2-Dimensional Type Theory (Daniel R Licata and Robert Harper) - Algebraic Foundations for Effect-Dependent Optimisations (Ohad Kammar and Gordon Plotkin) - On the Power of Coercion Abstraction (Didier Remy and Julien Cretin) * 3:30-4:15: Break * 4:15-5:15: Session on Dynamic Analysis (Chair: Aarti Gupta): - Abstractions From Tests (Mayur Naik, Hongseok Yang, and Ghila Castelnuovo and Mooly Sagiv) - Sound Predictive Race Detection in Polynomial Time (Yannis Smaragdakis, Jacob M Evans, and Caitlin Sadowski, Jaeheon Yi, and Cormac Flanagan) * 4:15-5:15: Session on Names and Binders (Chair: Zhong Shao): - Towards Nominal Computation (Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, and Slawomir Lasota) - Programming with Binders and Indexed Data-Types (Andrew Cave and Brigitte Pientka) * 5:15-5:45: Business meeting * 7:00-: Banquet Friday, January 27 =========================== * 8:30-9:20: Breakfast * 9:20-9:30: POPL 2013 preview * 9:30-10:30: Invited Talk (Session chair: John Field) - Meta-level Features in an Industrial-Strength Theorem Prover J Strother Moore, University of Texas * 10:30-11:00: Break * 11:00-12:30: Session on Verified Transformations (Chair: Chris Hawblitzel): - Formalizing the LLVM Intermediate Representation for Verified Program Transformation (Jianzhou Zhao, Steve Zdancewic, Santosh Nagarakatte, and Milo M K Martin) - Optimal Randomized Transformation of Approximate Computations (Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, and Martin Rinard) - A Rely-Guarantee-Based Simulation for Verifying Concurrent Program Transformations (Hongjin Liang, Xinyu Feng, and Ming Fu) * 11:00-12:30: Session on Functional Programming (Chair: Dimitrios Vytiniotis): - A Unified Approach to Fully Lazy Sharing (Thibaut Balabonski) - The Ins and Outs of Gradual Type Inference (Aseem Rastogi and Avik Chaudhuri and Basil Hosmer) - Edit Lenses (Martin Hofmann and Benjamin C Pierce and Daniel Wagner) * 12:30-2:00: Lunch * 2:00-3:30: Session on C/C++ Semantics (Chair: Andreas Podelski): - Clarifying and compiling C/C++ concurrency: from C++0x to POWER (Mark Batty, Kayvan Memarian, and Scott Owens, Susmit Sarkar, and Peter Sewell) - A mechanized semantics for C++ object construction and destruction, with applications to resource management (Tahina Ramananandro, Gabriel Dos Reis, and Xavier Leroy) - An Executable Formal Semantics of C with Applications (Chucky Ellison and Grigore Rosu) * 2:00-3:30: Session on Type Systems (Chair: Norman Ramsey): - A Type Theory for Probability Density Functions (Sooraj Bhat, Ashish Agarwal, and Richard Vuduc and Alexander Gray) - A Type System for Borrowing Permissions (Karl Naden, Robert L Bocchino Jr, Kevin Bierhoff, and Jonathan Aldrich) - Self-Certification: Bootstrapping Certified Typecheckers in F* with Coq (Pierre-Yves Strub and Nikhil Swamy, Cedric Fournet, and Juan Chen) * 3:30-4:00: Closing and Raffle General Chair: -------------------------- John Field Google 76 Ninth Avenue, New York, NY 10011, USA. jfield at google.com Program Chair: --------------------------- Michael Hicks Department of Computer Science University of Maryland, College Park, MD 20866, USA mwh at cs.umd.edu Program Committee: --------------------------- Swarat Chaudhuri, Rice University, USA Adam Chlipala, MIT, USA Dan R. Ghica, University of Birmingham, UK Aarti Gupta, NEC Labs America, USA Chris Hawblitzel, Microsoft Research, Redmond, USA Suresh Jagannathan, Purdue University, USA Ranjit Jhala, University of California, San Diego, USA Sorin Lerner, University of California, San Diego, USA Ondrej Lhotak, University of Waterloo, Canada P. Madhusudan, University of Illinois, Urbana-Champaign, USA Rupak Majumdar, MPI-SWS, Germany Matthew Might, University of Utah, USA Todd Millstein, University of California, Los Angeles, USA Greg Morrisett, Harvard University, USA Andrew Myers, Cornell University, USA Matthew Parkinson, Microsoft Research, Cambridge, UK Frank Piessens, K.U. Leuven, Belgium Andrew Pitts, University of Cambridge, UK Andreas Podelski, University of Freiburg, Germany Fran?ois Pottier, INRIA, France Norman Ramsey, Tufts University, USA Tachio Terauchi, Nagoya University, Japan Mandana Vaziri, IBM Research, USA Dimitrios Vytiniotis, Microsoft Research, Cambridge, UK Nobuko Yoshida, Imperial College, London, UK Francesco Zappa Nardelli, INRIA, France From crusso at microsoft.com Mon Nov 28 04:35:23 2011 From: crusso at microsoft.com (Claudio Russo) Date: Mon, 28 Nov 2011 09:35:23 +0000 Subject: [TYPES/announce] PADL 2012 Call for Participation Message-ID: <88D1F4047EA9A2468BCC6B743186880F64242158@DB3EX14MBXC313.europe.corp.microsoft.com> Call for Participation ====================== 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 You are cordially invited to PADL'12. 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 and constraints. PADL'12 is sponsored by Association for Logic Programming with cooperation of ACM SIGPLAN and support by Microsoft Research. Registration ============ To register for PADL'12, please follow the instructions at: https://regmaster3.com/2012conf/POPL12/register.php The early registration deadline is December 24, 2011. The registration fee will cover a copy of the symposium proceedings, refreshments, and an informal dinner. Hotel Information ================= PADL will be co-located with POPL at the Sheraton Society Hill Hotel in Philadelphia. Please visit POPL's web site to make reservations at the special conference rate. Program ======= The symposium will include invited talks by Boon Thau Loo and Don Stewart, and 19 technical papers selected from 41 submissions. The preliminary program is as follows: Invited Talk (9:00-10:00) * Boon Thau Loo Recent Advances in Declarative Networking Break (10:00-10:30) Session 1: Applications (10:30-12:00) * Mayer Goldberg and Guy Wiener A Declarative Approach for Software Modeling * Sergio Antoy and Michael Hanus Contracts and Specifications for Functional Logic Programming * Pedro M. Martins, Julie A. McCann and Susan Eisenbach The Environment as an Argument Lunch (not provided) (12:00-13:30) Session 2: Logic Programming (13:30-15:30) * Yuliya Lierler, Shaden Smith, Mirek Truszczynski and Alex Westlund Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving * Marcello Balduccini and Yuliya Lierler Practical and Methodological Aspects of the Use of Cutting-Edge ASP Tools * Christian Theil Have and Henning Christiansen Efficient tabling of structured data using indexing and program transformation * Dario Campagna, Beata Sarna-Starosta and Tom Schrijvers Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation Break (15:30-16:00) Session 3: Parallelism and Concurrency (16:00-17:30) * Elvira Albert, Puri Arenas and Miguel Gomez-Zamalloa Symbolic Execution of Concurrent Objects in CLP * Pablo Chico De Guzm??n, Amadeo Casas, Manuel Carro and Manuel Hermenegildo A Segment-Swapping Approach for Executing Trapped Computations * Michael Lesniak Palovca: Describing and Executing Graph Algorithms in Haskell Informal PADL Dinner (Place: TBA) Tuesday, January 24, 2012 Breakfast (8:00-9:00) Invited Talk (9:00-10:00) * Don Stewart Make Things Now! Pragmatic Functional Programming in Haskell Break (10:00-10:30) Session 4: Domain Specific Languages I (10:30-12:00) * Kenny Zhu, Kathleen Fisher and David Walker LearnPADS++: Incremental Inference of Ad Hoc Data Formats * Jeroen Bransen, Arie Middelkoop, Atze Dijkstra and S. Doaitse Swierstra The Kennedy-Warren algorithm revisited: ordering Attribute Grammars * Nicholas Coleman Distributed Policy Specification and Interpretation with Classified Advertisements Lunch (not provided) (12:00-13:30) Session 5: Domain Specific Languages II (13:30-15:30) * Andy Gill and Bowe Neuenschwander Handshaking in Kansas Lava using Patch Logic * Daniel Winograd-Cort, Hai Liu and Paul Hudak Virtualizing Real-World Objects in FRP * Edwin Brady and Kevin Hammond Resource-safe Systems Programming with Embedded Domain Specific Languages * David Broman and Henrik Nilsson Node-Based Connection Semantics for Equation-Based Object-Oriented Modeling Languages Break (15:30-16:00) Session 6: Numerics (16:00-17:00) * Paul Tarau A Declarative Specification of Tree-based Symbolic Arithmetic Computations * Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Flatt and Matthias Felleisen Typing the Numeric Tower From yves.bertot at inria.fr Mon Nov 28 10:31:32 2011 From: yves.bertot at inria.fr (Yves Bertot) Date: Mon, 28 Nov 2011 16:31:32 +0100 (CET) Subject: [TYPES/announce] CfPart: School on Formalization of Mathematics (March 12-16, 2012, Sophia Antipolis, France) In-Reply-To: <491648419.1135552.1322493360699.JavaMail.root@zmbs2.inria.fr> Message-ID: <368171320.1136041.1322494292546.JavaMail.root@zmbs2.inria.fr> International Spring School on FORMALIZATION OF MATHEMATICS Sophia Antipolis, France March 12-16, 2012 http://www-sop.inria.fr/manifestations/MapSpringSchool/ Application deadline: February 27th, 2012 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 aim of this school is to give mathematicians and mathematically inclined researchers the keys to the Coq system and the Mathematical Components library. The topics covered are: Formal proof techniques Structuring libraries Encoding of common mathematical structures Formal description of algorithms An overview of advanced projects: * The odd order theorem * Constructive algebraic topology * Kepler's conjecture, * Computational analysis, * Foundational investigations. 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 exercises. Speakers The current list of speakers is: Georges Gonthier (Microsoft Research) Thomas C. Hales (University of Pittsburgh) Julio Rubio (Universidad de La Rioja) Bas Spitters (Radboud Universiteit, Nijmegen) Vladimir Voevodsky (Institute for advanced study, Princeton) Yves Bertot (Inria) Assia Mahboubi (Inria) Laurence Rideau (Inria) Enrico Tassi (MSR-Inria common laboratory) Laurent Th?ry (Inria) Registration The registration fee is 320 Euros. A registration form is available on the web site http://www-sop.inria.fr/manifestations/MapSpringSchool/ Location The school will take place at Inria's Sophia Antipolis research center. This center is located 20 mn by bus from the city Antibes on the Mediterranean sea, nearby Nice's international airport, with a variety of hotels at a walking distance. Advice for accomodation is provided on the web page. -------------- next part -------------- An HTML attachment was scrubbed... URL: From eberinge at cs.princeton.edu Mon Nov 28 13:42:10 2011 From: eberinge at cs.princeton.edu ( Lennart Beringer) Date: Mon, 28 Nov 2011 13:42:10 -0500 (EST) Subject: [TYPES/announce] ITP'12: final call for workshop proposals In-Reply-To: <00a3f03a-7e49-4693-b483-b6d9f490e29e@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <2eabce0a-b11c-424d-88a1-4fa3e76c9a70@suckerpunch-mbx-0.CS.Princeton.EDU> ITP 2012: Third Conference on Interactive Theorem Proving Princeton, NJ, August 13 - 16, 2012 Conference home page: itp2012.cs.princeton.edu Final call for workshop proposals Submission deadline: December 5th, 2012 The ITP conference series ------------------------- 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 third ITP conference, ITP 2012, will be held at Princeton University, between August 13th and August 16th, 2012. Scope and organization of workshops ----------------------------------- 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 on university premises. 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. Participants will be able to choose between hotel accommodation or accommodation in university dormitories, both in walking distance to the conference venue. 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 programme ready by July 1st 2012. 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 itp2012 at easychair.org, no later than December 5th, 2011. The workshop selection committee consists of the ITP chairs Andrew Appel, Princeton University Lennart Beringer, Princeton University Amy Felty, University of Ottawa. Selected workshops will be notified by January 9th, 2012. From lionel.vaux at univmed.fr Mon Nov 28 15:28:43 2011 From: lionel.vaux at univmed.fr (Lionel Vaux) Date: Mon, 28 Nov 2011 21:28:43 +0100 Subject: [TYPES/announce] LI2012: second call for participation Message-ID: <20111128202843.GV32054@garbure.info> SECOND CALL FOR PARTICIPATION LOGIC AND INTERACTIONS 2012 (LI2012) WINTER SCHOOLS and WORKSHOPS Monday January 30 - Friday March 2 CIRM, Luminy, Marseille, France http://li2012.univ-mrs.fr/ The ?Logic and interactions 2012? session is the third such session organized in Marseille on the topic ?logic in computer science?, after "Logic and interactions 2002" and "Geometry of computation 2006". The meeting will run five consecutive weeks, each dedicated to a particular area of logic and its interactions. Each week will include lectures aimed primarily at PhD students and non-specialist researchers, invited and contributed talks addressed to a more specialized audience and work sessions. Deadline for registration ========================= Participants must register on the web site before *** December 19th, 2011 **** After this time, we cannot guarantee accomodation. Programme ========= Obviously the themes of each week are not disjoint, so we encourage participants, especially students, to participate in several weeks. * Winter school in complexity (30 January - 3 February) --------------------------- Implicit complexity, parameterized complexity, boolean circuits, etc. Organizers: Patrick Baillot, Nadia Creignou, Jean-Yves Marion Lecturers: - Martin Hofmann (Munich, Germany) - Yiannis N. Moschovakis (Los Angeles, USA) - Stefan Szeider (Vienna, Austria) - Heribert Vollmer (Hannover, Germany) Invited speakers: - Emmanuel Hainry (Nancy) - Neil Jones (Copenhagen) - Virgile Mogbil (Paris-Nord) * Logic and interaction (6 - 10 February) --------------------- Geometry of interaction, ludics, games, linguistics, etc. Organizers: Claudia Faggian, Olivier Laurent, Myriam Quatrini Lecturers: - Ugo Dal Lago (Bologna, Italy) - Christophe Fouquer? (Paris, France) - Dan Ghica (Birmingham, UK) - Jean-Yves Girard (Marseille, France) - Martin Hyland (Cambridge, UK) - Alain Lecomte (Paris, France) - Myriam Quatrini (Marseille, France) Invited speakers: - Michele Abrusci (Roma, Italy) - Paolo Pistone (Roma, Italy) - Kurt Ranalter (Munchen, Germany) * Proofs and programs (13 - 17 February) ------------------- Realizability, semantics, program extraction, classical logic, effects and references, concurrent features, etc. Organizers: Olivier Laurent, Alexandre Miquel, Alexis Saurin Lecturers: - Hugo Herbelin (INRIA Paris, France) - Guy McCusker (Bath, UK) - Alexandre Miquel (ENS Lyon, France) - Gordon Plotkin (Edinburgh, UK) Invited speakers: - Ulrich Berger (Swansea, UK) - Paul-Andr? Melli?s (CNRS, Paris, France) - Jaap van Oosten (Utrecht, Netherlands) - Thomas Streicher (Darmstadt, Germany) * Quantitative approaches (20 - 24 February) ----------------------- Algebraic extensions of lambda-calculi and linear logic, logical approaches to probabilistic and quantum computation,?quantitative semantics,?resource and differential lambda-calculi. Organizers: Michele Pagani, Simon Perdrix, Peter Selinger, Christine Tasson Lecturers: - Thomas Ehrhard & Christine Tasson (Paris, France) - Prakash Panangaden (McGill, Montr?al, Canada) - Elham Kashefi (Edinburgh, UK) Invited speakers: - Pablo Arrighi (Grenoble, France) - Rick Blute (Ottawa, Canada) - Robin Cockett (Calgary, Canada) - Ross Duncan (Brussels, Belgium) - Alexander Green (Nottingham, UK) - Aleks Kissinger (Oxford, UK) - Jean Goubault-Larrecq (Paris, France) - Daniele Varacca (Paris, France) * Algebra and computation (27 February - 2 March) ----------------------- Rewriting, operads, algebraic invariants of computation, type theory and homotopy, etc. Organizers: Pierre-Louis Curien, Yves Guiraud, Philippe Malbos, Fran?ois M?tayer Lecturers: - Vladimir Dotsenko (Luxembourg) - Timothy Porter (University of Wales, Bangor, UK) - Michael Warren (IAS, Princeton, USA) Invited speakers: - Dimitri Ara (Paris, France) - Albert Burroni (Paris, France) - Nicola Gambino (Palermo, Italy) - St?phane Gaussent (Nancy, France) - Yves Lafont (Universit? Aix-Marseille 2) - Jean-Louis Loday (CNRS, Strasbourg, France) - Paul-Andr? Melli?s (CNRS, Paris, France) - Samuel Mimram (CEA Saclay, France) - Pierre Rannou (Universit? Aix-Marseille 2) - Bruno Vallette (Nice-Sophia Antipolis, France) Call for contributed talks ========================== Each week, except the last one, will include sessions for contributed talks. Details on the submission procedures can be found on the web page for each week. No publication of proceedings is planned, submission of published work is allowed. Deadlines for submissions: - Complexity: December 15th, 2011 - Logic and interaction: November 30th, 2011 - Proofs and programs: December 15th, 2011 - Quantitative approaches: December 1st, 2011 Registration ============ There are no registration fees. Accomodation at the CIRM should be available and funded for all participants: the only condition is to register on time. Pre-registration is now open on the web site. Once your pre-registration is validated, you will be contacted by the CIRM for the actual registration and booking. Grants ====== Accommodation at the CIRM is funded for all participants requiring it: simply select the appropriate option in the pre-registration form. FYI: The standard rate for staying at the CIRM, including breakfast and two meals each day is 82 (double room) to 90 (single room) euros per day. We might also provide a limited amount of travel grants for students. To apply for such a grant, be sure to check the corresponding box of the pre-registration form: we will contact you directly for further information. -- Emmanuel Beffara and Lionel Vaux Institut de Math?matiques de Luminy From U.Berger at swansea.ac.uk Tue Nov 29 06:26:53 2011 From: U.Berger at swansea.ac.uk (Ulrich Berger) Date: Tue, 29 Nov 2011 11:26:53 +0000 Subject: [TYPES/announce] MFPS First Call for Papers Message-ID: <4ED4C17D.3010201@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 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 (TBC) 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: - 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 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 ze at inf.u-szeged.hu Thu Dec 1 08:57:38 2011 From: ze at inf.u-szeged.hu (ze at inf.u-szeged.hu) Date: Thu, 1 Dec 2011 14:57:38 +0100 (CET) Subject: [TYPES/announce] FICS 2012, second call Message-ID: <53670.219.127.83.145.1322747858.squirrel@webmail.inf.u-szeged.hu> -------------------------------------------------------------------------- Call for Papers FICS 2012 March 24, 2012, Tallinn, Estonia Satellite workshop to ETAPS 2012 http://www.inf.u-szeged.hu/fics2012/ Important dates: Abstract submission: 4 Dec 2011 Paper submission: 11 Dec 2011 Notification: 21 Jan 2012 Final version: 5 Feb 2012 Background: Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of this workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop) and Brno (2010, MFCS/CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers: * Andreas Abel, Munich, Germany * Luke Ong, Oxford, UK Submission: Selection of contributed talks is based on extended abstracts/short papers. Submission is via EasyChair in two stages: titles and abstracts by 4 December, and extended abstracts/ short papers in LaTeX by 11 December. The authors will be notified of acceptance/rejection by 21 January 2012. We plan to distribute the short papers presented at the meeting via the opensource repository EPTCS. Submissions must be limited to * 8 pages using eptcs.cls or * 6 pages using easychair.cls . Final submissions for the proceedings will require using eptcs.cls. Journal publication: If the number and quality of submissions and accepted talks warrant this, a special issue of an internationally recognized journal devoted to the event will be published. FICS Program Committee: PC co-Chairs: * Dale Miller, INRIA-Saclay, France * Zoltan Esik, University of Szeged, Hungary PC members: * Achim Jung, University of Birmingham, UK * Arnaud Carayol, Institut Gaspard-Monge, France * David Baelde, University of Paris 11, France * Fabio Gadducci, University of Pisa, Italy * Igor Walukiewicz, LaBRI Bordeaux, France * Irene Guessarian, University of Paris 7, France * Jan Rutten, CWI, Amsterdam, Radboud University, Holland * Julian Bradfield, University of Edinburgh, UK * Luigi Santocanale, Universit? Aix-Marseille I, France * Ralph Matthes, IRIT Toulouse, France * Stephan Kreutzer, Technische Universit?t Berlin, Germany * Tarmo Uustalu, Institute of Cybernetics, Estonia * Wan Fokkink, Vrije Universiteit, Holland From scott.west at inf.ethz.ch Thu Dec 1 10:40:16 2011 From: scott.west at inf.ethz.ch (Scott West) Date: Thu, 1 Dec 2011 16:40:16 +0100 Subject: [TYPES/announce] 2nd CFP - TOOLS Europe 2012 Message-ID: <4ED79FE0.9060707@inf.ethz.ch> ====================================================================== CALL FOR PAPERS (Paper submission: 13 January 2012) TOOLS Europe 2012 50th International Conference on Objects, Models, Components, Patterns Co-located with: International Conference on Model Transformation (ICMT 2012) International Conference on Software Composition (SC 2012) International Conference on Tests and Proofs (TAP 2012) Prague, Czech Republic, 29-31 May 2012 http://toolseurope2012.fit.cvut.cz/ ====================================================================== 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. TOOLS Europe encourages contributions on all aspects of object technology and related fields. In particular, every topic in advanced software technology falls within the scope of TOOLS. Contributions demonstrating practical applications backed up by formal analysis and thorough experimental evaluation are particularly welcome. Topics ====== Topics of interest include, but are not limited to: * Object technology, programming techniques, languages, tools * Language implementation techniques, compilers, run-time systems * Distributed and concurrent object systems, multicore programming * Patterns, pattern languages and tool support for patterns * Program verification and analysis techniques * Trusted, reliable and secure components * Testing of object-oriented systems * Component-based programming, modeling, tools * Model-driven development * Empirical studies on programming models and techniques * Domain specific languages and language design * Aspect-oriented programming and modeling * Industrial-strength experience reports * Real-time object-oriented programming and design Submissions =========== TOOLS Europe 2012 welcomes submissions in the following categories: * Full research papers (up to 16 pages) * Tool demonstration papers (up to 8 pages) * Short papers, such as experience reports or position statements (up to 8 pages) Submitted papers must be written in English and present original research. They must be unpublished and not submitted for publication elsewhere. Submissions must be in LNCS format (see Springer's instructions at http://www.springer.de/comp/lncs/authors.html). The page limits above include figures and bibliographic references. Additional material intended for referees but not for publication in the final version -- for example details of proofs -- may be placed in a clearly marked appendix that is not included in the page limit. Referees will be at liberty to ignore appendices, and papers must be understandable without them. Papers must be submitted in PDF format via http://www.easychair.org/conferences/?conf=toolseurope2012. All contributions will be subject to a rigorous selection process, with a stress on significance, originality and clarity. Accepted papers will be published as conference proceedings by Springer in the Lecture Notes in Computer Science (LNCS) series. At least one author of every accepted paper (in every category) is required to present the paper at the conference. Authors of selected papers will be invited to submit an extended version to a special issue of the Journal of Object Technology (JOT). Outstanding submissions will be considered for the EAPLS best paper award of TOOLS 2012. Important Dates =============== * Abstract submission: 6 January 2012 * Full paper submission: 13 January 2012 * Acceptance notification: 2 March 2012 * Camera-ready copy: 23 March 2012 * Conference: 29-31 May 2012 Committees ========== Program Chairs: * Carlo A. Furia, ETH Zurich, Switzerland * Sebastian Nanz, ETH Zurich, Switzerland Program Committee: * Jonathan Aldrich, Carnegie Mellon University, USA * Gilles Barthe, IMDEA Software Institute, Spain * Lorenzo Bettini, University of Torino, Italy * Yuriy Brun, University of Washington, USA * S.C. Cheung, The Hong Kong University of Science and Technology, China * Gordon Fraser, Saarland University, Germany * John Gallagher, Roskilde University, Denmark * Angelo Gargantini, University of Bergamo, Italy * Michael Goedicke, University of Duisburg-Essen, Germany * Susanne Graf, VERIMAG, France * Mark Harman, University College London, United Kingdom * Michael Huth, Imperial College London, United Kingdom * Yves Le Traon, University of Luxembourg, Luxembourg * Yang Liu, National University of Singapore, Singapore * Tiziana Margaria, University of Potsdam, Germany * Jerzy Nawrocki, Poznan University of Technology, Poland * Nathaniel Nystrom, University of Lugano, Switzerland * Manuel Oriol, University of York, United Kingdom * Alessandro Orso, Georgia Institute of Technology, USA * Richard Paige, University of York, United Kingdom * Alexander K. Petrenko, Moscow State University, Russia * Grigore Rosu, University of Illinois, USA * Peter Sestoft, IT University of Copenhagen, Denmark * Andrey Terekhov, St. Petersburg State University, Russia * Zdenek Tronicek, Czech Technical University in Prague, Czech Republic * Naoyasu Ubayashi, Kyushu University, Japan * Antonio Vallecillo, University of Malaga, Spain * Kapil Vaswani, Microsoft Research, Bangalore, India * Tao Xie, North Carolina State University, USA * Amiram Yehudai, Tel Aviv University, Israel * Michal Young, University of Oregon, USA * Jian Zhang, Chinese Academy of Sciences, China * Lu Zhang, Peking University, China Conference Chair: * Bertrand Meyer, ETH Zurich and Eiffel Software Local Organization: * Pavel Tvrdik, CTU Prague, Czech Republic * Michal Valenta, CTU Prague, Czech Republic * Jindra Vojikova, CTU Prague, Czech Republic * Jan Chrastina, CTU Prague, Czech Republic Publicity Chair: * Scott West, ETH Zurich, Switzerland From nswamy at microsoft.com Thu Dec 1 23:41:19 2011 From: nswamy at microsoft.com (Nikhil Swamy) Date: Fri, 2 Dec 2011 04:41:19 +0000 Subject: [TYPES/announce] PLPV 2012: Call for participation Message-ID: <55B8BB41BB08654590C07B5D630FD93A0B6749F1@TK5EX14MBXC287.redmond.corp.microsoft.com> Call for Participation ====================== PLPV 2012 The Sixth ACM SIGPLAN Workshop Programming Languages meets Program Verification 24th January, 2012 Philadelphia, USA (Affiliated with POPL 2012) http://research.microsoft.com/en-us/um/people/nswamy/plpv12 You are cordially invited to PLPV 2012. The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications or extended static checking systems which incorporate contracts with either static or dynamic contract checking. Registration ============ To register for PLPV 2012, please follow the instructions at: https://regmaster3.com/2012conf/POPL12/register.php The early registration deadline is December 24, 2011. Hotel Information ================= PLPV will be co-located with POPL at the Sheraton Society Hill Hotel in Philadelphia. Please visit POPL's web site to make reservations at the special conference rate. Program ======= Session 1: 9:00am-10:00am LTL types FRP: Linear-time Temporal Logic Propositions as Types, Proofs as Functional Reactive Programs Alan Jeffrey A Hoare Calculus for the Verification of Synchronous Languages Manuel Gesell and Klaus Schneider Session 2: 10:30am-12:00pm Invited talk: Could We Verify an Information-flow Computer? Benjamin C. Pierce University of Pennsylvania Lunch: 12:00pm-2:00pm (not provided) Session 3: 2:00pm-3:30pm Reflexive Toolbox for Regular Expression Matching Vladimir Komendantsky Formal Network Packet Processing with Minimal Fuss: Invertible Syntax Descriptions at Work Reynald Affeldt, David Nowak and Yutaka Oiwa The VerCors project - setting up basecamp Afshin Amighi, Stefan Blom, Marieke Huisman and Marina Zaharieva-Stojanovski Session 4: 4:00pm-5:00pm Dependent Interoperability Peter-Michael Osera, Vilhelm Sjoberg and Steve Zdancewic. Equational Reasoning about Programs with General Recursion and Call-by-value Semantics Garrin Kimmell, Aaron Stump, Harley Eades, Peng Fu, Tim Sheard, Stephanie Weirich, Chris Casinghino, Vilhelm Sjoberg, Nathan Collins and Ki Yung Ahn From julien.tesson at univ-orleans.fr Fri Dec 2 04:33:03 2011 From: julien.tesson at univ-orleans.fr (Julien Tesson) Date: Fri, 02 Dec 2011 10:33:03 +0100 Subject: [TYPES/announce] CfP PAPP 2012: 9th International Workshop on Practical Aspects of High-Level Parallel Programming Message-ID: <4ED89B4F.3080308@univ-orleans.fr> ========================================================= 9th International Workshop on Practical Aspects of High-Level Parallel Programming (PAPP 2012) ========================================================= affiliated to The International Conference on Computational Science June 4-6, 2012, Omaha, USA http://www.papp-workshop.org *Aims and scope* Computational Science applications are more and more complex to develop and require more and more computing power. Sequential computing cannot go further. Major companies in the computing industry now recognise the urgency of re-orienting an entire industry towards massively parallel computing. Parallel and grid computing are solutions to the increasing need for computing power. The trend is towards the increase of cores in processors, the number of processors and the need for scalable computing everywhere. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Thus high-level approaches should play a key role in the shift to scalable computing in every computer. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Also, high level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimisation of high-level programming languages, semantics of parallel languages, formal verification, design or certification of libraries, middle-wares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hot-spot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), application of proof assistants to parallel applications, applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications (safety, expressivity, efficiency, etc.). Thus the PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. *Topics* We welcome submission of original, unpublished papers in English on topics including: applications in all fields of high-performance computing and visualisation (using high-level tools) high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing high-level parallel language design, implementation and optimisation practical aspects of computer assisted verification for high-level parallel languages modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems algorithmic skeletons, patterns and high-level parallel libraries generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries benchmarks and experiments using such languages and tools *Paper submission and publication* Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Procedia Computer Science series, as part of the ICCS proceedings. Submission must be done through the ICCS website We invite you to submit a full paper of at most 10 pages describing new and original results, no later than January 9, 2012 (firm). Submission implies the willingness of at least one of the authors to register and present the paper. Accepted papers should be presented at the workshop. *Important Dates* January 9, 2012: Full paper due (firm) February 9, 2012: Notification March 1, 2012: Camera-ready paper due *Programme committee* Marco Aldinucci (University of Torino, Italy) Jost Berthold (University of Copenhagen, Denmark) Kento Emoto (University of Tokyo, Japan) Fr?d?ric Gava (University Paris East Cr?teil, France) Alexandros Gerbessiotis (NJIT, USA) Fr?d?ric Loulergue, chair (LIFO, University of Orl?ans, France) Aamir Shafi (NUST, Pakistan) Julien Tesson (Kochi University of Technology, Japan) From hu at nii.ac.jp Fri Dec 2 04:58:56 2011 From: hu at nii.ac.jp (Zhenjiang Hu) Date: Fri, 2 Dec 2011 18:58:56 +0900 Subject: [TYPES/announce] CFP: Special Issue on Advanced Programming Techniques for Construction of Robust, General and Evolutionary Programs Message-ID: CALL FOR PAPERS Special Issue on Advanced Programming Techniques for Construction of Robust, General and Evolutionary Programs http://research.nii.ac.jp/~hu/pi13/ AIMS AND SCOPE Programming is more than just writing programs. Programmers must be concerned with many issues of programs such as robustness, reliability, adaptability, and maintainability, while meeting specifications. Many advanced new programming techniques, such as dependently typed programming, generic programming and bidirectional programming, have been developed to deal with these issues. This special issue aims at publishing high quality papers on these advanced programming techniques that can lead to practical and effective processes for constructing robust, general and evolutionary programs. Topics of interest for this special issue include, but are not limited to: - Programming with dependent types - Staged programming - Generic programming - Polytypic programming - Bidirectional programming SUBMISSION Submissions for this special issue can be regular research papers or survey/tutorial papers. They should not have been published or submitted elsewhere. Manuscripts should be prepared according to the guidelines indicated in the information "For Authors": http://www.nii.ac.jp/pi/html/forauthors.html The submission and review process will be carried out using the easychair system: https://www.easychair.org/conferences/?conf=pi2013 IMPORTANT DATES - Deadline for paper submission: April 15, 2012 - Notification of acceptance/rejection: October 15, 2012 - Deadline for camera-ready submission: December 15, 2012 - Publication of the special issue: March, 2013 GUEST EDITORS Zhenjiang Hu (National Institute of Informatics, Japan) Shin-Cheng Mu (Academia Sinica, Taiwan) Stephanie Weirich (University of Pennsylvania, USA) ABOUT JOURNAL "Progress in Informatics" Progress in Informatics is an international peer-reviewed journal published by the National Institute of Informatics (NII), Japan, aiming at the promotion of research and development in the broad area of informatics. http://www.nii.ac.jp/pi/ The published articles consist not only of original research papers but also of surveys and project reports which contribute internationally to the progress of research and development. From bcpierce at cis.upenn.edu Sun Dec 4 22:29:34 2011 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Sun, 4 Dec 2011 22:29:34 -0500 Subject: [TYPES/announce] TLDI 2012 Call for participation Message-ID: The Seventh ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2012) CALL FOR PARTICIPATION Saturday, January 28, 2012 in conjunction with POPL 2012 Philadelphia, PA, USA The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2012 is the seventh workshop in the series and will be co-located with POPL in Philadelphia, Pennsylvania in January 2012. PROGRAM Invited speakers: - Frank Pfenning (Carnegie Mellon University) Towards Concurrent Type Theory - Neelakantan Krishnaswami (Max Planck Institute) Semantics for Graphical User Interfaces Full program: http://www.cis.upenn.edu/~bcpierce/tldi12 REGISTRATION To register for TLDI 2012, follow the instructions here: https://regmaster3.com/2012conf/POPL12/register.php The early registration deadline is December 24, 2011. TLDI will be co-located with POPL at the Sheraton Society Hill Hotel in Philadelphia. Please visit POPL's web site to make reservations at the special conference rate. From Jean-Yves.Marion at loria.fr Mon Dec 5 12:17:06 2011 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Mon, 5 Dec 2011 18:17:06 +0100 Subject: [TYPES/announce] Special issue of Information and Computation on ICC/DICE Message-ID: <14259F57-65F4-4F4B-9EF7-D81A34791EFE@loria.fr> -------------------------------------------------------------------------------------------------------------- [Apologies if you receive multiple copies of this message] Special issue of Information and Computation on Implicit Computational Complexity (Deadline extension = 31 January 2012) Call for Papers -------------------- 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. 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, - 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 workshop. The first DICE workshop was held in 2010 in Lyon, the second in Saarbrucken in 2011, and the next one in Tallinn (http://dice2012.cs.unibo.it/) in 2012, as satellite events of ETAPS. - A survey on ICC by P. Baillot, M. Hofmann, D. Leivant, J-Y Marion and S. Ronchi Della Rocca is planned. Submissions: ------------------ Submissions, in pdf format, must be sent to Jean-Yves Marion at loria.fr no later than 31 January, 2011 But 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 - Please send any further inquiry - See also : http://dice11.loria.fr for updated information From ze at inf.u-szeged.hu Tue Dec 6 02:30:16 2011 From: ze at inf.u-szeged.hu (ze at inf.u-szeged.hu) Date: Tue, 6 Dec 2011 08:30:16 +0100 (CET) Subject: [TYPES/announce] FICS 2012 submission deadline extension Message-ID: <36438.188.36.221.150.1323156616.squirrel@webmail.inf.u-szeged.hu> The submission deadline of FICS has been extended by one week. Would you please post the enclosed information on types forum? Thank you, Zoltan Esik =========================================================================== FICS 2012 Workshop March 24, 2012, Tallinn, Estonia Satellite workshop to ETAPS 2012 http://www.inf.u-szeged.hu/fics2012/ Important dates: Abstract submission (extended): 11 Dec 2011 Paper submission (extended): 18 Dec 2011 Notification: 21 Jan 2012 Final version: 5 Feb 2012 Background: Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of this workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop) and Brno (2010, MFCS/CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers: * Andreas Abel, Munich, Germany * Luke Ong, Oxford, UK From Yves.Bertot at inria.fr Tue Dec 6 10:26:58 2011 From: Yves.Bertot at inria.fr (bertot) Date: Tue, 06 Dec 2011 16:26:58 +0100 Subject: [TYPES/announce] Post-doc position in the Marelle team at Inria Sophia Antipolis Message-ID: <4EDE3442.8050103@inria.fr> The Marelle team at INRIA Sophia Antipolis concentrates on various aspects of computer-aided proof verification. It participates to two major efforts for formalizing mathematics: the Math-Components effort, which aims at understanding how to structure large libraries of formal development, with a landmark objective focused on the Feit-Thompson theorem (a theorem in Group theory) and the Formath project, which is an Europe-wide effort on the formalization of mathematics, with a strong focus on linear algebra and its application to algebraic topology and numeric computation. The Marelle team also investigates applications of formalized mathematics in the verification of cryptographic primitives and extensions of Type-Theory based systems with extra computation powers and connections to SMT solvers. The team invites applications for post-doc positions of approximately one year on topics related to its focus. Applicants should exhibit a balanced knowledge of mathematics and computer-science and should be aware that most of the tasks envision during the post-doctoral period will revolve around proof development using the Coq system. Applications should be sent to Yves Bertot and Nathalie Bellesso, Yves.Bertot at inria.fr Nathalie.Bellesso at inria.fr Applications should include - a complete C.V. - references to at most three publications considered by the author as their most significant scientific production. If the most significant production is in the form of running software, this software and documentation should be made available. - Names of well-known researchers that would be willing to write recommendation letters in support of the applicant (at most 5). From sebastian.bauer at pst.ifi.lmu.de Tue Dec 6 13:36:01 2011 From: sebastian.bauer at pst.ifi.lmu.de (Sebastian Bauer) Date: Tue, 6 Dec 2011 19:36:01 +0100 Subject: [TYPES/announce] FIT 2012 - 2nd Call for Contributions Message-ID: ----------------------------------------------------------------------- FIT 2012 - CALL FOR CONTRIBUTIONS 4th International Workshop on Foundations of Interface Technologies WORKSHOP AT ETAPS 2012 - Tallinn, Estonia Sunday 25th March 2012 Please visit: http://fit2012.pst.ifi.lmu.de/ ----------------------------------------------------------------------- WORKSHOP TOPIC & AIM --------------------------- 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. FIT 2012 is affiliated to ETAPS and will be held in Tallinn, Estonia. TOPICS OF INTEREST --------------------------- * Modeling of rich interfaces, handling aspects like o timeliness o QoS o safety o reliability o fault-tolerance o security o probability o resource constraints * Type systems * Design methods for interfaces, design by contract * Verification and analysis of interfaces: o abstraction o refinement o assume/guarantee reasoning o compositionality o property preservation o adaptation * Domain-specific interfaces, use of interfaces like o product lines o web services SUBMISSIONS ------------------------ FIT embraces an inclusive formula that emphasizes interaction and discussion. Researchers are encouraged to submit new results, work in progress, work already published, or work submitted for publication elsewhere. Submissions will be judged on general quality and prospective interest to workshop participants. Contributions should be typeset in EPTCS format, available at http://style.eptcs.org/ . Two kinds of submissions are considered: * Regular papers (up to 20 pages in EPTCS format), presenting original and unpublished work (which can also be a survey) * Abstracts (up to 3 pages in EPTCS format), presenting published work All papers should be submitted via EasyChair: https://www.easychair.org/conferences/?conf=fit2012 Informal proceedings will be given to registered participants. Regular papers will be published as post-proceedings after the workshop as a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS). IMPORTANT DATES ------------------------ * Submission: Monday, 19th December 2011 * Notification: Thursday, 19th January 2012 * Camera-ready version for the local pre-proceedings: Monday, 6th February 2012 * Workshop: Sunday, 25th March 2012 * Final version for Post-Proceedings (EPTCS): 12th April 2012 INVITED SPEAKERS ---------------------------------------- * Jos? Luiz Fiadeiro (University of Leicester, UK) * Jiri Srba (Aalborg University, Denmark) * Karsten Wolf (Universit?t Rostock, Germany) PROGRAMME COMMITTEE ---------------------------------------- * Tevfik Bultan (University of California, Santa Barbara, USA) * Marco Faella (Universit? di Napoli "Federico II", Italy) * Rolf Hennicker (LMU M?nchen, Germany) * Holger Hermanns (Saarland University, Germany) * Kim G. Larsen (Aalborg University, Denmark) * Axel Legay (INRIA/IRISA Rennes, France) * Thomas Santen (Microsoft Research, Germany) * Sven Schewe (University of Liverpool, UK) * Mari?lle Stoelinga (University of Twente, The Netherlands) * Andrzej Wasowski (IT University Copenhagen, Denmark) CONTACT ---------------------------------------- Sebastian Bauer (LMU M?nchen, Germany): bauerse at pst.ifi.lmu.de Jean-Baptiste Raclet (University Paul Sabatier-Toulouse III, France): raclet at irit.fr From agoodloe at gmail.com Tue Dec 6 14:10:59 2011 From: agoodloe at gmail.com (Alwyn Goodloe) Date: Tue, 6 Dec 2011 14:10:59 -0500 Subject: [TYPES/announce] NFM 2012 Paper Submission Deadline extended to December 18, 2011 (11:59pm EST) Message-ID: The paper submission deadline for the 2012 NASA Formal Methods Symposium has been extended to December 18, 2011 (11:59pm Eastern Standard Time). **Note** The paper title and abstract are still due December 11, 2011 (11:59pm Eastern Standard Time) . NFM 2012 PAPER SUBMISSION DEADLINE EXTENDED Fourth NASA Formal Methods Symposium Norfolk, Virginia, USA April 3 - 5, 2012 *http://shemesh.larc.nasa.gov/nfm2012/ * *nasa-nfm2012 at mail.nasa.gov * -------------------------------------------------- Theme of 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. -------------------------------------------------- Topics of Interest: -------------------------------------------------- * Formal verification, including theorem proving, model checking, and static analysis * Automated test generation and testing techniques for safety-critical systems * Model-based development * Techniques and algorithms for scaling formal methods, such as abstraction and symbolic methods, compositional techniques, as well as parallel and distributed techniques * Monitoring and runtime verification * Code generation from formally verified models * Significant applications of formal methods to aerospace systems * Modeling and verification aspects of cyber-physical systems * Safety cases * Accident/safety analysis * Formal approaches to fault tolerance * Theoretical advances and empirical evaluations of formal methods * Techniques for safety-critical systems, including hybrid and embedded systems * Formal methods in systems engineering -------------------------------------------------- Submissions: -------------------------------------------------- There are two categories of submissions: * Regular papers describing fully developed work and complete results (15 pages/30 minute talks) * Short papers describing tools, experience reports, or descriptions of work in progress or?preliminary results (6 pages/15 minute talks) 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 the LNCS style and be put in PDF format in anticipation that we will publish accepted papers (including regular papers and short papers) in a formal proceedings. Papers should be submitted through the following link: *http://www.easychair.org/conferences/?conf=nfm2012* ------------------------------------------------------- Program Chairs: ------------------------------------------------------- Alwyn Goodloe, NASA Langley Research Center Suzette Person, NASA Langley Research Center ------------------------------------------------------- Steering Committee: ------------------------------------------------------- Ewen Denney, NASA Ames Research Center Ben Di Vito, NASA Langley Research Center Dimitra Giannakopoulou, NASA Ames Research Center Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Cesar Munoz, NASA Langley Research Center Corina Pasareanu, NASA Ames Research Center James Rash, NASA Goddard Kristin V. Rozier, NASA Ames Research Center ------------------------------------------------------- Important Dates: ------------------------------------------------------- Submission: 11 December 2011 Notification: 21 January 2012 Final Version: 4 February 2012 Conference: 3 - 5 April 2012 ------------------------------------------------------- Location and Cost: ------------------------------------------------------- The symposium will take place at the Norfolk Waterside Marriott in Norfolk, Virginia, USA. April 3-5, 2012. 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. -- 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 katoen at cs.rwth-aachen.de Tue Dec 6 15:05:48 2011 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Tue, 06 Dec 2011 21:05:48 +0100 Subject: [TYPES/announce] ETAPS 2013: Final Call for Satellite Events Message-ID: <4EDE759C.4030600@cs.rwth-aachen.de> [We apologise for multiple copies.] ------------------------------------------------------------- *** FINAL CALL FOR SATELLITE EVENTS *** !! Deadline: December 16th, 2011 ! ! ETAPS 2013 European Joint Conferences on Theory And Practice of Software March 16th ? 24th, 2013 Rome, Italy ------------------------------------------------------------- -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS is an annual event which takes place in Europe each spring since 1998. The sixteenth conference, ETAPS 2013, takes place between March 16th and 24th, 2013 in Rome, Italy. Rome is the capital of Italy; its history spans over two and a half thousand years. Its architectural and archaeological sites (ranging from ancient Romans to Art Nouveau and Modernism, passing through Renaissance and Baroque), and its rich artistic and historical heritage, contribute to the presence of many UNESCO World Heritage Sites. ETAPS main conferences take place on March 18th-22nd, 2013. They are: - CC: International Conference on Compiler Construction - ESOP: European Symposium on Programming - FASE: Fundamental Approaches to Software Engineering - FOSSACS: Foundations of Software Science and Computation Structures - POST: Principles of Security and Trust - TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- SATELLITE EVENTS -- The ETAPS 2013 Organizing Committee invites proposals for Satellite Events (workshops, tutorials, etc.) that will complement the main conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite Events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. ETAPS 2013 Satellite Events will be held immediately before and after the main conferences, on March 16th-17th and March 23rd-24th, 2013. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize Satellite Events are invited to submit proposals in ASCII, PDF or Postscript format by e-mail to etaps2013-sat at di.uniroma1.it. A proposal should not exceed two pages and should include: ? Satellite Event name / acronym ? names and contact information of the organizers ? preferred period: March 16th-17th or March 23rd-24th ? duration of the workshop: one-day or two-day event ? 120-word description of the workshop topic for later use in publicity material ? a brief explanation of the workshop topic and its relevance to ETAPS ? a schedule for paper submission, notification of acceptance and final versions ? expected number of participants ? any other relevant information, like event format, invited speakers, ? publication policy, demo sessions, special space requirements, etc. The proposals will be evaluated by the ETAPS 2013 organizing committee on the basis of their assessed benefit for prospective participants to ETAPS 2013. The titles and brief information about accepted Satellite Events will be included in the ETAPS 2013 web site, call for papers and call for participation. Satellite Events organizers will be responsible for producing the event's call for papers and call for participations advertising the event through specialist mailing lists etc. to complement publicity for ETAPS as a whole hosting and maintaining a web site for the event reviewing and making acceptance decisions on submitted papers producing the event proceedings, if any; facilities for printing will be made available by the ETAPS organizers scheduling workshop activities in consultation with the local organizers Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2012: http://www.etaps.org/2012/workshops ETAPS 2011: http://www.etaps.org/2011/workshops ETAPS 2010: http://www.etaps10.cs.ucy.ac.cy/ ETAPS 2009: http://www.cs.york.ac.uk/etaps09/ ETAPS 2008: http://etaps08.mit.bme.hu/ ETAPS 2007: http://www.di.uminho.pt/etaps07/ ETAPS 2006: http://www.complang.tuwien.ac.at/etaps06/ ETAPS 2005: http://www.etaps05.inf.ed.ac.uk/ ETAPS 2004: http://www.lsi.upc.es/etaps04/ ETAPS 2003: http://www.mimuw.edu.pl/etaps03/ -- IMPORTANT DATES -- Satellite Event Proposals Deadline: December 16th, 2011 Notification of acceptance: January 10th, 2012 -- FURTHER INFORMATION AND ENQUIRIES -- Please contact Paolo Bottoni or Pietro Cenciarelli (workshops chairs) etaps2013-sat at di.uniroma1.it (preferred) bottoni at di.uniroma1.it, cenciarelli at di.uniroma1.it +---------------------------------------------------------------+ | Joost-Pieter Katoen email: my_last_name[at]cs.rwth-aachen.de | | RWTH Aachen University URL: moves.rwth-aachen.de/~katoen | | LS2: Software Modeling and Verification tel: +49 241 8021200 | | D-52056 Aachen, Germany fax: +49-241 8022217 | +---------------------------------------------------------------+ From sandra at dcc.fc.up.pt Wed Dec 7 13:14:40 2011 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Wed, 7 Dec 2011 18:14:40 +0000 Subject: [TYPES/announce] LINEARITY 2012 - Second call-for-papers Message-ID: Call for Papers Second International Workshop on Linearity http://sites.google.com/site/linearity2012/ Tallinn, Estonia 1 April 2012 An associated event of ETAPS 2012, European Joint Conferences on Theory and Practice of Software =================================================================== 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. Topics of interest include foundational calculus, models, applications to programming languages and systems. This includes (but is not limited to): * Linear types: session types, etc * Linear calculi; * Functional calculi: lambda-calculus, rho-calculus, term and graph rewriting; * Object calculi; * Interaction-based systems: interaction nets, games; * Concurrent models: process calculi, action graphs; * Calculi expressing locality, mobility, and active data; * Quantum computational models; * Biological or chemical models of computation; Important Dates --------------- * 16 December 2011: Abstract deadline (registration with easychair) * 22 December 2011: Submission deadline * 20 January 2012: Author notification * 3 February 2012: Deadline for final versions of accepted papers * 1 April 2012: Workshop Submission and Publication -------------------------- Authors are invited to submit a short paper (5-7 pages). Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PostScript or PDF format, using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/account/signin.cgi? timeout=1;conf=linearity2012 After the workshop authors are invited to submit a revised version (12 pages) of their presentation. After a second round of refereeing, accepted contributions will appear in an issue of Electronic Proceedings in Theoretical Computer Science (www.eptcs.org). Authors and participants will also be invited to submit an article to a special issue of a Journal. Programme Committee ------------------- * Sandra Alves (co-chair) * Maribel Fern?ndez * M?rio Florido * Martin Hofmann * Ian Mackie (co-chair) * Simone Martini * Valeria de Paiva * Simona Ronchi Della Rocca * Alex Simpson Contact ------- Sandra Alves: sandra at dcc.fc.up.pt Ian Mackie: iancmackie at gmail.com From beffara at iml.univ-mrs.fr Wed Dec 7 16:23:45 2011 From: beffara at iml.univ-mrs.fr (Emmanuel Beffara) Date: Wed, 7 Dec 2011 22:23:45 +0100 Subject: [TYPES/announce] Logic and Interaction week - call for contribution and participation Message-ID: <20111207212345.GB3338@chimay> Residential session on LOGIC AND INTERACTION CIRM, Marseille, France Monday February 6 - Friday February 10 as part of LI2012 -- http://li2012.univ-mrs.fr/ Logic and interactions 2012 --------------------------- LI2012 will gather researchers in various fields of ?logic in computer science?, following on the success of the Geocal meeting in 2006. The meeting will run five consecutive weeks, from 30 January to 2 March 2012, each dedicated to a particular area of logic and its interactions. Each week will include lectures, invited talks and contributed talks, together with work sessions. Lectures are aimed primarily at PhD students an non-specialist researchers. Week 2 : Logic and Interaction ------------------------------ The week "Logic and Interaction" is dedicated to the theme of interactive approaches of logic: models and frameworks in which the fundamental mechanism is that of a dialog between proofs and counter-proofs. The session will include lectures, invited talks and contributed talks, together with work sessions. The main axes of focus will be: - the Geometry of interaction programme, aiming at a reconstruction of logic from interaction as the primitive notion, considered as an abstract counterpart of cut elimination, with tutorial both on the well established results and on the most recent developments - the study of mathematical structures that represent dialog processes, in particular Game semantics and Ludics - recent developments at the boundary between mathematical logic and linguistics. The mornings will be structured in tutorials. The afternoons are intended to be a space for the researchers to discuss recent developments and open issues, and will be open to contributions. Researchers and students who wish to speak at this workshop can propose a title and a short abstract, by mail to the three organizers. Organizers ---------- Claudia Faggian Olivier Laurent Myriam Quatrini Invited speakers ---------------- * Lectures - Ugo Dal Lago (Bologna, Italy) - Christophe Fouquer? (Paris, France) - Dan Ghica (Birmingham, UK) - Jean-Yves Girard (Marseille, France) - Martin Hyland (Cambridge, UK) - Alain Lecomte (Paris, France) - Myriam Quatrini (Marseille, France) * Invited talks - Michele Abrusci (Roma, Italy) - Paolo Pistone (Roma, Italy) - Kurt Ranalter (Bolzano, Italy) Important dates --------------- ** Deadline for talk proposals: 15 December 2011 ** Deadline for registration: 19 December 2011 ** Session: 6 February -> 10 February 2012 From umut at mpi-sws.org Thu Dec 8 03:41:09 2011 From: umut at mpi-sws.org (Umut Acar) Date: Thu, 8 Dec 2011 09:41:09 +0100 Subject: [TYPES/announce] Call for Participation to parallelism workshop: DAMP 2012 Message-ID: Making plans for POPL 2012? Please join us for a fun workshop on parallelism co-located with POPL 2012. This year we are honored to have two excellent (invited) speakers, Simon Peyton Jones and Douglas Carmean, who will cover the software and the hardware sides of parallelism. Thanks to the generous support of Intel, our registration rates are at their historic lows. At the workshop, lunch will also be provided, which we hope will make time for more interaction. We look forward to seeing you at DAMP 2012. For more information and program, please visit our web site: http://www.mpi-sws.org/~umut/damp2012/ -- Umut -------------- next part -------------- An HTML attachment was scrubbed... URL: From ggrov at staffmail.ed.ac.uk Thu Dec 8 04:07:03 2011 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Thu, 8 Dec 2011 09:07:03 +0000 Subject: [TYPES/announce] VSTTE 2012: First Call for Participation Message-ID: <5158F1F8-5FEA-47ED-88AF-9E88D356669D@staffmail.ed.ac.uk> ***************************************************************** *** First 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 Note that early registration deadline is December 24, 2011. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From duran at lcc.uma.es Thu Dec 8 05:16:20 2011 From: duran at lcc.uma.es (=?iso-8859-1?Q?Francisco_Dur=E1n?=) Date: Thu, 8 Dec 2011 10:16:20 +0000 Subject: [TYPES/announce] WRLA 2012: last call for papers Message-ID: 9th International Workshop on Rewriting Logic and its Applications WRLA 2012 Tallinn, Estonia, March 24-25, 2012 http://wrla2012.lcc.uma.es/ The workshop will be held in conjunction with ETAPS 2012 14th European Joint Conferences on Theory and Practice of Software March 24 - April 1, 2012 http://www.etaps.org/2012 IMPORTANT DATES December 18, 2011 Deadline for submission January 24, 2012 Author notification February 5, 2012 Final version in electronic form AIMS AND SCOPE Rewriting logic (RL) is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application fields. It also has good properties as a metalogical framework for representing logics. In recent years, several languages based on RL (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the workshop is to bring together researchers with a common interest in RL and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. The topics of the workshop comprise, but are not limited to, - foundations and models of RL; - languages based on RL, including implementation issues; - RL as a logical framework; - RL as a semantic framework, including applications of RL to - object-oriented systems, - concurrent and/or parallel systems, - interactive, distributed, open ended and mobile systems, - specification of languages and systems; - use of RL to provide rigorous support for model-based software engineering; - formalisms related to RL, including - real-time and probabilistic extensions of RL, - rewriting approaches to behavioral specifications, - tile logic; - verification techniques for RL specifications, including - equational and coherence methods, and - verification of properties expressed in first-order, higher-order, modal and temporal logics; - comparisons of RL with existing formalisms having analogous aims; - application of RL to specification and analysis of - distributed systems, - physical systems. PROGRAM COMMITTEE - Emilie Balland, INRIA Bordeaux - Sud-Ouest, France - Artur Boronat, University of Leicester, UK - Mark van den Brand, Eindhoven University of Technology, The Netherlands - Roberto Bruni, University of Pisa, Italy - Manuel Clavel, IMDEA Software & Universidad Complutense de Madrid, Spain - Grit Denker, SRI International, USA - Francisco Duran (chair), Universidad de Malaga, Spain - Steven Eker, SRI International, USA - Santiago Escobar, Universidad Politecnica de Valencia, Spain - Kokichi Futatsugi, JAIST, Japan - Alexander Knapp, Universitat Augsburg, Germany - Dorel Lucanu, Alexandru Ioan Cuza University, Rumania - Salvador Lucas, Universidad Politecnica de Valencia, Spain - Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain - Jose Meseguer, University of Illinois at Urbana-Champaign, USA - Ugo Montanari, Universita di Pisa, Italy - Pierre-Etienne Moreau, Ecole des Mines de Nancy & INRIA Nancy, France - Kazuhiro Ogata, JAIST, Japan - Peter Olveczky, University of Oslo, Norway - Miguel Palomino, Universidad Complutense de Madrid, Spain - Grigore Rosu, University of Illinois at Urbana-Champaign, USA - Vlad Rusu, INRIA Lille Nord-Europe, France - Carolyn Talcott, SRI International, USA - Martin Wirsing, Ludwig-Maximilians-Universit?t, Germany STEERING COMMITTEE - Kokichi Futatsugi, JAIST, Japan - Claude Kirchner, INRIA Research Center Bordeaux - Sud-Ouest, France - Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain - Jose Meseguer, University of Illinois at Urbana-Champaign, USA - Ugo Montanari, Universita di Pisa, Italy - Grigore Rosu, University of Illinois at Urbana-Champaign, USA - Carolyn Talcott, SRI International, USA - Martin Wirsing, Ludwig-Maximillian University, Germany SUBMISSIONS The final program of the workshop will include regular papers, work-in-progress presentations, and invited presentations to be determined. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere. They should be formatted according to the guidelines for Springer LNCS papers, and should be submitted electronically using EasyChair. Papers should not exceed 15 pages. All submissions will be evaluated by the Program Committee. All accepted papers will be presented at the workshop and included in the proceedings, which will be published by the organization of ETAPS. Regular papers and invited presentation papers will also be published in a volume in Springer's Lecture Notes in Computer Science (LNCS) series. Depending on the number and the quality of the contributions, we will consider the preparation of a special issue in some scientific journal in the field with extended versions of a selection of the papers of the workshop. CONTACT INFORMATION For more information, please contact the organizers duran at lcc.uma.es or visit the workshop web page http://wrla2012.lcc.uma.es/ From Simon.Gay at glasgow.ac.uk Thu Dec 8 11:43:11 2011 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Thu, 8 Dec 2011 16:43:11 +0000 Subject: [TYPES/announce] Final CFP: PLACES 2012 Message-ID: <4EE0E91F.70907@glasgow.ac.uk> FINAL CALL FOR PAPERS 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/ ** Important Dates ** Abstract (title & 200 words max): 14th December 2011 Paper Submission: 23:59 (GMT) 21st December 2011 Paper Notification: 23rd January 2012 Final versions of papers: 3rd February 2012 ** 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. ** Topics of Interest ** Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: language design and implementations for communications and/or concurrency, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. ** Invited Speaker ** Benedict Gaster, AMD ** Submission Guidelines ** Authors should submit a title and a 200 word abstract by Wednesday 14th December 2011, to help the PC chairs assign reviewers to papers. Papers of up to five pages in length should be submitted in PDF format by Wednesday 21st December 2011 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=places2012 Preliminary proceedings will be available at the workshop. We intend to publish a post-proceedings in EPTCS. The submission deadline is strict and will not be extended. Enquiries can be sent to the PC co-chairs. ** 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 manuel.mazzara at newcastle.ac.uk Thu Dec 8 13:23:08 2011 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Thu, 8 Dec 2011 18:23:08 +0000 Subject: [TYPES/announce] 1st International Workshop on Trustworthy Multi-Agent Systems (TruMAS'12) Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA30731E9CF1A6@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. Please remember to select the TruMAS invited session entry 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 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 Daniel Villatoro, Artificial Intelligence Research Institute, Spanish Scientific Research Council, Spain Mirko Viroli, DEIS, University of Bologna, Italy (not complete yet) From pmt6sbc at maths.leeds.ac.uk Sat Dec 10 13:55:09 2011 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Sat, 10 Dec 2011 18:55:09 GMT Subject: [TYPES/announce] Turing Centenary Conference, Cambridge, June 18-23, 2012 Message-ID: <201112101855.pBAIt9pZ015114@maths.leeds.ac.uk> ********************************************************************** SECOND 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 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 (Washington/ Oxford, Microsoft Research Lecture), Stuart Shieber (Harvard), Paul Smolensky (Johns Hopkins) and Leslie Valiant (Harvard, jointly organised lecture with King's College). SUBMISSION OF PAPERS and 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 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. 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 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: * The Universal Turing Machine, and History of the Computer Chairs: Jack Copeland and John Tucker * 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 thiemann at informatik.uni-freiburg.de Sun Dec 11 07:04:34 2011 From: thiemann at informatik.uni-freiburg.de (Peter Thiemann) Date: Sun, 11 Dec 2011 23:04:34 +1100 Subject: [TYPES/announce] Final CFP FLOPS 2012 Message-ID: <4EE49C52.3050303@informatik.uni-freiburg.de> Final Call For Papers ===================== _EXTENDED SUBMISSION DEADLINE : December 16, 2011_ *Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012)* May 23-25, 2012 Kobe, Japan [http://www.org.kobe-u.ac.jp/flops2012/] 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. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), Ise (2008), and Sendai (2010). Topics ====== FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to): - Declarative Pearls: new and excellent declarative programs with illustrative applications. - Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing. - Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems. - Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism. - Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking. The proceedings will be published as an LNCS volume. The proceedings of the previous meeting (FLOPS 2010) were published as LNCS 6009. PC co-Chairs ============ - Tom Schrijvers (Ghent University, Belgium) - Peter Thiemann (University of Freiburg, Germany) PC Members ========== - Salvador Abreu (University of Evora, Portugal) - Thorsten Altenkirch (University of Nottingham, UK) - Sebastian Brand (NICTA, Australia) - Giuseppe Castagna (CNRS Univ Paris 7, France) - Sebastian Fischer (Germany) - Marco Gavanelli (University of Ferrara, Italy) - Joxan Jaffar (National University of Singapore, Singapore) - Barry Jay (University of Sydney, Australia) - Andy King (University of Kent, UK) - Claude Kirchner (INRIA, France) - Neelakantan R. Krishnaswami (Microsoft Cambridge, UK) - Yulya Lierler (University of Kentucky, USA) - Keiko Nakata (Tallinn University of Technology, Estonia) - Peter Schneider-Kamp (University of Southern Denmark, Denmark) - Olin Shivers (Northeastern University, USA) - Paul Tarau (University of Northern Texas, USA) - Kazunori Ueda (Waseda University, Japan) - Meng Wang (Chalmers Technical University, Sweden) General Chair and Local co-Chairs ================================= - Naoyuki Tamura (Kobe University, Japan) - Mutsunori Banbara (Kobe University, Japan) - Katsutoshi Hirayama (Kobe University, Japan) Submission ========== Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Submissions should fall into one of the following categories: - Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. - System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. Submissions must be written in English and can be up to 15 pages long, though pearls are typically considerably shorter. Authors are required to use LaTeX2e and the Springer llncs class file, available at [http://www.springer.de/comp/lncs/authors.html]. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a web page, or an appendix). Papers should be submitted electronically at [https://www.easychair.org/conferences/?conf=flops2012]. Important Dates =============== - Submission deadline : December 16, 2011 (EXTENDED) - Author notification : February 3, 2012 - Camera-ready copy : March 2, 2012 Place and Related Events ======================== Takikawa Memorial Hall, Kobe University, 1-1 Rokkodai, Nada, Kobe 657-8501 Japan. 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. Some Previous FLOPS =================== - FLOPS 2010, Sendai: [http://www.kb.ecei.tohoku.ac.jp/flops2010/] - FLOPS 2008, Ise: [http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/] - FLOPS 2006, Fuji Susono: [http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/] Sponsors ======== - Japan Society for Software Science and Technology (JSSST) SIGPPL In Cooperation with =================== - ACM SIGPLAN - Asian Association for Foundation of Software (AAFS) - Association for Logic Programming (ALP) From patrick.baillot at ens-lyon.fr Sun Dec 11 16:52:32 2011 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Sun, 11 Dec 2011 22:52:32 +0100 Subject: [TYPES/announce] Complexity School @LI2012 : call for participation Message-ID: <20111211225232.12591orw1a7afmlc@webmail.ens-lyon.fr> ============================================================ LOGIC AND INTERACTIONS 2012 CIRM, MARSEILLE COMPLEXITY WINTER SCHOOL (Week 1) 30 JANUARY- 3 FEBRUARY http://li2012.univ-mrs.fr/programme/week1/ ------------------------------------------------------------------------ The "Logic and interactions 2012" session will gather researchers in various fields of "logic in computer science". The meeting will run five consecutive weeks, from 30 January to 2 March 2012, each dedicated to a particular area of logic and its interactions. Each week will include lectures, invited talks and contributed talks, together with work sessions. Lectures are aimed primarily at PhD students and non-specialist researchers. ------------------------------------------------------------------------ CALL FOR CONTRIBUTIONS - COMPLEXITY WINTER SCHOOL **NEW [04/12/2011]**: a preliminary programme is available from the web page. ---------------------- SUBMISSION PROCEDURE ---------------------- This is a call for abstracts for contributed talks in the week. Abstract and title must be submitted electronically to the three organizers: patrick.baillot at ens-lyon.fr, nadia.creignou at lif.univ-mrs.fr, jean-yves.marion at loria.f Submissions of abstracts on published work are allowed. ----------------- IMPORTANT DATES ----------------- Abstract submission: December, 15th 2011 Registration: December 19th 2011 (After this date, we cannot guarantee accommodation) Notification for abstracts submitted: January, 3rd, 2012 ------------------- SCOPE OF THE WEEK ------------------- The theme of this week is the logical approach to logical complexity. The last decade has seen the development of logical formalisms derived from linear logic that characterize functions computable in various complexity classes (polynomial or elementary in time, logarithmic in space) in an implicit way, that is to say by contruction of the languages instead of using explicit measures. The theory that underlies these formalisms naturally meets the more established tradition of studying the complexity of algorithmic problems from logic (satisfiability, constraints solving, etc). The goal of this week is to survey the various aspects of the theory of algorithmic complexity where these communities meet, so as to trigger new interactions and enrich the various approaches. ------------------ LECTURERS ------------------ * Martin Hofmann (LMU, Munich, Germany): Pure pointer programs (implicit computational complexity with an abstract datatype of pointers) * Yiannis N. Moschovakis (UCLA, USA): Relative complexity in arithmetic and algebra * Stefan Szeider (TU Wien, Austria): Parameterized complexity * Heribert Vollmer (Leibniz Universit?t, Hannover, Germany): Circuit complexity ------------------ INVITED SPEAKERS ------------------ * Emmanuel Hainry (Nancy): Computable Analysis: Computability and complexity over the reals * Neil Jones (Copenhagen): Alan Turing and 75 years of Research in Models of Computation * Virgile Mogbil (Paris 13) : Parallel computation with Boolean proof nets The morning sessions will consist in tutorials given by invited speakers while the afternoons will be devoted to shorter presentations and contributed talks. Participants are welcome to submit a contribution (see the procedure above), but this is not mandatory. ------------------ REGISTRATION ------------------ There are no registration fees. Accomodation at the CIRM should be available for all participants: the only condition is to register on time. Pre-registration is now open on the web site. Once your pre-registration is validated, you will be contacted by the CIRM for the actual registration and booking. ------------------ GRANTS ------------------ Accommodation at the CIRM is funded for all participants requiring it: simply select the appropriate option in the pre-registration form. FYI: The standard rate for staying at the CIRM, including breakfast and two meals each day is 82 (double room) to 90 (single room) euros per day. We might also provide a limited amount of travel grants for students. To apply for such a grant, be sure to check the corresponding box of the pre-registration form: we will contact you directly for further information. ------------ ORGANIZERS ------------ * Patrick Baillot (LIP, ENS Lyon) * Nadia Creignou (LIF, Marseille) * Jean-Yves Marion (LORIA, Nancy) ============================================================================= From Pieter.Philippaerts at cs.kuleuven.be Mon Dec 12 10:31:14 2011 From: Pieter.Philippaerts at cs.kuleuven.be (Pieter Philippaerts) Date: Mon, 12 Dec 2011 16:31:14 +0100 Subject: [TYPES/announce] ESSoS Doctoral Symposium: Call for Contributions Message-ID: <011801ccb8e3$15a6c640$40f452c0$@Philippaerts@cs.kuleuven.be> The ESSoS Doctoral Symposium 2012 (ESSoS-DS) will be held in Eindhoven, The Netherlands on Wednesday, February 15, 2012 in conjunction with the ESSoS 2012 Symposium. ESSoS-DC 2012 aims at providing PhD students an opportunity to discuss their research in Engineering Secure Software and Systems (ESSoS) in an international forum, and with a panel of well-known experts in the field. The goal of the Doctoral Symposium is to provide students with a welcoming atmosphere to present their research and receive useful feedback from senior researchers. It will be as well a good opportunity for meeting and sharing experiences with other PhD students addressing similar topics or at a similar stage in their doctoral work. This way the students will obtain guidance both on the academic content of their current work and regarding the potential future research trajectories. PhD students carrying out research in Engineering Secure Software and Systems are invited to submit a position paper to the PhD Symposium. Papers will be peer-reviewed by the Symposium's program committee members. The criteria used for accepting a paper include potential quality of the research, contribution of the work to the ESSoS field, originality of the work, and overall quality of the position paper. PhD proposals fitting to the ESSoS conference topics are especially encouraged. This includes a diversity of topics such as 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 DSL'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 . support for assurance, certification and accreditation Accepted position papers will be presented during the ESSOS 2012 Doctoral Symposium and will be published at the NESSoS website. Position papers have to fulfill the following requirements. . Length: Position papers must not be longer than four pages. . Format: Submissions should be formatted according to the LNCS guidelines. . Content: o author's name o affiliation o an abstract (maximum 200 words) o the name of the student's PhD supervisor(s) o the problem(s) that the proposed research is going to solve, and the motivation for solving them o the aims and objectives of the proposed research o the research methodology to be used to achieve the research goals, including a brief description of the work done to date and a tentative research plan for future work o the main contribution(s) of the research to the field of Engineering Secure Software and Systems . Submission place: Authors should use the Doctoral Symposium Submission site at EasyChair for the submission of their manuscripts Important Dates . Paper submission deadline: January 11 . Notification of Acceptance: January 30 . Camera Ready Version: February 7 More information about this doctoral symposium can be found at http://distrinet.cs.kuleuven.be/events/essos/2012/cftut/ Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm -------------- next part -------------- An HTML attachment was scrubbed... URL: From georg.moser at uibk.ac.at Tue Dec 13 02:35:08 2011 From: georg.moser at uibk.ac.at (Georg Moser) Date: Tue, 13 Dec 2011 08:35:08 +0100 Subject: [TYPES/announce] WST 2012: Second Call For Papers Message-ID: <4EE7002C.6050704@uibk.ac.at> ====================================================================== Second Call for Papers WST 2012 12th International Workshop on Termination Feb 19 - 23, 2012, Obergurgl, Innsbruck http://cl-informatik.uibk.ac.at/users/georg/events/wst2012/ ====================================================================== 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. We will work very hard to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications. IMPORTANT DATES (NEW): * submission January 15, 2012 * notification January 22, 2012 * final version February 5, 2012 * workshop February 19 - 23, 2012 TOPICS: The 12th International Workshop on Termination welcomes contributions on all aspects of termination and complexity analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) are particularly welcome. Areas of interest to the workshop include, but are not limited to, the following: * Termination of programs * Termination of rewriting * Termination analysis of transition systems * Complexity of programs * Complexity of rewriting * Implicit computational complexity * Implementations of termination and complexity analysis methods * Certification of termination and complexity proofs * Termination orders, well-founded orders, and reduction orders * Termination methods for theorem provers * Strong and weak normalization of lambda calculi * Termination analysis for different language paradigms * Challenging termination problems/proofs * Applications to program transformation and compilation * Other applications of termination methods * Comparisons and classification of termination methods * Non-termination and loop detection * Termination in distributed systems * Proof methods for liveness and fairness * Well-quasi-order theory * Ordinal notations * Subrecursive hierarchies PROGRAM COMMITTEE: * Ugo Dal Lago (University of Bologna) * Danny De Schreye (K.U. Leuven) * J?rg Endrullis (VU University Amsterdam) * Samir Genaim (The Complutense University) * Nao Hirokawa (JAIST) * Georg Moser (University of Innsbruck, chair) * Albert Rubio (Universitat Politecnica de Catalunya) * Peter Schneider-Kamp (University of Southern Denmark) * Rene Thiemann (University of Innsbruck) 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). From S.J.Thompson at kent.ac.uk Tue Dec 13 16:20:34 2011 From: S.J.Thompson at kent.ac.uk (Simon Thompson) Date: Tue, 13 Dec 2011 21:20:34 +0000 Subject: [TYPES/announce] Call for papers: Workshop on Turing's Legacy at BMC 2012, Canterbury, UK Message-ID: <260EB079-12BC-4AB8-A921-AA6431D3ECE3@kent.ac.uk> Workshop on Turing's Legacy in Mathematics and Computer Science BMC 2012, Canterbury, Kent, 16-19 April 2012 Call for Contributions The 2012 British Mathematical Colloquium will take place at the University of Kent 16-19 April 2012, in the centenary year of Alan Turing's birth. Solomon Feferman (Stanford) will give a plenary presentation on mathematical aspects of Turing's work and Andrew Hodges, author of "Alan Turing: the Enigma", will give a public lecture on Turing's life and work. Other lectures will be given by David Harel (Weizmann Institute of Science) on modelling biological systems and Sue Black (UCL) on Blectchley Park. This workshop - which will take place on the afternoons of 17 and 18 April - seeks participants from mathematics, computer science, artificial intelligence, philosophy and biosciences to address Turing's legacy in these fields. Talks are typically 30 minutes, but short talks and demonstrations as well as other formats, are actively encouraged. Submissions for the workshop to be send to SImon Thompson, School of Computing, University of Kent: email s.j.thompson at kent.ac.uk More details of the BMC at http://www.kent.ac.uk/IMS/events/160412.html Online registration for the BMC is now available at http://store.kent.ac.uk/browse/product.asp?catid=20&modid=2&compid=1 Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson at kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt From wasowski at itu.dk Tue Dec 13 16:28:16 2011 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Tue, 13 Dec 2011 22:28:16 +0100 Subject: [TYPES/announce] 2nd International PhD School on Quantitative Model Checking Message-ID: <4EE7C370.6@itu.dk> Call for Participation: 2nd International PhD School on Quantitative Model Checking Copenhagen 27 Feb - 1 Mar This is the first 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. 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 georg.moser at uibk.ac.at Tue Dec 13 18:05:32 2011 From: georg.moser at uibk.ac.at (Georg Moser) Date: Wed, 14 Dec 2011 00:05:32 +0100 Subject: [TYPES/announce] RTA 2012: Second Call For Papers Message-ID: <4EE7DA3C.6010001@uibk.ac.at> ******************************************************** * Second Call For Papers * * 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 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) is the major forum for the presentation of research on rewriting. IMPORTANT DATES: Abstract: Jan 04, 2012 Paper Submission: Jan 09, 2012 Notification: Mar 02, 2012 Final version: Mar 26, 2012 RTA 2012 seeks original submissions 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; * Foundations: equational logic; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; combination; * 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; * Implementation: implementation techniques; parallel execution; rewrite and completion tools; confluence and termination checking; certification of rewriting properties; abstract machines; explicit substitutions; BEST PAPER AWARD: An award is given to the best paper or papers as decided by the program committee. STUDENT SUPPORT: Limited student support will be available and announced in future versions of this call. PROGRAMME COMMITTEE CHAIR: * Ashish Tiwari SRI International, Menlo Park, CA http://www.csl.sri.com/users/tiwari PROGRAMME COMMITTEE: * Andreas Abel Ludwig-Maximilians-University Munich * Zena Ariola University of Oregon * Paolo Baldan Universit? degli Studi di Padova * Ahmed Bouajjani University of Paris 7 * Evelyne Contejean LRI Universit? Paris-Sud-CNRS * Ir?ne Anne Durand LaBRI Universit? of Bordeaux * J?rg Endrullis Vrije Universiteit Amsterdam * Silvio Ghilardi Universit? degli Studi di Milano * Guillem Godoy Universidad Polit?cnica de Catalu?a * Nao Hirokawa Japan Advanced Institute of Science and Technology * Deepak Kapur University of New Mexico, Albuquerque, NM * Jordi Levy IIIA - CSIC * Paul-Andre Mellies University of Paris 7 * Pierre-Etienne Moreau Ecole des Mines de Nancy * Joachim Niehren INRIA Lille * Grigore Rosu University of Illinois at Urbana-Champaign * Albert Rubio Universidad Polit?cnica de Catalu?a * Masahiko Sakai Nagoya University * Carolyn Talcott SRI International * Ren? Thiemann University of Innsbruck CONFERENCE CHAIR: * Masahiko Sakai Nagoya University INVITED SPEAKERS: * Hirokazu Anai Fujitsu Labs. & Kyushu University * Claude Kirchner INRIA & LORIA * Sebastian Maneth NICTA & Univ. of New South Wales PUBLICATION: RTA 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. STACS, FSTTCS and ICLP proceedings also appear in LIPIcs. See http://www.dagstuhl.de/en/publications/lipics for more information about LIPIcs. Accepted papers will be considered for publication in a special issue of the journal Logical Methods in Computer Science (LMCS). SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers, applications of rewriting techniques, problem sets, and system descriptions. The page limit for submissions is 10 proceedings pages for system descriptions and 15 proceedings pages for all other categories. Additional material may be provided 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. Submissions are accepted in either Postscript or PDF format. Abstracts and papers must be submitted electronically through the EasyChair system at: http://www.easychair.org/conferences/?conf=RTA2012 Questions concerning submissions may be addressed to the PC chair, Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com From dpw at cs.princeton.edu Tue Dec 13 20:03:29 2011 From: dpw at cs.princeton.edu (David Walker) Date: Tue, 13 Dec 2011 20:03:29 -0500 (EST) Subject: [TYPES/announce] Off The Beaten Track: Call for Participation In-Reply-To: <24e1cf6b-8ea1-447e-b42a-9e2a1ed2bb0d@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <7f742ae1-12a6-4ff8-a0b3-da2c7981997f@suckerpunch-mbx-0.CS.Princeton.EDU> Off The Beaten Track: Underrepresented Problems for Programming Language Researchers http://www.cs.princeton.edu/~dpw/obt/ A Workshop Co-located with POPL 2012 Philadelphia, USA January 28, 2012 Come and join us for OBT -- we have a great program filled with a diverse set of problems and ideas for programming language researchers. And at the end of the day, we will have an open mic session to discuss directions for the PL community. Our program is now up here: http://www.cs.princeton.edu/~dpw/obt/obt_program.html And you can register here: https://regmaster3.com/2012conf/POPL12/register.php A broader explanation of the workshop goals: 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 the goal for Off the Beaten Track. 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. From paulo.oliva at eecs.qmul.ac.uk Wed Dec 14 01:56:22 2011 From: paulo.oliva at eecs.qmul.ac.uk (Paulo Oliva) Date: Wed, 14 Dec 2011 06:56:22 +0000 Subject: [TYPES/announce] Three UK Post-graduate PhD studentships in TOC Message-ID: <8512A5FB-F98D-44FE-8145-EA501688F8BE@eecs.qmul.ac.uk> THREE POST-GRADUATE PHD STUDENTSHIPS IN THEORETICAL COMPUTER SCIENCE [Eligibility: UK student or EU student who has been living in the UK for the past 3 years] School of Electronic Engineering and Computer Science Queen Mary University of London Applications are invited for three PhD Studentships starting in September 2012 * Paul Curzon, Formal verification of healthcare information systems * Ursula Martin, Crowdsourced math: doing mathematics on the web * Paulo Oliva, Game theory and higher-order computability The students will be part of the School of Electronic Engineering and Computer Science (EECS) www.eecs.qmul.ac.uk at Queen Mary, University of London, in the Theory Group, www.eecs.qmul.ac.uk/research/logic/QM-EECS-TCS The group has a world-leading reputation for fundamental theoretical work, with practical impact on understanding and creating robust reliable software. The group comprises 30 academic and research staff, and formed around a third of QMUL?s RAE 2008 Computer Science submission, ranked 8th in the UK for output quality. Recent strategic investment has included a new Professor, Byron Cook (a joint appointment with Microsoft Research, who also sponsor O?Hearn?s chair through the Royal Academy of Engineering); and 3 new lecturers. The group holds 8 competitive external fellowships from EPSRC, Royal Academy of Engineering and Royal Society; ?14 million in external funding, including ?10 million from EPSRC; and ?800K from industry and UK and US government agencies. Major EPSRC projects include two multimillion programme grants (O?Hearn, Cook; Curzon), and a ?3 million Knowledge Transfer grant (Martin). For further details and instructions on how to apply see: http://www.eecs.qmul.ac.uk/research/logic/QM-EECS-TCS/PhDEPSRCTheory.pdf -- Paulo Oliva Royal Society University Research Fellow Queen Mary University of London London E1 4NS +44 (0) 207 882 5255 http://www.dcs.qmul.ac.uk/~pbo -------------- next part -------------- An HTML attachment was scrubbed... URL: From pmt6sbc at maths.leeds.ac.uk Wed Dec 14 05:25:05 2011 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Wed, 14 Dec 2011 10:25:05 GMT Subject: [TYPES/announce] Turing Fellowships - extended deadline, 21 Decemebr, 2011 Message-ID: <201112141025.pBEAP5hO029096@maths.leeds.ac.uk> The Turing Fellowships and Scholarships Competition - The final deadline is now: WEDNESDAY 21 DECEMBER 2011 - a small extension to the deadline in response to requests. The 3-year Turing Centenary Research Project - "Mind, Mechanism and Mathematics" starts in July 2012, and is funded by a grant from the John Templeton Foundation. As part of the Alan Turing Year, proposals are invited for: *** Five Turing Research Fellowships for researchers no more than 10 years from the award of a PhD relevant to their proposed research, value 75,000 UK pounds each, and *** Three Turing Scholarships for gifted younger researchers of age up to 25 years old, value 45,000 UK pounds each over the three years. Each Award may be held at a location of the winner's choice, and may be held as a valuable supplement to other funding. For further details of eligibility etc, please see the How to Apply webpage at the Alan Turing Year website: http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?409 The Research Project will address a number of major questions related to the Turing legacy, and are listed at the Turing Centenary Research Project webpage: http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408 under four main headings: 1. The Mathematics of Emergence: The Mysteries of Morphogenesis 2. Possibility of Building a Brain: Intelligent Machines, Practice and Theory 3. Nature of Information: Complexity, Randomness, Hiddenness of Information 4. How should we compute? New Models of Logic and Computation. Important Dates: Submission deadline December 21, 2011 Award Notification March 31, 2012 Award Ceremony Turing Centenary day, June 23, 2012 Commencement of the research project July 1, 2012 Completion of the research project June 30, 2015 Winners will be expected to attend the award ceremony at the Turing Centenary Conference in Manchester, 22 - 25 June, 2012. The members of the Competition Judging Panel are: Samson Abramsky (Oxford) Manindra Agrawal (Kanpur) Eric Allender (Rutgers) Rodney Downey (Wellington) Luciano Floridi (Hertfordshire/Oxford) Barbara Grosz (Harvard) Stuart Kauffman (Vermont/Santa Fe) Hans Meinhardt (Max Planck Institute) Cris Moore (New Mexico/Santa Fe) Gordon Plotkin (Edinburgh) Aaron Sloman (Birmingham) Robert I. Soare (Chicago) The Judging Panel is Chaired by S. Barry Cooper (Leeds) __________________________________________________________________________ From jonathan.aldrich at cs.cmu.edu Wed Dec 14 10:38:23 2011 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Wed, 14 Dec 2011 10:38:23 -0500 Subject: [TYPES/announce] Ph.D./postdoc/scientist positions: PL/types for secure mobile web Message-ID: <4EE8C2EF.2000304@cs.cmu.edu> ** Note: deadline for Ph.D. applications is TOMORROW Dec 15 ** At Carnegie Mellon University we are beginning a 3-5 year project focused on languages and type systems for secure mobile web applications. Our goal is to evaluate the hypothesis that many security vulnerabilities in web-based mobile applications are a consequence of expressing programs at a low level of abstraction. We believe that a lightweight, pragmatic language- and type-based approach to expressing web-based mobile applications at a higher level of abstraction can make security properties explicit and more directly relate those properties to the code that enforces them. Such an approach could reduce or eliminate important classes of security vulnerabilities while also increasing productivity. Research topics of interest include type system and programming language support for security, web programming abstractions, structured and semi-structured data, software frameworks, empirical user studies, and verification. Our style of research combines a grounding in mathematical models and theory with insights and empirical evaluation methodologies from software engineering. More information on the project and the positions below will be available at http://www.cs.cmu.edu/~aldrich/securemobileweb/ Ph.D. Positions - DECEMBER 15th deadline Multiple Ph.D. positions are available in topics listed in the project description above. Interested applicants should apply to CMU's Ph.D. programs in Software Engineering or Computer Science. The deadline is TOMORROW DECEMBER 15. In view of the late notice (the project was approved only yesterday) it is usually possible to consider very strong applicants even if recommendation letters and scores arrive a bit after the 15th--but they should still be sent in as soon as possible. Apply at: http://www.cs.cmu.edu/prospectivestudents/doctoral/application.html Postdoctoral Researcher Position We anticipate hiring at least one postdoctoral researcher, and possibly two. Responsibilities will include contributing to the overall research program outlined above and contributing to advising of students at all levels. Teaching opportunities are available if desired. Compensation will be competitive with typical US academic postdoctoral positions. The initial appointment will be for one year, potentially renewable for 1-2 additional years. Applicants should have a Ph.D. in computer science or a related field and a strong programming language research record, with expertise in some or all of the following areas: type theory, security, program analysis, databases, distributed and web systems, software design, empirical user studies, and verification. The positions could begin as soon as late January or February 2012, so interested applicants should send a CV and contact information for three references to jonathan.aldrich at cs.cmu.edu ASAP. The positions will, however, remain open until filled. Research Programmer or System Scientist Position We also anticipate a position for a research programmer or system scientist; the title will depend on the interests and qualifications of the selected applicant, and compensation will be competitive with comparable US academic positions. A research programmer would focus on development of a compiler and related tools in support of the project described above. An understanding of type theory and familiarity with compilers is essential. Responsibilities of a system scientist would include perhaps 50% of time spent developing software, but in addition would include contributing to day-to-day management and the overall research direction of the project, assisting with advising students, and assisting with possible follow-on funding opportunities. A system scientist should have a Ph.D. in computer science or a related field, development experience with compilers, knowledge of type theory, and a strong programming language research record. Expertise in some or all of the following additional areas is helpful: security, program analysis, databases, distributed and web systems, software design, empirical user studies, and verification. Interested applicants should send a CV and contact information for three references to to jonathan.aldrich at cs.cmu.edu by January 15, 2012, though the position will be open until filled. From dale at lix.polytechnique.fr Wed Dec 14 12:11:40 2011 From: dale at lix.polytechnique.fr (Dale Miller) Date: Thu, 15 Dec 2011 01:11:40 +0800 Subject: [TYPES/announce] IJCAR 2012: 2nd Call for Papers Message-ID: ---------------------------------------------------------------------- Second Call For Papers --- IJCAR 2012 6th International Joint Conference on Automated Reasoning Manchester, UK, June 26-July 1, 2012 http://ijcar.cs.manchester.ac.uk/ Important Dates (all in 2012) Abstract submission January 23 Final version due April 16 Paper submission January 30 Conference dates June 26-29 Notification March 26 Satellite events June 30-July 1 IJCAR is the premier international joint conference on all topics in automated reasoning. IJCAR 2012, the 6th International Joint Conference on Automated Reasoning, is a merger of leading events in automated reasoning: CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), FTP (International Workshop on First-order Theorem Proving), and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). Previous editions of IJCAR took place in Siena (2001), Cork (2004), Seattle (2006), Sydney (2008) and Edinburgh (2010), cf. http:/ /www.ijcar.org/. IJCAR 2012 is held as part of the Alan Turing Year 2012 just after The Alan Turing Centenary Conference in Manchester. Scope: IJCAR 2012 invites submissions related to all aspects of automated reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems are solicited. Logics of interest include: propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, metalogics, type theory, and set theory. Methods of interest include: tableaux, sequent calculi, resolution, model-elimination, connection method, inverse method, paramodulation, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, AI-related methods for deductive systems, proof presentation, efficient datastructures and indexing, integration of computer algebra systems and automated theorem provers, and combination of logics or decision procedures. Applications of interest include: verification, formal methods, program analysis and synthesis, computer mathematics, declarative programming, deductive databases, knowledge representation, natural language processing, linguistics, robotics, and planning. Submission: Submission is electronic through https://www.easychair.org/conferences/?conf=ijcar2012 Authors are strongly encouraged to use LaTeX and the Springer llncs class file, which can be obtained from http://www.springer.de/comp/lncs/authors.html. The page limit is 15 pages for full papers and 7 pages for system descriptions. All papers will be evaluated according to originality, significance, technical quality, and readability. Submitted papers must be original and not submitted for publication elsewhere. For more details concerning submission see the conference web site. The proceedings of IJCAR 2012 will be published by Springer-Verlag in the LNAI/LNCS series. Student Travel Awards: Travel awards will be available to enable selected students to attend the conference. Details will be available in early 2012. Conference Chairs Konstantin Korovin, University of Manchester, UK Andrei Voronkov, University of Manchester, UK Program Chairs Bernhard Gramlich (TU Wien, Austria) Dale Miller (INRIA Saclay, France) Ulrike Sattler (University of Manchester, UK) Program Committee Takahito Aoto, Tohoku University, Japan Franz Baader, TU Dresden, Germany Peter Baumgartner, NICTA, ANU, Australia Maria Paola Bonacina, Universita degli Studi di Verona, Italy Torben Bra?ner, Roskilde University, Denmark Michael Fink, TU Wien, Austria Jacques Fleuriot, University of Edinburgh, UK Silvio Ghilardi, Universita degli Studi di Milano, Italy J?rgen Giesl, RWTH Aachen ,Germany Bernhard Gramlich, TU Wien, Austria Reiner H?hnle, Chalmers University of Technology, Sweden Florent Jacquemard, ENS de Cachan, France Deepak Kapur, University of New Mexico, Albuquerque, USA Yevgeni Kazakov, University of Oxford, UK H?l?ne Kirchner, INRIA Rocquencourt, France Konstantin Korovin, University of Manchester, UK Martin Lange, Universit?t Kassel, Germany St?phane Lengrand, LIX, Ecole Polytechnique, France Christoph L?th, DFKI & Universit?t Bremen, Germany Carsten Lutz, Universit?t Bremen, Germany Christopher Lynch, Clarkson University, Potsdam, USA George Metcalfe, Universit?t Bern, Switzerland Dale Miller, INRIA Saclay, France Aleksandar Nanevski, IMDEA Software, UPM, Madrid, Spain Tobias Nipkow, TU M?nchen, Germany Hans de Nivelle, University of Wroclaw, Poland Albert Oliveras, UPC, Barcelona, Spain Nicolas Peltier, LIG/IMAG, Grenoble, France Frank Pfenning, CMU, Pittsburgh, USA Grigore Rosu, University of Illinois at Urbana-Champaign, USA Micha?l Rusinowitch, LORIA/INRIA-Lorraine, Nancy France Ulrike Sattler, University of Manchester, UK Viorica Sofronie-Stokkermans, MPI f?r Inf., Saarbr?cken, Germany Georg Struth, University of Sheffield, UK Aaron Stump, University of Iowa, Iowa City, USA Geoff Sutcliffe, University of Miami, USA Ren? Thiemann, University of Innsbruck, Austria Cesare Tinelli, University of Iowa, Iowa City, USA Alwen Tiu, ANU, Canberra, Australia Bow-Yaw Wang, Academia Sinica, Taipei, Taiwan Christopher Weidenbach, MPI f?r Informatik, Saarbr?cken, Germany Michael Zakharyashev, Birkbeck College, London, UK Hans Zantema, Eindhoven University of Technology, The Netherlands Satellite Event Chair: Birte Glimm, University Ulm, Germany Competitions Chair: Geoff Sutcliffe, University of Miami, USA Further Information: For further and up-to-date information about IJCAR 2012 visit http://ijcar.cs.manchester.ac.uk/. ---------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From gjbarthe at gmail.com Wed Dec 14 14:25:04 2011 From: gjbarthe at gmail.com (Gilles Barthe) Date: Wed, 14 Dec 2011 20:25:04 +0100 Subject: [TYPES/announce] Ph.D. and postdoctoral positions at IMDEA Software Institute Message-ID: The IMDEA Software Institute (Madrid, Spain) has several openings at the Ph.D. and post-doctoral levels. The positions are attached to the computer-aided security proofs project, which develops language-based methods and tools for the verification of cryptographic systems: http://software.imdea.org/projects/certicrypt We seek applicants with a strong background in at least one of the following fields: * cryptography * language-based security * program analysis and program verification * automated and interactive proofs Successful applicants are expected to contribute to the development of the CertiCrypt toolset, and must have an interest to carry research at the intersection between programming languages, formal verification, and cryptography. Post-doctoral positions are for one year, with the possibility of renewal for up to four years. Ph.D. positions are for four years, subject to satisfactory progress. Starting date is negotiable. For further information, please contact Gilles Barthe (gilles.barthe at imdea.org). Application materials are available at the URL: https://www.imdea.org/internationalcall/Default.aspx?IdInstitute=17 When completing your application, please indicate "Computer-Aided Cryptographic Proofs" in the research lines. Applications must be received by January 30, 2012 to receive full consideration. However, applications will continue to be accepted until the positions are filled. Salaries Salaries at the institute are internationally competitive. Employees have access to an excellent public healthcare system. Work Environment The institute is located in the vibrant area of Madrid, Spain, and offers an ideal working environment where researchers can focus on developing new ideas and projects. The working language is English. For more information please visit the web pages of the IMDEA Software Institute at www.software.imdea.org The IMDEA Software Institute is an Equal Opportunity Employer and strongly encourages applications from a diverse and international community. The institute complies with the European Charter for Researchers. From Jeremy.Gibbons at cs.ox.ac.uk Thu Dec 15 11:00:03 2011 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Thu, 15 Dec 2011 16:00:03 +0000 Subject: [TYPES/announce] Mathematics of Program Construction: Second Call for Papers Message-ID: <201112151600.pBFG03o4014096@jet2.cs.ox.ac.uk> SECOND CALL FOR PAPERS 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 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. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), and Qu?bec City, Canada (2010, colocated with AMAST). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. INVITED SPEAKERS * Gilles Barthe, IMDEA Software Institute (http://software.imdea.org/people/gilles.barthe/) * Dan Ghica, University of Birmingham (http://www.cs.bham.ac.uk/~drg/) * Tony Hoare, Microsoft Research (http://research.microsoft.com/en-us/people/thoare/) IMPORTANT DATES * Submission of abstracts 09 January 2012 * Submission of full papers 16 January 2012 * Notification to authors: 19 March 2012 * Final version: 16 April 2012 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 09 January 2012. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 16 January 2012. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=mpc2012). Papers must report previously unpublished work, and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2012 at easychair.org with any questions about academic matters. The proceedings of MPC 2012 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, we plan that the authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. 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 Macquarie University, 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 Radboud Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA VENUE The conference will take place in Madrid, the capital of Spain, in the Facultad de Medicina of Universidad Complutense de Madrid. The Faculty of Medicine is located 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 hotel. 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 jfrazee at mail.utexas.edu Thu Dec 15 11:07:17 2011 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Thu, 15 Dec 2011 10:07:17 -0600 Subject: [TYPES/announce] NASSLLI 2012: CfPart Message-ID: <6AF28DC779364897BB57B1645843C1F7@gmail.com> NASSLLI 2012 is Open for Registration! The fifth North American Summer School in Logic, Language, and Information, NASSLLI 2012, will be hosted at the University of Texas at Austin, on June 18-22, 2012. http://nasslli2012.com/ NASSLLI is a one-week summer school aimed at graduate students and advanced undergraduates in Philosophy, Computer Science, Linguistics, Psychology and related fields, especially students with interdisciplinary interests or whose research crosses traditional boundaries between these subject areas. The summer school is loosely modeled on the long-running ESSLLI series in Europe and will consist of 5 sessions of 90 minute courses each day during the week of June 18-22, followed by a Turing Symposium on June 23 celebrating the first centenary of Alan Turing's birth, and the 13th Texas Linguistics Society conference on June 23, 24. Courses * Johan van Benthem (University of Amsterdam / Stanford University): Logical Dynamics of Information and Interaction * Craige Roberts (The Ohio State University): Questions in Discourse * Noah Goodman (Stanford University): Stochastic Lambda Calculus and its Applications in Semantics and Cognitive Science * Mark Steedman (University of Edinburgh): Combinatory Categorial Grammar: Theory and Practice * Chris Potts (Stanford University): Extracting Social Meaning and Sentiment * Catherine Legg (University of Waikato): Possible Worlds: A Course in Metaphysics (for Computer Scientists and Linguists) * Adam Lopez (Johns Hopkins University): Statistical Machine Translation * Eric Pacuit (Stanford University): Social Choice Theory for Logicians * Valeria de Paiva (Rearden Commerce) & Ulrik Buchholtz (Stanford University): Introduction to Category Theory * Adam Pease (Rearden Commerce): Ontology Development and Application with Suggested Upper Merged Ontology (SUMO) * Ede Zimmermann (University of Frankfurt): Intensionality * Thomas Icard (Stanford University): Surface Reasoning * Nina Gierasimczuk (University of Groningen): Belief Revision Meets Formal Learning Theory * Robin Cooper (G?teborg University) & Jonathan Ginzburg (University of Paris): Type Theory with Records for Natural Language Semantics * Jeroen Groenendijk (University of Amsterdam) & Floris Roelofsen (University of Amsterdam): Inquisitive Semantics * Shalom Lappin (King's College London): Alternative Paradigms for Computational Semantics * Tandy Warnow (University of Texas at Austin): Estimating Phylogenetic Trees in Linguistics and Biology * Hans Kamp (University of Stuttgart / University of Texas at Austin) & Mark Sainsbury (University of Texas at Austin): Vagueness and Context * Steve Wechsler (University of Texas at Austin) & Eric McCready (Osaka University): Meaning as Use: Indexicality and Expressives Special Presentations * Pranav Anand (University of California at Santa Cruz) * Nicholas Asher (IRIT, CNRS/Universit? Paul Sabatier) * Martin Davis (Emeritus NYU) * Robert King (University of Texas at Austin) * Oleg Kiselyov (FNMOC) * Kevin Knight (USC/Information Sciences Institute) * Sarah Murray (Cornell University) * Chung-chieh Shan (Cornell University) * Bonnie Webber (University of Edinburgh) * More to be announced... Events * Turing Symposium: June 23 * Texas Linguistics Society Conference: June 23, 24 * More to be announced... Registration fees: academic discount rate $175; professional rate $400. Student scholarships will be available for 50 students (http://nasslli2012.com/scholarships; application deadline: February 29). Scholarships include registration and may include a further subsidy for travel and accommodation. NASSLLI instructors present both basic and advanced work in their disciplines, so courses appeal not only to graduate students and exceptionally advanced undergraduates, but also to post-docs and researchers in related fields. The summer school provides a unique opportunity for students to learn from prominent scholars and meet others from the active community of interdisciplinary philosophy, computer science, linguistics and psychology researchers in the US and Europe. We expect over 200 participants, and in addition to classes in the daytime, the evenings will have social events and plenary lectures. UT Austin is a large research university in Austin, Texas which is widely agreed to be one of the most exciting cities in the US and is the self-styled "Live Music Capital of the World." We aim to make NASSLLI fun. More information is available at: http://nasslli2012.com/ http://twitter.com/nasslli https://www.facebook.com/events/300928343266509/ https://plus.google.com/113636222825121167810/posts From clarkson at gwu.edu Thu Dec 15 14:14:54 2011 From: clarkson at gwu.edu (Michael Clarkson) Date: Thu, 15 Dec 2011 14:14:54 -0500 Subject: [TYPES/announce] PhD and Postdoc Positions, Computer Security, George Washington Message-ID: The George Washington University Department of Computer Science PhD and Postdoctoral Positions The Systems & Security Group at The George Washington University in Washington, DC, is looking for scholars with a desire to advance the field of computer security. We have funded PhD and postdoctoral positions available starting in Fall 2012. The successful applicant will work with Prof. Michael Clarkson and the large cybersecurity community in DC to advance the state of the art in the scientific foundations of computer security. See http://faculty.cs.gwu.edu/~clarkson for more information. Topics of interest include but are not limited to: - Science of security - Foundations of security policies - Quantification of security - Implementation of secure systems - Information flow - Authorization logic - Language-based security - Electronic voting - Applied cryptography GW is enjoying an exciting time of substantial growth. The university is investing about $400 million in science and engineering, including a new 500k sq. ft. research complex and 32 new engineering faculty hires since 2008. Cybersecurity is a major priority at GW. Applicant profile: - Strong programming and mathematical ability - Excellent spoken and written English - For PhD position: 1) Bachelor's degree in computer science, mathematics, or a related field 2) Exposure to security, programming languages, or systems - For postdoc position: 1) PhD in computer science (completed or about to be completed) 2) Strong research background in security, programming languages, or systems Location and salary: - Downtown Washington, DC, USA, just four blocks from the White House - Research will be conducted at the Systems & Security Group lab - Salary is extremely competitive PhD application: - First, applicants must apply to GW: http://www.seas.gwu.edu/seasgraduate/prospectivestudents/applyfaqs.html - Second, send the following materials as a single PDF by email to Prof. Michael Clarkson : 1) brief cover letter describing your background 2) curriculum vitae 3) one-page statement of future research interests - Deadline: January 15, 2012 for admission in August 2012 - More information about the GW CS PhD program can be found here: http://www.cs.gwu.edu/academics/graduate_programs/phd/ Postdoc application: - Send the following materials as a single PDF by email to Prof. Michael Clarkson : 1) cover letter describing your background and research experience 2) curriculum vitae 3) research statement - Arrange to have two letters of reference emailed to the same address - Deadline: February 15, 2012 for full consideration - Start date: July 1, 2012 at the earliest - Duration: 1 year or more, depending on funding availability --- Michael Clarkson, PhD Assistant Professor Department of Computer Science The George Washington University -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Fri Dec 16 08:41:46 2011 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Fri, 16 Dec 2011 14:41:46 +0100 Subject: [TYPES/announce] Deadline extended - First International Workshop on Bidirectional Transformations Message-ID: <4EEB4A9A.7040503@informatik.uni-bonn.de> Extended submission deadlines following author requests: Abstracts by 19th December, Papers by 21st December =============================================================== CALL FOR PAPERS 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 =============================================================== INVITED SPEAKERS: * Juan de Lara (Autonomous University of Madrid, Spain) * Jean-Luc Hainaut (University of Namur, Belgium) IMPORTANT DATES: * Abstract submission: Mon, December 19, 2011 (23:59 Samoa Time) * Paper submission: Wed, December 21, 2011 (23:59 Samoa Time) * Author notification: Tue, January 24, 2012 * Camera-ready papers: Sun, February 5, 2012 SUBMISSION CATEGORIES: * Regular submissions (max. 15 pages, formal proceedings) * Short papers (max. 8 pages, informal proceedings) * Lightning talks (extended abstract) Submissions can be in LNCS or EC-EASST style. More details can be found on the webpage. PROCEEDINGS: There will be formal proceedings containing all accepted regular papers, published as a volume of EC-EASST (Electronic Communications of the European Association of Software Science and Technology, http://journal.ub.tu-berlin.de/eceasst). Short papers will be included in informal proceedings distributed at the workshop, and their authors may be invited to extend their contribution to a full paper for inclusion in the formal proceedings. SCOPE: Bidirectional transformations (bx) are a mechanism for maintaining the consistency of two (or perhaps more) related sources of information. Such sources can be databases, software models, documents, or their abstract models like graphs or trees. 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. The aim of the workshop is to bring together researchers, from all relevant areas, 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 2012 include, but are not limited to: * (coupled) software/model transformations * software-model synchronization * data-schema co-evolution and data synchronization * consistency analysis * language-based approaches * analysis/classification of requirements for bx technologies * case studies and tool support * comparison of bx technologies * efficiency of algorithms and benchmarks Regular submissions (11-15 pages) 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 For details about short papers and lightning talks, please consult the webpage. PROGRAM CO-CHAIRS: * Frank Hermann (Technical University of Berlin, Germany; University of Luxembourg, Luxembourg) * Janis Voigtl?nder (University of Bonn, Germany) PROGRAM COMMITTEE MEMBERS: * Paolo Atzeni (Roma Tre University, Italy) * Benjamin Braatz (University of Luxembourg, Luxembourg) * Anthony Cleve (University of Namur, Belgium) * Alcino Cunha (University of Minho, Portugal) * Carlo Curino (Massachusetts Institute of Technology, USA) * Davide Di Ruscio (University of L'Aquila, Italy) * Zinovy Diskin (University of Waterloo, Canada) * Ulrike Golas (Zuse Institute Berlin, Germany) * Ekkart Kindler (Technical University of Denmark, Denmark) * Kazutaka Matsuda (Tohoku University, Japan) * Fernando Orejas (Technical University of Catalonia, Spain) * Benjamin Pierce (University of Pennsylvania, USA) * Andy Sch?rr (Technical University of Darmstadt, Germany) * Perdita Stevens (University of Edinburgh, UK) * James Terwilliger (Microsoft, USA) * Antonio Vallecillo (University of M?laga, Spain) * Yingfei Xiong (University of Waterloo, Canada) From palmgren at math.su.se Fri Dec 16 20:04:18 2011 From: palmgren at math.su.se (Erik Palmgren) Date: Sat, 17 Dec 2011 02:04:18 +0100 Subject: [TYPES/announce] Postdoc position in Mathematical Logic at Stockholm University Message-ID: <5A831581-40B1-4EDC-A693-09FCBFB46BBC@math.su.se> Postdoc position for 2 years in Mathematical Logic at Stockholm University, Department of Mathematics. The research in mathematical logic at the department include such subjects as constructive mathematics, point-free topology and locale theory, semantics and proof theory of type theory and constructive set theory, category-theoretic logic, topos theory and constructive aspects of mathematical logic. The department is now looking for a postdoc interested to work in the areas of the logic group and related subjects. For details, and how to apply, see the advertisement at the department web page: http://www.math.su.se/pub/jsp/polopoly.jsp?d=14714&a=101279 The deadline for application is January 23, 2012. Note that applications should be sent ordinary mail. Erik Palmgren Professor of Mathematical Logic Department of Mathematics Stockholm University SE-10691 Stockholm palmgren at math.su.se -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Sat Dec 17 13:45:31 2011 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sat, 17 Dec 2011 20:45:31 +0200 Subject: [TYPES/announce] Estonian Winter School in Comput Sci 2012, call for partic. Message-ID: <20111217204531.013bae46@duality> [Lecturers: Dimitrov, Escard?, Italiano, Nordstr?m, Yi. Place/time: Palmse, Estonia, 26 Feb-2 March 2012. Deadline for application and submission of abstracts for student talks: ** 13 Jan 2012 **.] CALL for PARTICIPATION 17th Estonian Winter School in Computer Science, EWSCS '12 Palmse, Estonia, 26 Feb-2 March 2012 http://cs.ioc.ee/ewscs/2012/ BACKGROUND AND OBJECTIVES EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics, a research institute of Tallinn University of Technology. The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The working language of the schools is English. EWSCS '12 is the seventeenth event of the series. PROGRAMME The schools' scientific programme consists of short courses by renowned specialists and a student session. Courses of EWSCS '12 * Vassil S. Dimitrov (University of Calgary, Canada): Computational number theory and its applications * Mart?n Escard? (University of Birmingham, UK): Topology for functional programming * Giuseppe Italiano (Universit? di Roma "Tor Vergata", Italy): Dynamic graph algorithms * Jakob Nordstr?m (KTH Royal Institute of Technology, Sweden): Time-space trade-offs in proof complexity * Kwangkeun Yi (Seoul National University, South Korea): Collage of static analyses in practice and theory The purpose of the student session is to give students an opportunity to present their work (typically, thesis work) and get feedback. Registrants are invited to propose short talks (20 min) on topics of theoretical computer science, broadly understood. The selection will be based on abstracts of 150-400 words. The social programme consists of an excursion and a conference dinner. VENUE Palmse is a small settlement 80 kms to the east from Tallinn in the county of L??ne-Viru. It is renowned for a large manor that used to belong to the von Pahlen family, today hosting the visitors' center of the Lahemaa National Park, a museum, and a hotel. Tallinn, Estonia's capital, is famous for its picturesque medieval Old Town, a UNESCO World Heritage site. In 2011, Tallinn, along with Turku in Finland, was the cultural capital of Europe. There are direct flights to Tallinn Lennart Meri airport from Amsterdam, Bremen, Brussels, Copenhagen, Dublin, D?sseldorf Weeze, Frankfurt, Girona, Gothenburg, Helsinki, Kiev, Liverpool, London Gatwick, Luton and Stansted, Milan Bergamo, Moscow Sheremetyevo and Vnukovo, Munich, Oslo Gardermoen and Rygge, Oulu, Prague, Riga, Stockholm Arlanda, Bromma and Skavsta, St Petersburg, Tampere, Trondheim, Turku, Vaasa, Warsaw and Vilnius, ferries from Stockholm and Helsinki. From Vilnius, Riga, St Petersburg the Lux Express and EcoLines coach services are the practical travel option. APPLICATION AND COST The deadline for application and submission of student talk abstracts is 13 January 2012. All applicants will be notified of admission to the school and acceptance of their talks by 27 January 2012. Admitted applicants are entitled and expected to attend the courses and student session of the school. They will also receive a binder with the course material and access to additional materials on the school website. The participation fee is 320 EUR and includes full board accommodation at Palmse, transportation from Tallinn to Palmse, the excursion and conference dinner (by contributing towards the associated expense). We may be able to reduce the fee for a small number of participants. To apply for fee reduction, please fill in the online fee reduction request form. PROGRAMME COMMITTEE / ORGANISING COMMITTEE * Tarmo Uustalu (Institute of Cybernetics) (chair) * Monika Perkmann (Institute of Cybernetics) (secretary) * Peeter Laud (Cybernetica AS) * Varmo Vene (University of Tartu) * Sven Laur (University of Tartu) SPONSORS * Tiger University Plus programme of the Estonian Information Technology Foundation * Estonian Centre of Excellence in Computer Science, EXCS, funded by the European Regional Development Fund FURTHER INFORMATION Details on the application procedure and cost, submission of student talk abstrats are available from the school webpage, http://cs.ioc.ee/ewscs/2012/. Questions should be sent to ewscs12(at)cs.ioc.ee. From P.B.Levy at cs.bham.ac.uk Sat Dec 17 14:06:25 2011 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Sat, 17 Dec 2011 19:06:25 +0000 Subject: [TYPES/announce] MSFP 2012 deadline extension Message-ID: <2A0F8877-9E3B-429B-9274-AEE7B0DA643E@cs.bham.ac.uk> Dear colleagues, The deadline for MSFP 2012 has been extended by one week to FRIDAY 23 DECEMBER. See details below. Best regards, James Chapman and Paul Blain Levy MSFP 2012 co-chairs -- 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. Important Dates: ================ Submission of papers: 23 December 2011 Notification: 25 January 2012 Final versions due: 6 Feburary 2012 Workshop: 25 March 2012 Invited Speakers: ================= Danko Ilik, Goce Del?ev University of ?tip, Republic of Macedonia Neil Ghani, University of Strathclyde, UK Submission: =========== Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). After the workshop, there might be an opportunity to publish selected papers in a journal special issue. All submissions must be in PDF format and use the EPTCS style files. Submissions can be made through the EasyChair website, at http://www.easychair.org/conferences/?conf=msfp2012 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 daniel.hirschkoff at ens-lyon.fr Sun Dec 18 13:25:36 2011 From: daniel.hirschkoff at ens-lyon.fr (Daniel Hirschkoff) Date: Sun, 18 Dec 2011 19:25:36 +0100 Subject: [TYPES/announce] Postdoctoral Positions in Mathematics and Computer Science (Lyon, France) Message-ID: <20111218192535.49467k2a7bz2r1un@webmail.ens-lyon.fr> Dear list, Please find below an advertisment for postdoc positions in Lyon (France). People on the Types-announce mailing list might be interested in particular in applying to work within the Plume group (see http://www.ens-lyon.fr/LIP/PLUME/index.php). Regards, Daniel Hirschkoff ----------------------------------- Post-doc positions - Mathematics and computer science in Lyon (labex MILYON) Offer: MILYON (the Laboratoire d'Excellence "Math?matiques et Informatique ? Lyon") offers two post-doctoral positions in mathematics and/or computer science starting with the academic year 2012-2013, 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 (under construction: http://milyon.universite-lyon.fr/) which contains links to the above three departments. It may be useful 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, 2012. Deadline: Applications must be complete (including all reference letters) by Monday, January 16th, 2012. How to apply? Applications must be submitted via the online form (or click here, or here: http://milyon.universite-lyon.fr/). Requested items: - a curriculum vitae; - a list of publications; - a scientific project (approximately 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: Francis FILBET References: <4EBD2FEB.9020800@cs.unibo.it> Message-ID: <4EEF31D4.5050207@cs.unibo.it> (Our apologies for multiple copies) =============================================================== LAST CALL FOR PAPERS 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). _______________________________________________________________ INVITED SPEAKERS ? Yuri Gurevich (Microsoft Research and University of Michigan) ? Ulrich Schoepp (LMU Munich) _______________________________________________________________ SUBMISSION The following deadlines are strict: ? Paper Submission (full papers): December 23rd, 2011; ? Notification (full papers): January 20th, 2012; ? Final Version (full papers): February 5th, 2012; ? Submission (extended abstracts): February 18th, 2012; ? Notification (extended abstracts): February 28th, 2012. There will be two categories of submissions: ? Full papers, of up to 15 pages; ? Extended abstracts for short presentations (not included in the proceedings), of up to 3 pages. Authors must indicate if their submission belongs to the second category (by adding ?(Extended Abstract)? in the title). Papers must be submitted electronically, as pdf files, at the following page: https://www.easychair.org/conferences/?conf=dice2012. Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). Submissions of papers authored by PC members are allowed and encouraged. Proceedings will be published in EPTCS. _______________________________________________________________ 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 cav2012.publicity.chair at gmail.com Mon Dec 19 10:42:56 2011 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Mon, 19 Dec 2011 10:42:56 -0500 Subject: [TYPES/announce] CAV 2012: 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 rensink at cs.utwente.nl Tue Dec 20 05:12:18 2011 From: rensink at cs.utwente.nl (Arend Rensink) Date: Tue, 20 Dec 2011 11:12:18 +0100 Subject: [TYPES/announce] Reminder EAPLS PhD Award 2011: Call for Nominations (deadline 31 December 2011) Message-ID: <4EF05F82.2090305@cs.utwente.nl> EAPLS PhD Award 2011: 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 2010 ? 1 November 2011 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=eaplsphd2011. 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 2011. 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 2011: Deadline for nominations 16 March 2012: 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 swarat at rice.edu Tue Dec 20 07:14:50 2011 From: swarat at rice.edu (Swarat Chaudhuri) Date: Tue, 20 Dec 2011 06:14:50 -0600 Subject: [TYPES/announce] POPL 2012: Registration and hotel reservation deadlines (December 24) approaching! Message-ID: <4EF07C3A.9040302@rice.edu> ************************************************************** * * ACM SIGPLAN-SIGACT Symposium * on * Principles of Programming Languages * * January 25-27, 2012 * Philadelphia, PA, USA * * Call for Participation * * http://www.cse.psu.edu/popl/12/ * *************************************************************** Important dates and notes --------------------------- * Hotel reservation deadline: December 24, 2011 * Early registration deadline: December 24, 2011 * Conference: January 25-27, 2012 * Colocated events: January 22-29, 2012 *** The conference hotel (Sheraton Society Hill) is currently full or nearly full on some peak conference nights. If you're unable to book at the Sheraton, we've secured a block of rooms at the Hyatt Penns Landing, which is a very short walk from the conference hotel, at the rate of $149/night. You can book there via https://resweb.passkey.com/go/acm2012 or by calling (888) 421-1442 and quoting the group code "acm2012". ** Registration -------------------------- To register online, please go to https://regmaster3.com/2012conf/POPL12/register.php The early registration deadline is December 24, 2011. Hotel ------------------------- All the conference events will take place at the Sheraton Society Hill Hotel in Philadelphia's historic district. We encourage attendees to stay at the conference hotel. Information about the hotel can be found on the POPL web page: http://www.cse.psu.edu/popl/12/ To be eligible for the special conference rate, bookings must be made by December 24, 2011. However, as the conference rate applies only to a limited number of rooms, attendees are encouraged to make their hotel reservations at the earliest opportunity. Scope ------------------------- The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. Preliminary program -------------------------- A preliminary program can be found at the end of this email in text format, or it can be found here: http://www.cse.psu.edu/popl/12/program.html Program Highlights ------------------------- Invited talks: * Sir Charles Antony Richard Hoare, FRS, FREng, FBCS, Microsoft Research ACM SIGPLAN Programming Languages Achievement Award Interview * J Strother Moore, University of Texas at Austin Meta-Level Features in an Industrial-Strength Theorem Prover * Jennifer Rexford, Princeton University Programming Languages for Programmable Networks Other attractions ------------------------- POPL TutorialFest!: POPL 2012 will have a TutorialFest! event with seven "distilled" 90 minute tutorials. This event is on January 28, immediately following the main POPL conference. The TutorialFest! requires separate registration and registrants of TutorialFest! may attend any of the tutorials offered throughout the day. More information on the TutorialFest! is available at: http://www.cse.psu.edu/popl/12/tutorial.html Affiliated Events -------------------------- * POPL TutorialFest: January 28, 2012 * VMCAI:Verification Model Checking and Abstract Interpretation * January 22-24, 2012 http://lara.epfl.ch/vmcai2012/ * LADA: Languages for Distributed Algorithms * January 23-24, 2012 http://sites.google.com/site/ladameeting/ * PADL: Practical Applications of Declarative Languages * January 23-24, 2012 http://research.microsoft.com/en-us/um/people/crusso/padl12/ * PEPM: Partial Evaluation and Semantics-Based Program Manipulation * January 23-24, 2012 http://www.program-transformation.org/PEPM12 * PLMW: The CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop * January 24, 2012 http://www.cis.upenn.edu/~sweirich/plmw12/ * PLPV: Programming Languages meets Program Verification * January 24, 2012 http://research.microsoft.com/en-us/um/people/nswamy/plpv12/ * DAMP: Declarative Aspects of Multicore Programming * January 28, 2012 http://www.mpi-sws.org/~umut/damp2012/ * OBT: Off the Beaten Track: Underrepresented Problems for Programming Language Researchers * January 28, 2012 http://www.cs.princeton.edu/~dpw/obt/ * TLDI:Types in Language Design and Implementation * January 28, 2012 http://www.cis.upenn.edu/~bcpierce/tldi12/ * VSTTE: Verified Software: Theories, Tools and Experiments * January 28-29, 2012 https://sites.google.com/site/vstte2012/ Travel awards and visa support letters -------------------------------- A limited number of grants are available through the SIGPLAN Professional Activities Committee (PAC) to support students going to POPL. You must be an ACM member to apply. Students that are interested in attending both POPL and the PLMW Workshop should first seek funds via PLMW and then contact PAC if the PLMW grant is not awarded. PLMW grants are explained on the PLMW website. Requests for visa support letters for purposes of attending or presenting at POPL 2012 are handled by ACM. More information is available on the POPL 2012 website. Program --------------------------- Wednesday, January 25 =========================== * 8:30-9:20: Breakfast * 9:20-9:30: Welcome * 9:30-10:30: Invited Talk (Session chairs: Andrew P. Black, Peter O'Hearn) - SIGPLAN Distinguished Achievement Award Presentation and Interview Tony Hoare, Microsoft Research. * 10:30-11:00: Break * 11:00-12:30: Session on Verification (Chair: Ranjit Jhala): -Freefinement (Stephan van Staden, Cristiano Calcagno, and Bertrand Meyer) - Underspecified harnesses and interleaved bugs (Saurabh Joshi, Shuvendu Lahiri, and Akash Lal) - A Program Logic for JavaScript (Philippa Gardner, Sergio Maffeis, and Gareth Smith) * 11:00-12:30: Session on Semantics (Chair: Patricia Johann): - Higher-Order Functional Reactive Programming in Bounded Space (Neelakantan R Krishnaswami and Nick Benton and Jan Hoffmann) - The Marriage of Bisimulations and Kripke Logical Relations (Chung-Kil Hur, Derek Dreyer, Georg Neis, and Viktor Vafeiadis) - Information Effects (Roshan James and Amr Sabry) * 12:30-2:00: Lunch * 2:00-3:30: Session on Privacy and Access Control (Chair: Nikhil Swamy): - A Language for Automatically Enforcing Privacy Policies (Jean Yang, Kuat Yessenov, and Armando Solar-Lezama) - Probabilistic Relational Reasoning for Differential Privacy (Gilles Barthe, Boris K?pf, Federico Olmedo, and Santiago Zanella Beguelin) - Access Permission Contracts for Scripting Languages (Phillip Heidegger, Annette Bieniusa, and Peter Thiemann) * 2:00-3:30: Session on Decision Procedures (Chair: Swarat Chaudhuri): - Recursive Proofs for Inductive Tree Data-Structures (P Madhusudan, Xiaokang Qiu, and Andrei Stefanescu) - Symbolic Finite State Transducers, Algorithms and Applications (Nikolaj Bjorner, Pieter Hooimeijer, and Benjamin Livshits, David Molnar, and Margus Veanes) - Constraints as Control (Ali Sinan K?ksal, Viktor Kuncak, and Philippe Suter) * 3:30-4:15: Break * 4:15-5:15: Session on Security (Chair: Neelakantan Krishnaswami): - Multiple Facets for Dynamic Information Flow (Thomas Austin and Cormac Flanagan) - Defining Code-injection Attacks (Donald Ray and Jay Ligatti) * 4:15-5:15: Session on Complexity for Concurrency (Chair: P. Madhusudan): - Deciding Choreography Realizability (Samik Basu, Tevfik Bultan, and Meriem Ouederni) - Analysis of Recursively Parallel Programs (Ahmed Bouajjani and Michael Emmi) * 5:15-6:00: Break * 6:00-8:00: Student Session (Chair: Tobias Wrigstad) Thursday, January 26 =========================== * 8:30-9:20: Breakfast * 9:20-9:30: Announcements * 9:30-10:30: Invited Talk (Session chair: Michael Hicks) - Programming Languages for Programmable Networks Jennifer Rexford, Princeton University * 10:30-11:00: Break * 11:00-12:30: Session on Medley (Chair: Suresh Jagannathan): - A Compiler and Run-time System for Network Programming Languages (Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker) - Nested Refinements: A Logic For Duck Typing (Ravi Chugh, Patrick M Rondon, and Ranjit Jhala) - An Abstract Interpretation Framework for Termination. (Patrick Cousot and Radhia Cousot) * 11:00-12:30: Session on Mechanized Proofs (Chair: Adam Chlipala): - Playing in the Grey Area of Proofs (Krystof Hoder, Laura Kovacs, and Andrei Voronkov) - Static and User-Extensible Proof Checking (Antonis Stampoulis and Zhong Shao) - Run Your Research: On the Effectiveness of Lightweight Mechanization (Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, and Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, and Robert Bruce Findler) * 12:30-2:00: Lunch * 2:00-3:30: Session on Concurrency (Chair: Matt Parkinson): - Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control (Azadeh Farzan and Zachary Kincaid) -Resource-Sensitive Synchronization Inference by Abduction (Matko Botincan and Mike Dodds and Suresh Jagannathan) - Syntactic Control of Interference for Separation Logic (Uday S Reddy and John C Reynolds) * 2:00-3:30: Session on Type Theory (Chair: Stephanie Weirich): - Canonicity for 2-Dimensional Type Theory (Daniel R Licata and Robert Harper) - Algebraic Foundations for Effect-Dependent Optimisations (Ohad Kammar and Gordon Plotkin) - On the Power of Coercion Abstraction (Didier Remy and Julien Cretin) * 3:30-4:15: Break * 4:15-5:15: Session on Dynamic Analysis (Chair: Aarti Gupta): - Abstractions From Tests (Mayur Naik, Hongseok Yang, and Ghila Castelnuovo and Mooly Sagiv) - Sound Predictive Race Detection in Polynomial Time (Yannis Smaragdakis, Jacob M Evans, and Caitlin Sadowski, Jaeheon Yi, and Cormac Flanagan) * 4:15-5:15: Session on Names and Binders (Chair: Zhong Shao): - Towards Nominal Computation (Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, and Slawomir Lasota) - Programming with Binders and Indexed Data-Types (Andrew Cave and Brigitte Pientka) * 5:15-5:45: Business meeting * 7:00-: Banquet Friday, January 27 =========================== * 8:30-9:20: Breakfast * 9:20-9:30: POPL 2013 preview * 9:30-10:30: Invited Talk (Session chair: John Field) - Meta-level Features in an Industrial-Strength Theorem Prover J Strother Moore, University of Texas * 10:30-11:00: Break * 11:00-12:30: Session on Verified Transformations (Chair: Chris Hawblitzel): - Formalizing the LLVM Intermediate Representation for Verified Program Transformation (Jianzhou Zhao, Steve Zdancewic, Santosh Nagarakatte, and Milo M K Martin) - Optimal Randomized Transformation of Approximate Computations (Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, and Martin Rinard) - A Rely-Guarantee-Based Simulation for Verifying Concurrent Program Transformations (Hongjin Liang, Xinyu Feng, and Ming Fu) * 11:00-12:30: Session on Functional Programming (Chair: Dimitrios Vytiniotis): - A Unified Approach to Fully Lazy Sharing (Thibaut Balabonski) - The Ins and Outs of Gradual Type Inference (Aseem Rastogi and Avik Chaudhuri and Basil Hosmer) - Edit Lenses (Martin Hofmann and Benjamin C Pierce and Daniel Wagner) * 12:30-2:00: Lunch * 2:00-3:30: Session on C/C++ Semantics (Chair: Andreas Podelski): - Clarifying and compiling C/C++ concurrency: from C++0x to POWER (Mark Batty, Kayvan Memarian, and Scott Owens, Susmit Sarkar, and Peter Sewell) - A mechanized semantics for C++ object construction and destruction, with applications to resource management (Tahina Ramananandro, Gabriel Dos Reis, and Xavier Leroy) - An Executable Formal Semantics of C with Applications (Chucky Ellison and Grigore Rosu) * 2:00-3:30: Session on Type Systems (Chair: Norman Ramsey): - A Type Theory for Probability Density Functions (Sooraj Bhat, Ashish Agarwal, and Richard Vuduc and Alexander Gray) - A Type System for Borrowing Permissions (Karl Naden, Robert L Bocchino Jr, Kevin Bierhoff, and Jonathan Aldrich) - Self-Certification: Bootstrapping Certified Typecheckers in F* with Coq (Pierre-Yves Strub and Nikhil Swamy, Cedric Fournet, and Juan Chen) * 3:30-4:00: Closing and Raffle General Chair: -------------------------- John Field Google 76 Ninth Avenue, New York, NY 10011, USA. jfield at google.com Program Chair: --------------------------- Michael Hicks Department of Computer Science University of Maryland, College Park, MD 20866, USA mwh at cs.umd.edu Program Committee: --------------------------- Swarat Chaudhuri, Rice University, USA Adam Chlipala, MIT, USA Dan R. Ghica, University of Birmingham, UK Aarti Gupta, NEC Labs America, USA Chris Hawblitzel, Microsoft Research, Redmond, USA Suresh Jagannathan, Purdue University, USA Ranjit Jhala, University of California, San Diego, USA Sorin Lerner, University of California, San Diego, USA Ondrej Lhotak, University of Waterloo, Canada P. Madhusudan, University of Illinois, Urbana-Champaign, USA Rupak Majumdar, MPI-SWS, Germany Matthew Might, University of Utah, USA Todd Millstein, University of California, Los Angeles, USA Greg Morrisett, Harvard University, USA Andrew Myers, Cornell University, USA Matthew Parkinson, Microsoft Research, Cambridge, UK Frank Piessens, K.U. Leuven, Belgium Andrew Pitts, University of Cambridge, UK Andreas Podelski, University of Freiburg, Germany Fran?ois Pottier, INRIA, France Norman Ramsey, Tufts University, USA Tachio Terauchi, Nagoya University, Japan Mandana Vaziri, IBM Research, USA Dimitrios Vytiniotis, Microsoft Research, Cambridge, UK Nobuko Yoshida, Imperial College, London, UK Francesco Zappa Nardelli, INRIA, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From crusso at microsoft.com Tue Dec 20 11:37:52 2011 From: crusso at microsoft.com (Claudio Russo) Date: Tue, 20 Dec 2011 16:37:52 +0000 Subject: [TYPES/announce] PADL 2012 Final Call for Participation Message-ID: <88D1F4047EA9A2468BCC6B743186880F642A0A45@DB3EX14MBXC311.europe.corp.microsoft.com> Final Call for Participation ============================ 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 You are cordially invited to PADL'12. 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 and constraints. PADL'12 is sponsored by Association for Logic Programming with cooperation of ACM SIGPLAN and support by Microsoft Research. Registration ============ To register for PADL'12, please follow the instructions at: https://regmaster3.com/2012conf/POPL12/register.php The early registration deadline is December 24, 2011. The registration fee will cover a copy of the symposium proceedings, refreshments, and an informal dinner. Hotel Information ================= PADL will be co-located with POPL at the Sheraton Society Hill Hotel in Philadelphia. Please visit POPL's web site to make reservations at the special conference rate. Program ======= The symposium will include invited talks by Boon Thau Loo and Don Stewart, and 19 technical papers selected from 41 submissions. The preliminary program is as follows: Invited Talk (9:00-10:00) * Boon Thau Loo Recent Advances in Declarative Networking Break (10:00-10:30) Session 1: Applications (10:30-12:00) * Mayer Goldberg and Guy Wiener A Declarative Approach for Software Modeling * Sergio Antoy and Michael Hanus Contracts and Specifications for Functional Logic Programming * Pedro M. Martins, Julie A. McCann and Susan Eisenbach The Environment as an Argument Lunch (not provided) (12:00-13:30) Session 2: Logic Programming (13:30-15:30) * Yuliya Lierler, Shaden Smith, Mirek Truszczynski and Alex Westlund Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving * Marcello Balduccini and Yuliya Lierler Practical and Methodological Aspects of the Use of Cutting-Edge ASP Tools * Christian Theil Have and Henning Christiansen Efficient tabling of structured data using indexing and program transformation * Dario Campagna, Beata Sarna-Starosta and Tom Schrijvers Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation Break (15:30-16:00) Session 3: Parallelism and Concurrency (16:00-17:30) * Elvira Albert, Puri Arenas and Miguel Gomez-Zamalloa Symbolic Execution of Concurrent Objects in CLP * Pablo Chico De Guzm??n, Amadeo Casas, Manuel Carro and Manuel Hermenegildo A Segment-Swapping Approach for Executing Trapped Computations * Michael Lesniak Palovca: Describing and Executing Graph Algorithms in Haskell Informal PADL Dinner (Place: TBA) Tuesday, January 24, 2012 Breakfast (8:00-9:00) Invited Talk (9:00-10:00) * Don Stewart Make Things Now! Pragmatic Functional Programming in Haskell Break (10:00-10:30) Session 4: Domain Specific Languages I (10:30-12:00) * Kenny Zhu, Kathleen Fisher and David Walker LearnPADS++: Incremental Inference of Ad Hoc Data Formats * Jeroen Bransen, Arie Middelkoop, Atze Dijkstra and S. Doaitse Swierstra The Kennedy-Warren algorithm revisited: ordering Attribute Grammars * Nicholas Coleman Distributed Policy Specification and Interpretation with Classified Advertisements Lunch (not provided) (12:00-13:30) Session 5: Domain Specific Languages II (13:30-15:30) * Andy Gill and Bowe Neuenschwander Handshaking in Kansas Lava using Patch Logic * Daniel Winograd-Cort, Hai Liu and Paul Hudak Virtualizing Real-World Objects in FRP * Edwin Brady and Kevin Hammond Resource-safe Systems Programming with Embedded Domain Specific Languages * David Broman and Henrik Nilsson Node-Based Connection Semantics for Equation-Based Object-Oriented Modeling Languages Break (15:30-16:00) Session 6: Numerics (16:00-17:00) * Paul Tarau A Declarative Specification of Tree-based Symbolic Arithmetic Computations * Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Flatt and Matthias Felleisen Typing the Numeric Tower From andreas.abel at ifi.lmu.de Tue Dec 20 11:54:55 2011 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Tue, 20 Dec 2011 17:54:55 +0100 Subject: [TYPES/announce] Agda Implementors' Meeting XV Message-ID: <4EF0BDDF.2090708@ifi.lmu.de> ------------------------------------------------------------- Agda Implementors' Meeting XV Call for participation http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXV ------------------------------------------------------------- The fifteenth Agda Implementors' Meeting will be held in Hotel Aurachhof in Fischbachau near Munich 2012-02-20 to 2012-02-25 (Mon to Sat). 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. Important dates: 2011-01-10: Deadline for registration 2011-02-20 to 2011-02-25: AIM XV The deadline for registration is necessary to finalize the deal with the conference venue Hotel Aurachhof. To register, reply to me, filling out the form below. For more information, please visit the AIM XV web page: http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXV Looking forward to seeing you in Bavaria soon! Andreas ----8<------------------------------------------------------------------ Registration form Name: Affiliation: email: Accomodation: * Date of arrival: * Date of departure: Excursion: * Alpine skiing (yes/no): * Nordic skiing (yes/no): Program: * I'd like to give a talk or lead a discussion (yes/no): Title: Abstract: (optional) * Suggestion for code-sprint (optional): -- 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 andreas.abel at ifi.lmu.de Tue Dec 20 16:42:02 2011 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Tue, 20 Dec 2011 22:42:02 +0100 Subject: [TYPES/announce] Correction: Agda Implementors' Meeting XV In-Reply-To: <4EF0BDDF.2090708@ifi.lmu.de> References: <4EF0BDDF.2090708@ifi.lmu.de> Message-ID: <4EF1012A.7030305@ifi.lmu.de> Correction: Important dates: 2012-01-10: Deadline for registration 2012-02-20 to 2012-02-25: AIM XV On 20.12.11 5:54 PM, Andreas Abel wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > ------------------------------------------------------------- > Agda Implementors' Meeting XV > Call for participation > http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXV > ------------------------------------------------------------- > > The fifteenth Agda Implementors' Meeting will be held in Hotel > Aurachhof in Fischbachau near Munich 2012-02-20 to 2012-02-25 > (Mon to Sat). 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. > > Important dates: > > 2011-01-10: Deadline for registration > 2011-02-20 to 2011-02-25: AIM XV > > The deadline for registration is necessary to finalize the deal > with the conference venue Hotel Aurachhof. > > To register, reply to me, filling out the form below. > > For more information, please visit the AIM XV web page: > > http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXV > > Looking forward to seeing you in Bavaria soon! > > Andreas > > ----8<------------------------------------------------------------------ > Registration form > > Name: > Affiliation: > email: > > Accomodation: > * Date of arrival: > * Date of departure: > > Excursion: > * Alpine skiing (yes/no): > * Nordic skiing (yes/no): > > Program: > * I'd like to give a talk or lead a discussion (yes/no): > Title: > Abstract: (optional) > > * Suggestion for code-sprint (optional): > > -- 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 rybal at in.tum.de Thu Dec 22 09:40:05 2011 From: rybal at in.tum.de (Andrey Rybalchenko) Date: Thu, 22 Dec 2011 15:40:05 +0100 Subject: [TYPES/announce] VMCAI 2012: call for participation Message-ID: <9C695C23-E71A-49EC-ADE9-A8F4116F4EC8@in.tum.de> -------------- CALL FOR PARTICIPATION -------------- VMCAI 2012 13th International Conference on Verification, Model Checking, and Abstract Interpretation Philadelphia, USA, January 25-27, 2012 http://lara.epfl.ch/vmcai2012/program.html Early registration deadline is December 24. https://regmaster3.com/2012conf/POPL12/register.php 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. Invited talks: * Alex Aiken: New applications of underapproximations in static analysis * Rajeev Alur: Computer augmented program engineering * Ahmed Bouajjani: Abstract domains for automated reasoning about list-manipulating programs with infinite data * Tobias Nipkow: Teaching semantics with a proof assistant: teach proofs, not logic! Invited Tutorial: * Ranjit Jhala: Software verification with liquid types Contributed papers: The VMCAI 2012 program encompasses 26 regular papers. http://lara.epfl.ch/vmcai2012/program.html Best regards, Viktor & Andrey From m.huisman at utwente.nl Thu Dec 22 11:05:18 2011 From: m.huisman at utwente.nl (Marieke Huisman) Date: Thu, 22 Dec 2011 17:05:18 +0100 Subject: [TYPES/announce] last CFP: Bytecode 2012 (deadline: January 4, 2012) Message-ID: <4EF3553E.3050405@utwente.nl> CALL FOR PAPERS 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/ NEWS ==== * Science of Computer Programming has agreed to publish a special issue on Bytecode 2012 * Invited speakers: - James Hunt, aicas, Germany (see http://www.aicas.com/), on real-time Java - Diego Garbervetsky, University of Buenos Aires, Argentina (see http://lafhis.dc.uba.ar/~diegog/), on quantitative analysis of bytecode - Jeff Foster, University of Maryland, USA (see http://www.cs.umd.edu/~jfoster/), on bytecode transformation for improved security on Android 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 =============== Paper submission: January 4, 2012 Notification: January 26, 2012 Final version: February 6, 2012 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 http://www.easychair.org/conferences/?conf=bytecode2012. 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 M??ller, ETH Z??rich, Switzerland Tamara Rezk, INRIA Sophia Antipolis-Mediterranee, France Bernhard Scholz, University of Sydney, Australia Fausto Spoto, University of Verona, Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From evw at cs.umn.edu Fri Dec 23 15:11:48 2011 From: evw at cs.umn.edu (Eric Van Wyk) Date: Fri, 23 Dec 2011 14:11:48 -0600 Subject: [TYPES/announce] 2 faculty positions at University of Minnesota Message-ID: The Department of Computer Science and Engineering at the University of Minnesota ? Twin Cities invites applications from outstanding candidates in all areas of Computer Science for two faculty positions at the rank of Assistant Professor, although exceptional candidates for more senior positions will be considered. We strongly encourage applications from women and members of minority groups. For one of the positions, we are particularly interested in candidates who can apply their research to address the myriad challenges of "Big Data". These challenges span a broad range of computer science topics and methods, such as: theoretical foundations and algorithms for high dimensional data and data streams; architecture, storage, data management, systems, and networking; security and privacy; knowledge discovery; visualization and social computing. A complete description of the positions is available here: http://www.cs.umn.edu/resources/employment/faculty.php Please don't hesitate to contact me if you have any questions. Cheers, Eric ~ Eric Van Wyk, Associate Professor ~ Department of Computer Science and Engineering ~ Universtiy of Minnesota ~ evw at cs.umn.edu, www.cs.umn.edu/~evw ~ +1 612 625 0329 From kwang at ropas.snu.ac.kr Sun Dec 25 21:30:31 2011 From: kwang at ropas.snu.ac.kr (Kwangkeun Yi) Date: Mon, 26 Dec 2011 11:30:31 +0900 Subject: [TYPES/announce] Postdoc positions at Seoul National Univ. Message-ID: <4EF7DC47.1000301@ropas.snu.ac.kr> Dear all, The Center for Research On Software Analysis for Error-free Computing at Seoul National University is looking for postdoctoral researchers in static analysis, software verification, programming language theory and software system security. The postdocs can work on pretty much any research topics of his preference collaborating with our highly motivated research members and her/his colleagues. Please see below for more information and if you are interested, please don't hesitate to contact me. All the best, -Kwang Kwangkeun Yi, Professor School of Computer Science and Engineering Seoul National University kwang at ropas.snu.ac.kr ropas.snu.ac.kr/~kwang ------------------------------------------------------------------------------- POSTDOCTORAL RESEARCH PROFESSOR POSITIONS Center For Research On Software Analysis For Error-Free Computing http://rosaec.snu.ac.kr SCHOOL OF COMPUTER SCIENCE & ENGINEERING SEOUL NATIONAL UNIVERSITY ------------------------------------------------------------------------------- The Center for Research on Software Analysis for Error-free Computing at Seoul National University (http://en.snu.ac.kr) invites applications for - postdoctoral research professor positions - the positions in 3 years can be transfered (depending on research achievements) to regular tenure-track faculty positions. We are looking for candidates with research focus on - static analysis - sw verification - programming language theory & system Successful applicants are expected to lead a top-quality research and work with a group of highly-motivated, internationally competitive graduate and undergraduate students. Interested candidates should email any inquiry or the application materials to Prof. Kwangkeun Yi Email: kwang at ropas.snu.ac.kr Home: http://ropas.snu.ac.kr/~kwang Application materials: a resume, a personal research plan, and the names of three or more references. Review of completed applications will begin immediately. The position remains open until filled. - Annual salary is negotiable, internationally competitive (with generous taxation rates) and depends on the candidates research records and potentials. - On-campus university housing (1- or 2-bedroom apartment) provided. --------------------------------------------------------------------------------- From aru at hib.no Tue Dec 27 13:02:17 2011 From: aru at hib.no (Adrian Rutle) Date: Tue, 27 Dec 2011 14:02:17 -0400 Subject: [TYPES/announce] Post Doc Opportunity Verification of Time/Resource Sensitive Safety Critical Systems using HPC Message-ID: <4EFA0829.1000901@hib.no> Post-doc opportunity: Verification of Time/Resource Sensitive Safety Critical Systems using High Performance Computing This post doctoral position offers the successful candidate the opportunity to be at the forefront in developing technology for safety critical systems targeting health services delivery. The motivational problems involve modeling and verifying workflow systems using innovative ontology-driven workflow management frameworks. Case studies will involve very large workflows for community-based health care programs. This is a 1 year contract with the possibility of extensions. The candidate will have the opportunity to: ? work with researchers and graduate students in a large interdisciplinary R&D project led by Dr. Wendy MacCaull, at StFX University in Antigonish, Nova Scotia, (see www.logic.stfx.ca); ? collaborate with our industry partners; ? work closely with a variety of health care professionals; ? collaborate and network with the Canadian Consortium in High Performance Computing, and researchers at universities across Canada; ? reside in a small town with an affordable lifestyle, close to beaches and scenic landscapes, with a thriving Academic and Arts community, in close proximity (2 hours) to a major metropolitan city. This position is partially supported by the ACEnet (Atlantic Computational Excellence Network see www.ace-net.ca) Research Fellowships Program and by ACOA through the Atlantic Innovation Fund. Qualifications: - PhD in Computer Science and a strong background in formal methods or related area; knowledge and expertise in parallel and distributed computing is an asset; - Desire and commitment to work on applied problems in a high performance computing environment; - Ability to present information in English clearly, both in verbal and written formats; - Enjoys working in a collaborative environment. Salary: $46,000 per year (plus a funding allowance for conference presentations). To apply, send: (1) a 1 page cover letter briefly describing how your education and experience fit the requirements of this position, (2) a detailed CV with descriptions of previous research projects and applied experience, (3) names and contact information for 3 references (names, addresses, e-mail addresses and phone numbers), (4) copies of recent publications, to Wendy MacCaull at wmaccaul at stfx.ca; Use the subject: HPC Verification and Health Care. Review of the applications will begin on January 9th 2012, with a start date as soon as possible. -- Adrian Rutle Postdoctoral Research Fellow, StFX University, Canada http://people.stfx.ca/arutle From wadler at inf.ed.ac.uk Wed Dec 28 13:25:31 2011 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Wed, 28 Dec 2011 18:25:31 +0000 Subject: [TYPES/announce] University of Edinburgh Chancellor's Fellowships Message-ID: The University of Edinburgh is investing in one hundred prestigious Chancellor's Fellowships. We expect a number of these to be awarded in Informatics. Specific areas of interest include: - Software Engineering: model?driven development, testing, verification and security - Computational Cognitive Science - Systems: particularly operating systems and multicore - Networks - Data Intensive Research - Modelling & Simulation 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 contact me if you are interested in applying. ----- The University of Edinburgh, a global top 20 University located in one of the world`s fine cities, is making a major investment in the future of its academic staff with the appointment of prestigious tenure-track Fellowships across all disciplines. These 5-year Fellowships are intended to support outstanding candidates at the start of their independent academic career. Up to 100 positions are available. A Chancellor`s Fellow will already show the ability to conduct world-leading research and exhibit clear potential to become an international leader in their discipline. The Fellow will be able to concentrate on research in the first instance, acquiring the full duties of University Lecturer across the period of the Fellowship. Subject to satisfactory review at the end of 3 years, the Fellow will move to an open contract on the University academic staff. Appointment will normally be made on the Lecturer scale (?36,862 - ?44,016), dependent on experience, and in exceptional circumstances a more senior appointment may be made. Some positions are available with immediate effect and it is expected that successful applicants will be in post from August 2012. Applications containing a detailed CV and a 1-page outline of a proposed research programme should be made online at www.jobs.ed.ac.uk to meet one of the closing dates below. General advice may be obtained by emailing chancellorsfellows at ed.ac.uk and specific details may be obtained from the appropriate Head of School. This is a rolling recruitment process so please submit your application by one of the following closing dates: 16th January 2012 29th February 2012 16th April 2012 Further particulars are available at: http://www.jobs.ed.ac.uk/vacancies/index.cfm?fuseaction=vacancies.detail&vacancy_ref=3015150 -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh /? \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From lbauer at cmu.edu Thu Dec 29 13:26:49 2011 From: lbauer at cmu.edu (Lujo Bauer) Date: Thu, 29 Dec 2011 13:26:49 -0500 Subject: [TYPES/announce] SACMAT 2012, 2nd CFP 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 have received this more than once, and happy holidays!) ========================================================= 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 13, 2012 - Paper submission due: January 20, 2012 - Demo proposal submission due: January 20, 2012 - Panel proposal submission due: January 20, 2012 - Notification to authors: March 2, 2012 - Camera-ready submission due: March 23, 2012 From georg.moser at uibk.ac.at Thu Dec 29 16:55:50 2011 From: georg.moser at uibk.ac.at (Georg Moser) Date: Thu, 29 Dec 2011 22:55:50 +0100 Subject: [TYPES/announce] Final Call For Papers RTA 2012 Message-ID: <4EFCE1E6.7030502@uibk.ac.at> ******************************************************** * Final Call For Papers * * 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 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) is the major forum for the presentation of research on rewriting. IMPORTANT DATES: Abstract: Jan 04, 2012 Paper Submission: Jan 09, 2012 Notification: Mar 02, 2012 Final version: Mar 26, 2012 RTA 2012 seeks original submissions 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; * Foundations: equational logic; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; combination; * 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; * Implementation: implementation techniques; parallel execution; rewrite and completion tools; confluence and termination checking; certification of rewriting properties; abstract machines; explicit substitutions; BEST PAPER AWARD: An award is given to the best paper or papers as decided by the program committee. STUDENT SUPPORT: Limited student support will be available and announced in future versions of this call. PROGRAMME COMMITTEE CHAIR: * Ashish Tiwari SRI International, Menlo Park, CA http://www.csl.sri.com/users/tiwari PROGRAMME COMMITTEE: * Andreas Abel Ludwig-Maximilians-University Munich * Zena Ariola University of Oregon * Paolo Baldan Universita degli Studi di Padova * Ahmed Bouajjani University of Paris 7 * Evelyne Contejean LRI Universite Paris-Sud-CNRS * Irene Anne Durand LaBRI Universite of Bordeaux * Joerg Endrullis Vrije Universiteit Amsterdam * Silvio Ghilardi Universita degli Studi di Milano * Guillem Godoy Universidad Politecnica de Cataluna * Nao Hirokawa Japan Advanced Institute of Science and Technology * Deepak Kapur University of New Mexico, Albuquerque, NM * Jordi Levy IIIA - CSIC * Paul-Andre Mellies University of Paris 7 * Pierre-Etienne Moreau Ecole des Mines de Nancy * Joachim Niehren INRIA Lille * Grigore Rosu University of Illinois at Urbana-Champaign * Albert Rubio Universidad Politecnica de Cataluna * Masahiko Sakai Nagoya University * Carolyn Talcott SRI International * Rene Thiemann University of Innsbruck CONFERENCE CHAIR: * Masahiko Sakai Nagoya University INVITED SPEAKERS: * Hirokazu Anai Fujitsu Labs. & Kyushu University * Claude Kirchner INRIA & LORIA * Sebastian Maneth NICTA & Univ. of New South Wales PUBLICATION: RTA 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. STACS, FSTTCS and ICLP proceedings also appear in LIPIcs. See http://www.dagstuhl.de/lipics for more information about LIPIcs. Accepted papers will be considered for publication in a special issue of the journal Logical Methods in Computer Science (LMCS). SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers, applications of rewriting techniques, problem sets, and system descriptions. The page limit for submissions is 10 proceedings pages for system descriptions and 15 proceedings pages for all other categories. Additional material may be provided 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. 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. Abstracts and papers must be submitted electronically through the EasyChair system at: http://www.easychair.org/conferences/?conf=rta2012 Questions concerning submissions may be addressed to the PC chair, Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com