From sweirich at cis.upenn.edu Wed Jan 4 15:40:40 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Wed, 04 Jan 2006 15:40:40 -0500 Subject: [TYPES/announce] A new year, a new mailing list for announcements Message-ID: <43BC32C8.40109@cis.upenn.edu> Happy new year, everyone! I'm happy to announce the creation of a new mailing list: types-announce at lists.seas.upenn.edu This list is intended for conference and other announcements that are usually sent to TYPES. Anyone who is currently a member of the TYPES forum has been automatically subscribed to this list. If you do nothing, you will continue to get all of the same messages that normally appear in the TYPES forum. However, the headers of the two lists will be different. Normal types discussion will have the usual [TYPES] in the subject line and start with: [The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]. Posts to the announcement list will have [TYPES/announce] in the subject line and will start with: [The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce] Both lists are moderated and only list members may post. In either case, messages must be related to types and programming languages. If they are not obviously related, they should be prefaced by a short description of their relevance. Duplicate announcements will be rejected unless changes are highlighted at the top of the message. I will be using the same (somewhat lax) criteria as before to decide if an announcement, etc. is relevant. (Recently, 20 people told me that they were happy with the current policy vs.12 who wished for more stricter moderation.) To ease the transition to the new mailing list, for the next six months, all posts for either the TYPES discussion list or types-announce may be sent to the usual address: types at cis.upenn.edu. I will make sure that the messages are directed to the appropriate list. After that time, announcements must be sent only to types-announce at lists.seas.upenn.edu, so update your address books and publicity lists. Thanks, Stephanie Weirich TYPES Forum moderator From svb at doc.ic.ac.uk Thu Jan 5 12:08:19 2006 From: svb at doc.ic.ac.uk (Steffen van Bakel) Date: Thu, 5 Jan 2006 17:08:19 +0000 Subject: [TYPES/announce] Call for papers CL&C Message-ID: <1136480899.43bd528394c38@www.doc.ic.ac.uk> Call for Papers International Workshop on Classical Logic and Computation Associated to: ICALP 2006, S. Servolo, Venice - Italy (exact date to be announced) CL&C'06 is the first of a new conference series on "Classical Logic and Computation". It intends to cover all work aiming to propose a programming language inspired by classical logic, and a semantics for it. The fact that classical mathematical proofs of simply existential statements can be read as programs was established by Godel and Kreisel some 50 years ago. But the possibility of programming using a style inspired by Classical Logic (much as functional programming is inspired by Intuitionistic Logic) was taken seriously only after the seminal work of Griffin about typing continuations. There are today two main lines of research. The first studies some (version of lambda) calculus adapted to represent classical logic, like the symmetric mu-calculs, or the X-calculus. The second studies semantics for programs inspired by classical proofs, like game semantic or learning algorithms. These two directions are often independent. This workshop aims to start a fruitful exchange of ideas in the field. CL&C'06 is part of ICALP 2006. Publication: This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts outlining what will be presented at the workshop and of longer papers describing completed work, either published or unpublished, in the following areas: - types for calculi with continuations - design of programming languages inspired by classical logic, - witness extraction from classical proofs, - constructive semantics for classical logic (e.g. game semantics), - case studies (for any of the previous points) In order to make a submission: - Format your file in PS or PDF using the Springer LNCS Proceedings format (http://www.springer.com/sgw/cda /frontpage/0,11855,5-164-2-72376-0,00.html); we suggest a 20 page limit. - Use the submission links from http://www.doc.ic.ac.uk/~svb /CLaC Submissions will be refereed at normal standards. A participants' proceedings will be distributed at the workshop. A special issue of APAL associated with the workshop is being considered; this will be discussed at the workshop. Important dates: - Deadline for submission: April, 1. - Notification of acceptance: May, 15. - Final version due: June, 1. - Workshop dates: EITHER July 9 OR 15 OR 16. Programme committee: - Steffen van Bakel (Imperial College London): co-chair - Stefano Berardi (Turin): co-chair - Ulrich Berger (Swansea) - Theirry Coquand (Chalmers) - Pierre-Louis Curien (Paris VII) - Roy Dyckhoff (St Andrews) - Herman Geuvers (Nijmegen) - Hugo Herbelin (Inria) - Luke Ong (Oxford) - Michel Parigot (Paris VII) - Helmut Swichtenberg (Muenchen) - Phil Wadler (Edinburgh) Kind regards, Steffen van Bakel -------- Department of Computing, Imperial College London, 180 Queen's Gate, London SW7 2BZ, tel: + 44 20 7594 8263 fax: + 44 20 7581 8024 email: svb @ doc.ic.ac.uk http://www.doc.ic.ac.uk/~svb From ajp at inf.ed.ac.uk Fri Jan 6 01:35:30 2006 From: ajp at inf.ed.ac.uk (ajp@inf.ed.ac.uk) Date: Fri, 6 Jan 2006 06:35:30 +0000 Subject: [TYPES/announce] CMCS 06 Final CFP: deadline 8 January Message-ID: <1136529330.43be0fb2a6bce@mail.inf.ed.ac.uk> *** Final Call for Papers: Deadline 8 January (but do ask if you need another few days) *** CMCS 2006 8th International Workshop on Coalgebraic Methods in Computer Science http://conferences.inf.ed.ac.uk/cmcs06/cmcs06.html Vienna, Austria March 25-27, 2006 The workshop will be held in conjunction with the 9th European Joint Conferences on Theory and Practice of Software ETAPS 2006 March 25 - April 2, 2006 Aims and Scope During the last few years, it has become increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems, can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. The topics of the workshop include, but are not limited to: the theory of coalgebras (including set theoretic and categorical approaches); coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); coalgebras in (functional, object-oriented, concurrent) programming; coalgebras and data types; (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); coalgebras and algebras; coalgebraic specification and verification; coalgebras and (modal) logic; coalgebra and control theory (notably of discrete event and hybrid systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Previous workshops of the same series have been organized in Lisbon, Amsterdam, Berlin, Genova, Grenoble, Warsaw and Barcelona. The proceedings appeared as Electronic Notes in Theoretical Computer Science (ENTCS) Volumes 11,19, 33, 41, 65.1, 82.1 and 106. You can get an idea of the types of papers presented at the meeting by looking at the tables of contents of the ENTCS volumes from those workshops ENTCS Location CMCS 2006 will be held in Vienna on March 25-27, 2006. It will be a satellite workshop of ETAPS 2006, the European Joint Conferences on Theory and Practice of Software. Programme Committee John Power (chair,Edinburgh), Luis Barbosa (Minho), Neil Ghani (Nottingham), H. Peter Gumm (Marburg), Marina Lenisa (Udine), Stefan Milius (Braunschweig), Larry Moss (Bloomington), Jan Rutten (Amsterdam), Hendrik Tews (Dresden), Tarmo Uustalu (Tallinn), Hiroshi Watanabe (Osaka). Keynote Speaker: Peter O'Hearn (Queen Mary, University of London) Invited Speakers: Corina Cirstea (University of Southampton) Alexander Kurz (University of Leicester) Submissions Two sorts of submissions will be possible this year: Papers to be evaluated by the programme committee for inclusion in the ENTCS proceedings: These papers must be written using ENTCS style files and be of length no greater than 20 pages. They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. If a submission describes software, software tools, or their use, it should include all source code that is needed to reproduce the results but is not publicly available. If the additional material exceeds 5 MB, URL's of publicly available sites should be provided in the paper. Short contributions: These will not be published but will be compiled into a technical report of the University of Nottingham. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Both sorts of submission should be submitted in postscript or pdf form as attachments to an email to cmcs06 at cs.nott.ac.uk. The email should include the title, corresponding author, and, for the first kind of submission, a text-only one-page abstract. After the workshop, we expect to produce a journal proceedings of extended versions of selected papers to appear in Theoretical Computer Science. Important Dates Deadline for submission of regular papers: January 8, 2006. Notification of acceptance of regular papers: February 6, 2006. Final version for the preliminary proceedings: February 13, 2006. Deadline for submission of short contributions: February 28, 2006. Notification of acceptance of short contributions: March 6, 2006. For more information, please write to cmcs06 at cs.nott.ac.uk. From stevez at cis.upenn.edu Fri Jan 6 14:51:23 2006 From: stevez at cis.upenn.edu (Steve Zdancewic) Date: Fri, 06 Jan 2006 14:51:23 -0500 Subject: [TYPES/announce] CFP: Programming Languages and Analysis for Security (PLAS 2006) Message-ID: <43BECA3B.2080703@cis.upenn.edu> Call for Papers PLAS 2006 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security http://www.cis.upenn.edu/~stevez/plas06.html co-located with ACM SIGPLAN PLDI 2006 Conference on Programming Language Design and Implementation Ottawa, Canada, June 10, 2006 The goal of PLAS 2006 is to provide a forum for researchers and practitioners to exchange and understand ideas and to seed new collaboration on the use of programming language and program analysis techniques that improve the security of software systems. The scope of PLAS includes, but is not limited to: -- Language-based techniques for security -- Program analysis and verification (including type systems and model checking) for security properties -- Compiler-based and program rewriting security enforcement mechanisms -- Security policies for information flow and access control -- High-level specification languages for security properties -- Model-driven approaches to security -- Applications, examples, and implementations of these security techniques Submission: The deadline for submissions of technical papers is March 03, 2006. Papers must be formatted according the ACM proceedings format and should be no longer than 10 pages in this format. This 10 page limit includes everything (i.e., it is the total length of the paper). Email the submissions to stevez AT cis.upenn.edu. Submissions should be in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter and A4 sized paper. Templates for SIGPLAN-approved LaTeX format 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. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere (including journals and formal proceedings of conferences and workshops). See the SIGPLAN republication policy for more details http://www.acm.org/sigs/sigplan/republicationpolicy.htm Important dates: Submission deadline March 03, 2006 Notification of acceptance April 03, 2006 Final papers due April 24, 2006 Workshop June 10, 2006 Organizers: Steve Zdancewic, University of Pennsylvania, stevez AT cis.upenn.edu Vugranam C. Sreedhar, IBM T.J. Watson Research Center vugranam AT us.ibm.com Program Committee: Amal Ahmed, Harvard University, USA Anindya Banerjee, Kansas State University, USA Adriana Compagnoni, Stevens Institute of Technology, USA Elena Ferrari, University of Insubria at Como, Italy Michael Hicks, University of Maryland, USA Annie Liu, State University of New York at Stony Brook, USA Brigitte Pientka, McGill University, Canada Sriram Rajamani, Microsoft Research, India, Vugranam Sreedhar, IBM TJ Watson Research Center, USA Westley Weimer, University of Virginia, USA Steve Zdancewic, University of Pennsylvania, USA From martini at cs.unibo.it Mon Jan 9 04:51:42 2006 From: martini at cs.unibo.it (Simone Martini) Date: Mon, 9 Jan 2006 10:51:42 +0100 Subject: [TYPES/announce] Ackermann Award: Logic in Computer Science Message-ID: Call for submission The ACKERMANN AWARD EACSL Outstanding Dissertation Award for Logic in Computer Science. Deadline for submission: January 31, 2006 Eligible for the 2006 Ackermann Award are PhD dissertations in topics specified by the EACSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2004 and 31.12.2005. Full details can be found on http://www.dimi.uniud.it/~eacsl/award.html Thesis on type theory are welcome. ==================================================================== The Award The award consists of a diploma, an invitation to present the thesis at the CSL conference, the publication of the abstract of the thesis and the laudatio in the CSL proceedings, travel support to attend the conference. Jury The jury consists of seven members: The president of EACSL, J. Makowsky (Haifa); The vice-president of EACSL, D. Niwinski (Warsaw); One member of the LICS organizing committee (to be announced later); B. Courcelle (Bordeaux); E. Graedel (Aachen); M. Hyland (Cambridge); A. Razborov (Moscow and Princeton); From tarmo at cs.ioc.ee Sat Jan 7 06:13:38 2006 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sat, 07 Jan 2006 13:13:38 +0200 Subject: [TYPES/announce] MPC 2006 2nd Call for Papers Message-ID: <20060107111331.9E6F1BF08F@sool.cc.ioc.ee> MPC welcomes papers on dependently typed programming and types as guidance in program construction. NEWS: - Invited speakers: Robin Cockett, University of Calgary Olivier Danvy, Aarhus Universitet Oege de Moor, University of Oxford - The paper submission system is open. - Two satellite workshops: Constructive Methods for Parallel Programming, CMPP Mathematically Structured Functional Programming, MSFP SECOND CALL FOR PAPERS 8th International Conference on Mathematics of Program Construction MPC '06 Kuressaare, Estonia, 3-5 July 2006 http://cs.ioc.ee/mpc-amast06/mpc/ colocated with AMAST '06 Background The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably useful and usable in the process of constructing computer programs. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002) and Stirling, UK (2004, colocated with AMAST '04). The 2006 conference will be held at Kuressaare, Estonia, colocated with AMAST '06. Invited speakers Robin Cockett, University of Calgary Olivier Danvy, Aarhus Universitet Oege de Moor, University of Oxford Important dates * Submission of abstracts: 27 January 2006 * Submission of full papers: 3 February 2006 * Notification of authors: 17 March 2006 * Camera-ready version: 14 April 2006 Topics Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. Some typical areas are type systems, program analysis and transformation, programming language semantics, program logics. Theoretical contributions are welcome provided their relevance for program construction is clear. Reports on applications are welcome provided their mathematical basis is evident. Submission and publication Submission is in two stages. Abstracts (plain text) must be submitted by 27 January 2006. Full papers (pdf) adhering to the llncs style must be submitted by 3 February 2006. There is no official page limit, but authors should strive for brevity. The web-based submission system is open. Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. PC members may submit. Accepted papers must be presented at the conference by one of the authors. The proceedings of MPC '06 will be published in the Lecture Notes in Computer Science series of Springer-Verlag. After the conference, the authors of the best papers will be invited to submit revised versions to a special issue of the Science of Computer Programming journal of Elsevier. Programme committee Tarmo Uustalu, Institute of Cybernetics, Tallinn (chair) Roland Backhouse, University of Nottingham Eerke Boiten, University of Kent Venanzio Capretta, University of Ottawa Sharon Curtis, Oxford Brookes University Jules Desharnais, Universit? de Laval Jeremy Gibbons, University of Oxford Lindsay Groves, Victoria University of Wellington Ian Hayes, University of Queensland William Harrison, University of Missouri Johan Jeuring, Universiteit Utrecht Dexter Kozen, Cornell University Christian Lengauer, Universit?t Passau Lambert Meertens, Kestrel Institute Bernhard M?ller, Universit?t Augsburg Shin-Cheng Mu, University of Tokyo Jos? Oliveira, Universidade do Minho Alberto Pardo, Universidad de la Rep?blica Ross Paterson, City University London Ingrid Rewitzky, University of of Stellenbosch Varmo Vene, University of Tartu Satellite workshops Two workshops will be held in conjunction with MPC 2006 as satellites on 2 July 2006: 5th International Workshop on Constructive Methods for Parallel Programming, CMPP 2006 Workshop on Mathematically Structured Functional Programming, MSFP 2006 Venue Kuressaare (pop. 16000) is the main town on Saaremaa, the second-largest island of the Baltic Sea. Kuressaare is a charming seaside resort on the shores of the Gulf of Riga highly popular with Estonians as well as visitors to Estonia. The scientific sessions of MPC/AMAST 2006 will take place at Saaremaa Spa Hotel Meri, one among the several new spa hotels in the town. The social events will involve a number of sites, including the 14th-century episcopal castle. Accommodation will be at Saaremaa Spa Hotels Meri and R??tli. To get to Kuressaare and away, one must pass through Tallinn (pop. 402000), Estonia's capital city. Tallinn is famous for its picturesque medieval Old Town, inscribed on UNESCO's World Heritage List. Local organizers MPC/AMAST 2006 is organized by Institute of Cybernetics, a research institute of Tallinn University of Technology. The local organizers are Tarmo Uustalu (chair), Monika Perkmann, Juhan Ernits, Ando Saabas, Olha Shkaravska, Kristi Uustalu. Contact email address: mpc06(at)cs.ioc.ee. From pg at doc.ic.ac.uk Mon Jan 9 13:19:14 2006 From: pg at doc.ic.ac.uk (Philippa Gardner) Date: Mon, 09 Jan 2006 18:19:14 +0000 Subject: [TYPES/announce] research position at Imperial, process models for systems biology Message-ID: <43C2A922.9000701@doc.ic.ac.uk> Luca Cardelli and I have a three-year postdoctoral research position available at Imperial, to apply process-modelling techniques to the signalling of phagocytosis (the process of ingesting and destroying a bacteria or other foreign matter by certain kinds of cells). This position complements two other positions: one for a biologist, the other for a mathematician. Our difficult challenge is to bridge the gap between the experimental work, a predictive analysis using process models, and the very different analysis using differential equations. The details are given below: the deadline for applications is 10th February; please send informal enquiries to me. I'd be grateful if you would forward this email to candidates you think might be suitable. In particular, we are looking for someone with either a background in biology or at least a strong interest in the subject. Best wishes, Philippa Gardner pg at doc.ic.ac.uk -------------------------------------------------------------- Research Assistant/Associate Department of Computing, Imperial College London Title: Computational Modelling of Biological Processes Salary: ?26,120 - ?33,330 inclusive of London Allowance per annum Deadline for Applications: 10th February 2006 Applications are invited for the position of a research assistant/associate for up to three years to work on the application of process-modelling techniques to the signalling of phagocytosis. This position has been awarded to Dr Philippa Gardner and Dr Luca Cardelli (Microsoft Research Cambridge), funded by a large BBSRC/EPSRC grant to support a new Centre for Systems Biology at Imperial. It complements two equivalent positions (one for a biologist, one for a mathematician) in Centre for Molecular Microbiology and Infection & Division of Cell and Molecular Biology, to investigate the spatio-temporal control of phagocytic signalling during uptake of bacteria. We expect the three researchers to work closely together. Formal applications should be sent to the address at the end of this message. Please send informal enquiries to Philippa Gardner, email: pg at doc.ic.ac.uk Background of Project ---------------------- Recognition and uptake of bacteria, parasites and encapsulated DNA vaccines by professional phagocytes - macrophages, dendritic cells - is crucial for the induction of protective immunity. Live attenuated strains of intracellular pathogens such as Salmonella and Shigella have been shown to act as oral human and animal vaccines and as heterologous vaccine carriers capable of inducing protective responses to antigens from other viral, bacterial and eukaryotic pathogens. The mechanism of attenuation is crucial in determining vaccine efficacy, but the biology of this is unknown; in practice multiple mutants are screened in an empirical trial and error manner. It would be a major scientific advance if we were able to engineer improved vaccine strains on the basis of a rational understanding of the factors that determine their ability to stimulate a protective, lasting immune response. This may now be possible through a systems biology approach that can directly inform on logical targets for mutagenesis studies. Goals ----- The project has the objective of modeling such a biological system via process calculus techniques, and to augment the model as new knowledge is gathered via experiments. Information derived from modeling will be used to design new hypotheses to be tested in the experimental system. We will use process calculi to build a computer simulation of the uptake event, feeding in information from the biology relating to regulatory sequences, localization, and hierarchical issues. The general approach of process calculi modeling consists in first identifying appropriate discrete interactions that need to be modeled; these can be as detailed as individual chemical events or as abstract as membrane evolutions, or a combination of these. The basic interactions are embedded, in a fairly systematic and well-understood way, in a process language that also includes other general modeling operators (such as concurrent or stochastic interactions). The resulting modeling language can be used to describe and analyze complex biochemical systems, particularly emphasizing discrete and combinatorial aspects, in much the same way that a programming language can be used to describe complex software systems. We will build on previous work that uses stochastic process calculi for modeling both ordinary biochemical interactions and the dynamic evolution of compartments, particularly during endocytosis. The modeling component of the project will involve identifying a suitable modeling language, using it to encode the experimental knowledge of pathogen uptake as it is being acquired, and running simulations of the whole process, from the input stimuli to the formation and evolution of the phagosome. Applicants should complete an application form, downloadable from http://www.imperial.ac.uk/employment/academicform.htm. Applications will not be accepted unless they are on the correct form and clearly marked with the Job Reference Number PG Bio 05. The application form should be accompanied by a full CV with names and addresses of 3 referee and should be sent to: Mrs Nicola Rogers Department of Computing Imperial College London South Kensington Campus London, SW7 2AZ UK Email: n.c.rogers at imperial.ac.uk From sweirich at cis.upenn.edu Tue Jan 10 09:12:51 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Tue, 10 Jan 2006 09:12:51 -0500 Subject: [TYPES/announce] Workshop on Mechanizing Metatheory Message-ID: <43C3C0E3.1060607@cis.upenn.edu> 1st ACM SIGPLAN Workshop on Mechanizing Metatheory Portland, Oregon, USA Co-located with ICFP'06. Exact date TBA. Important Dates Submission deadline: June 3, 2006 Author Notification: July 1, 2006 Workshop: TBA Workshop Description Researchers in programming languages have long felt the need for tools to help formalize and check their work. With advances in language technology demanding deep understanding of ever larger and more complex languages, this need has become urgent. There are a number of automated proof assistants being developed within the theorem proving community that seem ready or nearly ready to be applied in this domain---yet, despite numerous individual efforts in this direction, the use of proof assistants in programming language research is still not commonplace: the available tools are confusingly diverse, difficult to learn, inadequately documented, and lacking in specific library facilities required for work in programming languages. The goal of this workshop is to bring together researchers who have experience using automated proof assistants for programming language metatheory and those who are interested in using tool support for formalizing their work. One starting point for discussion will be the POPLmark challenge: a set of challenge problems intended to assess the state of the art in this area. More information about the POPLmark challenge is available from http://www.cis.upenn.edu/proj/plclub/mmm. Format The workshop will consist of presentations by the participants, selected from submitted abstracts. It will focus on providing a fruitful environment for interaction and presentation of ongoing work. Participants are invited to submit working notes, source files, and abstracts for distribution to the attendees, but as the workshop has no formal proceedings, contributions may still be submitted for publication elsewhere. (See the SIGPLAN republication policy for more details http://www.acm.org/sigs/sigplan/republicationpolicy.htm) Scope The scope of the workshop includes, but is not limited to: * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * Libraries for programming language metatheory. * Formalization techniques, especially with respect to binding issues. * Analysis and comparison of solutions to the POPLmark challenge * Examples of formalized programming language metatheory * Proposals for new challenge problems that benchmark programming language work Submission Guidelines The deadline for submissions of abstracts is June 3, 2006. Email submissions to sweirich AT cis.upenn.edu. Submissions should be no longer than one page and in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter or A4 sized paper. Program Committee Karl Crary, Carnegie Mellon University Xavier Leroy, INRIA Rocquencourt Peter Sewell, Cambridge University Michael Norrish, Canberra Research Lab, National ICT Australia Stephanie Weirich, University of Pennsylvania (chair) Workshop Organizers Benjamin Pierce, University of Pennsylvania Stephanie Weirich, University of Pennsylvania Steve Zdancewic, University of Pennsylvania From ms at informatik.uni-kiel.de Tue Jan 10 10:47:00 2006 From: ms at informatik.uni-kiel.de (Martin Steffen) Date: 10 Jan 2006 16:47:00 +0100 Subject: [TYPES/announce] FMOODS 06: deadline extended: 22. Jan.! Message-ID: In response to authors' requests, the forthcoming deadlines for Fmoods'06 are extended as follows: ======================================================== 15. January: abstract submission 22. January: paper submission The new deadlines are _strict_! ======================================================== ------------------------------------------------------------ CALL FOR PAPERS FMOODS 2006 8th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems Bologna, Italy, 14 - 16 June, 2006 http://www.discotec06.cs.unibo.it/FMOODS06 In conjunction with DAIS 2006 and Coordination 2006 http://www.discotec06.cs.unibo.it/ o Invited speakers: - Jan Bosch, Software and Application Technologies Lab. Nokia Research Center - Jos? Luiz Fiadeiro, Department of Computer Science University of Leicester - Chris Hankin, Department of Computing Imperial College o 3 pre-conference workshops: - 2nd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord'06). - Security, Privacy, and Trust in Web Services. - 2nd International Workshop on Coordination and Organization (CoOrg'06). **************************************************************** IMPORTANT DATES: NEW 15 January 2006: Abstract submission NEW 22. January 2006: Paper submission 7. March 2006: Author notification 28. March 2006: Camera-ready copy 13. June 2006: pre-conference workshops 14. - 16. June 2006: FMOODS 2006 The 8th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS) is part of the federated conferences DisCoTec (Distributed Computing Techniques), together with the 8th International Conference on Coordination Models and Languages (COORDINATION) and the 6th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS). It will be organised by the Department of Computer Science of the University of Bologna. OBJECTIVES AND SCOPE: Established in 1996, the FMOODS series of conferences aims to provide an integrated forum for research on formal aspects of Open Object-based Distributed Systems. The conference will especially welcome novel contributions reflecting recent developments in the area, in particular component- and model-based design, service-oriented computing and software quality. Areas of interest include but are not limited to: - Semantics and implementation of object-oriented programming and (visual) modelling languages - Formal techniques for specification, design, analysis, verification, validation and testing - Model checking, theorem proving and deductive verification - Type systems and behavioural typing - Formal methods for service-oriented computing - Formal techniques for security and trust in global computing - Multiple viewpoint modelling and consistency between different views - Model transformations and refactorings - Software architectures - Integration of quality of service requirements into formal models - Component-based design - Applications (e.g.\ web services, multimedia, telecommunications) - Experience report on best practices and tools ORGANISERS: General chair: Gianluigi Zavattaro (U. of Bologna, IT) PC chairs: Roberto Gorrieri (U. of Bologna, IT) Heike Wehrheim (U. of Paderborn, DE) Publicity Chair: Martin Steffen (CAU Kiel, DE) Steering Committee: John Derrick (U. of Sheffield, UK) Roberto Gorrieri (U. of Bologna, IT) Elie Najm (ENST, Paris, FR) Program Committee: Lynne Blair (U. of Lancaster, UK) Eerke Boiten (U. of Kent, UK) Nadia Busi (U. of Bologna, IT) John Derrick (U. of Sheffield, UK) Alessandro Fantechi (U. of Firenze, IT) Colin Fidge (U. of Queensland, AUS) Robert France (Colorado State U., USA) Roberto Gorrieri (U. of Bologna, IT) Reiko Heckel (U. of Leicester, UK) Einar Broch Johnsen (U. of Oslo, N) Doug Lea (State U. of New York, USA) Elie Najm (ENST Paris, FR) Uwe Nestmann (TU Berlin, D) Erik Poll (U. of Nijmegen, NL) Arend Rensink (U. Twente, NL) Ralf Reussner (U. of Oldenburg, D) Bernhard Rumpe (TU Braunschweig, D) Martin Steffen (CAU Kiel, D) Carolyn Talcott (SRI International, USA) Andrzej Tarlecki (Warsaw University, PL) Vasco Vasconcelos (U. of Lisbon, P) Heike Wehrheim (U. of Paderborn, D) Elena Zucca (U. of Genova, IT) SUBMISSION GUIDELINES: The FMOODS 2006 conference 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. Submission will be electronically as postscript or PDF, using the SPRINGER LNCS style. Papers should not exceed 15 pages in length. Each paper will undergo a thorough process of review and the conference proceedings will be published by Springer Verlag in the LNCS series. Proceedings will be made available at the conference. From skalka at cs.uvm.edu Tue Jan 10 23:50:28 2006 From: skalka at cs.uvm.edu (Christian Skalka) Date: Tue, 10 Jan 2006 23:50:28 -0500 Subject: [TYPES/announce] PhD assistantships available at UVM Message-ID: <00b401c6166a$8b442040$0300000a@Pers> The Department of Computer Science (http://www.cs.uvm.edu) at the University of Vermont has open assistantship positions for PhD studies in 2006-07, in the form of Graduate Research Assistantships (GRAs) and Graduate Teaching Assistantships (GTAs). These assistantships are for incoming students studying towards the PhD degree in Computer Science. More information about applying for these positions is available online at: http://www.cs.uvm.edu/gradinfo/info/PhDOpportunities-06-07.shtml Successful applicants will have demonstrated interest in active research areas at UVM CS. Ongoing research projects of likely interest to readers of this mailing list include: - Static language-based access control. - Static enforcement of temporal program logics. - Distributed authorization logic. More information about these projects is available at: http://www.cs.uvm.edu/~skalka/skalka-pubs/skalka-projects.html The application deadline for Fall 2006 assistantship opportunities is February 1, 2006. ============================== Christian Skalka Assistant Professor Department of Computer Science University of Vermont http://www.cs.uvm.edu/~skalka ============================== From rene.david at univ-savoie.fr Thu Jan 12 03:01:11 2006 From: rene.david at univ-savoie.fr (=?ISO-8859-1?Q?Ren=E9_David?=) Date: Thu, 12 Jan 2006 09:01:11 +0100 Subject: [TYPES/announce] CLA'05 call for paper Message-ID: <43C60CC7.3060705@univ-savoie.fr> This is a reminder : the deadline for submission is January 31th. R David +==============================================+ CLA 2005 CALL FOR PAPERS +==============================================+ A proceedings volume of the best presentations of the "Computational Logic and Applications" workshop (Chamb?ry, June 20-21 2005) will be published electronically in "Discrete Mathematics and Theoretical Computer Science" (DMTCS). See http://www.dmtcs.org/proceedings/ Together with those papers, the editors wish to present recent work on connected topics and ask interested authors to submit short communications fitting with the topics of the workshop (see below). The 2005 CLA workshop was the third one on that topics (see program at www.lama.univ-savoie.fr/~david/CLA05). It was the occasion for 25 researchers from Krakow, Chamb?ry and Lyon to meet in a friendly atmosphere to present their recent work. The first CLA workshop took place in Krakow in 2002, the second one in Lyon in 2004. CALL FOR SUBMISSION Authors are invited to submit papers presenting original research on computational logic and theoretical aspects of computer science. The main (but not the only ones) topics of the workshop were - Probablistic aspects of computations and proofs - Asymptotic analysis of boolean functions - Analysis of online algorithms. SUBMISSIONS Authors are invited to submit a full paper of 5 to 10 pages on original research. The submissions will be refereed according to the usual rules based on an international panel of referees. The papers should be sent electronically as a pdf or dvi file to rene.david at univ-savoie.fr. IMPORTANT DATES Deadline for submission: January 31, 2006 Notification to authors: March 15, 2006 Final version: April 17, 2006 PUBLICATIONS Accepted papers will be published as an issue of DMTCS together with an account of lectures on "random boolean expressions" given by Daniele Gardy (Versailles). PROGRAM COMMITTEE Ren? David (Chamb?ry) Daniele Gardy (Versailles) Pierre Lescanne (Lyon) Marek Zaionc (Krakow) From lund.ketil at gmail.com Fri Jan 13 08:19:47 2006 From: lund.ketil at gmail.com (DAIS'06) Date: Fri, 13 Jan 2006 14:19:47 +0100 Subject: [TYPES/announce] DAIS'06 - EXTENDED DEADLINE Message-ID: In response to authors' requests, the forthcoming deadlines for DAIS'06 are extended as follows: ======================================================== 15. January: abstract submission 22. January: paper submission The new deadlines are *firm*! ======================================================== CALL FOR PAPERS 6th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems DAIS 2006 "From service-oriented architectures to self-managing applications" Bologna, Italy June 13-16, 2006 http://www.discotec06.cs.unibo.it/DAIS06/ To be held in conjunction with FMOODS 2006 and Coordination 2006 http://discotec06.cs.unibo.it ******** NEW ********** Abstract and paper submission is now open: http://conferences.cs.unibo.it/DAIS06 Invited speakers now ready http://discotec06.cs.unibo.it/invited.htm IMPORTANT DATES: NEW 15 January 2006: Abstract submission NEW 22. January 2006: Paper submission 31. January 2006: Work-in-progress papers: 7. March 2006: Author notification 28. March 2006: Camera-ready copy 13. June 2006: pre-conference workshops 14. - 16. June 2006: DAIS 2006 ABOUT THE CONFERENCE In recent years, distributed applications have indeed gained a practical and widely-known footing in everyday computing. Use of new communication technologies have brought up divergent application areas, including mobile computing, inter-enterprise collaborations, and ubiquitous services, just to name a few. New challenges include the need for service-oriented archi- tectures, autonomous and self-managing systems, peer-to-peer systems, grid computing, sensor networks, semantic enhancements, and adaptivity and dyna- micity of distribution constellations. The DAIS conference series addresses all aspects of distributed applications, including their design, implementation and operation, the supporting middleware, appropriate software engineering methodologies and tools, as well as experi- mental studies and practice reports. This time we welcome in particular contri- butions on architectures, models, technologies and platforms for interoperable, scalable and adaptable systems that are related to the latest trends towards service orientation and self-* properties. DAIS'06 is the sixth event in a series of successful international conferences which started in 1997. It will provide a forum for researchers, application and platform service vendors and users, to review, discuss and learn about new approaches, trends, concepts and experiences in the fields of distributed computing. Due to the success of the predecessor conferences and the emergence of many interesting and relevant new topics, DAIS has recently switched to a one-year-rhythm. CONFERENCE THEMES DAIS'06 solicits high quality papers reporting research results and/or experience reports. All papers must be original, unpublished, and not submitted simultaneously for publication elsewhere. DAIS'06 especially encourages submissions addressing the following topics: - novel and innovative applications in the areas of * enterprise computing * peer-to-peer systems and platforms * mobile computing * ubiquitous and pervasive computing * sensor networks - distributed application infrastructures * service-oriented frameworks, SOA, Web Services * component frameworks, such as CORBA Components, J2EE, .NET * peer-to-peer computing * mobile and wireless computing * Grid computing - software architectures supporting * autonomous systems * context-awareness * reconfiguration and adaptation * self-management * dependability - application integration and interoperability * enterprise-wide and inter-enterprise integration * integration vs. interoperability * semantic interoperability and semantic web services - life-cycle of distributed applications * modelling, specifying, monitoring and management * model-driven development and testing * tuning and re-engineering - dependability of distributed applications * trust and security * safety * fault-tolerance * dependability coordination in SOA SUBMISSION GUIDELINES Submissions must be done electronically as postscript or PDF, using the Springer LNCS style. DAIS'06 seeks: - Full technical papers in no more than 14 pages, - Work-in-progress papers, describing on-going work and interim results, in no more than 6 pages. Both categories of papers will be reviewed thoroughly by the DAIS'06 Program Committee. Accepted papers will appear in the conference proceedings published by Springer Verlag in the LNCS series. More specific guidelines on the preparation of papers can be found on the conference website. IMPORTANT DATES Abstract submission January 15, 2006 Full paper submission: January 22, 2006 Work-in-progress papers: January 31, 2006 Notification of acceptance: March 7, 2006 Camera ready version: March 28, 2006 Conference dates: June 14-16, 2006 VENUE & EVENT DAIS'06 will be held in the beautiful city of Bologna, Italy, colocated with the 8th IFIP Formal Methods for Open Object-Based Distributed Systems (FMOODS'06) and Coordination'06. Attendants of DAIS'06 will have the opportunity to attend the sessions of the two colocated conferences. Bologna, a historical capital of culture, was founded by the Etruscans in the VI century B.C. Bologna sits in the southern part of the historically and gastronomically famous Po River plain, a natural crossroads in northern Italy. Bologna's location was important not only for the trading of goods but also for the exchanging of ideas and the disseminating of culture. The Universit? di Bologna, founded in 1088 is the oldest university in the western world. Bologna is famous for its porticoes. Dating back to the 12th century the porticoes were used to enlarge houses to support the growing University community. Today 350,000 people call Bologna their home, of which 100,000 are students. Bologna, Italy's culinary capital, is also famous for its food. Furthermore, Bologna is surrounded by the famous food/wine regions of Parma, Modena, and Tuscany. Bologna is very accessible, being served by an international airport and one of the main hubs of the Italian railway system. Within easy access is Florence (1 hour), Milan (1.5 hours), Venice (1.5 hours), Rome (2.4 hours) and the ubiquitous Italian countryside of Emilia-Romagna and Tuscany. ORGANISERS General chair: Gianluigi Zavattaro, University of Bologna, Italy Steering committee: Lea Kutvonen, University of Helsinki, Finland Hartmut Koenig, BTU Cottbus, Germany Kurt Geihs, University of Kassel, Germany Elie Najm, ENST, Paris, France PC Chairs: Frank Eliassen, University of Oslo, Norway Alberto Montresor, University of Trento, Italy Publicity chair: Ketil Lund, Simula Research Laboratory, Norway Program committee: N. Alonistioti, University of Athens, Greece D. Bakken, Washington State University, USA A. Bartoli, University of Trieste, Italy Y. Berbers, Yolande, Katholieke Universiteit Leuven, Belgium A. Beugnard, ENST-Bretagne, France G. Blair, Lancaster University, UK A. Corsaro, Alenia Marconi System, Italy I. Demeure, ENST, France F. Eliassen, University of Oslo, Norway P. Felber, Universit? de Neuch?tel, Switzerland, K. Geihs, University of Kassel, Germany K. M. Goschka, Technical University of Vienna, Austria S. Graupner, HP Labs, USA R. Gr?nmo, SINTEF ICT, Norway D. Hagimont, INP Toulouse, France S. Hallsteinsen, SINTEF ICT, Norway S. Haridi, SICS, Sweden J. Indulska, University of Queensland, Australia E. Jul, Microsoft Research, Cambridge, UK A. Keller, IBM Thomas J. Watson Research Center, USA H. Koenig, BTU Cottbus, Germany R. Kroeger, Univeristy of Applied Sciences Wiesbaden, Germany H. Krumm, University of Dortmund, Germany L. Kutvonen, University of Helsinki, Finland W. Lamersdorf, University of Hamburg, Germany C. Linnhof-Popien, University of Munich, Germany K. Lund, Simula Research Laboratory, Norway R. Meier, Trinity College Dublin, Ireland A. Montresor, University of Trento, Italy E. Najm, ENST, France R. Oliveira, Universidade do Minho, Portugal K. Raymond, University of Queensland, Australia R. Schantz, BBN Technologies, USA A. Romanovsky, University of Newcastle upon Tyne, UK W. Schreiner, Johannes Kepler University Linz, Austria T. Senivongse, Chulalongkorn University, Thailand K. Sere, ?bo Akademi University, Finland J.-B. Stefani, INRIA, France N. Wang, Tech-X Corporation, USA -- Ketil Lund Publicity chair DAIS'06 From j.huitink at phil.ru.nl Sun Jan 15 14:15:19 2006 From: j.huitink at phil.ru.nl (J. Huitink) Date: Sun, 15 Jan 2006 14:15:19 -0500 Subject: [TYPES/announce] Final CfP: ESSLLI 2006 STUDENT SESSION Message-ID: <8dfbb5b7f467.43ca58f7@ru.nl> Final CALL FOR PAPERS ESSLLI 2006 STUDENT SESSION July 31 ? August 11, Malaga, Spain http://www.science.uva.nl/~katrenko/stus06 ---- apologies for multiple copies ---- We are pleased to announce the Student Session of the 18th European Summer School in Logic, Language and Information (ESSLLI), which will be held July 31 ? August 11, in M?laga, Spain. We invite papers for oral and poster presentation from the areas of Logic, Language and Computation. The aim of the Student Session is to provide students with the opportunity to present their work in progress and get feedback from senior researchers and fellow-students. The ESSLLI Student Session invites students at any level, undergraduates as well as graduates, to anonymously submit a full paper, no longer than 7 pages (including references). Papers should be submitted with clear indication of the selected modality of presentation, i.e. oral or poster. Accepted papers will be published in the Student Session Proceedings. Papers should describe original, unpublished work, complete or in progress, that demonstrates insight, creativity and promise. Previously published papers should not be submitted. As in previous years, the Student Session program committee will select the best paper in the oral session and the best paper in the poster session. The winner from each session may choose 500 euros worth of Springer books! The preferred format of submission is PDF. All submissions must be accompanied by a plain text identification page, and sent to esslli at science.uva.nl. Deadline for submission: February 1st, 2006. For more information about the Student Session, and for the technical details concerning submission, please visit our website at http://www.science.uva.nl/~katrenko/stus06. You may also contact the chairs (Janneke Huitink and Sophia Katrenko) at esslli at science.uva.nl. Important Dates: Deadline for Submission: February 1st, 2006 Notification of authors: April 1st, 2006 Proceedings Deadline: May 1st, 2006 ESSLLI: July 31 ? August 11, 2006 From types-list at m-strasser.de Mon Jan 16 09:13:08 2006 From: types-list at m-strasser.de (types-list@m-strasser.de) Date: Mon, 16 Jan 2006 15:13:08 +0100 Subject: [TYPES/announce] Int. Conference on Emerging Trends in Information and Communication Security 2006 - Submission deadline: January 22, 2006 Message-ID: <000e01c61aa6$fa4fe0b0$c710e684@tpc167> Apologies if you receive multiple copies of this message. To fulfil a desire of several authors we extend the submission deadline to 22.01.2006! Please take a look at the workshops offerd - http://www.etrics.org/workshops ============================== Call for Papers ============================= International Conference on Emerging Trends in Information and Communication Security /\ ||__^_ /\ ETRICS 2006 _/\_| \_||______________________________________________________________ Submission deadline: January 22, 2006 June 6-9, 2006, FREIBURG, GERMANY http://www.etrics.org ---------------------------------------------------------------------------- IN COOPERATION WITH: ACM SIGSAC IEEE DFG (German Research Foundation) GI (German Society for Computer Science) ---------------------------------------------------------------------------- CONFERENCE SCOPE: Protecting information and communication systems and services from malicious use is essential for their deployment and acceptance. In addition to applying techniques from traditional security research and security engineering, it is necessary to take into account the vulnerabilities originating from increased mobility at application level and the integration of security requirements into business processes. ETRICS solicits research contributions focusing on emerging trends in security and privacy. Submissions may present foundational research in security and privacy, report experiences from novel applications of security technologies, as well as discuss their changing impact on society and economy. ---------------------------------------------------------------------------- TOPICS of interest include but are not limited to: - Access control and secure audit - Analysis of security protocols - Anonymity services - Cryptographic primitives - Electronic payment systems - Enforcement of security policies - Language-based security - Privacy and identity management - Secure mobile code - Secure operating systems - Security requirements engineering - Security verification - Vulnerability and threat analysis ---------------------------------------------------------------------------- PAPER SUBMISSION: Papers submitted to ETRICS will be peer-reviewed and accepted papers will be published in a volume of Springer?s Lecture Notes in Computer Science. Submissions should clearly state the research contribution, their relevance to the conference theme, as well as their relation to prior research. Authors are invited to submit original, unpublished research papers limited to 15 pages following Springer?s guidelines. Papers must be submitted electronically in PDF format through the online submission system at http://www.etrics.org/PC/ and be received by January 6, 2006. Authors of accepted papers must sign a copyright statement and guarantee that their paper will be presented at the conference. ---------------------------------------------------------------------------- IMPORTANT DATES: Submission deadline: EXTEND TO January 22, 2006 Notification of authors: March 7, 2006 Final Submission due: March 17, 2006 ETRICS takes place: June 6-9, 2006 ---------------------------------------------------------------------------- PROGRAM COMMITTEE: - G?nter M?ller, U of Freiburg, Germany (Chair) - Gerhard Schneider, U of Freiburg, Germany (Co-Chair) Vijay Atluri, Rutgers University, USA Tuomas Aura, Microsoft Research, Cambridge, UK David Basin, ETHZ, Switzerland Elisa Bertino, Purdue University, USA Joachim Biskup, University of Dortmund, Germany Johannes Bl?mer, University of Paderborn, Germany Manfred Broy, TU M?nchen, Germany Jeremy Bryans, University of Newcastle, UK Johannes Buchmann, TU Darmstadt, Germany Jan Camenisch, IBM Research Lab., Switzerland Clemens Cap, University of Rostock, Germany David Chadwick, University of Kent, UK Richard Clayton, Cambridge University, UK Bruno Crispo, Vrije Universiteit Amsterdam, NL Frederic Cuppens, ?cole Nationale Sup?rieure des T?l?communications de Bretagne, France Mads Dam, Swedish Institute of Computer Science, Sweden Yves Deswarte, LAAS-CNRS, France Claudia Eckert, TU Darmstadt, Germany Simone Fischer-H?bner, Karlstad University, Sweden Willi Geiselmann, TH Karlsruhe, Germany Dieter Hutter, DFKI, Germany Sushil Jajodia, George Mason University, USA Matthias Jarke, RWTH Aachen, Germany Jan J?rjens, TU M?nchen, Germany George Kesidis, Pennsylvania State University, USA Hiroaki Kikuchi, Tokai University, Japan Hartmut K?nig, BTU Cottbus, Germany Kaoru Kurosawa, Ibaraki University, Japan Klaus-Peter L?hr, FU Berlin, Germany Norbert Luttenberger, Christian-Albrechts University, Germany Patrick McDaniel, Pennsylvania State University, USA Chris Mitchell, Royal Holloway University of London, UK Yuko Murayama, Iwate Prefectural University, Japan Andreas Pfitzmann, TU Dresden, Germany Birgit Pfitzmann, IBM Research Lab., Switzerland Reinhard Posch, Graz University of Technology, Austria Jean-Jaques Quisquater, Universit? Catholique de Louvain, Belgium Kai Rannenberg, Goethe University of Frankfurt, Germany Erwin Rathgeb, University of Duisburg-Essen, Germany Wolfgang Reif, University of Ausgburg, Germany Yves Roudier, Institut Eur?com, France Ryoichi Sasaki, Tokyo Denki University, Japan Andreas Schaad, SAP Research, Germany Christoph Schuba, SUN Microsystems Inc., USA Wolfram Schulte, Microsoft Research, USA Rainer Steinwandt, Florida Atlantic University, USA Werner Stephan, DFKI, Germany Stuart Stubblebine, Stubblebine Consultings LLC, USA Joachim Swoboda, TU M?nchen, Germany Tsuyoshi Takagi, Future University Hakodate, Japan Kazuo Takaragi, Hitachi Ltd., Japan Masato Terada, Hitachi Ltd., Japan Dirk Timmermann, University of Rostock, Germany Anna Vaccarelli, Istituto di informatica e Telematica-Consiglio Nazionale delle Ricerche, Italy Marianne Winslett, University of Illinois at Urbana-Champaign, USA Eric Yu, University of Toronto, Canada Alf Zugenmaier, Docomo Lab, M?nchen, Germany ---------------------------------------------------------------------------- Affiliated WORKSHOPS: (http://www.etrics.org/workshops) Workshop on Long-term Security This workshop aims at the discussion of recent advances in organizational and technical means to provide long-term security of digital data and communication. Submission deadline: 31 January 2006 URL: Workshop on Management of Security in Dynamic Systems Ubiquitous computing provides a capacity to reflect organizational and societal change in the supporting IT systems. This workshop focuses primarily on modern, outstanding approaches to provide security guarantees in dynamic systems, as well as practical experiences on deploying secure ubiquitous computing applications. Submission deadline: 15 April 2006 URL: Workshop on Security and Privacy in Future Business Services This workshop focuses on technical and economic mechanisms addressing the trade-off between privacy and individualization. It aims to bring together privacy experts on an international level to discuss recent advances in trust-promoting mechanisms. Submission deadline: 15 February 2006 URL: Workshop UbiComp and RFID today - Breakthrough or still on hold? This workshop is to discuss the current spreading and the future of RFID and Ubiquitous Computing by addressing amongst others the following issues: Successful applications; Emerging application areas; Deployment hurdles; and Technical progress. Submission deadline: 1 May 2006 URL: ---------------------------------------------------------------------------- ORGANIZING COMMITTEE: Markus Ruch (Organization Chair) Stefan Sackmann (Vice Organization Chair) Rafael Accorsi (Workshops) Lutz Lowis (Web) Oliver Prokein (Finance) Moritz Strasser (Exhibition & Events) Dirk von Suchodoletz (Equipment & Infrastructure) Sven Wohlgemuth (Program) ---------------------------------------------------------------------------- IN COOPERATION WITH: - DaimlerChrysler - Deutsche Bank - Deutsche Telekom - DoCoMo Euro-Labs - Endress + Hauser - Novartis - SAP - Siemens - Sparkasse Freiburg ? N?rdlicher Breisgau ---------------------------------------------------------------------------- CONTACT: Albert-Ludwigs-Universitaet Freiburg, Telematics - http://www.telematik.uni-freiburg.de Friedrichstr. 50 - D-79098 Freiburg, Germany E-mail: info at etrics.org Web: http://www.etrics.org ============================================================================ From suresh at cs.purdue.edu Mon Jan 16 13:44:15 2006 From: suresh at cs.purdue.edu (Suresh Jagannathan) Date: Mon, 16 Jan 2006 13:44:15 -0500 Subject: [TYPES/announce] Call for papers: Transact'06 Message-ID: <4C68FB22-3130-4807-9A1A-6650675A880C@cs.purdue.edu> [ Papers describing type systems for software transactions are most welcome. ] Call for Papers: ================ TRANSACT: First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing PLDI 2006 Ottawa, Canada, June 11, 2006 The goal of this workshop is to provide a forum for the presentation of research on all aspects of transactional computing. There has been much recent interest on extending programming languages, systems, and hardware with support for transactions, speculation, and related abstractions that provide alternatives to classical lock-based concurrency mechanisms. The goals of this workshop should be construed broadly to include any novel software or hardware techniques, algorithms, or implementations for transactional concurrency abstractions applicable to multi-core, multithreaded, or high- performance parallel systems. This workshop is intended to cover foundations of concurrent programming as it relates to all forms of transactional computing, as well as tools, techniques, and applications that leverage these principles. Experience reports are also welcome. The workshop seeks papers on topics related to all areas of software and hardware for new concurrency abstractions, models, and implementations. Topics of interest include (but are not limited to): * Transactional Memory * Debugging * Hardware support * Semantics and verification * Atomicity * Static analysis and * Non-blocking algorithms compiler optimizations * Memory models * Runtime implementations * Checkpointing * Persistence and I/O * Speculative concurrency * Applications Papers should present original research relevant to any of these areas of concurrent programming and should provide sufficient background material to make them accessible to the broader community. Papers focussed on foundations should indicate how the work can be used to advance practice; papers on experiences and applications should indicate how the experiments reinforce principles. Submissions due: March 1, 2006 Notification: April 15, 2006 Final version: May 15, 2006 Papers must be submitted in Postscript or PDF format. Hard copies of all research presentations and position papers will be distributed at the meeting. The conference web page will make available all slides from presentations given by the attendees, but the conference web page will not host papers. This is to ensure that the workshop is correctly understood to be an informal workshop, and that presentation of research at the workshop is not considered a barrier to republication of that research in conferences. Papers should be clearly labeled as either: 1. Research papers: These papers present new results which have not appeared and are not under submission elsewhere. These papers should not exceed 10 pages in ACM double column format. 2. Position/Experience papers: Short papers (<5 pages in ACM format). A special journal issue is being considered with a selection of the best research papers. Program Committee: Cliff Click, Azul Christos Kozyrakis, Stanford Laurent Daynes, Sun Peter O'Hearn, Queen Mary, U. of London Rick Hudson, Intel Bill Pugh, UMaryland Stephen Freund, Williams Ravi Rajwar, Intel Dan Grossman, Washington Nir Shavit, Sun Suresh Jagannathan, Purdue David Tarditi, Microsoft Mandana Vaziri, IBM General Chair: Jan Vitek, Purdue Program Chair: Suresh Jagannathan, Purdue Steering Committee: Tim Harris, Microsoft Doug Lea, SUNY Oswego Maurice Herlihy, Brown Eliot Moss, UMass Tony Hosking, Purdue Jan Vitek, Purdue -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060116/df57223d/attachment.html From pasalic at cs.rice.edu Tue Jan 17 17:25:49 2006 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Tue, 17 Jan 2006 16:25:49 -0600 Subject: [TYPES/announce] Call for Papers - GPCE'06 Message-ID: ------------------------------------------------------------------------ -- CALL FOR TECHNICAL PAPERS Fifth International Conference on Generative Programming and Component Engineering (GPCE'06) http://www.gpce.org/06/ October 22-26, 2006 Portland, Oregon (co-located with OOPSLA'06) Sponsored by ACM SIGPLAN, in cooperation with ACM SIGSOFT. Proceedings to be published by ACM Press. ------------------------------------------------------------------------ -- IMPORTANT DATES * Pre-submission: April 30, 2006 * Submission: May 5, 2006, 23:59, Apia time (firm deadline, no extensions) * Notification: June 28, 2005 SCOPE Generative and component approaches are revolutionizing software development similar to how automation and components revolutionized manufacturing. Generative Programming (developing programs that synthesize other programs), Component Engineering (raising the level of modularization and analysis in application design), and Domain-Specific Languages (elevating program specifications to compact domain-specific notations that are easier to write, maintain, and analyze) are key technologies for automating program development. GPCE provides a venue for researchers and practitioners interested in foundational techniques for enhancing the productivity, quality, and time-to-market in software development that stems from deploying standard componentry and automating program generation. In addition to exploring cutting-edge techniques for developing generative and component-based software, our goal is to foster further cross-fertilization between the software engineering research community and the programming languages community. ------------------------------------------------------------------------ -- SUBMISSIONS 10 pages in SIGPLAN proceedings style (sigplanconf.cls) reporting research results and/or experience related to the topics above (PC co-chairs can advise on appropriateness). We particularly encourage original high-quality reports on applying GPCE technologies to real-world problems, relating ideas and concepts from several topics, or bridging the gap between theory and practice. ------------------------------------------------------------------------ -- TOPICS GPCE seeks contributions in software engineering and in programming languages related (but not limited) to: * Generative programming Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, and step-wise refinement Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, and program transformation Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, and reflection * Generative techniques for Product-line architectures Distributed, real-time and embedded systems Model-driven development and architecture * Component-based software engineering Reuse, distributed platforms and middleware, distributed systems, evolution, patterns, development methods, deployment and configuration techniques, and formal methods * Integration of generative and component-based approaches * Domain engineering and domain analysis Domain-specific languages (DSLs) including visual and UML-based DSLs * Separation of concerns Aspect-oriented and feature-oriented programming, Intentional programming and multi-dimensional separation of concerns * Industrial applications Reports on applications of these techniques to real-world problems are especially encouraged, as are submissions that relate ideas and concepts from several of these topics, or bridge the gap between theory and practice. The program committee is happy to advise on the appropriateness of a particular subject. ------------------------------------------------------------------------ -- General Chair Stanislaw Jarzabek (National University of Singapore, Singapore) Program Committee Program Chairs: Douglas Schmidt (Vanderbilt University, USA) Todd Veldhuizen (Indiana University, USA) Program Committee Members: Giuseppe Attardi (University of Pisa, Italy) Elisa Baniassad (Chinese University of Hong Kong, China) Don Batory (University of Texas at Austin, USA) Ira Baxter (Semantic Designs, USA) Shigeru Chiba (Tokyo Institute of Technology, Japan) Charles Consel (INRIA/LaBRI, France) Krzysztof Czarnecki (University of Waterloo, Canada) Aniruddha Gokhale (Vanderbilt University, USA) Jeff Gray (U. of Alabama Birmingham, USA) George Heineman (Worcester Polytechnic Institute, USA) Zhenjiang Hu (University of Tokyo, Japan) H.-Arno Jacobsen (University of Toronto, Canada) Oleg Kiselyov (FNMOC, USA) Fabio Kon (University of S?o Paolo, Brazil) Karl Lieberherr (Northeastern University, USA) Joe Loyall (BBN Technologies, USA) Mira Mezini (Darmstadt University of Technology, Germany) Torben ?. Mogensen (DIKU, Denmark) Emir Pasalic (Rice University, USA) Calton Pu (Georgia Tech, USA) Tim Sheard (Portland State University, USA) Yannis Smaragdakis (Georgia Tech, USA) Michael Stal (Siemens, Germany) Peri Tarr (IBM TJ Watson, USA) Peter Thiemann (Freiburg University, Germany) Eelco Visser (Utrecht University, The Netherlands) Workshops/Tutorials chairs: Christa Schwanninger (Siemens, Germany) Arno Jacobsen (University of Toronto, Canada) Publicity chair: Emir Pasalic (Rice University, USA) Steering Committee: Don Batory (University of Texas at Austin, USA) Krzysztof Czarnecki (University of Waterloo, Canada) Ulrich Eisenecker (University of Leipzig, Germany) Stanislaw Jarzabek (National University of Singapore, Singapore) Eugenio Moggi (University of Genoa, Italy) Greg Morrisett (Harvard University, USA) Frank Pfenning (Carnegie Mellon University, USA) Tim Sheard (Portland State University, USA) Yannis Smaragdakis (Georgia Tech, USA) Walid Taha (Rice University, USA) For additional information, clarification, or questions please feel free to contact the Program Committee Co-chairs (Gpce06-chairs-l at mailman.rice.edu). ------------------------------------------------------------------------ -- GPCE Tutorials and Workshops GPCE Tutorials, extending over a half or full day, give a deeper or broader insight than conventional lectures. GPCE Workshops provide intensive collaborative environments, where generative and component technologists meet to discuss and resolve challenging problems in the field. Tutorial and workshop proposals are due Mar 18, 2006. From gustun at fing.edu.uy Wed Jan 18 09:24:45 2006 From: gustun at fing.edu.uy (Gustavo Betarte - INCO) Date: Wed, 18 Jan 2006 12:24:45 -0200 Subject: [TYPES/announce] Workshop on Formal Methods and Security In-Reply-To: References: Message-ID: <20060118122445.q2ufni7aos0ocgs0@www.fing.edu.uy> [- Apologies for multiple messages; - Pls note that the deadline for submission is March 31 ] Call for Papers Workshop on Formal Techniques for Specification and Analysis of Security (FTSAS 2006) http://www.fing.edu.uy/ftsas06 World Computer Congress - Security Stream August 20-25, Santiago de Chile Information technology is set to experience in the coming decades a massive and unprecedented increase in system complexity, leading to systems that integrate a vast spectrum of diverse technologies and heterogeneous intelligent devices by the billions in connected networks. The increasing complexity and distributed nature of systems will require the development of methodologies, languages, tools, and standards that facilitate interoperability and integration, and generalize deployment scenarios such as remote maintenance of devices. At the same time, the need for secure code will become more prominent, because the distinction between applications and systems will gradually disappear and most code will have consequences as regards security, and the task of writing secure code will become tremendously more difficult, because of the lack of effective support to integrate security considerations in system development. IT security is an area which involves important technical challenges because of the very high expectations of the market regarding the security properties information systems are expected to meet. The deployment of security mechanisms, though, is often done in an ad-hoc manner and lacking a precise security specification. Formal techniques provide a means to pinpoint precisely and analyze formally security requirements that arise in complex systems. Security is by its nature a global concern, the definition and the application of rigorous methodologies and the design and use of appropriate innovative tools should cover all the steps of the design, development and validation of IT products. The objective of the workshop is to bring together security experts and formal methods practitioners, who are interested in the application of formal methods in the design and validation of information systems. Topic of interest include: o specification and verification of security policies o language-based security for information flow and resource control o security based on verifiable evidence, Proof Carrying Code o system-wide security, security for concurrent and distributed systems o formal specification and verification of cryptographic protocols o cryptographic algorithms and provable security o trust management o digital rights management o case studies Paper Submission Authors are invited to submit an extended abstract explaining recent research results, work in progress or system descriptions. Papers shall not exceed 10 pages, inclusive of bibliography and appendices. They should be formatted for A4 or US letter paper with reasonable margins and fonts. The first page should include the title, the names and addresses of the authors, an abstract and a list of keywords. Accepted formats are limited to portable postscript and PDF. Please do not send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). The workshop has no formal proceedings. Nevertheless, informal proceedings will be made available in electronic format and they will be distributed to all participants of the workshop. The authors of the best papers might be invited to submit an extended revision for inclusion in formal proceedings. Important dates o Paper Submission due: March 31, 2006 o Notification: April 21, 2006 o Final papers due: May 30, 2006 Program Committe o Tom?s Barros Universidad Diego Portales, Chile o Gilles Barthe INRIA Sophia-Antipolis, France o Gustavo Betarte Universidad de la Rep?blica, Uruguay o Ricardo Corin University of Twente, Netherlands o Pedro D'Argenio Universidad Nacional de Cordoba, Argentine o Benjamin Gr?goire INRIA Sophia-Antipolis, France o German Puebla Universidad Polit?cnica de Madrid, Spain o Gerardo Schneider University of Oslo, Norway ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From scd at doc.ic.ac.uk Wed Jan 18 13:29:44 2006 From: scd at doc.ic.ac.uk (Sophia Drossopoulou) Date: Wed, 18 Jan 2006 18:29:44 +0000 Subject: [TYPES/announce] research position at Imperial; types for program verification Message-ID: <43CE8918.8020505@doc.ic.ac.uk> salary: ? 22.870 - ? 33,330 per annum, fixed term appointment up to 30 months supervisor: Sophia Drossopoulou Deadline for applications: 10th February 2006 We are looking for a Research Associate to work on the EU funded project Mobius to develop ownership (universe) type systems to be used for proof carrying code. The post involves - development of ownership type systems to support verification of object oriented programs - development of this type system for the JVM - concurrency - a prototype implementation - type inference More information at http://www.jobs.ac.uk/jobfiles/PY888.html Please email me with any further questions Sophia Drossopoulou http://www.doc.ic.ac.uk/~scd/index.html From terkel at imm.dtu.dk Sat Jan 21 06:27:30 2006 From: terkel at imm.dtu.dk (terkel@imm.dtu.dk) Date: Sat, 21 Jan 2006 12:27:30 +0100 (CET) Subject: [TYPES/announce] GLOBAN 2006 Summer School Message-ID: <61411.80.167.153.234.1137842850.squirrel@www2.imm.dtu.dk> [ Several lectures are on types and related topics. ] GLOBAN 2006 The Global Computing Approach to Analysis of Systems International Summer School at DTU, August 21-25, 2006 http://www.imm.dtu.dk/globan The one-week GLOBAN summer school will give doctoral students and other young researchers a comprehensive overview of contemporary techniques for analysis and verification of models of global computing systems characterized by concurrency, communication, heterogeneity and distribution. The school is organised by IMM/DTU in association with the SENSORIA project. LECTURERS Process Algebras and Concurrent Systems Rocco De Nicola, University of Florence, Italy Equality of processes: equivalences and proof techniques Davide Sangiorgi, University of Bologna, Italy Flow Logics Flemming Nielson, Technical University of Denmark Computing with relations using Horn clauses Helmut Seidl, Technical University of Munich, Germany Type systems Vasco Vasconcelos, University of Lisbon, Portugal Modal logics Lu?s Caires, New University of Lisbon, Portugal Model checking Kim Guldstrand Larsen, University of Aalborg, Denmark Stochastic modelling Stephen Gilmore, University of Edinburgh, Scotland IMPORTANT DATES 1 March 2006 Details of registration, participant fees and a grant scheme will be posted on webpage 1 May 2006 Deadline for registration 21 August 2006 Summer school starts 25 August 2006 Summer school ends VENUE The school will be held at the DTU campus in Lyngby near Copenhagen, Denmark. ORGANIZERS Hanne Riis Nielson Flemming Nielson Terkel K. Tolstrup Henning Makholm Eva Bing From michele at dsi.unive.it Sun Jan 22 15:27:14 2006 From: michele at dsi.unive.it (Michele Bugliesi) Date: Sun, 22 Jan 2006 21:27:14 +0100 Subject: [TYPES/announce] ICALP 2006 -- Call For Papers Message-ID: <43D3EAA2.8030503@dsi.unive.it> *** Apologies for multiple copies *** _______________________________________________________________________ 33rd International Colloquium on Automata, Languages and Programming ICALP'06 - CALL FOR PAPERS SUBMISSION DEADLINE: February 10, 2006 Conference July 9-16, 2006, Venice, Italy http://icalp06.dsi.unive.it ______________________________________________________________________ The 33rd International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science EATCS will take place from the 9th to the 16th of July 2006 in Venice, Italy. Following the successful experience of the 32nd edition in Lisbon, ICALP'06 will complement the established structure of the scientific program based on Tracks on Algorithms, Automata, Complexity and Games (A), and on Logic, Semantics, and Theory of Programming (B), corresponding to the two main streams of the journal Theoretical Computer Science, with a special Track (C). The aim of Track C is to allow a deeper coverage of a particular topic, to be specifically selected for each year's edition of ICALP on the basis of its timeliness and relevance for the theoretical computer science community. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A (Algorithms, Automata, Complexity and Games): Ingo Wegener, University of Dortmund, Germany (PC Chair) * Algorithmic Aspects of Networks * Algorithmic Game Theory * Analysis of Heuristics * Automata Theory * Combinatorics in Computer Science * Computational Biology * Computational Complexity * Computational Geometry * Data Structures * Design and Analysis of Algorithms * Internet Algorithmics * Machine Learning * Parallel and Distributed Computing * Quantum Computing Track B (Logic, Semantics, and Theory of Programming): Vladimiro Sassone, University of Southampton, UK (PC Chair) * Algebraic and Categorical Models * Automata and 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 (Security and Cryptography Foundations): Bart Preneel Katholieke Universiteit Leuven, Belgium (PC Chair) * Cryptographic Notions, Mechanisms, Systems and Protocols * Cryptographic Proof Techniques, Lower bounds, Impossibilities * Foundations of Secure Systems and Architectures * Logic and Semantics of Security Protocols * Number Theory and Algebraic Algorithms (Primarily in Cryptography) * Pseudorandomness, Randomness, and Complexity Issues * Secure Data Structures, Storage, Databases and Content * Security Modeling: Combinatorics, Graphs, Games, Economics * Specifications, Verifications and Secure Programming * Theory of Privacy and Anonymity * Theory of Security in Networks and Distributed Computing * Quantum Cryptography and Information Theory SUBMISSIONS 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 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 recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. To submit, please login at http://www.easychair.org/ICALP2006/ and follow the instructions. IMPORTANT DATES *************** * Submissions: February 10, 2006 * Notification: April 9, 2006 * Final version due: April 30, 2006 INVITED SPEAKERS ****************** * Cynthia Dwork (Microsoft Research, Silicon Valley, USA) * Alon Noga (Tel Aviv University, Israel) * Prakash Panangaden (McGill University, Canana) * Simon Peyton Jones (Microsoft Research, Cambridge, UK) PROGRAM COMMITTEE ****************** Track A * Harry Buhrman (University of Amsterdam, The Netherlands) * Mark de Berg (TU Eindhoven, The Netherlands) * Uriel Feige (Weizmann Institute, Isreal) * Anna Gal (University of Texas at Austin, USA) * Johan Hastad (KTH Stockholm, Sweden) * Edith Hemaspaandra (Rochester Institute of Technology, USA) * Kazuo Iwama (Kyoto University, Japan) * Mark Jerrum (University of Edinburgh, UK) * Stefano Leonardi (UniversitSpeakers di Roma, Italy) * Friedhelm Meyer auf der Heide (Univrsitat Paderborn, Germany) * Ian Munro (University of Waterloo, Canada) * Sotiris Nikoletseas (Patras University, Greece) * Rasmus Pagh (IT Univerisy of Copenhagen, Denmark) * Tim Roughgarden (Stanford University, USA) * Jacques Sakarovitch (CRNS Paris, France) * Jiri Sgall (Academy of Sciences, Prague, Czech Republic) * Hans Ulrich Simon (Ruhr-Universitat Bochum, Germany) * Alistair Sinclair (University of Berkeley, USA) * Angelika Steger (ETH Zurich, Switzerland) * Denis Therien ((McGill University, Canada) * Ingo Wegener (Universitat, Germany - PC Chair) * Emo Welzl (ETH Zurich, Switzerland) Track B * Roberto Amadio (Universite Paris 7, France) * Lars Birkedal (IT University of Copenhagen, Denmark) * Roberto Bruni (Universita di Pisa, Italy) * Mariangiola Dezani (Universita di Torino, Italy) * Volker Diekert (University of Stuttgart, Germany) * Abbas Edalat (Imperial College, UK) * Jan Friso Groote Eindhoven University of Technology, The Nederlands * Tom Henzinger (EPFL, Switzerland) * Madhavan Mukund (Chennai Mathematical Institute, INDIA) * Jean-Eric Pin (L.I.A.F.A, France) * Julian Rathke (University of Sussex, UK) * Jakob Rehof (Microsoft Research, Redmont, USA) * Vladimiro Sassone (Univerisity of Southampton, UK - PC chair) * Don Sannella (Univeriity of Edinburgh, UK) * Nicole Schweikardt (Humboldt-Universitat zu Berlin, Germany) * Helmut Seidl (Technische Universitat Munchen, Germany) * Peter Selinger (Dalhousie University, Canada) * Jerzy Tiuryn (Warsaw University, Poland) * Victor Vianu (U. C. San Diego, USA) * David Walker (Princeton University, USA) * Igor Walukiewicz (Labri, Universite Bordeaux, France) Track C * Martin Abadi (University of California at Santa Cruz, USA) * Christian Cachin (IBM Research, Switzerland) * Ronald Cramer (CWI and Leiden University, The Netherlands) * Ivan Damgard (University of Aarhus, Denmark) * Giovanni Di Crescenzo (Telcordia, USA) * Marc Fischlin (ETH Zurich, Switzerland) * Dieter Gollmann (University of Hamburg-Harburg, Germany) * Andrew D. Gordon (Microsoft Research, UK) * Aggelos Kiayias (University of Connecticut, USA) * Joe Kilian (Rutgers University, USA) * Cathy Meadows (Naval Research Laboratory, USA) * John Mitchell (Stanford University, USA) * Mats Naslund (Ericsson, Sweden) * Tatsuaki Okamoto (Kyoto University, Japan) * Rafael Ostrovksy (University of California at Los Angeles, USA) * Pascal Paillier (Gemplus, France) * Giuseppe Persiano (University of Salerno, Italy) * Benny Pinkas (HP Labs, Israel) * Bart Preneel (Katholieke Universiteit Leuven, Belgium - PC Chair) * Vitaly Shmatikov (University of Texas at Austin, USA) * Victor Shoup (New York University, USA) * Jessica Staddon (PARC, USA) * Frederik Vercauteren (Katholieke Universiteit Leuven, Belgium) Contact ADDRESSES: ****************** For further information see: http://icalp06.dsi.unive.it/ From fermin.reig at cs.nott.ac.uk Mon Jan 23 04:43:03 2006 From: fermin.reig at cs.nott.ac.uk (Fermin Reig) Date: Mon, 23 Jan 2006 09:43:03 +0000 Subject: [TYPES/announce] Spring School on "Datatype-generic programming", Call for Participation Message-ID: <1138009383.24731.5.camel@kiwi.cs.nott.ac.uk> ( The lecturers will discuss recent developments in type systems and programming languages. Apologies for multiple copies) Call for Participation Spring School on Datatype-Generic Programming http://www.cs.nott.ac.uk/ssdgp2006/ University of Nottingham, UK 24-27 April 2006 ************ Background and objectives ************ Generic programming is a thriving research area aimed at making programming more effective by making it more general. This school aims to give participants insights into the applications of datatype-generic programming and the current research challenges in the area. This school is a successor to the Summer School and Workshop on Generic Programming, held in Oxford in August 2002 (lecture notes appeared as volume 2793 of LNCS). ************ Technical programme ************ The lectures will be tutorial-style (as opposed to conference-style) and will be accessible to beginning computing science postgraduates. The scientific programme consists of six courses given by renowned specialists, and a student session. The list of courses is the following: * Thorsten Altenkirch (University of Nottingham): (in collaboration with Conor McBride and Peter Morris) Generic programming with dependent types * Jeremy Gibbons (University of Oxford): Design Patterns as Higher-Order Datatype-Generic Programs * Ralf Hinze (Universitat of Bonn): Generic Programming, Now! (in collaboration with Andres Loeh) * Johan Jeuring (Universiteit Utrecht): Comparing Approaches to Generic Programming (in collaboration with Ralf Hinze and Andres Loeh) * Ralf Laemmel (Microsoft) The next 700 traversal approaches * Tim Sheard (Portland State University): Putting the Curry-Howard Isomorphism to work. Copies of the draft lecture notes will be provided to all participants. The purpose of the student session is to give students an opportunity to present their work and get feedback. Registrants are invited to propose short talks (15-20 min). The selection will be based on abstracts of 150-400 words. ************ Social programme ************ A conference dinner will be organised (attendance at which will be charged seperately). ************ Organisers ************ Roland Backhouse (University of Nottingham) Jeremy Gibbons (University of Oxford) Ralf Hinze (Universitat Bonn) Johan Jeuring (Universiteit Utrecht) Fermin Reig (University of Nottingham) ************ Co-location ************ The Symposium on Trends in Functional Programming (TFP 2006), and the Conference of the Types Project (TYPES 2006) will be held in Nottingham the week before this spring school. ************ Registration and cost ************ To register, send an email to the following address: gp2006(at)cs.nott.ac.uk A small fee will be charged to cover photocopying of the draft proceedings, coffee, etc. ************ Accommodation ************ Participants are expected to arrange their own accommodation. See the school's web site for information about accommodation in the campus and its vicinity. ************ APPSEM ************ This is an APPSEM affiliated event. APPSEM funds can be used to support participants from APPSEM affiliated sites. ************ Further information ************ Web: http://www.cs.nott.ac.uk/ssdgp2006/ Email: gp2006(at)cs.nott.ac.uk This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From stevez at cis.upenn.edu Mon Jan 23 13:19:32 2006 From: stevez at cis.upenn.edu (Steve Zdancewic) Date: Mon, 23 Jan 2006 13:19:32 -0500 Subject: [TYPES/announce] 2nd CFP: Programming Languages and Analysis for Security (PLAS) 2006 Message-ID: <43D51E34.2060000@cis.upenn.edu> Note the revised submission & publication guidelines. ----------------------------------------------------------------------- Call for Papers PLAS 2006 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security http://www.cis.upenn.edu/~stevez/plas06.html co-located with ACM SIGPLAN PLDI 2006 Conference on Programming Language Design and Implementation Ottawa, Canada, June 10, 2006 The goal of PLAS 2006 is to provide a forum for researchers and practitioners to exchange and understand ideas and to seed new collaboration on the use of programming language and program analysis techniques that improve the security of software systems. The scope of PLAS includes, but is not limited to: -- Language-based techniques for security -- Program analysis and verification (including type systems and model checking) for security properties -- Compiler-based and program rewriting security enforcement mechanisms -- Security policies for information flow and access control -- High-level specification languages for security properties -- Model-driven approaches to security -- Applications, examples, and implementations of these security techniques Submission: We invite papers of two kinds: (1) Technical papers for "long" presentations during the workshop, and (2) papers for "short" presentations (10 minutes). Papers submitted for the long format should contain relatively mature content; short format papers can present more preliminary work, position statements, or work that is more exploratory in nature. The deadline for submissions of technical papers (for both the short and long presentations) is March 03, 2006. Papers must be formatted according the ACM proceedings format: "long" submissions should not exceed 10 pages in this format; "short" submissions should not exceed 4 pages. These page limits include everything (i.e., they are the total length of the paper). Papers submitted for the "long" category may be accepted as short presentations at the program committee's discretion. Email the submissions to stevez AT cis.upenn.edu. Submissions should be in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter and A4 sized paper. Templates for SIGPLAN-approved LaTeX format 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. Publication options: Authors of accepted papers may choose whether they would like their work published in a planned special issue of SIGPLAN Notices. Those papers that are not published in SIGPLAN Notices will only be considered part of the informal workshop proceedings and are therefor suitable for future publication in journal or other conference venues. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere (including journals and formal proceedings of conferences and workshops). See the SIGPLAN republication policy for more details http://www.acm.org/sigs/sigplan/republicationpolicy.htm Important dates: Submission deadline March 03, 2006 Notification of acceptance April 03, 2006 Final papers due April 24, 2006 Workshop June 10, 2006 Organizers: Steve Zdancewic, University of Pennsylvania, stevez AT cis.upenn.edu Vugranam C. Sreedhar, IBM T.J. Watson Research Center vugranam AT us.ibm.com Program Committee: Amal Ahmed, Harvard University, USA Anindya Banerjee, Kansas State University, USA Adriana Compagnoni, Stevens Institute of Technology, USA Elena Ferrari, University of Insubria at Como, Italy Michael Hicks, University of Maryland, USA Annie Liu, State University of New York at Stony Brook, USA Brigitte Pientka, McGill University, Canada Sriram Rajamani, Microsoft Research, India, Vugranam Sreedhar, IBM TJ Watson Research Center, USA Westley Weimer, University of Virginia, USA Steve Zdancewic, University of Pennsylvania, USA From wrla06 at csl.sri.com Tue Jan 24 01:32:24 2006 From: wrla06 at csl.sri.com (WRLA Acct (Denker)) Date: Mon, 23 Jan 2006 22:32:24 -0800 Subject: [TYPES/announce] WRLA 2006: accepted papers and call for system/tool demos Message-ID: <200601240632.k0O6WOId003285@fury.csl.sri.com> We are pleased to announce that the papers listed below have been accepted for presentation at the Workshop on Rewriting Logic and Applications, April 1-2, 2006 in Vienna Austria (an ETAPS 2006 workshop). Workshop url: http://www-formal.stanford.edu/clt/WRLA06 In addition to the accepted papers the workshop will feature Invited Speaker: Arvind A system and tools demo session (proposals due February 6, see WRLA06 website for instructions) And, for the first time, a rewrite engine competition will take place at WRLA. Its goal is to test the effectiveness of the various rewrite engines on different types of problems. The ultimate goal of the rewrite engine competition is to help colleagues that use term rewriting in their applications to choose the right rewrite engine. It is expected that some rewrite engines will outperform others on specific types of problems, but none will outperform all the others on all types of problems. More details will be made available on the WRLA06 website soon. ***************************************************************************** "Making Partial Order Reduction Tools Language-Independent", Azadeh & Meseguer "Maude MSOS Tool", Chalub & Braga "Distributive Rho-Calculus", Cirstea & Houtmann & Wack "Implementation of Mobile Maude", Duran & Verdejo & Riesco "A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters", Hill & Serbanuta & Rosu "A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis", Katelman & Meseguer "Abstraction and Model Checking of Core Erlan Programs in Maude", Neuhaeusser & Noll "Abstraction and Completeness for Real-Time Maude", Olvecky & Meseguer "Canonical Abstract Syntax Trees", Reilles "Solving Sudoku Puzzles with Rewriting Rules", Santos-Garcia & Palomino "Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics", Sasse & Meseguer "On Modelling Sensor Networks in Maude", Rodriguez "A Rewriting Logic Framework for Soft Constraints", Wirsing, Denker, Talcott, Poggio, & Briesemeister From akama at math.tohoku.ac.jp Tue Jan 24 04:44:58 2006 From: akama at math.tohoku.ac.jp (akama@math.tohoku.ac.jp) Date: Tue, 24 Jan 2006 18:44:58 +0900 Subject: [TYPES/announce] CFP:Fourth Workshop on Learning with Logics and Logics for Learning Message-ID: <43D5F71A.3050705@math.tohoku.ac.jp> CALL for PAPERS and PARTICIPATION Fourth Workshop on Learning with Logics and Logics for Learning (LLLL, L4) http://www.i.kyoto-u.ac.jp/~akihiro/LLLL2006.html Scope of the workshop : Logic is a fundamental and useful representation method in Artificial Intelligence. In the area of Machine Learning, various types of computational logic, such as logic programs, first-order logic, description logic, higher-order logic, have been used for representing knowledge obtained with various types of learning mechanisms including identification in the limit, PAC learning, on-line learning, EXACT learning, machine discovery, and learning based on Bayesian networks. On the other hand, machine learning procedures are used in giving semantics to logic and foundations of some procedures in mathematics. This workshop is proposed to bring together researchers who are interested in both of the areas of machine learning and computational logic, and to have intensive discussions on various relations between the two with making their interchange more active. Potential (but not exclusive) topics include : Learning and knowledge discovery using logics Algorithmic aspects of learning based on logics Logics for machine learning and knowledge discovery Logics using machine learning Machine learning as a foundation of mathematics/mathematical procedures Amalgamation of logic-based learning and statistical/information theoretical learning Learning and knowledge discovery from relational data Learning and knowledge discovery from structured/semi-structured data Learning and knowledge discovery from real-valued data Deadline of (first) paper submission: March 22, 2006 Notification of Acceptance: April 10, 2006 Deadline of camera ready submission: April 21, 2006 Workshop date: June 5 (Monday) or 6 (Tuesday), 2006 Workshop site: Tower Hall Funabori, Edogawa, Tokyo JAPAN http://www.city.edogawa.tokyo.jp/shisetsu/bunka/bunka1.html The working note (proceedings) will be published by JSAI for the workshop, and some outstanding papers will be published in a post proceedings book as a volume in Lecture Notes in Artificial Intelligence from Springer, with such papers from other collocated workshops. Workshop organizers : Akihiro Yamamoto (Kyoto University) Kouichi Hirata (Kyushu Institute of Technology) Ken Satoh (National Institute of Informatics) Workshop Web Page http://www.i.kyoto-u.ac.jp/~akihiro/LLLL2006.html Program Committee Yoji Akama (Tohoku University, Japan) Marta Arias (Columbia University, USA) Hiroki Arimura (Hokkaido University, Japan) Kouichi Hirata (Kyushu Institute of Technology, Japan) Eiju Hirowatari(The University of Kitakyushu, Japan) Tamas Horvath (Fraunhofer Institute, Germany) Katsumi Inoue (National Institute of Informatics, Japan) Roni Khardon (Tufts University, USA) Eric Martin (University of New South Wales, Australia) Shin-ichi Minato (Hokkaido University, Japan) Tetsuhiro Miyahara (Hiroshima City University, Japan) Luc de Raedt (University of Freiburg, Germany) M.R.K. Krishna Rao (King Fahd University of Petroleum and Minerals, Saudi Arabia) Ken Satoh (National Institute of Informatics, Japan) Joe Suzuki (Osaka University, Japan) Gyorgy Turan (University of Illinois at Chicago, USA) Hiroaki Watanabe(Imperial College London, UK) Akihiro Yamamoto (Kyoto University, Japan) Contact: Postal addess : Akihiro Yamamoto Graduate School of Informatics Kyoto University Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 JAPAN Email : akihiro at i.kyoto-u.ac.jp Tel: +81 75 753 5995 Fax: +81 75 753 5628 From padovani.luca at gmail.com Wed Jan 25 04:10:03 2006 From: padovani.luca at gmail.com (Luca Padovani) Date: Wed, 25 Jan 2006 10:10:03 +0100 Subject: [TYPES/announce] ANN: PiDuce Language Message-ID: <38F514A2-A1D6-421A-80FB-0798B6312D6D@gmail.com> We are pleased to announce the availability of the PiDuce programming language and its runtime environment. PiDuce is a concurrent, distributed language intended for experimenting emerging Web Services technologies. PiDuce can be used as a target language for compilers and processors of business languages such as BizTalk and BPel. It is a general guideline for the development of PiDuce to make extensive use of standard technologies for Web Services: PiDuce relies on the eXtensible Markup Language (XML) for data communication, it describes documents and patterns using XML Schema, it imports and exports Web Services using the Web Service Description Language (WSDL), and it supports the SOAP-over-HTTP method for physical communication. Underneath this technological cover, PiDuce builds on solid theoretical foundations: it integrates the communication primitives of the Pi calculus, the synchronization patterns of the Join calculus, and an expressive type system that extends XML datatypes with first-class channels and that retains a notion of subtyping. PiDuce is a type-safe language: well-typed process cannot fail. PiDuce has been developed in C# (version 2.0) and can run on Windows, MacOS, Linux and all the other operating systems supporting the free Mono implementation of the .NET framework. Further information, papers, the source code of the PiDuce compiler and runtime environment, as well as some examples of PiDuce programs accessing real-world Web services, can be found at http://www.cs.unibo.it/PiDuce/ We will be glad to receive comments and feedback about PiDuce. -- Samuele Carpineti, Cosimo Laneve, Leonardo Mezzina Department of Computer Science, University of Bologna. Luca Padovani Information Science and Technology Institute, University of Urbino. From kurz at mcs.le.ac.uk Mon Jan 30 06:17:35 2006 From: kurz at mcs.le.ac.uk (Alexander Kurz) Date: Mon, 30 Jan 2006 11:17:35 +0000 Subject: [TYPES/announce] MGS 2006 Message-ID: <43DDF5CF.5030702@mcs.le.ac.uk> [Apologies for multiple copies] ************************************************************* Midlands Graduate School 2006 in the Foundations of Computing ************************************************************* http://www.cs.le.ac.uk/~mgs2006 The Midlands Graduate School is taking place 8 - 12 April 2006 at the University of Leicester, UK. The School provides an intensive course of lectures on the Foundations of Computing. It is very well established, having run annually for the past six years, and has always proved a popular and successful event. This year we have Luke Ong, Oxford University and Thomas Streicher, Darmstadt University as guest lecturers. The lectures are aimed at graduate students, typically in their first or second year of study for a PhD. However, the school is open to anyone who is interested in learning more about mathematical computing foundations, and we especially invite participants from UK universities and from sites participating in the APPSEM working group. Foundational courses: R Crole Leicester Operational Semantics P Levy Birmingham Typed Lambda Calculus D Pattinson Leicester Category Theory Advanced courses: T Altenkirch Nottingham Quantum Programming M Escardo Birmingham Operational Domain Theory & Topology H Nilsson Nottingham Advanced Functional Programming L Ong Oxford Game Semantics T Streicher Darmstadt Constructive Logic E Tuosto Leicester Concurrency We expect to have some grants for UK students, while APPSEM funds can be used to support students from APPSEM affiliated sites. For further details and registration please visit http://www.cs.le.ac.uk/~mgs2006 Please register soon! Places and accommodation will be allocated on a first-come, first-serve basis. Roy Crole Alexander Kurz Dirk Pattinson From mir at ruc.dk Mon Jan 30 08:04:30 2006 From: mir at ruc.dk (Morten Rhiger) Date: Mon, 30 Jan 2006 14:04:30 +0100 Subject: [TYPES/announce] Third CFP: Trends in Functional Programming (TFP 2006) Message-ID: <1138626270.43de0edede6d9@webmail.ruc.dk> TFP 2006 Seventh Symposium on Trends in Functional Programming Nottingham, UK, 19 - 21 April, 2006 http://www.cs.nott.ac.uk/~nhn/TFP2006 Co-located with Types 2006 and Spring School on Datatype-Generic Programming CALL FOR PAPERS The Symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming languages, focusing on providing a broad view of current and future trends in Functional Programming. It aspires to be a lively environment for presenting the latest research results through acceptance by extended abstracts. A formal post-symposium refereeing process then selects the best papers presented at the symposium for publication in a high-profile volume. TFP 2006 is going to be held in Nottingham, UK, 19 - 21 April. Note that this is significantly earlier in the year than past TFPs that generally were held in August - September. TFP 2006 is co-located with Types 2006 (18 - 21 April). The TFP symposium is the successor to the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh, Scotland in 2003, in Munich, Germany in 2004, and in Tallinn, Estonia in 2005 (co-located with ICFP and GPCE). For further general information about TFP, see 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 categories of paper. High-quality papers are solicited in any of these categories: Research Papers: leading-edge, previously unpublished research work Position Papers: on what new trends should or should not be Project Papers: descriptions of recently started new projects Evaluation Papers: what lessons can be drawn from a finished project Overview Papers: summarising work with respect to a trendy subject Papers must be original, and not submitted for simultaneous publication in any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Also applications of functional programming techniques to other languages may be considered. Papers 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 and security o functional programming and mobility o functional programming and formally motivated computing o functional languages for telecommunications applications o functional languages for embedded systems o functional programming applied to global computing o functional GRIDs o functional languages for reasoning about imperative/object- oriented programs o interoperability with imperative programming languages o any new emerging trend in the functional programming area If you are in doubt on whether your paper is within the scope of TFP, please contact the TFP 2006 programme chair, Henrik Nilsson, nhn at cs.nott.ac.uk. BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. To acknowledge this, a prize for the best student paper is awarded each year. CO-LOCATION WITH TYPES 2006 AND DATATYPE-GENERIC PROGRAMMING 2006 TFP 2006 is co-located with Types 2006 (to be held 18 - 21 April). To take advantage of the synergies offered by these two complementary events, we will invite a number of joint keynote speakers, hold joint sessions on topics of mutual interest, such as dependently typed functional programming, and run common social events. The schedule will be arranged so that participants may freely move between parallel sessions of the two events. See http://www.cs.nott.ac.uk/types06/ for further details. TFP 2006 and Types 2006 are immediately followed by the Spring School on Datatype-Generic Programming 2006 (24 - 27 April), which should be of direct interest to many of the TFP and Types Participants. See http://www.cs.nott.ac.uk/ssdgp2006/ for further details. SUBMISSION AND LOCAL PROCEEDINGS Acceptance to the symposium is by extended abstracts of between 6 and 10 pages. Accepted abstracts are to be completed to full papers before the symposium for publication in the local symposium proceedings and on-line. Important dates: Deadline for abstract submission: 17 February, 2006 Notification of acceptance: 27 February, 2006 Registration deadline: 17 March, 2006 Camera-ready copy of full paper: 24 March, 2006 The submission must clearly indicate to which category it belongs: research, position, project, evaluation or overview paper. It should also indicate whether the main author or authors are research students. Abstracts and full papers must be written in English. Papers for the symposium proceedings must adhere to the formatting instructions provided on the TFP 2006 site. Papers must not exceed 16 pages; papers in some categories may comprise considerably fewer pages. The papers of the local proceedings will also be made available on-line under the following conditions, with which all authors are asked to agree: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. See the TFP 2006 website for further instructions to authors and details on how to submit. POST SYMPOSIUM REFEREEING AND PUBLICATION In addition to the local symposium proceedings, we intend to continue the TFP tradition of publishing a high-quality subset of contributions in the Intellect series on Trends in Functional Programming (see http://www.intellectbooks.co.uk/series.php?series=1). All TFP authors will be invited to submit revised papers after the symposium. These will will be refereed to normal conference standards, and a subset of the best 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. Papers submitted for publication by Intellect must follow formatting and any other instructions provided by the Programme Chair. For TFP 2005, in order to enhance the quality of student submissions, a process where student papers were given extra feedback was tried out. A similar process might be put in place for this TFP, contingent on the outcome of that trial. ORGANISATION Symposium Chair: Marko van Eekelen, Radboud University Nijmegen, NL Programme Chair: Henrik Nilsson, University of Nottingham, UK Treasurer: Greg Michaelson, Heriot-Watt University, UK Local Arrangements: Joel Wright, University of Nottingham, UK PROGRAMME COMMITTEE: o Kenichi Asai, Ochanomizu University o Gilles Barthes, INRIA, Sophia Antipolis o Olaf Chitil, University of Kent at Canterbury o Catherine Dubois, IIE, Evry o Marko van Eekelen, Radboud Universiteit Nijmegen o Jeremy Gibbons, Oxford University o Kevin Hammond, University of St Andrews o Zolt?n Horv?th, E?tv?s Lor?nd University o Frank Huch, Christian-Albrechts-University of Kiel o Johan Jeuring, Universiteit Utrecht o Greg Michaelson, Heriot-Watt University o Henrik Nilsson, University of Nottingham o Ricardo Pe?a, Universidad Complutense de Madrid o Morten Rhiger, Roskilde University o Colin Runciman, University of York o Carsten Sch?rmann, IT University of Copenhagen o Zhong Shao, Yale University o Phil Trinder, Heriot-Watt University SPONSORS We are actively looking for additional TFP sponsors, who may help to subsidise attendance by research students, for example. If you or your organisation might be willing to sponsor TFP, or if you know someone who might be willing to do so, please do not hesitate to contact the Symposium chair: Marko van Eekelen. Your students will be grateful! From zucker at cas.mcmaster.ca Mon Jan 30 10:12:57 2006 From: zucker at cas.mcmaster.ca (Jeffery Zucker) Date: Mon, 30 Jan 2006 10:12:57 -0500 (EST) Subject: [TYPES/announce] FM'06: 2nd CFP Message-ID: <200601301512.k0UFCvTU014775@birkhoff.cas.mcmaster.ca> FM'06: 14TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS 21 - 27 August 2006 McMaster University, Hamilton, Ontario, Canada http://fm06.mcmaster.ca/ SECOND CALL FOR PAPERS NOTE: SUBMISSIONS CAN NOW BE MADE THROUGH THE SUBMISSION SITE AT http://fm06.mcmaster.ca/submission.htm FM'06 is the fourteenth in a series of symposia organized by Formal Methods Europe, http://www.fmeurope.org, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The symposia have been notably successful in bringing together innovators and practitioners in precise mathematical methods for software development, industrial users as well as researchers. Submissions are welcomed in the form of original papers on research and industrial experience, proposals for workshops and tutorials, entries for the exhibition of software tools and projects, and reports on ongoing doctoral work. FM'06 welcomes all aspects of formal methods research, both theoretical and practical. We are particularly interested in the experience of applying formal methods in practice. The broad topics of interest of this conference are: * Tools for formal methods: tool support and software engineering, environments for formal methods. * Theoretical foundations: specification and modelling, refining, static analysis, model-checking, verification, calculation, reusable domain theories. * Formal methods in practice: experience with introducing formal methods in industry, case studies. * Role of formal methods: formal methods in hardware and system design, method integration, development process. TECHNICAL PAPERS Full papers should be submitted via the web site. Papers will be evaluated by the Program Committee according to their originality, significance, soundness, quality of presentation and relevance with respect to the main issues of the symposium. Accepted papers will be published in the Symposium Proceedings, to appear in Springer's Lecture Notes in Computer Science series, http://www.springeronline.com/lncs . Submitted papers should have not been submitted elsewhere for publication, should be in Springer's format, (see Springer's web site), and should not exceed 16 pages including appendices. A prize for the best technical paper will be awarded at the symposium. INDUSTRIAL USAGE REPORTS One day will be dedicated to sharing the experience -- both positive and negative -- with using formal methods in industrial environments. The Industry Day is organized by ForTIA, the Formal Techniques Industry Association, http://www.fortia.org . This year's Industry Day investigates the use of formal methods in security and trust. Invited papers on organizational and technical issues will be presented. Inquiries should be directed to the Industry Day Chairs; see the web site for details. WORKSHOPS We welcome proposals for one-day or one-and-a-half-day workshops related to FM'06. In particular, but not exclusively, we encourage proposals for workshops on various application domains. Proposals should be directed to the Workshop Chair. TUTORIALS We are soliciting proposals for full-day or half-day tutorials. The tutorial contents can be selected from a wide range of topics that reflect the conference themes and provide clear utility to practitioners. Each proposal will be evaluated on importance, relevance, timeliness, audience appeal and past experience and qualification of the instructors. Proposals should be directed to the Tutorial Chair. POSTER AND TOOL EXHIBITION An exhibition of both research projects and commercial tools will accompany the technical symposium, with the opportunity of holding scheduled presentations of commercial tools. Proposals should be directed to the Poster and Tools Exhibition Chair. DOCTORAL SYMPOSIUM For the first time, FM'06 will feature a doctoral symposium. Students are invited to submit work in progress and to defend it in front of "friendly examiners". Participation for students who are accepted will be subsidized. Submissions should be directed to the Doctoral Symposium Chair. SUBMISSION DATES Technical Papers, Workshops, Tutorials: Friday, February 24, 2006 Posters and Tools, Doctoral Symposium: Friday, May 26, 2006 NOTIFICATION DATES Technical Papers: Friday, April 28, 2006 Workshops, Tutorials: Friday, March 10, 2006 Posters and Tools, Doctoral Symposium: Friday, June 9, 2006 ORGANIZATION General Chair: Emil Sekerinski (McMaster) Program Chairs: Jayadev Misra (U. Texas, Austin), Tobias Nipkow (TU Munich) Workshop Chair: Tom Maibaum (McMaster) Tutorial Chair: Jin Song Dong (NUS) Tools and Poster Exhibition Chair: Marsha Chechik (U. Toronto) Industry Day Chairs: Volkmar Lotz (SAP France), Asuman Suenbuel (SAP US) Doctoral Symposium Chair: Augusto Sampaio (U. Pernambuco) Sponsorship Chair: Juergen Dingel (Queens U.) PROGRAM COMMITTEE Jean-Raymond Abrial (ETH Zurich) Alex Aiken (Stanford U.) Keijiro Araki (Kyushu U.) Ralph Back (Abo Akademi) Gilles Barthe (INRIA) David Basin (ETH Zurich) Ed Brinksma (U. Twente) Michael Butler (U. Southampton) Rance Cleaveland (U. Stony Brook) Jorge Cuellar (Siemens) Werner Damm (U. Oldenburg) Frank de Boer (U. Utrecht) Javier Esparza (U. Stuttgart) Jose Fiadeiro (U. Leicester) Susanne Graf (VERIMAG) Ian Hayes (U. Queensland) Gerard Holzmann (JPL) Cliff Jones (U. Newcastle) Gary T. Leavens (Iowa State U.) Rustan Leino (Microsoft) Xavier Leroy (INRIA) Dominique Mery (LORIA) Carroll Morgan (UNSW) David Naumann (Stevens) E.-R. Olderog (U. Oldenburg) Paritosh Pandya (TIFR) Sriram Rajamani (Microsoft) John Rushby (SRI) Steve Schneider (U. Surrey) Vitaly Shmatikov (U. Texas, Austin) Bernhard Steffen (U. Dortmund) P.S. Thiagarajan (NUS) Axel van Lamsweerde (U. Louvain) Martin Wirsing (LMU Munich) Pierre Wolper (U. Liege) LOCAL ORGANIZATION Publicity: Wolfram Kahl, Alan Wassyng, Jeff Zucker Tools, Posters, Book Exhibition: Spencer Smith Social Events: Ridha Khedri Local Arrangements:: William Farmer, Mark Lawford Events Co-ordinator: Ryszard Janicki From cortesi at unive.it Mon Jan 30 10:23:16 2006 From: cortesi at unive.it (Agostino Cortesi) Date: Mon, 30 Jan 2006 16:23:16 +0100 (CET) Subject: [TYPES/announce] ACM PPDP'06 Call for Papers Message-ID: ................................................................ PPDP 2006 Preliminary Call For Papers 8th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Venice, Italy, July 10-12, 2006 http://www.dsi.unive.it/ppdp2006/ ................................................................ IMPORTANT DATES Submission 15 March 2006 Notification 22 April 2006 SCOPE: PPDP 2006 is a forum for the declarative programming communities, gathering researchers working on logic, constraint and functional programming, but also on other programming language paradigms like visual programming, executable specification languages, database languages, AI and knowledge representation languages for the "semantic web". MAIN TOPICS: Logic, Constraint, and Functional Programming; Database, AI and Knowledge Representation Languages; Visual Programming; Executable Specification for Languages; Applications of Declarative Programming; Methodologies Program Design and Development; Declarative Aspects of Object-Oriented Programming; Concurrent Extensions to Declarative Languages; Declarative Mobile Computing; Paradigm Integration; Proof Theoretic and Semantic Foundations; Type and Module Systems; Program Analysis and Verification; Program Transformation; Abstract Machines and Compilation; Programming Environments. PROCEEDINGS: Proceedings will be published by ACM Press. RELATED EVENTS: PPDP 2006 will be co-located with the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), which will take place on July 9-16, 2006 (http://icalp06.dsi.unive.it) CONFERENCE CHAIR: Annalisa Bossi, U. Ca' Foscari di Venezia PROGRAM CHAIR: Michael Maher, National ICT Australia PROGRAM COMMITTEE: Nick Benton (Microsoft Research, UK) Annalisa Bossi (U. Ca' Foscari di Venezia, Italy) Manuel Chakravarty (U. NSW, Australia) Bart Demoen (K. U. Leuven, Belgium) Moreno Falaschi (U. Udine, Italy) Radha Jagadeesan (DePaul U., USA) Bharat Jayaraman (SUNY Buffalo, USA) Yukiyoshi Kameyama (U. Tsukuba, Japan) Andy King (U. Kent, UK) Francois Laburthe (Bouyges, France) David Sands (Chalmers U., Sweden) Christian Schulte (KTH, Sweden) Pascal Van Hentenryck (Brown U., USA) Roland Yap (NUS, Singapore) =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- prof. agostino cortesi tel. 0039 041 234.8450 dipartimento di informatica fax 0039 041 234.8419 universita' ca' foscari mail cortesi at dsi.unive.it via torino 155 url www.dsi.unive.it/~cortesi 30170 Venezia location: studio n.1 From mael at itu.dk Tue Jan 31 07:26:31 2006 From: mael at itu.dk (Martin Elsman) Date: Tue, 31 Jan 2006 13:26:31 +0100 Subject: [TYPES/announce] MLKit 4.3.0 Release Message-ID: Dear all, We are happy to announce the release of MLKit 4.3.0, a compiler for the programming language Standard ML. The MLKit provides the following features: * All of SML'97: The MLKit covers all of Standard ML, as defined in the 1997 edition of the Definition of Standard ML. The MLKit implements most of the latest Standard ML Basis Library specification. * ML Basis Files: The support for ML Basis Files makes it easy to compile large programs with different Standard ML compilers. Currently, both MLton and the MLKit supports the concept of ML Basis Files. The MLKit has a system, based on MLB-files, for avoiding unnecessary recompilation upon changes of source code. * Region-Based Memory Management: The MLKit integrates reference-tracing garbage collection with region-based memory management. Memory allocation directives (both allocation and deallocation) are inferred by the compiler, which uses a number of program analyses concerning lifetimes and storage layout. * Native backend for the x86 architecture. * Documentation. An updated comprehensive guide on programming with the MLKit is available from the MLKit wiki home page: http://www.itu.dk/research/mlkit The MLKit is available for download for the Linux operating system from the download section of the home page. Both binary and source packages are available. Contributions in terms of packages for various Linux distributions are welcome. Best Regards, Carsten Varming and Martin Elsman On behalf of the MLKit Team From txa at cs.nott.ac.uk Wed Feb 1 05:20:17 2006 From: txa at cs.nott.ac.uk (Thorsten Altenkirch) Date: Wed, 01 Feb 2006 10:20:17 +0000 Subject: [TYPES/announce] [types06] TYPES 2006 workshop Message-ID: <43E08B61.1040901@cs.nott.ac.uk> Registration for TYPES 2006 is now open. Early registration until 15/3/2006. Cheers, Thorsten -------------------------------------------------------------------------- TYPES 2006 Main Conference of the Types Project Nottingham, UK, 18-24 April 2006 http://www.cs.nott.ac.uk/types06/ This is the latest meeting in a series that started 1992, the last conference was in December 2004 in Paris. The topic of the meeting is formal reasoning and computer programming based on Type Theory : languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. TYPES 2006 is colocated with TFP 2006 (Trends in Functional Programming) and we plan to hold a joint session on Dependently Typed Programming. The conference takes place at Jubilee campus of the University of Nottingham, on-site accomodation will be available together with the registration. For more information see: http://www.cs.nott.ac.uk/types06/ We will open registration early next year. You will be able to submit your talk and abstract together with your registration. We will try to accomodate all talks which fit into the scope of the TYPES project. There will also be invited lectures. Please direct all emails related to TYPES 2006 to types06 at cs.nott.ac.uk Cheers, The Organisation Comittee Thorsten Altenkirch, James Chapman, Conor McBride, Peter Morris and Wouter Swiestra . -- Dr. Thorsten Altenkirch phone : (+44) (0)115 84 66516 Lecturer http://www.cs.nott.ac.uk/~txa/ School of Computer Science & IT University of Nottingham _______________________________________________ types06 mailing list types06 at cs.nott.ac.uk http://www.cs.nott.ac.uk/mailman/listinfo/types06 This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From txa at cs.nott.ac.uk Wed Feb 1 06:24:31 2006 From: txa at cs.nott.ac.uk (Thorsten Altenkirch) Date: Wed, 01 Feb 2006 11:24:31 +0000 Subject: [TYPES/announce] [types06] TYPES 2006 workshop (CORRECTED) Message-ID: <43E09A6F.10905@cs.nott.ac.uk> Registration for TYPES 2006 is now open. Early registration until 15/3/2006. Sorry, in my previous email I got the finishing date wrong, it is 21 April *not* 24 April. I apologize for the additional spam. Cheers, Thorsten -------------------------------------------------------------------------- TYPES 2006 Main Conference of the Types Project Nottingham, UK, 18-21 April 2006 http://www.cs.nott.ac.uk/types06/ This is the latest meeting in a series that started 1992, the last conference was in December 2004 in Paris. The topic of the meeting is formal reasoning and computer programming based on Type Theory : languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. TYPES 2006 is colocated with TFP 2006 (Trends in Functional Programming) and we plan to hold a joint session on Dependently Typed Programming. The conference takes place at Jubilee campus of the University of Nottingham, on-site accomodation will be available together with the registration. For more information see: http://www.cs.nott.ac.uk/types06/ We will open registration early next year. You will be able to submit your talk and abstract together with your registration. We will try to accomodate all talks which fit into the scope of the TYPES project. There will also be invited lectures. Please direct all emails related to TYPES 2006 to types06 at cs.nott.ac.uk Cheers, The Organisation Comittee Thorsten Altenkirch, James Chapman, Conor McBride, Peter Morris and Wouter Swiestra . -- Dr. Thorsten Altenkirch phone : (+44) (0)115 84 66516 Lecturer http://www.cs.nott.ac.uk/~txa/ School of Computer Science & IT University of Nottingham _______________________________________________ types06 mailing list types06 at cs.nott.ac.uk http://www.cs.nott.ac.uk/mailman/listinfo/types06 This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From Ralf.Lammel at microsoft.com Thu Feb 2 16:42:51 2006 From: Ralf.Lammel at microsoft.com (Ralf Lammel) Date: Thu, 2 Feb 2006 13:42:51 -0800 Subject: [TYPES/announce] RULE 2006 at FLoC --- paper deadline 14 May Message-ID: <1152E22EE8996742A7E36BBBA7768FEE087FE02B@RED-MSG-50.redmond.corp.microsoft.com> ====================================================================== Call for Papers RULE 2006 7th International Workshop on Rule-Based Programming http://www.dcs.kcl.ac.uk/events/RULE06/ Seattle, USA 11th August 2006 A satellite event of RTA 2006 at FLoC ======================================================================= The basic concepts of rule-based programming appear throughout Computer Science, from theoretical foundations to practical implementations. Term rewriting is used in semantics in order to describe the meaning of programming languages, as well as in the implementation of program transformation systems. Rules are used implicitly or explicitly to perform computations, e.g., in Mathematica, OBJ, ELAN, Maude or to perform deductions, e.g., by using inference rules to describe or implement a logic, theorem prover or constraint solver. Mail clients and mail servers use complex rules to help users organising their email and sorting out spam. Language implementations use bottom-up rewrite systems for code generation (as in the BURG family of tools.) Constraint-handling rules (CHRs) are used to specify and implement constraint-based algorithms and applications. Rule-based programming idioms also give rise to multi-paradigm languages like Claire. The purpose of this workshop is to bring together researchers from the various communities working on rule-based programming to foster advances in the theory of rule-based programming, cross-fertilization between theory and practice, research on rule-based programming methods, and the exploration of important application domains of rule-based programming. RULE 2006 will be a one-day satellite event of RTA 2006 at FLoC. Topics of interest ------------------ * Languages for rule-based programming - Expressive power, Idioms, Design patterns - Semantics, Type systems - Implementation techniques - System descriptions * Other foundations - Complexity results - Advances on rewriting logic - Advances on rewriting calculus - Static analyses of rule-based programs - Transformation of rule-based programs * Applications of rule-based programming, e.g.: - Program transformation - Software analysis and generation - System Control - Work-flow control - Knowledge engineering - System descriptions * Combination with other paradigms - Functional programming - Logic programming - OO programming - Biocomputing - Language extensions - Language embeddings Submissions and Publication: Papers (of at most 15 pages) should be submitted electronically via the submission page: http://www.easychair.org/RULE2006 Any problems with the submission procedure should be reported to one of the PC chairs: Maribel.Fernandez at kcl.ac.uk, Ralf.Lammel at microsoft.com Accepted papers will be published in the preliminary proceedings volume, which will be available during the workshop. The final proceedings will be published in Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier. IMPORTANT DATES - 14th May 2006: Deadline for electronic submission of papers - 15th June 2006: Notification of acceptance of papers - 30th June 2006: Deadline for final versions of accepted papers - 11th August 2006: Workshop Programme Committee: - Mark van den Brand (TU Eindhoven, Netherlands) - Horatiu Cirstea (LORIA, France) - Pierre Deransart (INRIA Rocquencourt, France) - Michael L. Collard (Kent State University, USA) - Martin Erwig (Oregon State University, USA) - Francois Fages (INRIA Rocquencourt, France) - Maribel Fernandez (Co-Chair, King's College London, UK) - Jean-Pierre Jouannaud (LIX, Ecole Polytechnique, France) - Oleg Kiselyov (FNMOC, USA) - Ralf Laemmel (Co-Chair, Microsoft, USA ) - Ugo Montanari (Universita di Pisa, Italy) - Pierre-Etienne Moreau (LORIA, France) - Tobias Nipkow (Technical University Munich, Germany) - Tom Schrijvers (K.U.Leuven, Belgium) - Martin Sulzmann (National University of Singapore, Singapore) - Victor Winter (University of Nebraska at Omaha, USA) From j.huitink at phil.ru.nl Fri Feb 3 08:17:05 2006 From: j.huitink at phil.ru.nl (Janneke Huitink) Date: Fri, 03 Feb 2006 14:17:05 +0100 Subject: [TYPES/announce] EXTENDED DEADLINE: ESSLLI STUDENT SESSION Message-ID: <4E9F82F1-2F84-4905-B253-286A49018787@phil.ru.nl> DEADLINE EXTENSION: FEBRUARY 15 ESSLLI 2006 STUDENT SESSION July 31 ? August 11, M?laga, Spain http://www.science.uva.nl/~katrenko/stus06 ---- apologies for multiple copies ---- Due to great popularity and many requests for individual extension, we have decided to extend the deadline of the Student Session of the 18th European Summer School in Logic, Language and Information (ESSLLI) to February 15. We invite papers for oral and poster presentation from the areas of Logic, Language and Computation. Submissions for poster presentations are especially encouraged. Authors that have already submitted a paper are allowed to resubmit. Student authors, undergraduates as well as graduates, are invited to anonymously submit a full paper, no longer than 7 pages (including references). Papers should be submitted with clear indication of the selected modality of presentation, i.e. oral or poster. Accepted papers will be published in the Student Session Proceedings. The preferred format of submission is PDF. All submissions must be accompanied by a plain text identification page, and be submitted online via http://www.easychair.org/StuSESSLLI2006/. Please visit our website at http://www.science.uva.nl/~katrenko/stus06 for more information about the Student Session and for the technical details concerning submission. If you have any questions, you may contact the chairs (Janneke Huitink and Sophia Katrenko) at esslli at science.uva.nl. Important Dates: Extended Deadline: Feburary 15, 2006 Notification of authors: April 1st, 2006 ESSLLI: July 31 - August 11, 2006 From jfoster at cs.umd.edu Sun Feb 5 15:36:30 2006 From: jfoster at cs.umd.edu (Jeff Foster) Date: Sun, 5 Feb 2006 15:36:30 -0500 Subject: [TYPES/announce] Summer School on Language-Based Techniques for Concurrent and Distributed Computing Message-ID: Call for Participation Summer School on Language-Based Techniques for Concurrent and Distributed Software July 12-21, 2006 University of Oregon Eugene, Oregon USA Registration Deadline: March 15, 2006. http://www.cs.uoregon.edu/activities/summerschool/summer06/ e-mail: summerschool at cs.uoregon.edu Program ------- This Summer School will cover current research in language-based techniques for concurrent and distributed software, ranging from foundational materials on sprinciples, logic and type systems to advanced techniques for analysis of concurrent software to the application of these ideas to practical systems. Material will be presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. The course is open to anyone interested. Prerequisites are an elementary knowledge of logic and mathematics that is usually covered in undergraduate classes on discrete mathematics. Some knowledge of programming languages at the level provided by an undergraduate survey course will also be expected. Our primary target group is PhD students. We also expect attendance by faculty members who would like to conduct research on this topic or introduce new courses at their universities. The program consists of more than thirty 80-minute lectures presented by internationally recognized leaders in programming languages and security research. Topics include: Static Analysis for Concurrency - Cormac Flanagan, University of California, Santa Cruz Design and Implementation of Concurrent Systems - Matthew Flatt, University of Utah Concurrency in Practice for C - Jeff Foster, University of Maryland, College Park Atomicity: Synchronization via Explicit Software Transactions - Dan Grossman, University of Washington Language-Based Techniques for Distributed Systems - Robert Harper, Carnegie Mellon University Making Concurrent Software Safer - Michael Hicks, University of Maryland, College Park Language Design for Concurrency - Charles Leiserson, Massachusetts Institute of Technology Software Model Checking - Shaz Qadeer, Microsoft Research Type-Safe and Version-Safe Distributed Programming - Peter Sewell, University of Cambridge Architectures for Concurrent Systems - Sandhya Dwarkadas, University of Rochester Venue ----- The summer school will be held at the University of Oregon, located in the southern Willamette Valley city of Eugene, close to some of the world's most spectacular beaches, mountains, lakes and forests. On Sunday, July 16, students will have the option of participating in a group activity in Oregon's countryside. Housing ------- The school will provide on-campus housing and meals. To share a room with another student attending the school, the cost is $460.00 (USD) per person. Housing rates are based on check-in Wednesday, July 12 and check-out before noon on Saturday, July 22. Some single rooms may be available for an additional fee of $130.00 (USD). If you'd like a single room, please indicate your choice and we will try to accommodate you on a first-come/first-served basis. Registration ------------ The cost for registration is $200.00 (USD) for graduate students, and $300.00 (USD) for other participants. Reigstration must be paid upon acceptance to the summer school, and is non-refundable. There are a limited number of grants available to fund part of the cost of student participation. If you are a graduate student and want to apply for grant money to cover your expenses, please also include a statement of your needs with your registration. Additional information about the program, registration, venue, and housing options is available on the web site. Or, you may request more information by email. To register for the Summer School, send a CV that includes a short description of your educational background and one letter of reference, unless you have already been granted a Ph.D. Please include your name, address and current academic status. Send all registration materials to summerschool at cs.uoregon.edu All registration materials should be delivered to the program by March 15, 2006. Materials received after the closing date will be evaluated on a space available basis. Non U.S. citizens should begin immediately to obtain travel documents. Organizers ---------- Organizing committee: Jeff Foster, Dan Grossman, and Zena Ariola Sponsors -------- ACM SIGPLAN From hilde at itu.dk Mon Feb 6 05:29:11 2006 From: hilde at itu.dk (Thomas Hildebrandt) Date: Mon, 06 Feb 2006 11:29:11 +0100 Subject: [TYPES/announce] CFP Workshop on Combining Theory and Systems Building in Pervasive Computing Message-ID: <43E724F7.4010209@itu.dk> NEWS: Journal Special Issue & Extension to the Paper Submission Deadline International Workshop on Combining Theory and Systems Building in Pervasive Computing http://www.smartlab.cis.strath.ac.uk/CTSB A Workshop of PERVASIVE 2006 http://www.pervasive2006.org Dublin, Ireland May 7th, 2006 Problem Space This workshop seeks to promote a combined systems building and theory approach in pervasive computing research, by bringing together researchers of the two, currently largely separate, communities, with the aim to share their experiences from work where this approach was followed, but more importantly to identify key areas within which this approach could be further nurtured and grown. Most of the pervasive computing research to date has focused on systems building with little attention paid to theoretical foundations of the models on top of which systems are built. Although it can be argued that this has traditionally been the case for systems research more generally, we believe that the particular characteristics of pervasive computing give cause to question the wisdom of this approach. The pervasive computing vision of computational capability deeply embedded into the physical environment means that system failures have the potential to cause serious disruption to human activities, or even endanger human lives. Moreover, the large scale and worldwide deployment of pervasive computing systems mean that it would be difficult to locally contain these effects. In this context, prudence would suggest that research prototypes should not leave the laboratory, until certain guarantees about their safe operation and deployment can be offered. We believe that this is exactly where theoretical tools can be utilised to great effect. Despite recent advances in theoretical research, like the development of calculi, logics and verification techniques for the analysis of security, communication and networking protocols; for the modelling and verification of resource usage guarantees by computational entities; and the modelling of context, a lot of work still remains to be done. The theoretical tools required by pervasive computing are still in the early stages of the development. As a result, we believe that we have currently reached a stage where a combined theory and systems building approach is the only sensible way of pushing pervasive computing research forward. In order to promote the combined research approach advocated above, and to explore ways in which it can be developed, this workshop focuses both on system models and semantics for pervasive computing. Consequently, the workshop seeks papers on the areas, but not limited to, listed below: 1.Pervasive computing systems models that would be usefully informed by further theoretical development for Context-awareness Self-management Privacy, Security and Trust 2.Pervasive computing formal models that may benefit systems development and/or themselves by being tested in real systems scenarios, including calculi, logics, semantic models, type systems and verification techniques for Context-aware and mobile computation Privacy, Security and Trust 3. Case studies of pervasive computing formally informed systems models 4. Experience reports from pervasive computing projects that followed the combined research approach Organising Committee Dan Chalmers, University of Sussex, UK Simon Dobson, University College Dublin, Ireland Thomas Hildebrandt, IT University of Copenhagen, Denmark Julian Rathke, University of Sussex, UK Sotirios Terzis, University of Strathclyde, UK [chair] Submission The workshop format will be focused around submission of position papers of no less than 6 and no more than 8 pages. Please submit your papers by email to Sotirios.Terzis (at) cis.strath.ac.uk in PS or PDF using the Springer LNCS Proceedings format (http://www.springer.com/sgw/cda/frontpage/0,11855,5-164-2-72376-0,00.html). Papers are solicited that either present particular formal or systems models that could stimulate the development of a combined theory and systems building research approach; present formally informed systems models as case studies on how the combined research approach could be realised; or report on the lessons drawn from research projects where the combined research approach was followed. Approximately two thirds of the workshop will be devoted to the presentation and discussion of these papers, while the remaining third of the time will be devoted to the design of a research roadmap for the closer integration of theory and systems building research in pervasive computing. Papers will be reviewed by at least 2 members of the programme committee which includes both researchers with systems building and theory background. The review process will be based upon identifying the relevance and potential of the paper to contribute in the identification of key areas for the development of the combined research approach and to stimulate discussion. A Pervasive 2006 workshop proceedings volume that would include all accepted papers is currently in negotiation. Appropriate publication of extended versions of workshop submissions and the summary of the workshop discussion is also being investigated. Journal Special Issue The authors of the best submissions, as nominated by the workshop programme committee, will be invited to submit for review extended versions of their papers for a special issue of the Computer Journal (http://comjnl.oxfordjournals.org/). Important Dates Workshop papers submission: February 12th, 2006 (extended) Workshop paper notification of acceptance: March 15th, 2006 Workshop papers camera-ready: March 24th, 2006 Workshop date: May 7th, 2006 Programme Committee Christian Becker, University of Stuttgart, Germany Michele Bugliesi, University Ca Foscari, Venice, Italy Michael Butler, University of Southampton, UK Roy Campbell, University of Illinois at Urbana-Champaign, US Dan Chalmers, University of Sussex, UK Simon Dobson, University College Dublin, Ireland Kurt Geihs, University of Kassel, Germany Karen Henricksen, University of Queensland and NICTA, Australia Thomas Hildebrandt, IT University of Copenhagen, Denmark Valerie Issarny, INRIA, France Jens B. J?rgensen, University of Aarhus, Denmark Christine Julien, University of Texas at Austin, US Aaron Quigley, University College Dublin, Ireland Fabio Martinelli, IIT, CNR, Italy Robin Milner, Cambridge University, UK Julian Rathke, University of Sussex, UK Arne Skou, Aalborg University, Denmark Sotirios Terzis, University of Strathclyde, UK From mantel at cs.rwth-aachen.de Tue Feb 7 01:38:07 2006 From: mantel at cs.rwth-aachen.de (Heiko Mantel) Date: Tue, 07 Feb 2006 07:38:07 +0100 Subject: [TYPES/announce] CFP: 3rd International Verification Workshop, VERIFY'06 Message-ID: <1139294287.8384.2.camel@localhost> CALL FOR PAPERS 3rd International Verification Workshop (VERIFY'06) What are the verification problems? What are the deduction techniques? in connection with IJCAR'06 at FLoC'06 August 15-16, 2006, Seattle, USA [http://www.ags.uni-sb.de/~omega/workshops/Verify06/] The formal verification of critical information systems has a long tradition as one of the main areas of application for automated theorem proving. Nevertheless, the area is of still growing importance as the number of computers affecting everyday life and the complexity of these systems are both increasing. The purpose of the VERIFY workshop series is to discuss problems arising during the formal modeling and verification of information systems and to investigate suitable solutions. Possible perspectives include those of automated theorem proving, tool support, system engineering, and applications. The VERIFY workshops aim at bringing together people who are interested in the development of safety and security critical systems, in formal methods, in the development of automated theorem proving techniques, and in the development of tool support. Practical experiences gained in realistic verifications are of interest to the automated theorem proving community and new theorem proving techniques should be transferred into practice. The overall objective of the VERIFY workshops is to identify open problems and to discuss possible solutions under the theme What are the verification problems? What are the deduction techniques? In 2006, VERIFY will specifically consider issues regarding the application of "tool support for formal modeling, verification and stepwise system development" without excluding submissions regarding other topics in the focus of the workshop. Therefore, submissions in this area are especially encouraged. Topics include (but are not limited to) + ATP techniques in verification + Information flow control + Case studies + Refinement & decomposition (specification & verification) + Combination of verification systems + Reliability of mobile computing + Integration of ATPs and CASE-tools + Reuse of specifications & proofs + Compositional & modular reasoning + Management of change + Experience reports on using + Safety-critical systems formal methods + Gaps between problems & techniques + Security models + Formal methods for fault tolerance + Tool support for formal methods Submissions are encouraged in one of the following two categories: A. Regular papers: Submissions in this category should describe previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. Papers must be formated following the Springer LNCS guidelines and be 6-15 pages long. B. Discussion papers: Submissions in this category are intended to initiate discussions and should address controversial issues, and may include provocative statements. Papers must be formated following the Springer LNCS guidelines and be 3-15 pages long. Submission of papers is via EasyChair at www.easychair.org/VERIFY-06/. Upon submission, the category (either A or B) must be indicated. The informal workshop proceedings will be distributed at the workshop. Final versions of accepted papers have to be prepared with LaTeX. Following up the workshop there will be a call for submissions to a special issue of the Journal of Automated Reasoning dedicated to the topics of VERIFY'06. Authors of accepted regular papers are especially encouraged to submit to this special issue. Program & WS Co-Chairs S. Autexier (DFKI & U. Saarbr?cken) H. Mantel (RWTH Aachen) Program Committee J.-R. Abrial (ETH Z?rich) B. Dutertre (SRI International) D. Gollmann (TU Hamburg-Harburg) R. H?hnle (Chalmers U.) D. Hutter (DFKI) A. Ireland (Heriot-Watt U.) D. Kapur (U. New Mexico, Albuquerque) J.-P. Katoen (RWTH Aachen) C. Kreitz (U. Potsdam) S. Merz (INRIA Lorraine) J. Richardson (NASA Ames) S. Rossi (U. Venezia) B. Sprick (U. Dortmund) L. Vigan? (ETH Z?rich) Important dates: Submission deadline: May 14, 2006 Notification of acceptance: June 19, 2006 Workshop e-mail: verification-ws at ags.uni-sb.de From aserebre at win.tue.nl Wed Feb 8 02:34:51 2006 From: aserebre at win.tue.nl (A Serebrenik) Date: Wed, 8 Feb 2006 08:34:51 +0100 (CET) Subject: [TYPES/announce] [ICLP'06] - Last Call for Papers - Deadline for Abstracts: February 14 Message-ID: CALL FOR PAPERS 22nd International Conference on Logic Programming ICLP'06 Seattle, Washington, USA, 17-20 August, 2006 http://www.cs.uky.edu/iclp06/ Part of Fourth Federated Logic Conference, FLoC 2006 http://research.microsoft.com/floc06/ SUBMISSION SITE http://www.easychair.org/ICLP06/ WE INVITE YOU TO SUBMIT PAPERS AND POSTERS!!!} CONFERENCE SCOPE Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: * Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge Representation. * Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. * Environments: Program Analysis, Program Transformation, Validation and Verification, Debugging, Profiling. * Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Programming Techniques. * Alternative Paradigms: Constraint Logic Programming, Abductive Logic Programming, Inductive Logic Programming, Answer Set Programming. * Applications: Deductive Databases, Data Integration, Software Engineering, Natural Language, Web Tools, Internet Agents, Artificial Intelligence. The three broad categories for submissions are: (1) technical papers, where specific attention will be given to work providing novel integrations of the areas listed above, (2) application papers, where the emphasis will be on their impact on the application domain as opposed to the advancement of the the state-of-the-art of logic programming, and (3) posters, ideal for presenting and discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. In addition to papers and posters, the technical program will include a plenary talk in association with other FLoC conferences, two ICLP invited talks, an advanced tutorial, Doctoral Consortium and several workshops. The workshops will be held on August 16 and August 21, 2006. PAPERS AND POSTERS Papers and posters must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English. Technical papers and application papers must not exceed 15 pages in the Springer LNCS format (cf. http://www.springer.de/comp/lncs/index.html). The limit for posters is 2 pages in that format. The primary means of submission will be electronic. Papers and posters must be submitted at http://www.easychair.org/ICLP06/submit/ PUBLICATION The proceedings of the conference will be published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. SUPPORT, SPONSORING AND AWARDS The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two awards for ICLP'06: for the best technical paper and for the best student paper. IMPORTANT DATES Papers Posters Abstract submission deadline 14 February Submission deadline 21 February 14 March Notification of authors 7 April 14 April Camera-ready copy due 2 May 2 May ICLP'2006 ORGANIZATION General Chair: Manuel Hermenegildo (herme at fi.upm.es) Program Co-Chairs: Sandro Etalle (s.etalle at utwente.nl) Mirek Truszczynski (mirek at cs.uky.edu) Workshop Chair: Christian Schulte (schulte at imit.kth.se) Doctoral Student Consortium: Enrico Pontelli (epontell at cs.nmsu.edu) Publicity Chair: Alexander Serebrenik (a.serebrenik at tue.nl) PROGRAM COMMITTEE Krzysztof Apt Annalisa Bossi Veronica Dahl Giorgio Delzanno Pierre Deransart Agostino Dovier Thomas Eiter Sandro Etalle, co-chair John Gallagher Michael Gelfond Hai-Feng Guo Manuel Hermenegildo Tomi Janhunen Fangzhen Lin Michael Maher Victor Marek Eric Monfroy Stephen Muggleton Brigitte Pientka Maurizio Proietti I.V. Ramakrishnan Peter van Roy Harald Sondergaard Mirek Truszczynski, co-chair German Vidal Andrei Voronkov Roland Yap DOCTORAL CONSORTIUM The ICLP Doctoral Consortium (DC) is the second doctoral consortium to be offered as part of ICLP-06. The DC builds on the experience of the 1st Doctoral Consortium on Logic Programming, held at ICLP-05. It is designed for doctoral students working in areas related to logic and constraint programming, who are planning to pursue a career in academia. The Doctoral Consortium aims to provide students with an opportunity to present and discuss their research directions and to obtain feedbacks from peers as well as world-renown experts in the field. The Doctoral Consortium will also offer invited speakers and panels discussions. More information can be found at http://www.cs.nmsu.edu/~epontell/DC2006/ . WORKSHOPS The ICLP-06 program will include several workshops. They provide a platform for the presentation of preliminary work and novel ideas in a less formal way than the conference itself. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The following workshops will be held in association with the ICLP-06 conference (please, refer to the conference website for links to workshop pages): * International Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services, ALPSWS2006, http://www.deri.at/events/workshops/alpsws2006/ * Colloquium on Implementation of Constraint and LOgic Programming Systems, CICLOPS, http://www.cs.nmsu.edu/lldap/CICLOPS06/ * International Workshop on Software Verification and Validation SVV 2006, http://www.comp.nus.edu.sg/~abhik/svv06/ * Preferences and Their Applications in Logic Programming Systems, http://www.cs.nmsu.edu/lldap/Prefs06/ * Search and Logic: Answer Set Programming and SAT, http://www.cs.sfu.ca/%7ESearchAndLogic/ * 16th Workshop on Logic-Based Programming Environments, WLPE 2006, http://lml.ls.fi.upm.es/%7Esusana/Conferences/WLPE06/ * MVLP'06: International Workshop on Multi-Valued Logic and Logic Programming website to be announced soon CONFERENCE VENUE The conference will be a part of the fourth Federated Logic Conference (FLoC'06) to be held August 10-21, 2006, in Seattle, Washington (http://research.microsoft.com/floc06/). Other participating conferences are: Computer-Aided Verification (CAV), Rewriting Techniques and Applications (RTA), Logic in Computer Science (LICS), Theory and Applications of Satisfiability Testing (SAT), and Int'l Joint Conference on Automated Reasoning (IJCAR). Plenary events involving multiple conferences are planned. From jhr at cs.uchicago.edu Thu Feb 9 23:23:40 2006 From: jhr at cs.uchicago.edu (John Reppy) Date: Thu, 9 Feb 2006 22:23:40 -0600 Subject: [TYPES/announce] ICFP 2006 Call for papers Message-ID: <75723F26-4B8E-4AA0-AD51-C85FB72DAD1D@cs.uchicago.edu> International Conference on Functional Programming (ICFP 2006) Call for Papers September 18-20, 2006 Portland, Oregon, USA Submission deadline: 7 April, 2006 http://icfp06.cs.uchicago.edu ICFP 2006 seeks original papers on the art and science of functional programming. Submissions are invited on all topics ranging from principles to practice, from foundations to features, 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 and concurrency. Particular topics of interest include: * Applications and domain-specific languages: Systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems and web programming, XML processing, security. * Foundations: Formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. * Design: Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming. * Implementation: Abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. * Transformation and analysis: Abstract interpretation, partial evaluation, program transformation. * Software-development techniques for functional programming: Design patterns, specification, verification, validation, debugging, test generation, tracing and profiling. * Practice and experience: Functional programming in education and industry. * Functional pearls: Elegant, instructive examples of functional programming. Papers in the last two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. A special issue of the Journal of Functional Programming will highlight selected papers from the meeting. Submission instructions are available at http://www.easychair.org/ ICFP2006/ The top submitted papers, as determined by the program committee, will be invited to submit journal versions for a special issue of JFP. Important Dates: Submission deadline: 7 April, 2006 On-line response to reviews: 14 May, 2006 Author notification: 273 May, 2006 Camera-ready copy: 26 June, 2006 Organizers: Conference Chair: John Reppy (University of Chicago) Program Chair: Julia Lawall (DIKU) Program Committee: Torben Amtoft (Kansas State University) Matthias Blume (Toyota Technological Institute at Chicago) Robby Findler (University of Chicago) Alain Frisch (INRIA Rocquencourt) Patricia Johann (Rutgers University) Yukiyoshi Kameyama (University of Tsukuba) Andres Loh (Universitat Bonn) Simon Marlow (Microsoft Research Ltd.) Greg Morrisett (Harvard University) Riccardo Pucella (Northeastern University) Doaitse Swierstra (Utrecht University) Mitch Wand (Northeastern University) Joe Wells (Heriot-Watt University) Hongwei Xi (Boston University) Steve Zdancewic (University of Pennsylvania) From ajp at inf.ed.ac.uk Sat Feb 11 10:41:42 2006 From: ajp at inf.ed.ac.uk (ajp@inf.ed.ac.uk) Date: Sat, 11 Feb 2006 15:41:42 +0000 Subject: [TYPES/announce] CMCS 06 Short Contributions final CFP Message-ID: <20060211154142.hao0gfvx4cg4cgoo@mail.inf.ed.ac.uk> This is the FINAL CALL for submissions to the Short Contributions section of CMCS 06, as advertised below. People are free to submit at any time; and if they need a prompt answer in order to apply for visas or accommodation or the like, please ask. ********************************************************************** CMCS 2006 8th International Workshop on Coalgebraic Methods in Computer Science http://conferences.inf.ed.ac.uk/cmcs06/cmcs06.html Vienna, Austria March 25-27, 2006 The workshop will be held in conjunction with the 9th European Joint Conferences on Theory and Practice of Software ETAPS 2006 March 25 - April 2, 2006 Aims and Scope During the last few years, it has become increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems, can be captured uniformly as coalgebras. Coalgebra is developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. The topics of the workshop include, but are not limited to: the theory of coalgebras (including set theoretic and categorical approaches); coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); coalgebras in (functional, object-oriented, concurrent) programming; coalgebras and data types; (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); coalgebras and algebras; coalgebraic specification and verification; coalgebras and (modal) logic; coalgebra and control theory (notably of discrete event and hybrid systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Previous workshops of the same series have been organized in Lisbon, Amsterdam, Berlin, Genova, Grenoble, Warsaw and Barcelona. The proceedings appeared as Electronic Notes in Theoretical Computer Science (ENTCS) Volumes 11,19, 33, 41, 65.1, 82.1 and 106. You can get an idea of the types of papers presented at the meeting by looking at the tables of contents of the ENTCS volumes from those workshops ENTCS Location CMCS 2006 will be held in Vienna on March 25-27, 2006. It will be a satellite workshop of ETAPS 2006, the European Joint Conferences on Theory and Practice of Software. Programme Committee John Power (chair,Edinburgh), Luis Barbosa (Minho), Neil Ghani (Nottingham), H. Peter Gumm (Marburg), Marina Lenisa (Udine), Stefan Milius (Braunschweig), Larry Moss (Bloomington), Jan Rutten (Amsterdam), Hendrik Tews (Dresden), Tarmo Uustalu (Tallinn), Hiroshi Watanabe (Osaka). Keynote Speaker: Peter O'Hearn (Queen Mary, University of London) Invited Speakers: Corina Cirstea (University of Southampton) Alexander Kurz (University of Leicester) Submissions Two sorts of submissions will be possible this year: Papers to be evaluated by the programme committee for inclusion in the ENTCS proceedings: These papers must be written using ENTCS style files and be of length no greater than 20 pages. They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. If a submission describes software, software tools, or their use, it should include all source code that is needed to reproduce the results but is not publicly available. If the additional material exceeds 5 MB, URL's of publicly available sites should be provided in the paper. Short contributions: These will not be published but will be compiled into a technical report of the University of Nottingham. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Both sorts of submission should be submitted in postscript or pdf form as attachments to an email to cmcs06 at cs.nott.ac.uk. The email should include the title, corresponding author, and, for the first kind of submission, a text-only one-page abstract. After the workshop, we expect to produce a journal proceedings of extended versions of selected papers to appear in Theoretical Computer Science. Important Dates Deadline for submission of regular papers: January 8, 2006. Notification of acceptance of regular papers: February 6, 2006. Final version for the preliminary proceedings: February 13, 2006. Deadline for submission of short contributions: February 28, 2006. Notification of acceptance of short contributions: March 6, 2006. For more information, please write to cmcs06 at cs.nott.ac.uk. From kwang at ropas.snu.ac.kr Sun Feb 12 05:02:01 2006 From: kwang at ropas.snu.ac.kr (Kwangkeun Yi) Date: Sun, 12 Feb 2006 19:02:01 +0900 Subject: [TYPES/announce] SAS'06 2nd Call For Papers Message-ID: ***************************************************************************** 2nd Call For Papers The 13th International Static Analysis Symposium (SAS'06) Seoul, Korea 29-31 August 2006 http://ropas.snu.ac.kr/sas06 ***************************************************************************** IMPORTANT DATES: PLEASE NOTE THE CHANGE OF DATES Submission: 14 April 2006 (<-------- was 7 April) Notification: 31 May 2006 (<-------- was 26 May) Camera-ready: 10 June 2006 SUMMARY Static Analysis is increasingly recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The Thirteenth International Static Analysis Symposium (SAS'06) will be held in Seoul, hosted by the Seoul National University. Previous symposia were held in London, Verona, San Diego, Madrid, Santa Barbara, Venice, Pisa, Paris, Aachen, Glasgow and Namur. The technical program for SAS'06 will consist of invited lectures, tutorials, presentations of refereed papers, and software demonstrations. Contributions are welcome on all aspects of Static Analysis, including, but not limited to abstract domains abstract interpretation abstract testing bug detection data flow analysis model checking new applications program specialization program verification security analysis theoretical frameworks type checking Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Survey papers, that present some aspect of the above topics with a new coherence, and application papers, that describe experience with industrial applications, are also welcomed. SUBMISSIONS INFORMATION - All submissions be submitted electronically online via the symposium web page http://ropas.snu.ac.kr/sas06. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. - Paper submissions should not exceed 15 pages in LNCS format, excluding bibliography and well-marked appendices. Program committee members are not required to read the appendices, and thus papers must be intelligible without them. - 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. - 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 will be published by Springer-Verlag's Lecture Notes in Computer Science series. PROGRAM CHAIR: Kwangkeun Yi (Seoul National U., Korea) Email: kwang at ropas.snu.ac.kr PROGRAM COMMITTEE: Anindya Banerjee (Kansas State U., USA) Wei-Ngan Chin (National U. of Singapore, Singapore) Patrick Cousot (ENS Paris, France) Roberto Giacobazzi (U. of Verona, Italy) Chris Hankin (Imperial College, UK) Luddy Harrison (U. of Illinois at Urbana-Champaign, USA) Naoki Kobayashi (Tohoku U., Japan) Oukseh Lee (Hanyang U., Korea) Alan Mycroft (U. of Cambridge, UK) Kedar Namjoshi (Bell Labs., USA) Jens Palsberg (UCLA, USA) Andreas Podelski (Max-Planck-Institut, Germany) Ganesan Ramalingam (IBM T.J.Watson, USA) Radu Rugina (Cornell U., USA) Harald Sondergaard (U. of Melbourne, Australia) Zhendong Su (UC Davis, USA) Reinhard Wilhelm (U. des Saarlandes, Germany) ************************************************************************ From carlos.martin at urv.net Mon Feb 13 12:51:39 2006 From: carlos.martin at urv.net (D.FILROM - CARLOS MARTIN VIDE) Date: Mon, 13 Feb 2006 18:51:39 +0100 Subject: [TYPES/announce] visiting research positions 2006-1 Message-ID: Apologies for multiple posting! Please, pass the information to whom may be interested. Thanks. ---------------------- 1-2 visiting research positions may be available in the Research Group on Mathematical Linguistics at Rovira i Virgili University (Tarragona, Spain). The web site of the host institute is: http://www.grlmc.com ELIGIBLE TOPICS - Language and automata theory and its applications. - Biomolecular computing and nanotechnology. - Bioinformatics. - Language and speech technologies. - Formal theories of language acquisition and evolutionary linguistics. - Computational neuroscience. Other related fields might still be eligible provided there are strong enough candidates for them. JOB PROFILE - The positions are intended for experienced, prestigious researchers willing to develop a research project in the framework of the host institute for 3-12 months, starting in 2007. Some doctoral teaching and supervising are expected, too. - They will be filled in under the form of a grant. - There is no restriction on the candidate's age. ELIGIBILITY CONDITIONS - Having been awarded the PhD degree earlier than 2001. - Holding a stable position and being on sabbatical leave from her/his home organization. - Having got the rank of Professor or a comparable rank in industry. ECONOMIC CONDITIONS - A nontaxable monthly allowance amounting 1,500-3,000 euros, depending on the researcher's merits and her/his other sources of income during the stay. - A travel allowance. - Health coverage at the researcher?s request. EVALUATION PROCEDURE It will consist of 2 steps: - a pre-selection based on CV and carried out by the host institute, - an application by the shortlisted candidates, to be assessed externally by the funding agency, including CV, research project (up to 8 pages long), and workplan. SCHEDULE Expressions of interest are welcome until February 19, 2006. They should simply contain the candidate's CV and mention "2006-1" in the subject line. The outcome of the pre-selection will be reported immediately after. Pre-selected candidates will be supported in the application process by the host institute. The deadline for completing the whole process is March 5, 2006. Final results will be available not earlier than August 2006. CONTACT Carlos Martin-Vide carlos.martin at urv.net From andrei at cs.chalmers.se Mon Feb 13 15:06:47 2006 From: andrei at cs.chalmers.se (Andrei Sabelfeld) Date: Mon, 13 Feb 2006 21:06:47 +0100 Subject: [TYPES/announce] ESORICS 2006 Call For Papers Message-ID: <43F0E6D7.40401@cs.chalmers.se> [Language-based security submissions in general and type-based security submissions in particular are warmly welcome! -Andrei] ESORICS 2006 11th European Symposium On Research In Computer Security Hamburg, Germany | 18 -- 20 September 2006 Call for Papers =============== Papers offering novel research contributions in any aspect of computer security are solicited for submission to the Eleventh European Symposium on Research in Computer Security (ESORICS 2006). Organized in a series of European countries, ESORICS is confirmed as the European research event in computer security. The symposium started in 1990 and has been held for alternate years in different European countries and attracts an international audience from both the academic and industrial community. From 2002 it has been held on yearly. The Symposium has established itself as one of the premiere international gatherings on information assurance. Papers may present theory, mechanisms, applications, or practical experience on the following topics: * access control * intellectual property protection * accountability * intrusion tolerance * applied cryptography * language-based security * authentication * network security * covert channels * peer-to-peer security * cryptographic protocols * privacy-enhancing technology * cybercrime * secure electronic commerce * data and application security * security as quality of service * denial of service attacks * security evaluation * digital rights management * security management * distributed trust management * security models * formal methods in security * security requirements engineering * identity management * smartcards * inference control * subliminal channels * information assurance * system security * information dissemination controls * trust models * information flow controls * trustworthy user devices * information warfare The primary focus is on high-quality original unpublished research, case studies and implementation experiences. We encourage submissions of papers discussing industrial research and development. Proceedings will be published by Springer in the Lecture Notes in Computer Science series. Submitted papers must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be at most 15 pages excluding the bibliography and well-marked appendices (using 11-point font), and at most 20 pages total. Committee members are not required to read the appendices, and so the paper should be intelligible without them. Authors are encouraged to follow the Information for LNCS Authors provided by Springer when preparing their submission. The procedure for submitting papers will be announced on the conference web site. Submissions must be received by March 31, 2006 in order to be considered. Notification of acceptance or rejection will be sent to authors by May 30, 2006. Authors of accepted papers must be prepared to sign a copyright statement and must guarantee that their paper will be presented at the conference. Authors of accepted papers must follow the guidelines in the Information for LNCS Authors for the preparation of the manuscript and use the templates provided there. Papers included in the conference proceedings must be typeset in LaTeX. Committees ========== General Chair * Joachim Posegga University of Hamburg, Germany Program Chairs * Dieter Gollmann Hamburg University of Technology, Germany * Andrei Sabelfeld Chalmers University, Sweden Work shop Chair * Martin Johns University of Hamburg, Germany Program Committee (current) * Tuomas Aura Microsoft Research Cambridge, UK * Michael Backes Saarbr?cken University, Germany * Gilles Barthe INRIA Sophia-Antipolis, France * Lynn Batten Deakin University, Australia * Giampaolo Bella University of Catania, Italy * Joachim Biskup University of Dortmund, Germany * Jan Camenisch IBM Zurich Research Laboratory, Switzerland * Jason Crampton Royal Holloway, UK * Frederic Cuppens ENST Bretagne, France * Marc Dacier Institut Eur?com, France * George Danezis University of Leuven, Belgium * Sabrina De Capitani di Vimercati University of Milan, Italy * Robert Deng Singapore Management University, Singapore * Ulfar Erlingsson Microsoft Research, USA * Simon Foley University College, Ireland * Philippe Golle Palo Alto Research Center, USA * Pieter Hartel Twente University, Netherlands * Jaap-Henk Hoepman Radboud University Nijmegen, Netherlands * Sushil Jajodia George Mason University, USA * Alan Jeffrey Bell Labs, USA * Audun Josang QUT, Australia * Jan Juerjens TU Munich, Germany * Markus Kuhn University of Cambridge, UK * Xuejia Lai Shanghai Jiaotong University, China * Kwok-Yan Lam Tsinghua University, China * Volkmar Lotz SAP, France * Heiko Mantel RWTH Aachen, Germany * Vashek Matyas Masaryk University Brno, Czech Republic * Flemming Nielson DTU, Denmark * Peter Ryan University of Newcastle upon Tyne, UK * Babak Sadighi SICS, Sweden * Kazue Sako NEC Corporation, Japan * Andre Scedrov U. Pennsylvania, USA * Christoph Schuba Link?ping University, Sweden * Einar Snekkenes Gj?vik University College, Norway * Eijiro Sumii Tohoku University, Japan * Paul Syverson NRL, USA * Mariemma I. Yag?e University of Malaga, Spain * Alf Zugenmaier DoCoMo Labs Europe, Germany Important Dates =============== Paper Submission due: March 31, 2006 Acceptance notification: May 30, 2006 Final papers due: June 30, 2006 Internet ======== http://www.esorics06.tu-harburg.de/ From aserebre at win.tue.nl Tue Feb 14 01:42:05 2006 From: aserebre at win.tue.nl (A Serebrenik) Date: Tue, 14 Feb 2006 07:42:05 +0100 (CET) Subject: [TYPES/announce] [ICLP'06] Deadlines EXTENDED Message-ID: Submission deadlines extended!! abstract registration: Feb 21, 2006 papers due: March 2, 2006 CALL FOR PAPERS 22nd International Conference on Logic Programming ICLP'06 Seattle, Washington, USA, 17-20 August, 2006 http://www.cs.uky.edu/iclp06/ Part of Fourth Federated Logic Conference, FLoC 2006 http://research.microsoft.com/floc06/ SUBMISSION SITE http://www.easychair.org/ICLP06/ WE INVITE YOU TO SUBMIT PAPERS AND POSTERS!!!} CONFERENCE SCOPE Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: * Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge Representation. * Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. * Environments: Program Analysis, Program Transformation, Validation and Verification, Debugging, Profiling. * Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Programming Techniques. * Alternative Paradigms: Constraint Logic Programming, Abductive Logic Programming, Inductive Logic Programming, Answer Set Programming. * Applications: Deductive Databases, Data Integration, Software Engineering, Natural Language, Web Tools, Internet Agents, Artificial Intelligence. The three broad categories for submissions are: (1) technical papers, where specific attention will be given to work providing novel integrations of the areas listed above, (2) application papers, where the emphasis will be on their impact on the application domain as opposed to the advancement of the the state-of-the-art of logic programming, and (3) posters, ideal for presenting and discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. In addition to papers and posters, the technical program will include a plenary talk in association with other FLoC conferences, two ICLP invited talks, an advanced tutorial, Doctoral Consortium and several workshops. The workshops will be held on August 16 and August 21, 2006. PAPERS AND POSTERS Papers and posters must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English. Technical papers and application papers must not exceed 15 pages in the Springer LNCS format (cf. http://www.springer.de/comp/lncs/index.html). The limit for posters is 2 pages in that format. The primary means of submission will be electronic. Papers and posters must be submitted at http://www.easychair.org/ICLP06/submit/ PUBLICATION The proceedings of the conference will be published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. SUPPORT, SPONSORING AND AWARDS The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two awards for ICLP'06: for the best technical paper and for the best student paper. IMPORTANT DATES Papers Posters Abstract submission deadline 14 February Submission deadline 21 February 14 March Notification of authors 7 April 14 April Camera-ready copy due 2 May 2 May ICLP'2006 ORGANIZATION General Chair: Manuel Hermenegildo (herme at fi.upm.es) Program Co-Chairs: Sandro Etalle (s.etalle at utwente.nl) Mirek Truszczynski (mirek at cs.uky.edu) Workshop Chair: Christian Schulte (schulte at imit.kth.se) Doctoral Student Consortium: Enrico Pontelli (epontell at cs.nmsu.edu) Publicity Chair: Alexander Serebrenik (a.serebrenik at tue.nl) PROGRAM COMMITTEE Maria Alpuente Krzysztof Apt Annalisa Bossi Veronica Dahl Giorgio Delzanno Pierre Deransart Agostino Dovier Thomas Eiter Sandro Etalle, co-chair John Gallagher Michael Gelfond Hai-Feng Guo Manuel Hermenegildo Tomi Janhunen Fangzhen Lin Michael Maher Victor Marek Eric Monfroy Stephen Muggleton Brigitte Pientka Maurizio Proietti I.V. Ramakrishnan Peter van Roy Harald Sondergaard Mirek Truszczynski, co-chair German Vidal Andrei Voronkov Roland Yap DOCTORAL CONSORTIUM The ICLP Doctoral Consortium (DC) is the second doctoral consortium to be offered as part of ICLP-06. The DC builds on the experience of the 1st Doctoral Consortium on Logic Programming, held at ICLP-05. It is designed for doctoral students working in areas related to logic and constraint programming, who are planning to pursue a career in academia. The Doctoral Consortium aims to provide students with an opportunity to present and discuss their research directions and to obtain feedbacks from peers as well as world-renown experts in the field. The Doctoral Consortium will also offer invited speakers and panels discussions. More information can be found at http://www.cs.nmsu.edu/~epontell/DC2006/ . WORKSHOPS The ICLP-06 program will include several workshops. They provide a platform for the presentation of preliminary work and novel ideas in a less formal way than the conference itself. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The following workshops will be held in association with the ICLP-06 conference (please, refer to the conference website for links to workshop pages): * International Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services, ALPSWS2006, http://www.deri.at/events/workshops/alpsws2006/ * Colloquium on Implementation of Constraint and LOgic Programming Systems, CICLOPS, http://www.cs.nmsu.edu/lldap/CICLOPS06/ * International Workshop on Software Verification and Validation SVV 2006, http://www.comp.nus.edu.sg/~abhik/svv06/ * Preferences and Their Applications in Logic Programming Systems, http://www.cs.nmsu.edu/lldap/Prefs06/ * Search and Logic: Answer Set Programming and SAT, http://www.cs.sfu.ca/%7ESearchAndLogic/ * 16th Workshop on Logic-Based Programming Environments, WLPE 2006, http://lml.ls.fi.upm.es/%7Esusana/Conferences/WLPE06/ * MVLP'06: International Workshop on Multi-Valued Logic and Logic Programming website to be announced soon CONFERENCE VENUE The conference will be a part of the fourth Federated Logic Conference (FLoC'06) to be held August 10-21, 2006, in Seattle, Washington (http://research.microsoft.com/floc06/). Other participating conferences are: Computer-Aided Verification (CAV), Rewriting Techniques and Applications (RTA), Logic in Computer Science (LICS), Theory and Applications of Satisfiability Testing (SAT), and Int'l Joint Conference on Automated Reasoning (IJCAR). Plenary events involving multiple conferences are planned. From davide at disi.unige.it Tue Feb 14 05:55:55 2006 From: davide at disi.unige.it (Davide Ancona) Date: Tue, 14 Feb 2006 11:55:55 +0100 Subject: [TYPES/announce] FTfJP '06 Call for Contributions Message-ID: <43F1B73B.7020009@disi.unige.it> CALL FOR CONTRIBUTIONS FTfJP'2006 8th ECOOP Workshop on Formal Techniques for Java-like Programs http://www.cs.ru.nl/ftfjp/ 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: - 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. Contributions (of up to 10 pages) 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. During the review process the Program Commitee will individuate one or more specific topics to focus on, in order to facilitate interaction during each session of the workshop. 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. A special journal issue is planned to collect selected contributions as has been done for the previous FTfJP workshops. Contributions *must* be pdf format and must be accompanied by a plain-text abstract. They should be sent to Davide Ancona (davide at disi.unige.it) by April 1, 2006. Important dates: submission of contributions April 1, 2006 notification May 5, 2006 workshop July 3 or 4, 2006 Program Committee: Davide Ancona, (co-chair) University of Genova, Italy Bernhard Beckert, University Koblenz-Landau, Germany Yoonsik Cheon, University of Texas at El Paso, USA Dave Clarke, CWI, Netherlands Sophia Drossopoulou, Imperial College, UK Erik Ernst, University of Aarhus, Denmark Paola Giannini, University of Piemonte Orientale, Italy Michael Hicks, University of Maryland, College Park, USA Atsushi Igarashi, Kyoto University, Japan Rustan Leino, Microsoft Research, USA Elena Zucca, (chair) University of Genova, Italy From femke at cs.vu.nl Wed Feb 15 03:29:05 2006 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Wed, 15 Feb 2006 09:29:05 +0100 (CET) Subject: [TYPES/announce] HOR 2006: call for abstracts Message-ID: ******************************** * * * HOR'06 CALL FOR ABSTRACTS * * * ******************************** 3rd International Workshop on Higher-Order Rewriting Tuesday August 15, 2006 Sheraton, Seattle, WA http://hor.pps.jussieu.fr/06 IMPORTANT DATES: May 8, 2006 : deadline electronic submission of paper May 29, 2006 : notification of acceptance of papers June 8, 2006 : deadline for final version of accepted papers The aim of HOR is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2006 will be part of FLoC 2006 in Seattle, USA. INVITED TALKS: Hugo Herbelin (INRIA Futurs, Paris) Eelco Visser (Universiteit Utrecht, The Netherlands) TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation. FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, higher-order abstract syntax PROGRAM/ORGANIZING COMMITTEE: Delia Kesner Universite Paris 7, France kesner at pps.jussieu.fr Femke van Raamsdonk Vrije Universiteit, The Netherlands femke at cs.vu.nl Mark-Oliver Stehr SRI International, USA stehr at csl.sri.com HOR'06 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. PROCEEDINGS: The proceedings of HOR 2006 will be made available on the HOR 2006 web page and copies will be distributed to the participants at the workshop. LOCAL ARRANGEMENTS: Gopal Gupta University of Texas, Dallas, USA gupta at utdallas.edu Ashish Tiwari SRI International, USA tiwari at csl.sri.com From fermin.reig at cs.nott.ac.uk Wed Feb 15 06:40:13 2006 From: fermin.reig at cs.nott.ac.uk (Fermin Reig) Date: Wed, 15 Feb 2006 11:40:13 +0000 Subject: [TYPES/announce] Datatype-generic programming 2006, registration now open Message-ID: <1140003613.17168.9.camel@kiwi.cs.nott.ac.uk> [Apologies for multiple copies] ====================================================================== Registration for DGP 2006 is now open. Please visit the web site for instructions. Spring School on Datatype-Generic Programming http://www.cs.nott.ac.uk/ssdgp2006/ University of Nottingham, UK 24-27 April 2006 ************ Background and objectives ************ Generic programming is a thriving research area aimed at making programming more effective by making it more general. This school aims to give participants insights into the applications of datatype-generic programming and the current research challenges in the area. This school is a successor to the Summer School and Workshop on Generic Programming, held in Oxford in August 2002 (lecture notes appeared as volume 2793 of LNCS). ************ Technical programme ************ The lectures will be tutorial-style (as opposed to conference-style) and will be accessible to beginning computing science postgraduates. The scientific programme consists of six courses given by renowned specialists, and a student session. The list of courses is the following: * Thorsten Altenkirch (University of Nottingham): (in collaboration with Conor McBride and Peter Morris) Generic programming with dependent types * Jeremy Gibbons (University of Oxford): Design Patterns as Higher-Order Datatype-Generic Programs * Ralf Hinze (Universitat of Bonn): Generic Programming, Now! (in collaboration with Andres Loeh) * Johan Jeuring (Universiteit Utrecht): Comparing Approaches to Generic Programming (in collaboration with Ralf Hinze and Andres Loeh) * Ralf Laemmel (Microsoft) The next 700 traversal approaches * Tim Sheard (Portland State University): Putting the Curry-Howard Isomorphism to work. Copies of the draft lecture notes will be provided to all participants. The purpose of the student session is to give students an opportunity to present their work and get feedback. Registrants are invited to propose short talks (15-20 min). The selection will be based on abstracts of 150-400 words. ************ Social programme ************ A conference dinner will be organised (attendance at which will be charged separately). ************ Co-location ************ The Symposium on Trends in Functional Programming (TFP 2006), and the Conference of the Types Project (TYPES 2006) will be held in Nottingham the week before this spring school. ************ Accommodation ************ Information about accommodation is available at the School's web site. ************ APPSEM ************ This is an APPSEM-affiliated event. APPSEM funds can be used to support participants from APPSEM-affiliated sites. This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From Marieke.Huisman at sophia.inria.fr Wed Feb 15 10:18:25 2006 From: Marieke.Huisman at sophia.inria.fr (Marieke Huisman) Date: Wed, 15 Feb 2006 16:18:25 +0100 Subject: [TYPES/announce] PhD position at INRIA Sophia Antipolis: Specification and Verification of multi-threaded applications Message-ID: <43F34641.9090701@sophia.inria.fr> The Everest project at INRIA Sophia Antipolis has an open PhD position on: Specification and Verification of multi-threaded applications Goal of the project is to develop appropriate techniques for the specification and verification of security properties for multi-threaded applications. Mobile code will be a priviliged application domain, and therefore the typicalities of mobile code will be exploited to make verification feasible. A more detailed project description can be found at: http://www-sop.inria.fr/everest/offers/multi_threading.php The PhD project will be part of the Mobius project, see http://mobius.inria.fr To apply or for more information, send an email to everest_jobs at sophia.inria.fr. If you apply, please send us a curriculum vitae and a motivation letter explaining your interest in the project. Please mention also who will act as a reference for you. For more information about - INRIA, see http://www.inria.fr - the Everest project, see http://www-sop.inria.fr/everest/ - Sophia Antipolis, see http://www.sophia-antipolis.org/ The salary will be 1379 euros net per month. We might propose a 6 month contract, before starting the 3 year PhD contract. From mmaher at cse.unsw.edu.au Wed Feb 15 18:16:44 2006 From: mmaher at cse.unsw.edu.au (Michael Maher) Date: Thu, 16 Feb 2006 10:16:44 +1100 (EST) Subject: [TYPES/announce] PPDP'06 -- Call for Papers Message-ID: [Apologies for multiple copies] Preliminary Call for Papers: PPDP 2006 Eighth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Venice, Italy, 10-12 July, 2006 IMPORTANT DATES Submission 15 March 2006 Notification 22 April 2006 WEB SITES: PPDP 2006: http://www.dsi.unive.it/ppdp2006/ PPDP: http://pauillac.inria.fr/~fages/PPDP/ SCOPE OF THE CONFERENCE: PPDP 2006 aims to provide a forum that brings together those in 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, and to stimulate cross-fertilization by including work from one community that could be of particular interest and relevance to the others. Topics of more specific interest are enhancements to such formalisms with mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. At the level of methodology, the use of logic-based principles in the design of tools for program development, analysis, and verification relative to all declarative paradigms is of interest. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. This list is not exhaustive: submissions related to new and interesting ideas relating broadly to declarative programming are encouraged. Prospective authors are encouraged to communicate with the Program Chair about the suitability of a specific topic. TOPICS (Not exhaustive): Logic, Constraint, and Functional Programming; Database, AI, and Knowledge Representation Languages; Visual Programming; Executable Specification Languages; Applications of Declarative Programming; Methodologies for 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 EVALUATION OF SUBMISSIONS: 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. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. 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. Submissions that do not meet these guidelines may not be considered. PROCEEDINGS: Proceedings will be published by ACM Press. ACM formatting guidelines are available online, along with formatting templates or style files for LaTeX, Word Perfect, and Word: http://www.acm.org/sigs/pubs/proceed/template.html. Authors of accepted papers will be required to sign the ACM copyright form. RELATED EVENTS: PPDP 2006 will be co-located with the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), which will take place 9-16 July 2006. See http://icalp06.dsi.unive.it for more information. CONFERENCE CHAIR: Annalisa Bossi, U. Ca' Foscari di Venezia web: http://www.dsi.unive.it/~bossi/, email: bossi at dsi.unive.it PROGRAM CHAIR: Michael Maher, National ICT Australia web: http://www.cse.unsw.edu.au/~mmaher, email: michael.maher at nicta.com.au PROGRAM COMMITTEE: Nick Benton (Microsoft Research, UK) Annalisa Bossi (U. Ca' Foscari di Venezia, Italy) Manuel Chakravarty (U. NSW, Australia) Bart Demoen (K. U. Leuven, Belgium) Moreno Falaschi (U. Udine, Italy) Radha Jagadeesan (DePaul U., USA) Bharat Jayaraman (SUNY Buffalo, USA) Yukiyoshi Kameyama (U. Tsukuba, Japan) Andy King (U. Kent, UK) Francois Laburthe (Bouyges, France) David Sands (Chalmers U., Sweden) Christian Schulte (KTH, Sweden) Pascal Van Hentenryck (Brown U., USA) Roland Yap (NUS, Singapore) PREVIOUS PPDP CONFERENCES: Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Verona (2004), Lisboa (2005). From loeh at iai.uni-bonn.de Thu Feb 16 03:17:02 2006 From: loeh at iai.uni-bonn.de (Andres Loeh) Date: Thu, 16 Feb 2006 09:17:02 +0100 Subject: [TYPES/announce] Haskell Workshop 2006 Call for papers Message-ID: <20060216081702.GA11583@iai.uni-bonn.de> Apologies for multiple copies; feel free to distribute further. Cheers, Andres -------------- next part -------------- ACM SIGPLAN 2006 Haskell Workshop Call for Papers Portland, Oregon 17 September, 2006 The Haskell Workshop 2006 will be part of the 2006 International Conference on Functional Programming (ICFP) as an associated, ACM SIGPLAN sponsored workshop. Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Snowbird (2004), and Tallinn (2005). Topics The purpose of the Haskell Workshop is to discuss experience with Haskell, and possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, in the form of a formal treatment 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, and so forth; * Applications, Practice, and Experience with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; * Functional Pearls being elegant, instructive examples of using Haskell. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! Submission details Submission deadline: 2 June 2006 Notification: 3 July 2006 Submitted papers should be in postscript or portable document format, formatted using the ACM SIGPLAN style guidelines. The length should be restricted to 12 pages. Detailed submission instructions will be available at http://haskell.org/haskell-workshop/2006. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. If there is sufficient demand, we will try to organise a time slot for system or tool demonstrations. If you are interested in demonstrating a Haskell related tool or application, please send a brief demo proposal to Andres Loeh (loeh at informatik.uni-bonn.de). Programme Committee Koen Claessen, Chalmers University, Sweden Bastiaan Heeren, Universiteit Utrecht, The Netherlands Paul Hudak, Yale University, US Isaac Jones, Galois Connections, US Gabriele Keller, University of New South Wales, Australia Oleg Kiselyov, FNMOC, US Andres Loeh (chair), Universitaet Bonn, Germany Conor McBride, University of Nottingham, UK Shin-Cheng Mu, Academia Sinica, Taiwan Andrew Tolmach, Portland State University, US From types-list at m-strasser.de Thu Feb 16 04:46:50 2006 From: types-list at m-strasser.de (types-list@m-strasser.de) Date: Thu, 16 Feb 2006 10:46:50 +0100 Subject: [TYPES/announce] CALL FOR PAPERS - Workshop "Security and Privacy in Future Business Services" at ETRICS'06 Message-ID: <000a01c632dd$e9052eb0$c710e684@tpc167> CALL FOR PAPERS Paper submission deadline has been extended to New Submission Deadline February 28, 2006 ============================================================================ Workshop ?Security and Privacy in Future Business Services? ============================================================================ International Conference on Emerging Trends in Information and Communication Security /\ ||__^_ /\ ETRICS 2006 _/\_| \_||______________________________________________________________ June 6-9, 2006, FREIBURG, GERMANY http://www.etrics.org/workshops Individualization of business services is one of the most promising business development prospects for future markets. Customized products and services, individual price differentiation, personalized promotions, and location/time-sensitive addressing of customers are raising marketers? attention. Particularly ubiquitous com?puting technologies, with their mobile and wireless interfaces, are laying the grounds for these developments: information about purchase behavior and location, proximity, presence, after-sales usage patterns, and even personal emotional states will potentially be combined and analyzed. Technical progress, however, not only improves the available data pool but also results in new challenges for security and privacy. Handling the trade-off between high-quality individualized services and maintaining pri?vacy and security seems to be a key factor for business success. Without suitable mechanisms for enforcing the correct handling of data collection and processing, new service ideas may not receive marketplace acceptance. This workshop therefore focuses on technical and economic mechanisms addressing the trade-off between privacy and individualization. It aims to bring together privacy experts on an international level to discuss recent advances in trust-promoting mechanisms. To this end, the workshop seeks submissions from academia and industry presenting novel research on theoretical and practical aspects of security and privacy technologies as well as economic models that may enforce a correct handling of sensitive data. Theoretical work, prototypes and experimental studies are equally welcome. Selected contributions will be invited to submit a full paper to a special issue of the Wirtschaftsinformatik journal. Topics of interest include but are not limited to: ================== * Valuation of personal data/private information * Private data markets and market mechanisms * Trust management from a business process perspective * Trust management from a technical perspective * Political dimensions of privacy and security * Drivers of technology acceptance: what is the role of privacy and security in a Technology Acceptance Model? * Empirical studies on privacy and/or security perception and behavior * Technical mechanisms to promote trust, privacy and security, especially - Reputation mechanisms - Architectures and models for identity management - Pseudonymity management - Anonymity - Authentication * Privacy and security for RFID and location-based technologies * Privacy-enhancing technologies for enterprises Important Dates: ================ February 28, 2006: Submission of position paper (send 2 pages to sackmann at iig.uni-freiburg.de), March 10, 2006: Notification of acceptance for the workshop, March 10, 2006: Invitation to submit a full paper to the journal Wirtschaftsinformatik Workshop Chairs: ================ Stefan Sackmann, University of Freiburg, Germany Sarah Spiekermann, University of Berlin, Germany Program Committee: ================== Alessandro Acquisti, Carnegie Mellon University, Pittsburgh, USA Jens Grossklags, UC Berkeley, USA Marit Hansen, Independent Centre for Privacy Protection Schleswig-Holstein, Germany Marc Langheinrich, ETH Zurich, Switzerland Ursula Sury, Hochschulen f?r Wirtschaft und Technik und Architektur Luzern, Switzerland From ralf at informatik.uni-bonn.de Thu Feb 16 10:38:39 2006 From: ralf at informatik.uni-bonn.de (Ralf Hinze) Date: Thu, 16 Feb 2006 16:38:39 +0100 Subject: [TYPES/announce] CFP: Workshop on Generic Programming 2006 Message-ID: <200602161638.39496.ralf@informatik.uni-bonn.de> ============================================================================ CALL FOR PAPERS Workshop on Generic Programming 2006 Portland, Oregon, 16th September 2006 The Workshop on Generic Programming is sponsored by ACM SIGPLAN and forms part of ICFP 2006. Previous Workshops on Generic Programming have been held in Marstrand (affiliated with MPC), Ponte de Lima (affiliated with MPC), Nottingham (informal workshop), Dagstuhl (IFIP WG2.1 Working Conference), Oxford (informal workshop), and Utrecht (informal workshop). http://www.informatik.uni-bonn.de/~ralf/wgp2006.{html,pdf,ps,txt} ============================================================================ Scope ----- 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, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities. This workshop will bring together leading researchers in generic programming from around the world, and feature papers capturing the state of the art in this important emerging area. We welcome contributions on all aspects, theoretical as well as practical, of o adaptive object-oriented programming, o aspect-oriented programming, o component-based programming, o generic programming, o meta-programming, o polytypic programming, o and so on. Submission details ------------------ Deadline for submission: 3rd June 2006 Notification of acceptance: 24th June 2006 Final submission due: 8th July 2006 Workshop: 16th September 2006 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to Ralf Hinze (ralf at informatik.uni-bonn.de) by 3rd June 2006. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. Programme committee ------------------- Roland Backhouse University of Nottingham Pascal Costanza Vrije Universiteit Brussel Peter Dybjer Chalmers University of Technology Jeremy Gibbons University of Oxford Johan Jeuring Universiteit Utrecht Ralf Hinze (chair) Universit?t Bonn Karl Lieberherr Northeastern University David Musser Rensselaer Polytechnic Institute Rinus Plasmeijer Universiteit Nijmegen Sibylle Schupp Chalmers University of Technology Jeremy Siek Rice University Don Syme Microsoft Research ============================================================================ From apostolo at obelix.ee.duth.gr Thu Feb 16 10:49:58 2006 From: apostolo at obelix.ee.duth.gr (apostolo@obelix.ee.duth.gr) Date: Thu, 16 Feb 2006 17:49:58 +0200 (EET) Subject: [TYPES/announce] new journal on digital typography In-Reply-To: <20060216081702.GA11583@iai.uni-bonn.de> References: <20060216081702.GA11583@iai.uni-bonn.de> Message-ID: I am really happy to let you know that the "Internation Journal of Digital Typography" is now accepting submissions. IJDT is a new peer-reviewed e-journal that aims to provide a forum for the publication of original results in the area of digital typography (i.e., electronic document preparation, on-screen reading, data representation, etc.). The journal's Web page is located at http://www.bepress.com/ijdt. Kind regards, Apostolos Syropoulos Co-Editor-in-Chief **************************************************************** *Apostolos Syropoulos * *snail mail: 366, 28th October Str., GR-671 00 Xanthi, HELLAS * *email : apostolo at ocean1.ee.duth.gr * *phone num.: +30-25410-28704 * *home page : http://obelix.ee.duth.gr/~apostolo * **************************************************************** From wcook at cs.utexas.edu Fri Feb 17 09:42:31 2006 From: wcook at cs.utexas.edu (William Cook) Date: Fri, 17 Feb 2006 08:42:31 -0600 Subject: [TYPES/announce] OOPSLA 2006 Call for Contributions Message-ID: <00c901c633d0$65914070$857a5380@Weston> 21st Annual Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2006) Portland, Oregon October 22 - 26, 2006 http://www.oopsla.org/ Sponsored by ACM SIGPLAN in cooperation with SIGSOFT FIRST SUBMISSION DEADLINE: 18 MARCH 2006 OOPSLA 2006, the premier forum for practitioners, researchers, educators, and students in diverse disciplines related to object technology, is seeking contributions. This year, it may be your contribution that spawns a whole new technology--the next "big thing!" OOPSLA offers an extraordinary array of venues and activities to suit the needs of attendees of all backgrounds. You can immerse yourself in the cutting edge and the future of software development, and interact and network with the best minds in the field. Becoming a participant is easier than you think and will enrich your OOPSLA experience. Just submit a proposal to one of the many events that make up OOPSLA. The following OOPSLA venues are seeking submissions: * Research Papers -- Present novel technical results, advance the state of the art, or report on significant experience or experimentation. * Onward! -- Submit a paper or film that presents new thinking and new paradigms for computing. * Essays -- Present your personal view of a topic, a way of looking at some part of computing terrain, a way that leads the listener in an act of discovery. * Lightning Talks -- Give a 5-minute presentation on any topic of interest to the community. * Panels -- Organize a small group of experts who will discuss issues related to object technology, with audience participation. * Practitioner Reports -- Report on your real-world experiences. * Tutorials and Certificate Courses -- Present a half- or full-day course on a topic where you have recognized expertise. * Workshops -- Organize an intensive, collaborative environment where participants surface, discuss, and solve challenging problems facing the field. * Posters -- Present informal or exploratory work in a visual and interactive setting. * Student Research Competition -- As an undergraduate and graduate researcher, share your results and gain recognition. * Demonstrations -- Give a show-and-tell session on a state-of-the art system, language, environment, or application. * DesignFestR -- Organize a design task for a small group of designers and developers. * Educator's Symposium -- Promote new ways to teach and learn through paper presentations, interactive sessions, demonstrations, posters, and group discussions. * Doctoral Symposium -- As a Ph.D. student, attend a one-day session where a panel of experts will provide guidance and feedback on your dissertation topic. * Student Volunteers -- Donate a few hours of your time, to associate with the top people in technology, research, and software development. Co-located events: * Generative Programming and Component Engineering (GPCE'06) -- http://www.program-transformation.org/GPCE06 * Pattern Languages of Programming (PLoP'06) -- http://hillside.net/plop/2006 * Dynamic Languages Symposium (DLS'06) -- http://www.oopsla.org/2006/dynamicLanguagesSymposium.html If you have questions, please don't hesitate to contact the event chairs or the general chair. Check out http://www.oopsla.org today! We urge you to help shape the present and future of software development by contributing to OOPSLA 2006. We look forward to your submissions and to seeing you in Portland! IMPORTANT DATES for OOPSLA 2006 ** March 18, 2006 ** Research papers Onward! papers Essays Practitioner Reports Educators' Symposium Tutorials Panels Workshops ** June 30, 2006 ** DesignFestR Posters Onward! Films Student Research Competition Demonstrations Doctoral Symposium ** August 1, 2006 ** Student Volunteers ** While space available ** Lightning Talks CONTACT INFO Conference Chair Peri Tarr, IBM Research mailto:chair at oopsla.org Program Chair William Cook, University of Texas at Austin mailto:papers at oopsla.org Communications Chair Steve Metsker, Dominion Digital mailto:pubs at oopsla.org From sweirich at cis.upenn.edu Mon Feb 20 16:01:39 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Mon, 20 Feb 2006 16:01:39 -0500 Subject: [TYPES/announce] HOR 2006: Call for abstracts Message-ID: <43FA2E33.4040800@cis.upenn.edu> ******************************** * * * HOR'06 CALL FOR ABSTRACTS * * * ******************************** 3rd International Workshop on Higher-Order Rewriting Tuesday August 15, 2006 Sheraton, Seattle, WA http://hor.pps.jussieu.fr/06 IMPORTANT DATES: May 8, 2006 : deadline electronic submission of paper May 29, 2006 : notification of acceptance of papers June 8, 2006 : deadline for final version of accepted papers The aim of HOR is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2006 will be part of FLoC 2006 in Seattle, USA. INVITED TALKS: Hugo Herbelin (INRIA Futurs, Paris) Eelco Visser (Universiteit Utrecht, The Netherlands) TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation. FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, higher-order abstract syntax PROGRAM/ORGANIZING COMMITTEE: Delia Kesner Universite Paris 7, France kesner at pps.jussieu.fr Femke van Raamsdonk Vrije Universiteit, The Netherlands femke at cs.vu.nl Mark-Oliver Stehr SRI International, USA stehr at csl.sri.com HOR'06 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. PROCEEDINGS: The proceedings of HOR 2006 will be made available on the HOR 2006 web page and copies will be distributed to the participants at the workshop. LOCAL ARRANGEMENTS: Gopal Gupta University of Texas, Dallas, USA gupta at utdallas.edu Ashish Tiwari SRI International, USA tiwari at csl.sri.com From maribel at dcs.kcl.ac.uk Tue Feb 21 12:51:57 2006 From: maribel at dcs.kcl.ac.uk (Maribel Fernandez) Date: Tue, 21 Feb 2006 17:51:57 +0000 Subject: [TYPES/announce] CFP SecReT 2006 at ICALP (Venice, 15 July) Message-ID: <43FB533D.9090802@dcs.kcl.ac.uk> ====================================================================== Call for Papers SecReT 2006 International Workshop on Security and Rewriting Techniques http://secret2006.loria.fr/ 15th July, 2006 S. Servolo, Venice - Italy A satellite event of ICALP 2006 With the increasing use of digital communication, network-based applications and mobile code, software, system and data security are key issues affecting everybody, from individuals to industry and governments. Formal frameworks are of fundamental interest to model, analyse and prove properties of security policies. Many such frameworks have been used for these purposes, for example, logics, flow-analysis techniques, and semi-automated theorem provers. Rewriting techniques have been successfully applied to many domains in the last 20 years. They have had deep influence in the development of computational models, programming and specification languages, theorem provers and proof assistants. Recently, rewriting techniques have also been fruitfully used to develop powerful results on security. For example, for performing validations on policy specifications, analysis of cryptographic protocols, and to specify security policies controlling information leakage, to mention just a few. The theory of rewriting can provide a formal basis for the study of a broad range of security issues, ranging from the specification, implementation, and validation of access control policies, to the analysis of logs and the development of tools for intrusion detection. In this context, the aim of this workshop is to bring together researchers who are currently working in the area of rewriting and security experts, in order to foster their interaction and develop future collaborations in this area, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. TOPICS OF INTEREST The workshop focuses on the use of rewriting techniques in all aspects of security. Specific topics include: authentication, encryption, access control and authorisation, protocol verification, specification of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. SUBMISSION GUIDELINES Authors are invited to submit an abstract (max. 5 pages) in PDF/PostScript format by e-mail to secret2006 at loria.fr by 30 April 2006. Preliminary proceedings will be available at the workshop. After the workshop authors will be invited to submit a full paper of their presentation. We plan to publish the accepted contributions in ENTCS. IMPORTANT DATES * Submissions: April 30, 2006 * Notification: May 21, 2006 * Final version due: June 11, 2006 INVITED SPEAKER * Michael Rusinowitch (INRIA, France) PROGRAMME COMMITTEE * Steve Barker, King's College London (UK) * Gilles Barthe, INRIA Sophia-Antipolis (France) * Iliano Cervesato, Tulane University (USA) * Horatiu Cirstea, LORIA (France) * Hubert Comon, LSV (France) * Mariangiola Dezani, University of Torino (Italy) * Rachid Echahed, VERIMAG (France) * Maribel Fernandez, King's College London (UK) - PC Co-Chair * Therese Hardin, University of Paris 6 (France) * Claude Kirchner, LORIA (France) - PC Co-Chair * Luca Vigano, ETH Zurich (Switzerland) * Nobuko Yoshida, Imperial College London (UK) CONTACTS Horatiu Cirstea, University Nancy II & LORIA, Horatiu.Cirstea at loria.fr Maribel Fernandez, King's College London, Maribel.Fernandez at kcl.ac.uk Claude Kirchner, INRIA & LORIA, Claude.Kirchner at loria.fr From stevez at cis.upenn.edu Wed Feb 22 11:31:40 2006 From: stevez at cis.upenn.edu (Steve Zdancewic) Date: Wed, 22 Feb 2006 11:31:40 -0500 Subject: [TYPES/announce] Final CFP: Programming Languages and Analysis for Security (PLAS) 2006 Message-ID: <43FC91EC.3090402@cis.upenn.edu> Final Call for Papers: Submission Deadline March 3, 2006 ----------------------------------------------------------------------- Call for Papers PLAS 2006 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security http://www.cis.upenn.edu/~stevez/plas06.html co-located with ACM SIGPLAN PLDI 2006 Conference on Programming Language Design and Implementation Ottawa, Canada, June 10, 2006 The goal of PLAS 2006 is to provide a forum for researchers and practitioners to exchange and understand ideas and to seed new collaboration on the use of programming language and program analysis techniques that improve the security of software systems. The scope of PLAS includes, but is not limited to: -- Language-based techniques for security -- Program analysis and verification (including type systems and model checking) for security properties -- Compiler-based and program rewriting security enforcement mechanisms -- Security policies for information flow and access control -- High-level specification languages for security properties -- Model-driven approaches to security -- Applications, examples, and implementations of these security techniques Submission: We invite papers of two kinds: (1) Technical papers for "long" presentations during the workshop, and (2) papers for "short" presentations (10 minutes). Papers submitted for the long format should contain relatively mature content; short format papers can present more preliminary work, position statements, or work that is more exploratory in nature. The deadline for submissions of technical papers (for both the short and long presentations) is March 03, 2006. Papers must be formatted according the ACM proceedings format: "long" submissions should not exceed 10 pages in this format; "short" submissions should not exceed 4 pages. These page limits include everything (i.e., they are the total length of the paper). Papers submitted for the "long" category may be accepted as short presentations at the program committee's discretion. Email the submissions to stevez AT cis.upenn.edu. Submissions should be in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter and A4 sized paper. Templates for SIGPLAN-approved LaTeX format 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. Publication options: Authors of accepted papers may choose whether they would like their work published in a planned special issue of SIGPLAN Notices. Those papers that are not published in SIGPLAN Notices will only be considered part of the informal workshop proceedings and are therefor suitable for future publication in journal or other conference venues. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere (including journals and formal proceedings of conferences and workshops). See the SIGPLAN republication policy for more details http://www.acm.org/sigs/sigplan/republicationpolicy.htm Important dates: Submission deadline March 03, 2006 Notification of acceptance April 03, 2006 Final papers due April 24, 2006 Workshop June 10, 2006 Organizers: Steve Zdancewic, University of Pennsylvania, stevez AT cis.upenn.edu Vugranam C. Sreedhar, IBM T.J. Watson Research Center vugranam AT us.ibm.com Program Committee: Amal Ahmed, Harvard University, USA Anindya Banerjee, Kansas State University, USA Adriana Compagnoni, Stevens Institute of Technology, USA Elena Ferrari, University of Insubria at Como, Italy Michael Hicks, University of Maryland, USA Annie Liu, State University of New York at Stony Brook, USA Brigitte Pientka, McGill University, Canada Sriram Rajamani, Microsoft Research, India, Vugranam Sreedhar, IBM TJ Watson Research Center, USA Westley Weimer, University of Virginia, USA Steve Zdancewic, University of Pennsylvania, USA From crolard at univ-paris12.fr Thu Feb 23 08:58:44 2006 From: crolard at univ-paris12.fr (Tristan Crolard) Date: Thu, 23 Feb 2006 14:58:44 +0100 Subject: [TYPES/announce] Fundamenta Informaticae: special issue on the Logic for Pragmatics Message-ID: <44009408-7AF4-4D3D-8379-A087A9A45C06@univ-paris12.fr> ***************************************************************** FUNDAMENTA INFORMATICAE SPECIAL ISSUE ON THE LOGIC FOR PRAGMATICS http://www.univ-paris12.fr/lacl/LP/ ***************************************************************** SECOND CALL FOR PAPERS ====================== This special issue aims to explore ideas in different areas, from logic, category theory, linguistics to artificial intelligence, somehow related to the "logic for pragmatics". TOPICS Topics of interest for contributions to the journal issue in- clude, but are not limited to: * Proof-theory of bi-intuitionistic logic * Classical logic and realizability interpretations. * Causal reasoning and explanations * Modal logics and category theory * Proof nets, CPS calculi and concurrency * Computational linguistics * Applications of any of the previous topics to artificial intelligence. The project "Logics for Pragmatics", as presented in the work- shops WoLP03, Verona (Italy) and WoLP04, Paris (France), tries to characterize the logical properties of the illocutionary acts of asserting, conjecturing, commanding etc., using the methods of logic (proof theory and model theory) and of category theory. In this perspective, intuitionistic, deontic and causal reasoning are best formalized as intensional logics and their modal trans- lations into classical system with Kripke's semantics are regard- ed as "reflections" of illocutionary acts into the underlying "propositional content". To theoretical computer science and computational logic this view has so far offered clear motivations for the study of polarized ("assertive versus conjectural") systems, of the logic of "causal explanation" and of the interplay between linear Horn logic and the intuitionistic consequence relation. Computational interpre- tations of classical logic are also to be investigated in this light. Applications are sought in different fields, from Artificial In- telligence (non-monotonic reasoning) and linguistics to the for- malization of normative systems; we are aware of the import of this research for the philosophy of language and of mathematics. On the workshops WoLP, see the web pages http://profs.sci.univr.it/~bellin/workshop/logprag.html http://www.univ-paris12.fr/lacl/WoLP04/ SUBMISSIONS Submissions must be original work, which has not been previously published in a journal and is not being considered for publica- tion elsewhere. If related material has appeared in a refereed conference proceedings, the text submitted to FI should be sub- stantially more complete or otherwise different. We recommend that the manuscript fits in 20-30 pages. A 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 num- ber should be included. This should be followed by an abstract of approximately 300 words and five key words for indexing. IMPORTANT All source files of the final versions of the accepted papers must respect the format of FI (the latex style together with a bibliography style file and authors guide are available from the web-site of Fundamenta Informaticae http://fi.mimuw.edu.pl). Please send a .ps or .pdf file to crolard at univ-paris12.fr or post a hard copy to Tristan Crolard Departement d'informatique Faculte' des Sciences et Technologie Universite' Paris XII-Val de Marne 61, avenue du General de Gaulle 94010 Creteil Cedex France by the due date. IMPORTANT DATES Submission : March 31, 2006 Notification : August 15, 2006 Final version : October 15, 2006 CHIEF EDITOR Andrzej Skowron (Institute of Mathematics, Warsaw University) GUEST EDITORS Gianluigi Bellin Queen Mary University of London and Universita` di Verona G.Bellin at dpmms.cam.ac.uk Stefano Berardi Computer Science Dept. Turin University berardi at di.unito.it Tristan Crolard Computer Science Dept. University of Paris 12 crolard at univ-paris12.fr From ctm at cs.nott.ac.uk Thu Feb 23 16:27:00 2006 From: ctm at cs.nott.ac.uk (Conor McBride) Date: Thu, 23 Feb 2006 21:27:00 +0000 Subject: [TYPES/announce] CFP: Mathematically Structured Functional Programming Message-ID: <43FE28A4.4010609@cs.nott.ac.uk> [The following CFP is relevant to types-announce as types provide a key language in which to express the mathematical structure of functional programs. Moreover, the workshop is affiliated to the EU TYPES project.] CALL FOR PAPERS Workshop on Mathematically Structured Functional Programming MSFP 2006 Kuressaare, Estonia, 2 July 2006 http://cs.ioc.ee/mpc-amast06/msfp/ a satellite workshop of MPC 2006 a "small workshop" of the TYPES project Background Something wonderful happened when monads arrived in Haskell: some human mathematics explaining the structure of certain computational phenomena became a mechanical means to implement those phenomena. It's a good way to go about functional programming - to dig out the mathematical structure underlying a problem and set it to work! There's more where monads came from, and we want it. This new workshop is about getting it. In recent years, a diverse array of mathematical structures has appeared in our programs: monads dualise to comonads and generalise to Freyd categories aka 'arrows'; 'container' types have a generalised polynomial structure supporting generic programming, not to mention a differential calculus; isomorphisms from 'high school algebra' are used to search libraries and repair type errors; coalgebras give structure to recursion; the list goes on... MSFP is broad in scope, covering the extraction of functionality from structure wherever it can be found. It complements the remit of its host conference, Mathematics of Program Construction, by seeking to enrich the language and toolset available for specifications and programs alike. It is also a "small workshop" of the FP6 IST coordination action TYPES. Invited speakers Andrzej Filinski, K?benhavns Universitet John Power, University of Edinburgh Important dates * Submission of papers: 10 April 2006 * Notification of authors: 8 May 2006 * Camera-ready version: 5 June 2006 Topics Submissions are welcome on, but by no means restricted to, topics from the following partially computed coinductive list: * structured effectful computation * structured recursion * structured tree and graph operations * structured syntax with variable binding * structures for datatype-genericity * structures for search * structured representations of functions * structured manipulation of mathematical structure * structured in functional programming Authors concerned about the suitability of a topic are very welcome to contact Conor McBride, ctm(at)cs.nott.ac.uk. Submission and publication Papers in pdf not exceeding 15 pages and adhering to the eWiC style must be submitted by 10 April 2006 via an online submission webpage. Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors. The proceedings of MSFP 2006 will be published in the Electronic Workshops in Computing (eWiC) series of the British Computer Society, http://ewic.bcs.org/. After the workshop, the authors of the best papers will be invited to submit revised and expanded versions to a special issue of the Journal of Functional Programming from Cambridge University Press. Programme committee Yves Bertot, INRIA Sophia Antipolis Marcelo Fiore, University of Cambridge Masahito Hasegawa, Kyoto University Graham Hutton, University of Nottingham Paul Levy, University of Birmingham Andres L?h, Universitt Bonn Christoph L?th, Universitt Bremen Conor McBride, University of Nottingham (co-chair) Marino Miculan, Universit? degli Studi di Udine Randy Pollack, University of Edinburgh Amr Sabry, Indiana University Tarmo Uustalu, Institute of Cybernetics (co-chair) Main conferences MSFP 2006 is a satellite workshop of the 8th International Conference on Mathematics on Program Construction, MPC 2006, to take place 3-5 July. Co-located with MPC 2006, the 11th International Conference on Algebraic Methodology and Software Technology, AMAST 2006, will follow 5-8 July. Venue Kuressaare (pop. 16000) is the main town on Saaremaa, the second-largest island of the Baltic Sea. Kuressaare is a charming seaside resort on the shores of the Gulf of Riga highly popular with Estonians as well as visitors to Estonia. The scientific sessions of MPC/AMAST 2006 will take place at Saaremaa Spa Hotel Meri, one among the several new spa hotels in the town. The social events will involve a number of sites, including the 14th-century episcopal castle. Accommodation will be at Saaremaa Spa Hotels Meri and R??tli. To get to Kuressaare and away, one must pass through Tallinn (pop. 402000), Estonia's capital city. Tallinn is famous for its picturesque medieval Old Town, inscribed on UNESCO's World Heritage List. TYPES support MSFP 2006 is an official workshop of the EU FP6 IST coordination action TYPES. Participants from TYPES sites/subsites may use project funds to cover their travel and participation. Local organizers MPC/AMAST 2006 is organized by Institute of Cybernetics, a research institute of Tallinn University of Technology. The local organizers are Tarmo Uustalu (chair), Monika Perkmann, Juhan Ernits, Ando Saabas, Olha Shkaravska, Kristi Uustalu. Contact email address of the local organizers: mpc06(at)cs.ioc.ee. From Jaco.van.de.Pol at cwi.nl Mon Feb 27 06:13:36 2006 From: Jaco.van.de.Pol at cwi.nl (Jaco van de Pol) Date: Mon, 27 Feb 2006 12:13:36 +0100 Subject: [TYPES/announce] Parallel and Distributed Methods in Verification (PDMC06 1st cfp) Message-ID: <4402DEE0.9040304@cwi.nl> Call for Papers 5th International Workshop on PARALLEL AND DISTRIBUTED METHODS IN VERIFICATION (PDMC 2006) August 31, 2006 - Bonn, Germany Workshop affiliated to CONCUR 2006 http://pdmc.informatik.tu-muenchen.de/PDMC06/ ======================================================================= OBJECTIVES: The growing importance of automated formal verification in industry is driving a growing interest in those aspects that directly impact the applicability to real world problems. One of the main technical challenges lies in devising tools that allow to handle large state spaces. Over the last years various approaches have been developed. Recently, an increasing interest in parallelizing and distributing verification techniques has emerged. The aim of the PDMC workshop series is to cover all aspects of parallel and distributed methods and techniques for verification. Theoretical results, algorithms and case studies are equally welcome. Contributions from the domains of model checking, theorem proving, performance evaluation and equivalence checking are anticipated. The PDMC workshop aims to provide a working forum for presenting, sharing, and discussing recent achievements in the field of parallel and distributed verification. The workshop will consist of invited talks and a selection from the submitted papers. SCOPE AND TOPICS: Papers describing recent work on all aspects of parallel and distributed verification are solicited as contributions to PDMC. Papers must be original and may not be submitted simultaneously to other conferences, workshops or journals. Topics of interest include, but are not limited to: * parallel and distributed methods in: - model checking - probabilistic model checking - performance and dependability evaluation - equivalence checking - satisfiability checking - constraints solving - theorem proving * system issues for parallel and distributed verification: - GRID vs. clusters vs. SMP (heterogeneity, co-scheduling) - load balancing, robustness, fault tolerance - slicing and distributing the state space - file system support * application: - tools and case studies - software platforms for distributed verification - methods and suites for benchmarking - industrial applications INVITED SPEAKER: * Lubos Brim (Masaryk Univ., Czech Republic) SUBMISSION GUIDELINES * All submissions should be made electronically on the Submission Page. * Manuscripts of "regular papers" are limited to a maximum of 15 pages (excluding technical appendices) in postscript or PDF format (LNCS style strongly recommended). * Manuscripts describing "tool demonstrations" are limited to a maximum of 5 pages in postscript or PDF format (LNCS style strongly recommended). PROCEEDINGS: * Preliminary workshop proceedings will be available at the meeting as a technical report. Revised final papers will appear as a Springer LNCS proceedings, jointly with FMICS. IMPORTANT DATES: * Abstract submission: May 26, 2006 * Submission deadline: June 2, 2006 * Notification of acceptance: July 10, 2006 * Final version: July 25, 2006 * Meeting date: August 31, 2006 PROGRAM COMMITTEE: PC members: * Gerd Behrmann (Aalborg University, Denmark) * Ivana Cerna (Masaryk University, Brno, Czech Republic) * Gianfranco Ciardo (University of California at Riverside, US) * Joerg Denzinger (University of Calgary, Canada) * Hubert Garavel (Inria, France) * Orna Grumberg (Technion, Haifa, Israel) * Boudewijn R. Haverkort (University of Twente, The Netherlands) * William Knottenbelt (Imperial College, UK) * Marta Kwiatkowska (University of Birmingham, UK) * Martin Leucker (TU Muenchen, Germany) * Jaco van de Pol (CWI, Amsterdam, The Netherlands) PC co-chairs: * Boudewijn R. Haverkort (University of Twente, The Netherlands) * Jaco van de Pol (CWI, Amsterdam, The Netherlands) -- Dr. J.C. van de Pol, CWI P.O.Box 94079, 1090 GB, Amsterdam, NL Ph: +31-20-5924137 | Fax: +31-20-5924199 vdpol at cwi.nl | http://www.cwi.nl/~vdpol From csl06 at inf.u-szeged.hu Tue Feb 28 02:46:42 2006 From: csl06 at inf.u-szeged.hu (Computer Science Logic '06 Conference) Date: Tue, 28 Feb 2006 08:46:42 +0100 Subject: [TYPES/announce] CSL'06 FINAL CALL FOR PAPERS Message-ID: <4403FFE2.7050302@inf.u-szeged.hu> ********************************************************************** * CSL'06 * * Annual Conference of the European Association for * * Computer Science Logic * * September 25 -- 29, 2006, Szeged, Hungary * * http://www.inf.u-szeged.hu/~csl06/ * * CALL FOR PAPERS * ********************************************************************** 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. CSL'06, the 15th annual EACSL conference will be organized by the Institute of Informatics, University of Szeged. Suggested topics of interest include: automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and formal logics, modal and temporal logic, model checking, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification of security protocols, linear logic, higher-order logic, nonmonotonic reasoning, logics and type systems for biology. Programme Committee: Invited speakers: Krzysztof Apt(Amsterdam/Singapore) Martin Escardo (Birmingham) Matthias Baaz (Vienna) Paul-Andre Mellies (Paris) Michael Benedikt (Chicago) Luke Ong (Oxford) Pierre-Louis Curien (Paris) Luc Segoufin (Orsay) Rocco De Nicola (Florence) Miroslaw Truszczynski(Lexington,KY) Zoltan Esik (Szeged, chair) Dov Gabbay (London) Fabio Gadducci (Pisa) Organizing Committee: Neil Immerman (Amherst) Michael Kaminski (Haifa) Bakhadyr Khoussainov (Auckland) Zoltan Esik (Szeged, co-chair) Ulrich Kohlenbach (Darmstadt) Zsolt Gazdag (Szeged) Marius Minea (Timisoara) Eva Gombas (Szeged, co-chair) Damian Niwinski (Warsaw) Szabolcs Ivan (Szeged) R. Ramanujam (Chennai) Zsolt Kakuk (Szeged) Philip Scott (Ottawa) Zoltan L. Nemeth (Szeged) Philippe Schnoebelen (Cachan) Sandor Vagvolgyi Alex Simpson (Edinburgh) (Szeged, workshop-chair) Proceedings will be published in the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and final copy prepared according to Springer's guidelines. Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They 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 1 April, 2006. Papers authored or coauthored by members of the Programme Committee are not allowed. Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewer's discretion. The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than 200 words, and a list of keywords. The submission deadline is in two stages. Titles and abstracts must be submitted by 24 April, 2006 and full papers by 1 May, 2006. Notifications of acceptance will be sent by 12 June, 2006, and final versions are due 3 July, 2006. A submission server will be available from 15 March, 2006. The Ackermann Award for 2006 will be presented to the recipients at CSL'06. Important Dates: Submission - title & abstract: 24 April, 2006 - full paper: 1 May, 2006 Notification: 12 June, 2006 Final papers: 3 July, 2006 Conference address: CSL'06 c/o Prof. Zoltan Esik Institute of Informatics, University of Szeged H-6701, Szeged, P.O.B. 652, Hungary web site: http://www.inf.u-szeged.hu/~csl06/ e-mail: csl06 at inf.u-szeged.hu phone: +36-62-544-289 or +36-62-544-205 fax: +36-62-544-895 or +36-62-546-397 ********************************************************************** ********************************************************************** From munoz at nianet.org Wed Mar 1 15:45:43 2006 From: munoz at nianet.org (Cesar A. Munoz) Date: Wed, 01 Mar 2006 15:45:43 -0500 Subject: [TYPES/announce] Strategies 2006 -- 2nd Call for Papers Message-ID: <1141245943.6210.11.camel@squirt.nianet.org> (Apologies for multiple copies) *** Second Call for Papers *** Sixth International Workshop on Strategies in Automated Deduction STRATEGIES 2006 http://research.nianet.org/strategies06 An IJCAR'06 Affiliated Workshop at FLoC 2006 STRATEGIES 2006 is a successor to both the series of STRATEGIES workshops associated with CADE and IJCAR and to the STRATA 2003 workshop associated with TPHOLs. The workshop is the primary forum for the communication of new results on control strategies and search plans in automated theorem proving, automated model building, decision procedures, interactive proof assistants, proof planners, and logical frameworks, in first-order (including propositional and purely equational as special cases), modal (e.g., temporal) and higher-order logics. Papers and participation are invited from both the fully automatic and interactive theorem proving communities. The proceedings of the workshop will appear in the Electronic Notes in Theoretical Computer Science (ENTCS). The page limit for regular paper has been increased to 16 pages and for position papers to 5 pages. For the full Call for Papers see: http://research.nianet.org/strategies06/cfp.html * Submission deadline: May 22, 2006 * Notification: June 26, 2006 * Final versions: July 10, 2006 * Workshop: August 16, 2006 * IJCAR: August 16 - August 21, 2006 * Inquiries: strategies06 at nianet.org From koba at kb.ecei.tohoku.ac.jp Fri Mar 3 00:17:31 2006 From: koba at kb.ecei.tohoku.ac.jp (koba@kb.ecei.tohoku.ac.jp) Date: Fri, 03 Mar 2006 14:17:31 +0900 (JST) Subject: [TYPES/announce] CFP: APLAS 2006 (Fourth Asian Symposium on Programming Languages and Systems) Message-ID: <20060303.141731.116893384.koba@kb.ecei.tohoku.ac.jp> CALL FOR PAPERS The Fourth ASIAN Symposium on Programming Languages and Systems (APLAS 2006) Sydney, Australia, November 8-10, 2006 http://www.kb.ecei.tohoku.ac.jp/aplas2006/ APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past formal APLAS symposiums were successfully held in Tsukuba (2005, Japan), Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of language systems are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair (koba at ecei.tohoku.ac.jp) prior to submission. GENERAL CO-CHAIRS Manuel Chakravarty (University of New South Wales, Australia) Gabriele Keller (University of New South Wales, Australia) PROGRAM CHAIR Naoki Kobayashi (Tohoku University) PROGRAM COMMITTEE Kung Chen (National Chengchi University, Taiwan) Wei-Ngan Chin (National University of Singapore, Singapore) Patrick Cousot (ENS, France) Masahito Hasegawa (Kyoto University, Japan) Jifeng He (United Nations University, Macau) Haruo Hosoya (University of Tokyo, Japan) Bo Huang (Intel China Software Center, China) Naoki Kobayashi (chair) (Tohoku University, Japan) Oege de Moor (Oxford University, UK) George Necula (University of California at Berkeley, USA) Martin Odersky (EPFL, Switzerland) Tamiya Onodera (IBM Research, Tokyo Research Laboratory, Japan) Yunheung Paek (Seoul National University, Korea) Sriram Rajamani (Microsoft Research, USA) Andrei Sabelfeld (Chalmers University of Technology, Sweden) Zhong Shao (Yale University, USA) Harald Sondergaard (University of Melbourne, Australia) Nobuko Yoshida (Imperial College London, UK) SUBMISSIONS INFORMATION Papers should be submitted electronically online via the conference submission webpage. 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. Submitted papers must be unpublished and not submitted for publication elsewhere. The proceedings of the symposium is planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. IMPORTANT DATES Submission deadline: June 2, 2006 Author notification: August 5, 2006 Camera Ready: August 25, 2006 Conference: November 8-10, 2006 From jcg at itu.dk Mon Mar 6 04:06:26 2006 From: jcg at itu.dk (Jens Chr. Godskesen) Date: Mon, 06 Mar 2006 10:06:26 +0100 Subject: [TYPES/announce] October 9-13, 2006, PhD School on Verification of Protocols for Security and Mobility Message-ID: <440BFB92.2090800@itu.dk> Call for Participation International PhD School on Verification of Protocols for Security and Mobility http://www.first.dk/VPSM Copenhagen, Denmark, October 9-13, 2006 This one-week PhD school will give young researchers, doctoral students, and others a comprehensive overview of contemporary automatic verification methods and tools. The participants will meet a variety of techniques including: static analysis, (on-the-fly, probabilistic, and real-time) model checking, and Coloured Petri Nets. The emphasis will be put on verification of protocols for security and mobility. The school will offer lectures by key researchers in automatic verification, security and mobility. The exercise classes will introduce the students to state-of-the-art tools for automatic verification. Speakers: * Professor David Basin,ETH Zurich, Switzerland * Professor Marta Kwiatkowska, University of Birmingham, UK * Professor Kim Guldstrand Larsen, Aalborg University, Denmark * Professor Hanne Riis Nielson, IMM, Technical University of Denmark * Professor Flemming Nielson, IMM, Technical University of Denmark * Associate Professor Gerd Behrmann, Aalborg University, Denmark * Associate Professor Lars M. Kristensen, University of ?rhus, Denmark Venue: The school will be held at the campus of the IT University of Copenhagen. Registration: Information about registration is available from the school's web page (http://www.first.dk/VPSM). Deadline for registration is 1 June. Organizer: Jens Chr. Godskesen From aserebre at win.tue.nl Tue Mar 7 08:11:31 2006 From: aserebre at win.tue.nl (A Serebrenik) Date: Tue, 7 Mar 2006 14:11:31 +0100 (CET) Subject: [TYPES/announce] Call for Posters - ICLP 2006 - Deadline: March, 14 Message-ID: CALL FOR POSTERS ICLP'06 22nd International Conference on Logic Programming Seattle, Washington, USA, 17-20 August, 2006 http://www.cs.uky.edu/iclp06/ Part of Fourth Federated Logic Conference, FLoC 2006 http://research.microsoft.com/floc06/ CONFERENCE SCOPE Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: * Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge Representation. * Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. * Environments: Program Analysis, Program Transformation, Validation and Verification, Debugging, Profiling. * Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Programming Techniques. * Alternative Paradigms: Constraint Logic Programming, Abductive Logic Programming, Inductive Logic Programming, Answer-Set Programming. * Applications: Deductive Databases, Data Integration, Software Engineering, Natural Language, Web Tools, Internet Agents, Artificial Intelligence. The three broad categories for submissions are: (1) technical papers, where specific attention will be given to work providing novel integrations of the areas listed above, (2) application papers, where the emphasis will be on their impact on the application domain as opposed to the advancement of the the state-of-the-art of logic programming, and (3) posters, ideal for presenting and discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. In addition to papers and posters, the technical program will include invited talks, advanced tutorials, several workshops and Doctoral Student Consortium. Details, as they become available will be posted at http://www.cs.uky.edu/iclp06/ PAPERS AND POSTERS Papers and posters must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English. Technical papers and application papers must not exceed 15 pages in the Springer LNCS format (cf. http://www.springer.de/comp/lncs/index.html). The limit for posters is 2 pages in that format. The primary means of submission will be electronic. More information on the submission procedure will be available at http://www.cs.uky.edu/iclp06/ PUBLICATION The proceedings of the conference will be published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. SUPPORT SPONSORING AND AWARDS The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two awards for ICLP'06: for the best technical paper and for the best student paper. IMPORTANT DATES Papers Posters Abstract submission deadline 14 February N/A Submission deadline 21 February 14 March Notification of authors 7 April 14 April Camera-ready copy due 2 May 2 May ICLP'2006 ORGANIZATION General Chair: Manuel Hermenegildo (herme at fi.upm.es) Program Co-Chairs: Sandro Etalle (s.etalle at utwente.nl) Mirek Truszczynski (mirek at cs.uky.edu) Workshop Chair: Christian Schulte (schulte at imit.kth.se) Doctoral Student Consortium: Enrico Pontelli (epontell at cs.nmsu.edu) Publicity Chair: Alexander Serebrenik (a.serebrenik at tue.nl) PROGRAM COMMITTEE Maria Alpuente Krzysztof Apt Annalisa Bossi Veronica Dahl Giorgio Delzanno Pierre Deransart Agostino Dovier Thomas Eiter Sandro Etalle, co-chair John Gallagher Michael Gelfond Hai-Feng Guo Manuel Hermenegildo Tomi Janhunen Fangzhen Lin Michael Maher Victor Marek Eric Monfroy Stephen Muggleton Brigitte Pientka Maurizio Proietti I.V. Ramakrishnan Peter van Roy Harald Sondergaard Mirek Truszczynski, co-chair German Vidal Andrei Voronkov Roland Yap CONFERENCE VENUE The conference will be a part of the fourth Federated Logic Conference (FLoC'06) to be held August 10-21, 2006, in Seattle, Washington (http://research.microsoft.com/floc06/). Other participating conferences are: Computer-Aided Verification (CAV), Rewriting Techniques and Applications (RTA), Logic in Computer Science (LICS), Theory and Applications of Satisfiability Testing (SAT), and Int'l Joint Conference on Automated Reasoning (IJCAR). Plenary events involving multiple conferences are planned. WORKSHOPS The ICLP-06 program will include several workshops. They provide a platform for the presentation of preliminary work and novel ideas in a less formal way than the conference itself. They also are an opportunity to disseminate work in progress, particularly for new researchers. Workshops also provide a venue for presenting more specialized topics and opportunities for more intensive discussions, exchange of ideas, and project collaboration. The following workshops will be held in association with the ICLP-06 conference: * International Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS2006) * Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS) * International Workshop on Software Verification and Validation (SVV 2006) * Preferences and Their Applications in Logic Programming Systems Search and Logic: Answer Set Programming and SAT * 16th Workshop on Logic-Based Programming Environments (WLPE 2006) * MVLP'06: International Workshop on Multi-Valued Logic and Logic Programming From pasalic at cs.rice.edu Tue Mar 7 11:50:46 2006 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Tue, 7 Mar 2006 10:50:46 -0600 Subject: [TYPES/announce] GPCE'06 Call for Tutorials/Workshops Message-ID: <38EDE7B1-3EB9-4A63-AE93-D5E43E34125E@cs.rice.edu> ------------------------------------------------------------------------ CALL FOR TUTORIALS/WORKSHOPS Fifth International Conference on Generative Programming and Component Engineering (GPCE'06) http://www.gpce.org/06/ October 22-26, 2006 Portland, Oregon (co-located with OOPSLA'06) Sponsored by ACM SIGPLAN, in cooperation with ACM SIGSOFT. Proceedings to be published by ACM Press. ------------------------------------------------------------------------ IMPORTANT DATES * Proposal submission deadline: Mar 18, 2006 * Date for notification of acceptance: May 01, 2006 WORKSHOPS --------- Overview GPCE workshops provide intensive collaborative environments where generative and component technology researchers and practitioners meet to discuss and solve challenging problems facing the field. We encourage proposals for innovative, well-focused workshops on a broad spectrum of component engineering and generative programming topics. All topics related to the theme of the conference are potential candidates for workshops. Workshops typically fall into the following categories: - A workshop may address a specific sub-area of generative and component technology in depth, e.g. model driven development. - A workshop may cover areas that cross the borders of several sub areas. Workshops that cross the borders of the formal and the applied areas is one example. - A workshop may also cross the border to other technologies or software engineering fields, e.g. development processes. - A workshop may focus on the application and deployment of generative and/or component technology in areas such as telecommunications, mobile computing or real-time systems. Workshops reporting on industrial experiences are particularly welcome. Workshop topics are by no means limited to the categories mentioned above. However, in each case, the proposed area is supposed to have enough impetus to yield new results that can be considered important and worth more detailed investigation. Submission Format Workshop proposals should be sent in ASCII or PDF format to the workshop chairs and should consist of the following four parts: 1. Cover Page - Name of the proposed workshop. - Names and addresses of the organizers. - Primary contact. - Intended number of participants. - Requested Audio/Video equipment. 2. Abstract Why is the proposed workshop relevant to GPCE? The abstract should provide a short overview of the rationale for the workshop and the major topics. In particular, statements about the review process and ways to ensure creativity during the workshop would be appreciated. The abstract should preferably not exceed 200 words. 3. Call for Participation A preliminary version of the Call for Participation that the organizers must prepare if the workshop is accepted. It should provide a brief overview of the proposed workshop including a description of the goals of the workshops and the work practices. It may repeat some of the statements made on the abstract page, but should be targeted specifically to potential workshop participants. 4. Organizers Bio and Past Events - Short biography of each organizer. - References to similar workshops organized at previous conferences, including the number of participants. If a workshop is accepted, the organizers will be requested to prepare a WWW page that will contain the latest information about the workshop. The web pages of each workshop will be linked to the GPCE workshop web site. Each workshop must have at least two organizers, preferably from different organizations. Please keep complete submissions to under four pages. Submission Process Electronic submission of proposals must be sent to workshops06 at gpce.org. Proposals must be submitted no later than Mar 18, 2006, BUT EARLIER IS BETTER, as it allows for a more satisfactory coordination between workshop proposals. For More Information The complete call and additional information can be found at http://www.gpce.org/06/. For additional information, clarification, or questions please feel free to contact the Workshop Chairs (workshops06 at gpce.org). The workshop chairs Christa Schwanninger, Siemens AG Hans-Arno Jacobson, University of Toronto TUTORIALS --------- Overview Proposals for high-quality tutorials in all areas of generative programming and component-based development, from academic research to industrial applications, are solicited. Tutorial levels may be introductory, intermediate, or advanced. A tutorial's purpose is to give a deeper insight into an area than a conventional lecture. Tutorials extend over a half or a full day. This gives the speaker the possibility to select a proper length for their tutorial. The topic of a tutorial can come from a truly broad spectrum. Any nteresting theme included but not restricted to the following topic list is welcome: - Generative programming - Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, step-wise refinement - Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, program transformation - Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection - Generative techniques for - Product lines and architectures - Embedded systems - Model-driven development / architecture - Component-based software engineering - Reuse, distributed platforms, distributed systems, evolution, analysis and design patterns, development methods, formal methods - Integration of generative and component-based approaches - Domain engineering and domain analysis - Domain-specific languages (DSLs) including visual and UML-based DSLs - Separation of concerns - Aspect-oriented programming and feature-oriented programming, - Intentional programming and multi-dimensional separation of concerns - Industrial applications However, you should keep in mind that a tutorial must be expected to attract a reasonable number of participants. This is most likely the case if the topic is new or relevant to a broad community. If you have deep experience in a GPCE topic area, from which others could benefit, please consider submitting a proposal. Submission Format Proposals must contain all information specified in the tutorial submission template. See http://www.program-transformation.org/GPCE06/SubmissionFormat What should a tutorial look like? In case your tutorial is accepted, the tutorial guidelines document offers suggestions for preparing and presenting your tutorial. See http://www.program-transformation.org/GPCE06/TutorialGuideline Submission Process Electronic submission of proposals must be sent to tutorials06 at gpce.org. Proposals must be submitted no later than Mar 18, 2006. The proposals received will be reviewed by the Tutorial Committee to ensure a high quality and appropriate mix for the conference. The Tutorial Chairs will work toward a diverse program that attracts a large interest among the broad segments within GPCE. For More Information The complete call and additional information can be found at http://www.gpce.org/06/. For additional information, clarification, or questions please feel free to contact the Tutorial Chairs (tutorials06 at gpce.org) The tutorial chairs Christa Schwanninger, Siemens AG Hans-Arno Jacobson, University of Toronto From txa at cs.nott.ac.uk Wed Mar 8 11:59:07 2006 From: txa at cs.nott.ac.uk (Thorsten Altenkirch) Date: Wed, 08 Mar 2006 16:59:07 +0000 Subject: [TYPES/announce] Final Call for Talks: TYPES 2006 workshop Message-ID: <440F0D5B.3040204@cs.nott.ac.uk> Please note that the deadline for early registration and submission of talks is Wednesday, 15/3/2006. Cheers, Thorsten TYPES 2006 Main Conference of the Types Project Nottingham, UK, 18-21 April 2006 http://www.cs.nott.ac.uk/types06/ This is the latest meeting in a series that started 1992, the previous conference was in December 2004 in Paris. The topic of the meeting is formal reasoning and computer programming based on Type Theory : languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. TYPES 2006 is colocated with TFP 2006 (Trends in Functional Programming) and we plan to hold a joint session on Dependently Typed Programming. Invited Speakers are: Bart Jacobs, Simon Peyton Jones (joint with TFP) and Hongwei Xi The conference takes place at Jubilee campus of the University of Nottingham, on-site accomodation will be available together with the registration. For more information see: http://www.cs.nott.ac.uk/types06/ Please direct all emails related to TYPES 2006 to types06 at cs.nott.ac.uk Cheers, The Organisation Comittee Thorsten Altenkirch, James Chapman, Conor McBride, Peter Morris and Wouter Swierstra . This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From Peter.Sewell at cl.cam.ac.uk Mon Mar 13 07:15:29 2006 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Mon, 13 Mar 2006 12:15:29 +0000 Subject: [TYPES/announce] Three Research Positions - Foundations of Distributed Computation Message-ID: [Apologies for multiple posting!] We'd be grateful if you could draw this to the attention of any suitable candidates. Thanks, Peter RESEARCH ASSOCIATE/RESEARCH ASSISTANT (THREE POSTS) Foundations of Distributed Computation Computer Laboratory, University of Cambridge Ref No: NR60 Grade: NRAS Salary: £20,044 - £30,002 pa. Grade: RAST Salary: £20,044 - £22,289 pa Limit of tenure: Up to two years for two Research Associate positions; one year for one Research Assistant position. Three Research Assistant/Research Associate positions are available in the foundations of distributed computation, funded by EPSRC grants EP/C510712 (Sewell, Gibbens, Norrish) and GR/T11715 (Sewell, Pitts). The work spans several areas: * Design, semantics and implementation of programming language constructs for distribution - covering type-safe communication, naming, version change, module systems, and dynamic linking. * Formal specification, automated testing and proof about real-world network protocols. * Tool support for mechanisation of large semantic definitions. * Reasoning about executable distributed programs. It builds on previous work on the experimental Acute programming language, on the NetSem semantics of real-world network protocols, and on the concerns of the POPLmark challenge problem in semantic mechanisation. Details of all these can be found at . For the two-year positions you should have a PhD in Computer Science, with a strong background in one or more of the following: * Programming Language Semantics * Programming Language Implementation (especially with respect to OCaml) * Automated proof assistants (especially one or more of HOL, Isabelle, Coq, and Twelf). * Network Protocols * Distributed Systems The one-year appointment may be either at the postdoctoral level (Research Associate) as above, or at a post-graduate level (Research Assistant). For the latter you should have a good first-class degree in Computer Science. For a suitably experienced candidate it may be possible to upgrade to a Senior Research Associate appointment. Enquiries about the project should be addressed to Dr Peter Sewell, . To apply please send as soon as possible a letter of application including a brief statement of the particular contribution you would make to the project, a CV, a completed PD18 form () and the names and contact details (postal and email addresses) of 2 referees to Kate Ellis University of Cambridge Computer Laboratory 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom or by e-mail (with documents in PDF format) to personnel-admin at cl.cam.ac.uk. Closing date: 20 April 2006. From Susanne.Graf at imag.fr Mon Mar 13 17:11:47 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Mon, 13 Mar 2006 23:11:47 +0100 Subject: [TYPES/announce] FMCO 2006: call for tutorial papers Message-ID: <4415EE23.2090000@imag.fr> *************************************************************** * CALL FOR TUTORIAL PAPERS * * * * 5th International Symposium on * * Formal Methods for Objects and Components * * FMCO 2006 * * 7 - 10 November 2006 * * CWI, Amsterdam, The Netherlands * * * * http://fmco.liacs.nl/fmco06.html * * * *************************************************************** The FMCO symposium is an annual international event on the application and development of formal methods in software engineering, with a special focus on component-based and object-oriented software systems. We invite submissions of tutorial papers on topics that fit under that rubric. Suggested, but not exclusive, topics of interest for submissions include: - models and logics for object-oriented and component-based systems; - formal aspects of analysis of large systems; - prediction, analysis and monitoring of extra-functional properties; - applications of modal logics, temporal logics and model checking for the specification and verification of object-oriented languages; - type systems and type theory for objects and components; - probabilistic systems, process calculi, and semantics of object and component oriented languages; - reasoning about security, trustworthiness and dependability of component-based systems. Important Dates --------------- Authors are invited to submit a title and a short abstract of one or two pages providing a tutorial perspective on research results or experiences related to the topics above. Accepted abstracts will be presented at the symposium and an extended tutorial paper of about 20 pages in LNCS style will be refereed and eventually published together with the contributions of the keynote speakers after the symposium, in a proceeding of Lecture Notes in Computer Science by Springer-Verlag. Selected papers will be published in revised and extended version in the Elsevier journal Theoretical Computer Science. Title and short abstract due: 5 September 2006 Abstract notification: 1 October 2006 Symposium: 7-10 November 2006 Tutorial paper due: 28 February 2007 Paper notification: 15 April 2007 Camera-ready paper due: 15 May 2007 The short abstracts must be in English and provide sufficient details to allow the organizing committee and the advisory board assessing the potential merits of the related tutorial papers. One author of each accepted abstract will be expected to present the tutorial at the symposium. The tutorial papers must be unpublished and not submitted for publication, but may contain previously published material. Short abstracts and tutorial papers must be submitted electronically to F.S. de Boer (frb at cwi.nl) or M.M. Bonsangue (marcello at liacs.nl). Format ------ The symposium is a four days event organised to provide an atmosphere that fosters collaborative work, discussions and interactions. Lectures are given by the keynote speakers listed below and by authors of accepted abstract. Keynote speakers and advisory board ----------------------------------- Gul Agha (The University of Illinois at Urbana-Champaign, USA) Sophia Drossopoulou (Imperial College, UK) Radu Iosif (Verimag, FR) Thierry Jeron (INRIA Rennes, FR) Erik Meijer, (Microsoft research, USA) Jayadev Misra (University of Texas at Austin, USA) Vijay A. Saraswat (IBM Research, USA) Vladimiro Sassone (University of Southampton, UK) Jan Tretmans (Radboud University Nijmegen, NL) Moshe Vardi (Rice University, USA) Philip Wadler (University of Edinburgh, UK) Organizing committee -------------------- F. S. de Boer (CWI and LIACS-Leiden University) M. M. Bonsangue (LIACS-Leiden University) S. Graf (Verimag) W.-P. de Roever (Christian-Albrechts University of Kiel) Sponsorship ----------- The symposium is sponsored by NWO, CWI, and LIACS. ============================================================================== For more information about the symposium see the FMCO site above or consult F.S. de Boer (frb at cwi.nl) or M.M. Bonsangue (marcello at liacs.nl). From zijiang.yang at wmich.edu Tue Mar 14 22:39:56 2006 From: zijiang.yang at wmich.edu (Zijiang (James) Yang) Date: Tue, 14 Mar 2006 22:39:56 -0500 Subject: [TYPES/announce] CFP: Internatinational Workshop on Software Verification and Validation Message-ID: <44178C8C.2080002@wmich.edu> SVV'06: 4th Internatinational Workshop on Software Verification and Validation August 21, 2006, Seattle, USA http://www.comp.nus.edu.sg/~abhik/svv06/ In Conjunction with Federated Logic Conferences (FLoC) 2006 *********************** *** CALL FOR PAPERS *** *********************** Goal of the Workshop ==================== Software is playing an important role in economy, government, and military. Since software is often deployed in safety critical applications, correctness and reliability have become issues of utmost importance. Techniques for verification and validation traditionally fall into three main categories. The first category involves informal methods such as software testing and monitoring. The second involves formal verification, i.e., model checking and theorem proving. The third is abstract interpretation and static program analysis techniques. The goal of this workshop is to promote discussion on novel combinations of these methodologies, as well as study the individual contribution of each of these methodologies in verifying software. An example of a combined verification methodology is the recent research direction that combines abstraction (of infinite-state programs into finite-state ones) with model checking (of finite-state systems). There is a growing conviction in the research community that such hybrid methodologies are imperative for the process of analyzing full-fledged software systems. This workshop will study combination of analysis methodologies for verification of software. This research is very important and timely since . Software is being increasingly used to control embedded systems which are often safety critical (such as automobile parts). . There is renewed promise in program verification in the recent years due to (a) progress in generating models from code, and (b) combination of model checking with other analysis techniques such as abstract interpretation. Topics Covered ============== The workshop will focus on theoretical techniques, practical methods as well as case studies for verification of conventional and embedded software systems. In particular, we welcome papers which describe combinations of formal and informal reasoning, as well as formal verification and program analysis techniques. Tool papers and case studies, which report on advances in verifying large scale programs in standard languages are particularly sought. The list of topics include, but are not restricted to: . Tools, environments and case studies for large scale software verification . Static analysis/Abstract interpretation/Program transformations for verification . Use of model checking and deductive techniques for software verification . Role of declarative programming languages (such as Prolog) for infinite state software verification. . Techniques to validate system software (such as compilers) as well as assembly code/Java bytecode . Proof techniques for verifying specific classes of software (such as object-oriented programs) . Integrating testing and run-time monitoring with formal techniques . Validation of UML diagrams, and/or requirement specifications . Software certification and proof carrying code . Integration of formal verification into software development projects Submissions Information ======================= . Regular submissions should be no more than 15 pages. Short papers (upto 5 pages) describing initial ideas are also welcome. All submitted papers should be in PS or PDF. Please avoid using zip, gzip, compress, tar etc. . Proceedings of the workshop will be published by Computing Research Repository (CoRR). . The deadlines are as follows. . Submission deadline: May 1, 2006 . Notification of Acceptance: June 9, 2006 . Final Version submission: June 23, 2006 Program Committee ================== . Rajeev Alur, Univ. of Penn. (USA) . Tevfik Bultan, Univ. of California Santa Barbara (USA) . Sagar Chaki, Software Engg Institute CMU (USA) . Maurizio Gabbrielli, Univ. of Bologna (Italy) . Aarti Gupta, NEC Labs (USA) . Gopal Gupta, Univ of Texas Dallas (USA) . Shengchao Qin, Univ. of Durham (UK) . C.R. Ramakrishnan, Univ. of Stony Brook (USA) . R.E. Kurt Stirewalt, Michigan State Univ. (USA) Invited Speakers ================ . Byron Cook, Microsoft Research Organizers ========== . Abhik Roychoudhury, National University of Singapore, Singapore. Email: abhik at comp.nus.edu.sg . Zijiang Yang, Western Michigan University, USA. Email: zijiang.yang at wmich.edu If you have any queries about the workshop, please send e-mail to either of us From kurz at mcs.le.ac.uk Wed Mar 15 07:07:58 2006 From: kurz at mcs.le.ac.uk (Alexander Kurz) Date: Wed, 15 Mar 2006 12:07:58 +0000 Subject: [TYPES/announce] MGS 2006 In-Reply-To: <4415EE23.2090000@imag.fr> References: <4415EE23.2090000@imag.fr> Message-ID: <4418039E.3090005@mcs.le.ac.uk> ************************************************************* Midlands Graduate School 2006 in the Foundations of Computing and MGS Workshop 2006 ************************************************************* 2nd Call for Participation The Midlands Graduate School is taking place 8 - 12 April 2006 at the University of Leicester, UK. A timetable is now available at our updated website http://www.cs.le.ac.uk/~mgs2006 The School finishes on Wednesday at lunch time. Afterwards a small workshop will be held to give PhD students the opportunity to present their own work. If you are interested send a title and abstract to mgs2006 at mcs.le.ac.uk. The School provides an intensive course of lectures on the Foundations of Computing. It is very well established, having run annually for the past six years, and has always proved a popular and successful event. This year we have Luke Ong, Oxford University and Thomas Streicher, Darmstadt University as guest lecturers. The lectures are aimed at graduate students, typically in their first or second year of study for a PhD. However, the school is open to anyone who is interested in learning more about mathematical computing foundations, and we especially invite participants from UK universities and from sites participating in the APPSEM working group. Foundational courses: R Crole Leicester Operational Semantics P Levy Birmingham Typed Lambda Calculus D Pattinson Leicester Category Theory Advanced courses: T Altenkirch Nottingham Quantum Programming M Escardo Birmingham Operational Domain Theory & Topology H Nilsson Nottingham Advanced Functional Programming L Ong Oxford Game Semantics T Streicher Darmstadt Constructive Logic E Tuosto Leicester Concurrency and Mobility We still have a small number grants for students resident in the UK, while APPSEM funds can be used to support students from APPSEM affiliated sites. For further details and registration please visit http://www.cs.le.ac.uk/~mgs2006 From ian.mackie at kcl.ac.uk Wed Mar 15 08:25:07 2006 From: ian.mackie at kcl.ac.uk (Ian Mackie) Date: Wed, 15 Mar 2006 13:25:07 +0000 Subject: [TYPES/announce] Call For Papers: DCM 2006 at ICALP Message-ID: <441815B3.90305@kcl.ac.uk> ====================================================================== Call for Papers DCM 2006 2nd International Workshop on Developments in Computational Models http://www.dcm-workshop.org.uk/2006 Venice, Italy 16 July 2006 A satellite event of ICALP 2006 ======================================================================= Several new models of computation have emerged in the last few years, and many developments of traditional computational models have been proposed with the aim of taking into account the new demands of computer systems users and the new capabilities of computation engines. A new computational model, or a new feature in a traditional one, usually is reflected in a new family of programming languages, and new paradigms of software development. The aim of this workshop is to bring together researchers who are currently developing new computational models or new features for traditional computational models, in order to foster their 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 2006 will be a one-day satellite event of ICALP 2006 related to TRACK B, which will take place in Venice, 2006. The first DCM workshop took place in Lisbon in 2005, as a satellite event of ICALP 2005. Topics of interest include all abstract models of computation and their applications to the development of programming languages and systems. For instance: Functional calculi: lambda-calculus, rho-calculus, term and graph rewriting; Object calculi; Interaction-based systems: interaction nets, games; Concurrent models: process calculi, action graphs; Calculi expressing locality, mobility, and active data; Quantum computational models; Biological or chemical models of computation. Submissions and Publication: Authors are invited to submit an abstract (max. 5 pages) by e-mail to dcm at lix.polytechnique.fr by 30 April 2006. Preliminary proceedings will be available at the workshop. Submissions should be in PostScript or PDF format, using ENTCS style files. After the workshop authors are invited to submit a full paper of their presentation. Accepted contributions will appear in an issue of Elsevier's Electronic Notes in Theoretical Computer Science. Important Dates: Submission Deadline for Abstracts: 30 April 2006 Notification: 21 May 2006 Pre-proceedings version due: 11 June 2006 Workshop 16 July 2006 Programme Committee: Jos Baeten, Eindhoven University of Technology, The Netherlands Horatiu Cirstea, LORIA, France Mariangiola Dezani, University of Torino, Italy Fran?ois Fages, INRIA, France Mario Florido, University of Porto, Portugal Simon Gay, University of Glasgow, UK Radha Jagadeesan, DePaul University, USA Jean-Pierre Jouannaud, Ecole Polytechnique, France (Co-Chair) Ian Mackie, Ecole Polytechnique and King's College London (Co-Chair) Herbert Wiklicky, Imperial College London, UK From Olivier.Roux at irccyn.ec-nantes.fr Wed Mar 15 09:58:13 2006 From: Olivier.Roux at irccyn.ec-nantes.fr (Olivier Roux) Date: Wed, 15 Mar 2006 15:58:13 +0100 Subject: [TYPES/announce] ECOOP 2006: Preliminary Program References: <69B846CF-0477-4AD7-B683-B7824115EBBF@irccyn.ec-nantes.fr> Message-ID: ECOOP 2006 (European Conference on Object Oriented Programming - 20th edition) July 3 -- 7, 2006, Nantes, (FRANCE) http://2006.ecoop.org The Preliminary Program is now available Look at the website for the different news about : Technical program The AITO Dahl-Nygaard Prizes for 2006 will be given to Erich Gamma, Richard Helm, Ralph Johnson, and (posthumously) to John Vlissides The technical program is now available including the presentation of the 20th edition panel. The deadline for early registration is May 23, 2006. Workshops The list of workshops is now available The call for workshops submission is open. Tutorials The list of tutorials is now available. Call for Poster and Demos The deadline for poster and demo proposals is May 5th. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060315/d9f84f79/attachment.htm From svb at doc.ic.ac.uk Wed Mar 15 18:02:09 2006 From: svb at doc.ic.ac.uk (Steffen van Bakel) Date: Wed, 15 Mar 2006 23:02:09 +0000 Subject: [TYPES/announce] Classical Logic and Computation: second call for papers Message-ID: <1142463728.44189cf100b73@www.doc.ic.ac.uk> Second Call for Papers International Workshop on Classical Logic and Computation Associated to: ICALP 2006, S. Servolo, Venice - Italy July 15, 2006 CL&C'06 is the first of a new conference series on "Classical Logic and Computation". It intends to cover all work aiming to propose a programming language inspired by classical logic, and a semantics for it. The fact that classical mathematical proofs of simply existential statements can be read as programs was established by Godel and Kreisel some 50 years ago. But the possibility of programming using a style inspired by Classical Logic (much as functional programming is inspired by Intuitionistic Logic) was taken seriously only after the seminal work of Griffin about typing continuations. There are today two main lines of research. The first studies some (version of lambda) calculus adapted to represent classical logic, like the symmetric mu-calculs, or the X-calculus. The second studies semantics for programs inspired by classical proofs, like game semantic or learning algorithms. These two directions are often independent. This workshop aims to start a fruitful exchange of ideas in the field. CL&C'06 is part of ICALP 2006. Publication: This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts outlining what will be presented at the workshop and of longer papers describing completed work, either published or unpublished, in the following areas: - types for calculi with continuations - design of programming languages inspired by classical logic, - witness extraction from classical proofs, - constructive semantics for classical logic (e.g. game semantics), - case studies (for any of the previous points) In order to make a submission: - Format your file in PS or PDF using the Springer LNCS Proceedings format (http://www.springer.com/sgw/cda /frontpage/0,11855,5-164-2-72376-0,00.html); we suggest a 20 page limit. - Use the submission links from http://www.doc.ic.ac.uk/~svb /CLaC Submissions will be refereed at normal standards. A participants' proceedings will be distributed at the workshop. A special issue of APAL associated with the workshop is being considered; this will be discussed at the workshop. Important dates: - Deadline for submission: April, 1. - Notification of acceptance: May, 15. - Final version due: June, 1. - Workshop dates: EITHER July 9 OR 15 OR 16. Programme committee: - Steffen van Bakel (Imperial College London): co-chair - Stefano Berardi (Turin): co-chair - Ulrich Berger (Swansea) - Theirry Coquand (Chalmers) - Pierre-Louis Curien (Paris VII) - Roy Dyckhoff (St Andrews) - Herman Geuvers (Nijmegen) - Hugo Herbelin (Inria) - Luke Ong (Oxford) - Michel Parigot (Paris VII) - Helmut Schwichtenberg (Muenchen) - Philip Wadler (Edinburgh) Steffen van Bakel -------- Department of Computing, Imperial College London, 180 Queen's Gate, London SW7 2BZ, tel: + 44 20 7594 8263 fax: + 44 20 7581 8024 email: svb @ doc.ic.ac.uk http://www.doc.ic.ac.uk/~svb From djg at cs.washington.edu Thu Mar 16 00:47:08 2006 From: djg at cs.washington.edu (Dan Grossman) Date: Wed, 15 Mar 2006 21:47:08 -0800 Subject: [TYPES/announce] Concurrency Summer School (Registration Deadline Extended) Message-ID: <4418FBDC.4020606@cs.washington.edu> [ We have extended the registration deadline by two weeks. Please register today. ] Call for Participation Summer School on Language-Based Techniques for Concurrent and Distributed Software July 12-21, 2006 University of Oregon Eugene, Oregon USA Registration Deadline: March 15 (NOW EXTENDED: March 31), 2006. http://www.cs.uoregon.edu/activities/summerschool/summer06/ e-mail: summerschool at cs.uoregon.edu Program ------- This Summer School will cover current research in language-based techniques for concurrent and distributed software, ranging from foundational materials on principles, logic and type systems to advanced techniques for analysis of concurrent software to the application of these ideas to practical systems. Material will be presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. The course is open to anyone interested. Prerequisites are an elementary knowledge of logic and mathematics that is usually covered in undergraduate classes on discrete mathematics. Some knowledge of programming languages at the level provided by an undergraduate survey course will also be expected. Our primary target group is PhD students. We also expect attendance by faculty members who would like to conduct research on this topic or introduce new courses at their universities. The program consists of more than thirty 80-minute lectures presented by internationally recognized leaders in programming languages and security research. Topics include: Static Analysis for Concurrency - Cormac Flanagan, University of California, Santa Cruz Design and Implementation of Concurrent Systems - Matthew Flatt, University of Utah Concurrency in Practice for C - Jeff Foster, University of Maryland, College Park Atomicity: Synchronization via Explicit Software Transactions - Dan Grossman, University of Washington Language-Based Techniques for Distributed Systems - Robert Harper, Carnegie Mellon University Making Concurrent Software Safer - Michael Hicks, University of Maryland, College Park Programming Dynamic Multithreaded Algorithms - Charles Leiserson and Bradley Kuszmaul, Massachusetts Institute of Technology Software Model Checking - Shaz Qadeer, Microsoft Research Type-Safe and Version-Safe Distributed Programming - Peter Sewell, University of Cambridge Architectural Support for Concurrency - Sandhya Dwarkadas, University of Rochester Venue ----- The summer school will be held at the University of Oregon, located in the southern Willamette Valley city of Eugene, close to some of the world's most spectacular beaches, mountains, lakes and forests. On Sunday, July 16, students will have the option of participating in a group activity in Oregon's countryside. Housing ------- The school will provide on-campus housing and meals. To share a room with another student attending the school, the cost is $460.00 (USD) per person. Housing rates are based on check-in Wednesday, July 12 and check-out before noon on Saturday, July 22. Some single rooms may be available for an additional fee of $130.00 (USD). If you'd like a single room, please indicate your choice and we will try to accommodate you on a first-come/first-served basis. Registration ------------ The cost for registration is $200.00 (USD) for graduate students, and $300.00 (USD) for other participants. Reigstration must be paid upon acceptance to the summer school, and is non-refundable. There are a limited number of grants available to fund part of the cost of student participation. If you are a graduate student and want to apply for grant money to cover your expenses, please also include a statement of your needs with your registration. Additional information about the program, registration, venue, and housing options is available on the web site. Or, you may request more information by email. To register for the Summer School, send a CV that includes a short description of your educational background and one letter of reference, unless you have already been granted a Ph.D. Please include your name, address and current academic status. Send all registration materials to summerschool at cs.uoregon.edu All registration materials should be delivered to the program by March 15 (NOW EXTENDED: March 31), 2006. Materials received after the closing date will be evaluated on a space available basis. Non U.S. citizens should begin immediately to obtain travel documents. Organizers ---------- Organizing committee: Jeff Foster, Dan Grossman, and Zena Ariola Sponsors -------- ACM SIGPLAN Google Microsoft From abel at informatik.uni-muenchen.de Thu Mar 16 08:54:58 2006 From: abel at informatik.uni-muenchen.de (Andreas Abel) Date: Thu, 16 Mar 2006 14:54:58 +0100 Subject: [TYPES/announce] Paper on Higher-Order Subtyping Message-ID: <44196E32.9040502@informatik.uni-muenchen.de> I'd like to announce a new paper: Polarized Subtyping for Sized Types (Extended Version) Submitted. http://www.tcs.ifi.lmu.de/~abel/mscs06.pdf In this article, I consider declarative and algorithmic higher-order subtyping. Completeness of algorithmic subtyping is shown via a new technique: Instead of constructing a model, closure of algorithmic subtyping under application is proven directly using a lexicographic induction on kinds and derivations. Transitivity is also shown using an induction on derivation. The resulting completeness proof is concise and technically light-weight, and suitable for a formalization in a weak logical framework, for instance, the Edinburgh LF. Best regards, Andreas Abel -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich http://www.tcs.informatik.uni-muenchen.de/~abel/ From selinger at mathstat.dal.ca Thu Mar 16 11:44:02 2006 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Thu, 16 Mar 2006 12:44:02 -0400 (AST) Subject: [TYPES/announce] 4th workshop on Quantum Programming Languages Message-ID: <20060316164402.8121C10854@sigma.mathstat.dal.ca> [The study of programming languages for quantum computing raises, among other things, interesting type-theoretic questions. Hence I hope that this announcement will be of interest to the types community. -PS] CALL FOR PAPERS 4th International Workshop on Quantum Programming Languages (QPL2006) July 17-19, 2006, Oxford http://www.mathstat.dal.ca/~selinger/qpl2006/ * * * The goal of this workshop is to bring together researchers working on mathematical foundations and programming languages for quantum computing. In the last few years, there has been a growing interest in logical tools, languages, and semantical methods for analyzing quantum computation. These foundational approaches complement the more mainstream research in quantum computation which emphasizes algorithms and complexity theory. Possible topics include the design and semantics of quantum programming languages, new paradigms for quantum programming, specification of quantum algorithms, higher-order quantum computation, quantum data types, reversible computation, axiomatic approaches to quantum computation, abstract models for quantum computation, properties of quantum computing resources and primitives, concurrent and distributed quantum computation, compilation of quantum programs, semantical methods in quantum information theory, and categorical models for quantum computation. Previous workshops in this series were held in Ottawa (2003), Turku (2004), and Chicago (2005). This year's workshop will be held in Oxford, as part of the week-long event "Cats, Kets and Cloisters", July 17-23, 2006, which will include four workshops on related topics (See http://se10.comlab.ox.ac.uk:8080/FOCS/CKCinOXFORD_en.html). TUTORIALS: The first day of the workshop, July 17, will consist of tutorials, followed by two days of contributed research talks. SUBMISSION PROCEDURE: Prospective speakers should submit a detailed abstract (or extended abstract) of 5-12 pages. Submissions of works in progress are encouraged, but must be more substantial than a research proposal. Submissions must provide sufficient detail to allow the program committee to assess the merits of the work. Submissions should be in Postscript or PDF format, and should be sent to selinger at mathstat.dal.ca by May 10 (please put "workshop submission" in the subject line). Receipt of all submissions will be acknowledged by return email. IMPORTANT DATES/DEADLINES: Submissions: May 10, 2006 Notification of acceptance: May 31, 2006 Corrected papers: June 14, 2006 Workshop: July 17-19, 2006 PROGRAM COMMITTEE: Samson Abramsky (Oxford) Bob Coecke (Oxford) Simon Gay (Glasgow) Philippe Jorrand (Grenoble) Prakash Panangaden (McGill) Peter Selinger (Dalhousie) CONTACT INFORMATION: Organizer: Peter Selinger Dalhousie University, Halifax, Canada Email: selinger at mathstat.dal.ca Local organizer: Bob Coecke Oxford Computing Laboratory Email: Bob.Coecke at comlab.ox.ac.uk (revised Mar 16, 2006) From iccp at doc.ic.ac.uk Fri Mar 17 16:17:36 2006 From: iccp at doc.ic.ac.uk (Iain Phillips) Date: Fri, 17 Mar 2006 21:17:36 +0000 Subject: [TYPES/announce] Express '06: first call for papers Message-ID: <441B2770.30805@doc.ic.ac.uk> [Of interest to those working on types for concurrency] First Call for Papers 13th International Workshop on Expressiveness in Concurrency EXPRESS'06 Affiliated with CONCUR 2006 Bonn, Germany 26 August 2006 http://www.doc.ic.ac.uk/express06 AIMS OF THE WORKSHOP The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus 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, rewrite systems etc.) on the basis of their relative expressive power. SUBMISSIONS: Submissions may be of two forms: - Short papers (not included in the proceedings): up to 4 pages, typeset 11 points - Full papers: up to 12 pages, typeset 11 points (excluding bibliography and technical appendices) Simultaneous submission to other conferences or journals is only allowed for short papers. Submissions may already use the ENTCS-style format. PUBLICATION OF THE PROCEEDINGS: The proceedings will be published after the workshop in the ENTCS (Electronic Notes in Theoretical Computer Science). A printed preliminary version of the proceedings will be available at the workshop. Authors will be asked to prepare their final version using the ENTCS-style format. We shall seek to arrange a special issue of a leading journal if the quality and quantity of submissions warrants this. If such a special issue is arranged then authors of selected papers will be invited after the workshop to submit a full version; those submissions will then be subject to a separate reviewing procedure matching the standards of the journal. IMPORTANT DATES: Deadline for Paper Submission: 1 June 2006 Notification to Authors: 10 July 2006 Final Version of Accepted Papers due: 24 July 2006 INVITED SPEAKERS: Robin Milner (Univ. of Cambridge, UK) Hagen Voelzer (Univ. of Luebeck, Germany) PROGRAM CO-CHAIRS: Roberto Amadio (Univ. Paris 7, France) Iain Phillips (Imperial College London, UK) PROGRAM COMMITTEE: Roberto Amadio (Univ. Paris 7, France) Michele Bugliesi (Univ. Ca' Foscari, Italy) Nadia Busi (Univ. di Bologna, Italy) Sibylle Froeschle (Warsaw Univ., Poland) Antonin Kucera (Masaryk Univ. in Brno, Czech Rep.) Bas Luttik (Technical Univ. Eindhoven, Netherlands) Michael Mislove (Tulane Univ., USA) Uwe Nestmann (TU Berlin, Germany) Joel Ouaknine (Univ. of Oxford, UK) Catuscia Palamidessi (INRIA Futurs, LIX Ecole Polytechnique, FR) Iain Phillips (Imperial College London, UK) Philippe Schnoebelen (CNRS Cachan, France) Pawel Sobocinski (Univ. of Cambridge, UK) Marielle Stoelinga (Univ. of Twente, Netherlands) CONTACT: Iain Phillips - iccp at doc.ic.ac.uk Roberto Amadio - Roberto.Amadio at pps.jussieu.fr From dale at lix.polytechnique.fr Tue Mar 21 05:08:05 2006 From: dale at lix.polytechnique.fr (Dale Miller) Date: Tue, 21 Mar 2006 11:08:05 +0100 Subject: [TYPES/announce] A postdoc and a PhD position at INRIA Message-ID: <441FD085.2050006@lix.polytechnique.fr> The Parsifal project at INRIA-Futurs (located at the LIX lab on the Ecole Polytechnique campus) has the possibility of funding both a postdoc position and a PhD student. For more information on these positions, see the links below. Deadlines for applying are quickly approaching. - a Postdoc position on "Reasoning about Logic Specifications" Application deadline: March 30, 2006. Consult http://www.inria.fr/travailler/opportunites/postdoc/postdoc.en.html and http://www.talentsplace.com/syndication1/inria/ukpostdoc/index.html (follow links to Saclay (Orsay). - a PhD position on "Proof Carrying Code". Consult http://www.lix.polytechnique.fr/parsifal/ Application deadline: End of April 2006. Please direct comments to Dale Miller (Parsifal team leader) http://www.lix.polytechnique.fr/Labo/Dale.Miller/ From alan.schmitt at polytechnique.org Tue Mar 21 06:39:10 2006 From: alan.schmitt at polytechnique.org (Alan Schmitt) Date: Tue, 21 Mar 2006 12:39:10 +0100 Subject: [TYPES/announce] =?iso-8859-1?q?Postdoc_position_at_INRIA_Rh=F4ne?= =?iso-8859-1?q?-Alpes?= Message-ID: <4B3C807D-A431-457C-852E-B53659FA082A@polytechnique.org> The team Sardes (http://sardes.inrialpes.fr/) at INRIA Rh?ne-Alpes (Grenoble) is offering a postdoc position on formalization and typing of software components, based on its current work on the Kell calculus (http://sardes.inrialpes.fr/kells/). The subject is available at http://www.inrialpes.fr/Fiches_Postes/postdocs2006/PD% 20proposal%2006%20Sardes%20Schmitt.pdf . More information on how to apply can be found on the page http:// www.inrialpes.fr/postdocs_eng2.html . The application deadline is April 17th, 2006. Alan Schmitt -- Alan Schmitt The hacker: someone who figured things out and made something cool happen. .O. ..O OOO -------------- next part -------------- A non-text attachment was scrubbed... Name: PGP.sig Type: application/pgp-signature Size: 186 bytes Desc: This is a digitally signed message part Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060321/36c045a2/PGP.sig From chris at ags.uni-sb.de Tue Mar 21 05:35:03 2006 From: chris at ags.uni-sb.de (Christoph Benzmueller) Date: Tue, 21 Mar 2006 11:35:03 +0100 Subject: [TYPES/announce] UITP'06: Second Call for Papers Message-ID: <441FD6D7.2090907@ags.uni-sb.de> [Apologies if you receive multiple copies] CALL FOR PAPERS User Interfaces for Theorem Provers, UITP 2006 A satellite workshop of FLoC'06 Seattle, USA, Monday August 21st 2006 http://www.ags.uni-sb.de/~omega/workshops/UITP06/ The User Interfaces for Theorem Provers workshop series brings together researchers interested in designing, developing and evaluating interfaces for interactive proof systems, such as theorem provers, formal method tools, and other tools manipulating and presenting mathematical formulas. While the reasoning capabilities of interactive proof systems have increased dramatically over the last years, the system interfaces have often not enjoyed the same attention as the proof engines themselves. In many cases, interfaces remain relatively basic and under-designed. Initial studies by HCI (Human-Computer Interaction) practitioners and theorem-prover developers working in collaboration have had promising early results, but much remains to be investigated. The User Interfaces for Theorem Provers workshop series provides a forum for researchers interested in improving human interaction with proof systems. We welcome participation and contributions from the theorem proving, formal methods and tools, and HCI communities, both to report on experience with existing systems, and to discuss new directions. UITP 2006 is a one-day workshop to be held on Monday, August 21st 2006 in Seattle, USA, as a FLoC'06 workshop. Submissions We encourage submission of short abstracts or papers (from 4--20 pages). Submissions will be reviewed by the program committee. We will invite authors of accepted submissions to talk at the workshop (slots of 20--30 minutes are expected). Submissions presented at the workshop will be included in informal proceedings to be distributed at the workshop and made available electronically afterward. Suggested topics include, but are not restricted to: * Novel and traditional interfaces for interactive proof systems including: - command line based user interfaces - graphical user interfaces - natural language based user interfaces * Bridging the gap between human-oriented and machine-oriented proofs * Design principles for interfaces * Representation languages for proofs and mathematical objects * Tools for exploration, visualization and explanation of mathematical objects and proofs * User-evaluation of interfaces * Integration of proof systems into e-learning environments * Web-based services for proof systems * Implementation experiences * System descriptions Authors are encouraged to bring along versions of their systems suitable for informal demonstration during breaks in the program of talks. The workshop proceedings will be distributed at the workshop as a collection of the accepted papers. Final versions of accepted papers have to be prepared with LaTeX. Following up the workshop the (revised) accepted papers will be published in a volume of ENTCS devoted to the workshop. Dates Deadline for submissions: May 15th 2006 Notification: June 20th 2006 Final versions due: July 10th 2006 Workshop: August 21st 2006 Submission is via EasyChair (thanks to Andrei Voronkov) http://www.easychair.org/UITP-06/ More information can be found on the UITP web page at http://www.ags.uni-sb.de/~omega/workshops/UITP06/ Program Committee David Aspinall (University of Edinburgh, UK) Yves Bertot (INRIA Sophia Antiplois, France) Paul Cairns (University College London, UK) Ewen Denney (NASA Ames Research Center, USA) Christoph L?th (University of Bremen, Germany) Michael Norrish (NICTA, Australia) Florina Piroi (RISC Linz, Austria) Aarne Ranta (Chalmers University, Sweden) Makarius M. M. Wenzel (Technical University Munich, Germany) Organizers and PC Chairs Serge Autexier (DFKI, Germany) Christoph Benzm?ller (Saarland University, Germany) -- Christoph Benzmueller, Saarland University, www.ags.uni-sb.de/~chris From Francois.Pottier at inria.fr Thu Mar 23 07:21:30 2006 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Thu, 23 Mar 2006 13:21:30 +0100 Subject: [TYPES/announce] [CFP] 2006 ACM SIGPLAN Workshop on ML Message-ID: <20060323122130.GA21134@yquem.inria.fr> ********************************************************************* * The 2006 ACM SIGPLAN Workshop on ML * * * * September 16, 2006 * * * * Colocated with the 11th ACM SIGPLAN * * International Conference on Functional Programming (ICFP 2006), * * Portland, Oregon. * * * * Call for Papers * * * * http://gallium.inria.fr/ml2006/ * ********************************************************************* Important dates * Submission deadline: Saturday 3rd June 2006. * Notification of acceptance: Saturday 8th July 2006. * Final paper due: Saturday 29th July 2006. Scope The ML family of programming languages, whose most popular variants are SML and OCaml, has inspired a tremendous amount of computer science research, both practical and theoretical, and ML continues to underpin a variety of applications, ranging from compilers and theorem provers to low-level system software. This workshop aims to provide a forum for discussion and research on existing and future ML and ML-like languages. We seek papers on any ML-related topic, including (but not limited to): * applications. * extensions: objects, classes, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, modules, specification, error reporting, etc. * implementation: compilers, interpreters, partial evaluators, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, etc. * semantics. Both experimental and theoretical papers are welcome. Each paper 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. In order to encourage lively discussion, submitted papers may describe work in progress. Papers must be submitted in either PDF format or as PostScript documents that are interpretable by Ghostscript. They must be printable on US Letter sized paper. Papers should be formatted using the ACM SIGPLAN style guidelines available at http://www.acm.org/sigs/sigplan/authorInformation.htm The length should be no more than 12 pages. Proceedings will be published by ACM Press and will appear in the ACM Digital Library. Authors of accepted papers will be required to sign the ACM copyright form. General Chairs and Program Chairs Andrew Kennedy Microsoft Research Ltd, 7 JJ Thomson Ave, Cambridge CB3 0FB, UK akenn at microsoft.com Fran?ois Pottier INRIA Rocquencourt BP 105 78153 Le Chesnay Cedex FRANCE francois.pottier at inria.fr Programme Committee Derek Dreyer (Toyota Technological Institute at Chicago) Matthew Fluet (Cornell University) John Harrison (Intel Corporation) Haruo Hosoya (University of Tokyo) Andrew Kennedy (Microsoft Research Cambridge, co-chair) Eugenio Moggi (Universit? di Genova) Michael Norrish (National ICT Australia) Fran?ois Pottier (INRIA Rocquencourt, co-chair) Ian Stark (University of Edinburgh) Alley Stoughton (Kansas State University) J?r?me Vouillon (CNRS and Universit? Paris 7) Stephanie Weirich (University of Pennsylvania) From dave at chalmers.se Fri Mar 24 06:01:58 2006 From: dave at chalmers.se (David Sands) Date: Fri, 24 Mar 2006 12:01:58 +0100 Subject: [TYPES/announce] PhD positions at Chalmers, application deadline March 31 Message-ID: <4423D1A6.4000202@chalmers.se> [ Please pass the following information to suitable candidates Regards, Dave ] There is one week remaining to the deadline for open PhD positions at the computer science division at Chalmers. Outstanding applicants interested in language based security are particularly encouraged to apply. Application deadline: March 31 Link: http://chalmersnyheter.chalmers.se/chalmers03/svensk/ext_ledigatjansterarticle.jsp?article=6637 Regards, Dave From robby at cs.uchicago.edu Fri Mar 31 11:42:23 2006 From: robby at cs.uchicago.edu (Robby Findler) Date: Fri, 31 Mar 2006 10:42:23 -0600 (CST) Subject: [TYPES/announce] Scheme Workshop 2006 Message-ID: <20060331164223.56A436D90B@laime.cs.uchicago.edu> Dear all, I'm writing to let you know about the upcoming Scheme and Functional Programming workshop -- specifically that the submission deadline is June 9, about 2 months from now. The workshop will be held Portland Oregon on September 17, the day before ICFP. We look forward you your submissions! Best, Robby ============================================================ The purpose of the workshop is to discuss experience with and future developments of the Scheme programming language, as well as general aspects of computer science loosely centered on the general theme of Scheme. http://scheme2006.cs.uchicago.edu/ IMPORTANT DATES Submission deadline: Friday June 9 Author notification: Friday June 30 Final versions due: Friday July 14 Workshop: Sunday September 17, the day before ICFP CALL FOR PAPERS Papers are invited concerning all aspects of the design, semantics, theory, application, implementation, and teaching of Scheme. Some example areas include (but are not limited to): * Language design Scheme's simple syntactic framework and minimal static semantics has historically made the language an attractive lab bench for the development and experimentation of novel language features and mechanisms. Topics in this area include modules systems, exceptions, control mechanisms, distributed programming, concurrency and synchronisation, macro systems, and objects. Past, present and future SRFIs are welcome. * Type systems Static analyses for dynamic type systems, type systems that bridge the gap between static and dynamic types, static systems with type dynamic extensions, weak typing. * Theory Formal semantics, calculi, correctness of analyses and transformations, lambda calculus. * Implementation Compilers, runtime systems, optimisation, virtual machines, resource management, interpreters, foreign-function and operating system interfaces, partial evaluation, program analysis and transformation, embedded systems, and generally implementations with novel or noteworthy features. * Program-development environments and tools The Lisp and Scheme family of programming languages have traditionally been the source of innovative program-development environments. Authors working on these issues are encouraged to submit papers describing their technologies. Topics include profilers, tracers, debuggers, program understanding tools, performance and conformance test suites and tools. * Education Scheme has achieved widespread use as a tool for teaching computer science. Papers on the theory and practice of teaching with Scheme are invited. * Agile Methogologies Dynamic languages seem to share a symbiotic relationship with agile software development methodologies. In particular, the dynamic type checking of Scheme clearly benefits from test-driven development, but that same dynamic checking makes the software more easily adapted to changing requirements. * Applications and experience Interesting applications which illuminate aspects of Scheme experience with Scheme in commercial or real-world contexts; use of Scheme as an extension or scripting language. * Scheme pearls Elegant, instructive examples of functional programming. A Scheme pearl submission is a special category, and should be a short paper presenting an algorithm, idea or programming device using Scheme in a way that is particularly elegant. Following the model of earlier workshops, experience papers need not necessarily report original research results; they may instead report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! ORGANIZERS Program Chair Robby Findler, University of Chicago Program Committee John Clements, Cal Poly Sebastian Egner, Philips Research Robby Findler, University of Chicago Cormac Flanagan, UC Santa Cruz Erik Hilsdale, Google Eric Knauel, University of Tubingen Steering Committee William D. Clinger, Northeastern University Marc Feeley, University of Montreal Robby Findler, University of Chicago Dan Friedman, Indiana University Christian Queinnec, University Paris 6 Manuel Serrano, INRIA Olin Shivers, Georgia Tech Mitchell Wand, Northeastern University From svb at doc.ic.ac.uk Mon Apr 3 08:35:43 2006 From: svb at doc.ic.ac.uk (Steffen van Bakel) Date: Mon, 3 Apr 2006 13:35:43 +0100 Subject: [TYPES/announce] Deadline Extension CL&C'06 Message-ID: <1144067743.4431169f2cf19@www.doc.ic.ac.uk> ------------------- | DEADLINE EXTENDED | | | | now: April 15 | ------------------- ?? ? ? ? ? ? ? ? ? ? ? Third Call for Papers ?? ? ? ? ? ? ? ? ? ? ? International Workshop ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?on ?? ? ? ? ? ? ? ? ?Classical Logic and Computation Associated to: ICALP 2006, S. Servolo, Venice - Italy July 15, 2006 CL&C'06 is the first of a new conference series on "Classical Logic and Computation". It intends to cover all work aiming to propose a programming language inspired by classical logic, and a semantics for it. The fact that classical mathematical proofs of simply existential statements can be read as programs was established by Godel and Kreisel some 50 years ago. ?But the possibility of programming using a style inspired by Classical Logic (much as functional programming is inspired by Intuitionistic Logic) was taken seriously only after the seminal work of Griffin about typing continuations. There are today two main lines of research. ?The first studies some (version of lambda) calculus adapted to represent classical logic, like the symmetric mu-calculs, or the X-calculus. ?The second studies semantics for programs inspired by classical proofs, like game semantic or learning algorithms. ?These two directions are often independent. This workshop aims to start a fruitful exchange of ideas in the field. CL&C'06 is part of ICALP 2006. Publication: This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. ?We therefore ask for submission both of short abstracts outlining what will be presented at the workshop and of longer papers describing completed work, either published or unpublished, in the following areas: ?? ? ? ?- types for calculi with continuations ?? ? ? ?- design of programming languages inspired by classical logic, ?? ? ? ?- witness extraction from classical proofs, ?? ? ? ?- constructive semantics for classical logic (e.g. game ?? ? ? ? ?semantics), ?? ? ? ?- case studies (for any of the previous points) In order to make a submission: ?? ? ? ?- Format your file in PS or PDF using the Springer LNCS ?? ? ? ? ?Proceedings format (http://www.springer.com/sgw/cda ?? ? ? ? ?/frontpage/0,11855,5-164-2-72376-0,00.html); we suggest a 20 ?? ? ? ? ?page limit. ?? ? ? ?- Use the submission links from http://www.doc.ic.ac.uk/~svb ?? ? ? ? ?/CLaC Submissions will be refereed at normal standards. ?A participants' proceedings will be distributed at the workshop. ?A special issue of APAL associated with the workshop is being considered; this will be discussed at the workshop. Important dates: ?? ? ? ?- Deadline for submission: April, 15. ?? ? ? ?- Notification of acceptance: May, 15. ?? ? ? ?- Final version due: June, 1. ?? ? ? ?- Workshop date: July 15. Programme committee: ?? ? ? ?- Steffen van Bakel (Imperial College London): co-chair ?? ? ? ?- Stefano Berardi (Turin): co-chair ?? ? ? ?- Ulrich Berger (Swansea) ?? ? ? ?- Theirry Coquand (Chalmers) ?? ? ? ?- Pierre-Louis Curien (Paris VII) ?? ? ? ?- Roy Dyckhoff (St Andrews) ?? ? ? ?- Herman Geuvers (Nijmegen) ?? ? ? ?- Hugo Herbelin (Inria) ?? ? ? ?- Luke Ong (Oxford) ?? ? ? ?- Michel Parigot (Paris VII) ?? ? ? ?- Helmut Schwichtenberg (Muenchen) ?? ? ? ?- Philip Wadler (Edinburgh) Regards, Steffen van Bakel -------- ?? ? ? ?Department of Computing, ?? ? ? ?Imperial College London, ?? ? ? ?180 Queen's Gate, ? ?? ? ? ?London SW7 2BZ, ? ?? ? ? ?tel: ? + 44 20 7594 8263 ?? ? ? ?fax: ? + 44 20 7581 8024 ?? ? ? ?email: svb @ doc.ic.ac.uk ?? ? ? ?http://www.doc.ic.ac.uk/~svb From davide at disi.unige.it Mon Apr 3 08:45:31 2006 From: davide at disi.unige.it (Davide Ancona) Date: Mon, 03 Apr 2006 14:45:31 +0200 Subject: [TYPES/announce] Extended Deadline: FTfJP '06 - Formal Techniques for Java-like Programs Message-ID: <443118EB.7050907@disi.unige.it> Important dates: submission of contributions April *8*, 2006 notification May *8*, 2006 workshop July 4, 2006 CALL FOR CONTRIBUTIONS FTfJP'2006 8th ECOOP Workshop on Formal Techniques for Java-like Programs http://www.cs.ru.nl/ftfjp/ 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: - 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. Contributions (of up to 10 pages) 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. During the review process the Program Commitee will individuate one or more specific topics to focus on, in order to facilitate interaction during each session of the workshop. 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. A special journal issue is planned to collect selected contributions as has been done for the previous FTfJP workshops. Contributions *must* be pdf format and must be accompanied by a plain-text abstract. They should be sent to Davide Ancona (davide at disi.unige.it) by April 8, 2006. Program Committee: Davide Ancona, (co-chair) University of Genova, Italy Bernhard Beckert, University Koblenz-Landau, Germany Yoonsik Cheon, University of Texas at El Paso, USA Dave Clarke, CWI, Netherlands Sophia Drossopoulou, Imperial College, UK Erik Ernst, University of Aarhus, Denmark Paola Giannini, University of Piemonte Orientale, Italy Michael Hicks, University of Maryland, College Park, USA Atsushi Igarashi, Kyoto University, Japan Rustan Leino, Microsoft Research, USA Elena Zucca, (chair) University of Genova, Italy From crolard at univ-paris12.fr Mon Apr 3 10:29:09 2006 From: crolard at univ-paris12.fr (Tristan Crolard) Date: Mon, 3 Apr 2006 16:29:09 +0200 Subject: [TYPES/announce] Fundamenta Informaticae: special issue on the Logic for Pragmatics (DEADLINE EXTENDED) Message-ID: <0F630E90-A1BB-4649-874E-5613077C292A@univ-paris12.fr> Dear All, Due to several requests for individual extension, the deadline for submissions to the special issue of Fundamenta Informaticae devoted to the Logic for Pragmatics has been extended to APRIL THE 15th. The call for papers has been updated accordingly: http://www.univ-paris12.fr/lacl/LP/ On behalf of the guest editors, T. Crolard From zijiang.yang at wmich.edu Wed Apr 5 10:12:02 2006 From: zijiang.yang at wmich.edu (James Yang) Date: Wed, 05 Apr 2006 10:12:02 -0400 Subject: [TYPES/announce] CFP: International Workshop on Software Verification and Validation Message-ID: <001c01c658ba$e91dbf40$ea8c500a@JamesYang> SVV'06: 4th International Workshop on Software Verification and Validation August 21, 2006, Seattle, USA http://www.comp.nus.edu.sg/~abhik/svv06/ In Conjunction with Federated Logic Conferences (FLoC) 2006 CALL FOR PAPERS Goal of the Workshop ==================== Software is playing an important role in economy, government, and military. Since software is often deployed in safety critical applications, correctness and reliability have become issues of utmost importance. Techniques for verification and validation traditionally fall into three main categories. The first category involves informal methods such as software testing and monitoring. The second involves formal verification, i.e., model checking and theorem proving. The third is abstract interpretation and static program analysis techniques. The goal of this workshop is to promote discussion on novel combinations of these methodologies, as well as study the individual contribution of each of these methodologies in verifying software. An example of a combined verification methodology is the recent research direction that combines abstraction (of infinite-state programs into finite-state ones) with model checking (of finite-state systems). There is a growing conviction in the research community that such hybrid methodologies are imperative for the process of analyzing full-fledged software systems. This workshop will study combination of analysis methodologies for verification of software. This research is very important and timely since . Software is being increasingly used to control embedded systems which are often safety critical (such as automobile parts). . There is renewed promise in program verification in the recent years due to (a) progress in generating models from code, and (b) combination of model checking with other analysis techniques such as abstract interpretation. Topics Covered ============== The workshop will focus on theoretical techniques, practical methods as well as case studies for verification of conventional and embedded software systems. In particular, we welcome papers which describe combinations of formal and informal reasoning, as well as formal verification and program analysis techniques. Tool papers and case studies, which report on advances in verifying large scale programs in standard languages are particularly sought. The list of topics include, but are not restricted to: . Tools, environments and case studies for large scale software verification . Static analysis/Abstract interpretation/Program transformations for verification . Use of model checking and deductive techniques for software verification . Role of declarative programming languages (such as Prolog) for infinite state software verification. . Techniques to validate system software (such as compilers) as well as assembly code/Java bytecode . Proof techniques for verifying specific classes of software (such as object-oriented programs) . Integrating testing and run-time monitoring with formal techniques . Validation of UML diagrams, and/or requirement specifications . Software certification and proof carrying code . Integration of formal verification into software development projects Submissions Information ======================= . Regular submissions should be no more than 15 pages. Short papers (upto 5 pages) describing initial ideas are also welcome. All submitted papers should be in PS or PDF. Please avoid using zip, gzip, compress, tar etc. . Proceedings of the workshop will be published by Computing Research Repository (CoRR). . The deadlines are as follows. . Submission deadline: May 1, 2006 . Notification of Acceptance: June 9, 2006 . Final Version submission: June 23, 2006 Program Committee ================== . Rajeev Alur, Univ. of Penn. (USA) . Tevfik Bultan, Univ. of California Santa Barbara (USA) . Sagar Chaki, Software Engg Institute CMU (USA) . Maurizio Gabbrielli, Univ. of Bologna (Italy) . Aarti Gupta, NEC Labs (USA) . Gopal Gupta, Univ of Texas Dallas (USA) . Shengchao Qin, Univ. of Durham (UK) . C.R. Ramakrishnan, Univ. of Stony Brook (USA) . R.E. Kurt Stirewalt, Michigan State Univ. (USA) Invited Speakers ================ . Byron Cook, Microsoft Research Organizers ========== . Abhik Roychoudhury, National University of Singapore, Singapore. Email: abhik at comp.nus.edu.sg . Zijiang Yang, Western Michigan University, USA. Email: zijiang.yang at wmich.edu If you have any queries about the workshop, please send e-mail to either of us -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060405/d3849a29/attachment.htm From martinb at dcs.qmul.ac.uk Thu Apr 6 08:08:17 2006 From: martinb at dcs.qmul.ac.uk (Martin Berger) Date: Thu, 06 Apr 2006 13:08:17 +0100 Subject: [TYPES/announce] Paper on Higher-Order Subtyping In-Reply-To: <44196E32.9040502@informatik.uni-muenchen.de> References: <44196E32.9040502@informatik.uni-muenchen.de> Message-ID: <443504B1.3090502@dcs.qmul.ac.uk> Hello colleagues, we'd like to announce a new paper. Descriptive and Relative Completeness of Logics for Higher-Order Functions available at http://www.dcs.qmul.ac.uk/~martinb/publications/completeness Abstract: This paper establishes a strong completeness property of compositional program logics for pure and imperative higher-order functions introduced by the authors. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former's behaviour up to the standard observational semantics. This formula is inductively calculable from the program text alone. As a consequence we obtain the first relative completeness result for compositional logics of pure and imperative call-by-value higher-order functions in the full type hierarchy. Your comments and though are highly appreciated. Best wishes, Kohei Honda, Nobuko Yoshida, Martin Berger From axm011500 at utdallas.edu Thu Apr 6 14:34:41 2006 From: axm011500 at utdallas.edu (Ajay Mallya) Date: Thu, 6 Apr 2006 13:34:41 -0500 (CDT) Subject: [TYPES/announce] CFP: MVLP06, Intl. Workshop on Multi-Valued Logic Programming and Applications Message-ID: CALL FOR PAPERS ICLP'2006 Workshop on Multi-Valued Logic Programming and Applications MVLPA'2006 Seattle, Washington, Aug. 21st, 2006 URL: http://www.utdallas.edu/~axm011500/mvlpa06.html Multi-Valued logics provide powerful mechanisms for reasoning about domains that are incomplete and inconsistent, such as databases, knowledge representation, model checking,asynchronous electronic circuits, etc. It is interesting to study the various semantics of multi-valued logics in general and in particular,logic programming from the perspective of multi-valued logics. The classical semantic formulations of logic programming, such as the minimal Herbrand model semantics, the well-founded semantics, the answer set semantics need to reinterpreted in the multi-valued scenario. Given a solid semantic foundation for a multi-valued logic programming framework, it can then be used as an elegant declarative specification language for the above application domains. Research in this area spans theoretical issues regarding the semantics and the role of negation, to implementation strategies, to practical tools for solving problems in various application domains. The workshop is meant to provide a channel for interaction between researchers working in these areas, by presenting their results and fostering discussion. This will engender newdirections for researchers to pursue and showcase the considerable amount of research thathas already been performed in the area. Authors are invited to submit original research, survey or tutorial papers in the areas of Multiple-valued Logic and Multi-valued Logic Programming, including, but not restricted to: # Algebraic and formal aspects # Implementation techniques for Multi-Valued Logic Programming Languages # Logic synthesis and Optimization # Circuit/ Device Implementation # Multi-Valued Model Checking # Switching functions # Machine Learning/ Data Mining # Biocomputing # Theorem Proving in Multi-Valued Logics # Fault Detection and diagnosis # Reliability # Information retrieval # Knowledge Representation/ Discovery # Automated Reasoning The MVLPA workshop will take place in Seattle, USA and will be collocated with the 2006 Federated Logic Conference (FLOC '06), http://research.microsoft.com/floc06/. The duration of the workshop is one day (21st August, 2006). Submission Information: ----------------------- We invite submissions in Springer-Verlag LNCS style. Submissions should be made at http://www.easychair.org/MVLPA2006/. The publication of the proceedings is currently under negotation. Please check the Web page regularly for updates. For any enquiries, please email mailto:axm011500 at utdallas.edu Important Dates: ----------------- Submission deadline: May 31, 2006 Notification to authors: June 10, 2006 Camera-ready copy due: June 30, 2006 From types-list at m-strasser.de Fri Apr 7 07:40:35 2006 From: types-list at m-strasser.de (types-list@m-strasser.de) Date: Fri, 7 Apr 2006 13:40:35 +0200 Subject: [TYPES/announce] Call For Participation - ETRICS 2006 Message-ID: <002901c65a38$16176c20$c710e684@tpc167> ========================== CALL FOR PARTICIPATION ========================== International Conference on Emerging Trends in Information and Communication Security /\ ||__^_ /\ ETRICS 2006 _/\_| \_||______________________________________________________________ June 6-9, 2006, FREIBURG, GERMANY http://www.etrics.org ---------------------------------------------------------------------------- ETRICS is a part of the Scientific Year 2006 ?Informatikjahr? ============================================================================ CONFERENCE SCOPE: Considering the progress of IT technologies, security is still one of the most vibrant and developing areas in computer science. Protecting information and services from malicious use is essential for their deployment and acceptance. While the main protection goals denoting confidentiality, integrity and availability are of a general nature, their relevance, realization and enforcement vary depending upon the underlying architectures, technologies and applications. Tomorrows information systems will accommodate highly dynamic applications and build infrastructures with lots of mobile, autonomic nodes and ad hoc, structureless relationships between them. Human interaction assumes new forms and has to be pre-planned and expressed by means of rules that are part of security policies. To enforce security rules, not only context data, but also personal data is needed. In highly dynamic systems, security and privacy become mutually exclusive. ETRICS solicits research contributions focusing on emerging trends in security and privacy. ---------------------------------------------------------------------------- SCIENTIFIC PROGRAM | http://www.etrics.org/program.php TOPICS - SOA and Security - Intrusion Detection - Vulnerability Analysis - Security Policies - Security Engineering - Cryptography - Secure Mobility - Trusted Computing - Security Protocols - Privacy KEYNOTE SPEAKERS | http://www.etrics.org/keynotes.php - By renowned industry and research leaders Best Practice Security Solutions | http://www.etrics.org/applications.php - What can you learn from industry? Exhibition | http://www.etrics.org/exhibition.php - Open everyday for ETRICS attendees and public Scientific Year 2006 ?Informatikjahr? - Thursday, June 8 - for ETRICS attendees and public WORKSHOPS | http://www.etrics.org/workshops - Long-lasting Security / Are there mechanisms? (A. Schmidt/ M. Kreutzer) - Security in Autonomous Systems / Is privacy mutually exclusive to security? (J. Peters/ R. Accorsi) - Privacy and Personalized Services / Is this a paradox? (S. Sackmann/ S. Spiekermann) - UC and RFID today - Breakthrough or still on hold? (J. Str?ker/ C. Fl?rkemeier) TUTORIALS | will take place on Monday, 5th June 2006 - Economics of Security and Privacy (S.Sackmann) - Protection of Communication Infrastructures (G. Sch?fer) - Cryptography and Security (W. Geiselmann) - Modelling and Analysis of Information Security (H. Mantel) ---------------------------------------------------------------------------- PROGRAM CHAIR: - G?nter M?ller, U of Freiburg, Germany (Chair) - Gerhard Schneider, U of Freiburg, Germany (Co-Chair) ---------------------------------------------------------------------------- IN COOPERATION WITH: - ACM Special Interest Group on Security, Audit and Control (SIGSAC) - IEEE Computer Society - DFG (German Research Foundation) - GI (German Society for Computer Science) - DaimlerChrysler - Deutsche Bank - Deutsche Telekom - DoCoMo Euro-Labs - Endress+Hauser - Novartis - Siemens - SAP ---------------------------------------------------------------------------- CONTACT: Albert-Ludwigs-Universitaet Freiburg, Telematics http://www.telematik.uni-freiburg.de Friedrichstr. 50 - D-79098 Freiburg, Germany E-mail: info at etrics.org Web: http://www.etrics.org From sweirich at cis.upenn.edu Sat Apr 8 16:50:38 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Sat, 08 Apr 2006 16:50:38 -0400 Subject: [TYPES/announce] AOSD 2007 Message-ID: <4438221E.80505@cis.upenn.edu> *** apologies for multiple copies *** AOSD 2007 CALL FOR RESEARCH PAPERS 6th International Conference on Aspect-Oriented Software Development http://www.aosd.net/2007/cfc/research.php AOSD is the premier conference on software modularity that crosscuts traditional abstraction boundaries. It welcomes papers on this topic from all relevant communities, including software engineering, programming languages, type systems, formal methods, as well as applications and experience reports. From urbanc at in.tum.de Tue Apr 11 08:34:05 2006 From: urbanc at in.tum.de (Christian Urban) Date: Tue, 11 Apr 2006 14:34:05 +0200 Subject: [TYPES/announce] Open position for a postdoctoral researcher at the TU Munich Message-ID: <20060411123405.259E0C0017@talisker.mathematik.uni-muenchen.de> Apologies for multiple postings. Please bring this announcement to the attention of anyone who might be interested. Postdoctoral researcher in the Nominal Methods Group at the TU Munich We have an open position for a postdoctoral researcher in the newly formed nominal methods group at the TU Munich. The research of our group is centered around the nominal datatype package. This package pushes the state of the art of formalising programming languages and solving POPLmark-like problems without having to resort to using de-Bruijn indices and higher-order abstract syntax. More information about the group can be found under http://www4.in.tum.de/~urbanc/Nominal/ The work we are interested in is both theoretical and practical, in the sense of implementing the tools we design. An ideal candidate for the position has therefore experience with formalisations and theorem provers as well as with functional programming. The research themes for the position are broad including developing novel features of Isabelle, advancing the nominal logic theory and conducting case-studies using our tools. We offer an active and friendly research environment in the Isabelle group in Munich. We have close ties with many international researchers working on the POPLmark Challenge. Munich is Germany's most attractive city - the Alps are very close and local beer and merrymaking are not frowned upon in Bavaria. The appointment is for two years initially with possible extensions. The position is open from September 2006, but slightly earlier or later starting dates can also be considered. Remuneration will be in accordance with the German Scale BAT-IIa for researchers. The salary depends on age and family circumstances; typical numbers are 2980 Euros per month for a single 25 year old rising to 3200 Euros per month for a single 30 year old. Informal inquiries about the position may be send to urbanc at in.tum.de. Send applications no later than 26th of May 2006. To apply send your application (preferably electronically) including a CV, publication list, contact details of 2 referees and a statement of research to urbanc at in.tum.de or Dr Christian Urban Institute for Computer Science I4 TU Munich, Boltzmannstr. 3, D-85748 Garching, Germany. From Bob.Coecke at comlab.ox.ac.uk Tue Apr 11 10:11:15 2006 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Tue, 11 Apr 2006 15:11:15 +0100 (BST) Subject: [TYPES/announce] Cats, Kets and Cloisters, Oxford University, July 17-23 (2006) Message-ID: This summer several workshops will take place July 17-23 (2006) at Oxford University: * NEW MODELS OF QUANTUM INFORMATICS * AXIOMATICS FOR QUANTUM MECHANICS * TENSORS KNOTS AND BRAIDS IN LOGIC AND PHYSICS * QUANTUM PROGRAMING LANGUAGES (QPL IV) The whole event will take place under the name ``CATS, KETS and CLOISTERS'': * http://se10.comlab.ox.ac.uk:8080/FOCS/CKCinOXFORD_en.html [SURVEYS/TUTORIALS:] Each workshop will include tutorial and/or survey talks. Preliminary informal contacts concerning have confirmed several people willing to provide these survey/tutorial lectures, including Samson Abramsky (Oxford), Richard Jozsa (Bristol) and Sam Lomonaco Jr (UMBC), among others. Topics under consideration include: measurement-based quantum computation, topological quantum computation, simulations of quantum computations, knots and braids in logic, quantum geometry and topology, categorical algebra for quantum mechanics, and semantics for quantum computing. [CALL FOR CONTRIBUTIONS:] The call for QPL IV is available at: * http://www.mathstat.dal.ca/~selinger/qpl2006/ We invite you to propose contributions for the three other workshops, either by submitting a short description, short abstract, extended abstract or full paper. These contributions will then be considered by the Program Committee: Jens Eisert (Imperial College, UK) Richard Jozsa (University of Bristol, UK) Samuel Lomonaco Jr. (UMBC, Maryland, US) Prakash Panangaden (McGill University, CA) Phil Scott (University of Ottawa, CA) Samson Abramsky (University of Oxford, UK) Bob Coecke (University of Oxford, UK) Relevant proposals for surveys/tutorials are also still welcome. Preference will be given to talks which are accessible beyond the boundaries of the distinct workshops. The three workshops should indeed be conceived as ``themes`` within a bigger event. Slots will be allocated to speakers to some extend on a first-come-first-serve base, subject to a quality check and ``sufficiently broad relevance`` check by the PC. Please send your contributions to: * bob.coecke at comlab.ox.ac.uk [POSTER SESSION:] Students and other young researchers in particular are encouraged to propose posters, which will be displayed in the workshop area throughout the whole event, and to which a session will be dedicated. [PRACTICALITIES:] The local organizing committee consists of: Samson Abramsky (Computing) Dan Browne (Materials) Bob Coecke (Computing) Hilary Priestley (Mathematics) Oxford is a pleasant place to visit during the summer, with many things to see (including London, only an hour by train), and a wealth of tourist attractions and beautiful country-side conveniently accessible. * http://www.oxfordcity.co.uk/ Oxford has a wide variety of places to stay, including both junior and senior College Accomodation, Hotels, Hostels, and Bed and Breakfasts (B&Bs) and Guest Houses. We would in particular recommend the B&Bs and Guest Houses since they tend to be much cheaper than hotels, and the British breakfast keeps you going for the whole day. For detailed information concerning accommodation in Oxford please consult: * http://se10.comlab.ox.ac.uk:8080/FOCS/Where_to_stay_en.html For traveling to Oxford please consult: * http://se10.comlab.ox.ac.uk:8080/FOCS/Where_to_go_en.html From ctm at cs.nott.ac.uk Tue Apr 11 13:01:05 2006 From: ctm at cs.nott.ac.uk (Conor McBride) Date: Tue, 11 Apr 2006 18:01:05 +0100 Subject: [TYPES/announce] Deadline Extension: Mathematically Structured Functional Programming Message-ID: <443BE0D1.4060406@cs.nott.ac.uk> [The following update is relevant to types-announce as types provide a key language in which to express the mathematical structure of functional programs. Moreover, the workshop is affiliated to the EU TYPES project.] +*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*-> DEADLINE-EXTENSION-DEADLINE-EXTENSION-DEADLINE-EXTENSION-DEADLINE-EXTENSION Workshop on Mathematically Structured Functional Programming http://cs.ioc.ee/mpc-amast06/msfp/ New deadlines: 17 April (abstracts); 21 April (papers) DEADLINE-EXTENSION-DEADLINE-EXTENSION-DEADLINE-EXTENSION-DEADLINE-EXTENSION +*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*->+*-> We're delighted to be able to extend the deadline for MSFP 2006. The Workshop on Mathematically Structured Functional Programming will be held in Kuressaare, Estonia, on 2 July 2006, with invited speakers Andrzej Filinski and John Power. MSFP 2006 is a satellite workshop of MPC 2006 and a "small workshop" of the TYPES project. MSFP is about organizing functional programs more effectively with the aid of mathematical structures from semantics and elsewhere. The proceedings of MSFP 2006 will be published in the Electronic Workshops in Computing (eWiC) series of the British Computer Society. After the workshop, the authors of the best papers will be invited to submit revised and expanded versions to a special issue of the Journal of Functional Programming from Cambridge University Press. We look forward to hearing from you Conor McBride Tarmo Uustalu From Stephan.Merz at loria.fr Wed Apr 12 13:15:55 2006 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Wed, 12 Apr 2006 19:15:55 +0200 Subject: [TYPES/announce] CFP: AVoCS 2006 Message-ID: <443D35CB.7040000@loria.fr> AVoCS 2006 : Sixth Intl. Workshop on Automated Verification of Critical Systems http://avocs06.loria.fr/ September 18-19, 2006 The aim of AVoCS 2006 is to contribute to the interaction and exchange of ideas among members of the international research community on tools and techniques for the verification of critical systems. The subject is to be interpreted broadly and inclusively. It covers all aspects of automated verification, including model checking, theorem proving, abstract interpretation, and refinement pertaining to various types of critical systems (safety-critical, security-critical, business-critical, performance-critical, ...). Contributions that describe combinations of different techniques, and industrial case studies are particularly welcome. The technical program will consist of invited and contributed talks and also allow for short presentations of ongoing work. The workshop will be relatively informal, with an emphasis on discussion. Previous AVoCS workshops were held in Oxford (2001), Birmingham (2002), Southampton (2003), London (2004), and Warwick (2005). Invited Speakers: * Byron Cook, Microsoft Research, Cambridge * Oded Maler, VERIMAG, Grenoble Preliminary proceedings will be published by LORIA and will be available at the workshop. These will include preliminary versions of regular papers and abstracts of short presentations. After the workshop, authors of regular papers will be asked to prepare a final version for proceedings in Electronic Notes in Theoretical Computer Science (Elsevier). Preparation of a special issue of a high-quality journal is under negotiation. Previous AVoCS workshops have given rise to special issues of Formal Aspects of Computing and of Software Tools for Technology Transfer. Important dates June 2 paper submission July 15 notification July 28 final version July 28 abstract submission for short presentations From beringer at tcs.ifi.lmu.de Thu Apr 13 05:40:55 2006 From: beringer at tcs.ifi.lmu.de (Lennart Beringer) Date: Thu, 13 Apr 2006 11:40:55 +0200 Subject: [TYPES/announce] 2 PhD/Research assistant positions at LMU Munich Message-ID: <443E1CA7.3090707@tcs.ifi.lmu.de> The Institute for Computer Science at the University of Munich offers 2 PhD studentships/research assistant positions with effect of June, 1st, 2006, or as soon as possible. Both positions are available in the DFG funded project ``InfoZert - specification, verification, and certification of information flow'', and are in the first instance for a duration of two years. The aim of the project is to develop a proof-carrying code architecture, where programs are equipped with formal proofs which certify the absence of flow of private data to public agents. We offer the opportunity to work on theoretically challenging and practically relevant topics in a young group in an international research environment, and collaboration with an industrial research group (Siemens). Candidates are expected to have earned a good first degree in computer science or a closely related subject. Applications by candidates with a strong background in - programming languages (type systems, program logics, compilers) - verification techniques (model checking, theorem proving) - security architectures are particularly welcome. One of the positions is intended for a PhD student, while the other one would also be suitable for a post-doctorate. Renumeration will be according to age and qualification, following the German public service payment scheme (BAT IIA). To apply please send as soon as possible, but no later than April 30, 2006, a letter of application to the address given below, including a CV, degree certificates, and contact details of at least one referee. The University of Munich is an equal opportunities employer and aims to increase the ratio of women in academia. We therefore particularly encourage female candidates to apply. Applications of handicapped candidates are treated with priority. For further enquiries, please contact Lennart Beringer, PhD or Dr.~Alexander Knapp, Institut fuer Informatik, Ludwig-Maximilians-Universitaet Muenchen, Oettingenstrasse 67, 80538 Muenchen, www.tcs.ifi.lmu.de/~beringer and www.pst.ifi.lmu.de/personen/knapp. From tarmo at cs.ioc.ee Thu Apr 13 06:30:10 2006 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Thu, 13 Apr 2006 13:30:10 +0300 Subject: [TYPES/announce] MPC/AMAST 2006 Call for Participation Message-ID: <20060413103801.84500BF08F@sool.cc.ioc.ee> [MPC and AMAST both have papers on functional programming and program semantics, including types.] NEWS: - Registration is now open. - Early registration is until 15 May 2006. Accommodation in the conference hotels is only guaranteed until this date. CALL FOR PARTICIPATION 8th International Conference on Mathematics of Program Construction MPC '06 11th International Conference on Algebraic Methodology and Software Technology AMAST '06 Kuressaare, Estonia, 2-8 July 2006 http://cs.ioc.ee/mpc-amast06/ Following on from the successful joint conference AMAST/MPC 2004 at Stirling, UK, 2004, the two biennial conferences on mathematical methods in software technology are colocating also in 2006. The joint event will take place in Kuressaare, Estonia, in early July. A perfect place and time to enjoy the Nordic white nights - at 58? N in the midsummer season. MPC will be held 3-5 July, followed by AMAST 5-8 July. Two satellite workshops of MPC, the 5th International Workshop on Contructive Methods for Parallel Programming, CMPP 2006, and Workshop on Mathematically Structured Functional Programming, MSFP 2006 will take place 2 July. Important dates Early registration: 15 May 2006 Late registration: 5 June 2006 MPC invited speakers Robin Cockett, University of Calgary Olivier Danvy, Aarhus Universitet Oege de Moor, University of Oxford AMAST invited speakers Ralph-Johan Back, ?bo Akademi University Lawrence S. Moss, Indiana University Till Mossakowski, Universit?t Bremen MPC and AMAST accepted paper lists appear on the conference website. PC lists appear on the conference website. Important dates * Early registration: 15 May 2006 * Late registration: 5 June 2006 Registration Registration is now open. Registration, accommodation and travel information are available on the conference website. To register, please fill out the online registration form. Booking of accommodation at Kuressaare is handled by the local organization. Accommodation in one of the conference hotels is only guaranteed until the early registration deadline of 15 May. After this date, we will do what we can, but Kuressaare is a small town and July is in the peak season. Venue Kuressaare (pop. 16000) is the main town on Saaremaa (?sel), the second-largest island of the Baltic Sea. Kuressaare is a charming seaside resort on the shores of the Gulf of Riga highly popular with Estonians as well as visitors to Estonia. The scientific sessions of MPC/AMAST 2006 will take place at Saaremaa Spa Hotel Meri, one among the several new spa hotels in the town. The social events will involve a number of sites, including the 14th-century episcopal castle and the impact craters of Kaali. Accommodation will be at Saaremaa Spa Hotels Meri and R??tli. To get to Kuressaare, one normally passes through Tallinn (pop. 402000), Estonia's capital city. Tallinn is famous for its picturesque medieval Old Town, inscribed on UNESCO's World Heritage List. From Tallinn, Kuressaare is easily reached by scheduled coach (incl. a ferry ride). We may arrange chartered coaches from Tallinn to Kuressaare and back both for MPC and AMAST, but this depends on the demand. There are also twice-daily flights to Kuressaare from Tallinn and twice-weekly direct flights from Helsinki and Stockholm. Local organizers MPC/AMAST 2006 is organized by Institute of Cybernetics, a research institute of Tallinn University of Technology. Contact email address: mpc06(at)cs.ioc.ee. From herbert at doc.ic.ac.uk Thu Apr 13 09:31:39 2006 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Thu, 13 Apr 2006 14:31:39 +0100 (BST) Subject: [TYPES/announce] CFP: TCS special issue on Quantitative Aspects of Programming Languages and Systems Message-ID: ------------------------------------------------------------------------- CALL FOR PAPERS - THEORETICAL COMPUTER SCIENCE (http://www.elsevier.nl/locate/tcs) Special Issue on Quantitative Aspects of Programming Languages and Systems (http://www.qapl06.di.unipi.it) ------------------------------------------------------------------------- We invite the submission of papers on Quantitative Aspects of Programming Languages and Systems for publication in a special issue of the Journal of Theoretical Computer Science (TCS). Papers are welcome which are revised versions of the works submitted to and presented at the QAPL 2006 Workshop, Vienna, Austria, April 1-2. We will also welcome submissions of papers not presented at QAPL 2006, provided they fall into the scope of the call and contain a clear and novel contribution to the field. SCOPE Quantitative aspects of computation are important and sometimes essential in characterising the behaviour and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, risk and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. This special issue will be devoted to work which discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, contributions should focus on * the design of probabilistic and real-time languages and the definition of semantical models for such languages; * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g. worst-case memory/stack/cache requirements); * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis); * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues. * the investigation of computational models and paradigms involving quantitative aspects, such as those arising in quantum computation, systems biology, bioinformatics, etc. ------------------------------------------------------------------------- TOPICS Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in Language design Performance analysis Language extension Program analysis Language expressiveness Verification Quantum Languages Protocol Analysis Hardware description languages Asynchronous hardware analysis Logic Refinement Semantics Automated reasoning Coordination models Model-checking Distributed systems Security Time-critical systems Safety Embedded systems Risk and Hazard Analysis System Biology Scheduling theory Information systems Testing ------------------------------------------------------------------------- SUBMISSION Papers should be 20-25 pages long, including appendices, and should be formatted according to Elsevier's elsart document style used for articles in the Journal of Theoretical Computer Science. Papers should be submitted electronically in .pdf format to qapl06 `at' di.unipi.it. Note that for the camera-ready versions of the papers the self-contained LaTeX sources of the paper will be needed, as well as a PostScript or PDF printable version. Important dates: * Paper submission: 14.7.2006 * Notification: 1.10.2006 Guest Editors: Alessandra Di Pierro University of Pisa dipierro `at' di.unipi.it Herbert Wiklicky Imperial College London herbert `at' doc.ic.ac.uk ------------------------------------------------------------------------- From freek at cs.ru.nl Thu Apr 13 15:46:01 2006 From: freek at cs.ru.nl (Freek Wiedijk) Date: Thu, 13 Apr 2006 21:46:01 +0200 Subject: [TYPES/announce] Logic Colloquium 2006: Call for contributed talks / Call for participation Message-ID: <20060413194601.GD9606@auriga.local> [The usual apologies for multiple copies apply: we are sending the announcement both to personal e-mail addresses and to mailing lists. Please distribute this e-mail to all interested people.] ------------- CALL for PARTICIPATION ------------------- | | | LOGIC COLLOQUIUM 2006 | | (ASL European Summer Meeting) | | July 27 -- August 2, 2006 | | | | Institute for Computing and Information Science | | Radboud University Nijmegen (The Netherlands) | | | ---------------------------------------------------------- The European summer meeting of the ASL in the year 2006 will be held in Nijmegen, the Netherlands: http://www.cs.ru.nl/lc2006/ Plenary invited speakers: ======================== Samson Abramsky (Oxford) Marat Arslanov (Kazan) Harvey Friedman (Ohio) Martin Goldstern (Vienna) Ehud Hrushovski (Jerusalem) Jochen Koenigsmann (Freiburg) Andy Lewis (Leeds) Antonio Montalban (Chicago) Erik Palmgren (Uppsala) Wolfram Pohlers (Muenster) Ernest Schimmerling (Pittsburgh) John Steel (Berkeley) William Tait (Chicago) Frank Wagner (Lyon) Tutorials by: ============ Rodney Downey (Wellington) Ieke Moerdijk (Utrecht) Boban Velickovic (Paris) Plenary Discussion: ================== On the occasion of the 100th birthday of the great logician Kurt Goedel, there will be a plenary discussion on "Goedel's Legacy", discussing his influence on set theory, proof theory and philosophical logic. Special sessions: ================ * Computability Theory Speakers: Noam Greenberg, Bjorn Kjos-Hanssen, Peter Hertling, Joe Miller, Jan Reimann, Frank Stephan * Computer Science Logic Speakers: Ulrich Berger, Venanzio Capretta, Martin Escardo John Harrison, Martin Hofmann, Andy Pitts * Model Theory Speakers: Raf Cluckers, Clifton Ealy, Piotr Kowalski, Assaf Hasson, Sonia L'Innocente, Tim Mellor * Proof Theory and Type Theory Speakers: Klaus Aehlig, Andrey Bovykin, Nicola Gambino, Joost Joosten, Thomas Studer, Henry Towsner * Set Theory Speakers: Natasha Dobrinen, John Krueger, Paul Larson, Jordi Lopez-Abad, Christian Rosendal, Martin Zeman REGISTRATION ============ You can now register by submitting the online registration form (or you can send it by fax). You can find the registration form and all other information related to the conference at: http://www.cs.ru.nl/lc2006/ The Organizing Committee From afelty at site.uottawa.ca Sat Apr 15 23:05:08 2006 From: afelty at site.uottawa.ca (Amy Felty) Date: Sat, 15 Apr 2006 23:05:08 -0400 (EDT) Subject: [TYPES/announce] PCC 2006 Call for Posters Message-ID: Call for Posters: PCC 2006 International Workshop on Proof-Carrying Code Seattle, USA, August 11, 2006 Affiliated with LOGIC IN COMPUTER SCIENCE (LICS 2006) and part of the Federated Logic Conference (FLoC 2006) IMPORTANT DATES Poster Submission 31 May 2006 Notification 11 June 2006 KEYNOTE SPEAKERS Andrew Appel (Princeton University) Ian Stark (University of Edinburgh) INVITED SPEAKERS Amal Ahmed (Harvard University) Gilles Barthe (INRIA Sophia-Antipolis) Ricardo Medel (Stevens Institute of Technology) Zhong Shao (Yale University) Dachuan Yu (DoCoMo Labs) WEB SITES: PCC 2006: http://www.cs.stevens.edu/~abc/PCC-Workshop.html LICS 2006: http://www.informatik.hu-berlin.de/lics/lics06/ FLoC 2006: http://research.microsoft.com/floc06/ DESCRIPTION: As pioneered by Necula and Lee, Proof-Carrying Code (PCC) is a technique that allows the safe execution of untrusted code. In the PCC framework the code receiver defines a safety policy that guarantees the safe behavior of programs and the code producer creates a proof that its code abides by that safety policy. Safety policies can give end users protection from a wide range of flaws in binary executables, including type errors, memory management errors, violations of resource bounds, access control, and information flow. PCC relies on the same formal methods as does program verification, but it has the significant advantage that safety properties are much easier to prove than program correctness. The producer's formal proof will not, in general, prove that the code yields a correct or meaningful result, so this technique cannot replace other methods of program assurance, but it guarantees that execution of the code can do no harm. The proofs can be mechanically checked by the host; the producer need not be trusted at all, since a valid proof is incontrovertible evidence of safety. PCC has sparked interest throughout the world, from academia to industry, and has motivated a large body of research in typed assembly languages, types in compilation, and formal verification of safety properties, stimulating new interest in formal methods and programming languages technology. The aim of the workshop is to bring together people from academia and industry and to promote the collaboration between those adapting PCC ideas to new industrial applications and experts in logic, type theory, programming languages, static analysis, and compilers. PROGRAM: The meeting will have two keynote speakers representing ongoing research in Europe and the USA, and invited speakers from academia and industry. There will also be an open poster session to offer the possibility to showcase a broader spectrum of research in the area. Although poster submission is open to everybody actively working in areas related to the meeting, we particularly encourage submissions by students. POSTER SUBMISSIONS: Posters provide a forum for presenting work in an informal and interactive setting. They are ideal for discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. The length of a poster submission is 2 pages in the Springer LNCS format. Accepted posters will be presented at a poster session during the workshop. An extended abstract (2 pages) of each accepted poster will be published in the informal proceedings. Posters must be submitted electronically to pcc2006 at cs.stevens.edu. PUBLICATION: There will be informal proceedings with extended abstracts of the presentations and posters published as a Stevens Institute of Technology Tech-Report available at the meeting. We invite speakers and registered participants to submit a paper to a post meeting special issue of MSCS. PROGRAM COMMITTEE: Adriana Compagnoni, Chair (Stevens Institute of Technology) Amy Felty (University of Ottawa) CONTACT: pcc2006 at cs.stevens.edu From femke at cs.vu.nl Tue Apr 18 04:10:55 2006 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Tue, 18 Apr 2006 10:10:55 +0200 (CEST) Subject: [TYPES/announce] HOR 2006: last call for abstracts Message-ID: ******************************** * * * HOR'06 CALL FOR ABSTRACTS * * * ******************************** 3rd International Workshop on Higher-Order Rewriting Tuesday August 15, 2006 Sheraton, Seattle, WA http://hor.pps.jussieu.fr/06 IMPORTANT DATES: May 8, 2006 : deadline electronic submission of paper May 29, 2006 : notification of acceptance of papers June 8, 2006 : deadline for final version of accepted papers The aim of HOR is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2006 will be part of FLoC 2006 in Seattle, USA. INVITED TALKS: Hugo Herbelin (INRIA Futurs, Paris) Eelco Visser (Universiteit Utrecht, The Netherlands) TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation. FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, higher-order abstract syntax PROGRAM/ORGANIZING COMMITTEE: Delia Kesner Universite Paris 7, France kesner at pps.jussieu.fr Femke van Raamsdonk Vrije Universiteit, The Netherlands femke at cs.vu.nl Mark-Oliver Stehr SRI International, USA stehr at csl.sri.com HOR'06 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/HOR06/ to submit or update your paper. PROCEEDINGS: The proceedings of HOR 2006 will be made available on the HOR 2006 web page and copies will be distributed to the participants at the workshop. LOCAL ARRANGEMENTS: Gopal Gupta University of Texas, Dallas, USA gupta at utdallas.edu Ashish Tiwari SRI International, USA tiwari at csl.sri.com From tkt at imm.dtu.dk Tue Apr 18 10:17:27 2006 From: tkt at imm.dtu.dk (Terkel K. Tolstrup) Date: Tue, 18 Apr 2006 16:17:27 +0200 Subject: [TYPES/announce] GLOBAN 2006 Summer School **Updated information** Message-ID: <200604181417.k3IEHwBN014069@smtpgw1.imm.dtu.dk> [Several lectures are on types and related topics. Apologies for multiple copies.] GLOBAN 2006 The Global Computing Approach to Analysis of Systems International Summer School at DTU, August 21-25, 2006 http://www.imm.dtu.dk/globan The one-week GLOBAN summer school will give doctoral students and other young researchers a comprehensive overview of contemporary techniques for analysis and verification of models of global computing systems characterized by concurrency, communication, heterogeneity and distribution. The school is organised by IMM/DTU in association with the SENSORIA project. LECTURERS Process Algebras and Concurrent Systems Rocco De Nicola, University of Florence, Italy Equality of processes: equivalences and proof techniques Davide Sangiorgi, University of Bologna, Italy Flow Logics Flemming Nielson, Technical University of Denmark Computing with relations using Horn clauses Helmut Seidl, Technical University of Munich, Germany Type systems Vasco Vasconcelos, University of Lisbon, Portugal Modal logics Lu?s Caires, New University of Lisbon, Portugal Model checking Kim Guldstrand Larsen, University of Aalborg, Denmark Stochastic modelling Stephen Gilmore, University of Edinburgh, Scotland IMPORTANT DATES 1 May 2006 Deadline for registration 17 May 2006 Notification to accepted applicants. 16 June 2006 Deadline for payment of registration fee 21 August 2006 Summer school starts 25 August 2006 Summer school ends PARTICIPANT FEES The participant fee will be 150 EUR. A grant scheme comprising grants for travel and/or living expenses as well as fee waivers will be available. See the website for details. VENUE The school will be held at the DTU campus in Lyngby near Copenhagen, Denmark. ORGANIZERS Hanne Riis Nielson Flemming Nielson Terkel K. Tolstrup Henning Makholm Eva Bing From ms at informatik.uni-kiel.de Wed Apr 19 02:55:55 2006 From: ms at informatik.uni-kiel.de (Martin Steffen) Date: 19 Apr 2006 08:55:55 +0200 Subject: [TYPES/announce] Call for Participation: DisCoTec 06 (Coordination06 + DAIS'06 + FMOODS'06) Message-ID: CALL FOR PARTICIPATION / Registration open +-----------------------------------------------------------------------+ | DisCoTec 06 | | | | http://www.discotec06.cs.unibo.it | | | | The federated conferences on | | | | Distributed Computing Techniques | | | | Bologna, Italy, 14-16 June 2006 (plus 1 day pre-conference workshops)| +-----------------------------------------------------------------------+ News: o Registration now open. o Early registration: until 31 May 2006. o for - further registration details (student reductions, presenter reductions, workshop fees...), - travel information and information about Bologna, see (under registration) http://www.discotec06.cs.unibo.it - for accepted papers of the conferences, the call for papers, and further information, see the web-site, as well. ============================================================== o Conferences: - Coordination'06: Eighth International Conference on Coordination Models and Languages - DAIS'06: Sixth IFIP International Conference on Distributed Applications and Interoperable Systems - FMOODS'06: Eighth IFIP International Conference on Formal Methods for Open Object-based Distributed Systems o 1 day pre-conferences workshops (13 June 2006) - MTCoord'06: 2nd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems - Security, Privacy, and Trust in Web Services. - CoOrg'06: 2nd International Workshop on Coordination and Organization ============================================================= **************************************************************** o Invited speakers: - Jan Bosch, Software and Application Technologies Lab. Nokia Research Center - Jos? Luiz Fiadeiro, Department of Computer Science University of Leicester - Chris Hankin, Department of Computing Imperial College **************************************************************** From Gregorio.Diaz at uclm.es Wed Apr 19 12:21:03 2006 From: Gregorio.Diaz at uclm.es (=?ISO-8859-1?Q?Gregorio_D=EDaz_Descalzo?=) Date: Wed, 19 Apr 2006 18:21:03 +0200 Subject: [TYPES/announce] 2nd TAROT Summer School on testing of software and communicating systems Message-ID: <4446636F.8050708@uclm.es> CALL FOR PARTICIPATION 2nd TAROT Summer School on testing of software and communicating systems TOLEDO, SPAIN June 26-30,2006 http://www.info-ab.uclm.es/tarot/ GENERAL INFORMATION The 2nd TAROT Summer School (TAROT'06) is going to be jointly organized by the Universidad Complutense de Madrid and the Universidad de Castilla La Mancha. The TAROT network is a research and training network in the framework of the Marie Curie program of the European Commission. This network was created to foster the mobility of students, faculty members and research scientists working in the field of testing of software and communication systems. To promote these goals, this Summer School will bring together lecturers, researchers, students and people from the industry across Europe for one week of presentations, discussions and getting to know each other. Specifically, the main goal of the TAROT Summer School is to give researchers and particularly Ph.D. students the opportunity to follow a number of tutorials and invited talks by key experts in the field. The TAROT Summer School is open to researchers from any institution in the world, working in the area of testing, both from academia and industry. The first TAROT Summer School was highly successful, attracting more than 50 students from all around the world. The school has developed into an important meeting place and forum for discussion for students, researchers and IT professionals interested in the interdisciplinary study of Testing. In addition to courses, the school will also have laboratory sessions and a social program. COURSE PROGRAM The full scientific program can be found at http://www.info-ab.uclm.es/tarot/ Tutorials are given by * David Lee. The Ohio State University. Department of Computer Science & Engineering. Ohio, USA. "Communications Protocol System Testing: Theory and Applications". * Kim Guldstrand Larsen. CISS, Aalborg University, Denmark. "Model-based Testing and Validation of Real-Time Systems". * Antonia Bertolino. Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo", CNR, Pisa, Italy. "The Why, What and How of (not) software testing". Invited Talks * Ana Cavalli. Department of Network Software. Institut National des Telecommunications. France. " Introduction to the TAROT network". * Odile Laurent. EYDT (Methods and tools) Airbus France. "Systems Validation and Verification at Airbus". * Manuel N??ez. Facultad de Inform?tica. Universidad Complutense de Madrid. Spain. "Logic and Testing". More talks will be announced. TRAVEL AND LOCAL INFORMATION By plane to Madrid-Barajas airport and then a 35-minute nonstop from Atocha railway station to Toledo. The historic city centre sits on a craggy rock, which is almost completely encircled by a wide meander of the Tagus river, called the Tajo in Spanish. The Roman historian Tito Livio mentioned the city of Toletum, a term whose origin would be Tollitum, meaning "raised aloft". The city's historic centre is one of the largest in Spain, and has more than 100 monuments. The scientific program of TAROT'06 will be held in the University of Castilla La Mancha, in the historic building "San Pedro Martir", Toledo. ACCOMMODATION Please go to http://www.info-ab.uclm.es/tarot/ to try options. REGISTRATION Please go to http://www.info-ab.uclm.es/tarot/ and complete the registration form. GRANTS The TAROT'06 grant scheme is presented at http://www.info-ab.uclm.es/tarot/. You need to fill and send the financial support form. SPECIAL EVENTS Social events include a welcome cocktail at Castilla-La Mancha Court, a visit to Almagro, and a farewell dinner banquet. The visit to Almagro includes a banquet dinner. CONTACT ADDRESS Please visit TAROT'06 Home Page http://www.info-ab.uclm.es/tarot/ for updated information concerning the scientific program, registration fees and procedures, grants, accommodation and other practical information. For further enquiries concerning TAROT'06, please contact the Organising Committee at , or write to Universidad Complutense de Madrid. Facultad de Inform?tica. Dpto. Sistemas Inform?ticos y Programaci?n. C/ Profesor Jos? Garc?a Santesmases, s/n. Ciudad Universitaria. 28040 - MADRID. Spain. From koba at kb.ecei.tohoku.ac.jp Thu Apr 20 07:09:21 2006 From: koba at kb.ecei.tohoku.ac.jp (koba@kb.ecei.tohoku.ac.jp) Date: Thu, 20 Apr 2006 20:09:21 +0900 (JST) Subject: [TYPES/announce] 2nd CFP: APLAS 2006 (Fourth Asian Symposium on Programming Languages and Systems) Message-ID: <20060420.200921.03308842.koba@kb.ecei.tohoku.ac.jp> Dear types subscribes, Attached below please find the call for papers for APLAS 2006. The main change from the previous posting is: * Submission procedure has been divided into two phases: Abstract submission: June 2, 2006 Paper submission: June 6, 2006 The submisssion page is now open. Naoki Kobayashi APLAS 2006 Program Chair Department of Computer and Mathematical Sciences Graduate School of Information Sciences Tohoku University 6-3-9 Aoba, Aramaki, Aoba-ku, Sendai-shi, Miyagi 980-8579, Japan e-mail:koba at ecei.tohoku.ac.jp ------------------------- CALL FOR PAPERS The Fourth ASIAN Symposium on Programming Languages and Systems (APLAS 2006) Sydney, Australia, November 8-10, 2006 http://www.kb.ecei.tohoku.ac.jp/aplas2006/ APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past formal APLAS symposiums were successfully held in Tsukuba (2005, Japan), Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, and 3780. TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of language systems are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair (koba at ecei.tohoku.ac.jp) prior to submission. GENERAL CO-CHAIRS Manuel Chakravarty (University of New South Wales, Australia) Gabriele Keller (University of New South Wales, Australia) PROGRAM CHAIR Naoki Kobayashi (Tohoku University) PROGRAM COMMITTEE Kung Chen (National Chengchi University, Taiwan) Wei-Ngan Chin (National University of Singapore, Singapore) Patrick Cousot (ENS, France) Masahito Hasegawa (Kyoto University, Japan) Jifeng He (United Nations University, Macau) Haruo Hosoya (University of Tokyo, Japan) Bo Huang (Intel China Software Center, China) Naoki Kobayashi (chair) (Tohoku University, Japan) Oege de Moor (Oxford University, UK) George Necula (University of California at Berkeley, USA) Martin Odersky (EPFL, Switzerland) Tamiya Onodera (IBM Research, Tokyo Research Laboratory, Japan) Yunheung Paek (Seoul National University, Korea) Sriram Rajamani (Microsoft Research, USA) Andrei Sabelfeld (Chalmers University of Technology, Sweden) Zhong Shao (Yale University, USA) Harald Sondergaard (University of Melbourne, Australia) Nobuko Yoshida (Imperial College London, UK) SUBMISSIONS INFORMATION Papers should be submitted electronically online via the conference submission webpage. 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. Submitted papers must be unpublished and not submitted for publication elsewhere. The proceedings of the symposium is planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. IMPORTANT DATES Abstract Submission: June 2, 2006 Paper Submission: June 6, 2006 Author notification: August 5, 2006 Camera Ready: August 25, 2006 Conference: November 8-10, 2006 From jv at cs.purdue.edu Sun Apr 23 14:47:22 2006 From: jv at cs.purdue.edu (Jan Vitek) Date: Sun, 23 Apr 2006 20:47:22 +0200 Subject: [TYPES/announce] Summer School on Emerging Trends in Concurrency, Bertinoro, Italy Message-ID: <646A584D-A3A4-4F43-BFB7-0E076E2021BA@cs.purdue.edu> This is a repost of the announcement for TiC. The school is filling up quickly. The remaining spots will be given on a first come first served basis. We still have a few travel grants. -jv --- --- --- Speakers: Herlihy, Jagannathan, Qadeer, Lea, Sangiorgi, Saraswat, Sewell, Trystram, Yoshida. Dates: July 24-29, 2006 Location: Bertinoro, Italy WWW: http://www.cs.purdue.edu/homes/jv/events/TiC06 Call for Participation First International Summer School on Emerging Trends in Concurrency TiC'06 Bertinoro, Italy, July 24-29, 2006 Concurrency is a pervasive and essential characteristic of modern computer systems. Whether it is the design of new hyperthreading techniques in computer architectures, specification of non-blocking data structures and algorithms, implementation of scalable computer farms for handling massive data sets, or the design of a robust software architecture for distributed business processes, a deep understanding of mechanisms and foundations for expressing and controlling concurrency is required. The goal of the school is to expose graduate students and young researchers to new ideas in concurrent programming from experts in academia and industry. The school provides a unique opportunity for students to have engaging discussions on cutting-edge research with instructors in a focused environment. The school covers one week and alternates monograph courses of 4/6 hours and short courses of 2/3 hours. We also encourage presentations by participants to discuss their current research, and to receive feedback from the audience and instructors. Speakers: * Maurice Herlihy (Brown) * Suresh Jagannathan (Purdue) * Shaz Qadeer (Microsoft Research) * Doug Lea (SUNY Oswego) * Davide Sangiorgi (University of Bologna) * Vijay Saraswat (IBM Research) * Peter Sewell (Cambridge) * Denis Trystram (IMAG) * Nobuko Yoshida (Imperial College) Venue: The school is organised at the Centro Residenziale Universitario of the University of Bologna, situated in Bertinoro, a small village on a scenic hill with a wonderful panorama, in between Forli and Cesena (about 50 miles south-east of Bologna, 15 miles to the Adriatic sea). Organizers: Nadia Busi (University of Bologna), Ananth Grama (Purdue), Suresh Jagannathan (Purdue), Davide Sangiorgi (University of Bologna), Jan Vitek (Purdue) Registration: Information about registration is available from the school's web page (http://www.cs.purdue.edu/homes/jv/events/TiC06). A limited amount of grants will be provided to cover part of the fees for young researchers and for prospective participants. From U.Berger at swansea.ac.uk Tue Apr 25 10:34:28 2006 From: U.Berger at swansea.ac.uk (Ulrich Berger) Date: Tue, 25 Apr 2006 15:34:28 +0100 Subject: [TYPES/announce] Computability in Europe 2006 - Call for Participation Message-ID: <444E3374.4050806@swansea.ac.uk> [Apologies for multiple copies] CiE 2006 Computability in Europe 2006 : Logical Approaches to Computational Barriers 30 June - 5 July 2006 Swansea University, United Kingdom http://www.cs.swansea.ac.uk/cie06/ cie06 at swansea.ac.uk CALL FOR PARTICIPATION Important deadlines: Informal Presentations 30 April, 2006 Early registration 15 May, 2006 * Some grants for UK students are still available * CiE 2006 is the second of a new conference series which serves as an interdisciplinary forum for researchers into all aspects of computability and the foundations of computer science. The scientific programme consists of two three-hour tutorials, nine plenary talks, six special sessions with four talks each, and over sixty contributed talks. For more details on the programme see the full list of talks below, or visit http://www.cs.swansea.ac.uk/cie06/ The conference venue and accommodation will be on the campus of Swansea University. Swansea lies at the southcoast of Wales, next to the beautiful Gower Peninsula. To register, submit an informal presentations, apply for a UK student grant, or to obtain any other information visit http://www.cs.swansea.ac.uk/cie06/ Contact: cie06 at swansea.ac.uk ********* PROGRAMME ********* TUTORIALS Samuel R. Buss (San Diego, CA) Proof Complexity and computational hardness Julia Kempe (Paris) Quantum Algorithms PLENARY TALKS Jan Bergstra (Amsterdam) Elementary Algebraic Specifications of the Rational Function Field Luca Cardelli (Microsoft Research) Biological systems as reactive systems Martin Davis (New York, NY) The Church-Turing thesis: consensus and opposition John W Dawson (York, PA) Goedel and the origins of computer science Jan Krajicek (Prague) Forcing with random variables and proof complexity Elvira Mayordomo Camara (Zaragoza) The fractal dimension of complexity classes Istvan Nemeti (Budapest) Can general relativistic computers break the Turing barrier? Helmut Schwichtenberg (Munich) Program extraction from proofs in constructive analysis Andreas Weiermann (Utrecht) Phase transition thresholds in recursion theory SPECIAL SESSIONS PROOFS AND COMPUTATION organised by Alessandra Carbone and Thomas Strahm Kai Bruennler (Bern) Deep inference Roy Dyckhoff (St Andrews) LJQ: a focused calculus for intuitionistic logic Thomas Ehrhard (Marseille) About the Krivine machine and the Taylor expansion of lambda-terms Georges Gonthier (Microsoft Research) Using reflection to prove the Four Colour Theorem COMPUTABLE ANALYSIS organised by Peter Hertling and Dirk Pattinson Margarita Korovina (Aarhus) Complexity of bisimulations on Pfaffian hybrid systems Paulo Oliva (London) Computational interpretations of proofs in classical analysis Matthias Schroeder (Edinburgh) Admissible representations in computable analysis Xizhong Zheng (Cottbus) Computability theory of real numbers CHALLENGES IN COMPLEXITY organised by Klaus Meer and Jacobo Toran Johannes Koebler (Berlin) Complexity of graph isomorphism for restricted graph classes Sophie Laplante (Paris) Lower bounds using Kolmogorov complexity Janos A. Makowsky (Haifa) Computable graph invariants Mihai Prunescu (Freiburg) The fast elimination of quantifiers and some structures with P=NP according to the unit-cost model of computation FOUNDATIONS OF PROGRAMMING organised by Inge Bethke and Martin Escardo Erika Abraham (Freiburg) Fully abstract semantics of concurrent class-based languages Roland Backhouse (Nottingham) Datatype-Generic Reasoning James Leifer (INRIA, Le Chesnay) Transactional atomicity in programming languages Alban Ponse (Amsterdam) Program and thread algebra MATHEMATICAL MODELS OF COMPUTERS AND HYPERCOMPUTERS organised by Joel D Hamkins and Martin Ziegler Jean-Charles Delvenne (Louvain-la-Neuve) Turing-universal dynamical systems Benedikt Loewe (Amsterdam) Infinite time complexity theory Klaus Meer (Odense) Optimization and approximation problems related to polynomial system solving Philip Welch (Bristol) Admissibility and infinite time computation GOEDEL CENTENARY: HIS LEGACY FOR COMPUTABILITY organised by Matthias Baaz and John W Dawson Arnon Avron (Tel Aviv) From constructibility and absoluteness to computability and safety Torkel Franzen (Lulea) What does the incompleteness theorem add to the unsolvability of the halting problem? Wilfried Sieg (Pittsburgh, PA) Goedel's Conflicting approaches to effective calculability Richard Zach (Calgary, AB) Kurt Goedel, logic, and theoretical computer science CONTRIBUTED TALKS Hajnal Andreka (Budapest) Relativity theory for logicians and new computing paradigms Marat Arslanov (Kazan) Generalized tabular reducibilities in infinite levels of Ershov hierarchy Josef Berger (Munich) The logical strength of the uniform continuity theorem Jens Blanck (Swansea) Note on Reducibility Between Domain Representations Paul Brodhead, Douglas Cenzer and Seyyed Dashti (Florida) Random Closed Sets Riccardo Bruni (Florence) Goedel, Turing, the Undecidability Results and the Nature of Human Mind Douglas Cenzer (Florida) and Zia Uddin (Lock Haven, PA) Logspace Complexity of Functions and Structures Alexey Chernov (Manno) and Juergen Schmidhuber (Munich) Prefix-like Complexities and Computability in the Limit Jose Felix Costa (Lisbon) and Jerzy Mycka (Lublin) The conjecture P =/= NP given by some analytic condition Paolo Cotogno (Brescia) Decidability of arithmetic through hypercomputation: a logical objection Fredrik Dahlgren (Uppsala) Partial Continuous Functions and Admissible Domain Representations Ugo Dal Lago and Simona Martini (Bologna) An Invariant Cost Model for the Lambda Calculus Stefan Dantchev (Durham) On the complexity of the Sperner Lemma Gregorio de Miguel Casado and Juan Manuel Garcia Chamizo (Alicante) The Role of Algebraic Models and TTE in Special Purpose Processor Design Paulin Jacobe de Naurois (Paris) A Measure of Space for Computing over the Reals Pavel Demenkov (Novosibirsk) Computer simulation replacements aminoacids in proteins David Doty (Iowa) Every Sequence is Decompressible from a Random One Jerome Durand-Lose (Orleans) Reversible conservative rational abstract geometrical computation is Turing-universal Birgit Elbl (Munich) On generalising predicate abstraction Willem Fouche (Pretoria) Brownian motion and Kolmogorov complexity Gassner Christine (Greifswald) A Structure with P = NP Alexander Gavryushkin (Novosibirsk) On Complexity of Ehrenfeucht Theories with Computable Model Annelies Gerber (Paris) Some mathematical properties of input resolution refutations with non-tautological resolvents Philipp Gerhardy (Darmstadt) Functional interpretation and modified realizability interpretation of the double-negation shift Guido Gherardi (Siena) An Analysis of the Lemmas of Urysohn and Urysohn-Tietze according to effective Borel measurability Lev Gordeev (Tuebingen) Toward combinatorial proof of P < NP. Basic approach Neal Harman (Swansea) Models of Timing Abstraction in Simultaneous Multithreaded and Multi-Core Processors Charles Milton Harris (Leeds) Enumeration reducibility with polynomial time bounds Eiju Hirowatari (Kitakyushu), Kouichi Hirata (Kyushu) and Tetsuhiro Miyahara (Hiroshima) Finite Prediction of Recursive Real-Valued Functions Tie Hou (Swansea) Coinductive Proofs for Basic Real Computation Iskander Kalimullin (Kazan, Russia) The Dyment reducibility on the algebraic structures and on the families of subsets of omega Dazhou Kang, Baowen Xu, Jianjiang Lu and Yanhui Li (Southeast University, China) Reasoning within the Extended Fuzzy Description Logics with Restricted Boxes Peter Koepke (Bonn) Infinite time register machines Peter Koepke (Bonn) and Ryan Siders (Helsinki) Computing the Recursive Truth Predicate on Ordinal Register Machines Ekaterina Komendantskaya and Anthony Seda (Cork) Bilattice-based Logic Programs: Automated Reasoning and Neural Computation Shankara Narayanan Krishna (Bombay) Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes Lars Kristiansen (Oslo) Complexity-Theoretic Hierarchies Oleg Kudinov and Victor Selivanov (Novosibirsk) Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests Andrew Edwin Marcus Lewis (Siena) The jump classes of minimal covers Chung-Chih Li (Beaumont, TX) Clocking Type-2 Computation in The Unit Cost Model John Longley (Edinburgh) On the calculating power of Laplace's demon Maria Lopez-Valdes (Zaragoza) Scaled Dimension of Individual Strings Barnaby Martin and Florent Madelaine (Durham) Towards a Trichotomy for Quantified H-Coloring Klaus Meer (Odense) and Martin Ziegler (Paderborn) Uncomputability below the Real Halting Problem Greg Michaelson (Edinburgh) and Paul Cockshott (Glasgow) Constraints on hypercomputation Philippe Moser (Maria de Luna) Martingale Families and Dimension in P Benedek Nagy and Sandor Valyi (Debrecen) Solving a PSPACE-complete problem by a linear interval-valued computation Keng Meng Ng (Wellington), Frank Stephan (Singapore) and Gouhua Wu (Singapore) Degrees of Weakly Compact Reals Peter Peshev and Dimiter Skordev (Sofia) A Subrecursive Refinement of the Fundamental Theorem of Algebra Petrus Hendrik Potgieter (Pretoria) Hypercomputing the Mandelbrot Set? Vadim Puzarenko (Novosibirsk) Definability of the Field of Reals in Admissible Sets Rose Hafsah Abdul Rauf (Swansea) Integrating Functional Programming Into C++: Implementation and Verification Mihai Prunesco (Bucharest/Freiburg) Fast quantifier elimination means P = NP Peter Schuster and Julia Zappe (Munich) Do Noetherian modules have Noetherian basis functions? Anton Setzer (Swansea) Partial Recursive Functions in Martin-Loef Type Theory Merlijn Sevenster (Amsterdam) and Tero Tulenheimo (Helsinki) Partially ordered connectives and Sigma-1-1 on finite models Alan Skelley (Prague) Third-Order Computation and Bounded Arithmetic Boris Solon (Ivanovo) Co-total enumeration degrees Ivan Soskov (Sofia) Extensions of the semi-lattice of the enumeration degrees Alexandra Soskova (Sofia) Relativized Degree Spectra Alexey Stukachev (Novosibirsk) On inner constructivizability of admissible sets Andreas Weiermann and Arnoud den Boer (Utrecht) A sharp phase transition threshold for elementary descent recursive functions Albert Ziegler (Munich) Some Reflections on the Principle of Image Collection Jeffery Zucker (McMaster) Primitive Recursive Selection Functions over Abstract Algebras PROGRAMME COMMITTEE Samson Abramsky (Oxford), Benedikt Loewe (Amsterdam), Klaus Ambos-Spies (Heidelberg), Yuri Matiyasevich (St. Petersburg), Arnold Beckmann (co-chair), Dag Normann (Oslo), Ulrich Berger (Swansea), Giovanni Sambin (Padova), Olivier Bournez (Nancy), Uwe Schoening (Ulm), Barry Cooper (Leeds), Andrea Sorbi (Siena), Laura Crosilla (Florence), Ivan Soskov (Sofia), Costas Dimitracopoulos (Athens), Leen Torenvliet (Amsterdam), Abbas Edalat (London), John Tucker (Swansea, co-chair), Fernando Ferreira (Lisbon), Peter van Emde Boas (Amsterdam), Ricard Gavalda (Barcelona), Klaus Weihrauch (Hagen), Giuseppe Longo (Paris) ORGANISERS Arnold Beckmann, Ulrich Berger, S Barry Cooper, Phil Grant, Oliver Kullmann, Benedikt Loewe, Faron Moller, Monika Seisenberger, Anton Setzer, John V Tucker CiE 2006 received financial support by the Department of Computer Science at Swansea, the British Logic Colloquium (BLC), the British Engineering and Physical Sciences Research Council (EPSRC), the Kurt Goedel Society (KGS) in Vienna, the London Mathematical Society (LMS), the Welsh Development Agency (WDA) and IT Wales. Other sponsors are the Association for Symbolic Logic (ASL), the British Computer Society (BCS) and the European Association for Theoretical Computer Science (EATCS). From pasalic at cs.rice.edu Wed Apr 26 15:27:29 2006 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Wed, 26 Apr 2006 14:27:29 -0500 Subject: [TYPES/announce] GPCE 2006 Deadline Extension Message-ID: Apologies for repeated posts. The GPCE 2006 deadline for technical paper submission has been extended to May 14. GPCE provides a venue for researchers and practitioners interested in foundational techniques for enhancing the productivity, quality and time-to-marked in software development that stems from deploying standard componentry and automating program generation. In addition to exploring cutting-edge techniques for developing generative component-based software, our goal is to foster further cross- fertilization between software engineering research community and the programming languages community. Changes: - There will be no pre-submission - Submission deadline: May 14, 2006, 23:59 Apia time (previously May 5) - Notification: June 28, 2005 For more information, check: http://www.program-transformation.org/GPCE06/ From icalp06 at dsi.unive.it Wed Apr 26 18:14:36 2006 From: icalp06 at dsi.unive.it (ICALP 2006) Date: Thu, 27 Apr 2006 00:14:36 +0200 Subject: [TYPES/announce] ICALP 2006 - call for participation Message-ID: <444FF0CC.7060706@dsi.unive.it> *** Apologies for multiple copies *** _______________________________________________________________________ 33rd International Colloquium on Automata, Languages and Programming ICALP'06 - CALL FOR PARTICIPATION *** REGISTRATION OPEN *** Conference July 9-16, 2006, Venice, Italy http://icalp06.dsi.unive.it ______________________________________________________________________ The 33rd International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science EATCS will take place from the 9th to the 16th of July 2006 in Venice, Italy. Visit the Conference web site for details about the scientific program, the social events and information and instructions for registering to the conference. ACCOMMODATIONS ************** We have reserved a number of rooms in the S. Servolo Lodgings located on the S. Servolo Island, and the Junghans Lodgings on the Giudecca Island close to the Conference venue. In you are interested in this kind of accommodation, please book soon as the rooms are filling up quickly. IMPORTANT DATES *************** * Early Registration: May 31, 2006 * Conference: July 9 - 16, 2006. INVITED SPEAKERS ****************** * Cynthia Dwork (Microsoft Research, Silicon Valley, USA) * Alon Noga (Tel Aviv University, Israel) * Prakash Panangaden (McGill University, Canana) * Simon Peyton Jones (Microsoft Research, Cambridge, UK) SCIENTIFIC PROGRAM ****************** Full details availabel at: http://icalp06.dsi.unive.it/ From Peter.Sewell at cl.cam.ac.uk Thu Apr 27 09:55:15 2006 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Thu, 27 Apr 2006 14:55:15 +0100 Subject: [TYPES/announce] Type-safe marshalling for OCaml Message-ID: Dear all, We are pleased to announce a preliminary release of HashCaml, an extension of the OCaml bytecode compiler with support for type-safe marshalling and related naming features. This makes the core type-safe and abstraction-safe marshalling constructs from the Acute prototype language available within OCaml. Some OCaml features are not supported (including marshalling of polymorphic variants and objects), and this is very much an alpha release - there may well be serious problems in the implementation. Nonetheless, it should be usable for nontrivial experiments, and any feedback and comment would be most welcome. Further details, including a draft paper, the README, examples, and the full distribution can be found at http://www.cl.cam.ac.uk/users/pes20/hashcaml Peter for the HashCaml team: John Billings, Peter Sewell, Mark Shinwell, Rok Strnisa From amomigl1 at inf.ed.ac.uk Fri Apr 28 12:06:19 2006 From: amomigl1 at inf.ed.ac.uk (Alberto Momigliano) Date: Fri, 28 Apr 2006 17:06:19 +0100 Subject: [TYPES/announce] LAST CFP: LFMTP 2006 (a.k.a. LFM + MERLIN) Message-ID: <44523D7B.1060002@inf.ed.ac.uk> Please note change in important dates! ----------------------------------------------------------------------- International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'06) http://www.cs.mcgill.ca/~bpientka/lfmtp06/index.html Affiliated with LICS and IJCAR at FLOC'06 Seattle, Washington, 16 August, 2006. LAST CALL FOR PAPERS Important Dates: Abstract submission deadline: 15 May 2006 Paper Submission deadline: 22 May 2006 Author Notification: 21 June 2006 Final Version: 5 July 2006 ----------------------------------------------------------------------- LFMTP'06 merges the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN). 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 one hand and their applications, for example, to proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks. The broad subject areas of LFMTP'06 are: * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of programming languages and calculi. Papers focusing on experiences with encoding programming languages theory and instances of proof-carrying code or proof-carrying authorization 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 * sub-structural frameworks * semantic foundations * methods for reasoning about logics * case studies. Invited Speaker: Gordon Plotkin (University of Edinburgh). Program Committee: Andrew Appel Princeton University Thierry Coquand Goteborg University Martin Hofmann LMU Munich Furio Honsell University of Udine Dale Miller Inria Futurs Brigitte Pientka McGill University Andrew Pitts Cambridge University Kevin Watkins Carnegie Mellon University Paper Submissions. Three categories of papers are solicited: * Category A: Detailed and technical accounts of new research: up to fifteen pages including bibliography. * Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers: up to eight pages including bibliography. * Category C: System descriptions, presenting an implemented tool and its novel features: up to six pages. A demonstration is expected to accompany the presentation. Submission is electronic in postscript or PDF format. Submitted papers must conform to the ENTCS style, preferably using LaTeX2e. For further information and submission instructions, see the LFMTP web page: http://www.cs.mcgill.ca/~bpientka/lfmtp06/index.html Proceedings are to be published as a volume in the Electronic Notes in Theoretical Computer Science (ENTCS) series and will be available to participants at the workshop. Organizers: Brigitte Pientka Alberto Momigliano bpientka at cs.mcgill.ca amomigl1 at inf.ed.ac.uk School of Computer Science LFCS, School of Informatics McGill University University of Edinburgh From zijiang.yang at wmich.edu Fri Apr 28 21:27:51 2006 From: zijiang.yang at wmich.edu (Zijiang (James) Yang) Date: Fri, 28 Apr 2006 21:27:51 -0400 Subject: [TYPES/announce] CFP: SVV2006 Message-ID: <4452C117.9050905@wmich.edu> SVV'06: 4th Workshop on Software Verification and Validation August 21, 2006, Seattle, USA http://www.comp.nus.edu.sg/~abhik/svv06/ In Conjunction with Federated Logic Conferences (FLoC) 2006 EXTENDED PAPER SUBMISSION DEADLINE: May 12, 2006 Goal of the Workshop ==================== Software is playing an important role in economy, government, and military. Since software is often deployed in safety critical applications, correctness and reliability have become issues of utmost importance. Techniques for verification and validation traditionally fall into three main categories. The first category involves informal methods such as software testing and monitoring. The second involves formal verification, i.e., model checking and theorem proving. The third is abstract interpretation and static program analysis techniques. The goal of this workshop is to promote discussion on novel combinations of these methodologies, as well as study the individual contribution of each of these methodologies in verifying software. An example of a combined verification methodology is the recent research direction that combines abstraction (of infinite-state programs into finite-state ones) with model checking (of finite-state systems). There is a growing conviction in the research community that such hybrid methodologies are imperative for the process of analyzing full-fledged software systems. This workshop will study combination of analysis methodologies for verification of software. This research is very important and timely since . Software is being increasingly used to control embedded systems which are often safety critical (such as automobile parts). . There is renewed promise in program verification in the recent years due to (a) progress in generating models from code, and (b) combination of model checking with other analysis techniques such as abstract interpretation. Topics Covered ============== The workshop will focus on theoretical techniques, practical methods as well as case studies for verification of conventional and embedded software systems. In particular, we welcome papers which describe combinations of formal and informal reasoning, as well as formal verification and program analysis techniques. Tool papers and case studies, which report on advances in verifying large scale programs in standard languages are particularly sought. The list of topics include, but are not restricted to: . Tools, environments and case studies for large scale software verification . Static analysis/Abstract interpretation/Program transformations for verification . Use of model checking and deductive techniques for software verification . Role of declarative programming languages (such as Prolog) for infinite state software verification. . Techniques to validate system software (such as compilers) as well as assembly code/Java bytecode . Proof techniques for verifying specific classes of software (such as object-oriented programs) . Integrating testing and run-time monitoring with formal techniques . Validation of UML diagrams, and/or requirement specifications . Software certification and proof carrying code . Integration of formal verification into software development projects Submissions Information ======================= . Regular submissions should be no more than 15 pages. Short papers (upto 5 pages) describing initial ideas are also welcome. All submitted papers should be in PS or PDF. Please avoid using zip, gzip, compress, tar etc. . Proceedings of the workshop will be published by Computing Research Repository (CoRR). . The deadlines are as follows. . Submission deadline: May 12, 2006 . Notification of Acceptance: June 16, 2006 . Final Version submission: June 26, 2006 Program Committee ================== . Rajeev Alur, Univ. of Penn. (USA) . Tevfik Bultan, Univ. of California Santa Barbara (USA) . Sagar Chaki, Software Engg Institute CMU (USA) . Maurizio Gabbrielli, Univ. of Bologna (Italy) . Aarti Gupta, NEC Labs (USA) . Gopal Gupta, Univ of Texas Dallas (USA) . Shengchao Qin, Univ. of Durham (UK) . C.R. Ramakrishnan, Univ. of Stony Brook (USA) . R.E. Kurt Stirewalt, Michigan State Univ. (USA) Invited Speakers ================ . Byron Cook, Microsoft Research Organizers ========== . Abhik Roychoudhury, National University of Singapore, Singapore. Email: abhik at comp.nus.edu.sg . Zijiang Yang, Western Michigan University, USA. Email: zijiang.yang at wmich.edu If you have any queries about the workshop, please send e-mail to either of us From jno at di.uminho.pt Tue May 2 04:49:33 2006 From: jno at di.uminho.pt (J.N. Oliveira) Date: Tue, 2 May 2006 09:49:33 +0100 Subject: [TYPES/announce] Call for papers: FM-Ed'06 - Formal Methods in the Teaching Lab Message-ID: <20060502094933.B17829@stella.sidereus.pt> Call for Papers -- Submission deadline: June 9, 2006 FORMAL METHODS IN THE TEACHING LAB Examples, Cases, Assignments and Projects Enhancing Formal Methods Education http://www.di.uminho.pt/FME-SoE/FMEd06/ A Workshop at the Formal Methods 2006 Symposium Workshop: Saturday, August 26, 2006 Symposium: August 21 - 27, 2006 McMaster University, Hamilton, Ontario, Canada I. ORGANIZATION This workshop is organized by the Formal Methods Europe Subgroup on Education. Dines Bj?rner (JAIST, Japan) Eerke Boiten (University of Kent, UK) Raymond Boute (Universiteit Gent, Belgium) Andrew Butterfield (Trinity College, Dublin) John Fitzgerald (University of Newcastle upon Tyne, UK) Randolph Johnson Steve King (University of York, UK) Peter Lucas Michael Mac an Airchinnigh (Trinity College, Dublin) Dino Mandrioli (Politecnico di Milano, Italy) Andrew Martin (Oxford University, UK) Jos? Oliveira (Universidade do Minho, Portugal) -- Convenor Kees Pronk (Technische Universiteit Delft, NL) Sim?o Melo de Sousa (Universidade da Beira Interior, Portugal) Wolfgang Reisig (Humboldt-Universit?t zu Berlin, Germany) Workshop Co-Chairs Raymond Boute Formal Methods Group, Department of Information Technology (INTEC), Ghent University, Ghent (Belgium) E-mail: boute at intec.UGent.be Jos? Oliveira Departamento de Informatica Universidade do Minho, Braga, Portugal E-mail: jno at di.uminho.pt II. CONCEPT OF THE WORKSHOP Motivation Quoting Dines Dines Bj?rner: "Formal Methods Education is currently facing a `trichotomy': - On the one hand, industries dealing with the design of complex and critical systems have an increasing need for methods that provide a certain degree of confidence in the result, and are often looking for external assistance in the area of formal methods from consulting companies and academia. - On the other hand, a growing number of university staff enjoys the intellectual challenge of research in this area and teaching formal techniques to students. - On the "third hand", an increasing number of students de-select formal methods in the curriculum, due to various causes and trends." One cause of the problem is a general mathphobic trend in society and education. Another cause is that, intellectually, Information Technology is the victim of its own success. Indeed, the rapid growth creates so many design and implementation tasks that can be done and, more importantly, are being done with negligible educational or scientific background that it is difficult to argue convincingly in favor of formal methods on the basis of immediate everyday necessities. Critical systems, of course, are a notable exception. These trends are so pervasive that the small minority of FM educators has little hope to curb them in the near future. More effective in the long term is instilling a higher degree of professionalism in the next generation. This requires in particular a directed, positive action towards motivating students. Theme This workshop solicits short papers, presentations, demonstrations and evaluations describing sharp classroom or lab experiments which have proved particularly beneficial to the students' understanding and motivation for formal methods. The emphasis is not on (new) theories or methods but on specific illustrations and exercises that can be used by colleagues in their own courses, perhaps applying their own formalisms. The main goals are: - to share knowledge and experience on the practicalities of teaching and learning formal methods; - to build a collection of interesting cases, examples, assignments and projects that FM teachers can use in educational activities. Format The workshop will be a forum-like event, with short presentations, demos and informal discussion slots. After the workshop, if the evaluation committee decides that there is a sufficient number of high-quality submissions, an agreement will be sought with Springer Lecture Notes in Computer Science about publishing a special volume, and authors will be invited to submit their contribution for refereeing. III. SUBMISSIONS Call for Contributions This workshop solicits papers, presentations, demonstrations and evaluations describing such material in detail and how it has been beneficial to the students' understanding and motivation. The emphasis should not be primarily on new theories or methods but on specific illustrations and exercises that can be used by colleagues in their own courses, perhaps applying their own formalisms. The central problem(s) should be clearly stated and a typical solution outline provided (using the author's preferred method), accompanied by a discussion of what educational aspect is meant to be enhanced. Contributors should motivate their techniques with a discussion of the desired knowledge and skill outcomes of the examples/case studies or projects, and a frank appraisal of their effectiveness, insofar as such an appraisal is meaningful and instructive, which we expect to be the case for most topics. Papers should be kept short (maximum 6 pages). They should be prepared preferably in LaTeX, and a pdf-file should be sent to jno at di.uminho.pt. Submitted papers will be evaluated by the Subgroup on Education. Timings Submission deadline: Friday, June 9, 2006 Acceptance notification: Friday, July 1, 2006 IV. REPOSITORY AND FOLLOW-UP The organization will produce a web-based resource of output from the workshop housed under http://www.fmeurope.org. Contributors willing to allow their teaching materials to be made publicly available for the community are invited to send source files, links or tools and other information that would be suitable for such an on-line repository, which the organization will keep alive on a wiki-like basis. The collected material will form the start of a compendium of examples, cases, assignments and projects, according to the following (rough) categorization. Examples are shorter items, ranging in length from a single observation to over a full page. An example is aimed at clarifying a single aspect where the essence is captured in a somewhat condensed form, with minimal clutter from side-issues. Cases are taken from situations encountered in practice, where the problems may appear in various forms: from immediately appealing (and hence motivating) but not very challenging to subtly hidden and requiring major research. Side-issues and secondary problems may be included to clarify the setting or to illustrate the need for abstraction. Assignments and projects correspond to examples and cases respectively, but the difference is that they are elaborated by the students rather than the instructors. The repository is expected to evolve in at least 3 dimensions: new items are added in their original form as time proceeds; existing items are reworked in various formalisms; experience in teaching is reported. Every one or two years, people who submit the most suitable contributions will be invited to join forces for combining their work into a "laboratory notebook". Any further suggestions are welcome. From jriely at cti.depaul.edu Tue May 2 10:10:00 2006 From: jriely at cti.depaul.edu (James Riely) Date: Tue, 2 May 2006 10:10:00 -0400 Subject: [TYPES/announce] Paper on Typed Parametric Polymorphism for Aspects Message-ID: <17495.26680.854701.989881@amelia.cs.depaul.edu> I'd like to announce the following Technical Report, to be published soon in a special issue of SCP. The paper is available from http://condor.depaul.edu/~jriely/papers/06scp.pdf Typed Parametric Polymorphism for Aspects. R. Jagadeesan, A. Jeffrey, and J. Riely. Science of Computer Programming, 2006, To Appear. Abstract: We study the incorporation of generic types in aspect languages. Since advice acts like method update, such a study has to accommodate the subtleties of the interaction of classes, polymorphism and aspects. Indeed, simple examples demonstrate that current aspect compiling techniques do not avoid runtime type errors. We explore type systems with polymorphism for two models of parametric polymorphism: the type erasure semantics of Generic Java, and the type carrying semantics of designs such as generic C#. Our main contribution is the design and exploration of a source-level type system for a parametric OO language with aspects. We prove progress and preservation properties. We believe our work is the first source-level typing scheme for an aspect-based extension of a parametric object-oriented language. Comments most welcome James From stump at priam.cse.wustl.edu Tue May 2 12:59:41 2006 From: stump at priam.cse.wustl.edu (Aaron Stump) Date: Tue, 02 May 2006 11:59:41 -0500 Subject: [TYPES/announce] Programming Languages meets Program Verification: CFP Message-ID: <24876.1146589181@priam.cse.wustl.edu> Call For Papers: Programming Languages meets Program Verification (PLPV) 2006 A workshop affiliated with IJCAR 2006, a FLoC conference. Seattle, Washington, USA August 21, 2006 http://cl.cse.wustl.edu/plpv06/ *Motivation*. While the essential ideas of program verification have been understood for decades, the practical ability to develop and maintain correct software at a reasonable cost has remained elusive. Approaches based on manually proving extracted verification conditions are often viewed as brittle and burdensome, despite continued advances. Mostly automatic techniques like static analysis and model checking face challenges scaling to rich properties of large systems. Yet, as societies become increasingly dependent on software systems, the need for a practical way to build provably correct software has never been greater. *PL and Verification*. Recent work is exploring alternative, language-based approaches to program verification. In these approaches, the programming language provides mechanisms which allow the programmer to express, in some way, her knowledge of why her code meets its specification. This knowledge is connected more intimately to the code than is usually the case for theorem proving approaches. One commonly used mechanism is dependent types. Specifications are expressed as types, and the programming language allows proofs of those specifications to be expressed as terms inhabiting those types. Pre- and post-conditions of functions are recorded in their input and return types, and the functions require and produce proofs of those conditions as additional inputs and outputs. One exciting possibility is that languages for programming with proofs may enable developers to target a "continuum of correctness," through varying amounts of effort on specification and verification. *Paper Topics*. Research on language-based approaches to program correctness spans compilers, programming languages, and computational logic. Possible paper topics include: -- practical programming with dependent types. -- extended static checking; type systems and other static analyses relying on semantically rich program annotations. -- integration of theorem proving and programming environments. -- programming language constructs or methodologies where artifacts are included solely to convince the type checker that a piece of code is type safe (e.g., type representations, equality types, certain uses of Haskell type classes). -- meta-theoretic properties of languages for programming with proofs or other evidential artifacts. -- formal reasoning about mutable state, including separation logic. *Submissions*. Submissions should either be new research papers, prepared with article format in LaTeX, between 12 and 18 pages in length (not counting appendices, which reviewers will not be asked to review); or else position papers, same format, of no more than 5 pages. Research papers describing preliminary results or work in progress are very welcome. More time for presentation at the workshop may be allotted for a full paper than a position paper. Electronic submission of PostScript or PDF files should be done via the EasyChair page for PLPV (see the PLPV web page). *Review Process*. Each submission will receive three reviews. The co-chairs will limit themselves to position papers, while other PC members may submit either kind of paper. Reviewing (as well as submission) will be managed using the EasyChair system, which prevents PC members from accessing discussions of their own papers. *Publication*. The proceedings of the workshop will be archived in ENTCS. *Important Dates*. -- Electronic submission: May 19. -- Notification: June 30. -- Final version: July 21. *Invited Speaker*. Peter Dybjer *Organizers*. -- Aaron Stump (Washington University in St. Louis) -- Hongwei Xi (Boston University) *Program Committee*. -- Thorsten Altenkirch (University of Nottingham) -- Hugo Herbelin (Ecole Polytechnique) -- Simon Peyton-Jones (Microsoft Research) -- Randy Pollack (University of Edinburgh) -- Carsten Schuermann (IT University of Copenhagen) -- Zhong Shao (Yale University) -- Tim Sheard (Portland State University) -- Aaron Stump, co-chair (Washington University in St. Louis) -- Hongwei Xi, co-chair (Boston University) From txa at Cs.Nott.AC.UK Tue May 2 18:14:13 2006 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Tue, 2 May 2006 23:14:13 +0100 Subject: [TYPES/announce] Call for papers: TYPES 06 Message-ID: Call for papers: Proceedings of TYPES 2006 *OPEN TO ALL INTERESTED RESEARCHERS* The Post-Proceedings of the TYPES 2006 Annual Conference (http://www.cs.nott.ac.uk/types06/) will be published, after a formal refereeing process, as a volume of the Lecture Notes in Computer Science (LNCS) series. Previous TYPES post-workshop proceedings include LNCS volumes 3895, 3085, 2646, 2277, 1657, 1512, 1158, 996 and 806. We encourage you to submit research papers on the subject of the Types Coordination Action, see http://www.cs.chalmers.se/Cs/Research/Logic/Types/objectives.html for details. Topics 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 - implementation of proof-assistants - automation in computer-assisted reasoning - links between type theory and functional programming - formalizing mathematics using type theory Work within the scope of TYPES that was not presented at the workshop or whose authors are not formally involved in the Coordination Action may also be submitted for the proceedings. SUBMISSION DEADLINE: 2 September 2006. NOTIFICATION OF ACCEPTANCE: 27 October 2006 FINAL VERSION DUE: 1 December 2006 We hope this volume will give a good account of the papers presented at the conference and of recent research in the field in general. We invite submission of high quality papers, written in English and typeset in LaTeX2e using the LNCS style. (See authors Instructions at http://www.springeronline.com/lncs). Submissions should not have been published and should not be under consideration for publication elsewhere. Submissions should be no more than fifteen pages long in LNCS style. Please email your contribution as a self-contained pdf file to: types06 at Cs.Nott.AC.UK In a separate email, give the title, authors and abstract of your submission, as well as email address of the corresponding author. Submissions will be acknowledged (perhaps with some delay). LNCS is now published in full-text electronic version, as well as printed books. Thus we will need the final LaTeX source files of accepted submissions. The final versions of accepted submissions must be in the LaTeX2e LNCS style, and be as self-contained as possible. With the final version you will also be asked to complete a copyright form for LNCS accepted papers. We look forward to hearing from you. Thorsten Altenkirch Conor McBride This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From Ralf.Lammel at microsoft.com Tue May 2 18:47:50 2006 From: Ralf.Lammel at microsoft.com (Ralf Lammel) Date: Tue, 2 May 2006 15:47:50 -0700 Subject: [TYPES/announce] Last call for papers: Rule-based programming 2006 Message-ID: <1152E22EE8996742A7E36BBBA7768FEE0991F640@RED-MSG-50.redmond.corp.microsoft.com> RULE'06, 7th International Workshop on Rule-Based Programming, 11th August, 2006, Seattle, USA, A Satellite Event of RTA http://www.dcs.kcl.ac.uk/events/RULE06/ ________________________________________ IMPORTANT DATES - 14th May, 2006 Deadline for electronic submission of papers - 15th June, 2006 Notification of acceptance of papers - 30th June, 2006 Deadline for final versions of accepted papers - 11th August, 2006 Workshop ________________________________________ INVITED SPEAKERS Joint RULE and WRS keynote speakers: - Dick Kieburtz, OHSU/OGI School of Science & Engineering - Claude Kirchner, INRIA and LORIA ________________________________________ RULE-BASED PROGRAMMING The rule-based programming paradigm is characterized by the repeated, localized transformation of a data object such as a term, graph, proof, constraint store, etc. The transformations are described by rules which separate the description of the object to be replaced (the pattern) from the calculation of the replacement. Optionally, rules can have further conditions that restrict their applicability. The transformations are controlled by explicit or implicit strategies. The basic concepts of rule-based programming appear throughout computer science, from theoretical foundations to practical implementations. Term rewriting is used in semantics in order to describe the meaning of programming languages, as well as in the implementation of program transformation systems. Rules are used implicitly or explicitly to perform computations, e.g., in Mathematica, OBJ, ELAN, Maude or to perform deductions, e.g., by using inference rules to describe or implement a logic, theorem prover or constraint solver. Mail clients and mail servers use complex rules to help users organising their email and sorting out spam. Language implementations use bottom-up rewrite systems for code generation (as in the BURG family of tools.) Constraint-handling rules (CHRs) are used to specify and implement constraint-based algorithms and applications. Rule-based programming idioms also give rise to multi-paradigm languages like Claire. ________________________________________ TOPICS We solicit original papers on all topics of rule-based programming, including: - Languages for rule-based programming * Expressivity, Idioms, Design patterns * Semantics, Type systems * Implementation techniques * System descriptions - Other foundations * Complexity results * Advances on rewriting logic * Advances on rewriting calculus * Static analyses of rule-based programs * Transformation of rule-based programs - Applications of rule-based programming, e.g.: * Program transformation * Software analysis and generation * System Control * Work-flow control * Knowledge engineering - Combination with other paradigms * Functional programming * Logic programming * OO programming * Language extensions * Language embeddings - System descriptions ________________________________________ SUBMISSIONS Papers (of at most 15 pages) should be submitted electronically via the web-based submission site. http://www.easychair.org/RULE2006/ Any problems with the submission procedure should be reported to one of the PC chairs: Maribel Fernandez (maribel at dcs.kcl.ac.uk), Ralf L?mmel (Ralf.Lammel at microsoft.com) ________________________________________ PROCEEDINGS Accepted papers will be published in the preliminary proceedings volume, which will be available during the workshop. The final proceedings will be published in Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier. ________________________________________ PROGRAMME COMMITTEE - Mark van den Brand (TU Eindhoven, Netherlands) - Horatiu Cirstea (LORIA, France) - Pierre Deransart (INRIA Rocquencourt, France) - Michael L. Collard (Kent State University, USA) - Martin Erwig (Oregon State University, USA) - Francois Fages (INRIA Rocquencourt, France) - Maribel Fernandez (Co-Chair, King's College London, UK) - Jean-Pierre Jouannaud (LIX, Ecole Polytechnique, France) - Oleg Kiselyov (FNMOC, USA) - Ralf L?mmel (Co-Chair, Microsoft, USA) - Ugo Montanari (Universita di Pisa, Italy) - Pierre-Etienne Moreau (LORIA, France) - Tobias Nipkow (Technical University Munich, Germany) - Tom Schrijvers (K.U.Leuven, Belgium) - Martin Sulzmann (National University of Singapore, Singapore) - Victor Winter (University of Nebraska at Omaha, USA) From Laurent.Vigneron at loria.fr Wed May 3 07:27:23 2006 From: Laurent.Vigneron at loria.fr (Laurent Vigneron) Date: Wed, 3 May 2006 13:27:23 +0200 Subject: [TYPES/announce] 2nd CFP: ISR 2006, July 3-7, Nancy, France Message-ID: <17496.37787.471757.59750@valhey.loria.fr> ********************************************************************** ** Second Call for Participation ** ** ** ** International School on Rewriting ** ** ** ** ISR'2006, July 3-7, 2006 ** ** Nancy, France ** ** http://isr2006.loria.fr/ ** ********************************************************************** ---------------------------------------------------------------------- Overview ---------------------------------------------------------------------- Rewriting is a fundamental concept and tool in computer science, logic and mathematics. It models the notion of transition or elementary transformation of abstract entities as well as common data structures like terms, strings, graphs. Rewriting is central in computation as well as deduction and is a crucial concept in semantics of programming languages as well as in proof theory. This results from a long tradition of cross-fertilization with the lambda-calculus and automated reasoning research communities. This first International School on Rewriting is organized for Master and PhD students, researchers and practitioners interested in the study of rewriting concepts and applications. This school is supported by the IFIP Working Group on Term Rewriting. The lectures will be given by some of the best experts on rewriting (termination, higher-order systems, strategies, ...) and applications (security, theorem proving, program analysis and proofs, ...). ---------------------------------------------------------------------- Invited Speakers ---------------------------------------------------------------------- Franz Baader, Dresden University, Germany Hubert Comon, ENS Cachan, France Gilles Dowek, Ecole Polytechnique & INRIA, France Juergen Giesl, Aachen University, Germany Christopher Lynch, Clarkson University, USA Claude Marche, University of Paris XI & INRIA, France Pierre-Etienne Moreau, INRIA & LORIA, France Vincent van Oostrom, Utrecht University, Netherlands Detlef Plump, University of York, UK Femke van Raamsdonk, Free University Amsterdam, Netherlands Michael Rusinowitch, INRIA & LORIA, France ---------------------------------------------------------------------- Contents ---------------------------------------------------------------------- Introduction to term rewriting Termination of term rewriting and applications Higher order rewrite systems Call by need, call by value Compilation and implementations Applications: Security Theorem proving Rule based languages Program analysis and proofs Advanced topics: Graph rewriting Tree Automata Deduction modulo ---------------------------------------------------------------------- Committees ---------------------------------------------------------------------- Scientific Committee: * Juergen Giesl (Aachen) * Claude Kirchner (Nancy) * Pierre Lescanne (Lyon) * Christopher Lynch (Potsdam) * Aart Middeldorp (Innsbruck) * Femke van Raamsdonk (Amsterdam) * Yoshihito Toyama (Sendai) Local Organization Committee: * Anne-Lise Charbonnier * Pierre-Etienne Moreau * Anderson Santana de Oliveira * Laurent Vigneron (chair) ---------------------------------------------------------------------- Important dates ---------------------------------------------------------------------- Deadline for early registration: May 31st, 2006. Deadline for late registration: June 23rd, 2006. ---------------------------------------------------------------------- Further Information ---------------------------------------------------------------------- For up-to-date details on the school organization, visit the official web page: http://isr2006.loria.fr/ or contact the organizers by e-mail: isr2006(at)loria(dot)fr From sweirich at cis.upenn.edu Wed May 3 09:01:29 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Wed, 03 May 2006 09:01:29 -0400 Subject: [TYPES/announce] 2006 Workshop on Mechanizing Metatheory Message-ID: <4458A9A9.6010903@cis.upenn.edu> Reminder, the deadline for the Mechanizing Metatheory workshop is one month from today. Also, note that the date for the workshop has been set for immediately after ICFP 2006. I hope to see you there! Cheers, Stephanie Weirich ----------------------------------------------------------------------------------------- 1st ACM SIGPLAN Workshop on Mechanizing Metatheory Portland, Oregon, USA Co-located with ICFP' 06. http://www.cis.upenn.edu/~sweirich/wmm/ Important Dates: Submission deadline: June 3, 2006 Author Notification: July 1, 2006 Workshop: September 21, 2006 Workshop Description Researchers in programming languages have long felt the need for tools to help formalize and check their work. With advances in language technology demanding deep understanding of ever larger and more complex languages, this need has become urgent. There are a number of automated proof assistants being developed within the theorem proving community that seem ready or nearly ready to be applied in this domain---yet, despite numerous individual efforts in this direction, the use of proof assistants in programming language research is still not commonplace: the available tools are confusingly diverse, difficult to learn, inadequately documented, and lacking in specific library facilities required for work in programming languages. The goal of this workshop is to bring together researchers who have experience using automated proof assistants for programming language metatheory and those who are interested in using tool support for formalizing their work. One starting point for discussion will be the POPLmark challenge: a set of challenge problems intended to assess the state of the art in this area. More information about the POPLmark challenge is available from http://www.cis.upenn.edu/proj/plclub/mmm. Format The workshop will consist of presentations by the participants, selected from submitted abstracts. It will focus on providing a fruitful environment for interaction and presentation of ongoing work. Participants are invited to submit working notes, source files, and abstracts for distribution to the attendees, but as the workshop has no formal proceedings, contributions may still be submitted for publication elsewhere. (See the SIGPLAN republication policy for more details http://www.acm.org/sigs/sigplan/republicationpolicy.htm) Scope The scope of the workshop includes, but is not limited to: * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * Libraries for programming language metatheory. * Formalization techniques, especially with respect to binding issues. * Analysis and comparison of solutions to the POPLmark challenge * Examples of formalized programming language metatheory * Proposals for new challenge problems that benchmark programming language work Submission Guidelines The deadline for submissions of abstracts is June 3, 2006. Email submissions to sweirich AT cis.upenn.edu. Submissions should be no longer than one page and in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter or A4 sized paper. Program Committee Karl Crary, Carnegie Mellon University Xavier Leroy, INRIA Rocquencourt Peter Sewell, Cambridge University Michael Norrish, Canberra Research Lab, National ICT Australia Stephanie Weirich, University of Pennsylvania (chair) Workshop Organizers Benjamin Pierce, University of Pennsylvania Stephanie Weirich, University of Pennsylvania Steve Zdancewic, University of Pennsylvania From cbraga at ic.uff.br Wed May 3 09:04:50 2006 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 3 May 2006 15:04:50 +0200 Subject: [TYPES/announce] LSFA'06 - Brazilian Workshop on Logical and Semantic Frameworks, with Applications References: <273E3127-E5D6-41BF-8200-DD82C2006722@fdi.ucm.es> Message-ID: <262750CE-849A-4218-858F-BBBC4E37D85A@ic.uff.br> Our apologies if you receive multiple copies of this message. --- Brazilian Workshop on Logical and Semantic Frameworks, with Applications LSFA'06 - FIRST CALL FOR PAPERS ------------------------------------------------------------------------ September 17th, 2006, Natal, Rio Grande do Norte, Brazil (Satellite Event to SBMF'06, the Brazilian Symposium on Formal Methods, to be held together with the International Conference on Graph Transformations, ICGT'06) > Scope Logical frameworks 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 use of such techniques and results, from the practical side. Topics of interest to this forum include, but are not limited to: - Logical frameworks * Proof theory * Type theory * Automated deduction - Semantic frameworks * Specification languages and meta-languages * Formal semantics of languages and systems * Computational and logical properties of semantic frameworks - Implementation of logical and/or semantic frameworks - Applications of logical and/or semantic frameworks LSFA'06 aims to be a forum for presenting and discussing work in progress. The proceedings of the symposium are produced only after the symposium, so that authors can incorporate feedback from the workshop in the published papers. > Program Committee Alejandro Rios UBA (Buenos Aires) Ana Teresa Martins UFC (Fortaleza) Anamaria Moreira UFRN (Natal) Benjamin Bedregal UFRN (Natal) Carolyn Talcott SRI (Menlo Park) Cesar Munoz NASA (Hampton) Christiano Braga UCM (Madrid), co-chair Daniel Durante UFRN (Natal) Delia Kesner Paris 7 (Paris) E. Hermann Haeusler PUC-Rio (Rio de Janeiro), co-chair Elaine Pimentel UFMG (Belo Horizonte) Fairouz Kamareddine Heriot-Watt (Edinburgh) Gilles Dowek Ecole polytechnique (Palaiseau) Luis Carlos Pereira PUC-Rio (Rio de Janeiro) Manuel Clavel UCM (Madrid) Martin Musicante UFRN (Natal) Mauricio Ayala-Rincon UnB (Brasilia), co-chair Narciso Marti-Oliet UCM (Madrid) Paulo Blauth UFRGS (Porto Alegre) Peter Mosses Wales (Swansea) Regivan Nunes UFRN (Natal) Ruy Queiroz UFPE (Recife) Thierry Coquand Chalmers (Goteborg) > Organizing Committee Christiano Braga UCM, chair E. Hermann Haeusler PUC-Rio Mauricio Ayala-Rincon UnB Anamaria Moreira UFRN Martin Musicante UFRN, local chair > Dates and Submission Paper submission deadline: June 20th Author notification: July 24th Camera ready: August 7th Contributions should be submitted in the form of extended abstracts with at most 8 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file, sent to: lsfa06 at fdi.ucm.es The papers should be prepared in latex using SBC latex style. (http://www.sbc.org.br/index.php? language=1&subject=60&content=downloads&id=222) The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration. Authors of the accepted papers will be invited to submit full versions of their contribution for the workshop proceedings. The full versions of the contributions will be reviewed by the PC. The publication of the workshop proceedings in an on-line journal is anticipated. > Contact Information For more information please contact the organizers at: lsfa06 at fdi.ucm.es. The web page of the event can be reached at: http://maude.sip.ucm.es/lsfa06/ From pschust at mathematik.uni-muenchen.de Wed May 3 09:40:12 2006 From: pschust at mathematik.uni-muenchen.de (Peter Schuster) Date: Wed, 3 May 2006 15:40:12 +0200 (MEST) Subject: [TYPES/announce] MAP summer school. Call for participation. Message-ID: Call for participation. The MAP group (see http://www.disi.unige.it/map/) MAP = Mathematics, Algorithms, Proofs organises a one week summer school in Genova (Italy) from Monday 28th August 2006 to Saturday 2nd September 2006. The programme is as follows: Thierry Coquand (Goteborg) : Proof analysis 3h Erich Kaltofen (NCSU, USA) : Computer algebra 6h Henri Lombardi (Besancon) : Constructive commutative algebra 6h Marie-Francoise Roy (Rennes) : History of algorithmic real algebra 3h Francis Sergeraert (Grenoble) : Constructive homologica algebra 6h Helmut Schwichtenberg (Munich): Constructive analysis 6h Wednesday afternoon : free Saturday morning : included An on-line registration form is available from http://www.disi.unige.it/map/. ***** The deadline for registration is 31 May 2006. ***** Successful registration will be notified automatically by email. The registration fee of 180 Euro will include double-room shared accommodation from Sunday (arrival) to Saturday (departure) as well as lunch and dinner from Monday to Friday. The fee is to be payed in cash (Euro) upon arrival (no credit cards). See the aforementioned web page for more details. The organising committee: Henri Lombardi, Herve Perdry, Giuseppe Rosolini, Peter Schuster, and John Abbott From Susanne.Graf at imag.fr Wed May 3 18:48:26 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Thu, 04 May 2006 00:48:26 +0200 Subject: [TYPES/announce] EWSA 2006: Call for papers Message-ID: <4459333A.3050808@imag.fr> --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- THIRD EUROPEAN WORKSHOP ON SOFTWARE ARCHITECTURE (EWSA 2006) Languages, Styles, Models, Tools, and Applications http://www.sciences.univ-nantes.fr/lina/cal2006/ewsa06/ e-mail: ewsa at ebus.informatik.uni-leipzig.de --------------------------------------------------------------------- Nantes, France September 4th and 5th, 2006 co-located with the French-Speaking Conference on Software Architecture -------------------------------------------------------------------- IMPORTANT DATES: * Abstract due: May 23rd, 2006 * Paper submission due: May 30th, 2006 * Notification of acceptance: June 30th, 2006 * Camera-ready paper due: July 14th, 2006 * Workshop: September 4th and 5th, 2006 -------------------------------------------------------------------- SCOPE: The role of software architecture in the engineering of software- intensive applications has become more and more important and wide- spread. Component-based and service-oriented architectures are key to the design, development and evolution of large applications. Following the successful workshops held in St Andrews, Scotland, in 2004 (Springer LNCS 3527) and in Pisa, Italy, in 2005 (Springer LNCS 3047), EWSA 2006 focuses on architecture description languages, architectural styles, architectural models, and architecture-centric tools for modeling, analyzing, transforming, building, and monitoring software applications. In particular, the workshop will concentrate on architecture-centric formalisms, technologies, and processes for engineering applications that are dynamic, mobile, adaptive, and/or evolvable. The purpose of the workshop is to bring together researchers and practitioners from academia and industry who are interested in software architecture technology. It addresses both practical and theoretical advances. -------------------------------------------------------------------- TOPICS: Topics of interest include (but are not limited to): - architecture description languages and metamodels, - architectural models, patterns and styles, - architecture analysis, validation and verification, - architecture transformation and refinement, - architecture-based synthesis, code generation, - architecture-based support for reconfigurable, adaptive or mobile applications, - requirements engineering and software architectures, - quality attributes and software architectures, - architecture reengineering, recovery, - architecture conformance, run-time monitoring, - architecture for autonomic systems, - service oriented architectures, - web services: composition, orchestration, choreography - process and management of architectural decisions, - process models and frameworks for architecture-centric software engineering, - architecture-centric model driven engineering, - architectural features of Model Driven Architecture (MDA), - software tools and environments for architecture-centric software engineering, - architectural styles and models for applications based on mature and emerging technologies (Web Services, Java/J2EE, .Net, ...) - component-based middleware, component-based deployment, - technology of components and component-based frameworks, - industrial applications, case studies, best practices and experience reports on software architecture, - other aspects and applications related to software architecture. -------------------------------------------------------------------- TYPES OF PAPERS: We seek three types of papers: - Position papers: which present concise arguments about a topic of software architecture research or practice (in less than 2000 words). Position papers should not be incomplete versions of full papers. - Full papers: which describe authors' novel research work (motivated, presented and evaluated in less than 6000 words). Full papers must be original contributions, not published, accepted or submitted for publication elsewhere. - Industrial reports: which describe real-world experiences related to software architectures (less than 6000 words; short papers are also welcome). The program committee will select a subset of accepted papers for different kinds of presentations at different workshop sessions. -------------------------------------------------------------------- PROCEEDINGS: The proceedings will be published by Springer-Verlag as part of the Lecture Notes in Computer Science series http://www.springer.de/comp/lncs/index.html. PAPER SUBMISSION: The workshop is open to all researchers, developers and users who are involved with or have an interest in software architecture. All prospective participants should submit a position paper, a full paper or an industrial report. The submissions should explain the contribution to the field and the novelty of the work, making clear the current status of the work. Submit your paper electronically in PDF, PostScript or Word/RTF via the Paperdyne web system: http://www.paperdyne.com/ewsa06.html Submitted papers will be reviewed by at least 3 members of the Program Committee. ATTENDANCE: Attendance will be limited to about 40 people. Invitation is based on paper submission. The workshop language is English. -------------------------------------------------------------------- PROGRAM COMMITTEE: Program Co-chairs: - Volker Gruhn, University of Leipzig, Germany - Flavio Oquendo, University of South Brittany - VALORIA, France Program Committee: - Dharini Balasubramaniam, University of St Andrews, United Kingdom - Thais Batista, University of Rio Grande do Norte - UFRN, Brazil - Rafael Capilla, Universidad Rey Juan Carlos, Spain - Jos? A. Cars?, Technical University of Valencia, Spain - Carlos E. Cuesta, Universidad Rey Juan Carlos, Spain - Rogerio de Lemos, University of Kent, United Kingdom - Ian Gorton, National ICT, Australia - Susanne Graf, Verimag, France - Mark Greenwood, University of Manchester, United Kingdom - Paul Grefen, Eindhoven University of Technology, The Netherlands - Wilhelm Hasselbring, University of Oldenburg, Germany - Valerie Issarny, INRIA, France - Ren? Krikhaar, Vrije Universiteit Amsterdam & Philips Medical Systems, The Netherlands - Philippe Kruchten, University of British Columbia, Canada - Nicole Levy, University of Versailles-St-Quentin - PRiSM, France - Antonia Lopes, University of Lisbon, Portugal - Radu Mateescu, INRIA Rh?ne-Alpes and ENS Lyon, France - Carlo Montangero, Universit? di Pisa, Italy - Ron Morrison, University of St Andrews, United Kingdom - Robert Nord, Software Engineering Institute, USA - Dewayne E. Perry, University of Texas at Austin, USA - Frantisek Plasil, Charles University Prague, Czech Republic - Ralf Reussner, University of Karlsruhe, Germany - Salah Sadou, University of South Brittany - VALORIA, France - Clemens Sch?fer, University of Leipzig, Germany - Bradley Schmerl, Carnegie Mellon University, USA - Clemens Szyperski, Microsoft Research, USA - Dalila Tamzalit, University of Nantes - LINA, France - Brian Warboys, University of Manchester, United Kingdom - Eoin Woods, UBS Investment Bank, United Kingdom Organizing Chair: - Mourad Oussalah, University of Nantes - LINA, France Organizing Committee: - Dalila Tamzalit, LINA, Nantes - Tahar Khammaci, LINA, Nantes - Nassima Sadou, LINA, Nantes - Adel Smeda, LINA, Nantes - Djamel Seriai, EMD, Douai -------------------------------------------------------------------- From Francois.Pottier at inria.fr Thu May 4 12:50:16 2006 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Thu, 4 May 2006 18:50:16 +0200 Subject: [TYPES/announce] [CFP] 2006 ACM SIGPLAN Workshop on ML Message-ID: <20060504165016.GA32073@yquem.inria.fr> ********************************************************************* * The 2006 ACM SIGPLAN Workshop on ML * * * * September 16, 2006 * * * * Colocated with the 11th ACM SIGPLAN * * International Conference on Functional Programming (ICFP 2006), * * Portland, Oregon. * * * * Call for Papers * * * * http://gallium.inria.fr/ml2006/ * ********************************************************************* Important dates * Submission deadline: Saturday 3rd June 2006, 06:00 GMT. * Notification of acceptance: Saturday 8th July 2006. * Final paper due: Saturday 29th July 2006. Scope The ML family of programming languages, whose most popular variants are SML and OCaml, has inspired a tremendous amount of computer science research, both practical and theoretical, and ML continues to underpin a variety of applications, ranging from compilers and theorem provers to low-level system software. This workshop aims to provide a forum for discussion and research on existing and future ML and ML-like languages. We seek papers on any ML-related topic, including (but not limited to): * applications. * extensions: objects, classes, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, modules, specification, error reporting, etc. * implementation: compilers, interpreters, partial evaluators, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, etc. * semantics. Both experimental and theoretical papers are welcome. Each paper 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. In order to encourage lively discussion, submitted papers may describe work in progress. Papers must be submitted in either PDF format or as PostScript documents that are interpretable by Ghostscript. They must be printable on US Letter sized paper. Papers should be formatted using the ACM SIGPLAN style guidelines available at http://www.acm.org/sigs/sigplan/authorInformation.htm The length should be no more than 12 pages. Proceedings will be published by ACM Press and will appear in the ACM Digital Library. Authors of accepted papers will be required to sign the ACM copyright form. Papers can be submitted electronically at http://www.softconf.com/start/ML06/submit.html General Chairs and Program Chairs Andrew Kennedy Microsoft Research Ltd, 7 JJ Thomson Ave, Cambridge CB3 0FB, UK akenn at microsoft.com Fran?ois Pottier INRIA Rocquencourt BP 105 78153 Le Chesnay Cedex FRANCE francois.pottier at inria.fr Programme Committee Derek Dreyer (Toyota Technological Institute at Chicago) Matthew Fluet (Cornell University) John Harrison (Intel Corporation) Haruo Hosoya (University of Tokyo) Andrew Kennedy (Microsoft Research Cambridge, co-chair) Eugenio Moggi (Universit? di Genova) Michael Norrish (National ICT Australia) Fran?ois Pottier (INRIA Rocquencourt, co-chair) Ian Stark (University of Edinburgh) Alley Stoughton (Kansas State University) J?r?me Vouillon (CNRS and Universit? Paris 7) Stephanie Weirich (University of Pennsylvania) From sak at cse.iitd.ernet.in Thu May 4 23:43:20 2006 From: sak at cse.iitd.ernet.in (S. Arun-Kumar) Date: Fri, 5 May 2006 09:13:20 +0530 (IST) Subject: [TYPES/announce] FSTTCS 26: Call for papers In-Reply-To: <445A06A6.7060505@cis.upenn.edu> References: <445A06A6.7060505@cis.upenn.edu> Message-ID: FSTTCS 2006 The 26th Conference on Foundations of Software Technology and Theoretical Computer Science December 13-15, 2006 Indian Statistical Institute Kolkata, INDIA IARCS, the Indian Association for Research in Computing Science announces the 26th Annual FSTTCS Conference in Kolkata (formerly Calcutta). The FSTTCS conference is a forum for presenting original results in foundational aspects of Computer Science and Software Technology. INVITED SPEAKERS Gordon Plotkin University of Edinburgh, UK Emo Welzl ETH Zurich, Switzerland Gerard Boudol INRIA, Sophia Antipolis, France David Shmoys Cornell University, USA Eugene Asarin LIAFA, Universite' Paris 7, France WORKSHOPS In addition to invited talks and contributed papers, the conference will have two pre-conference workshops (TBA). PROCEEDINGS The conference proceedings will be published by Springer in its Lecture Notes in Computer Science (LNCS) series. The proceedings of the 2005 conference was published as LNCS 3821. For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. SCOPE Authors are invited to submit papers presenting original and unpublished research in any area of Theoretical Computer Science or Foundational aspects of Software Technology. Representative areas include, but are not limited to: Automata, Languages and Computability Automated Reasoning, Rewrite Systems, and Applications Combinatorial Optimization Computational Biology Computational Complexity Computational Geometry Concurrency Theory Cryptography and Security Protocols Database Theory and Information Retrieval Data Structures Graph and Network Algorithms Logic, Proof Theory, Model Theory and Applications Logics of Programs and Temporal Logics New Models of Computation Parallel and Distributed Computing Programming Language Design and Semantics Randomized and Approximation Algorithms Software Specification and Verification Timed and Hybrid Systems Type Systems SUBMISSION GUIDELINES Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 pages in LNCS style. Proofs omitted due to space constraints may be put into a clearly marked appendix (but the paper should be intelligible without the appendix, as reviewers are not required to read appendices). Concurrent submissions to other conferences or journals are not acceptable. Electronic submission is very strongly recommended. The submission server will be set up by 08 May 2006 and submissions will be accepted till 18 June 2006. PROGRAMME COMMITTEE Amit Kumar IIT Delhi Anil Seth IIT Kanpur Anuj Dawar Cambridge University Anupam Gupta Carnegie Mellon University Ashish Tiwari SRI International Astrid Kiehn IIT Delhi Dale Miller INRIA-Futurs Deepak D'Souza IISc Bangalore Edgar Ramos U of Illinois, Urbana-Champaign Giuseppe Italiano Universita` di Roma "Tor Vergata" Helmut Veith TU Munich Javier Esparza Universita"t Stuttgart Joost-Pieter Katoen RWTH Aachen Kavitha Telikepalli IISc Bangalore Madhavan Mukund CMI Chennai Manindra Agrawal IIT Kanpur Marco Pistore DIT Universita` di Trento Marina Papatriantafilou Chalmers U of Technology Naveen Garg IIT Delhi (co-chair) Neal Young U California, Riverside Nobuko Yoshida, Imperial College Prakash Panangaden McGill University Radha Jagadeesan DePaul University Rohit Khandekar University of Waterloo S. Arun-Kumar IIT Delhi (co-chair) Sriram K. Rajamani Microsoft Research Subhas C. Nandy ISI Kolkata Supratik Chakraborty IIT Bombay Susanne Albers Universita"t Freiburg Yuval Rabani Technion CONTACTS Email: fsttcs26 AT cse DOT iitd DOT ernet DOT in Phone: +(91) (11) 2659-1287 or 2659-1296 Fax: +(91) (11) 2658-1060 URLs: www.fsttcs.org, www.cse.iitd.ernet.in./~fsttcs26/ Postal address: Naveen Garg / S. Arun-Kumar Attention: FSTTCS 2006 Department of Computer Science and Engineering Indian Institute of Technology Delhi Hauz Khas New Delhi 110 016, INDIA IMPORTANT DATES Submission from: 08 May 2006 Deadline (Abstract): 18 June 2006 Submission(Papers): 25 June 2006 Notification to Authors: 20 August 2006 Final Version of Accepted Papers due on: 16 September 2006 (tentative) Workshops: 10-12 December 2006 Conference: 13-15 December 2006 ___________________________________________________________________________ Naveen Garg S. Arun-Kumar Department of Computer Science & Engineering Ph:+(91) (11) 2659-1287 IIT, Hauz Khas, New Delhi 110 016, India. FAX:+(91) (11) 2658-1060 http://www.cse.iitd.ernet.in/~fsttcs26/ ____________________________________________________________________________ From lund.ketil at gmail.com Thu May 4 16:43:58 2006 From: lund.ketil at gmail.com (DAIS'06) Date: Thu, 4 May 2006 22:43:58 +0200 Subject: [TYPES/announce] DAIS 2006 - CALL FOR PARTICIPATION Message-ID: 6th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems DAIS 2006 "From service-oriented architectures to self-managing applications" Bologna, Italy June 13-16, 2006 http://www.discotec06.cs.unibo.it/DAIS06/ To be held in conjunction with FMOODS 2006 and Coordination 2006 http://discotec06.cs.unibo.it ABOUT THE CONFERENCE ==================== The conference program presents the state of the art in research concerning distributed and interoperable systems. In recent years, distributed applications have indeed gained a practical and widely-known footing in everyday computing. Use of new communication technologies have brought up divergent application areas, including mobile computing, inter-enterprise collaborations, and ubiquitous services, just to name a few. New challenges include the need for service-oriented architectures, autonomous and self-managing systems, peer-to-peer systems, grid computing, sensor networks, semantic enhancements, and adaptivity and dynamicity of distribution constellations. Following the evolution of the field, DAIS 2006 focuses on architectures, models, technologies and platforms for interoperable, scalable and adaptable systems that are related to the latest trends towards service orientation and self-* properties. The papers to be presented at DAIS 2006 cover methodological aspects, tools and language of building adaptable distributed and interoperable services, fault tolerance and dependability, peer-to-peer systems, mobility issues, web services applications and performance issues and composition, semantic web and semantic integration, and context- and location-aware applications. This year, the technical program of DAIS drew from 99 submitted papers, among which 10 were explicitly submitted as work-in-progress papers. From these, 21 regular and 5 work-in-progress papers were selected for inclusion in the proceedings. The DAIS 2006 conference is sponsored by IFIP (International Federation for Information Processing) and it was the sixth conference in the DAIS series of events organized by IFIP Working Group 6.1. DAIS'06 will be held in the beautiful city of Bologna, Italy, colocated with the 8th IFIP Formal Methods for Open Object-Based Distributed Systems (FMOODS'06) and Coordination'06. Attendants of DAIS'06 will have the opportunity to attend the sessions of the two colocated conferences. TECHNICAL PROGRAM OF DAIS 06 ============================ SESSION 1 (joint with FMOODS and Coordination): Invited talk "Mobile Service Oriented Architectures (MOSOA)" Jan Bosch, NOKIA Research Center SESSION 2; Mobile and pervasive computing "A Spatial Programming Model for Real Global Smart Space Applications" Rene Meier, Anthony Harrington, Thomas Termin, Vinny Cahill "Mobile Process Description and Execution" Christian P. Kunze, Sonja Zaplata, Winfried Lamersdorf "An Application Framework for Nomadic, Collaborative Applications" James O'Brien, Marc Shapiro "Interfering effects of service adaptation: implications on self-adapting systems architecture" Jacqueline Floch, Erlend Stav and Svein Hallsteinsen SESSION 3: Peer-to-peer systems "Discovery of Stable Peers in a Self-organising Peer-to-Peer Gradient Topology" Jan Sacha, Jim Dowling, Raymond Cunningham, Rene Meier, "On the Value of Random Opinions in Decentralized Recommendation" Elth Ogston, Arno Bakker, Maarten van Steen SESSION 4: Semantic web "Information Agents That Learn to Understand Each Other Via Semantic Negotiation" Salvatore Garruzzo, Domenico Rosaci "Discovering Semantic Web Services with Process Speci?cations" Piya Suwannopas, Twittie Senivongse "Towards Building a Semantic Grid for E-learning" Wenya Tian, Huajun Chen SESSION 5 (joint with FMOODS and Coordination): Invited talk Chris Hankin, Department of Computing, Imperial College SESSION 6: Web services "A Code Migration Framework for AJAX Applications" Arno Puder "High Performance SOAP Processing Driven by Data Mapping Template" Wei Jun, Hua Lei, Niu Chunlei, Zheng Haoran "An Approach for Fine-Grained Web Service Performance Monitoring" Jan Schaefer "WSInterConnect: Dynamic Composition of Web Services through Web Services" Josef Spillner, Iris Braun, Alexander Schill SESSION 7: Fault tolerance 1 "Bounding Recovery Time in Rollback-Recovery Protocol for Mobile Systems Preserving Session Guarantees" Jerzy Brzezinski, Anna Kobusinska, Jacek Kobusinski "Intelligent Dependability Services for Overlay Networks" Barry Porter, Geoff Coulson, Daniel Hughes SESSION 8: Architectural adaptation and modelling "Model-Driven Development of Context-Aware Services" Joao Paulo A. Almeida, Maria-Eugenia Iacob, Henk Jonkers, Dick Quartel "Utilising Alternative Application Configurations in Context- and QoS-Aware Mobile Middleware" Sten A. Lundesgaard, Ketil Lund, Frank Eliassen "Timing Driven Architectural Adaptation" Andrew Wils, Yolande Berbers, Tom Holvoet, Karel De Vlaminck SESSION 9 (joint with FMOODS and Coordination): Invited talk Jos? Luiz Fiadeiro, Department of Computer Science, University of Leicester SESSION 10: Fault tolerance 2 "Fault-Tolerant Replication Based on Fragmented Objects" Hans P. Reiser, Rudiger Kapitza, Jorg Domaschka, Franz J. Hauck "Towards Context-Aware Transaction Services" Romain Rouvoy, Patricia Serrano-Alvarado, Philippe Merle "A Local Self-stabilizing Enumeration Algorithm" Brahim Hamid, Mohamed Mosbah "Adding Fault-Tolerance to a Hierarchical DRE System" Paul Rubel, Joseph Loyall, Richard Schantz, Matthew Gillen "Using Speculative Push for Unnecessary Checkpoint Creation Avoidance" Arkadiusz Danilecki and Micha l Szychowiak SESSION 11: Software tools and languages "A Versatile Kernel for Distributed AOP" Eric Tanter, Rodolfo Toledo "Transformation of Centralized Software Components into Distributed" Abdelhak Seriai, Gautier Bastide, Mourad Oussalah "PAGE: a distributed infrastructure for fostering RDF-based interoperability" Emanuele Della Valle, Andrea Turati and Alessandro Ghioni REGISTRATION ============ Registration now open. o Early registration: until 31 May 2006. o for - further registration details (student reductions, presenter reductions, workshop fees...), - travel information and information about Bologna, see (under registration) http://www.discotec06.cs.unibo.it ORGANISERS ========== General chair: Gianluigi Zavattaro, University of Bologna, Italy Steering committee: Lea Kutvonen, University of Helsinki, Finland Hartmut Koenig, BTU Cottbus, Germany Kurt Geihs, University of Kassel, Germany Elie Najm, ENST, Paris, France PC Chairs: Frank Eliassen, University of Oslo, Norway Alberto Montresor, University of Trento, Italy Publicity chair: Ketil Lund, Simula Research Laboratory, Norway Local arrangements: Program committee: N. Alonistioti, University of Athens, Greece D. Bakken, Washington State University, USA A. Bartoli, University of Trieste, Italy Y. Berbers, Yolande, Katholieke Universiteit Leuven, Belgium A. Beugnard, ENST-Bretagne, France G. Blair, Lancaster University, UK A. Corsaro, Alenia Marconi System, Italy I. Demeure, ENST, France F. Eliassen, University of Oslo, Norway P. Felber, Universit? de Neuch?tel, Switzerland, K. Geihs, University of Kassel, Germany K. M. Goschka, Technical University of Vienna, Austria S. Graupner, HP Labs, USA R. Gr?nmo, SINTEF ICT, Norway D. Hagimont, INP Toulouse, France S. Hallsteinsen, SINTEF ICT, Norway J. Indulska, University of Queensland, Australia E. Jul, Microsoft Research, Cambridge, UK A. Keller, IBM Thomas J. Watson Research Center, USA H. Koenig, BTU Cottbus, Germany R. Kroeger, Univeristy of Applied Sciences Wiesbaden, Germany H. Krumm, University of Dortmund, Germany L. Kutvonen, University of Helsinki, Finland W. Lamersdorf, University of Hamburg, Germany C. Linnhof-Popien, University of Munich, Germany K. Lund, Simula Research Laboratory, Norway R. Meier, Trinity College Dublin, Ireland A. Montresor, University of Trento, Italy E. Najm, ENST, France R. Oliveira, Universidade do Minho, Portugal K. Raymond, University of Queensland, Australia R. Schantz, BBN Technologies, USA A. Romanovsky, University of Newcastle upon Tyne, UK W. Schreiner, Johannes Kepler University Linz, Austria T. Senivongse, Chulalongkorn University, Thailand K. Sere, ?bo Akademi University, Finland J.-B. Stefani, INRIA, France N. Wang, Tech-X Corporation, USA -- Ketil Lund Publicity chair DAIS'06 From sweirich at cis.upenn.edu Fri May 5 09:17:04 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Fri, 05 May 2006 09:17:04 -0400 Subject: [TYPES/announce] Announcement and CFP : Workshop Proofs & Numbers, June in Orsay, France Message-ID: <445B5050.7080904@cis.upenn.edu> Dear Colleagues, We plan a workshop on the upcoming research field of interactions between numerical computations and formal proofs. The workshop will take place over 1 and 1/2 days, on June 12th and 13th in Orsay; it will follow a more general seminar the 12th in the morning. We encourage you to participate and to present work on the topic. The aim is to bring together from different fields; please feel free to forward this announcement to other possibly interested colleagues. More information is given below and can also be found on : http://www-sop.inria.fr/marelle/Laurent.Thery/microsoft/Workshop%20on%20numbers%20and%20proofs.html Given the short delay, the program will be established as propositions come in and the web-site will grow progressively. We already plan talks about formal primality proofs, representation of numbers in type theory, formal real optimization, representation of arbitrary precision real numbers in Coq... The workshop will be supported by the EU TYPES project and the new joint laboratory of INRIA and Microsoft Research. Members of TYPES can therefore use their TYPES money to fund their trip. Hoping to see many of you in Orsay, Benjamin Gr?goire, Laurent Th?ry, Benjamin Werner ------------------------------------------ TYPES Workshop on Numbers and Proofs Orsay (France), June 12-13 2006 Scope ********* There is a growing trend of bringing together formal proofs and efficient numerical computations. On one hand, people working designing efficient numerical libraries are more and more interested by proving their correctness. On the other hand, theorem proving people want to use non-trivial numerical computations inside formal proofs. Indeed, recent examples show that the naive representations of numbers in proof systems are not sufficient anymore: * New developments like work on Hales' proof of the Kepler conjecture or primality tests show that computations over numbers are a crucial part of the proof. New proof tactics like * Grˆbner bases or Cylindrical Algebraic Decomposition or interval arithmetic show that computation over numbers are crucial to define semi-decision procedures. In both cases, checking the resulting proof requires efficient computations over integers, rational or real numbers ... We believe that this area is meant to grow in the near future and opens new perspectives to formal mathematics. This workshop 's goal is to encourage the cross-fertilization between theorem proving and computer arithmetic. In particular to promote the design of proof-systems with reasonably efficient computational abilities using certified routines. More generally, this workshop should be an occasion for the communities of theorem proving and computer arithmetic to meet. Location and Dates ************************* The workshop will be held on June 12-13 in France (Orsay / Plateau de Saclay). For people that want to give a talk or simply participate, please send an email to one of the organizers before May 25: Benjamin.Werner at inria.fr Laurent.Thery at sophia.inria.fr Benjamin.Gregoire at sophia.inria.fr --------------------- From sweirich at cis.upenn.edu Fri May 5 11:07:36 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Fri, 05 May 2006 11:07:36 -0400 Subject: [TYPES/announce] Spring School in Theoretical Computer Science Message-ID: <445B6A38.9040605@cis.upenn.edu> ---------- Forwarded message ---------- Date: Fri, 5 May 2006 16:01:53 +0200 (CEST) From: Paul-Andre Mellies Subject: Spring School in Theoretical Computer Science *** Last call for participation *** Spring School in Theoretical Computer Science EPIT 2006 Games in Semantics and Verification May 29 -- June 2, 2006 Ile de Re, France http://epit.pps.jussieu.fr * * * THE SPRING SCHOOL The Spring School in Theoretical Computer Science is a French institution, started by Maurice Nivat in 1973. The School is based on a simple but extraordinarily successful recipe: bring together the world's specialists of a different topic every year, for a week, in a beautiful and somewhat recluded part of France. This year, the Spring School will meet at <> --- an exquisite island on the Atlantic Ocean, in front of La Rochelle. The seaside setting will certainly provide lots of opportunities for informal discussions and collaborations in the evenings. GAME THEORY IN SEMANTICS AND VERIFICATION The Spring School 2006 is designed for students and researchers interested in learning more about Game Theory and its recent applications to the Semantics and Verification of Programs and Programming Languages. The Spring School offers the first international platform for discussing together the recent advances in these two extremely active topics. The Spring School is openly multi-disciplinary, and will also introduce related topics such as Descriptive Set Theory in Mathematical Logic, or Nash equilibrium in Economic Games. Lectures will be provided ***in english*** by: Samson Abramsky (Oxford, UK) Jacques Duparc (Lausanne, Switzerland) Paul Gastin (LSV, ENS Cachan) Erich Gradel (Aachen, Germany) Martin Hyland (Cambridge, UK) Luke Ong (Oxford, UK) Tristan Tomala (Ceremade, Paris Dauphine) Igor Walukiewicz (Bordeaux) Wieslaw Zielonka (Paris) The program of the Spring School appears at: http://epit.pps.jussieu.fr/ REGISTRATION We have done our best to limit the registration and accomodation fees to the following amounts: --- 250 euros for students in double rooms, --- 500 euros for researchers in single rooms. REGISTRATION We have done our best to limit the registration and accomodation fees to the following amounts: --- 250 euros for students in double rooms, --- 500 euros for researchers in single rooms. This includes the (somptuous) accomodation, the (perfect) meals, the coffee breaks, as well as a coach from La Rochelle to l'Ile de Re, and return. DEADLINES An unexpected increase in our financial support enables us to accept more participants than what was originally forecast. There remains however only a very limited number of places. We thus ask that interested people contact the organizers *directly* and *immediately* at: mellies at pps.jussieu.fr muscholl at liafa.jussieu.fr ... immediately meaning before Wednesday, May the 10th, ideally, and at the latest on Monday, May the 15th. Further information is provided on the web page of the Spring School: http://epit.pps.jussieu.fr/ GIVE A TALK Depending on the time available, it should be possible for participants to give a talk on their work at the Spring School. Please indicate a title and abstract when you register to the School. Looking forward to meeting you at l'Ile de Re, -- The organizers Paul-Andre Mellies (PPS, Paris) and Anca Muscholl (LIAFA, Paris) From loeh at iai.uni-bonn.de Fri May 5 15:36:20 2006 From: loeh at iai.uni-bonn.de (Andres Loeh) Date: Fri, 5 May 2006 21:36:20 +0200 Subject: [TYPES/announce] Haskell Workshop 2006 Second call for papers Message-ID: <20060505193620.GA3799@iai.uni-bonn.de> Apologies for multiple copies; feel free to distribute further. Cheers, Andres -------------- next part -------------- ACM SIGPLAN 2006 Haskell Workshop Call for Papers Portland, Oregon 17 September, 2006 The Haskell Workshop 2006 will be part of the 2006 International Conference on Functional Programming (ICFP) as an associated, ACM SIGPLAN sponsored workshop. Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Snowbird (2004), and Tallinn (2005). Topics The purpose of the Haskell Workshop is to discuss experience with Haskell, and possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, in the form of a formal treatment 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, and so forth; * Applications, Practice, and Experience with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; * Functional Pearls being elegant, instructive examples of using Haskell. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! Submission details Submission deadline: Friday, 2 June 2006 (23:00 Samoa standard time, UTC -11) Notification: Monday, 3 July 2006 Authors should send their papers to Andres Loeh (haskell-workshop at andres-loeh.de) by e-mail. Submitted papers should be in (postscript or) portable document format, formatted using the ACM SIGPLAN style guidelines. Papers should not exceed 12 pages in length. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. If there is sufficient demand, we will try to organise a time slot for system or tool demonstrations. If you are interested in demonstrating a Haskell related tool or application, please send a brief demo proposal to Andres Loeh (haskell-workshop at andres-loeh.de). Programme Committee Koen Claessen, Chalmers University, Sweden Bastiaan Heeren, Universiteit Utrecht, The Netherlands Paul Hudak, Yale University, US Isaac Jones, Galois Connections, US Gabriele Keller, University of New South Wales, Australia Oleg Kiselyov, FNMOC, US Andres Loeh (chair), Universitaet Bonn, Germany Conor McBride, University of Nottingham, UK Shin-Cheng Mu, Academia Sinica, Taiwan Andrew Tolmach, Portland State University, US From zucker at cas.mcmaster.ca Mon May 8 00:41:36 2006 From: zucker at cas.mcmaster.ca (Jeffery Zucker) Date: Mon, 8 May 2006 00:41:36 -0400 (EDT) Subject: [TYPES/announce] CERTSOFT'06: CFP Message-ID: <200605080441.k484faMc019220@birkhoff.cas.mcmaster.ca> [Apologies for multiple postings] CERTSOFT'06: AN INTERNATIONAL WORKSHOP ON SOFTWARE CERTIFICATION August 26 & 27, 2006 McMaster University, Hamilton, Ontario, Canada http://fm06.mcmaster.ca/certsoft In conjunction with FORMAL METHODS 2006 http://fm06.mcmaster.ca GOAL OF THE WORKSHOP ==================== Software is currently used to control medical devices, automobiles, aircraft, manufacturing plants, nuclear generating stations, space exploration systems, elevators, electric motors, automated trains, banking transactions, telecommunications devices and a growing number of devices in industry and in our homes. Software is also mission critical for many organizations, even if the software does not 'control' what happens. Clearly, many of these systems have the potential to cause physical harm if they malfunction. Even if they do not cause physical harm, their malfunctions are capable of causing financial and political chaos. Currently there is no consistent regulation of software, and society is starting to demand that software used in critical systems must meet minimum safety, security and reliability standards. Manufacturers of these systems are in the unenviable position of not having any clear guidelines as to what may be regarded as acceptable standards in these situations. Even where the systems are not mission critical, software producers and their customers are becoming interested in methods for assuring quality that may result in software supplied with guarantees. The purpose of the workshop is to discuss issues related to software certification. Possible topics include: - What is software certification, and what is its relation to system certification? - Methods, processes, and tools for developing certified software - Certifying safety-critical applications - Certifying embedded systems - Certifying non-critical but commercially significant applications - Certification of software components - Developing standards based on experimental analysis of methods - Formalization of Regulatory Requirements for Software - Repositories of assured/verified/validated software components - Using the Common Criteria for IT Security Evaluation as a model - Standardization of certification methods used in different industries - Evolutionary and incremental certification INVITED SPEAKERS ================ - David Parnas, University of Limerick - Rance Cleaveland, University of Maryland; Fraunhofer Center; Reactive Systems (Other speakers not yet confirmed) SUBMISSION INFORMATION ====================== Submissions should be no more than 15 pages and should be in PS or PDF file format. Proceedings of the workshop will be published and available at the workshop. If there is interest and papers are felt to be of sufficient quality, we will seek publication of extended versions in a special issue of an appropriate journal (such as STTT). Deadlines: Original submission: 9 June, 2006 Notification of acceptance: 26 June, 2006 Final version of submission: 24 July, 2006 PROGRAM COMMITTEE ================= Co-Chairs: Stefania Gnesi, ISTI-CNR, Italy Tom Maibaum, McMaster University, Canada (Members not yet confirmed) ORGANIZING COMMITTEE (all at McMaster University, Canada) ==================== Alan Wassyng -- Chair Wolfram Kahl Mark Lawford Jeff Zucker From cortesi at unive.it Mon May 8 11:24:50 2006 From: cortesi at unive.it (Agostino Cortesi) Date: Mon, 8 May 2006 17:24:50 +0200 (CEST) Subject: [TYPES/announce] PPDP 2006 - call for participation Message-ID: _______________________________________________________________________ 8th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP'06) [co-located with ICALP'06 and LOPSTR'06] Venice, Italy, 10-12 July 2006 CALL FOR PARTICIPATION http://www.dsi.unive.it/ppdp2006/ invited speakers: Simon Peyton Jones (Microsoft Research, Cambridge, UK) Vladimiro Sassone (Univerisity of Southampton, UK) ______________________________________________________________________ ACCOMMODATIONS We have reserved a number of rooms in the Lodgings located on the S. Servolo Island, and on the Giudecca Island close to the Conference venue. If you are interested in this kind of accommodation, please book as soon as possible: rooms are filling up quickly! IMPORTANT DATES * Early Registration: May 31, 2006 * Conference: July 10 - 12, 2006. SCIENTIFIC PROGRAM Full details availabel at: http://www.dsi.unive.it/ppdp2006/ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- prof. agostino cortesi tel. 0039 041 234.8450 dipartimento di informatica fax 0039 041 234.8419 universita' ca' foscari mail cortesi at unive.it via torino 155 url www.dsi.unive.it/~cortesi 30170 Venezia cell 0039 347 441 4010 From jean-yves.marion at loria.fr Mon May 8 15:32:04 2006 From: jean-yves.marion at loria.fr (Jean-Yves Marion) Date: Mon, 8 May 2006 21:32:04 +0200 Subject: [TYPES/announce] CALL FOR PAPERS: TOCL - ICC (Implicit Computational Complexity) Message-ID: <7827E8FA-3DFB-45AC-90B6-479FF7AF0EDA@loria.fr> ------------------------------------------------------------------------ --------- CALL FOR PAPERS ACM Transactions on Computational Logic (TOCL) Special Issue on Implicit Computational Complexity (ICC) ------------------------------------------------------------------------ ----------- Following the success of the GEOCAL workshop on ICC, there will be a special issue of the ACM Transactions on Computational Logic (TOCL), see Submissions for this special issue are hereby solicited to participants of the workshop, but also to other contributors. The workshop was held on February 13-17 2006 in Marseille (France) as part of the Geometry of Computation 2006 meeting (series of lectures and workshops) organized by the GEOCAL project. More information can be found at http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html SCOPE ====== Implicit Computational Complexity (ICC) has emerged from various propositions to use logic and formal methods like types, rewriting systems... to provide languages for complexity-bounded computation. It aims at studying the computational complexity of programs without referring to a particular machine model and explicit bounds on time or memory, but instead by relying on logical or computational principles that entail complexity properties. Several approaches have been explored for that purpose, like linear logic, restrictions on primitive recursion, rewriting systems, types and lambda-calculus... Two objectives of ICC are: - on the one hand to find natural implicit logical characterizations of functions of various complexity classes, - on the other hand to design systems suitable for static verification of program complexity. In particular the latter goal requires characterizations, which are general enough to include commonly used algorithms. SUBMISSION =========== Submissions consist in either (i) Sending to patrick.baillot'at'lipn.univ-paris13.fr the file in pdf or ps format, with "ICC ToCL issue submission" in the subject line. or (ii) by posting the paper first at the Computing Research Repository (CoRR) and subsequently sending the archive identifier by email to to patrick.baillot'at'lipn.univ-paris13.fr (see Submission via CoRR for the benefits of this form of submission : http://www.acm.org/pubs/tocl/corr.html). All submissions will be acknowledged. Submitted papers must be original and not submitted for publication. Submissions will be refereed according to the usual very high standards of TOCL. PLANNED SCHEDULE ================== Deadline for submissions : 31 August 2006 Notification : 30 November 2006 Final manuscrits : 1st March 2007 GUEST EDITORS ============= Patrick Baillot, Universit? Paris 13, LIPN, email : patrick.baillot 'at' lipn.univ-paris13.fr Jean-Yves Marion, Ecole des Mines de Nancy, LORIA-INPL, email : Jean-Yves.Marion 'at' loria.fr Simona Ronchi della Rocca, Universit? di Torino, email : ronchi'at'di.unito.it From jcg at itu.dk Mon May 8 17:07:56 2006 From: jcg at itu.dk (Jens Chr. Godskesen) Date: Mon, 08 May 2006 23:07:56 +0200 Subject: [TYPES/announce] International PhD School on Verification of Protocols for Security and Mobility Message-ID: <445FB32C.6010800@itu.dk> Reminder Call for Participation International PhD School on Verification of Protocols for Security and Mobility http://www.first.dk/VPSM Copenhagen, Denmark, October 9-13, 2006 This one-week PhD school will give young researchers, doctoral students, and others a comprehensive overview of contemporary automatic verification methods and tools. The participants will meet a variety of techniques including: static analysis, (on-the-fly, probabilistic, and real-time) model checking, and Coloured Petri Nets. The emphasis will be put on verification of protocols for security and mobility. The school will offer lectures by key researchers in automatic verification, security and mobility. The exercise classes will introduce the students to state-of-the-art tools for automatic verification. Speakers: * Professor David Basin,ETH Zurich, Switzerland * Professor Marta Kwiatkowska, University of Birmingham, UK * Professor Kim Guldstrand Larsen, Aalborg University, Denmark * Professor Hanne Riis Nielson, IMM, Technical University of Denmark * Professor Flemming Nielson, IMM, Technical University of Denmark * Associate Professor Gerd Behrmann, Aalborg University, Denmark * Associate Professor Lars M. Kristensen, University of ?rhus, Denmark Venue: The school will be held at the campus of the IT University o