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, conse