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 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 amoeller at brics.dk Wed May 10 03:28:45 2006 From: amoeller at brics.dk (=?ISO-8859-1?Q?Anders_M=F8ller?=) Date: Wed, 10 May 2006 09:28:45 +0200 Subject: [TYPES/announce] NEW BOOK: An Introduction to XML and Web Technologies Message-ID: <4461962D.7040001@brics.dk> [Relevance for TYPES: the book contains descriptions of a number of programming languages for XML and explains the use of schemas as types, in particular in XQuery and XDuce.] The book An Introduction to XML and Web Technologies Anders M?ller and Michael I. Schwartzbach Addison-Wesley is now available from international book stores. Contents: - HTML, XHTML, CSS - XML - XPath 2.0 - Schema Languages (DTD, XML Schema, DSD2, RELAX NG) - XSLT 2.0 - XQuery - XML programming (JDOM, data binding, SAX, STX, XDuce, Xact) - HTTP - Java Servlets - JSP - Web Services (SOAP, WSDL, UDDI) "A superb summary of the main Web technologies. It is broad and deep giving you enough detail to get real work done. Eminently readable with excellent examples and touches of humour. This book is a gem." Prof. Philip Wadler, Edinburgh University "A unique, detailed, and technically sophisticated introduction to current XML and Web technologies" Jan Chomicki, Buffalo University "This book is a genuine pleasure to read - I learned a lot, and I learned it fast!" Mary Fern?ndez, AT&T Labs Research For more information, see http://www.brics.dk/ixwt/ or http://www.amazon.co.uk/exec/obidos/ASIN/0321269667 From femke at cs.vu.nl Wed May 10 04:45:14 2006 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Wed, 10 May 2006 10:45:14 +0200 (CEST) Subject: [TYPES/announce] HOR 2006: extended deadline Message-ID: !!!!!!!!!!!!!!!!!! Extended Deadline: May 17 !!!!!!!!!!!!!!!!!!!! ******************************** * * * 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 17, 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 mirko.viroli at unibo.it Wed May 10 04:07:54 2006 From: mirko.viroli at unibo.it (Mirko Viroli) Date: Wed, 10 May 2006 10:07:54 +0200 Subject: [TYPES/announce] FOCLASA 2006 CFP Message-ID: <44619F5A.60308@unibo.it> Call for Papers -- Submission deadline: May 31, 2006 --------------- FOCLASA 2006 --------------- 5th International Workshop on the Foundations of Coordination Languages and Software Architectures A Satellite Workshop of CONCUR 2006 http://foclasa06.lcc.uma.es/ Call for Papers FOCLASA 2006 is a satellite workshop of the 17th International Conference on Concurrency Theory CONCUR 2006. The workshop will be held at same location as CONCUR on August 31, 2006, one day after the main conference. The workshop tries to provide a venue where researchers and practitioners on the topics above can meet, exchange ideas and problems, identify some of the key and fundamental issues related to coordination languages and software architecture, and explore together and disseminate solutions. FOCLASA 2006 invites the submission of technical papers in any of the topics of interest and areas listed above. Submissions must describe authors? original research work and their results. Description of work-in-progress is also encouraged. The contributions should not exceed 15 pages formatted according to the style of the Electronic Notes on Theoretical Computer Science (ENTCS), and should be emailed as PostScript (PS) or Portable Document Format (PDF) files to foclasa06 at lcc.uma.es. All submissions will be reviewed by an international program committee that will select them for presentation in the workshop. Selected papers will be available through the workshop website, and a printed version of the proceedings will be distributed among participants during the workshop. The proceedings of the workshop will be published in Electronic Notes in Theoretical Computer Science (ENTCS). Participants will make a presentation of their papers (about twenty or twenty five minutes maximum), followed by a five to ten minutes round of questions and discussion on participants? work. The workshop will also include a closing panel in which several issues related to the topics of the workshop and some issues raised during the workshop will be discussed. The Panel Chair will invite the panelists and moderate the debate. The publication of a special issue on FOCLASA 2006 in an international scientific journal is also being prepared. Selected participants will be invited to submit an extended version of their papers after the workshop. These extended versions will be reviewed by an international program committee, which will decide on their final publication on the special issue. Previous editions of FOCLASA have been published on Fundamenta Informaticae and Science of Computer Programming. Topics of interest Topics of interest include (but are not limited to): * Theoretical models (coordination, component composition, concurrency, semantics, expressiveness) * Specification, refinement, and analysis of software systems (architectures, patterns and styles, verification of functional and non-functional properties) * Languages for interaction, coordination, architectures, and interface definition (implementation, interoperability, heterogeneity) * Dynamic software architectures (mobile agents, self-organizing/adaptive/reconfigurable systems) * Tools and environments for the development of applications. In particular, practice, experience and methodologies from the following areas are solicited as well: * Web Services * Multi-agent systems * Peer-to-peer systems * Grid computing * Component- based systems Program Committee Farhad Arbab, CWI, The Netherlands Luis Barbosa, University of Minho, Portugal Antonio Brogi, University of Pisa, Italy Carlos Canal (co-chair), University of M?laga, Spain Atsushi Igarashi, University of Kyoto, Japan Jean-Marie Jacquet, University of Namur, Belgium Nickolas Kavantzas, Oracle, USA Ant?nia Lopes, University of Lisbon, Portugal Ronaldo Menezes, Florida Institute of Technology, USA John-Jules Ch. Meyer, Universiteit Utrecht, The Netherlands Ernesto Pimentel, University of M?laga, Spain Pascal Poizat, University of ?vry, France Alessandro Ricci, University of Bologna, Italy Vladimiro Sassone, University of Southampton, UK Miguel Valero, Universidad Complutense de Madrid, Spain Mirko Viroli (co-chair), University of Bologna, Italy Jan Vitek, Purdue University, USA Important dates Submission: May 31, 2006 Notification of acceptance: June 30, 2006 Final version due: July 20, 2006 Workshop: August 31, 2006 Organisation Carlos Canal Universidad de M?laga ETSI Inform?tica Campus de Teatinos 29071 M?laga (Spain) Phone: +34 952 13 33 11 Fax: +34 952 13 13 97 Web: http://www.lcc.uma.es/~canal Mirko Viroli Universit? degli Studi di Bologna DEIS via Venezia 52 47023 Cesena (Italy) Phone: +39 547 339216 Fax: +39 547 339208 Web: http://www.ingce.unibo.it/~mviroli From ralf at informatik.uni-bonn.de Wed May 10 06:22:12 2006 From: ralf at informatik.uni-bonn.de (Ralf Hinze) Date: Wed, 10 May 2006 12:22:12 +0200 Subject: [TYPES/announce] 2nd CFP: Workshop on Generic Programming 2006 Message-ID: <200605101222.12268.ralf@informatik.uni-bonn.de> [The deadline is approaching: 24 days left.] ============================================================================ SECOND 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 adg at microsoft.com Wed May 10 14:59:45 2006 From: adg at microsoft.com (Andy Gordon (MSR)) Date: Wed, 10 May 2006 19:59:45 +0100 Subject: [TYPES/announce] Call for papers: 4th ACM Workshop on Formal Methods in Security Engineering (FMSE'06) Message-ID: [Type-based approaches to language-based security are welcomed by FMSE.] CALL FOR PAPERS The 4th ACM Workshop on Formal Methods in Security Engineering: >From Specifications to Code (FMSE'06) Friday Nov. 3, 2006, Johnson Center, George Mason University, Fairfax, Virginia, USA held in conjunction with the 13th ACM Conference on Computer and Communications Security (CCS'06) SCOPE Information security has become a crucial concern for the commercial deployment of almost all applications and middleware. Although this is commonly recognized, the incorporation of security requirements in the software development process is not yet well understood. The deployment of security mechanisms is often ad hoc, without a formal security specification or analysis, and practically always without a formal security validation of the final product. Progress is being made, but there remains a wide gap between high-level security models and actual code development. We aim to bring together researchers and practitioners from both the security and the software engineering communities, from academia and industry, who are working on applying formal methods to the design and validation of large-scale systems. We seek original research papers addressing foundational issues in formal methods in security engineering. Topics covered include, but are not limited to: security specification techniques; formal trust models; combination of formal techniques with semi-formal techniques such as UML; formal analyses of specific security properties relevant to software development; security-preserving composition and refinement of processes; symbolic and computational models of security protocols; integration of security aspects into formal development methods and tools; access control policies; information flow; language-based security; risk management and network security; formal analysis of firewalls and intrusion detection systems; trusted computing; and case studies. All the FMSE workshops have been co-located with CCS, with proceedings published by the ACM. FMSE 2006 is the fourth in the series. All submissions will be peer-reviewed. Authors of accepted papers must guarantee that their paper will be presented at the workshop. Final proceedings will be published by ACM. PROGRAM CHAIRS Andrew D. Gordon, Microsoft Research, UK David Sands, Chalmers University of Technology, Sweden PROGRAM COMMITTEE Michael Backes, Saarland University, Germany Jason Crampton, Royal Holloway, University of London, UK Virgil Gligor, University of Maryland, USA Andrew D. Gordon, Microsoft Research, UK Jean Goubault-Larrecq, CNRS and ENS, Cachan, France Alan Jeffrey, Bell Labs, USA Trevor Jim, AT&T Research, USA Heiko Mantel, RWTH Aachen, Germany Riccardo Pucella, Northeastern University, USA John Rushby, SRI, USA Mark Ryan, University of Birmingham, UK Pierangela Samarati, University of Milan, Italy David Sands, Chalmers University of Technology, Sweden Luca Vigan?, ETH Zurich, Switzerland Steve Zdancewic, University of Pennsylvania, USA FMSE STEERING COMMITTEE Michael Backes, Saarland University, Germany David Basin, ETH Zurich, Switzerland Michael Waidner, IBM Zurich Research Lab, Switzerland RESOURCES FMSE 2006 information: http://www.cs.chalmers.se/~dave/FMSE06 FMSE 2006 submissions: http://www.easychair.org/FMSE06/ CCS 2006: http://www.acm.org/sigs/sigsac/ccs/CCS2006 All previous proceedings: http://portal.acm.org/toc.cfm?id=SERIES11255 IMPORTANT DATES Submission deadline: Friday June 16, 2006 Author notification: Friday July 28, 2006 Camera-ready deadline: Monday August 21, 2006 CCS main conference: Monday October 30-Thursday November 2, 2006 FMSE 2006: Friday November 3, 2006 SUBMISSION GUIDELINES Submissions must be received by June 16, 2006 to be considered. If you have problems, please contact the program chairs. Submissions must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. The paper must list all authors and their affiliations. It should begin with a title, a short abstract, and a list of key words, and its introduction should summarize the contributions of the paper at a level appropriate for a non-specialist reader. The paper should be at most 12 pages excluding the bibliography and clearly marked appendices, and at most 15 pages in total, using at least 11-point font, reasonable margins, and page numbers on each page. Committee members are not required to read appendices; the paper should be intelligible without them. The document must be in Acrobat PDF format, and must be legible after printing on standard grayscale printers, both those that use A4 and those that use 8-1/2x11" paper. Submissions not meeting these guidelines risk rejection without consideration of their merits. Papers must be submitted via the electronic submission page at http://www.easychair.org/FMSE06/ From stevez at cis.upenn.edu Wed May 10 14:19:17 2006 From: stevez at cis.upenn.edu (Steve Zdancewic) Date: Wed, 10 May 2006 14:19:17 -0400 Subject: [TYPES/announce] Call for Participation: PLAS 2006 Message-ID: <44622EA5.6030803@cis.upenn.edu> Call for Participation 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 ********************************************************************** IMPORTANT: Early registration deadline is May 17, 2006 http://www.regmaster2.com/pldi2006.html ********************************************************************** We encourage you to attend the first instance of the PLAS workshop! 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 preliminary program can be found on the workshop web pages: http://www.cis.upenn.edu/~stevez/plas06.html Workshop highlights: - An invited talk by David Wagner of U.C. Berkeley "Object Capabilities for Security" - 10 paper presentations, ranging in topics from authorization and monitoring to web vulnerability detection and information-flow policies. - A "madness" session, in which any interested participants have 5 minutes to present provocative, preliminary, or unusual work. Student participation is especially encouraged. From tarmo at cs.ioc.ee Wed May 10 12:00:21 2006 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Wed, 10 May 2006 19:00:21 +0300 Subject: [TYPES/announce] MPC/AMAST 2006 2nd Call for Participation Message-ID: <20060510160228.452F8BF08F@sool.cc.ioc.ee> [MPC and AMAST both have papers on functional programming and program semantics, including types. MSFP is about mathematical structures in functional programming.] NEWS: - MSFP accepted paper list is now available. - Remember that 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. A satellite workshop of MPC, Workshop on Mathematically Structured Functional Programming, MSFP 2006 will take place 2 July. This is an official workshop of the TYPES project and researchers from TYPES sites can use funds of the project to attend. 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 MSFP invited speakers Andrzej Filinski, K?benhavns Universitet John Power, University of Edinburgh AMAST invited speakers Ralph-Johan Back, ?bo Akademi University Lawrence S. Moss, Indiana University Till Mossakowski, Universit?t Bremen MPC, MSFP and AMAST accepted paper lists and preliminary programmes 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, 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 kgl at cs.aau.dk Wed May 10 11:30:25 2006 From: kgl at cs.aau.dk (Kim G. Larsen) Date: Wed, 10 May 2006 17:30:25 +0200 Subject: [TYPES/announce] PhD positions at CISS, Aalborg, Denmark Message-ID: <44620711.7090309@cs.aau.dk> PH.D. POSITIONS CISS, AALBORG UNIVERSITY, DENMARK ================================= At the Faculty of Engineering and Science, Center for Embedded Software Systems (CISS), a number of PhD stipends are available within the border areas between electrical/electronic engineering, control theory and computer science constituted by embedded system analysis and design. Research in CISS is conducted in cooperation with a number of industrial partners as well as related international research institutions in the area. In particular CISS is core partner of the European Network of Excellence ARTIST2 and is coordinating the activities on testing and verification. Research within CISS is pursued along three directions: application, theory and methodology as well as technological platforms. Within the landscape spanned by these directions a number of focus areas are defined on the basis of industrial and academic interests: - model-based test and verification - componentbased development - scheduling and performance evaluation - network analysis - control systems and hybrid systems - safety critical systems - reliability modelling - embedded platforms (OS, languages) - intelligent sensors and sensor networks, - HW/SW codesign Ph.D. studies should have both academic and industrial relevance and therefore scholarships are simultaneously allocated to one or more of the above focus areas as well as one ore more of a number of industrial cooperation projects which have been and will be defined within the nearest future. CISS (www.ciss.dk) is a research center, which aims to strengthen the knowledge transfer between Aalborg University and the Danish industry. CISS has a total budget of DKK 63 mill. over four years. Currently there are 16 active PhD students at CISS. The new PhD stipends are available from August 1, 2006 or as soon as possible after this date. PhD stipends are normally allocated to individuals who hold a Master's degree or similar. Monthly salary is DKK 21639,- (appr. Euro 2900) plus pension. Full salary during illness is paid. Holidays according to the regulations in the Holidays with Pay Act. For further information concerning the technical aspects of the stipend, please contact: - Director, Professor Kim Guldstrand Larsen (kgl at cs.aau.dk) - Associate Professor Henrik Schi?ler (henrik at control.aau.dk) - Associate Professor Arne Skou (ask at cs.aau.dk) or - Professor Jakob Stoustrup (jakob at control.aau.dk) Application for the PhD stipends should include Diploma, publications, Curriculum Vitae, proposal for a PhD study plan and any other material as well as a list of submitted material and must be forwarded in 4 copies to address given below no later than ** June 12, 2006 ** by the morning mail. PLEASE consult the homepage of CISS (www.ciss.dk) OR one of the above contact persons for the POSITION NUMBER THAT MUST BE USED in marking your application. Aalborg University Faculty of Engineering and Science Postboks 159 DK-9100 Aalborg DENMARK -- --------------------------------------------------------------------- Kim G. Larsen Email: kgl at cs.auc.dk Director, CISS URL: www.cs.auc.dk/~kgl Professor, Computer Science Mobile: +45 22171159 Aalborg University Phone: +45 96358893 Fredrik Bajersvej 7 Fax: +45 98159889 DK-9220 Aalborg, DENMARK From P.B.Levy at cs.bham.ac.uk Thu May 11 07:27:55 2006 From: P.B.Levy at cs.bham.ac.uk (Paul B Levy) Date: Thu, 11 May 2006 12:27:55 +0100 (BST) Subject: [TYPES/announce] jumbo lambda-calculus Message-ID: ---------- Forwarded message ---------- Date: Thu, 11 May 2006 12:23:19 +0100 (BST) From: Paul B Levy To: types-announce at list.seas.upenn.edu Subject: jumbo lambda-calculus Dear all, A manuscript "Jumbo connectives in type theory and logic" is available on my webpage http://www.cs.bham.ac.uk/~pbl/papers/ The first part (on jumbo lambda-calculus) is being presented at ICALP in July. Comments are very welcome. Abstract -------- We make an argument that, for any study involving computational effects such as divergence or continuations, the traditional syntax of simply typed lambda-calculus cannot be regarded as canonical, because standard arguments for canonicity rely on isomorphisms that may not exist in an effectful setting. To remedy this, we define a ``jumbo lambda-calculus'' that fuses the traditional connectives together into more general ones, so-called ``jumbo connectives''. We provide two pieces of evidence for our thesis that the jumbo formulation is advantageous. Firstly, we show that the jumbo lambda-calculus provides a ``complete'' range of connectives, in the sense of including every possible connective that, within the beta-eta theory, possesses a reversible rule. Secondly, in the presence of effects, we see that there is no decomposition of jumbo connectives into non-jumbo ones that is valid in both call-by-value and call-by-name. Finally, we apply the concept of jumbo connectives to systems with isorecursive types (Jumbo FPC) and multiple conclusions (Jumbo LK). At each stage, we see that various connectives proposed in the literature are special cases of the jumbo connectives. From rensink at cs.utwente.nl Thu May 11 02:39:50 2006 From: rensink at cs.utwente.nl (Arend Rensink) Date: Thu, 11 May 2006 08:39:50 +0200 Subject: [TYPES/announce] 2nd CfP GT-VC 2006 (Graph Transformation for Verification and Concurrency); deadline 22 May 2006 Message-ID: <4462DC36.60007@cs.utwente.nl> [ We apologise for the reception of multiple copies. ] *************************************************************************** CALL FOR PAPERS GT-VC 2006 Second Workshop on Graph Transformation for Verification and Concurrency 31 August 2006, Bonn, Germany http://www.fmi.uni-stuttgart.de/szs/events/gtvc2006/ Satellite workshop of CONCUR 2006 27-30 August 2006, Bonn, Germany http://depend.cs.uni-sb.de/concur2006/ *************************************************************************** Aims and scope This workshop addresses the application of concurrency theory to traditional questions of semantics and verification in graph transformation, and, vice versa, the application of graph transformation to process calculi and other models of concurrency. Both areas have a rich tradition and theoretical foundations, and are finding increasing application in real-world software engineering; yet only the last few years have seen a convergence of the two fields, at several points. Areas of common interest are: * Visual specification languages and models * Behavioural semantics for visual languages * Verification and analysis techniques for graph transformation systems * Operational semantics and behavioural congruence in process calculi and graph transformation * Behaviour-preserving transformation Submissions We solicit contributions to this workshop in the form of work-in-progress descriptions (up to 5 pages) or full papers (up to 15 pages) in any of the above fields or on related topics. Please use the ENTCS format and submit your contribution in PDF. The submission works in two stages: 1. Register your paper with title, authors, abstract, etc. by May 22, 2006 2. Submit the final version until May 29, 2006 All submissions will be reviewed by the programme committee. Accepted full papers will appear in an issue of Elsevier's Electronic Notes in Theoretical Computer Science, while authors of work-in-progress papers might be given the chance to extend their articles to an ENTCS contribution. All authors will be asked to present their work during the workshop, either as a short presentation (for work-in-progress papers) or as a long presentation (for full papers). Important Dates 22 May 2006 abstract submission deadline 29 May 2006 paper submission deadline 30 June 2006 notification of acceptance or rejection 14 July 2006 final version Programme Committee * Paolo Baldan, University of Venice * Dino Distefano, Queen Mary University London * Wan Fokkink, Vrije Universiteit Amsterdam * Peter Habermehl, LIAFA, Universit? Paris 7 * Reiko Heckel, University of Leicester (co-chair) * Dirk Janssens, University of Antwerp * Barbara K?nig, University of Stuttgart (co-chair) * Ian Mackie, King's College, London * Ugo Montanari, University of Pisa * Arend Rensink, University of Twente (chair) * Vladimiro Sassone, University of Southhampton * Daniele Varacca, Imperial College London * D?niel Varr?, Budapest University of Technology and Economics Organizers * Chair: Arend Rensink, University of Twente (rensink at cs.utwente.nl) * Co-chair: Reiko Heckel, University of Leicester (reiko at mcs.le.ac.uk) * Co-chair: Barbara K?nig, University of Stuttgart (koenigba at fmi.uni-stuttgart.de) From Olivier.Roux at irccyn.ec-nantes.fr Fri May 12 10:56:42 2006 From: Olivier.Roux at irccyn.ec-nantes.fr (Olivier Roux) Date: Fri, 12 May 2006 16:56:42 +0200 Subject: [TYPES/announce] ECOOP 2006 Reminder: Early registration until may 23th. References: <4464959A.9050700@emn.fr> Message-ID: ECOOP 2006 (European Conference on Object Oriented Programming - 20th edition) July 3 -- 7, 2006, Nantes, (FRANCE) Early registration until may 23th see : http://www.emn.fr/x-info/ecoop2006/registration.html Look at http://2006.ecoop.org/ for the different news about the conference and the colocated events. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060512/4138feb5/attachment.htm From pierre.kelsen at uni.lu Mon May 15 08:37:19 2006 From: pierre.kelsen at uni.lu (Pierre Kelsen) Date: Mon, 15 May 2006 14:37:19 +0200 Subject: [TYPES/announce] Postdoc Position in Declarative Executable Modeling Message-ID: <446875FF.9010504@uni.lu> The Computer Science and Communication group within the Faculty of Sciences, Technology and Communication of the University of Luxembourg has an opening for a research assistant. RESEARCH ASSISTANT IN COMPUTER SCIENCE - 2 year contract starting on July 1 (or earliest convenience), renewable - full-time position - salary: approx. 60K Euro/ year (depending on age) The candidate will actively participate in the research project DASCOM (Declarative Approaches to Software Complexity). In the context of developing practical approaches to dealing with software complexity, this project studies a class of declarative approaches that satisfy three criteria: simplicity: the description language should be sufficiently simple so as to ease the practical adoption; graphical notation: graphical models are easier to comprehend and manipulate in general than purely textual ones; executable models: the models produced should not simply be a high-level description of lower level artifacts but rather allow actual simulation and execution. A significant part of the work will consist in analyzing and extending the recently developed EP-model that presents the above features (see: http://lassy.uni.lu/demos). Requirements: - Ph.D. in Computer Science - publications in the field of software engineering or related field - a strong theoretical background in a relevant field, eg, semantics, formal methods, model transformations ... - a good knowledge of the object-oriented and functional paradigms (knowledge of Java would be helpful) - a willingness to carry out applied fundamental research with the overall goal of making real and measurable contributions to the discipline of software development Context: The research will be carried out in the context of the Laboratory for the Advanced Software Systems (http://lassy.uni.lu), one of three labs within the Computer Science and Communication Group (http://wiki.uni.lu/csc). Application: Please send your full application (cover letter, curriculum vitae, list of publications, name of two references) before May 30th, 2006 to: Professor Pierre Kelsen University of Luxembourg Faculty of Sciences, Technology and Communication 6, rue Richard Coudenhove-Kalergi L-1359 Luxembourg-Kirchberg LUXEMBOURG email : pierre.kelsen 'at' uni.lu Office: +352 46 66 44 -5284 fax : +352 43 21 24 From Susanne.Graf at imag.fr Mon May 15 04:53:35 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Mon, 15 May 2006 10:53:35 +0200 Subject: [TYPES/announce] CALL FOR PAPERS - ATVA 2006 (Deadline Extended) Message-ID: <4468418F.4030709@imag.fr> CALL FOR PAPERS - ATVA 2006 (*Deadline Extended*) =================================================== ATVA 2006 Fourth International Symposium on Automated Technology for Verification and Analysis Beijing, China, 23-26 October 2006 http://lcs.ios.ac.cn/~atva06/ http://www-verimag.imag.fr/EVENTS/2006/ATVA/ =================================================== KEYNOTE SPEAKERS: Thomas Ball (Microsoft Research) Jin Yang (Intel Corporation) Mihalis Yannakakis (Columbia University) INVITED TUTORIALS: Three tutorials on software verification, hardware verification and the theory of verification will be given by the three keynote speakers T. Ball, J. Yang and M. Yannakakis, respectively. IMPORTANT DATES: 27 May 2006, submission deadline for abstracts (NEW DATE) 3 June 2006, submission deadline for papers (NEW DATE) 10 July 2006, acceptance notification 1 August 2006, camera-ready copy 23 October - 26 October 2006, ATVA 2006 PAPER SUBMISSION: Submission are limited to 15 pages with maximally 5000 words. Submissions must be written in English. Adherence to Springer Format in submission is preferred. Web-based submission is now available now at http://sttt.cs.uni-dortmund.de/atva06/servlet/Conference REGISTRATION: Preliminary information on registration fees is available on the symposium web-page. PUBLICATION: Following ATVA 2004 (LNCS 3299) and ATVA 2005 (LNCS 3707), the formal proceedings is to be published as a volume of LNCS, Springer-Verlag. Extended versions of selected papers on theoretical foundation and technology-transfer from the conference series will be solicited for publication in special issues of the International Journal of Foundations of Computer Science (IJFCS) (http://www.cs.ucsb.edu/~ijfcs) and of the International Journal on Software Tools for Technology Transfer (STTT) (http://sttt.cs.uni-dortmund.de). FOCUS: ATVA 2006 is the fourth in the series of symposia on Automated Technology for Verification and Analysis. The purpose of ATVA is to promote research on theoretical and practical aspects of automated analysis, verification and synthesis in East Asia by providing a forum for interaction between the regional and the international research communities and industry in the field. Submissions reporting original contributions are solicited in all areas of automated verification and analysis. SCOPE: The scope of interest is intentionally kept broad; it includes: (1) theory useful for providing designers with automated support for obtaining correct software or hardware systems, including both functional and non functional aspects, such as: theory on (timed) automata, Petri-nets, concurrency theory, compositionality, model-checking, automated theorem proving, synthesis, performance analysis, correctness-by-construction results, infinite state systems, abstract interpretation, decidability results, parametric analysis or synthesis. (2) applications of theory in engineering methods and particular domains and handling of practical problems occurring in tools, such as: analysis and verification tools, synthesis tools, reducing complexity of verification by abstraction, improved representations, handling user level notations (such as UML), practice in industry applications to hardware, software or real-time and embedded systems. Case studies, illustrating the usefulness of tools or a particular approach are also welcome. Theory papers should be motivated by practical problems and applications should be rooted in sound theory. Of particular interest are algorithms on one hand and methods and tools for integrating formal approaches into industrial practice. Special care should be taken as well to present papers in such a way that they are accessible not only to specialists, that is, jargon need to be defined and intuitive interpretation provided for theories. STEERING COMMITTEE: E.A. Emerson (University of Texas at Austin) Oscar H. Ibarra (University of California at Santa Barbara) Insup Lee (University of Pennsylvania) Doron A. Peled (University of Warwick) Farn Wang (National Taiwan University) Hsu-Chun Yen (National Taiwan University) GENERAL CHAIR: Huimin Lin (Chinese Academy of Sciences) PROGRAM CO-CHAIRS: Susanne Graf (VERIMAG) Wenhui Zhang (Chinese Academy of Sciences) LOCAL ARRANGEMENT CHAIR: Naijun Zhan (Chinese Academy of Sciences) PROGRAM COMMITTEE: Rajeev Alur (University of Pennsylvania) Christel Baier (University of Bonn) Jonathan Billington (University of South Australia) Sung-Deok Cha (Korea Advanced Inst. of Sci. and Techn.) Shing-Chi Cheung (Hong Kong Univ. of Sci. and Techn.) Ching-Tsun Chou (Intel) Jin Song Dong (National University of Singapore) E. Allen Emerson (University of Texas at Austin) Masahiro Fujita (University of Tokyo) Susanne Graf (VERIMAG) Wolfgang Grieskamp (Microsoft research) Teruo Higashino (Osaka University) Pei-Hsin Ho (Synopsys) Oscar H. Ibarra (University of California at Santa Barbara) Orna Kupferman (Hebrew University) Robert P. Kurshan (Cadence) Insup Lee (University of Pennsylvania) Xuandong Li (Nanjing University) Shaoying Liu (Hosei University) Zhiming Liu (IIST/United Nations University) Mila E. Majster-Cederbaum (University of Mannheim) Olaf Owe (University of Oslo) Doron A. Peled (University of Warwick) Zhong Shao (Yale University) Xiaoyu Song (Portland State University) Yih-Kuen Tsay (National Taiwan University) Irek Ulidowski (Leicester University) Bow-Yaw Wang (Academia Sinica) Farn Wang (National Taiwan University) Ji Wang (National U. of Techn. of China) Yi Wang (Uppsala University) Baowen Xu (Southeast University of China) Hsu-Chun Yen (National Taiwan University) Tomohiro Yoneda (Tokyo Institute of Technology) Wenhui Zhang (Chinese Academy of Sciences) Lenore Zuck (University of Illinois at Chicago) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf at imag.fr ------------------------------------------------------------------------ From zucker at cas.mcmaster.ca Fri May 12 14:53:35 2006 From: zucker at cas.mcmaster.ca (Jeffery Zucker) Date: Fri, 12 May 2006 14:53:35 -0400 (EDT) Subject: [TYPES/announce] FORMAL METHODS 2006: Call for Participation Message-ID: <200605121853.k4CIrZpk015403@birkhoff.cas.mcmaster.ca> [Apologies for multiple postings] FM'06: 14TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS August 21 - 27, 2006 McMaster University, Hamilton, Ontario, Canada http://fm06.mcmaster.ca/ CALL FOR PARTICIPATION NOTE: REGISTRATION INFORMATION IS AVAILABLE AT http://fm06.mcmaster.ca/symposium_reg.htm NOTE: THE CALLS FOR POSTERS AND TOOL DEMONSTRATIONS, AND FOR THE DOCTORAL SYMPOSIUM, ARE STILL OPEN. Deadline May 26. See http://fm06.mcmaster.ca/call_research_exhibition.htm http://fm06.mcmaster.ca/doctoral_symposium.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. INVITED SPEAKERS There are 5 distinguished invited speakers: * Ernie Cohen, Microsoft: "Validating the Microsoft Hypervisor" * Nicholas Griffin, Director, Bertrand Russell Research Centre, McMaster: "Bertrand Russell: A Philosophy for Formal Methods and a Formal Method for Philosophy" * Thomas A. Henzinger, Professor of Computer and Communication Sciences, EPFL, Switzerland: "Software Design Automation" * Peter Lindsay, Boeing Chair in Systems Engineering, University of Queensland: "Distributed Control in Network-Based Systems" * George Necula, Associate Professor in Computer Science, UC Berkeley: "Data Structure Specifications via Local Equality Axioms" TECHNICAL SYMPOSIUM: August 23 - 25 There are 36 speakers. See http://fm06.mcmaster.ca/technical_program.htm WORKSHOPS There are 4 workshops: * Formal Methods Education Workshop Saturday, August 26, 2006 * International Workshop on Formal Aspects in Security and Trust Saturday August 26 - Sunday August 27, 2006S * Workshop on Software Certification Saturday August 26 - Sunday August 27, 2006 * The Second Overture Workshop Sunday August 27, 2006 For more information, go to http://fm06.mcmaster.ca/workshops.htm TUTORIALS There are 9 full-day and half-day tutorials. See http://fm06.mcmaster.ca/tutorials.htm 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 royer at ecs.syr.edu Tue May 16 22:44:05 2006 From: royer at ecs.syr.edu (Jim Royer) Date: Tue, 16 May 2006 22:44:05 -0400 Subject: [TYPES/announce] Final Call for Papers of LCC'06 Message-ID: <200605170244.k4H2i6911742@erebus.ecs.syr.edu> CALL FOR PAPERS: 8TH INTL WORKSHOP ON LOGIC AND COMPUTATIONAL COMPLEXITY ------------------------------------------------------------------------ The Logic and Computational Complexity Workshop, LCC'06, will be held August 10-11, 2006 in Seattle, Washington, USA as a satellite workshop of the Logic in Computer Science Conference (LICS'06 and part of the 2006 Federated Logic Conference (FLoC'06). SCOPE The workshop aims at furthering an understanding of the fundamental relations between computational complexity and logic. Topics of interest include: * complexity analysis for functional languages * complexity in database theory * complexity in formal methods * complexity-theoretic type systems * computational complexity in higher types * formal methods for complexity analysis of programs * foundations of implicit computational complexity * logical & machine-independent characterizations of complexity classes * logics closely related to complexity classes * proof complexity * semantic approaches to complexity * software that applies LCC ideas FORMAT The program will consist of sessions of contributed papers, invited talks, and software demonstrations. PAPER SUBMISSION The deadline for submissions is June 12, 2006. See the workshop webpage, www.cis.syr.edu/~royer/lcc/LCC06/, for submission details. PROGRAM COMMITTEE * Georg Gottlob (University of Oxford) * Neil Immerman (University of Massachusetts, Amherst) co-chair * Russell Impagliazzo (University of California, San Diego) * Neil Jones (University of Copenhagen) * Bruce Kapron (University of Victoria) co-chair * Harry Mairson (Brandeis University) * Karl-Heinz Niggl (University of Technology, Ilmenau) * Toniann Pitassi (University of Toronto) * Thomas Schwentick (University of Dortmund) * Colin Stirling (University of Edinburgh) Important dates 12 June 2006 Submission deadline 5 July 2006 Author notification 10-11 August 2006 LCC Workshop Dates 12-15 August 2006 LICS'06 Dates WWW-pages The LCC home page: www.cis.syr.edu/~royer/lcc/ The LICS home page: www.lfcs.informatics.ed.ac.uk/lics The FLOC'06 home page: research.microsoft.com/floc06/ Contact information James S. Royer Department of Electrial Engineering and Computer Science Syracuse University Syracuse, NY 13244 USA Email: royer at ecs syr edu From Susanne.Graf at imag.fr Wed May 17 01:55:10 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Wed, 17 May 2006 07:55:10 +0200 Subject: [TYPES/announce] Call for Papers: WESE 2006 - Embedded Systems Education Message-ID: <446ABABE.8030409@imag.fr> Workshop on Embedded Systems Education WESE 2006 October 26, 2006, Seoul, South Korea Organized within EMSOFT2006 part of Embedded Systems Week http://www.it.uu.se/conf/EMSOFT06/ It is widely recognized that the embedded system domain is a multidisciplinary one, requiring a large variety of skills from control and signal processing theory, electronics, computer engineering and science, telecommunication, etc., as well as application domain knowledge. This has motivated a recent but ever growing interest in the question of educating specialists in this domain and this has also been recognized as a particularly difficult problem. After a successful first event in Jersey City, USA (2005), this second workshop on the subject aims to bring researchers, educators, and industrial representatives together to assess needs and share design, research, and experiences in embedded systems education Important Dates Paper submission: July 31, 2006 Acceptance/rejection notification: September 1, 2006 Final version: October 1, 2006 Workshop: October 26, 2006 Topics and Focus Particular topics of interest include but are not limited to: - - Industrial needs regarding embedded systems education - - Embedded systems curricular design and implementation - - Control and signal processing issues - - Computer science issues - - Real-time computing issues - - Distributed systems issues - - Architecture and design issues - - Hardware/software co-design - - Hands-on experiences and labs - - Teaching embedded systems Organizing Committee - - Jeff Jackson, The University of Alabama, USA - - Paul Caspi, Verimag-CNRS, France - - Jogesh Muppala, The Hong Kong University of Science and Technology - - Wayne Wolf, Princeton University, USA - - John K. Zao, National Chiao Tung University, Taiwan Program Committee (under construction) - - Tom Conte, North Carolina State University, USA - - Mats Daniels, Uppsala University, Sweden - - Jen Davoren, The University of Melbourne, Australia - - Jin Hyung Kim, KAIST, South Korea - - Yann-Hang Lee, Arizona State University, USA - - Kenneth G. Ricks, The University of Alabama, USA - - Chi-Sheng (Daniel) Shih, National Taiwan University Submissions Interested authors should submit a full paper (not to exceed 8 double column, single space pages) to Dr. Jeff Jackson 317 Houser Hall The University of Alabama Tuscaloosa, AL 35487-0286 Phone: (205) 348-2919 Email: jjackson at eng.ua.edu Please use the ACM SIG template in constructing your submission. It may be found at www.acm.org/sigs/pubs/proceed/pubform.doc. Electronic submission is required, preferably as a PDF attachment to an email message. Please use the subject line "WESE2006 submission" in your submission email. --------------------------------------------------------------- Paul Caspi tel : (33) 4 56 52 03 75 VERIMAG (CNRS), fax : (33) 4 56 52 03 50 2 avenue de Vignate, mailto:caspi at imag.fr F-38610 GIERES, France http://www-verimag.imag.fr/~caspi/ --------------------------------------------------------------- From patrick.baillot at lipn.univ-paris13.fr Wed May 17 16:56:15 2006 From: patrick.baillot at lipn.univ-paris13.fr (Patrick Baillot) Date: Wed, 17 May 2006 22:56:15 +0200 Subject: [TYPES/announce] Postdoc position at univ. Paris-Nord Message-ID: <20060517225615.tusrlynq78kggco8@lipn.univ-paris13.fr> ================================================== POST-DOC POSITION at University Paris-Nord ================================================== A 12-month post-doc position is available at University Paris-Nord (Univ. Paris 13, LIPN), France, within the project: New Tools for Complexity: Semantics and Types (NO-CoST) ( http://www-lipn.univ-paris13.fr/nocost/rubrique.php3?id_rubrique=5 ) This project is funded by the French national research agency (ANR) and the partner teams are LIPN and PPS. Its goal is to develop a semantic account of polynomial time computation, using game semantics, and to improve current implicit computational complexity systems for functional languages like: linear logic type systems for lambda-calculus, quasi-interpretations ... Applications of candidates with background in one/some of the following fields are welcome: - implicit computational complexity / type systems for complexity, - denotational semantics and games, - linear logic, lambda-calculus. The applicant should hold a PhD. To apply send your application (as soon as possible) including a CV, a list of publications and a statement of research, by email with subject line: "PostDoc position", to patrick.baillot'at'lipn.univ-paris13.fr or at the postal address below. Deadline for application: june 15th 2006. Suggested date of beginning: october 1st 2006. More information will be made available from: http://www-lipn.univ-paris13.fr/nocost/rubrique.php3?id_rubrique=19 Interested potential candidates can also contact Patrick Baillot (patrick.baillot'at'lipn.univ-paris13.fr). address: P.Baillot, LIPN, Univ. Paris 13, Institut Galilee, 99 av. J.-B. Clement, 93430 Villetaneuse, FRANCE. From ronchi at di.unito.it Thu May 18 03:24:09 2006 From: ronchi at di.unito.it (Simona Ronchi Della Rocca) Date: Thu, 18 May 2006 09:24:09 +0200 Subject: [TYPES/announce] Internation PhD Summer School announcement Message-ID: <813658F0-A120-4958-98A4-C542EB8690E7@di.unito.it> --------------------------------- International Ph.D. Summer School Chambery-Torino 2006 --------------------------------- Torino, August 28th -- September, 1st As in the tradition of the collaboration between the University of Savoie-Chambery and the Department of Computer Science from the University of Torino, a joint Ph.D. school will be held next summer. As in the previous editions, the school will offer two parallel tracks, sharing a first day. One of this year tracks will concern topics from the area of Theoretical Computer Science, while the other will instead concern topics from the area of Service-oriented Architectures. Courses by: Stefano Berardi (common day) Track on Theoretical Computer Science: Pierre Louis Curien Luca Paolini Rene' David Track on Service-oriented Architectures: Matteo Baldoni Giuseppe Berio Giovanna Petrone Pierluigi Plebani The school will be held in Collegno (a little town nearby Torino, easily reachable by train and by bus) and will be hosted by the Universita` Italo- Francese. The registration fee is 150 euros. Depending on the budget some grants will also be offered to a limited number of participants. Updated information as well as all the details about the courses and the registration, can be found at this URL: http://www.di.unito.it/~baroglio/SummerSchool06/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060518/4d6d5a55/attachment.htm From jsiek at osl.iu.edu Thu May 18 09:22:17 2006 From: jsiek at osl.iu.edu (Jeremy Graham Siek) Date: Thu, 18 May 2006 08:22:17 -0500 Subject: [TYPES/announce] Library-Centric Software Design 2006, Call for Papers Message-ID: <1B432901-0DCA-4536-A4BD-B4EF9AC21C88@osl.iu.edu> LIBRARY-CENTRIC SOFTWARE DESIGN - LCSD'06 http://lcsd.cs.tamu.edu/2006 Workshop, on October 22nd or 23rd (exact date TBA), 2006 at Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'06) conference in Portland, Oregon, October 22-26, 2006 CALL FOR PAPERS Libraries are central to all major scientific, engineering, and business areas, yet the design, implementation, and use of libraries are underdeveloped arts. This workshop is one of the first steps in the process of placing all aspects of libraries on a sound technical and scientific basis through research into fundamental issues and documentation of best practices. A software library is an organized collection of code with associated tools supporting programming in general or in specific domains, usually united by a specified set of principles and conventions. Most libraries are aimed for use by several people and in different environments. The areas of software library research include * Design and implementation of libraries * Program and system design based on libraries * Libraries supporting specific application domains, such as biology or banking * Evolution, refactoring, and maintenance of libraries * Empirical studies of library use * Performance of libraries, including benchmarking and library-based optimizations * Design of language facilities and tools in support of library definition and use * Validation, debugging, and testing of libraries * Extensibility, parameterization, and customization * Distribution of libraries * Specification of libraries and their semantics * Usability for library users and developers * Assessing quality of libraries * Documentation and teaching of libraries * Creating and supporting communities of library users * Using several libraries in combination We invite the submission of extended abstracts on software library research, including, but not limited to, the above list of topics. The extended abstracts should address issues important to libraries as a field, i.e., describe ideas or techniques that can be reused for libraries across problem domains and/or languages; they should refrain from merely describing a particular library, no matter how novel the choice of domain. As an additional criterion, the extended abstracts are reviewed against suitability for a journal publication of the corresponding full paper. For uniformity, authors should use the latest ACM SIGS conference style file (option 1) at http://www.acm.org/sigs/pubs/proceed/template.html. Submissions should be limited to 10 pages in this style. Accepted extended abstracts will be posted on the workshop's Web site prior to the workshop, and collected in a proceedings published as a Rensselaer Polytechnic Institute tech report. Authors of selected papers will be invited to submit a full paper for a special issue of a journal, to be announced later. IMPORTANT DATES Aug 11 Submission of extended abstracts Sep 12 Notification of acceptance Oct 10 Submission of final versions of the extended abstracts Oct 15 Final version posted on Workshop web pages Oct 22 or 23 Workshop SUBMISSION PROCEDURE For details of the electronic submission procedure, see the workshop's Web site, http://lcsd.cs.tamu.edu/2006. ORGANIZERS * Josh Bloch, Google Inc. * David Musser, Rensselaer Polytechnic Institute * Jaakko J?rvi, Texas A&M University * Sibylle Schupp, Chalmers University of Technology * Jeremy Siek, Rice University PROGRAM COMMITTEE * Dave Abrahams, Boost Consulting * Olav Beckman, Imperial College London * Herv? Br?nnimann, Polytechnic University * Cristina Gacek, University of Newcastle upon Tyne * Douglas Gregor, Indiana University * Doug Lea, State University of New York at Oswego * Andrew Lumsdaine, Indiana University * Erik Meijer, Microsoft Research * Tim Peierls, Prior Artisans LLC * Doug Schmidt, Vanderbilt University * Anthony Simons, University of Sheffield * Bjarne Stroustrup, Texas A&M University and AT&T Labs * Todd Veldhuizen, University of Waterloo In addition, the organizers will serve as program committee members, with Jaakko J?rvi and Josh Bloch as program co-chairs. Primarily, the email address lcsd06 at cs.tamu.edu should be used for questions addressed to the organizers. KEYNOTE ADDRESS There will be an invited talk by Sean Parent, Adobe Inc. WORKSHOP GOALS AND ACTIVITIES The workshop is a scientific forum for presenting original research in the design, implementation, and evaluation of software libraries. Other major activities include the identification of open questions specific to library research and the discussion of a strategic plan for establishing library research as a field. The outcome of the workshop is a combination of research contributions and specific next steps for improving the infrastructure for library research. Participants are expected to read the accepted submissions beforehand. The technical presentations, although based on the accepted papers, should not provide mere summaries of the papers. Instead, authors are encouraged to use their presentation slots (20 + 10 mins) to bring up topics for discussion. The technical presentations are mixed with scientific and organizational discussions. The discussions aim at furthering the topics of the presentations, thus their agenda will be publicly discussed among the participants and then posted on the website of the workshop. All participants are expected to come prepared with their tentative answers or thoughts. The full-day workshop starts with a keynote talk for the stimulation of discussion and concludes with a plenary discussion that decides the specific next steps for improving the infrastructure for library research. FOR MORE INFORMATION AND UPDATES please visit the workshop's Web site, http://lcsd.cs.tamu.edu/2006 From ms at informatik.uni-kiel.de Sun May 21 10:15:52 2006 From: ms at informatik.uni-kiel.de (Martin Steffen) Date: 21 May 2006 16:15:52 +0200 Subject: [TYPES/announce] 2nd Call for Participation: DisCoTec 06, Bologna, Italy (Programme online/early registration deadline approaching) Message-ID: CALL FOR PARTICIPATION +-----------------------------------------------------------------------+ | DisCoTec 06 | | | | http://www.discotec06.cs.unibo.it | | | | The federated conferences on | | | | Distributed Computing Techniques | | | | - Fmoods'06 | | - COORDINATION'06 | | - DAIS'06 | | | | Bologna, Italy, 14-16 June 2006 (plus 1 day pre-conference workshops)| +-----------------------------------------------------------------------+ News: o Conference programme now online o Early registration deadline approaching (until 31 May 2006) o for - further registration details (student 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, consult 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 Workshops: 1 day pre-conferences workshops (13 June 2006) - MTCoord'06: 2nd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems - CoOrg'06: 2nd International Workshop on Coordination and Organization ============================================================= **************************************************************** o Invited speakers for the joint event: Jan Bosch Software and Application Technologies Lab. Nokia Research Center Pierpaolo Degano Department of Computer Science Universi? di Pisa Jos? Luiz Fiadeiro Department of Computer Science University of Leicester Chris Hankin Department of Computing Imperial College Davide Sangiorgi Department of Computer Science Universit? degli Studi di Bologna **************************************************************** From cbraga at ic.uff.br Mon May 22 13:28:48 2006 From: cbraga at ic.uff.br (Christiano Braga) Date: Mon, 22 May 2006 19:28:48 +0200 Subject: [TYPES/announce] LSFA'06 - 2nd Call for papers References: <0ADFFC25-0CFB-4A52-9FCC-CFE4FD21A140@ic.uff.br> Message-ID: Brazilian Workshop on Logical and Semantic Frameworks, with Applications LSFA'06 - SECOND CALL FOR PAPERS ------------------------------------------------------------------------ NEW: INVITED SPEAKERS Joe Wells, Heriot-Watt University (http://www.macs.hw.ac.uk/~jbw/) Narciso Marti Oliet, Universidad Complutense de Madrid (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/ Mart=iacute==Oliet:Narciso.html) ------------------------------------------------------------------------ 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 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. > Invited Speakers Joe Wells School of Mathematical and Computer Sciences Heriot-Watt University Senior Research Fellow in the ULTRA group (http://www.macs.hw.ac.uk/~jbw/) Narciso Marti Oliet Facultad de Inform?tica Universidad Complutense de Madrid Head of the UCMaude group (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/ Mart=iacute==Oliet:Narciso.html) > 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 NIA-NASA (Hampton) Christiano Braga UCM (Madrid), co-chair Claude Kirchner Loria (Nancy) 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 Mart?-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 Anamaria Moreira UFRN Christiano Braga UCM, chair E. Hermann Haeusler PUC-Rio Martin Musicante UFRN, local chair Mauricio Ayala-Rincon UnB > 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 lerner at cs.ucsd.edu Tue May 23 00:06:41 2006 From: lerner at cs.ucsd.edu (Sorin Lerner) Date: Mon, 22 May 2006 21:06:41 -0700 (PDT) Subject: [TYPES/announce] POPL 07 Call for Papers Message-ID: ********************************************************************* * ACM SIGPLAN-SIGACT Symposium * * on * * Principles of Programming Languages * * * * January 17-19, 2007 * * Nice, France * * * * Call for Papers * * * * http://www.cs.ucsd.edu/popl/07 * ********************************************************************* Important dates * Submission deadline: 05:00 AM @ 15 July, 2006 EST (New York time) * Submission url: To be announced. Check the main POPL 2007 website. * Author notification: 23 Sept, 2006 * Final paper due: To be announced. Scope & Paper Categories The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. The Program Committee seeks submissions on the entire range of topics. Furthermore POPL 2007 is not limited to topics discussed at previous symposia. POPL 2007 will include a new category of short papers and short presentations. The objective is to provide authors with an opportunity to present innovative ideas (without working out a full paper) and to get feedback from a broad audience. Short papers should therefore emphasize the novelty in their submission over others. Finally the Program Committee reserves the right to accept long submissions in both categories, that is, as either regular papers or as short papers for short presentations. Authors of long submissions who don't wish to be considered for short presentations and short papers may indicate so during the submission process. Submission guidelines Due date & time: Submissions must be filed at the web site by 5:00 AM New York time 15 July 2006. Submission URL: To be announced. Check the main POPL 2007 website. Both short and long submissions should use the standard ACM SIGPLAN conference format. For detailed style guidelines, see http://www.acm.org/sigs/sigplan/authorInformation.htm The page limit for a long submissions is 12 pages; for short submissions it is 6 pages. The length limits in each category are strictly enforced. Submissions will be carried out electronically via the Web, at the URL given above. Papers must be submitted in PDF format. They must be printable on US Letter sized paper. Individuals for which this requirement is a hardship should contact the program chair at least one week before the deadline. Submitted papers must adhere to SIGPLAN's republication policy. Concurrent submissions to other journals, conferences, workshops, or similar forums of publication are not allowed. In general, 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. Authors should strive to make the technical content of their papers understandable to a broad audience. Authors of accepted papers will be required to sign the ACM copyright form. Proceedings will be published by ACM Press. Student Attendees Students who have a paper accepted for the conference are offered SIGPLAN student membership free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund. Conference Chair Martin Hoffmann Ludwig-Maximilians-Universitat Oettingenstr 67, 80538, Munich, GERMANY Program Committee Chair Matthias Felleisen College of Computer Science Northeastern University Boston, MA 02115 USA Program Committee Hans Boehm HP Laboratories Craig Chambers U Washington Patrick Cousot ENS, Paris Benjamin Goldberg NYU, New York Andy Gordon Microsoft Research, Cambridge Dan Grossman U Washington John Hatcliff Kansas State U Tom Henzinger EPFL, Lausanne Paul Hudak Yale Mark Jones Portland State University, Portland Gabriele Keller University of New South Wales Oege de Moor Oxford Eliot Moss U Massachusetts, Amherst Benjamin Pierce U Pennsylvania Jakob Rehof Universitat Dortmund Olin Shivers Georgia Tech, Atlanta Scott Smith Johns Hopkins, Baltimore Kevin Sullivan U Virginia Carolyn Talcott SRI International David Walker Princeton Affiliated Events * Declarative Aspects of Multicore Programming (DAMP) * January 16th, 2007 * Foundations of Object-Oriented Languages (FOOL) * January 20, 2007 * Partial Evaluation and Semantics-Based Program Manipulation (PEPM) * January 15-16, 2007 * Practical Applications of Declarative Languages (PADL) * January 14-15, 2007 * Programming Language Technologies for XML (PLAN-X) * January 20, 2007 * Types in Language Design and Implementation (TLDI) * January 16, 2007 * Verification, Model Checking and Abstract Interpretation (VMCAI) * January 14-16, 2007 From rvg at cs.stanford.edu Tue May 23 01:02:50 2006 From: rvg at cs.stanford.edu (Rob van Glabbeek) Date: Mon, 22 May 2006 22:02:50 -0700 (PDT) Subject: [TYPES/announce] SOS 2006 - Final Call for Papers Message-ID: <200605230502.k4N52o721661@kilby.Stanford.EDU> Final Call for Papers: Structural Operational Semantics 2006 A Satellite Workshop of CONCUR 2006 August 26, 2006, Bonn, Germany http://www.cse.unsw.edu.au/~rvg/SOS2006 Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. Moreover, it is becoming a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalisation of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the workshop is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Moreover, it aims at widening the knowledge of SOS among postgraduate students and young researchers worldwide. Specific topics of interest include (but are not limited to): * programming languages * process algebras * higher-order formalisms * rule formats for operational specifications * meaning of operational specifications * comparisons between denotational, axiomatic and SOS * compositionality of modal logics with respect to operational specifications * congruence with respect to behavioural equivalences * conservative extensions * derivation of proof rules from operational specifications * software tools that automate, or are based on, SOS. Papers reporting on applications of SOS to software engineering and other areas of computer science are welcome. History: The first SOS Workshop took place in August 2004 in London as one of the satellite workshops of CONCUR 2004, and was attended by over 30 participants [http://www.cs.aau.dk/~luca/SOS-WORKSHOP/]. The second SOS Workshop occurred in July 2005 in Lisbon as a satellite workshop of ICALP 2005, and attracted 19 submissions [http://www.cs.le.ac.uk/events/SOS2005/]. INVITED SPEAKERS: * Robin Milner (Cambridge, UK; joint invited speaker with EXPRESS 2006) * Bartek Klin (Warsaw, PL) PAPER SUBMISSION: We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should register their intention to submit a paper by uploading a title and abstract via the workshop web page by: *** Friday 26 May 2006. *** Papers should take the form of a pdf file in ENTCS format [http://www.entcs.org/], whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Submissions from PC members are allowed. Proceedings: Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the ENTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. IMPORTANT DATES: * Submission of abstract: Friday 26 May 2006 * Submission: Sunday 4 June 2006, midnight GMT * Notification: Wednesday 28 June 2006 * Final version: Friday 14 July 2006 * Workshop: Saturday 26 August 2006 * Final ENTCS version: Friday 29 September 2006. PROGRAMME COMMITTEE Rocco De Nicola (Florence, IT) Wan Fokkink (Amsterdam, NL) Rob van Glabbeek (NICTA, AU, co-chair) Reiko Heckel (Leicester, UK) Matthew Hennessy (Sussex, UK) Ugo Montanari (Pisa, IT) Peter Mosses (Swansea, UK, co-chair) MohammadReza Mousavi (Eindhoven, NL) David Sands (Chalmers, SE) Irek Ulidowski (Leicester, UK) Shoji Yuen (Nagoya, JP) CONTACT: sos2006 at cs.stanford.edu WORKSHOP ORGANISERS: Rob van Glabbeek National ICT Australia Locked Bag 6016 University of New South Wales Sydney, NSW 1466 Australia Peter D. Mosses Department of Computer Science Swansea University Singleton Park Swansea SA2 8PP United Kingdom From ajeffrey at bell-labs.com Tue May 23 09:12:37 2006 From: ajeffrey at bell-labs.com (Alan Jeffrey) Date: Tue, 23 May 2006 08:12:37 -0500 Subject: [TYPES/announce] Position In Bell Labs Security Technology Reearch Department Message-ID: <44730A45.2090300@bell-labs.com> Lucent Bell Laboratories has several openings at the level of Member of Technical Staff in its Security Technology Research department. Candidates should have a broad knowledge of computer and network security, plus experience in some of the following: foundations of computer security, language-based security, security policy languages, security of mobile processes, security protocols, information flow, formal models of cryptosystems, process calculi, type and effect systems, and static analysis. Candidates should have a PhD in computer science, mathematics or related discipline, and a record of publication in refereed journals or conferences. We are interested in creative, innovative thinkers capable of proposing new research projects. Lucent Bell Laboratories is a world-class research laboratory located in Murray Hill, New Jersey, with a satellite in Lisle, Illinois. For more information, please contact: Alan Jeffrey ajeffrey at bell-labs.com 2701 Lucent Lane, Room 9F-934 Lisle, IL 60532, USA Alan Jeffrey -- Alan Jeffrey +1 630 224 0175 Bell Labs, Lucent Technologies http://cm.bell-labs.com/who/ajeffrey/ -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/x-pkcs7-signature Size: 3296 bytes Desc: S/MIME Cryptographic Signature Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060523/ed85455a/smime.bin From floc at informatik.hu-berlin.de Tue May 23 16:06:33 2006 From: floc at informatik.hu-berlin.de (Kreutzer + Schweikardt) Date: Tue, 23 May 2006 22:06:33 +0200 Subject: [TYPES/announce] FLoC'06 -- Call for Participation Message-ID: <20060523200633.GX31348@riemann.informatik.hu-berlin.de> Call for Participation --- FLoC'06 The 2006 Federated Logic Conference Seattle, Washington, USA August 10 -- August 22, 2006 http://www.easychair.org/FLoC-06/ We are pleased to announce the fourth Federated Logic Conference (FLoC'06) to be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.easychair.org/FLoC-06/floc-hotel.html). FLoC'06 promises to be the premier scientific meeting in computational logic in 2006. The following conferences will participate in FLoC'06: CAV Conference on Computer Aided Verification (Aug 17-20) ICLP Int'l Conference on Logic Programming (Aug 17-20) IJCAR Int'l Joint Conference on Automated Reasoning (Aug 17-20) LICS IEEE Symposium on Logic in Computer Science (Aug 12-15) RTA Conference on Rewriting Techniques and Applications (Aug 12-14) SAT Int'l Conference on Theory and Applications of Satisfiability Testing (Aug 12-15) The six major conferences will be accompanied by 41 workshops, held on Aug. 10-11, 15-16, and 21-22. The FLoC'06 program includes a keynote session to commemorate the Goedel Centenary, with John Dawson and Dana Scott as speakers, a keynote talk by David Harel, plenary talks by Randy Bryant and David Dill, and invited talks by F. Bacchus, A. Blass, B. Buchberger, A. Darwiche, M. Das, J. Esparza, J. Giesl, A. Gordon, T. Hoare, O. Kupferman, M. Lam, D. Miller, K. Sakallah, J. Stoy, and C. Welty. FLoC has received an NSF grant to provide funds for travel grants of up to $750 for student attendees of FLoC'06. We expect to award about 50 grants. See application information on the website. Seattle, the Emerald city, sits on the shores of Puget Sound surrounded by mountains to the east and west. Lovely views of blue waters and snow capped peaks seem to appear everywhere - around the next bend in the road or between the buildings downtown. Seattle is the gateway to the Pacific Northwest, a premier tourist attraction. In Seattle, Mt. Rainier enchants visitors; in Vancouver, British Columbia, the Coast Range juts out over downtown; and in Portland, 5,000 acres of forestland north of the city center harbor deer, elk, and the odd bear and cougar. Online registration for FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for preferred hotel rate is June 21, 2006. Deadline for early registration is July 10, 2006. FLoC'06 Steering Committee Moshe Y. Vardi (General Chair) Thomas Ball (Conference Co-Chair) Jakob Rehof (Conference Co-Chair) Edmund Clarke (CAV) Reiner Hahnle (IJCAR) Manuel Hermenegildo (ICLP) Phokion Kolaitis (LICS) Henry Kautz (SAT) Aart Middeldorp (RTA) Andrei Voronkov (IJCAR) From rene.david at univ-savoie.fr Wed May 24 07:07:21 2006 From: rene.david at univ-savoie.fr (=?ISO-8859-1?Q?Ren=E9_David?=) Date: Wed, 24 May 2006 13:07:21 +0200 Subject: [TYPES/announce] post-doc position Message-ID: <44743E69.1020108@univ-savoie.fr> The University of Chambery proposes a post-doc position for the next academic year (from october 1-st 2006 to september 30-th 2007). The candidate must come from a foreign country. The salary is 1830 euros per month. If you want to apply for this position and work with the Logic group in Chambery, please contact david at univ-savoie.fr The fields of research of our group is : - Logic : proof theory, type theory, proof assistants, lambda-calculus, ... - Discrete mathematics : combinatorics on words, cellular automata, ... More details on our web page : www.lama.univ-savoie.fr The deadline for application is June 26-th 2006. R. David From aserebre at win.tue.nl Thu May 25 03:52:58 2006 From: aserebre at win.tue.nl (A Serebrenik) Date: Thu, 25 May 2006 09:52:58 +0200 (CEST) Subject: [TYPES/announce] Call for Participation --- ICLP'06 Message-ID: Call for Participation --- ICLP'06 Seattle, Washington, USA August 17 -- August 20, 2006 http://www.easychair.org/FLoC-06/ICLP.html or http://www.cs.uky.edu/iclp06/ A member conference of The 2006 Federated Logic Conference Seattle, Washington, USA August 10 -- August 22, 2006 http://www.easychair.org/FLoC-06/ We are pleased to announce the 22nd International Conference on Logic Programming, a member of the 4th Federated Logic Conference (FLoC'06) to be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.easychair.org/FLoC-06/floc-hotel.html). The ICLP'06 program includes a keynote talk by David Harel, plenary talks by David Dill (both general FLoC'06 events), and invited talks by Monica Lam and Chris Welty. The technical program will also include 27 regular presentations, 17 poster presentations and the traditional Prolog programming contest. Online registration for ICLP/FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for early registration is July 10, 2006. Deadline for preferred hotel rate is July 21, 2006. The registration page offers an opportunity for ICLP 2006 participants to provide a voluntary contribution of $50 to the Association for Logic Programming (ALP). We encourage every participant to consider contributing to the ALP. Association of the ICLP 2006 with FLoC'06 offers many exciting opportunities to ICLP participants as FLoC'06 promises to be the premier scientific meeting in computational logic in 2006. The following conferences will participate in FLoC'06: CAV Conference on Computer Aided Verification (Aug 17-20) ICLP Int'l Conference on Logic Programming (Aug 17-20) IJCAR Int'l Joint Conference on Automated Reasoning (Aug 17-20) LICS IEEE Symposium on Logic in Computer Science (Aug 12-15) RTA Conference on Rewriting Techniques and Applications (Aug 12-14) SAT Int'l Conference on Theory and Applications of Satisfiability Testing (Aug 12-15) The six major conferences will be accompanied by 41 workshops, held on Aug. 10-11, 15-16, and 21-22. The FLoC'06 program, in addition to the events mentioned above and directly pertaining to ICLP 2006 program, includes also a keynote session to commemorate the Goedel Centenary, with John Dawson and Dana Scott as speakers, a plenary talk by Randy Bryant, and invited talks by F. Bacchus, A. Blass, B. Buchberger, A. Darwiche, M. Das, J. Esparza, J. Giesl, A. Gordon, T. Hoare, O. Kupferman, D. Miller, K. Sakallah and J. Stoy. FLoC has received an NSF grant to provide funds for travel grants of up to $750 for student attendees of FLoC'06. We expect to award about 50 grants. See application information on the website. Seattle, the Emerald city, sits on the shores of Puget Sound surrounded by mountains to the east and west. Lovely views of blue waters and snow capped peaks seem to appear everywhere - around the next bend in the road or between the buildings downtown. Seattle is the gateway to the Pacific Northwest, a premier tourist attraction. In Seattle, Mt. Rainier enchants visitors; in Vancouver, British Columbia, the Coast Range juts out over downtown; and in Portland, 5,000 acres of forestland north of the city center harbor deer, elk, and the odd bear and cougar. Online registration for FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for preferred hotel rate is July 21, 2006. Deadline for early registration is July 10, 2006. FLoC'06 Steering Committee Moshe Y. Vardi (General Chair) Thomas Ball (Conference Co-Chair) Jakob Rehof (Conference Co-Chair) Edmund Clarke (CAV) Reiner Hahnle (IJCAR) Manuel Hermenegildo (ICLP) Phokion Kolaitis (LICS) Henry Kautz (SAT) Aart Middeldorp (RTA) Andrei Voronkov (IJCAR) -- ==================================================================== Mirek Truszczynski Dept. of Computer Science e-mail: mirek at cs.engr.uky.edu University of Kentucky http://www.cs.engr.uky.edu/~mirek Lexington, KY 40506-0046 phone: (859) 257-3961 USA fax: (859) 323-1971 ====================================================================== From zucker at cas.mcmaster.ca Thu May 25 16:14:49 2006 From: zucker at cas.mcmaster.ca (Jeffery Zucker) Date: Thu, 25 May 2006 16:14:49 -0400 (EDT) Subject: [TYPES/announce] CERTSOFT'06: Revised CFP Message-ID: <200605252014.k4PKEnnV022116@birkhoff.cas.mcmaster.ca> 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 REVISED CALL FOR PAPERS [Note New Submission Deadline: June 16] 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 ====================== Regular submissions should be no more than 15 pages and should be in PS or PDF file format. WE ESPECIALLY INVITE POSITION PAPERS, which should be no more than 10 pages. 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. DEADLINES: Original submission: June 16, 2006 Notification of acceptance: July 3, 2006 Final version submission: July 28, 2006 PROGRAM COMMITTEE ================= Stefania Gnesi, ISTI-CNR, Italy -- Co-Chair Tom Maibaum, McMaster University, Canada -- Co-Chair Rance Cleaveland, University of Maryland, USA Alessandro Fantechi, University of Florence, Italy Jan Friso Groote, Eindhoven University of Technology, The Netherlands Connie Heitmeyer, Naval Research Laboratory, USA Paola Inverardi, University of L'Aquila, Italy Yoshiki Kinoshita, CVS-AIST, Japan Dino Mandrioli, Politecnico di Milano, Italy Jonathan Ostroff, York University, Canada Shankar, SRI International, USA David von Oheimb, Siemens AG, Germany (Additional members not yet confirmed) ORGANIZING COMMITTEE (all at McMaster University, Canada) ==================== Alan Wassyng -- Chair Wolfram Kahl Mark Lawford Jeff Zucker From rensink at cs.utwente.nl Mon May 29 11:56:28 2006 From: rensink at cs.utwente.nl (Arend Rensink) Date: Mon, 29 May 2006 17:56:28 +0200 Subject: [TYPES/announce] GT-VC 2006 @ CONCUR: Deadline extension, 2 June Message-ID: <447B19AC.3080606@cs.utwente.nl> It is not too late to consider submitting your work in progress, or even a full paper, to the workshop on Graph Transformation for Verification and Concurrency! We have extended the submission deadline to June 2, 2006. See also the announcement on the workshop homepage (http://www.fmi.uni-stuttgart.de/szs/events/gtvc2006/). Yours, Barbara Koenig Arend Rensink Reiko Heckel From gerardo at ifi.uio.no Mon May 29 17:29:12 2006 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Mon, 29 May 2006 23:29:12 +0200 Subject: [TYPES/announce] PhD position in Formal Methods at the University of Oslo Message-ID: <447B67A8.2040500@ifi.uio.no> ===================================================== Apologies for multiple posting Please, pass the information to whom may be interested ===================================================== Open Position PhD position in Formal Methods The group for Precise Modeling and Analysis (PMA) at the Department of Informatics, University of Oslo, Norway, is working on formal methods, tools and languages for object- and contract-oriented software development. Our current research focus includes * object-orientation and open distributed systems * specification and verification of OO-programs * language support for openness and distribution with applications to Internet * rewriting logic * model checking and security Our research combines theoretical foundations with the goal to develop practical tools and languages to capture software adaptability. See http://www.ifi.uio.no/forskning/grupper/pma/index_e.html for more information about the group. There is one PhD position available at the group, funded by Nordunet3 (http://www.nordunet3.org/) to work on the project: *"Contract-Oriented Software Development for Internet Services"* The project comprises the following research topics: formal definition of contracts by using a timed extension of rewriting logics; the integration of contracts in a programming language being developed at the PMA-group; syntactic and semantic extension of the language with timing constraints and model checking. We are looking for candidates with relevant background in at least one of the following areas: formal modelling, semantics, timed automata, security and model checking. She/he must have a good education on theoretical aspects of computer science, including logics, or mathematics. Knowledge on open distributed systems, theory of object-orientation and/or Maude is a plus. The candidate must be willing to work both in theory and implementation (using high-level languages, e.g. Maude and model checkers). Applicants should have a BSc or MSc degree in an appropriate discipline. * The position is for 4 years and it comprises some teaching obligations. * The position is available from 1st September 2006. * Applications must be received by *June 25, 2006*. * Salary at level 42 of the Norwegian pay scale for the first year (307.100 NOK per year -approx. 39.200 Euros). This amounts to approx. 25.000 NOK (3.200 Euros) per month before taxes. Taxes depend on personal family situation; considering the standard of 30 to 35%, the salary would be about 17.500 to 16.250 NOK (approx. 2.240 to 2.080 euros) per month, after taxes. The salary increases about 10.000 NOK (before tax) per year for the second and third year. Salary includes standard Norwegian social and health insurance and contribution to retirement. Applications consists of a CV, which must include complete information about education at both bachelor and master level, documented scientific experience, and at least two academic references (name, position, e-mail and telephone number). Good knowledge of English is mandatory. All employees must satisfy the entrance requirements for the doctoral degree programme at the Faculty of Mathematics and Natural Sciences. Women are especially encouraged to apply. Applications must be submitted electronically to Prof. Olaf Owe (olaf at ifi.uio.no) with copy to Gerardo Schneider (e-mail: gerardo at ifi.uio.no). Pls write "PhD application: Nordunet3 project" as the e-mail subject when applying. Use the above e-mail addresses for any informal query about the position. ================================================================== -- Gerardo Schneider - Dept. of Informatics, Univ. of Oslo P.O Box 1080 Blindern, N-0316 Oslo, Norway Phone: +47 22 85 29 71, fax: +47 22 85 24 01 http://folk.uio.no/gerardo/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060529/b0b8f7a9/attachment.htm From icalp06 at dsi.unive.it Wed May 31 21:31:16 2006 From: icalp06 at dsi.unive.it (ICALP 2006) Date: Thu, 01 Jun 2006 03:31:16 +0200 Subject: [TYPES/announce] ICALP / PPDP / LOPSTR 2006 - 2nd call for participation Message-ID: <447E4364.6030406@dsi.unive.it> *** Apologies for multiple copies *** _______________________________________________________________________ ICALP/PPDP/LOPSTR'06 - CALL FOR PARTICIPATION *** NEW EARLY EEGISTRATION DEADLINE: JUNE 10 *** July 9-16 2006, Venice, Italy ____________________________________________________________________ IMPORTANT DATES *************** * Early Registrations (EXTENDED) June 10, 2006 * Joint Conferences: July 9 - 16, 2006. INVITED SPEAKERS ****************** * Cynthia Dwork (Microsoft Research, Silicon Valley, USA) * Massimo Marchiori (University of Padova) * Alon Noga (Tel Aviv University, Israel) * Prakash Panangaden (McGill University, Canana) * Simon Peyton Jones (Microsoft Research, Cambridge, UK) * Shaz Qadeer (Microsoft Research, Redmond, USA) * Vladimiro Sassone (University of Southampton) SCIENTIFIC PROGRAM ****************** Full details available at: http://icalp06.dsi.unive.it/ http://www.dsi.unive.it/lopstr2006/ http://www.dsi.unive.it/ppdp2006/ From skalka at cs.uvm.edu Thu Jun 1 10:33:51 2006 From: skalka at cs.uvm.edu (Christian Skalka) Date: Thu, 01 Jun 2006 10:33:51 -0400 Subject: [TYPES/announce] Posdoctoral Research Position at University of Vermont Message-ID: <003c01c68588$682ace00$2802a8c0@Pers> ================================================== POSTDOCTORAL RESEARCH POSITION IN COMPUTER SCIENCE The University of Vermont, USA ================================================== Location: Department of Computer Science, The University of Vermont (UVM), Burlington, Vermont, USA. http://www.cs.uvm.edu http://www.uvm.edu http://www.ci.burlington.vt.us Job Description: We are seeking a qualified postdoctoral research assistant for ongoing projects in the foundations of computer security. Our current research has two main thrusts. The first is type-and-effect analysis for enforcing temporal safety properties in software as a form of programming language based security. The second is the use of formalisms and programming logics to specify and implement distributed trust management (authorization) systems for applications such as web services. More information about these projects and associated publications are available online: http://www.cs.uvm.edu/~skalka/skalka-pubs/skalka-projects.html Research will be conducted in the context of larger projects being carried out by the Distributed Systems Group: http://www.cs.uvm.edu/research/distrsys This position is funded by a grant from the Department of Defense (DoD), Air Force Office of Scientific Research (AFOSR). Duration: 1 year, with possible extensions, beginning as soon as possible after August 15, 2006. Inquiries: Please direct questions to Christian Skalka, skalka at cs.uvm.edu. Requirements: Applicants should have or be sufficiently near completion of a PhD, and have a background (including published work) in topics relevant to the projects described above. To Apply: Please send cv, statement of research, and contact information for 2 references by July 15, 2006, to (email is preferable): Christian Skalka Department of Computer Science University of Vermont 33 Colchester Ave. Burlington, VT 05405 skalka at cs.uvm.edu http://www.cs.uvm.edu/~skalka From jbw at macs.hw.ac.uk Thu Jun 1 11:37:45 2006 From: jbw at macs.hw.ac.uk (Joe Wells) Date: Thu, 01 Jun 2006 16:37:45 +0100 Subject: [TYPES/announce] PhD Studentships: Logics, Types, & Rewriting for Software & Mathematics @ Heriot-Watt, Scotland, UK Message-ID: <874pz4ubsm.fsf@colinux.macs.hw.ac.uk> Ph.D. Student Positions ULTRA group (Useful Logics, Types, Rewriting, and their Automation) Computer Science Department School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh, Scotland, UK The HTML version of this posting can be found at: http://www.macs.hw.ac.uk/~jbw/phd-student-ad.html Description of the Positions Several Ph.D. student positions are available in areas involving research into the theories of logics, types, and rewriting and their applications in reasoning about computer systems and mathematics. The positions are at Heriot-Watt University[1] in the ULTRA (Useful Logics, Types, Rewriting, and their Automation) group[2] in the Computer Science Department[3] in the School of Mathematical and Computer Sciences[4] at Heriot-Watt University in Edinburgh[5], the capital of Scotland[6]. The Ph.D. supervisors will be either Fairouz Kamareddine[7] and/or Joe Wells[8]. Possible specific research topics include further development of any one of the following: * The Poly*[9] polymorphic retargetable type system for process and mobility calculi, aimed at the goal of supporting modular reasoning and compositional analysis for systems involving mobility and concurrency (such systems can include combinations of hardware, software, people, etc.). * The MathLang[10] framework for computerizing mathematical text where the computerization remains as close as possible to the original language in which the mathematical text was written, and yet acts as a formal structured style which can be used in mathematical software systems (e.g., computer algebra systems, theorem provers, etc.). * The idea of Expansion[11] as a fundamental organizing principle for obtaining flexible and compositional polymorphic type inference for computer software. * The use of Type Error Slicing[12] as a superior user interface for explaining type errors to users of new programming languages with advanced (and complicated!) type systems. * Any other reasonable idea which builds on work we have already started. It will be helpful to have interests (or possibly even competence) in 1 or more of the following background knowledge areas: * Formal calculi for reasoning about the meaning of systems (including computer programs) such as the lambda calculus, the pi calculus, and the numerous other calculi they have inspired that deal with aspects of concurrency, mobility, modules, components, linking & loading, resource usage, staged compilation, classes & objects, etc. * Methods for analyzing specific systems (e.g., specific computer programs) represented by individual terms of such formal calculi. * Formal calculi for representing mathematical texts, including those aspects related to how actual practicing mathematicians (i.e., not mathematical logicians) construct and present mathematics. * Type systems for the kinds of formal calculi mentioned above, especially those with features similar to intersection, union, dependent, and singleton types. * Rewriting theories, especially those with higher-order features (the lambda calculus is the canonical example, but this also includes higher-order rewriting (HOR), systems with explicit substitutions, combinators, etc.). * Constraint solving and unification. * Programming languages especially suitable for use for any of the above. The usual duration of Ph.D. studentships in the UK is 3 years. The positions are available immediately. The Ph.D. students will probably collaborate on 1 or more of the following activities. The specific activities will be matched to their strengths. * Designing languages/calculi for representing various aspects of such things as computer programs, concurrent systems, mathematical texts, etc. * Developing theories for reasoning about such a calculus as a whole as well as individual terms written in the calculus. * Developing new type systems for such calculi with useful properties. * Developing analysis algorithms for the new type systems. * Proving various properties of the above items. * Making software systems incorporating the new calculi, theories, type systems, and algorithms. * Publishing scientific reports on the work done. References 1. http://www.hw.ac.uk/ 2. http://www.macs.hw.ac.uk/ultra/ 3. http://www.macs.hw.ac.uk/cs/ 4. http://www.macs.hw.ac.uk/ 5. http://www.geo.ed.ac.uk/home/tour/edintour.html 6. http://www.geo.ed.ac.uk/home/scotland/scotland.html 7. http://www.macs.hw.ac.uk/~fairouz/ 8. http://www.macs.hw.ac.uk/~jbw/ 9. http://www.macs.hw.ac.uk/DART/software/PolyStar/ 10. http://www.macs.hw.ac.uk/~fairouz/talks/talks2005/mathlang-general-talk.pdf 11. http://www.macs.hw.ac.uk/~jbw/papers/#Car+Wel:ITRS-2004 12. http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/ Contact Information Inquiries can be directed to Fairouz Kamareddine at: web: http://www.macs.hw.ac.uk/~fairouz/ e-mail: fairouz at macs.hw.ac.uk fax: +44 131 451 8179 Inquiries can be directed to Joe Wells at: web: http://www.macs.hw.ac.uk/~jbw/ e-mail: jbw at macs.hw.ac.uk fax: +44 131 451 8179 Applying for the Positions Please contact Fairouz Kamareddine and/or Joe Wells for full details on how to apply. We will want to see your curriculum vitae, as well as 2 (or even 3 if possible) recommendation letters (preferably written by people familiar with your academic and research abilities, but a letter from an industry source is better than no letter at all). We will expect recommendation letters to be sent directly by their authors and will need contact details for the letter authors. You should probably already have a master's degree or equivalent experience. It can be helpful to write a brief statement about why your research interests are a good match for the ULTRA group. If you already have research publications (this is not required), it can be helpful to send 1 (or even 2) of them. There will also be official Heriot-Watt application forms to fill out. Please convert Microsoft Word documents to a public, standard, and non-proprietary format. PDF is good, plain text is good, LaTeX is okay (if using only standard packages), HTML is okay (if not generated by Microsoft Word), PostScript is sometimes okay, Open Document format is undesirable, Microsoft Word format will not be accepted. For your information, it is helpful if writers of recommendation letters provide details of: * the capacity in which they know the candidate, * the candidate's skills, abilities and performance in relation to the post applied for, * the candidate's record including details of the candidate's role(s) and service dates, * their view of the candidate's suitability for the post as a whole, in light of the attached details and their knowledge of the candidate's experience and abilities, * any further relevant information which would assist us in choosing the right candidate. From afelty at site.uottawa.ca Thu Jun 1 22:51:10 2006 From: afelty at site.uottawa.ca (Amy Felty) Date: Thu, 1 Jun 2006 22:51:10 -0400 (EDT) Subject: [TYPES/announce] PCC 2005 Submission Deadline Extended to June 9 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 9 June 2006 **** NEW **** Notification 18 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 mgradina at irisa.fr Thu Jun 1 13:19:24 2006 From: mgradina at irisa.fr (Maria Gradinariu) Date: Thu, 1 Jun 2006 19:19:24 +0200 Subject: [TYPES/announce] [CFP] Symposium on Stabilization, Safety, and Security of, Distributed Systems (SSS 2006) Message-ID: <003101c6861f$d2643ad0$d50afe83@irisa.fr> [Please accept our apologies if you receive multiple copies of this message.] Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (formerly Symposium on Self-stabilizing Systems) (SSS 2006) November 17th-19th, 2006 Dallas, Texas, USA http://www.irisa.fr/sss/2006/ ============================================================================== Selected papers will be published in a special issue of the ACM Transactions on Autonomous and Adaptive Systems (TAAS). ============================================================================== ============================================================================== Important Dates Paper Submission: July 7th, 2006 Notification to Authors: August 21st, 2006 Camera-ready: August 31st, 2006 Symposium: November 17th-19th, 2006 ============================================================================== The Symposium is a prestigious international forum for researchers and practitioners in the design and development of fault-tolerant distributed systems with self-* properties, such as self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. The theory of self-stabilization has been enriched in the last 25 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-* properties in fault-tolerant distributed systems. Research in distributed systems is now at a crucial point in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. Now, more than ever, the theory of self-stabilization has tremendous impact in these areas. Therefore, this year, we are extending the scope of the symposium to cover all safety and security related aspects of self-* systems. The title of the conference has been changed to reflect this expansion. There will be three tracks: networking, safety and security, and self-* properties in static and dynamic systems. The symposium solicits contributions on all aspects of self-stabilization, safety and security, recovery oriented systems and programing, from theoretical contributions, to reports of the actual experience of applying the principles of self-stabilization to static and dynamic systems. Topics of interest include, but are not limited to: Stabilization: - self-stabilizing systems - self-managed, self-assembling, autonomic and adaptive systems - self-optimizing and self-protecting systems - self-* abstractions for implementing fundamental services in static and dynamic distributed systems - impossibility results and lower bounds for self-* systems - application of stabilizing algorithms and techniques in dynamic distributed systems - data and code stabilization - algorithms for self-* error detection/correction Safety: - safety critical systems - trust models and specifications - semantics of trust, distrust, mistrust, over-trust, cheat, risk and reputation - trust-related security and privacy - reliable and dependable systems - fault-tolerant systems, hardware redundancy, robustness, survivable systems, failure recovery Security: - security of network protocols - security of sensor and mobile networks protocols - secure architectures, frameworks, policy, intrusion detection/awareness - proactive security - self-* properties and their relation with classical fault-tolerance and security - security protocols for self-* systems Networks and Applications: - models of fault-tolerant communication - stochastic, physical, and biological models to analyze self-* properties - communication complexity - data structures for efficient communication - self-stabilizing hardware, software, and middleware - algorithms for high-speed networks, sensors, wireless and robots networks - mobile agents - peer-to-peer networks, sensor networks, MANETs, and wireless mesh networks - network topologies, overlays, and protocols - protocols for secure and reliable data transport and search in wireless mesh networks - information storage and sharing in wireless mesh networks Contributors are invited to submit a PDF file of their paper. Submissions should be no longer than 4800 words and should not exceed 12 pages on letter-size paper using at least 11 point font and reasonable margins (the page limit includes all figures, tables, and graphs). Submissions should include a cover page (that does not count towards the 12 page limit) that includes paper title, authors and affiliations, contact author's e-mail address, an abstract of the work in a few lines, and a few keywords. Submitted papers may have appendices beyond the 12 page limit, but reviewers are free to disregard any material beyond the 12 page limit. A paper submitted to SSS 2006 is expected to be original research not previously published; a submission may not be concurrently submitted or to any other conference, workshop, or journal. The proceedings of the conference will be published in the Springer Verlag Lecture Notes in Computer Science (LNCS) series. Selected papers will be published in a special issue of the ACM Transactions on Autonomous and Adaptive Systems (TAAS). General Chair: Mohamed Gouda, University of Texas at Austin, USA, gouda at cs.utexas.edu Program Co-chairs: Ajoy K Datta University of Nevada Las Vegas, USA, datta at cs.unlv.edu Maria Gradinariu, IRISA, France, mgradina at irisa.fr Local Arrangements Chair: Jorge Cobb, University of Texas at Dallas, USA, cobb at utdallas.edu Ravi Prakash, University of Texas at Dallas, USA, ravip at utdallas.edu Publicity and Web Chair: Florent Claerhout, IRISA, France, fclaerho at irisa.fr Steering Committee: Anish Arora, Ohio State University, USA, anish at cse.ohio-state.edu Ajoy K. Datta, University of Nevada Las Vegas, USA, datta at cs.unlv.edu Shlomi Dolev, Ben-Gurion University of the Negev, Israel, dolev at cs.bgu.ac.il Sukumar Ghosh, Chair, University of Iowa, USA, ghosh at cs.uiowa.edu Mohamed G. Gouda, University of Texas at Austin, USA, gouda at cs.utexas.edu Ted Herman, University of Iowa, USA, ted-herman at uiowa.edu Shing-Tsaan Huang, National Central University, Taiwan, sthuang at csie.ncu.edu.tw Toshimitsu Masuzawa, Osaka University, Japan, masuzawa at ist.osaka-u.ac.jp Vincent Villain, Universie de Picardie, France, villain at laria.u-picardie.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060602/7ab13ad0/attachment.htm From urzy at mimuw.edu.pl Fri Jun 2 12:58:44 2006 From: urzy at mimuw.edu.pl (Pawel Urzyczyn) Date: Fri, 2 Jun 2006 18:58:44 +0200 Subject: [TYPES/announce] MFCS 2006 accepted papers Message-ID: <200606021658.k52Gwiw24943@absurd.mimuw.edu.pl> MFCS 2006 - accepted papers Viliam Geffert. Magic Numbers in the State Hierarchy of Finite Automata Pascal Koiran and Sylvain Prifel. Valiant's model: from exponential sums to exponential products Rodrigo Leo and Valmir Barbosa. Minimal Chordal Sense of Direction and Circulant Graphs Petr Hlineny. On Matroid Representability and Minor Problems Yury Lifshits and Markus Lohrey. Querying and Embedding Compressed Texts Linh Anh Nguyen. The Data Complexity of MDatalog in Basic Modal Logics Sergey Goncharov, Lutz Schrder and Till Mossakowski. Completeness of Global Evaluation Logic Lance Fortnow and Mitsunori Ogihara. Very Sparse Leaf Languages Christian Glasser and Stephen David Travers. Machines that can Output Empty Words Johanne Cohen, Fedor Fomin, Pinar Heggernes, Dieter Kratsch and Gregory Kucherov. Optimal Linear Arrangement of Interval Graphs Marcin Kik. Sorting Long Sequence in a Single Hop Radio Network Peter Jonsson and Gustav Nordh. Generalised Integer Programming Based on Logically Defined Relations F. Blanchet-Sadri, D. Dakota Blair and Rebeca V. Lewis. Equations on Partial Words Martin Kutrib and Andreas Malcher. Fast Iterative Arrays with Restricted Inter-Cell Communication: Constructions and Decidability Fredrik Kuivinen. Approximability of Bounded Occurrence Max Ones Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide and Christian Schindelhauer. Smart Robot Teams Exploring Sparse Trees Sorin Constantinescu and Lucian Ilie. The Lempel--Ziv complexity of fixed points of morphisms Richard Beigel, William Gasarch and James Glenn. The Multiparty Communication Complexity of Exact-T Xiaoyang Gu and Jack H. Lutz. Dimension Characterizations of Complexity Classes Anna Gal and Vladimir Trifonov. On the Correlation Between Parity and Modular Polynomials Refael Hassin, Jerome Monnot and Danny Segev. Approximation Algorithms and Hardness Results for Labeled Connectivity Problems Giuseppe Persiano and Ivan Visconti. On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model Christopher Homan and Lane A. Hemaspaandra. Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners Jianer Chen, Iyad kanj and Ge Xia. Improved Parameterized Upper Bounds for Vertex Cover A.N. Trahtman. An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture Alessandra Savelli and Jean Berstel. Crochemore factorization of Sturmian and other infinite words Michael Domaratzki and Kai Salomaa. Lower Bounds for the Transition Complexity of NFAs Andre Gronemeier. NOF-Multiparty Information Complexity Bounds for Pointer Jumping Alessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz and Brunetto Piochi. A Combinatorial Approach to Collapsing Words Alexander Kostin. A Reachability Algorithm for General Petri Nets Based on Transition Invariants Guillaume Malod and Natacha Portier. Characterizing Valiant's algebraic complexity classes Adele Rescigno and Luisa Gargano. Optimally Fast Data Gathering in Sensor Networks Beat Gfeller, Leon Peeters, Birgitta Weber and Peter Widmayer. Online Single Machine Batch Scheduling VIkraman Arvind and Piyush P Kurur. A Polynomial Time Nilpotence Test for Galois Groups and Related Results Francois Le Gall. Quantum Weakly Nondeterministic Communication Complexity Tomasz Jurdzinski. Probabilistic Length-Reducing Automata Volker Diekert, Markus Lohrey and Alexander Miller. Partially commutative inverse monoids Sasanka Roy, Arindam Karmakar, Sandip Das and Subhas C. Nandy. Constrained Minimum Enclosing Circle with Center on a Query Line Segment Norbert Dojer. A polynomial-time algorithm for learning Bayesian networks from data Slawomir Lasota and Wojciech Rytter. Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes Arturo Carpi. On the repetition threshold for large alphabets Wael El-Oraiby and Dominique Schmitt. $k$-sets of convex inclusion chains of planar point sets Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann and Csaba D. Toth. On Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles Martin Hoefer. Non-cooperative Tree Creation Guillaume Theyssier, Victor Poupet and Laurent Boyer. On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures Qi Cheng. On comparing sums of square roots of small integers Angelo Fanelli, Michele Flammini, Giovanna Melideo and Luca Moscardelli. Multicast Transmissions in Non-Cooperative Networks with a Limited Number of Selfish Moves Ulrik Brandes and Juergen Lerner. Coloring Random 3-Colorable Graphs with Non-Uniform Edge Probabilities Pablo Arrighi. Algebraic characterizations of unitary one dimensional quantum cellular automata Aris Pagourtzis and Stathis Zachos. The Complexity of Counting Functions with Easy Decision Version Damian Wojtowicz and Jerzy Tiuryn. On genome evolution with innovation Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum and Jorg Sack. Approximate Shortest Path Queries on Weighted Polyhedral Surfaces Kazuo Iwama and Hiroki Morizumi. Reductions for Monotone Boolean Circuits Yoram Hirshfeld and Alexander Rabinovich. An Expressive Temporal Logic for Real Time Ondrej Klima, Benoit Larose and Pascal Tesson. Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture Rahul Tripathi. Hierarchical Unambiguity Cyril Allauzen and Mehryar Mohri. A Unified Construction of the Glushkov, Follow, and Antimirov Automata Maria Lopez-Valdes. Lempel-Ziv Dimension for Lempel-Ziv Compression Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou, Anna Philippou and Paul Spirakis. The Price of Defense rene peralta and Joan Boyar. Concrete multiplicative complexity of symmetric functions Robert Elsaesser. Toward the Eigenvalue Power Law Arnaud Carayol and Didier Caucal. The Kleene equality for graphs ----------------------------------------------------------------- From selinger at mathstat.dal.ca Mon Jun 5 08:56:46 2006 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Mon, 5 Jun 2006 09:56:46 -0300 (ADT) Subject: [TYPES/announce] QPL 2006 Call for Participation, Student Support Message-ID: <20060605125646.B9A4A10855@sigma.mathstat.dal.ca> [Several of the talks in this workshop involve type systems for quantum computing. Hence I hope that this announcement is of interest to the types community. -PS] CALL FOR PARTICIPATION 4th International Workshop on Quantum Programming Languages (QPL 2006) July 17-19, 2006, Oxford (held in conjunction with CKC, "Cats, Kets, and Cloisters") http://www.mathstat.dal.ca/~selinger/qpl2006/ * * * NEW: * list of accepted papers * available support for UK-based PhD students (deadline June 20) OVERVIEW: 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. Topics of interest 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). LIST OF ACCEPTED PAPERS: B. Coecke, "Axiomatic description of mixed states from Selinger's CPM construction" B. Coecke, E.O. Paquette, "POVMs and Naimark's theorem without sums" Y. Delbecque, "A Quantum Game Semantics for the Measurement Calculus" A. Di Pierro, H. Wiklicky, "Semantic Abstraction and Quantum Computation (Extended Abstract)" A.S. Green, T. Altenkirch, "From reversible to irreversible computations" P. Jorrand, S. Perdrix, "A Quantum Calculus (Work in Progress)" M. Lampis, K.G. Ginis, N.S. Papaspyrou, "Quantum Data and Control Made Easier" P. Selinger, "Idempotents in dagger categories" P. Selinger, B. Valiron, "On a fully abstract model for a quantum linear functional language" J.K. Vizzotto, A.C. da Rocha Costa, A. Sabry, "Quantum Arrows in Haskell" GRADUATE STUDENT SUPPORT: (Deadline June 20) A limited amount of financial support is available to support the participation of UK-based PhD students in the workshop. Students wishing to apply for this money should write to Simon Gay by June 20, and include the following information: 1. A brief statement of your background as well as why you are interested in attending the conference. 2. Describe any other sources of funding available for you to attend. 3. An email letter of reference from your supervisor or an appropriate other person. TUTORIALS: The workshop will include a number of invited tutorials and survey talks. One set of tutorials will be given by Sam Lomonaco; more details and additional speakers will shortly be announced on the workshop website, http://www.mathstat.dal.ca/~selinger/qpl2006/ PROCEEDINGS: The workshop proceedings will be published in Electronic Notes in Theoretical Computer Science (ENTCS). A printed copy of the preliminary proceedings will be distributed to participants at the workshop. REGISTRATION AND TRAVEL: Please register through the CKC website. There is a small workshop fee covering proceedings and coffee breaks. The website also includes hints on travel and accommodation. http://se10.comlab.ox.ac.uk:8080/FOCS/CKCinOXFORD_en.html. IMPORTANT DATES/DEADLINES: Corrected papers for proceedings: June 16, 2006 Application for student funding: June 20, 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 June 5, 2006) From soloviev at irit.fr Mon Jun 5 17:30:09 2006 From: soloviev at irit.fr (Sergei SOLOVIEV) Date: Mon, 5 Jun 2006 23:30:09 +0200 Subject: [TYPES/announce] ph.d. studentship Message-ID: <200606052330.09433.soloviev@irit.fr> At University Paul Sabatier (Toulouse-3), Toulouse, France a ph.d. studentship is available. There is no restrictions concerning nationality, but there is an age limit ( no more than 25 ans in 2006.) Please, notice very short delay: - applications before 20.06 - interview 23.06 contact: soloviev at irit.fr Theme: The categories with structure including distinguished functors and natural transformations (subject to certain identities) are considered, such as the Symmetric Monoidal Closed Categories with tensor $\otimes$ and hom-functor as distinguished functors, associativity and commutativity of $\otimes$ etc. The "critical mass" of theoretical results concerning the commutativity of diagrams in such categories demands the development of adequate computer support and software. The software should contain certain automated and interactive verification procedures, in particular automated procedures using the algorithms that are already known and interactive procedures for extraction of consequences of particular properties of concrete categories (e.g., categories of modules). The theme is closely connected with proof theory and commutative algebra. The competences in programming are required. It is possible also that the ph.d. student will obtain new mathematical results in addition to programming part. (Advisers: Sergei Soloviev, Mark Spivakovsky) -- Sergei SOLOVIEV From ostermann at informatik.tu-darmstadt.de Tue Jun 6 09:46:29 2006 From: ostermann at informatik.tu-darmstadt.de (Klaus Ostermann) Date: Tue, 6 Jun 2006 15:46:29 +0200 Subject: [TYPES/announce] PhD / Research Assistant Positions at TUD/Darmstadt Message-ID: <00d401c6896f$9cd137d0$63a55382@rachmaninoff> =========================================== PhD / Research Assistant Positions Computer Science Department Darmstadt University of Technology, Germany =========================================== Description of the Positions Several Ph.D. student positions are available in areas involving research in aspect-oriented programming, domain-specific languages, model-driven development, and feature-oriented programming. It will be helpful to have a background in one or more of the following knowledge areas: * Aspect-Oriented Programming, in particular areas such as language design and implementation * Advanced module constructs such as mixins, traits, virtual classes, or type classes * Feature-oriented programming * Architecture and language design for software product lines * Model-driven development and code generators * Domain-specific languages, in particular embedded domain-specific languages * Formal type systems The usual duration of Ph.D. studentships in Germany is 3 years. Some of the positions are available immediately; others are available in October '06. Please indicate in your application when you could start. Speaking German is not a prerequisite, but the applicant should be willing to learn German once he is appointed. Remuneration will be according to age and qualification, following the German public service payment scheme (BAT IIA). The exact salary depends on various factors, but typically the net salary (after all deductions including social insurances) is about 1700 Euro per month. Contact Information Inquiries can be directed to Klaus Ostermann, see www.aop.informatik.tu-darmstadt.de/staff/Ostermann/ for contact details. Applying for the Positions: GENERIC "DEAR SIR/MADAM"-STYLE APPLICATIONS WILL NOT BE CONSIDERED. If you want to apply, please tell us about your research experience and how it relates to the topics we are interested in. What have you done in this direction (e.g., in a masters thesis), which works did you read and have been influenced by, what are your ideas? If you already have research publications (this is not required) or a masters thesis in one of the areas we are interested in, it can be helpful to include them in your application. Please also include in your application a CV and copies of degree certificates. From kurz at mcs.le.ac.uk Tue Jun 6 13:03:04 2006 From: kurz at mcs.le.ac.uk (Alexander Kurz) Date: Tue, 06 Jun 2006 18:03:04 +0100 Subject: [TYPES/announce] Call for Participation Message-ID: <4485B548.3060204@mcs.le.ac.uk> Call for Participation Workshop on Modal Logic, Stone Duality, Coalgebras June 12-13 2006 Leicester, UK http://www.cs.le.ac.uk/events/ml06/ From einarj at ifi.uio.no Wed Jun 7 08:41:23 2006 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Wed, 07 Jun 2006 14:41:23 +0200 Subject: [TYPES/announce] 3 PhD positions in Formal Methods at University of Oslo Message-ID: <1149684083.7816.34.camel@localhost.localdomain> ===================================================== With apologies for multiple postings ===================================================== 3 Open PhD Positions in Formal Methods at the group for Precise Modeling and Analysis (PMA) at the Department of Informatics, University of Oslo, Norway. Two positions are part of an EU project (Credo) and one is part of a Nordunet project. See the PMA homepage http://www.ifi.uio.no/forskning/grupper/pma/index_e.html for more information. Best regards, Einar Broch Johnsen From Laurent.Vigneron at loria.fr Wed Jun 7 11:00:08 2006 From: Laurent.Vigneron at loria.fr (Laurent Vigneron) Date: Wed, 7 Jun 2006 17:00:08 +0200 Subject: [TYPES/announce] Last CFP: International School on Rewriting Message-ID: <17542.59896.840026.988269@valhey.loria.fr> ********************************************************************** ** Last Call for Participation ** ** ** ** International School on Rewriting ** ** ** ** ISR'2006, July 3-7, 2006 ** ** Nancy, France ** ** http://isr2006.loria.fr/ ** ********************************************************************** Deadline for *** late registration ***: June 23rd, 2006. ---------------------------------------------------------------------- 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 Gilles Dowek, Ecole Polytechnique & INRIA, France Thomas Genet, Universite de Rennes I & IRISA, France Juergen Giesl, Aachen University, Germany Denis Lugiez, Universite de Provence, France Christopher Lynch, Clarkson University, USA 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), chair * 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) ---------------------------------------------------------------------- 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 herman at cs.ru.nl Thu Jun 8 14:19:17 2006 From: herman at cs.ru.nl (Herman Geuvers) Date: Thu, 08 Jun 2006 20:19:17 +0200 Subject: [TYPES/announce] Post Doc position Radboud University Nijmegen Message-ID: <44886A25.4080903@cs.ru.nl> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Radboud University Nijmegen - Institute for Computing and Information Science One 3 year post-doc position in the NWO-sponsored project ARPA: Advancing the Real use of Proof Assistants ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ We are seeking one researcher at the level of Postdoc for a period of three years, starting from September 1 2006 Candidates should have - Good knowledge of at least one and preferably more of the following fields: Hybrid Systems, Formal Methods, Proof Assistants and Automated Reasoning. - A finished PhD in computer science, mathematics or logic Description of the project -------------------------- Proof Assistants help the user in developing a theory (stating definitions and lemmas), modelling systems (describing constructions, giving definitions) and verifying properties about these systems (giving proofs). So, Proof Assistants are very generic tools to support Formal Methods. Their genericity makes them less efficient than tools that are especially geared towards a specific formal method. On the other hand they have a very precise semantics, which makes a the certainty of a result that is verified by a Proof Assistant very high. This is especially the case for PAs that are able to produce "proof objects" that can be checked independently. In the future, the very high level of certainty will prevail. In this project we want to advance the use of PAs in several ways: (1) by developing a "mathematical input mode" for PAs, making theme more easy to use, (2) integration of different PAs, allowing the exchange of results, (3) developing a certified library for real number computation in Coq, (4) verifying hybrid systems in Coq, using the library of (3) to model and verify system properties. The quality of (3) will be judged by its applicability to (4), but (2) and (3) will also be judged by its applicability to the formalisation of the proof of Kepler's conjecture. For detailed information see the full project proposal. It will be sent to you on request (email to herman at cs.ru.nl). The project leader is Dr. J.H. Geuvers. The research will be performed within the research groups "Foundations" and "Informatics for Technical Applications" of the ICIS institute of the Radboud University Nijmegen, in collaboration with Prof.dr. F. Vaandrager (head of the ITA research group). The research of the post-doc will be on topics (4) above. Applications ------------ The full project proposal will be sent to you on request (herman at cs.ru.nl). Further enquiries can be made with the project leader. You are invited to send your application by email to the project leader. Deadline for applications is June 25, 2006. In case you learn of this job opportunity later than that date you may send an email to enquire whether it still makes sense to apply. Your application should consist of: - a curriculum vitae (containing information regarding your academic degrees, title of your PhD-thesis, publications) - the names and addresses of two referees From herman at cs.ru.nl Fri Jun 9 07:18:30 2006 From: herman at cs.ru.nl (Herman Geuvers) Date: Fri, 09 Jun 2006 13:18:30 +0200 Subject: [TYPES/announce] Logic Colloquium 2006: Call for Participation, Early Registration until June 15 Message-ID: <44895906.9030601@cs.ru.nl> [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.] >>>>> EARLY REGISTRATION until June 15 <<<<< ------------- 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/ EARLY REGISTRATION until June 15 The Organizing Committee From royer at ecs.syr.edu Mon Jun 12 14:53:57 2006 From: royer at ecs.syr.edu (James S. Royer) Date: Mon, 12 Jun 2006 14:53:57 -0400 Subject: [TYPES/announce] LCC'06 submissions deadline extended to June 15 Message-ID: <710170FE-7BAB-4C19-BB00-A83CE8D0D75E@ecs.syr.edu> The submissions deadline for the 8th Intl Workshop on Logic and Computational Complexity (LCC'06) has extended its submissions deadline to June 15. See http://www.cis.syr.edu/~royer/icc/LCC06 for details on the workshop and submissions. From cbraga at ic.uff.br Tue Jun 13 08:10:36 2006 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 13 Jun 2006 14:10:36 +0200 Subject: [TYPES/announce] LSFA'06 Final Call for Papers References: <200606131358.k5DDwrNV005741@s15209313.onlinehome-server.info> Message-ID: Brazilian Workshop on Logical and Semantic Frameworks, with Applications LSFA'06 - FINAL CALL FOR PAPERS ------------------------------------------------------------------------ NEW: SUBMISSION PAGE IS NOW OPEN NEW: EasyChair (http://www.easychair.org/LSFA06/) WILL BE USED TO MANAGE LSFA'06 PAPER SUBMISSION AND REVIEW NEW: WORKSHOP PROCEEDINGS AS A BOOK ON UFRGS "INOVA??O" SERIES NEW: INVITED SPEAKERS Joe Wells, Heriot-Watt University (http://www.macs.hw.ac.uk/~jbw/) Narciso Marti Oliet, Universidad Complutense de Madrid (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/ Mart=iacute==Oliet:Narciso.html) ------------------------------------------------------------------------ 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 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. > Invited Speakers Joe Wells School of Mathematical and Computer Sciences Heriot-Watt University Senior Research Fellow in the ULTRA group (http://www.macs.hw.ac.uk/~jbw/) Narciso Marti Oliet Facultad de Inform?tica Universidad Complutense de Madrid Head of the UCMaude group (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/ Mart=iacute==Oliet:Narciso.html) > 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 NIA-NASA (Hampton) Christiano Braga UCM (Madrid), co-chair Claude Kirchner Loria (Nancy) 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 Mart?-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 Anamaria Moreira UFRN Christiano Braga UCM, chair E. Hermann Haeusler PUC-Rio Martin Musicante UFRN, local chair Mauricio Ayala-Rincon UnB > 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 uploaded to LSFA'06 page at EasyChair (http://www.easychair.org/LSFA06/) until the submission deadline in June 20th, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using SBC's 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 a selection of the accepted papers will be invited to submit full versions of their contributions for the workshop proceedings, which will be reviewed by the PC after the workshop. Given enough quality submissions, the proceedings of LSFA'06 will be considered to be edited as a volume of the "Inovacao" series, published by Universidade Federal do Rio Grande do Sul, where contributions would appear as book chapters. > 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 miculan at dimi.uniud.it Wed Jun 14 03:15:17 2006 From: miculan at dimi.uniud.it (Marino Miculan) Date: Wed, 14 Jun 2006 09:15:17 +0200 Subject: [TYPES/announce] IFIP WG 2.2 Anniversary Meeting - Call for Participation Message-ID: Please post. -m ======================================================= CALL FOR PARTICIPATION FORMAL DESCRIPTION OF PROGRAMMING CONCEPTS: IFIP WG 2.2 Anniversary Meeting 11-13 September 2006 Udine, Italy http://www.dimi.uniud.it/ifip06/ The IFIP Working Group 2.2 was established in 1965 as one of the first IFIP Working Groups. The primary aim of the WG is to explain programming concepts through the development, examination and comparison of various formal models of these concepts. The WG thus explores the theory and the practice of formal methods for the specification, verification and the design of software and systems. Earliest members of the WG included Dana Scott, Erwin Engeler, Jaco de Bakker, Raymond Abrial, Peter Lauer, Manfred Paul, Erich Neuhold, Maurice Nivat, Ed Blum. Throughout the years, members of the WG shaped various styles of semantics, comprising denotational, operational, algebraic, and logical semantics. The anniversary meeting commemorates the 40-th birthday of WG. In the meeting, a number of keynote speakers and current members of the WG will give tutorial presentations on topics relevant to the WG, focusing on history (of these topics, or of the WG), but also on current outlook and future developments. Keynote speakers: Amir Pnueli, Igor Walukiewicz, and Ernst-Rudiger Olderog (as current WG members), Dana Scott, Manfred Paul, and Hans Langmaack (as founding WG members), Leslie Lamport and Gordon Plotkin (as past WG members) . Registration ~~~~~~~~~~~~ Registration to the meeting is possible at http://www.dimi.uniud.it/ifip06/registration.html The meeting fee is 120 Euros until 31 July 2006. After that date, and until 31 August 2006, the fee will be 150 Euros. After then, no registrations will be accepted. The workshop fee includes lunches, coffee-breaks, the social dinner and the excursion on Sunday afternoon. Preliminary Programme and Speakers ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Sunday 10 September, afternoon Excursion: San Daniele countryside (and ham) Monday 11 September * 09.00-10.00: Amir Pnueli * 10.00-10.30: coffee break * 10.30-11.30: Hans Langmaack * 11.30-12.00: Maciej Koutny * 12.00-14.00: lunch * 14.00-15.00: Igor Walukiewicz * 15.00-15.30: coffee break * 15.30-16.30: Ugo Montanari * 16.30-17.00: Catuscia Palamidessi * 17.00-17.30: Andrzej Tarlecki * 17.30-18.00: Rocco De Nicola Tuesday 12 September * 09.00-10.00: Gordon Plotkin * 10.00-10.30: coffee break * 10.30-11.30: local speaker * 11.30-12.00: Mariangiola Dezani * 12.00-14.00: lunch * 14.00-15.00: Dana Scott * 15.00-15.30: coffee break * 15.30-16.30: Egon Boerger * 16.30-17.00: Markus Muller-Olm * 20.00- : Social Dinner Wednesday 13 September * 09.00-10.00: Leslie Lamport * 10.00-10.30: coffee break * 10.30-11.00: Manfred Paul * 11.00-11.30: J Strother Moore * 11.30-12.00: Peter Mosses * 12.00-14.00: lunch * 14.00-15.00: Ernst-Rudiger Olderog * 15.00-15.30: coffee break * 15.30-16.30: Shigeru Igarashi * 16.30-17.00: Stephan Merz * 17.00-17.30: Anders P. Ravn * 17.30-18.00: Philippe Darondeau From Fabio.Martinelli at iit.cnr.it Wed Jun 14 13:26:30 2006 From: Fabio.Martinelli at iit.cnr.it (Fabio Martinelli) Date: Wed, 14 Jun 2006 19:26:30 +0200 Subject: [TYPES/announce] CfP:4th International Workshop on Formal Aspects in Security & Trust (FAST2006) Message-ID: <449046C6.6050802@iit.cnr.it> ------------------------------------------------ 4th International Workshop on Formal Aspects in Security & Trust (FAST2006) August 26-27 2006 Hamilton, Ontario Canada www.iit.cnr.it/FAST2006/ FAST2006 is a satellite event of 14th Formal Methods Symposium (FM2006). FAST is under the auspices of IFIP WG 1.7 ------------------------------------------------ NEWS: SUBMISSION web site is now open!!! (Deadline June 23 2006 !!!) OVERVIEW OF FAST The fourth International Workshop on Formal Aspects in Security and Trust (FAST2006) aims at continuing the successful efforts of the first three FAST workshops for fostering the cooperation among researchers in the areas of security and trust. The new challenges offered by the so-called ambient intelligence space as a future paradigm in the information society demands for a coherent framework of concepts, tools and methodologies to enable user' trust&confidence on the underlying communication infrastructure. These need to address issues relating to both guaranteeing security of the infrastructure and the perception of the infrastructure being secure. In addition, user confidence on what is happening must be enhanced by developing trust models effective but also easily comprehensible and manageable by users. The complexity and scale of deployment of emerging ICT systems based on web service and grid computing concepts also necessitates the investigation of new, scalable and more flexible foundational models of enforcing pervasive security across organizational borders and in situations where there is high uncertainty about the identity and trustworthiness of the participating networked entities (including users, services and resources). The increasing need of building activities sharing different resources managed with different policies demand for new and business enabling models of trust between members of virtual communities including virtual organizations that span across the boundaries of physical enterprises and loosely structured communities of individuals. PAPER SUBMISSION Suggested submission topics include, but are not limited to: Formal models for security, trust and reputation Security protocol design and analysis Logics for security and trust Type systems for security and trust Trust-based reasoning Distributed Trust Management Systems Digital Assets Protection Data protection Privacy and ID management issues Information flow analysis Language-based security Security and Trust aspects in ubiquitous computing Validation/Analysis tools Web/Grid Services Security/Trust/Privacy Security and Risk Assessment Case studies IMPORTANT DATES Paper Submission: 23 June 2006 Author Notification: 29 July 2006 Pre-proceedings version: 10 August2006 Workshop: 26-27 August 2006 Post-proceedings version: 30 September 2006 ORGANIZERS . Theo Dimitrakos, BT, UK . Fabio Martinelli, IIT-CNR, Italy . Peter Ryan, University of Newcastle, UK . Steve Schneider, University of Surrey, UK Program Committee ?Gilles Barthe, INRIA Sophia-Antipolis, France .Stefano Bistarelli, University of Pescara, Italy .Gregor v. Bochmann, University of Ottawa, Canada ?John A Clark, University of York, UK ?Fre'de'ric Cuppens, ENST Bretagne, France ?Roberto Gorrieri, University of Bologna, Italy ?Masami Hagiya, University of Tokyo, Japan ?Chris Hankin, Imperial College (London), UK ?Christian Jensen, DTU, Denmark ?Audun Josang, DSTC, Australia ?Jan J?rjens, TU M?nchen, Germany ?Yuecel Karabulut, SAP, Germany ?Igor Kotenko, SPIIRAS, Russia ?Heiko Krumm, University of Dortmund, Germany ?Ninghui Li, Purdue University, USA ?Steve Marsh, NRC, Canada ?Catherine Meadows, Naval Research Lab, USA ?Ron van der Meyden, University of New South Wales, Australia ?Mogens Nielsen, University of Aarhus, Denmark .Flemming Nielson, Danish Technical University, Denmark ?Indrajit Ray, Colorado State University, USA ?Babak Sadighi Firozabadi, SICS, Sweden, ?Pierangela Samarati, University of Milan, Italy ?Jean-Marc Seigneur, University of Geneva, Switzerland .Paul Syverson, Naval Research Lab, USA ?Ketil Stolen, SINTEF, Norway ?William H. Winsborough, University of Texas at San Antonio, USA PROCEEDINGS As for the previous editions, the post-proceedings of the workshop will be published with LNCS and a special journal issue is also planned. From floc at informatik.hu-berlin.de Wed Jun 14 17:43:56 2006 From: floc at informatik.hu-berlin.de (Grumberg + Huth) Date: Wed, 14 Jun 2006 23:43:56 +0200 (CEST) Subject: [TYPES/announce] Call For Papers: TACAS 2007 Message-ID: <20060614214356.4B1F8619F2@riemann.informatik.hu-berlin.de> CALL FOR PAPERS: TACAS 2007 Thirteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems www.doc.ic.ac.uk/tacas07/ Part of ETAPS 2007, March 24 - April 1, 2007, Braga, Portugal IMPORTANT DATES * 6 Oct 2006: Submission deadline (strict) for abstracts of research and tool demonstration papers * 13 Oct 2006: Submission deadline (strict) for full versions of research and tool demonstration papers * 8 Dec 2006: Notification of acceptance * 5 Jan 2007: Camera-ready versions due CONFERENCE DESCRIPTION TACAS is a forum for researchers, developers and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference serves to bridge the gaps between different communities that share common interests in, and techniques for, tool development and its algorithmic foundations. The research areas covered by such communities include but are not limited to formal methods, software and hardware verification, static analysis, programming languages, software engineering, real-time systems, communications protocols, and biological systems. The TACAS forum provides a venue for such communities at which common problems, heuristics, algorithms, data structures and methodologies can be discussed and explored. In doing so, TACAS aims to support researchers in their quest to improve the utility, reliability, flexibility and efficiency of tools and algorithms for building systems. Tool descriptions and case studies with a conceptual message, as well as theoretical papers with clear relevance for tool construction are all encouraged. The specific topics covered by the conference include, but are not limited to, the following: * Specification and verification techniques for finite and infinite-state systems * Software and hardware verification * Theorem-proving and model-checking * System construction and transformation techniques * Static and run-time analysis * Abstraction techniques for modeling and validation * Compositional and refinement-based methodologies * Testing and test-case generation * Analytical techniques for secure, real-time, hybrid, critical, biological or dependable systems * Integration of formal methods and static analysis in high-level hardware design or software environments * Tool environments and tool architectures * SAT solvers * Applications and case studies As TACAS addresses a heterogeneous audience, potential authors are strongly encouraged to write about their ideas and findings in general and jargon- independent, rather than in application- and domain-specific, terms. Authors reporting on tools or case studies are strongly encouraged to indicate how their experimental results can be reproduced and confirmed independently. PROGRAMME COMMITTEE Christel Baier (U. Bonn, Germany) Armin Biere (Johannes Kepler U., Austria) Jonathan Billington (University of South Australia, Australia) Ed Brinksma (ESI and U. of Twente, The Netherlands) Rance Cleaveland (U. of Maryland & Fraunhofer USA Inc, USA) Byron Cook (tool chair) (Microsoft Research, Cambridge, UK) Dennis Dams (Bell Labs, Lucent Technologies, Murray Hill, USA) Marsha Chechik (U. Toronto, Canada) Francois Fages (INRIA Rocquencourt, France) Kathi Fisler (Worcester Polytechnic, USA) Limor Fix (Intel Research Laboratory, Pittsburgh, USA) Hubert Garavel (INRIA Rhones-Alpes, France) Susanne Graf (VERIMAG, Grenoble, France) Orna Grumberg (co-chair) (TECHNION, Israel Institute of Technology, Israel) John Hatcliff (Kansas State U., USA) Holger Hermanns (U. des Saarlandes, Germany) Michael Huth (co-chair) (Imperial College London, UK) Daniel Jackson (Massachusetts Institute of Technology, USA) Somesh Jha (U. of Wisconsin at Madison, USA) Orna Kupferman (Hebrew U., Jerusalem, Israel) Marta Kwiatkowska (U. of Birmingham, UK) Kim Larsen (Aalborg U., Denmark) Michael Leuschel (Heinrich-Heine U., Duesseldorf, Germany) Andreas Podelski (Max-Planck-Institut fuer Informatik, Saarbruecken, Germany) Tiziana Margaria-Steffen (U. Goettingen, Germany) Tom Melham (Oxford U., UK) CR Ramakrishnan (SUNY Stony Brook, USA) Jakob Rehof (Fraunhofer ISST, Germany) Natarajan Shankar (SRI, Menlo Park, USA) Bernhard Steffen (U. Dortmund, Germany) Lenore Zuck (U. of Illinois, USA). INVITED SPEAKER K. Rustan M. Leino (Microsoft Research, USA) SUBMISSION GUIDELINES Papers should be submitted using the TACAS 2007 Conference Service. As with other ETAPS conferences, TACAS accepts two types of contributions: * research papers and * tool demonstration papers. Both types of contributions will appear in the proceedings and have oral presentations during the conference. Research papers: Research papers cover one or more of the topics above, including tool development and case studies from a perspective of scientific research. Research papers are evaluated by the TACAS Program Committee. Submitted research papers must: * be in English and have a maximum of 15 pages (including figures and bibliography) * present original research which is unpublished and not submitted elsewhere (conferences or journals) -- in particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden * use the Springer-LNCS style * be submitted electronically in Postscript or PDF form via the TACAS 2007 Conference Service (abstract no later than 6 October, 2006, and full paper no later than 13 October, 2006) Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Program Committee Co-Chairs Orna Grumberg (www.cs.technion.ac.il/users/orna/) or Michael Huth (www.doc.ic.ac.uk/~mrh/) prior to submitting. Tool demonstration papers: Tool demonstration papers present tools based on aforementioned technologies (e.g., theorem-proving, model-checking, static analysis, or other formal methods) or fall into the above application areas (e.g., system construction and transformation, testing, analysis of real-time, hybrid or biological systems, etc.). Tool demonstration papers are evaluated by the TACAS Tool Chair, Byron Cook (http://research.microsoft.com/users/bycook/default.htm) with the help of the Programme Committee. Submitted tool demonstration papers must: * be in English and have a maximum of 4 pages * have an appendix (not included in the 4 page count) that provides a detailed description of: - how the oral presentation will be conducted, e.g. illustrated by a number of snapshots - the availability of the tool, the number and types of users, other information which may illustrate the maturity and robustness of the tool - if applicable, a link to a web-page for the tool (The appendix will not be included in the proceedings, but during the evaluation of the tool demonstration papers it will be equally important as the pages submitted for publication in the proceedings.) * use the Springer-Verlag LNCS style * clearly describe the enhancements and novel features of the tool in case that one of its previous versions has already been presented at meetings or published in some form * be submitted electronically in Postscript or PDF form via the TACAS 2007 Conference Service (abstract no later than 6 October, 2006, and full paper no later than 13 October, 2006) Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Tool Chair Byron Cook. From Gilles.Barthe at sophia.inria.fr Thu Jun 15 05:41:08 2006 From: Gilles.Barthe at sophia.inria.fr (Gilles Barthe) Date: Thu, 15 Jun 2006 11:41:08 +0200 Subject: [TYPES/announce] post-doctoral position in formal security at INRIA Message-ID: <44912B34.2070201@sophia.inria.fr> Applications are invited for a post-doctoral position on formal security within the EVEREST project (http://www-sop.inria.fr/everest/) at INRIA Sophia-Antipolis. The position is initially for 2 years, with the possibility of 1 year extension; the preferred starting date is October 2006. We are looking for candidates with a strong research background in formal security. The team is active in the following areas: - language-based security - program logics for security - proof-carrying code - provable cryptography Applications consisting of a CV with names of three referees to Nathalie.Bellesso at sophia.inria.fr preferably before July, 15st 2006. If you wish to apply after this date, please send an email for enquiring whether the position remains open. Potential candidates are welcome to contact me by email for any informal enquiry concerning the position. Gilles Barthe ===================================================== Everest Team, INRIA Sophia-Antipolis 2004 Route des Lucioles BP 93, 06902 Sophia Antipolis Cedex France Tel: (33) 4 92 38 79 38 Fax: (33) 4 92 38 50 29 http://www-sop.inria.fr/everest/Gilles.Barthe From jpt at metacase.com Thu Jun 15 16:08:31 2006 From: jpt at metacase.com (Juha-Pekka Tolvanen) Date: Thu, 15 Jun 2006 23:08:31 +0300 Subject: [TYPES/announce] CfP: 6th Workshop on Domain-Specific Modeling at OOPSLA Message-ID: C A L L F O R P A P E R S ============================= The 6th OOPSLA Workshop on Domain-Specific Modeling October 22, 2006 Portland, Oregon, USA http://www.dsmforum.org/events/DSM06 --------------------------------------------------------------------------- Call for Position Papers: Domain-Specific Modeling raises the level of abstraction beyond programming by specifying the solution directly using domain concepts. In many cases, final products can be generated automatically from these high-level specifications. This automation is possible because both the language and generators need fit the requirements of only one company and domain. Industrial experiences of DSM consistently show it to be 5-10 times faster than current practices, including current UML-based implementations of MDA. As Booch et al. say* "the full value of MDA is only achieved when the modeling concepts map directly to domain concepts rather than computer technology concepts." For example, DSM for cell phone software would have concepts like "Soft key button", "SMS" and "Ring tone", and generators to create calls to corresponding code components. More investigation is still needed in order to advance the acceptance and viability of domain-specific modeling. This workshop welcomes position papers describing new ideas at either a practical or theoretical level. On the practical side, we are interested in submissions dealing with application of modeling techniques within a specific domain. In addition to industrial projects, we seek initial descriptions of research ideas that initiate and forward the technical underpinnings of domain-specific modeling. In particular, the importance of metamodeling is highlighted in this workshop. Metamodeling significantly eases the implementation of domain-specific languages and provides support for experimenting with the modeling language as it is built (thus, metamodel-based language definition also assists in the task of constructing generators that reduce the burden of tool creation and maintenance). Some suggested topics for the workshop include, but are not limited to: - Tools for supporting domain-specific modeling (DSM) - Metamodeling frameworks and languages - Comparison and analysis of model-driven development approaches - Principles for identifying constructs for DSM languages - Industry/academic experience reports describing success/failure in using domain-specific modeling - Novel approaches for code generation from domain-specific models - Approaches to implement domain-specific modeling languages - Issues of support/maintenance of models and evolution of DSM language in accordance with the representative domain - Version control techniques for DSMs - Specific domains where this technology can be most productive in the future (e.g., embedded systems, product family domains or systems with multiple implementation platforms) - Techniques for supporting model interchange between tools - Relationships between ontologies and metamodels --------------------------------------------------------------------------- Important Dates: Initial submission: August 10, 2006 Author Notification: September 8, 2006 (1 week prior to Early Registration deadline) Final version: October 1, 2006 Workshop: October 22, 2006 --------------------------------------------------------------------------- Submission Information: Admission to the workshop will be extended to those who have submitted a relevant position paper. Each position paper will be reviewed by the Program Committee and invitations to attend the workshop will then be issued based upon the evaluation of the position paper. Position papers should be approximately 4 to 8 pages and should be submitted by August 10, 2006. Contributions should be sent as a PDF or Word file via email to jpt at metacase.com. Notification of acceptance will be sent 1 week prior to the Early Registration deadline, based on the evaluation of the contribution by members of the program committee. The accepted papers will be published in the printed proceedings and posted on the workshop web site. --------------------------------------------------------------------------- Additional Information: Additional information about the workshop is available at the workshop web site, including the anticipated workshop format, the pre/post workshop activities, and links to the previous DSM workshops at OOPSLA. The web page is at: http://www.dsmforum.org/events/DSM06 --------------------------------------------------------------------------- Program Committee: Scott Ambler, Ambysoft Pierre America, Philips Philip T. Cox, Dalhousie University Krzysztof Czarnecki, University of Waterloo Andy Evans, Xactium Jeff Gray, University of Alabama at Birmingham Jack Greenfield, Microsoft J?rgen Jung, University of Duisburg-Essen Steven Kelly, MetaCase J?rgen Kerstna, St. Jude Medical Kalle Lyytinen, Case Western Reserve University Pentti Marttiin, Nokia Birger M?ller-Pedersen, University of Oslo Matti Rossi, Helsinki School of Economics Arturo Sanchez, University of North Florida Jonathan Sprinkle, University of California, Berkeley Juha-Pekka Tolvanen, MetaCase Markus V?lter, independent consultant --------------------------------------------------------------------------- Organizing Committee: Juha-Pekka Tolvanen, MetaCase Jonathan Sprinkle, University of California, Berkeley Jeff Gray, University of Alabama at Birmingham --------------------------------------------------------------------------- *) Grady Booch, Alan Brown, Sridhar Iyengar, Jim Rumbaugh, Bran Selic, MDA Journal, May 2004 Apologies if you receive this message more than once. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060615/2bb561bf/attachment.htm From sts06 at ii.uib.no Fri Jun 16 06:34:37 2006 From: sts06 at ii.uib.no (Software Transformation Systems Workshop 2006) Date: Fri, 16 Jun 2006 12:34:37 +0200 Subject: [TYPES/announce] 1st cfp: STS'06: Software Transformation Systems Workshop at GPCE06/OOPSLA06 (Portland, Oregon, October 2006) Message-ID: <1150454077.11715.454.camel@hemlock.ii.uib.no> Typing of some software transformation systems seems to be a technically very difficult problem. Participation from the types community may therefore be mutually beneficial. ________________________________________________________________________ STS'06: Software Transformation Systems Workshop http://www.program-transformation.org/Sts/STS06 part of the Fifth international conference on Generative Programming and Component Engineering (GPCE'06) http://www.program-transformation.org/GPCE06/ October 22-26, 2006, Portland, Oregon colocated with OOPSLA'06 ________________________________________________________________________ Workshop Organisers * Magne Haveraaen, University of Bergen, Norway http://www.ii.uib.no/~magne/ * Jim Cordy, Queen's University, Canada http://www.cs.queensu.ca/~cordy/ * Jan Heering, CWI, Amsterdam, Netherlands http://homepages.cwi.nl/~jan/ * Eelco Visser, Utrecht University, Netherlands http://www.cs.uu.nl/~visser/ Workshop schedule: * 2 page position paper submission deadline: July 15, 2006 * Notification of acceptance: August 31, 2006 * GPCE/OOPSLA early registration deadline: September 14, 2006 * Workshop day: Sunday October 22, 2006 Motivation ---------- Generative software techniques typically transform components or codefragments, instantiate patterns etc. in some way or another to generate new code fragments, components or programs. Often this needs software support beyond that of existing compilers, i.e., some kind of system which takes software as inputs and produces software as output. Software transformation systems are tools which are built for such transformations. They range from specific tools for one purpose, via simple pattern matching systems, to general transformation systems which are easily programmed to do any reasonable transformation. Thus the more general tools may be treated as meta-tools for generative programming. Following on the success of STS'04, this workshop is once again designed to bring together people working on software transformation systems and those with an interest in software transformation systems as a generative tool, with the aim of investigating the use of software transformation tools as tools to support generative programming. We want to look at various generative techniques and suggest how these may be supported by various general purpose transformation tools. This may lead to a more general understanding of common principles for supporting generative methods. This year's workshop will particularly focus on architecture, reuse, implementation (data representations and algorithms), application models and benchmarks, although contributions on a wide range of topics in the application of software transformation systems in generative techniques are sought. Workshop format --------------- The workshop will have a small number of participants, around 20, selected on the basis of short position papers submitted to the organisers. The aim is to let people with different perspectives meet in order to allow fruitful interaction. Submission of intent to participate ----------------------------------- If you find this workshop interesting you should send an e-mail to sts06 at ii.uib.no with your intent to participate and your area of expertise/interest, and/or a short, max 2 page, position paper intended as an abstract of a presentation. We prefer plain ISO or UTF-8 documents (txt), but latex (only use standard packages) and pdf formats are also acceptable. -- http://www.program-transformation.org/Sts/STS06 http://www.program-transformation.org/Sts/MailingList From urzy at mimuw.edu.pl Tue Jun 20 08:03:44 2006 From: urzy at mimuw.edu.pl (Pawel Urzyczyn) Date: Tue, 20 Jun 2006 14:03:44 +0200 Subject: [TYPES/announce] MFCS 2006 Call fpr Prticipation Message-ID: <200606201403.44045.urzy@mimuw.edu.pl> Please, accept our apologies for possible multiple postings. MFCS 2006 31st International Symposium on Mathematical Foundations of Computer Science August 28 - September 1, 2006 High Tatras, Slovakia www.mfcs.sk CALL FOR PARTICIPATION The deadline for early registration is ***** JUNE 29, 2006 ***** The series of MFCS symposia, organized alternately in the Czech Republic, Poland and Slovakia since 1972, has a long and well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity to bring together specialists who do not usually meet at specialized conferences. The scientific program will include 7 invited lectures given by Cyril Gavoille (Bordeaux, France) Herman Geuvers (Nijmegen, The Netherlands) Martin Grohe (Berlin, Germany) Dexter Kozen (Ithaca, U.S.A) Ming Li (Waterloo, Canada) Martin Odersky (Lausanne, Switzerland) Andrzej Pelc (Gatineau, Canada) and 62 contributions selected from 174 submissions by the program committee consisting of Viviana Bono (Torino, Italy) Ilaria Castellani (Sophia Antipolis, France) Iliano Cervesato (New Orleans, USA) Janos Csirik (Szeged, Hungary) Jurek Czyzowicz (Gatineau, Canada) Andrzej Filinski (Copenhagen, Denmark) Yuri Gurevich (Redmond WA, USA) Juraj Hromkovic (Zurich, Switzerland) Joanna Jedrzejowicz (Gdansk, Poland) Juhani Karhumaki (Turku, Finland) Rastislav Kralovic (Bratislava, Slovakia) - co-chair Ludek Kucera (Prague, Czech Republic) Alberto Marchetti-Spaccamela (Rome, Italy) Burkhard Monien (Paderborn, Germany) Peter D. Mosses (Swansea, UK) Joachim Niehren (Lille, France) Jaroslav Opatrny (Montreal, Canada) Jose Rolim (Geneva, Switzerland) Michael I. Schwartzbach (Arhus, Denmark) Christian Scheideler (Munich, Germany) Sergei Soloviev (Toulouse, France) Andrzej Szepietowski (Gdansk, Poland) Jacobo Toran (Ulm, Germany) Pawel Urzyczyn (Warszawa, Poland) - co-chair Andrei Voronkov (Manchester, UK) Imrich Vrto (Bratislava, Slovakia) Igor Walukiewicz (Bordeaux, France) Gerhard Woeginger (Eindhoven, The Netherlands) The titles and abstracts of the accepted papers can be found on the conference web page http://www.mfcs.sk The symposium will take place from August 28 to September 1, 2006 in the Academia Hotel resort situated at the foot of the Lomnicky peak in the eastern part of the Vysoke Tatry Mountains in Slovakia. The resort is located on the border of the Tatra National Park, in a quiet surrounding a short way off the towns Tatranska Lomnica and Stary Smokovec. The registration fee covers conference fee, accommodation for 6 nights (August 27 - September 2, 2006) in a double room, breakfasts, lunches, coffee breaks, social events, and a copy of the LNCS proceedings containing the invited papers and accepted contributions. Conference address: Rastislav Kralovic MFCS 2006 Department of Computer Science Comenius University Mlynska dolina, FMFI UK 842 48 BRATISLAVA, Slovak Republic Phone: (+421 2) 602 95 470 Fax: (+421 2) 654 27 041 E-mail: mfcs at informatika.sk WWW: http://www.mfcs.sk The conference is organized by the Slovak Society for Computer Science and Faculty of Mathematics, Physics and Informatics, Comenius University, Bratislava For further information, please contact the conference web page http://www.mfcs.sk From Oege.de.Moor at comlab.ox.ac.uk Tue Jun 20 13:02:48 2006 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Tue, 20 Jun 2006 17:02:48 GMT Subject: [TYPES/announce] aosd 2007 Message-ID: <200606201702.k5KH2mub000518@mercury.comlab.ox.ac.uk> A non-text attachment was scrubbed... Name: not available Type: text Size: 512 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060620/2e7a0cbf/attachment.txt From Susanne.Graf at imag.fr Tue Jun 20 15:28:43 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Tue, 20 Jun 2006 21:28:43 +0200 Subject: [TYPES/announce] Call for Papers: MARTES'06 - Modeling and Analysis of Real-Time and Embedded Systems Message-ID: <44984C6B.8090400@imag.fr> ************************************************************************ * MARTES * * Workshop on Modeling and Analysis of Real-Time and Embedded Systems * * October 2 or 3, 2006 * * Genova, Italy * * http://www.martes.org * * * * Workshop held in conjunction with MoDELS/UML 2006 * * http://www.umlconference.org/ * ************************************************************************ Submission deadline: August 30, 2006 ------------------------------------- The Model Driven Architecture (MDA) initiative of the OMG puts forward the idea that future process development will be centered around models, thus keeping application development and underlying platform technology as separate as possible. The aspects influenced by the underlying platform technology concern mainly non functional aspects and communication primitives. The first significant result of the MDA paradigm for engineers is the possibility of building application models that can be conveniently ported to new, emerging technologies - implementation languages, middleware, etc.- with minimal effort and risk in one hand, but also that can be analyzed either directly or through a model transformation toward a specific formal technological space in order to validate or/and verify real-time properties such as for example schedulability. In the area of DRES (distributed, Real-time and Embedded Systems), this model-oriented trend is also very active and promising. But DRES are different from general-purpose systems. The purpose of this workshop is to serve as an opportunity to gather researchers and industrials in order to survey some existing experiments related to modeling and model-based analysis of DRES. Moreover in order to be able to exchange models with the aim to apply formal validation tools and to achieve interoperability, it is important to have also a common understanding of the semantics of the given notations. Other important issues in the domain of real-time are methodology and modeling paradigms allowing breaking down the complexity, and tools which are able to verify well designed systems. The MARTES workshop is a merge of two series of complementary workshops that were dedicated to RT/E systems and UML and which had both taken place, amongst others, as workshops associated with the UML conferences, the predecessor of MODELS: SIVOES and SVERTS. Topics: ====== - Modeling RT/E using modelling languages such as UML o How to specify real-time requirements and characteristics o How to enhance modelling languages to capture real time, embedded and distributed aspects in a convenient manner o Declarative versus operational real-time specifications o Notations for defining the architecture of heterogeneous systems o Behavior modeling o RT/E platforms modeling, integration of scheduling aspects - Semantic aspects of real-time in modelling languages o Formal semantics, in particular, semantic integration of heterogeneous systems o Interpretations of annotations o Executability of models - Methods and tools for analysis of RT systems and components o Ensure consistency of timing constraints throughout the system o Validation of time and scheduling related properties o Validation of functional properties of time dependent systems Workshop Format =============== This full-day workshop will consist of an introduction of the topic by the workshop organizers, an invited presentation (to be determined), presentations of accepted papers, and in depth discussion of previously identified subjects emerging from the submissions. A summary of the discussions will be made available. Submission and Publication ========================== To contribute, please send a position paper or a technical paper to Susanne.Graf at imag.fr or Sebastien.Gerard at cea.fr. Position papers should not exceed 5 pages, and technical papers 20 pages. Preferably, submissions should be in postscript or pdf format. Workshop proceedings will be distributed to all participants and made available through the workshop website. The two best papers and a workshop overview are likely to be published in the MoDELS 2005 Satellite Post-Proceedings (as a volume of the LNCS series). Additionally, a selection will be considered for publication in a suitable technical journal following an agreement with an interested publisher (a selection of the SVERTS 2003 papers has recently appeared as a special section of Springer's STTT journal). IMPORTANT DATES =============== Submission deadline: August 30, 2006 Notification of acceptance: September 9, 2006 Final versions due: September 29, 2006 Workshop date : October 2 or 3, 2006 Organizers ========== S?bastien G?rard - CEA-LIST, France Susanne Graf - Verimag, France ?ystein Haugen - University of Oslo, Norway Iulian Ober - Verimag, France Bran Selic - IBM, Canada Programme Committee:(to be finalised) Daniel Amyot (U. of Ottawa, Canada) Jean-Philippe Babau (INSA Lyon, France) Heiko Doerr (Daimler Chrysler, Germany) Peter Feiler (CMU, Software Institute, US) Eran Gery (I-Logix) Sebastien Gerard (CEA-LIST, France) Holger Giese (Univ. of Paderborn, Germany) Susanne Graf (Verimag, France) ?ystein Haugen (Univ. of Oslo, Norway) Jozef Hooman (Embedded Systems Institute & Univ. of Nijmegen, NL) Bengt Jonsson (Uppsala, Sweden) Iulian Ober (ISYCOM, U. Toulouse, France) Dorina Petriu (Carleton U., Canada) Alan Moore (Artisan) Bran Selic (IBM, Canada) Richard Sanders (Sintef, Norway) Thomas Weigert (Motorola, Chicago) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf at imag.fr ------------------------------------------------------------------------ From cbraga at ic.uff.br Thu Jun 22 04:18:56 2006 From: cbraga at ic.uff.br (Christiano Braga) Date: Thu, 22 Jun 2006 10:18:56 +0200 Subject: [TYPES/announce] LSFA'06 deadline extension Message-ID: Brazilian Workshop on Logical and Semantic Frameworks, with Applications LSFA'06 - FINAL CALL FOR PAPERS, with extended deadline ------------------------------------------------------------------------ NEW: PAPER SUBMISSION DEADLINE EXTENDED - JULY 3rd CONTRIBUTIONS CAN BE WRITTEN IN PORTUGUESE NEW: SUBMISSION PAGE IS NOW OPEN NEW: EasyChair (http://www.easychair.org/LSFA06/) WILL BE USED TO MANAGE LSFA'06 PAPER SUBMISSION AND REVIEW NEW: WORKSHOP PROCEEDINGS AS A BOOK ON UFRGS "INOVA??O" SERIES NEW: INVITED SPEAKERS Joe Wells, Heriot-Watt University (http://www.macs.hw.ac.uk/~jbw/) Narciso Marti Oliet, Universidad Complutense de Madrid (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/ Mart=iacute==Oliet:Narciso.html) ------------------------------------------------------------------------ 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 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. > Invited Speakers Joe Wells School of Mathematical and Computer Sciences Heriot-Watt University Senior Research Fellow in the ULTRA group (http://www.macs.hw.ac.uk/~jbw/) Narciso Marti Oliet Facultad de Inform?tica Universidad Complutense de Madrid Head of the UCMaude group (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/ Mart=iacute==Oliet:Narciso.html) > 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 NIA-NASA (Hampton) Christiano Braga UCM (Madrid), co-chair Claude Kirchner Loria (Nancy) 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 Mart?-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 Anamaria Moreira UFRN Christiano Braga UCM, chair E. Hermann Haeusler PUC-Rio Martin Musicante UFRN, local chair Mauricio Ayala-Rincon UnB > Dates and Submission Paper submission deadline: July 3rd (was June 20th) Author notification: August 1st (was July 24th) Camera ready: August 10th (was August 7th) Contributions may be written in English or Portuguese and 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 uploaded to LSFA'06 page at EasyChair (http://www.easychair.org/LSFA06/) until the submission deadline in July 3rd, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using SBC's 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. At least one of the authors should register at the conference. The paper presentation shuuld also be in English. Authors of a selection of the accepted papers written in English will be invited to submit full versions of their contributions for the workshop proceedings, which will be reviewed by the PC after the workshop. Given enough quality submissions, the proceedings of LSFA'06 will be considered to be edited as a volume of the "Inovacao" series, published by Universidade Federal do Rio Grande do Sul, where contributions would appear as book chapters. > 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 sescobar at dsic.upv.es Wed Jun 21 19:03:06 2006 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Wed, 21 Jun 2006 18:03:06 -0500 Subject: [TYPES/announce] CFP: 2nd Int'l Workshop on Automated Specification and Verification of Web Systems (WWV'06) Message-ID: [ We apologize for multiple copies ] ******************************************************************* 2nd International Workshop on Automated Specification and Verification of Web Systems (WWV'06) Cyprus, November 15-19, 2006 (Track of ISoLA 2006) http://www.dsic.upv.es/workshops/wwv06 ******************************************************************* SCOPE The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit paper on formal methods and techniques applied to Web sites, Web services or Web-based applications, such as: * rule-based approaches to Web site analysis, certification, specification, verification, and optimization * formal models for describing and reasoning about Web sites * model-checking, synthesis and debugging of Web sites * abstract interpretation and program transformation applied to the semantic Web * intelligent tutoring and advisory systems for Web specifications authoring The WWV series provides a forum for researchers from the communities of Rule-based programming, Automated Software Engineering, and Web-oriented research to facilitate the cross-fertilization and the advancement of hybrid methods that combine the three areas. LOCATION WWV'06 will be held in November in Cyprus as a Special Track of the 2006 International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA 2006). SUBMISSION PROCEDURE Submissions must be received by July 16, 2006. In addition, an ASCII version of the title and abstract must have been submitted by July 3, 2006. Submitted papers should be at most 15 pages in the Lecture Notes in Computer Science (LNCS) style. Submitted papers should include an abstract and the author's information. See the author's instructions of LNCS style at http://www.springer.de/comp/lncs/authors.html. PUBLICATION Accepted papers will be published in a preliminary proceedings volume, which will be available during the workshop. Publication of the workshop post-proceedings by IEEE Computer Society Press is envisaged. PROGRAM CO-CHAIRS Maria Alpuente (Technical University of Valencia, Spain) Moreno Falaschi (University of Siena, Italy) WORKSHOP CHAIR Santiago Escobar (Technical University of Valencia, Spain) PROGRAM COMMITTEE Jose Julio Alferes (Universidade Nova de Lisboa, Portugal) Maria Alpuente (Technical University of Valencia, Spain) Demis Ballis (University of Udine, Italy) Francois Bry (University of Munich, Germany) Santiago Escobar (Technical University of Valencia, Spain) Francois Fages (INRIA Rocquencourt, France) Moreno Falaschi (University of Siena, Italy) Gopal Gupta (University of Texas at Dallas, USA) Shriram Krishnamurthi (Brown University, USA) Tiziana Margaria (University of Potsdam, Germany) I.V. Ramakrishnan (State University of New York at Stony Brook, USA) Leon van der Torre (University of Luxembourg, Luxembourg) IMPORTANT DATES Abstract Submission July 3, 2006 Full Paper Submission July 16, 2006 Acceptance Notification September 17, 2006 Camera Ready October 15, 2006 Workshop November 15-19, 2006 (one day) From ccris at dcs.qmul.ac.uk Thu Jun 22 11:08:47 2006 From: ccris at dcs.qmul.ac.uk (Cristiano Calcagno) Date: Thu, 22 Jun 2006 16:08:47 +0100 Subject: [TYPES/announce] research position at Imperial, Smallfoot checker Message-ID: <449AB27F.5030403@dcs.qmul.ac.uk> Philippa Gardner and I have a three-year postdoctoral research position available at Imperial, to build a static assertion checker for C based on separation logic. This is a joint project with Peter O'Hearn at Queen Mary, comprising one PhD student and one RA at each site. The details are given below. The deadline for application is 28th July 2006. Please send informal enquiries to me. I'd be grateful if you could forward this email to candidates you think might be suitable. Best wishes, Cristiano Calcagno ------------------------ Research Assistant/Associate Department of Computing, Imperial College London Title: Smallfoot: Static Assertion Checking for C programs Salary: ?22,870 - ?33,330 inclusive of London Allowance per annum Deadline for Applications: 28th July 2006 A postdoctoral Research Fellowship is available in the Department of Computing to work with Cristiano Calcagno and Philippa Gardner on an EPSRC project joint with Peter O'Hearn at Queen Mary. This is a fixed term post of 3 years starting on 1 October 2006 with some flexibility. The aim of the project is to develop a static assertion checker for C based on separation logic, and demonstrate it on systems code such as a memory manager. See http://www.dcs.qmul.ac.uk/research/logic/theory/projects/smallfoot/ for more details. Applicants must hold, or being nearing completion of, a PhD in Computer Science in a relevant subject. Preference will be given to applicants with a proven record in software development or theoretical computer science. Experience in one or more of the following is desirable: logic (especially separation logic), verification, program analysis, model checking. Formal applications should be sent to the address at the end of this message. Please send informal enquiries to Cristiano Calcagno, email: ccris at doc.ic.ac.uk Background of the Project ------------------------- Pointers have long been one of the dark corners of programming languages. Tractable proof and analysis tools are lacking for all but the most simple, shallow, properties of the program heap. A recent theory, separation logic, has shed fresh light on this area, and has generated considerable interest worldwide. It has lead to much simpler by-hand specifications and program proofs than previous formalisms, and it suggests, for the first time, the possibility of scalable analysis methods for expressive heap properties. To date though, separation logic remains mainly a theoretical advance; there are no tools based on separation logic for any real programming languages. We propose to develop a static assertion checker for C based on separation logic. Separation logic works naturally with a low-level RAM model, and thus appears to be well suited to code that must run close to the hardware without an intermediate abstraction of the kind found in the runtimes of high-level languages such as ML or Java. Much fundamental code of this sort is written in the C programming language, and is outside the effective range of current tools. Our tool, Smallfoot, will accept precondition and postcondition assertions written in separation logic, and programs will be checked using a combination of symbolic execution and specialized proof procedures. Abstract interpretation will be used to alleviate the need to state invariants. We will check structural integrity properties of programs -- such as that data structures are in consistent states, or that resource boundaries are respected -- rather than full functional correctness. In this way we hope to keep specifications simple, and to achieve a high degree of automation. As it is aimed at low-level programs, Smallfoot will be complementary to static assertion checkers for higher-level languages such as the ESC tool for Java and the Spec# tool for C#. Success on the problems in this project could have a significant impact on the use of logic to check properties of systems programs. Application ----------- Applications should include a College application form, which can be obtained from http://www.imperial.ac.uk/employment/academicform.htm. Applications should be on the correct form quoting Job Reference Number: Smallfoot 06. Applications must include a full CV, stating the names and addresses of three referees and should be sent to: Nicola Rogers Department of Computing, Imperial College London, South Kensington Campus, London, SW7 2AZ email: n.c.rogers at imperial.ac.uk From jhr at cs.uchicago.edu Thu Jun 22 16:56:40 2006 From: jhr at cs.uchicago.edu (John Reppy) Date: Thu, 22 Jun 2006 15:56:40 -0500 Subject: [TYPES/announce] FOOL/WOOD '07 Call for papers Message-ID: <30962512-0836-448A-BADC-506504FD39D8@cs.uchicago.edu> Call For Papers 2007 International Workshop on Foundations and Developments of Object-Oriented Languages (FOOL/WOOD '07) Sponsored by ACM SIGPLAN Saturday, 20 January 2007 Nice, France Following POPL '07 http://foolwood07.cs.uchicago.edu Deadlines Submissions: Friday, 6 October 2006, 12:00 noon CDT (19:00 UTC) Notifications: Friday, 24 November 2006 Final versions: Friday, 22 December 2006 Workshop Description The search for sound principles for object-oriented languages has given rise to much work during the past two decades, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, program verification, and program development. The merger of the FOOL and WOOD workshops is intended to bring together researchers to share new ideas and results in these areas. The second joint workshop, FOOL/WOOD '07, will be held in Nice, France on Saturday, 20 January 2007, the day after POPL. Submissions for this event are invited in the general area of foundations of object-oriented languages and program analysis. Topics of interest include language semantics, type systems, program analysis and verification, formal calculi, concurrent and distributed languages, database languages, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as an informal electronic proceedings. Historically, presentation at FOOL/WOOD does not count as prior publication, and many of the results presented at FOOL/WOOD have later been published ECOOP, OOPSLA, POPL, and other conferences. Submission Instructions We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy. Submissions should be PDF or PostScript in standard SIGPLAN 9pt conference format for a US-letter size page; templates are available at http://www.acm.org/sigs/sigplan/authorInformation.htm While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. Program Chair John Reppy (University of Chicago) e-mail: foolwood07 at mailman.cs.uchicago.edu Program Committee Derek Dreyer (Toyota Technological Institute at Chicago) Erik Ernst (University of Aarhus) Atsushi Igarashi (Kyoto University) Rustan Leino (Microsoft) Luigi Liquori (INRIA Sophia Antipolis) Todd Millstein (University of California - Los Angeles) David Walker (Princeton University) Elena Zucca (University of Genova) Steering Committee Viviana Bono (Universita di Torino) Michele Bugliesi (Universita Ca' Foscari) Sophia Drossopoulou (Imperial College) Kathleen Fisher (AT&T Labs) [Chair] Martin Odersky (Ecole Polytechnique Federale de Lausanne) Benjamin Pierce (University of Pennsylvania) Philip Wadler (University of Edinburgh) From luca at ru.is Fri Jun 23 12:40:41 2006 From: luca at ru.is (Luca Aceto) Date: Fri, 23 Jun 2006 16:40:41 -0000 Subject: [TYPES/announce] Nordic Workshop on Programming Theory 2006---preliminary announcement and call for contributions References: <07D05A69A3D0C14FAEA60C3ACE8E556409DC0B65@nike.hir.is> <07D05A69A3D0C14FAEA60C3ACE8E556409DC0B83@nike.hir.is> <07D05A69A3D0C14FAEA60C3ACE8E55640AD44E32@nike.hir.is> Message-ID: <07D05A69A3D0C14FAEA60C3ACE8E55640BDDF2D0@nike.hir.is> **** We apologize for multiple postings ****************** The 18th Nordic Workshop on Programming Theory (NWPT'06) Reykjav?k, Iceland, 18-20 October, 2006 http://www.ru.is/NWPT06/ The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries (but also elsewhere). The previous workshops were held in Uppsala (1989, 1999 and 2004), Aalborg (1990), Gothenburg (1991 and 1995), Bergen (1992 and 2000), Turku (1993, 1998, and 2003), Aarhus (1994), Oslo (1996), Tallinn (1997 and 2002), Lyngby (2001), and Copenhagen (2005). This time the workshop will visit Iceland for the first time, and will be held in Reykjav?k. SCOPE Typical topics of the workshop include (but are not limited to): * Semantics of programs * Programming logics * Program verification * Formal specification of programs * Program synthesis * Program transformation and program refinement * Real-Time and hybrid systems * Modeling of concurrency * Programming methods * Tools for program construction and verification INVITED SPEAKERS Gerd Behrmann, Aalborg University Matthew Hennessy, University of Sussex Hanne Riis Nielson, DTU David Sands, Chalmers University of Technology and University of G?teborg SUBMISSIONS Authors wishing to give a talk at the workshop are requested to submit an abstract of 1-3 pages (ps or pdf, printable on A4 paper) to nwpt06(at)ru(dot)is by the 19th September 2006. Submission of work submitted for formal publication elsewhere and work in progress is permitted. The abstracts of the accepted contributions will be available at the workshop. After the workshop, selected papers will be published in a special issue of Nordic Journal of Computing (awaiting confirmation). IMPORTANT DATES 19 September: Submission of abstracts 30 September: Registration OPENS (tentative) 5 October: Notification of acceptance 12 October: Registration CLOSES (tentative) 18-20 October: WORKSHOP (begins Wednesday morning/lunch, ends Friday lunch) Since the dates for the workshop coincide with the Iceland Airwaves music festival, we recommend that you book your travel and accommodation well in advance. PROGRAMME COMMITTEE * Luca Aceto, Reykjav?k Univ., Iceland, and Aalborg Univ., Denmark (co-chair) * Michael R. Hansen, Techn. U. of Denmark, Denmark * Anna Ing?lfsd?ttir, Reykjav?k Univ., Iceland, and Aalborg Univ., Denmark (co-chair) * Hannu-Matti Jarvinen, Tampere Univ. of Tech., Finland * Neil D. Jones, Univ. of Copenhagen, Denmark * Kim G. Larsen, Aalborg Univ., Denmark * Bengt Nordstr?m, Univ. of Gothenburg, Chalmers Univ. of Tech., Sweden * Olaf Owe, University of Oslo, Norway * Tarmo Uustalu, Inst. of Cybernetics, Estonia * J?ri Vain, Tallinn Technical University, Estonia * Marina Wald?n, ?bo Akademi University, Finland * Uwe E. Wolter, Univ. of Bergen, Norway * Wang Yi, Uppsala Univ., Sweden ORGANIZING COMMITTEE Luca Aceto, Anna Ing?lfsd?ttir, S?lr?n Sm?rad?ttir,.... EMAIL: nwpt06(at)ru(dot)is More (and more current) information is available at http://www.ru.is/NWPT06/ A short history of the workshop is available at http://www.cc.ioc.ee/nwpt02/history.html From mgradina at irisa.fr Mon Jun 26 10:25:53 2006 From: mgradina at irisa.fr (Maria Gradinariu) Date: Mon, 26 Jun 2006 16:25:53 +0200 Subject: [TYPES/announce] [CFP] SSS 2006 Deadline is only 10 days away!!! Message-ID: <033401c6992c$83879770$1c33fe83@irisa.fr> [Please accept our apologies if you receive multiple copies of this message.] Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (formerly Symposium on Self-stabilizing Systems) (SSS 2006) November 17th-19th, 2006 Dallas, Texas, USA http://www.irisa.fr/sss/2006/ ============================================================================== Selected papers will be published in a special issue of the ACM Transactions on Autonomous and Adaptive Systems (TAAS). ============================================================================== ============================================================================== Important Dates Paper Submission: July 7th, 2006 Notification to Authors: August 21st, 2006 Camera-ready: August 31st, 2006 Symposium: November 17th-19th, 2006 ============================================================================== The Symposium is a prestigious international forum for researchers and practitioners in the design and development of fault-tolerant distributed systems with self-* properties, such as self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. The theory of self-stabilization has been enriched in the last 25 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-* properties in fault-tolerant distributed systems. Research in distributed systems is now at a crucial point in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. Now, more than ever, the theory of self-stabilization has tremendous impact in these areas. Therefore, this year, we are extending the scope of the symposium to cover all safety and security related aspects of self-* systems. The title of the conference has been changed to reflect this expansion. There will be three tracks: networking, safety and security, and self-* properties in static and dynamic systems. The symposium solicits contributions on all aspects of self-stabilization, safety and security, recovery oriented systems and programing, from theoretical contributions, to reports of the actual experience of applying the principles of self-stabilization to static and dynamic systems. Topics of interest include, but are not limited to: Stabilization: - self-stabilizing systems - self-managed, self-assembling, autonomic and adaptive systems - self-optimizing and self-protecting systems - self-* abstractions for implementing fundamental services in static and dynamic distributed systems - impossibility results and lower bounds for self-* systems - application of stabilizing algorithms and techniques in dynamic distributed systems - data and code stabilization - algorithms for self-* error detection/correction Safety: - safety critical systems - trust models and specifications - semantics of trust, distrust, mistrust, over-trust, cheat, risk and reputation - trust-related security and privacy - reliable and dependable systems - fault-tolerant systems, hardware redundancy, robustness, survivable systems, failure recovery Security: - security of network protocols - security of sensor and mobile networks protocols - secure architectures, frameworks, policy, intrusion detection/awareness - proactive security - self-* properties and their relation with classical fault-tolerance and security - security protocols for self-* systems Networks and Applications: - models of fault-tolerant communication - stochastic, physical, and biological models to analyze self-* properties - communication complexity - data structures for efficient communication - self-stabilizing hardware, software, and middleware - algorithms for high-speed networks, sensors, wireless and robots networks - mobile agents - peer-to-peer networks, sensor networks, MANETs, and wireless mesh networks - network topologies, overlays, and protocols - protocols for secure and reliable data transport and search in wireless mesh networks - information storage and sharing in wireless mesh networks Contributors are invited to submit a PDF file of their paper. Submissions should be no longer than 4800 words and should not exceed 12 pages on letter-size paper using at least 11 point font and reasonable margins (the page limit includes all figures, tables, and graphs). Submissions should include a cover page (that does not count towards the 12 page limit) that includes paper title, authors and affiliations, contact author's e-mail address, an abstract of the work in a few lines, and a few keywords. Submitted papers may have appendices beyond the 12 page limit, but reviewers are free to disregard any material beyond the 12 page limit. A paper submitted to SSS 2006 is expected to be original research not previously published; a submission may not be concurrently submitted or to any other conference, workshop, or journal. The proceedings of the conference will be published in the Springer Verlag Lecture Notes in Computer Science (LNCS) series. Selected papers will be published in a special issue of the ACM Transactions on Autonomous and Adaptive Systems (TAAS). -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060626/03bc9e97/attachment.htm From hahosoya at is.s.u-tokyo.ac.jp Tue Jun 27 02:03:27 2006 From: hahosoya at is.s.u-tokyo.ac.jp (Haruo HOSOYA) Date: Tue, 27 Jun 2006 15:03:27 +0900 Subject: [TYPES/announce] Paper announcement Message-ID: <19099D9F-1B22-451F-BFF9-3EDA9E535A19@is.s.u-tokyo.ac.jp> Dear folks, We are pleased to announce our new paper XML Transformation Language Based on Monadic Second Order Logic by Kazuhiro Inaba and Haruo Hosoya available through http://arbre.is.s.u-tokyo.ac.jp/~kinaba/MTran/mtran.pdf and our accompanying web-site providing an on-line demo: http://arbre.is.s.u-tokyo.ac.jp/~kinaba/MTran/ Any comments and suggests are always welcome. Best regards, Kazuhiro Inaba Haruo Hosoya ------------------------------------------------------------------ Abstract: Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO formulae are capable of expressing (1) all regular queries, (2) deep matching without explicit recursion, (3) queries in a ``don't-care semantics'' for unmentioned nodes and (4) $n$-ary queries for locating $n$-tuples of nodes. While previous frameworks for subtree extraction (path expressions, pattern matches, etc.) each had some of these properties, none has satisfied all of them. In this paper, we have designed and implemented a practical XML transformation language called MTran that fully exploits the expressiveness of MSO. MTran is a language based on ``select-and-transform'' templates similar in spirit to XSLT. However, we specialize our templates for expressing structure-preserving transformation so as to avoid any recursive calls to explicitly be written. Moreover, we allow templates to be nested so as to make use of an $n$-ary query that depends on the $n-1$ nodes selected by the preceding templates. For the implementation of the MTran language, we have developed, as the core part, an efficient evaluation strategy for $n$-ary MSO queries. This consists of (a) an exploitation of the existing MONA system for the translation from MSO formulae to tree automata and (b) our novel query evaluation algorithm for tree automata. Although a linear time algorithm has been known for nullary and unary queries, the best known algorithm for $n$-ary queries takes $O(rt+s)$ time in the worst case where $t$ is the size of the input document, $s$ is that of the output, and $r$ is the size of \textit{potential} matches during the query calculation, which can grow up to $t^{n-1}$ in the worst case. We have developed a more efficient $O(t+s)$ algorithm for $n$-ary queries by using partially lazy evaluation of set operations. From cbj at it.uts.edu.au Wed Jun 28 00:21:52 2006 From: cbj at it.uts.edu.au (Barry Jay) Date: Wed, 28 Jun 2006 14:21:52 +1000 Subject: [TYPES/announce] CFP: Computing: the Australasian Theory Symposium Message-ID: <44A203E0.1040001@it.uts.edu.au> The CATS call for papers is at www-staff.it.uts.edu.au/~cbj/cats07 Papers on type theory are most welcome. Regards, Barry Computing: The Australasian Theory Symposium /Computing: The Australasian Theory Symposium/ (CATS) in 2007 will be held in Ballarat in 2007. CATS is the premier theoretical computer science conference in Australasia. It is held annually as part of /Australasian Computer Science Week/ (ACSW) which comprises many other conferences and is overseen by the Computer Research and Education Association (CORE - previously CSA). CATS 2007 will be the thirteenth time that CATS has been held. The symposium will consist of invited talks and formal paper presentations. All papers will be fully refereed with proceedings published by CRPIT . Our invited speaker is Professor Jens Palsberg UCLA Call for papers Papers are invited on all aspects of Theoretical Computer Science. Some representative, but not exclusive, topics include the following: * logic and type systems * semantics of programming languages * formal program specification and transformation * concurrent, parallel and distributed systems * algorithms and data structures * automata theory and formal languages * computational complexity * applications of discrete mathematics and optimisation Full papers for CATS 2007 should be submitted electronically no later than Friday August 11 2006. Submissions must be original work, not published or submitted elsewhere. All submissions will be refereed. Accepted papers will appear in the published proceedings. Important Dates * Submission of abstracts Thursday July 27 2006 * Submission of full papers Friday August 11 2006 * Notification of authors Tuesday September 26 2006 * Final version due Friday October 20 2006 * Author registration Friday October 20 2006 Program Chairs Barry Jay University of Technology, Sydney Email: |cbj at it.uts.edu.au| Joachim Gudmundsson National ICT Australia Email: |Joachim.Gudmundsson at nicta.com.au| ? -- Associate Professor C.Barry Jay, Phone: (61 2) 9514 1814 Faculty of IT www-staff.it.uts.edu.au/~cbj University of Technology, Sydney. CRICOS Provider 00099F CATS07 homepage: www-staff.it.uts.edu.au/~cbj/cats07 From kwang at ropas.snu.ac.kr Wed Jun 28 00:43:32 2006 From: kwang at ropas.snu.ac.kr (Kwangkeun Yi) Date: Wed, 28 Jun 2006 13:43:32 +0900 Subject: [TYPES/announce] Call for Participation: SAS 2006 Message-ID: <20060628044332.GA8376@ropas.snu.ac.kr> ***************************************************************************** 2nd Call For Participation The 13th International Static Analysis Symposium (SAS'06) Seoul, Korea 29-31 August 2006 http://ropas.snu.ac.kr/sas06 ***************************************************************************** IMPORTANT DATES: Early registration: 05 August 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 13th SAS 2006 will 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. We have - three invited speakers - 23 papers and presentations - social program including an exciting excursion and banquet We hope to see you all at SAS'06 in Seoul! INVITED TALKS - Unleashing the Power of Static Analysis Manuvir Das, Microsoft - Separation Logic and Program Analysis Peter W. O'Hearn, Queen Mary, U. of London - Shape Analysis for Low-level Code Hongseok Yang, Seoul National U. ACCEPTED PAPERS - Static Analysis in Disjunctive Numerical Domains Sriram Sankaranarayanan, Franjo Ivancic, Ilya Shlyakhter and Aarti Gupta - Static Analysis of Numerical Algorithms Eric Goubault and Sylvie Putot - Static Analysis of String Manipulations in Critical Embedded C Programs Xavier Allamigeon, Wenceslas Godard and Charles Hymans - Abstract Regular Tree Model Checking of Complex Dynamic Data Structures Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz and Tomas Vojnar - Structural Invariants Ranjit Jhala, Rupak Majumdar and Ru-Gang Xu - Existential Label Flow Inference via CFL Reachability Polyvios Pratikakis, Jeffrey S. Foster and Michael Hicks - Abstract Interpretation with Specialized Definitions German Puebla, Elvira Albert and Manuel Hermenegildo - Underapproximating Predicate Transformers David A. Schmidt - Combining Widening and Acceleration in Linear Relation Analysis Laure Gonnord and Nicolas Halbwachs - Beyond Iteration Vectors: Instancewise Relational Abstract Domains Pierre Amiranoff, Albert Cohen and Paul Feautrier - Specialized 3-Valued Logic Shape Analysis using Structure-Based Refinement and Loose Embedding Gilad Arnold - Recency-Abstraction for Heap-Allocated Storage Gogul Balakrishnan and Thomas Reps - Interprocedural Shape Analysis with Separated Heap Abstractions Alexey Gotsman, Josh Berdine and Byron Cook - Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm Alexey Loginov, Thomas Reps and Mooly Sagiv - Catching and Identifying Bugs in Register Allocation Yuqiang Huang, Bruce R. Childers and Mary Lou Soffa - Certificate Translation for Optimizing Compilers Gilles Barthe, Benjamin Gr?goire, C?sar Kunz and Tamara Rezk - Analysis of Low-Level Code Using Cooperating Decompilers Bor-Yuh Evan Chang, Matthew Harren and George C. Necula - Static Analysis for Java Servlets and JSP Christian Kirkegaard and Anders M?ller - Cryptographically-Masked Flows Aslan Askarov, Daniel Hedin and Andrei Sabelfeld - Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems Julien Bertrane - Parametric and Termination-Sensitive Control Dependence Feng Chen and Grigore Rosu - Memory Leak Analysis by Contradiction Maksim Orlovich and Radu Rugina - Path-Sensitive Dataflow Analysis with Iterative Refinement Dinakar Dhurjati, Manuvir Das and Yue Yang REGISTRATION FEE - Early regular USD 380, Early student USD 280 - Late regular USD 430, Late student USD 330 ************************************************************************ From Bob.Coecke at comlab.ox.ac.uk Thu Jun 29 08:54:04 2006 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Thu, 29 Jun 2006 13:54:04 +0100 (BST) Subject: [TYPES/announce] Cats, Kets and Cloisters: Program and Registration. Message-ID: The provisional program of Cats, Kets and Cloisters i.e. Quantum Programing Languages IV Axiomatics for Quantum Mechanics New Models of Quantum Informatics Tensors, Knots and Braids in Logic and Physics is now available from: http://se10.comlab.ox.ac.uk:8080/FOCS/CKCinOXFORD_en.html Plenary speakers are: Richard Jozsa (University of Bristol), Basil Hiley (Birkbeck College, London) and Jim Lambek (McGill University, Montreal). Tutorials include: Quantum Information and Computation, Logic, and Semantics. There will also be 10 one-hour survey talks e.g. Classical vs. Quantum, Linear Logic, Quantum Cellular Automata, Measurement Based Quantum Computing, Temperley-Lieb Algebra a.o. The idea is to stimulate interaction between members of distinct research communities. Registration is possible via: http://se10.comlab.ox.ac.uk:8080/FOCS/CKCregistration_en.html You also find practical information at the main website. Best wishes, Bob Coecke. --- EPSRC Advanced Fellow, Oxford University Computing Laboratory. http://se10.comlab.ox.ac.uk:8080/BobCoecke/Home_en.html From Pierre-Louis.Curien at pps.jussieu.fr Thu Jun 29 15:29:14 2006 From: Pierre-Louis.Curien at pps.jussieu.fr (Curien Pierre-Louis) Date: Thu, 29 Jun 2006 21:29:14 +0200 Subject: [TYPES/announce] Position preannouncement in Paris 7 (in ** mathematics **) Message-ID: POSITION PRE-ANNOUNCEMENT A position of Maitre de Conferences (permanent position) in mathematics is likely to be opened next year at Paris 7 University. The hired candidate will work in the laboratory PPS (Preuves, Programmes et Systemes), which spreads its interests on both sides of the correspondence between proofs and programs, covering work on language design and implementation, rewriting, semantics (and game semantics in particular), categories, linear logic, realizability, probabilistic and topological methods, etc... See www.pps.jussieu.fr. The position will be opened around February 2007, with decisions taken around May 2007, and job starting in September 2007. But there is a preliminary phase called ** qualification **, through which all candidates to academic positions in France have to go. This procedure consists of an evaluation of both research and teaching experience of candidates in view of their potential application to a position in a French university. The first phase of this (rather light) procedure is opened on September 11, 2006, and *** closes on October 16, 2006 *** and is entirely electronical (http://www.education.gouv.fr/personnel/enseignant_superieur/ enseignant_chercheur/calendrier_qualification.htm). The section of qualification should be preferably number 25 (mathe'matiques), but candidates interested in multiple applications in France, including in CS departments, may also apply for qualification in section 27 (informatique) simultaneously. This approaching first deadline is the main reason for the present early announcement. A certain fluency in French is required for the position. The teaching will be in the mathematics department, so some experience in teaching mathematics (rather than computer science) is welcome Teaching is in French. I invite potential candidates to contact me, and I also encourage colleagues to point me to interesting potential candidates fitting the criteria. Best regards, Pierre=Louis Curien curien at pps.jussieu.fr From Fabio.Martinelli at iit.cnr.it Fri Jun 30 08:35:44 2006 From: Fabio.Martinelli at iit.cnr.it (Fabio Martinelli) Date: Fri, 30 Jun 2006 14:35:44 +0200 Subject: [TYPES/announce] FAST2006: Deadline extended - 4th International Workshop on Formal Aspects in Security & Trust Message-ID: <44A51AA0.4010706@iit.cnr.it> *Apologies for multiple copies* ------------------------------------------------ 4th International Workshop on Formal Aspects in Security & Trust (FAST2006) August 26-27 2006 Hamilton, Ontario Canada www.iit.cnr.it/FAST2006/ FAST2006 is a satellite event of 14th Formal Methods Symposium (FM2006). FAST is under the auspices of IFIP WG 1.7 ------------------------------------------------ NEWS: Deadline extended July 5! (See also the submission guidelines) OVERVIEW OF FAST The fourth International Workshop on Formal Aspects in Security and Trust (FAST2006) aims at continuing the successful efforts of the first three FAST workshops for fostering the cooperation among researchers in the areas of security and trust. The new challenges offered by the so-called ambient intelligence space as a future paradigm in the information society demands for a coherent framework of concepts, tools and methodologies to enable user' trust&confidence on the underlying communication infrastructure. These need to address issues relating to both guaranteeing security of the infrastructure and the perception of the infrastructure being secure. In addition, user confidence on what is happening must be enhanced by developing trust models effective but also easily comprehensible and manageable by users. The complexity and scale of deployment of emerging ICT systems based on web service and grid computing concepts also necessitates the investigation of new, scalable and more flexible foundational models of enforcing pervasive security across organizational borders and in situations where there is high uncertainty about the identity and trustworthiness of the participating networked entities (including users, services and resources). The increasing need of building activities sharing different resources managed with different policies demand for new and business enabling models of trust between members of virtual communities including virtual organizations that span across the boundaries of physical enterprises and loosely structured communities of individuals. PAPER SUBMISSION Suggested submission topics include, but are not limited to: Formal models for security, trust and reputation Security protocol design and analysis Logics for security and trust Type systems for security and trust Aspects in Security & Trust Trust-based reasoning Distributed Trust Management Systems Digital Assets Protection Data protection Privacy and ID management issues Information flow analysis Language-based security Security and Trust aspects in ubiquitous computing Validation/Analysis tools Web/Grid Services Security/Trust/Privacy Security and Risk Assessment Case studies IMPORTANT DATES Paper Submission: 05 July 2006 (Extended) Author Notification: 29 July 2006 Pre-proceedings version: 10 August2006 Workshop: 26-27 August 2006 Post-proceedings version: 30 September 2006 Invited Speaker Joshua Guttman, MITRE, USA Organizers . Theo Dimitrakos, BT, UK . Fabio Martinelli, IIT-CNR, Italy . Peter Ryan, University of Newcastle, UK . Steve Schneider, University of Surrey, UK Program Committee ?Gilles Barthe, INRIA Sophia-Antipolis, France .Stefano Bistarelli, University of Pescara, Italy .Gregor v. Bochmann, University of Ottawa, Canada ?John A Clark, University of York, UK ?Fre'de'ric Cuppens, ENST Bretagne, France ?Roberto Gorrieri, University of Bologna, Italy .Joshua Guttman, MITRE, USA ?Masami Hagiya, University of Tokyo, Japan ?Chris Hankin, Imperial College (London), UK ?Christian Jensen, DTU, Denmark ?Audun Josang, DSTC, Australia ?Jan J?rjens, TU M?nchen, Germany ?Yuecel Karabulut, SAP, Germany ?Igor Kotenko, SPIIRAS, Russia ?Heiko Krumm, University of Dortmund, Germany ?Ninghui Li, Purdue University, USA ?Steve Marsh, NRC, Canada ?Catherine Meadows, Naval Research Lab, USA ?Ron van der Meyden, University of New South Wales, Australia ?Mogens Nielsen, University of Aarhus, Denmark .Flemming Nielson, Danish Technical University, Denmark ?Indrajit Ray, Colorado State University, USA ?Babak Sadighi Firozabadi, SICS, Sweden, ?Pierangela Samarati, University of Milan, Italy ?Jean-Marc Seigneur, University of Geneva, Switzerland .Paul Syverson, Naval Research Lab, USA ?Ketil Stolen, SINTEF, Norway ?William H. Winsborough, University of Texas at San Antonio, USA PROCEEDINGS As for the previous editions, the post-proceedings of the workshop will be published with LNCS and a special journal issue is also planned. SUBMISSION GUIDELINES: Papers presenting original contributions are sought. Two formats of submissions are possible: 1) short papers, up to 5 pages, 2) full papers, up to 15 pages. Submissions should clearly state their category (1 or 2). Author's full name, address, and e-mail must appear in the cover page. Accepted full papers will be published in the formal post-proceedings. Short papers will be published in the informal proceedings distributed at the workshop (together with the accepted full papers). After the workshop, authors of short papers which are judged mature for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures, and accepted papers will be published in the post-proceedings on LNCS (together with the accepted full papers). Simultaneous submission of full papers to a journal or conference/workshop with formal proceedings is not allowed. From Laurent.Vigneron at loria.fr Fri Jun 30 19:17:55 2006 From: Laurent.Vigneron at loria.fr (Laurent.Vigneron@loria.fr) Date: Sat, 1 Jul 2006 01:17:55 +0200 Subject: [TYPES/announce] The AVISPA Tool - v1.1 Message-ID: <200606302317.k5UNHte06123@valhey.loria.fr> [We apologize if you received multiple copies of this message] XXX X X XXXXX XXXXX XXXXXX XXX X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X XXXXXXX X X X XXXXX XXXXXX XXXXXXX X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X XXXXX XXXXX X X X V E R S I O N 1 . 1 (June 30, 2006) We are happy to announce the availability of a new version of the AVISPA Tool, a push-button tool for the Automatic Validation of Internet Security-sensitive Protocols and Applications. The AVISPA Tool v1.1 is available at http://www.avispa-project.org The AVISPA Tool v1.1 includes several bug fixes and extends the previous versions of the AVISPA Tool with several new features (see the NEWS section below). ======== OVERVIEW ======== The AVISPA Tool is a push-button tool for the automated validation of Internet security-sensitive protocols and applications. It provides a modular and expressive formal language (called HLPSL) for specifying protocols and their security properties, and integrates different back-ends that implement a variety of state-of-the-art automatic analysis techniques ranging from protocol falsification (by finding an attack on the input protocol) to abstraction-based verification methods for both finite and infinite numbers of sessions. The HLPSL is an expressive, modular, role-based, formal language that allows for the specification of control flow patterns, data-structures, complex security properties, as well as different cryptographic primitives and their algebraic properties. These features make HLPSL well suited for specifying modern, industrial-scale protocols. Moreover, the HLPSL enjoys both a declarative semantics based on a fragment of the Temporal Logic of Actions and an operational semantics based on a translation into the rewrite-based formalism Intermediate Format IF. The AVISPA Tool automatically translates HLPSL specifications into equivalent IF specifications which are in turn fed to the back-ends. The following back-ends are integrated in the AVISPA Tool: * The On-the-fly Model-Checker (OFMC) performs protocol falsification and bounded verification by exploring the transition system described by an IF specification in a demand-driven way. OFMC implements a number of correct and complete symbolic techniques. It supports the specification of algebraic properties of cryptographic operators, and typed and untyped protocol models. * The Constraint-Logic-based Attack Searcher (CL-AtSe) applies constraint solving with some powerful simplification heuristics and redundancy elimination techniques. CL-AtSe is built in a modular way and is open to extensions for handling algebraic properties of cryptographic operators. It supports type-flaw detection and handles associativity of message concatenation. * The SAT-based Model-Checker (SATMC) builds a propositional formula encoding a bounded unrolling of the transition relation specified by the IF, the initial state and the set of states representing a violation of the security properties. The propositional formula is then fed to a state-of-the-art SAT solver and any model found is translated back into an attack. * The TA4SP (Tree Automata based on Automatic Approximations for the Analysis of Security Protocols) back-end approximates the intruder knowledge by using regular tree languages and rewriting. For secrecy properties, TA4SP can show whether a protocol is flawed (by under-approximation) or whether it is safe for any number of sessions (by over-approximation). In order to demonstrate the effectiveness of the AVISPA Tool on a large collection of practically relevant, industrial protocols, we have selected a substantial set of security problems associated with protocols that have recently been or are currently being standardized by organizations like the Internet Engineering Task Force IETF. We have then formalized in HLPSL a large subset of these protocols, and the result of this specification effort is the AVISPA Library (publicly available at the AVISPA web-page), which at present comprises 112 security problems derived from 33 protocols. Further details on the AVISPA Tool and on the AVISPA project can be found in the paper: A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.C. Heam, O. Kouchnarenko, J. Mantovani, S. Moedersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Vigano`, L. Vigneron. "The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications." In Proc. CAV'05, LNCS. Springer Verlag, 2005, Available at the URL http://www.avispa-project.org/avispa-cav05.ps ==== NEWS ==== * All known bugs have been fixed. * All back-ends have been optimised for improved performance. * The translator from HLPSL to IF has been improved, with only minor changes in the syntax: - The HLPSL type "function" being too ambiguous, it has been renamed "hash_func". - More semantic tests are done for detecting incomplete goal specifications or missing new() assignments. - The handling of sets has been simplified in the translator. - Predefined constant functions, like xor and exp, are better handled. - Warning and error messages are more precise. * OFMC, CL-AtSe, and SATMC support user-defined (non temporal) security goals. * OFMC now supports reasoning modulo a user-specified algebraic theory. * CL-Atse has improved in many ways: - Algebraic properties : CL-Atse now supports complete analysis of cryptographic protocols modulo the xor, including all the intruder deduction rules for that operator. CL-Atse also implements complete analysis modulo the exponential except for the rule g^1 = g (i.e. exponentials are tagged). Also, some improvements on the code for algebraic properties (speed, bug correction, etc.) have been added. - The protocol optimisation module now allows CL-Atse to perform advanced optimisations of the protocol specification before the analysis, and may greatly reduce the analysis time. Now, CL-Atse can statically decide the origin of certain messages and reduce the non-determinism of the analysis accordingly. - User interaction (output presentation, options, etc..) improved. * The AVISPA XEmacs mode has been improved and it is now a powerful environment for writing protocol specifications and analysing them. * A new contribution has been added: hlpsldoc. It contains script files that automatically generate either a LaTeX file or a HTML file from a HLPSL specification. It has been used to generate the online AVISPA library. ======== PARTNERS ======== The following research groups have contributed to the development of the AVISPA Tool: * Artificial Intelligence Laboratory, Dipartimento di Informatica, Sistemistica e Telematica (DIST), University of Genova, Italy * Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA UMR 7503) with partners INRIA, CNRS, Universite' Henri Poincare' (UHP) Université Nancy 2 AND Laboratoire d'Informatique de l'Universite' de Franche-Comte', France * Eidgenoessische Technische Hochschule Zuerich (ETHZ), Information Security Group, Department of Computer Science, Zuerich, Switzerland * Siemens Aktiengesellschaft, Munich, Germany ================ GETTING IN TOUCH ================ The home page of the AVISPA project is . A mailing list for general questions, bugs and bug fixes, possible extensions, and user requests on the AVISPA Tool is available. To register please send an empty message to New releases and other important events for AVISPA will be also announced on this list. -- The AVISPA Team http://www.avispa-project.org From zucker at cas.mcmaster.ca Sun Jul 2 07:55:47 2006 From: zucker at cas.mcmaster.ca (Jeffery Zucker) Date: Sun, 2 Jul 2006 07:55:47 -0400 (EDT) Subject: [TYPES/announce] FORMAL METHODS 2006: Early Reg. Deadline Message-ID: <200607021155.k62BtlOk026308@mills.cas.mcmaster.ca> FM'06: 14TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS 21 - 27 August 2006 McMaster University, Hamilton, Ontario, Canada http://fm06.mcmaster.ca/ REMINDER: EARLY REGISTRATION ENDS ON JULY 7 The FM Symposia continue to be the premier international forum for practitioners and researchers applying mathematical methods to the design of highly trusted computer systems. It enables them to meet and exchange experiences and ideas. This is the 14th event in this series, and for the first time will take place in North America. Among the highlights: * Technical Symposium with 36 papers (out of 158 submissions) and Best Paper Award * Doctoral Symposium, aimed at young researchers * Industry Day with 8 speakers reporting on industrial usage * 5 Invited Speakers * 10 Tutorials * 4 Workshops * Commercial Tool Exhibition * Research Poster and Tool Exhibition * Book Exhibition From bcpierce at cis.upenn.edu Sun Jul 2 14:25:41 2006 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Sun, 2 Jul 2006 14:25:41 -0400 Subject: [TYPES/announce] CFP: International Conference on Tests And Proofs (TAP) Message-ID: [Type systems have been used for decades for proving various aspects of program correctness, but -- with some notable exceptions, such as Claessen and Hughes's QuickCheck tool for Haskell -- have not found nearly so many applications in the area of software *testing*. This new meeting presents an interesting opportunity to push further in this direction. -BCP] CALL FOR PAPERS TAP International Conference: Tests And Proofs 12-14 February 2007 ETH Zurich, Switzerland http://tap.ethz.ch/ === THEME AND GOALS === To prove the correctness of a program is to demonstrate, through impeccable mathematical techniques, that it has no bugs; to test a program is to run it with the expectation of discovering bugs. The two techniques seem contradictory: if you have proved your program, it's fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on any hope to prove its correctness. Accordingly, proofs and tests have, since the onset of software engineering research, been pursued by distinct communities using rather different techniques and tools. And yet the development of both approaches leads to the discovery of common issues and to the realization that each may need the other. The emergence of model checking has been one of the first signs that contradiction may yield to complementarity, but in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. === CONTRIBUTIONS === The TAP conference is an international event entirely devoted to this convergence of proofs and tests. Contributions talking just about proof techniques, or just about testing techniques, are not appropriate for submission to TAP; instead we are interested in work that combines ideas from both sides, for the advancement of software quality. Possible topics include (as an indicative rather than exhaustive list): - Generation of test cases or oracles by theorem proving - Generation of test cases or oracles by constraint logic programming - Generation of test cases or oracles by model checking - Generation of test cases or oracles by symbolic execution - Program proving with the aid of testing techniques - Automatic tools - Case studies - Formal frameworks - Verification techniques combining proofs and tests - Experience reports on these topics Contributions should present high-quality, original work and may not be already published or submitted elsewhere. They should be submitted in PDF (with all fonts embedded) using the LNCS format, and may take the form of either short papers (limit: 8 pages) or long papers (limit: 16 pages). Limits include all text, references, appendices, figures, and tables. Submissions should be made online via the submission site, to which a link will be provided at http://tap.ethz.ch/callforpapers.html. === IMPORTANT DATES === Submission deadline: 30 September 2006, 24:00 (midnight), Zurich time (no extensions will be granted) Notification of acceptance: 15 November 2006 Camera-ready copy: 7 December 2006 Conference: 12-14 February 2007 === COMMITTEES === CHAIRPERSONS Conference chair: Bertrand Meyer, ETH Zurich, Switzerland Program chair: Yuri Gurevich, Microsoft Research, USA PROGRAM COMMITTEE Chandrasekhar Boyapati, University of Michigan, USA Ed Clarke, Carnegie-Mellon University, USA Michael Ernst, MIT CSAIL, USA Kokichi Futatsugi, JAIST, Japan Tom Henzinger, EPFL, Switzerland Daniel Kroening, ETH Zurich, Switzerland Gary Leavens, Iowa State University, USA Bertrand Meyer, ETH Zurich, Switzerland Peter M?ller, ETH Zurich, Switzerland Huaikou Miao, Shanghai University, China Jeff Offutt, George Mason University, USA Jonathan Ostroff, York University, Canada Benjamin Pierce, University of Pennsylvania, USA Wolfram Schulte, Microsoft Research, USA Yannis Smaragdakis, Georgia Tech, USA Tao Xie, North Carolina State University, USA ORGANIZING COMMITTEE Lisa (Ling) Liu, ETH Zurich (Chair) Ilinca Ciupa, ETH Zurich Claudia Guenthart, ETH Zurich Andreas Leitner, ETH Zurich Manuel Oriol, ETH Zurich From als at inf.ed.ac.uk Mon Jul 3 09:48:57 2006 From: als at inf.ed.ac.uk (Alex Simpson) Date: Mon, 03 Jul 2006 14:48:57 +0100 Subject: [TYPES/announce] Symposium for Gordon Plotkin: Call for Participation Message-ID: <20060703144857.p14gzimxw0wgc0ck@mail.inf.ed.ac.uk> SYMPOSIUM FOR GORDON PLOTKIN 7-8 September, 2006 LFCS, School of Informatics, University of Edinburgh A symposium to celebrate the 60th birthday of Gordon Plotkin http://www.lfcs.ed.ac.uk/events/plotkin-symposium/ CALL FOR PARTICIPATION PROGRAMME: Two days of invited talks on 7th and 8th September, with a banquet on the evening of Thursday 7th September. INVITED SPEAKERS: Martin Abadi (UC Santa Cruz); Samson Abramsky (University of Oxford); Rod Burstall (University of Edinburgh, Emeritus); Luca Cardelli (Microsoft Research, Cambridge); Marcelo Fiore (University of Cambridge); Philippa Gardner (Imperial College); Matthew Hennessy (University of Sussex); Robin Milner (Univerity of Cambridge, Emeritus); Eugenio Moggi (Universita` di Genova); John Power (University of Edinburgh); David Pym (Hewlett-Packard Laboratories, Bristol); Dana Scott (Carnegie Mellon University, Emeritus); Colin Stirling (University of Edinburgh); Glynn Winskel (University of Cambridge). SUPPORT FOR PHD STUDENTS: Financial assistance is available for UK-based PhD students who wish to attend the symposium. This will be issued on a first-come first-served basis. REGISTRATION: is now open. For more information see webpage. From floc at informatik.hu-berlin.de Mon Jul 3 18:23:04 2006 From: floc at informatik.hu-berlin.de (Kreutzer + Schweikardt) Date: Tue, 4 Jul 2006 00:23:04 +0200 (CEST) Subject: [TYPES/announce] FLoC 06 -- Call For Participation Message-ID: <20060703222304.DEA5967DB6@riemann.informatik.hu-berlin.de> Call for Participation --- FLoC'06 The 2006 Federated Logic Conference Seattle, Washington, USA August 10 -- August 22, 2006 http://www.easychair.org/FLoC-06/ Early registration deadline: July 10, 2006. We are pleased to announce the fourth Federated Logic Conference (FLoC'06) to be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.easychair.org/FLoC-06/floc-hotel.html). FLoC'06 promises to be the premier scientific meeting in computational logic in 2006. The following conferences will participate in FLoC'06: CAV Conference on Computer Aided Verification (Aug 17-20) ICLP Int'l Conference on Logic Programming (Aug 17-20) IJCAR Int'l Joint Conference on Automated Reasoning (Aug 17-20) LICS IEEE Symposium on Logic in Computer Science (Aug 12-15) RTA Conference on Rewriting Techniques and Applications (Aug 12-14) SAT Int'l Conference on Theory and Applications of Satisfiability Testing (Aug 12-15) The six major conferences will be accompanied by 41 workshops, held on Aug. 10-11, 15-16, and 21-22. The FLoC'06 program includes a keynote session to commemorate the Goedel Centenary, with John Dawson and Dana Scott as speakers, a keynote talk by David Harel, plenary talks by Randy Bryant and David Dill, and invited talks by F. Bacchus, A. Blass, B. Buchberger, A. Darwiche, M. Das, J. Esparza, J. Giesl, A. Gordon, T. Hoare, O. Kupferman, M. Lam, D. Miller, K. Sakallah, J. Stoy, and C. Welty. Seattle, the Emerald city, sits on the shores of Puget Sound surrounded by mountains to the east and west. Lovely views of blue waters and snow capped peaks seem to appear everywhere - around the next bend in the road or between the buildings downtown. Seattle is the gateway to the Pacific Northwest, a premier tourist attraction. In Seattle, Mt. Rainier enchants visitors; in Vancouver, British Columbia, the Coast Range juts out over downtown; and in Portland, 5,000 acres of forestland north of the city center harbor deer, elk, and the odd bear and cougar. Online registration for FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for early registration is July 10, 2006. The rates agreed upon between FLoC and the Seattle Sheraton are very reasonable rates for a first-class hotel in downtown Seattle during the summer vacation season. To reduce conference costs and keep registration fees reasonable, FLoC is contractually obligated to meet a commitment for a certain number of FloC attendees staying in the conference hotel. FLoC attendees are strongly encouraged to use the Seattle Sheraton for conference accommodation. Deadline for preferred hotel rate is July 21, 2006. FLoC'06 Steering Committee Moshe Y. Vardi (General Chair) Thomas Ball (Conference Co-Chair) Jakob Rehof (Conference Co-Chair) Edmund Clarke (CAV) Reiner Hahnle (IJCAR) Manuel Hermenegildo (ICLP) Phokion Kolaitis (LICS) Henry Kautz (SAT) Aart Middeldorp (RTA) Andrei Voronkov (IJCAR) From tom7 at cs.cmu.edu Mon Jul 3 15:10:14 2006 From: tom7 at cs.cmu.edu (Tom Murphy) Date: Mon, 3 Jul 2006 15:10:14 -0400 (EDT) Subject: [TYPES/announce] 2006 ICFP Programming Contest registration opens Message-ID: Language lovers: Registration is now open for the 9th Annual ICFP Programming Contest! http://icfpcontest.org/ The contest, associated with the International Conference on Functional Programming, will be held on the weekend of July 21-24. The contest task will be released at noon EDT on Friday, and entries will be accepted until noon EDT on Monday. Registration is free and open to all. Teams may participate from any location, and may use any programming language(s). Last year, 360 participants formed 161 teams from 26 countries. Prize money totaling $1750 US will be awarded to help defray the costs of travel to the conference for the winners and for small cash prizes. In addition, the winners of the contest will receive bragging rights for the programming language of their choice. This makes the contest a popular avenue for demonstrating the superiority of a favorite language, or for exercising an experimental tool. Though the specifics are secret until the contest begins, we promise that this year's task will be very different from past competitions. This year's theme is "computational archaeolinguistics." Stay tuned for more information as the contest approaches! - 2006 Contest Organizers CMU Principles of Programming Group icfpcontest-organizers at lists.andrew.cmu.edu From mgradina at irisa.fr Mon Jul 3 10:37:51 2006 From: mgradina at irisa.fr (Maria Gradinariu) Date: Mon, 3 Jul 2006 16:37:51 +0200 Subject: [TYPES/announce] SSS 2006 ---- Deadline extended to July 12 Message-ID: <270601c69eae$99e975b0$1c33fe83@irisa.fr> [Please accept our apologies if you receive multiple copies of this message.] Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (formerly Symposium on Self-stabilizing Systems) (SSS 2006) November 17th-19th, 2006 Dallas, Texas, USA http://www.irisa.fr/sss/2006/ ============================================================================== Selected papers will be published in a special issue of the ACM Transactions on Autonomous and Adaptive Systems (TAAS). ============================================================================== ============================================================================== Important Dates Paper Submission: 4:59 PM Pacific Time, July 12, 2006 Notification to Authors: August 21st, 2006 Camera-ready: August 31st, 2006 Symposium: November 17th-19th, 2006 ============================================================================= The Symposium is a prestigious international forum for researchers and practitioners in the design and development of fault-tolerant distributed systems with self-* properties, such as self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. The theory of self-stabilization has been enriched in the last 25 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-* properties in fault-tolerant distributed systems. Research in distributed systems is now at a crucial point in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. Now, more than ever, the theory of self-stabilization has tremendous impact in these areas. Therefore, this year, we are extending the scope of the symposium to cover all safety and security related aspects of self-* systems. The title of the conference has been changed to reflect this expansion. There will be three tracks: networking, safety and security, and self-* properties in static and dynamic systems. The symposium solicits contributions on all aspects of self-stabilization, safety and security, recovery oriented systems and programing, from theoretical contributions, to reports of the actual experience of applying the principles of self-stabilization to static and dynamic systems. Topics of interest include, but are not limited to: Stabilization: - self-stabilizing systems - self-managed, self-assembling, autonomic and adaptive systems - self-optimizing and self-protecting systems - self-* abstractions for implementing fundamental services in static and dynamic distributed systems - impossibility results and lower bounds for self-* systems - application of stabilizing algorithms and techniques in dynamic distributed systems - data and code stabilization - algorithms for self-* error detection/correction Safety: - safety critical systems - trust models and specifications - semantics of trust, distrust, mistrust, over-trust, cheat, risk and reputation - trust-related security and privacy - reliable and dependable systems - fault-tolerant systems, hardware redundancy, robustness, survivable systems, failure recovery Security: - security of network protocols - security of sensor and mobile networks protocols - secure architectures, frameworks, policy, intrusion detection/awareness - proactive security - self-* properties and their relation with classical fault-tolerance and security - security protocols for self-* systems Networks and Applications: - models of fault-tolerant communication - stochastic, physical, and biological models to analyze self-* properties - communication complexity - data structures for efficient communication - self-stabilizing hardware, software, and middleware - algorithms for high-speed networks, sensors, wireless and robots networks - mobile agents - peer-to-peer networks, sensor networks, MANETs, and wireless mesh networks - network topologies, overlays, and protocols - protocols for secure and reliable data transport and search in wireless mesh networks - information storage and sharing in wireless mesh networks Contributors are invited to submit a PDF file of their paper. Submissions should be no longer than 4800 words and should not exceed 12 pages on letter-size paper using at least 11 point font and reasonable margins (the page limit includes all figures, tables, and graphs). Submissions should include a cover page (that does not count towards the 12 page limit) that includes paper title, authors and affiliations, contact author's e-mail address, an abstract of the work in a few lines, and a few keywords. Submitted papers may have appendices beyond the 12 page limit, but reviewers are free to disregard any material beyond the 12 page limit. A paper submitted to SSS 2006 is expected to be original research not previously published; a submission may not be concurrently submitted or to any other conference, workshop, or journal. The proceedings of the conference will be published in the Springer Verlag Lecture Notes in Computer Science (LNCS) series. Selected papers will be published in a special issue of the ACM Transactions on Autonomous and Adaptive Systems (TAAS). -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060703/a5948ab9/attachment.htm From henglein at diku.dk Wed Jul 5 11:44:54 2006 From: henglein at diku.dk (Fritz Henglein) Date: Wed, 5 Jul 2006 17:44:54 +0200 Subject: [TYPES/announce] 4 Ph.D. scholarships available at DIKU In-Reply-To: References: Message-ID: [Dear Types reader: Language-based security based on type systems is one of the research areas of interest in the enclosed announcement.] 4 Ph.D.-scholarships at the Theory and Practice of Programming Languages (TOPPS) group at the Department of Computer Science, University of Copenhagen (DIKU) are available in connection with 3gERP, a joint research project with Copenhagen Business School and Microsoft. We are looking for strong computer science majors with interests (and preferablely a bit of background) in formal methods and programming language technology, such as declarative (functional and/or logical) programming, process algebras, type systems, static analysis, abstract interpretation, etc. The full text of the Ph.D. scholarship announcements is at http://www.3gERP.org/scholarships.pdf . See http://www.3gERP.org for more information on 3gERP. Please feel free to pass this message on to other colleagues and students who might be interested in the scholarships (or the 3gERP Project). Fritz -- Fritz Henglein, Ph.D. Professor mso Dept. of Computer Science, University of Copenhagen (DIKU) Universitetsparken 1 DK-2100 Copenhagen Denmark Email: henglein at diku.dk Tel.: +45-35321463 (office at DIKU), +45-77343435 (office at home), +45-41414158 (cell) Skype: henglein -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060705/8cbaf642/attachment.htm From blanqui at loria.fr Wed Jul 5 14:04:38 2006 From: blanqui at loria.fr (Frederic Blanqui) Date: Wed, 5 Jul 2006 20:04:38 +0200 (CEST) Subject: [TYPES/announce] INRIA postdoc position: certification of termination proofs Message-ID: Various grants for one-year postdocs are open at LORIA [http://www.loria.fr/]. The Protheo team is looking for candidates having a good knowledge of some proof assistant like Coq, Isabelle, Agda, etc. to contribute to the CoLoR project of: Certification of termination proofs See http://color.loria.fr/ for a more detailed presentation of the project. To postulate, you need to get your PhD between May 2005 and November 2006. The salary is 2150 ? gross per month. If you are interested, please send a curriculum vitae to Frederic Blanqui (name at loria.fr) before July 13. You may also send recommandation letters. DEADLINE: July 13 ! From Marc.Pantel at enseeiht.fr Wed Jul 5 18:52:04 2006 From: Marc.Pantel at enseeiht.fr (Marc Pantel) Date: Thu, 06 Jul 2006 00:52:04 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?F=E9RIA-IRIT_PhD_position_on_cert?= =?iso-8859-1?q?ified_real-time=09code_generator?= Message-ID: <1152139924.5243.11.camel@localhost.localdomain> PhD proposal in F?RIA-IRIT, Toulouse, France Formal certification of code generator for hybrid systems This proposal takes place in the GENE-AUTO project from the French ?Aerospace Valley? pole of competence in Toulouse. One of the key approaches used is to leverage formal technologies to the level of tackling real industrial problems. The GENE-AUTO project aims at defining and implementing a certified code generator for real-time critical embedded applications in Automotive and Aerospace industries. This generator should take as input high level hybrid models such as defined using SimuLink/StateFlow (MathWorks TM) or SciCos and producing either human readable C code or highly optimised assembly language for dedicated architectures. Currently, industrial code generator are only validated using test-based framework. Many research work have been developed in order to apply formal methods to this specific problem. Very good results for domain specific languages, academic languages or subsets of industrial languages have been obtained. However, bridging the gap with a real-size industrial hybrid modelling language remains a challenging task. The purpose of the proposed PhD is to design a multi-pass approach in order to tackle realistic optimising code generator with very strict certification rules. A lot of intermediate languages will be used so that the semantic bridge between each languages should be relatively narrow. Each bridge can then be passed using the most appropriate validation technology. This work will be funded by GENE-AUTO industrial partners (SIEMENS/VDO, AIRBUS, EADS-ASTRIUM, ALCATEL-ALENIA, BARCO, IAI) through the IERSET. This work will take place in the LYRE and ACADIE teams of IRIT (Research Institute in Computer Science at Toulouse, http://www.irit.fr), one of the biggest laboratory in Computer Science in France located in Toulouse, one of the main design site for Aerospace and embedded systems in Europe. To have more information, please contact Marc.Pantel_at_enseeiht.fr (replace _at_ with @). Candidates should have a master degree in Computer Science, have experiences using formal methods and be knowledgeable in language engineering. From rvg at cs.stanford.edu Wed Jul 5 19:46:00 2006 From: rvg at cs.stanford.edu (Rob van Glabbeek) Date: Wed, 5 Jul 2006 16:46:00 -0700 (PDT) Subject: [TYPES/announce] SOS 2006 - Programme and Call for Participation Message-ID: <200607052346.k65Nk0B01001@kilby.Stanford.EDU> CALL FOR PARTICIPATION: Structural Operational Semantics 2006 - a satellite workshop of CONCUR 2006 26th August 2006, Bonn (Germany) http://www.cse.unsw.edu.au/~rvg/SOS2006/ !!! Early registration until 18th July !!! INVITED SPEAKERS: Bartek Klin (Warsaw, PL) Robin Milner (Cambridge, UK) - joint Express-Infinity-SOS talk PROGRAMME: 09:00 Registration 09:15 Welcome 09:30 Bartek Klin (invited talk): Bialgebraic methods in structural operational semantics 10:30 break 11:00 MohammadReza Mousavi, Michel A. Reniers: On well-foundedness and expressiveness of promoted tyft 11:30 Christiano Braga, Alberto Verdejo: Modular SOS with strategies 12:00 Adrian Pop, Peter Fritzson: An Eclipse-based integrated environment for developing executable structural operational semantics specifications (tool demonstration) 12:30 lunch 14:30 Robin Milner (joint invited Express-Infinity-SOS talk): Bigraphs, multi-local names and confluence 15:30 break 16:30 Henrik Pilegaard, Flemming Nielson, Hanne Riis Nielson: Active evaluation contexts for reaction semantics 17:00 Simone Tini: Notes on probabilistic bisimulations 17:30 Vincent Danos, Jean Krivine, Fabien Tarissan: Self-assembling trees 18:00 Close CONTACT: sos2006 at cs.stanford.edu WORKSHOP ORGANISERS: Rob van Glabbeek National ICT Australia Locked Bag 6016 University of New South Wales Sydney, NSW 1466 Australia Peter D. Mosses Department of Computer Science Swansea University Singleton Park Swansea SA2 8PP United Kingdom From leavens at cs.iastate.edu Fri Jul 7 02:26:59 2006 From: leavens at cs.iastate.edu (Gary T. Leavens) Date: Fri, 7 Jul 2006 01:26:59 -0500 (CDT) Subject: [TYPES/announce] Call for papers, SAVCBS'06 Message-ID: [Papers on types related techniques, such as static analysis and verification are welcome.] Call for Papers SAVCBS'06 Workshop at ACM SIGSOFT 2006/FSE-14 November 10-11, 2006 http://www.cs.iastate.edu/SAVCBS/ The fifth workshop on specification and verification of component-based systems is affiliated with ACM SIGSOFT 2006/FSE-14 and will be held in Portland, Oregon, November 10-11, 2006. Papers are due August 15, 2006. THEME AND TOPICS OF INTEREST SAVCBS is focused on using formal (i.e., mathematical) techniques to establish a foundation for the specification and verification of component-based systems. Suggested research topics of interest include (but are not limited to): * Techniques for component-based verification or reasoning * Component-based specification languages * Static analysis of components and component compositions * Verification-oriented design methodologies for components * Dynamic checking techniques, including run-time assertion or property checking * Specification and verification of non-functional component behavior (performance, memory, concurrency, etc.) * Unifying formal descriptions of concurrency properties with model-based behavioral descriptions of components * Balancing tradeoffs (automatic/manual verification, soundness/completeness, static/dynamic verification, testing/formal verification, scalability/coverage, etc.) * Theories of component composition * Industrial experience, such as adoption issues, with formal techniques for component-based systems * Case studies of applying formal techniques to component based systems * Educational experience or tactics for formal approaches to component-based systems Submissions should outline the current state of research or practice, describe the most pressing shortcomings, and formulate goals for future development. CHALLENGE PROBLEM One session during the workshop will be devoted to presenting solutions (full or partial) to a challenge problem. This problem will present features that pose difficulties for current specification technologies. The session will be open both to presenters as well as participants of the workshop. Details on the challenge problem will be posted on the SAVCBS web site. Solutions should illustrate innovative features of specification or verification as they pertain to this particular problem. SUBMISSIONS Submissions must not exceed 7 pages. We encourage, but do not require, use of the ACM Conference format. We also suggest that you add page numbers to your submission, to make adding comments easier. Papers will be accepted in PDF or Postscript formats. The call for papers web site (http://www.cs.iastate.edu/SAVCBS/2006/call.shtml) will contain a link to the submission site when it is available. IMPORTANT DATES Submission deadline: August 15, 2006 Notification date: September 15, 2006 Final versions: October 15, 2006 WORKSHOP PAPER SELECTION COMMITTEE: * Jonathan Aldrich, chair (Carnegie Mellon) * Michael Barnett (Microsoft Research) * Patrice Chalin (Concordia University) * Robert Chatley (Kizoom, London) * David Coppit (The College of William and Mary) * Ivica Crnkovic (Maelardalen University) * Stephen Edwards (Virginia Tech) * Timothy J. Halloran (Air Force Institute of Technology) * Marieke Huisman (INRIA Sophia Antipolis) * Joeseph Kiniry (University College Dublin) * Matthew Parkinson (Middlesex University) * Corina Pasareanu (QSS/NASA Ames Research Center) * Andreas Rausch (University of Kaiserslautern) * Robby (Kansas State) * Heinz Schmidt (Monash University) * Wolfram Schulte (Microsoft Research) * Natasha Sharygina (Lugano and Carnegie Mellon) * Tao Xie (North Carolina State) ORGANIZERS: * Mike Barnett (Microsoft Research, USA) * Dimitra Giannakopoulou (RIACS/NASA Ames Research Center, USA) * Gary T. Leavens (Iowa State University, USA) * Natasha Sharygina (Lugano and Carnegie Mellon) WEB PAGE: See http://www.cs.iastate.edu/SAVCBS/ for more details From royer at ecs.syr.edu Sat Jul 8 09:49:16 2006 From: royer at ecs.syr.edu (James S. Royer) Date: Sat, 8 Jul 2006 09:49:16 -0400 Subject: [TYPES/announce] Preliminary program for LCC'06 Message-ID: <907DA71C-AC31-466C-B3D5-2E5646C7A810@ecs.syr.edu> The following is a preliminary program for LCC'06 (the 2006 Workshop on Logic and Computational Complexity) which is part of FLoC 2006 (the Federated Logic Conference). The deadline for early registration for LCC'06 and FLoC 2006 is **Monday, July 10**. See http://www.easychair.org/FLoC-06/ for on-line registration. For updates on this prelimary program, check http://www.easychair.org/FLoC-06/LCC.html ==================================================================== LCC'06 PRELIMINARY PROGRAM Thursday, August 10th SESSION 1: INVITED TALK 09:30-10:30 TBA 10:30-11:00 Break SESSION 2: CONTRIBUTED TALKS 11:00-11:45 Patrick Baillot, Ugo Dal Lago and Jean-Yves Moyen On Quasi-Interpretations, Blind Abstractions and Implicit Complexity 11:45-12:30 Jean-Yves Marion and Pechoux Romain Quasi-friendly sup-interpretations 12:30-14:00 Lunch break SESSION 3: CONTRIBUTED TALKS 14:00-14:45 Antonina Kolokolova, Yongmei Liu, David Mitchell and Eugenia Ternovska Complexity of Expanding a Finite Structure and Related Tasks 14:45-15:30 Murray Patterson, Yongmei Liu, Eugenia Ternovska and Arvind Gupta Grounding for Model Expansion in k-Guarded Formulas 15:30-16:00 Break SESSION 4: INVITED TALK 16:00-17:00 TBA Friday, August 11th SESSION 5: INVITED TALK 09:30-10:30 TBA 10:30-11:00 Break SESSION 6: CONTRIBUTED TALKS 11:00-11:45 Patrick Baillot and Marco Pedicini An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus 11:45-12:30 Yevgeniy Makarov Comparing efficiency of functions provable in classical and constructive logics 12:30-14:00 Lunch break SESSION 7: CONTRIBUTED TALK 14:00-14:45 Johann A. Makowsky Logical and Computational Aspects of Graph Polynomials: A Survey ==================================================================== From f.spiessens at 4c.ucc.ie Mon Jul 10 12:20:54 2006 From: f.spiessens at 4c.ucc.ie (Fred Spiessens) Date: Mon, 10 Jul 2006 17:20:54 +0100 Subject: [TYPES/announce] CPSec 2006 CFP extended deadline Message-ID: <7C0DF19D-9501-470B-88C9-3C31E264142B@4c.ucc.ie> -------------------------------------------------------------------- !!!! EXTENDED DEADLINE !!!! Paper Submission deadline: July 14 (EXTENDED DEADLINE) Call for Papers: CPSec 2006 2nd International Workshop on Applications of Constraint Satisfaction and Programming to Computer Security September 25, 2006 Nantes, France Held in conjunction with 12th International Conference on Principles and Practice of Constraint Programming, CP2006 http://www.sci.unich.it/~bista/organizing/cpsec/ -------------------------------------------------------------------- Constraint Satisfaction and Programming is emerging as an effective and practical approach for solving large complex problems. It offers a significant body of successful techniques for verifying system properties. Recently, researchers have begun using advances in constraint programming and solving to solve security problems, with success. This workshop seeks to act as a catalyst for this emerging area by exploring the challenges and the potential that these techniques may offer when applied to security problems. The use of Constraint Satisfaction and Programming to address security problems is recent, and it has already produced a number of novel solutions and insights. For example, constraints have been successfully used in the the analysis of security protocols, the development of access control models and mechanisms, firewall configuration and secure system configuration in general. Workshop topics include (but are not limited to): Access Control Database Security Security Trade-offs Information Flow Integrity Configuration Management Security Models Reliability Security Protocols Intrusion Detection Applications Risk Analysis Trust Software Security Trust Negotiation Submissions The workshop aim is to provide a forum where researchers currently working in the area of security and constraints can discuss their most recent ideas and developments and think together about the most promising new directions. Therefore we encourage the presentation of work in progress or on specialized aspects of the area. Papers that bridge the gap between theory and practice are especially welcome. Prospective attendees can submit a paper, which can be up to 15 pages in length. We encourage authors to submit papers electronically in postscript or pdf format. Papers should be formatted using the Lecture Notes in Computer Science (LNCS) style. At least one author of each accepted submission must attend the workshop, and all participants must pay the workshop fee. Please send your submissions by email to stefano.bistarelli at iit.cnr.it using the subject line "cpsec-2006 Workshop Submission". Important Dates Paper Submission deadline: July 14 (EXTENDED DEADLINE) Notification of acceptance: July 22th Early registration deadline: August 1st Camera-ready version deadline: August 5th Workshop Date: September 25, 2006. Workshop Organizers: Giampaolo Bella (Universit`a di Catania, Italy) Stefano Bistarelli (Universit? degli studi "G. D'Annunzio" di Chieti-Pescara & C.N.R. Pisa, Italy) Simon Foley (University College Cork, Ireland) Fred Spiessens (University College Cork, Ireland) Program Committee: Giampaolo Bella, Catania Fabio Martinelli, CNR Stefano Bistarelli, Pescara and CNR Barry O'Sullivan, Cork Yannick Chevalier, IRIT Justin Pearson, Uppsala Giorgio Delzanno, Genova Michael Rusinowich, LORIA Alessandra Di Pierro, Pisa Fred Spiessens, Cork Fabio Fioravanti, Pescara, Vitaly Shmatikov, Texas Simon Foley, Cork Frank D. Valencia, CNRS John Herbert, Cork Luca Vigano, Zurich Ralf K?sters, Kiel Duminda Wijesekera, GMU Herbert Wiklicky, Imperial ------- Fred Spiessens Research Scientist Secure Software at Cork Constraint Computation Centre http://4c.ucc.ie/~fsp -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060710/6d5e6179/attachment.htm From csl06 at inf.u-szeged.hu Tue Jul 11 03:15:36 2006 From: csl06 at inf.u-szeged.hu (Computer Science Logic '06 Conference) Date: Tue, 11 Jul 2006 09:15:36 +0200 Subject: [TYPES/announce] Algebraic Theory of Automata and Logic Workshop CALL FOR PAPERS Message-ID: <44B35018.6010604@inf.u-szeged.hu> ********************************************************************** * Algebraic Theory of Automata and Logic * * Satellite workshop of the conference CSL 06 * * September 30 -- October 1, 2006, Szeged, Hungary * * Supported by the AUTOMATHA project of ESF * * http://www.inf.u-szeged.hu/~csl06/ws.php * * CALL FOR PAPERS * ********************************************************************** Organizers: Z. ?sik, H. Straubing, P. Weil, Th. Wilke The aim of the workshop is to provide a forum for researchers interested in the structure theory of automata and/or the application of the algebraic approach to logic to present their results and to combine their efforts in the further development of the structure theory of finite automata, tree automata and related structures in connection with formal logic. The scientific program will consist of invited lectures and contributed talks. It is also intend to leave some room for discussions (open problem session, etc.). It is expected that some Ph. D. students will also attend the meeting. Abstracts of contributed talks must be sent by e-mail to Prof. Zoltan Esik, ze at inf.u-szeged.hu The abstract should be of no more than two pages. The submission deadline is 20 July, 2006. Notifications of acceptance will be sent by 30 July, 2006. We will announce the titles of the talks. A limited number of participants from ESF member countries will receive free registration. Applications for free registration must be sent by e-mail to Prof. Zoltan Esik, ze at inf.u-szeged.hu by 30 July, 2006. For details regarding applications refer to the URL given above. If after the meeting there will be interest in publishing either a proceedings or a special journal issue, then the organizers will take responsibility of finding a suitable forum and will act as editors. From iccp at doc.ic.ac.uk Tue Jul 11 12:30:34 2006 From: iccp at doc.ic.ac.uk (Iain Phillips) Date: Tue, 11 Jul 2006 17:30:34 +0100 Subject: [TYPES/announce] Express'06 - Call for Participation Message-ID: <44B3D22A.1020807@doc.ic.ac.uk> [Of interest to those working on types for concurrency] Call for Participation 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 The early registration deadline is *July 18th*. http://depend.cs.uni-sb.de/concur06 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. INVITED SPEAKERS: Robin Milner (Cambridge, UK) - Joint Express-Infinity-SOS Hagen Voelzer (Luebeck, Germany) - Express PRELIMINARY PROGRAMME: 9.00 - 10.00: Express invited talk: Hagen Voelzer * When a system is fairly correct 10.00 - 10.30: Morning Session * Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi Fair Pi 10.30 - 11.00: COFFEE BREAK 11.00 - 12.30: Morning Session * Jos Baeten, Flavio Corradini, Clemens Grabmayer On the Star Height of Regular Expressions Under Bisimulation * Xu Wang, Marta Kwiatkowska Compositional state space reduction using untangled actions * Ahmed Bouajjani, Jan Strejcek, Tayssir Touili On Symbolic Verification of Weakly Extended PAD 12.30 - 14.30: LUNCH 14.30: Joint Express-Infinity-SOS invited talk: Robin Milner * Bigraphs, multi-local names and confluence 15.30 - 16.00 Afternoon Session * Vincent Danos, Jean Krivine, Pawel Sobocinski General reversibility 16.00 - 16.30: COFFEE BREAK 16.30 - 18.30: Afternoon Session * Daniele Gorla Synchrony vs Asynchrony in Communication Primitives * Lucy Saunders-Evans, Glynn Winskel Event Structure Spans for Non-deterministic Dataflow * Lu?s Caires, Hugo Torres Vieira Extensionality of Spatial Observations in Distributed Systems * Daniel Hirschkoff, Damien Pous On Closure under Substitution of Strong Bisimilarity PROGRAMME CO-CHAIRS: Roberto Amadio (Univ. Paris 7, France) Iain Phillips (Imperial College London, UK) PROGRAMME 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 davide at disi.unige.it Tue Jul 11 16:58:47 2006 From: davide at disi.unige.it (Davide Ancona) Date: Tue, 11 Jul 2006 22:58:47 +0200 Subject: [TYPES/announce] Call for papers: OOPS at SAC 2007 Message-ID: <44B41107.2060005@disi.unige.it> OOPS 2007 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS07 Special Track at the 22nd ACM Symposium on Applied Computing, SAC 2007 http://www.acm.org/conferences/sac/sac2007 Seoul, Korea March 11 - 15, 2007 - Important Dates September 8, 2006: Paper Submission October 16, 2006: Author Notification October 30, 2006: Camera-Ready Copy March 11--15, 2007: SAC 2007 - SAC 2007 For the past twenty-one years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2007 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Seoul National University in Seoul and The Suwon University in Gyeonggi-do. - OOPS Track Today's large scale software systems are typically designed and implemented using the concepts of the object-oriented (OO) paradigm. However, there is still a need for existing OO languages and architectures to continuously adapt in response to demands for new features and innovative approaches. These new features, to name a few, include unanticipated software evolution, security, safety, distribution, and interoperability. The basic aim of the OOPS track at SAC 2007 is to promote and stimulate further research on the object-oriented programming and distributed-object paradigms. This track will foster the development of extensions and enhancements to the prevalent OO languages, such as Java, C\# and C++, the formulation of innovative OO-based middleware approaches, and the improvements to existing and well-established distributed-object based systems. Specifically, this track will invite papers investigating the applicability of new ideas to widespread, and standard object-oriented languages and distributed-object architectures. A medium to long-term vision is also solicited, tackling general issues about the current and future role of prevalent OO languages and distributed architectures in Computer Science and Engineering. Particularly of interest for this track are those papers that provide a thorough analysis covering following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. Original papers and implementation reports are invited from all areas of OO programming languages and distributed-object computing. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Programming abstractions * Advanced type mechanisms and type safety * Multi-paradigm features * Language features in support of open systems * Aspect-oriented and Component-based programming * Reflection, meta-programming * Program structuring, modularity, generative programming * Compositional languages * Distributed Objects and Concurrency * Middleware * Heterogeneity and Interoperability * Applications of Distributed Object Computing - Submission Instructions Paper submissions should be sent electronically and in pdf format to both track chairs, together with a separate plain text containing title, authors, abstract, and contact information. The author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be in the third person. This is to facilitate a blind review process. The preferred format for the submission is the ACM SIG Proceedings Template (available through http://www.acm.org/sigs/pubs/proceed/template.html). The body of the paper should not exceed 5,000 words (5 pages according to the above style). All papers must be submitted by September 8, 2006. Submission of the same paper to multiple tracks is not allowed. - Proceedings and special issue Accepted full papers will be published by ACM in the annual conference proceedings, with the option (at additional expense) to add 3 more pages. Accepted poster papers will be published as extended 2-page abstracts in the same proceedings. Please note that full registration is required for paper and poster inclusion in the conference proceedings and CD. Student registration does not cover paper and poster inclusion in the conference proceedings, but it is only intended to encourage student attendance. Finally, as it is customary, after the conference the accepted full papers will be selected for publication on a special issue. - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, Universita` di Genova Mirko Viroli (mviroli at deis.unibo.it) DEIS, Universita` di Bologna - Program Committee > Shigeru Chiba, Tokyo Institute of Technology, Japan > Alessandro Coglio, Kestrel Institute, USA > Pascal Costanza, Vrije Universiteit Brussel, Belgium > Ferruccio Damiani, Universit? di Torino, Italy > Erik Ernst, DAIMI, Denmark > Geoffrey Fox, Indiana University, USA > Jacques Garrigue, Nagoya University, Japan > Jeffrey Gray, University of Alabama at Birmingham, USA > Tom Hirschowitz, ENS Lyon, France > Atsushi Igarashi, Kyoto University, Japan > Doug Lea, Suny Oswego, USA > Giovanni Lagorio, Universit? di Genova, Italy > Francesco Logozzo, ?cole Polytechnique, France > Hidehiko Masuhara, University of Tokyo, Japan > Tamiya Onodera, IBM Tokyo Research Laboratory, Japan > Julian Rathke, University of Sussex, UK > Giovanni Rimassa, Whitestein Technologies, Switzerland > Don Syme, Microsoft Research, UK > Tetsuo Tamai, University of Tokyo, Japan From Susanne.Graf at imag.fr Tue Jul 11 16:32:07 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Tue, 11 Jul 2006 22:32:07 +0200 Subject: [TYPES/announce] MARTES with MODELS 2006 - Modeling and Analysis of Real-Time and Embedded Systems Message-ID: <44B40AC7.6040800@imag.fr> ************************************************************************ * MARTES * * Workshop on Modeling and Analysis of Real-Time and Embedded Systems * * October 2 or 3, 2006 * * Genova, Italy * * http://www.martes.org * * * * Workshop held in conjunction with MoDELS/UML 2006 * * http://www.umlconference.org/ * ************************************************************************ Submission deadline: August 30, 2006 ------------------------------------- The Model Driven Architecture (MDA) initiative of the OMG puts forward the idea that future process development will be centered around models, thus keeping application development and underlying platform technology as separate as possible. The aspects influenced by the underlying platform technology concern mainly non functional aspects and communication primitives. The first significant result of the MDA paradigm for engineers is the possibility of building application models that can be conveniently ported to new, emerging technologies - implementation languages, middleware, etc.- with minimal effort and risk in one hand, but also that can be analyzed either directly or through a model transformation toward a specific formal technological space in order to validate or/and verify real-time properties such as for example schedulability. In the area of DRES (distributed, Real-time and Embedded Systems), this model-oriented trend is also very active and promising. But DRES are different from general-purpose systems. The purpose of this workshop is to serve as an opportunity to gather researchers and industrials in order to survey some existing experiments related to modeling and model-based analysis of DRES. Moreover in order to be able to exchange models with the aim to apply formal validation tools and to achieve interoperability, it is important to have also a common understanding of the semantics of the given notations. Other important issues in the domain of real-time are methodology and modeling paradigms allowing breaking down the complexity, and tools which are able to verify well designed systems. The MARTES workshop is a merge of two series of complementary workshops that were dedicated to RT/E systems and UML and which had both taken place, amongst others, as workshops associated with the UML conferences, the predecessor of MODELS: SIVOES and SVERTS. Topics: ====== - Modeling RT/E using modelling languages such as UML o How to specify real-time requirements and characteristics o How to enhance modelling languages to capture real time, embedded and distributed aspects in a convenient manner o Declarative versus operational real-time specifications o Notations for defining the architecture of heterogeneous systems o Behavior modeling o RT/E platforms modeling, integration of scheduling aspects - Semantic aspects of real-time in modelling languages o Formal semantics, in particular, semantic integration of heterogeneous systems o Interpretations of annotations o Executability of models - Methods and tools for analysis of RT systems and components o Ensure consistency of timing constraints throughout the system o Validation of time and scheduling related properties o Validation of functional properties of time dependent systems Workshop Format =============== This full-day workshop will consist of an introduction of the topic by the workshop organizers, an invited presentation (to be determined), presentations of accepted papers, and in depth discussion of previously identified subjects emerging from the submissions. A summary of the discussions will be made available. Submission and Publication ========================== To contribute, please send a position paper or a technical paper to Susanne.Graf at imag.fr and Sebastien.Gerard at cea.fr. Position papers should not exceed 5 pages, and technical papers 20 pages. Preferably, submissions should be in pdf or postscript format. Workshop proceedings will be distributed to all participants and made available through the workshop website. Like in previous years, the two best papers and a workshop overview will be published in the MoDELS 2005 Satellite Post-Proceedings (as a volume of the LNCS series). Additionally, a selection will be considered for publication in a suitable technical journal following an agreement with an interested publisher (a selection of the SVERTS 2003 papers has recently appeared as a special section of Springer's STTT journal). IMPORTANT DATES =============== Submission deadline: August 30, 2006 Notification of acceptance: September 9, 2006 Final versions due: September 29, 2006 Workshop date : October 2 or 3, 2006 Organizers ========== S?bastien G?rard - CEA-LIST, France Susanne Graf - Verimag, France ?ystein Haugen - University of Oslo, Norway Iulian Ober - (ISYCOM, U. Toulouse, France) Bran Selic - IBM, Canada Programme Committee:(to be finalised) Daniel Amyot (U. of Ottawa, Canada) Jean-Philippe Babau (INSA Lyon, France) Heiko Doerr (Daimler Chrysler, Germany) Peter Feiler (CMU, Software Institute, US) Eran Gery (I-Logix) Sebastien Gerard (CEA-LIST, France) Holger Giese (Univ. of Paderborn, Germany) Susanne Graf (Verimag, France) ?ystein Haugen (Univ. of Oslo, Norway) Jozef Hooman (Embedded Systems Institute & Univ. of Nijmegen, NL) Bengt Jonsson (Uppsala, Sweden) Iulian Ober (ISYCOM, U. Toulouse, France) Dorina Petriu (Carleton U., Canada) Alan Moore (Artisan) Bran Selic (IBM, Canada) Richard Sanders (Sintef, Norway) Thomas Weigert (Motorola, Chicago) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf at imag.fr ------------------------------------------------------------------------ From sescobar at dsic.upv.es Wed Jul 12 12:36:48 2006 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Wed, 12 Jul 2006 11:36:48 -0500 Subject: [TYPES/announce] Last CFP (4 days left): 2nd Int'l Workshop on Automated Specification and Verification of Web Systems (WWV'06) Message-ID: <7EA2AA80-083F-4D51-A26F-2E2827C28372@dsic.upv.es> [ We apologize for multiple copies ] ******************************************************************* 2nd International Workshop on Automated Specification and Verification of Web Systems (WWV'06) Cyprus, November 15-19, 2006 (Track of ISoLA 2006) http://www.dsic.upv.es/workshops/wwv06 ******************************************************************* SCOPE The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit paper on formal methods and techniques applied to Web sites, Web services or Web-based applications, such as: * rule-based approaches to Web site analysis, certification, specification, verification, and optimization * formal models for describing and reasoning about Web sites * model-checking, synthesis and debugging of Web sites * abstract interpretation and program transformation applied to the semantic Web * intelligent tutoring and advisory systems for Web specifications authoring The WWV series provides a forum for researchers from the communities of Rule-based programming, Automated Software Engineering, and Web-oriented research to facilitate the cross-fertilization and the advancement of hybrid methods that combine the three areas. LOCATION WWV'06 will be held in November in Cyprus as a Special Track of the 2006 International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA 2006). SUBMISSION PROCEDURE Submissions must be received by July 16, 2006. Submitted papers should be at most 15 pages in the Lecture Notes in Computer Science (LNCS) style. Submitted papers should include an abstract and the author's information. See the author's instructions of LNCS style at http://www.springer.de/comp/lncs/authors.html. PUBLICATION Accepted papers will be published in a preliminary proceedings volume, which will be available during the workshop. Publication of the workshop post-proceedings by IEEE Computer Society Press is envisaged. PROGRAM CO-CHAIRS Maria Alpuente (Technical University of Valencia, Spain) Moreno Falaschi (University of Siena, Italy) WORKSHOP CHAIR Santiago Escobar (Technical University of Valencia, Spain) PROGRAM COMMITTEE Jose Julio Alferes (Universidade Nova de Lisboa, Portugal) Maria Alpuente (Technical University of Valencia, Spain) Demis Ballis (University of Udine, Italy) Francois Bry (University of Munich, Germany) Santiago Escobar (Technical University of Valencia, Spain) Francois Fages (INRIA Rocquencourt, France) Moreno Falaschi (University of Siena, Italy) Gopal Gupta (University of Texas at Dallas, USA) Shriram Krishnamurthi (Brown University, USA) Tiziana Margaria (University of Potsdam, Germany) I.V. Ramakrishnan (State University of New York at Stony Brook, USA) Leon van der Torre (University of Luxembourg, Luxembourg) IMPORTANT DATES Paper Submission July 16, 2006 Acceptance Notification September 17, 2006 Camera Ready October 15, 2006 Workshop November 15-19, 2006 (one day) From Jaco.van.de.Pol at cwi.nl Thu Jul 13 05:48:09 2006 From: Jaco.van.de.Pol at cwi.nl (Jaco van de Pol) Date: Thu, 13 Jul 2006 11:48:09 +0200 Subject: [TYPES/announce] PDMC'06 cfp. Early registration: July 18 In-Reply-To: <445A1A64.60807@cwi.nl> References: <445A1A64.60807@cwi.nl> Message-ID: <44B616D9.5020000@cwi.nl> C A L L F O R P A R T I C I P A T I O N PDMC 2006, August 31 5th International Workshop on Parallel and Distributed Methods in VerifiCation co-located with CONCUR, Bonn Early registration deadline: July 18 Workshop website : http://pdmc.informatik.tu-muenchen.de/PDMC06/ Registration via CONCUR: http://depend.cs.uni-sb.de/index.php?id=371 Program: ======== Lubos Brim (invited speaker): Distributed Verification: Exploring the Power of Raw Computing Power Christophe Pajault, Jean-Francois Pradat-Peyre Distributed Colored Petri Net Model-Checking with Galaxy Jiri Barnat, Pavel Moravec Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Anton Wijs (work-in-progress) Distributed Guided State Space Exploration for Scheduling Problems Jonathan Ezekiel, Gerald Luettgen, Radu Siminiceanu Can Saturation be Parallelised? On the Parallelisation of a Symbolic State-Space Generator Erika Abraham, Bernd Becker, Martin Fraenzle, Christian Herde, Tobias Schubert Parallel SAT-Solving in Bounded Model Checking Jiri Barnat, Lubos Brim, Ivana Cerna, Milan Ceska, Jana Tumova (work-in-progress) Distributed Qualitative LTL Model Checking of Markov Decision Processes PC Chairs: ========== Boudewijn Haverkort Jaco van de Pol -- 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 patrick.baillot at lipn.univ-paris13.fr Sat Jul 15 04:50:40 2006 From: patrick.baillot at lipn.univ-paris13.fr (Patrick Baillot) Date: Sat, 15 Jul 2006 10:50:40 +0200 Subject: [TYPES/announce] 2nd Call: ToCL special issue on Implicit Computational Complexity Message-ID: <20060715105040.qigx4iw5oq6884ws@lipn.univ-paris13.fr> (* deadline: August 31st*) ----------------------------------------------------------------- *SECOND 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 manuscripts : 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 fairouz at macs.hw.ac.uk Mon Jul 17 05:40:10 2006 From: fairouz at macs.hw.ac.uk (Fairouz Kamareddine) Date: Mon, 17 Jul 2006 10:40:10 +0100 (BST) Subject: [TYPES/announce] New PhD Studentships: Logics, Types, & Rewriting for Software & Mathematics @ Heriot-Watt, Scotland, UK Message-ID: New Ph.D. Student Positions ULTRA group (Useful Logics, Types, Rewriting, and their Automation) Computer Science Department School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh, Scotland, UK The HTML version of this posting can be found at: http://www.macs.hw.ac.uk/~jbw/phd-student-ad.html Description of the Positions Changes since our announcement earlier this year: (1) Additional positions have become available. (2) Additional possible research topics have been included. Several new Ph.D. student positions are available in areas involving research into the theories of logics, types, and rewriting and their applications in reasoning about computer systems and mathematics. The positions are at Heriot-Watt University[1] in the ULTRA (Useful Logics, Types, Rewriting, and their Automation) group[2] in the Computer Science Department[3] in the School of Mathematical and Computer Sciences[4] at Heriot-Watt University in Edinburgh[5], the capital of Scotland[6]. The Ph.D. supervisors will be either Fairouz Kamareddine[7] and/or Joe Wells[8]. Available research topics include work on any of the following: * The Poly*[9] polymorphic retargetable type system for process and mobility calculi, aimed at the goal of supporting modular reasoning and compositional analysis for systems involving mobility and concurrency (such systems can include combinations of hardware, software, people, etc.). * The MathLang[10] framework for computerizing mathematical text. MathLang tries to keep the computerization as close as possible to the mathematician's text while at the same time providing a formal structure supporting mathematical software systems (e.g., computer algebra systems, theorem provers, etc.). Possible MathLang work includes: + Building libraries of computerized books of mathematics. + Developing bridges between MathLang and proof checkers (e.g., Coq, Mizar, Isabelle, OMEGA, etc.). * The idea of Expansion[11] as a fundamental organizing principle for obtaining flexible and compositional polymorphic type inference for computer software. * The use of Type Error Slicing[12] as a superior user interface for explaining type errors to users of new programming languages with advanced (and complicated!) type systems. * Any other reasonable idea which builds on work we have already started, including both theory and implementation. In general, we are interested in the design and implementation of useful and elegant type systems and logics which can reason about or extend existing programming languages and theorem provers. It will be helpful to have interests (or possibly even competence) in 1 or more of the following background knowledge areas: * Formal calculi for reasoning about the meaning of systems (including computer programs) such as the lambda calculus, the pi calculus, and the numerous other calculi they have inspired that deal with aspects of concurrency, mobility, modules, components, linking & loading, resource usage, staged compilation, classes & objects, etc. * Methods for analyzing specific systems (e.g., specific computer programs) represented by individual terms of such formal calculi. * Formal calculi for representing mathematical texts, including those aspects related to how actual practicing mathematicians (i.e., not mathematical logicians) construct and present mathematics. * Type systems for the kinds of formal calculi mentioned above, especially those with features similar to intersection, union, dependent, and singleton types. * Rewriting theories, especially those with higher-order features, such as the lambda calculus, higher-order rewriting (HOR), systems with explicit substitutions, higher-order abstract syntax (HOAS), combinators, etc. * Constraint solving and unification. * Theorem provers and mathematical reasoning tools. * Programming languages especially suitable for use for any of the above. The usual duration of Ph.D. studentships in the UK is 3 years. The positions are available immediately. The Ph.D. students will probably collaborate on 1 or more of the following activities. The specific activities will be matched to their strengths. * Designing languages/calculi for representing various aspects of such things as computer programs, concurrent systems, mathematical texts, etc. * Developing theories for reasoning about such a calculus as a whole as well as individual terms written in the calculus. * Developing new type systems for such calculi with useful properties. * Developing analysis algorithms for the new type systems. * Proving various properties of the above items. * Making software systems incorporating the new calculi, theories, type systems, and algorithms. * Publishing scientific reports on the work done. References 1. http://www.hw.ac.uk/ 2. http://www.macs.hw.ac.uk/ultra/ 3. http://www.macs.hw.ac.uk/cs/ 4. http://www.macs.hw.ac.uk/ 5. http://www.geo.ed.ac.uk/home/tour/edintour.html 6. http://www.geo.ed.ac.uk/home/scotland/scotland.html 7. http://www.macs.hw.ac.uk/~fairouz/ 8. http://www.macs.hw.ac.uk/~jbw/ 9. http://www.macs.hw.ac.uk/DART/software/PolyStar/ 10. http://www.macs.hw.ac.uk/~fairouz/talks/talks2005/mathlang-general-talk.pdf 11. http://www.macs.hw.ac.uk/~jbw/papers/#Car+Wel:ITRS-2004 12. http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/ Contact Information Inquiries can be directed to Fairouz Kamareddine at: web: http://www.macs.hw.ac.uk/~fairouz/ e-mail: fairouz at macs.hw.ac.uk fax: +44 131 451 8179 Inquiries can be directed to Joe Wells at: web: http://www.macs.hw.ac.uk/~jbw/ e-mail: jbw at macs.hw.ac.uk fax: +44 131 451 8179 Applying for the Positions Please contact Fairouz Kamareddine and Joe Wells for full details on how to apply. We will want to see your curriculum vitae, as well as 2 (or even 3 if possible) recommendation letters (preferably written by people familiar with your academic and research abilities, but a letter from an industry source is better than no letter at all). We will expect recommendation letters to be sent directly by their authors and will need contact details for the letter authors. You should probably already have a master's degree or equivalent experience. It can be helpful to write a brief statement about why your research interests are a good match for the ULTRA group. If you already have research publications (this is not required), it can be helpful to send 1 (or even 2) of them. There will also be official Heriot-Watt application forms to fill out. Please convert Microsoft Word documents to a public, standard, and non-proprietary format. PDF is good, plain text is good, LaTeX is okay (if using only standard packages), HTML is okay (if not generated by Microsoft Word), PostScript is sometimes okay, Open Document format is undesirable, Microsoft Word format will not be accepted. For your information, it is helpful if writers of recommendation letters provide details of: * the capacity in which they know the candidate, * the candidate's skills, abilities and performance in relation to the post applied for, * the candidate's record including details of the candidate's role(s) and service dates, * their view of the candidate's suitability for the post as a whole, in light of the attached details and their knowledge of the candidate's experience and abilities, * any further relevant information which would assist us in choosing the right candidate. From Stephan.Merz at loria.fr Mon Jul 17 12:44:14 2006 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Mon, 17 Jul 2006 18:44:14 +0200 Subject: [TYPES/announce] AVOCS 2006: call for participation and short papers Message-ID: <44BBBE5E.2@loria.fr> AVoCS 2006 : 6th Intl. Workshop on Automated Verification of Critical Systems Nancy, France, September 18-19, 2006 http://avocs06.loria.fr/ Invited Speakers: Byron Cook and Oded Maler (further invited talks to be confirmed) 1. Registration to the workshop is now open (early registration rates valid until August 31, 2006). 2. Short papers (5 pages max) describing work in progress, position statements etc. can be submitted until August 4. They will appear in the preliminary proceedings, and extended versions will also be eligible for submission to a special journal issue. -------------- next part -------------- A non-text attachment was scrubbed... Name: Stephan.Merz.vcf Type: text/x-vcard Size: 362 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060717/659b027b/Stephan.Merz.bin From zhaohui at cs.rhul.ac.uk Tue Jul 18 03:39:47 2006 From: zhaohui at cs.rhul.ac.uk (Zhaohui Luo) Date: Tue, 18 Jul 2006 08:39:47 +0100 (BST) Subject: [TYPES/announce] PhD studentship Message-ID: PhD Studentship Dept of Computer Science Royal Holloway, University of London A PhD studentship, including fees and maintenance for three years, is available from October 1, 2006, to study for PhD at Royal Holloway, University of London. The studentship is funded by the Leverhulme Trust and associated with the research grant "Type-theoretic Foundation of Mathematical Pluralism". Further information on related research topics can be found at http://www.cs.rhul.ac.uk/home/zhaohui/PhD.html Applications for the above studentship are invited from students with good undergraduate or MSc degrees in mathematics, computer science or a related subject to study for a PhD degree. On-line application forms can be found at http://www.rhul.ac.uk/Graduate-School/PGresearch.application.pdf. Further inquiries and applications with a CV and two names of referees can be sent to Prof. Zhaohui Luo Dept. of Computer Science Royal Holloway, Univ of London Egham, Surrey TW20 0EX U.K. Email: Zhaohui.Luo at cs.rhul.ac.uk URL: http://www.cs.rhul.ac.uk/home/zhaohui/ From jhr at cs.uchicago.edu Tue Jul 18 11:15:11 2006 From: jhr at cs.uchicago.edu (John Reppy) Date: Tue, 18 Jul 2006 10:15:11 -0500 Subject: [TYPES/announce] ICFP 2006 --- Call for Participation Message-ID: <560C838C-8AE4-43B2-AE65-D42C9C144C35@cs.uchicago.edu> ------------------------------------------------------------------------ CALL FOR PARTICIPATION The 11th ACM SIGPLAN International Conference on Functional Programming (ICFP 2006) Portland, Oregon September 18-20, 2005 http://icfp06.cs.uchicago.edu ------------------------------------------------------------------------ ICFP 2006 provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. Conference Organizers: General Chair: John Reppy, University of Chicago Program Chair: Julia Lawall, DIKU Local Arrangements Chair: James Hook, Portland State University Workshop Chairs: Matthias Blume, Toyota Technological Institute at Chicago Patricia Johann, Rutgers University Programming Contest Chairs: Carl Krary, CMU Robert Harper, CMU ------------------------------------------------------------------------ For more details, see http://icfp06.cs.uchicago.edu Preliminary Program: http://icfp06.cs.uchicago.edu/schedule.html Registration information: http://regmaster2.com/conf/icfp2006.html Hotel information: http://icfp06.cs.uchicago.edu/hotel.html ------------------------------------------------------------------------ From Ralf.Lammel at microsoft.com Wed Jul 19 03:49:29 2006 From: Ralf.Lammel at microsoft.com (Ralf Lammel) Date: Wed, 19 Jul 2006 00:49:29 -0700 Subject: [TYPES/announce] Paper: Revealing the X/O impedance mismatch Message-ID: <1152E22EE8996742A7E36BBBA7768FEE0A5DCE69@RED-MSG-50.redmond.corp.microsoft.com> Dear TYPES subscribers, I'd like to announce a new paper on the mapping between XML and OO semantics and type systems. It is hoped that this extended paper may turn out to be useful in courses and otherwise. Your comments would be very much appreciated and taken into account for a revision ahead. Regards, Ralf Laemmel ------------------------------------------------------------------------ Title: Revealing the X/O impedance mismatch Authors: Ralf L?mmel and Erik Meijer URL: http://homepages.cwi.nl/~ralf/xo-impedance-mismatch/ Abstract: When engaging in X/O mapping, i.e., when viewing XML data as objects or vice versa, one faces various conceptual and technical challenges~---~they may be collectively referred to as the `X/O impedance mismatch'. There are these groups of challenges. (i) The XML data model and the object data model differ considerably. (ii) The native XML programming model differs from the normal OO programming model. (iii) The typical type systems for XML and objects differ considerably, too. (iv) Some of the differences between data models and between type systems are more like idiosyncrasies on the XML site that put additional burden on any X/O mapping effort. (v) In some cases, one could ask for slightly more, not necessarily XML-biased language expressiveness that would improve X/O mapping results or simplify efforts. The present article systematically investigates the mismatch in depth. It identifies and categorizes the various challenges. Known mitigation techniques are documented and assessed; several original techniques are proposed. The article is somewhat biased in that it focuses on XML Schema as the XML type system of choice and on C\# as the OO programming language of choice. In fact, XSD and C\# are covered quite deeply. Hence, the present article qualifies as a language tutorial of `the other kind'. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060719/2fbc77f1/attachment.htm From Susanne.Graf at imag.fr Wed Jul 19 09:19:30 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Wed, 19 Jul 2006 15:19:30 +0200 Subject: [TYPES/announce] Call for Participation: ATVA 2006 - Beijing - Octobre 2006 Message-ID: <44BE3162.5040105@imag.fr> CALL FOR PARTICIPATION ************************************************************* ATVA 2006 4th International Symposium on Automated Technology for Verification and Analysis Beijing, China, October 23-26, 2006 http://lcs.ios.ac.cn/~atva06/ ************************************************************* IMPORTANT: The early registration deadline is August 1. Keynote Speakers: . Mihalis Yannakakis, Columbia University, USA . Jin Yang, Intel Corporation, USA . Thomas Ball, Microsoft Research, USA First day: Two-Hour Tutorials by the keynote speakers 35 papers have been selected for presentation at ATVA 2006 The proceedings will be available as Springer LNCS 4218. A preliminary program is available at the conference web site http://lcs.ios.ac.cn/~atva06/ The scope of ATVA 2006 includes * Theory for providing designers with automated support for obtaining correct software or hardware systems, including functional and non functional aspects, such as theory on (timed) automata, Petri-nets, concurrency theory, compositionality, model-checking, automated theorem proving, synthesis, performance analysis, correctness-by-construction results, infinite state systems, abstract interpretation, decidability results, parametric analysis or synthesis. * Applications of theory in engineering methods and particular domains, handling of practical problems occurring in tools, such as: analysis and verification tools, synthesis tools, reducing complexity of verification by abstraction, improved representations, handling user level notations, such as UML, practice in industry applications to hardware, software or real-time and embedded systems. * Case studies illustrating the usefulness of tools or a particular approach. STEERING COMMITTEE: E. Allen Emerson (University of Texas at Austin) Oscar H. Ibarra (University of California at Santa Barbara) Insup Lee (University of Pennsylvania) Doron A. Peled (University of Warwick) Farn Wang (National Taiwan University) Hsu-Chun Yen (National Taiwan University) GENERAL CHAIR: Huimin Lin (Chinese Academy of Sciences) PROGRAM CO-CHAIRS: Susanne Graf (VERIMAG) Wenhui Zhang (Chinese Academy of Sciences) PROGRAM COMMITTEE: Rajeev Alur (University of Pennsylvania) Christel Baier (University of Bonn) Jonathan Billington (University of South Australia) Sung-Deok Cha (Korea Advanced Inst. of Sci. and Techn.) Shing-Chi Cheung (Hong Kong Univ. of Sci. and Techn.) Ching-Tsun Chou (Intel) Jin Song Dong (National University of Singapore) E. Allen Emerson (University of Texas at Austin) Masahiro Fujita (University of Tokyo) Susanne Graf (VERIMAG) Wolfgang Grieskamp (Microsoft research) Teruo Higashino (Osaka University) Pei-Hsin Ho (Synopsys) Oscar H. Ibarra (University of California at Santa Barbara) Orna Kupferman (Hebrew University) Robert P. Kurshan (Cadence) Insup Lee (University of Pennsylvania) Xuandong Li (Nanjing University) Shaoying Liu (Hosei University) Zhiming Liu (IIST/United Nations University) Mila E. Majster-Cederbaum (University of Mannheim) Olaf Owe (University of Oslo) Doron A. Peled (University of Warwick) Zhong Shao (Yale University) Xiaoyu Song (Portland State University) Yih-Kuen Tsay (National Taiwan University) Irek Ulidowski (Leicester University) Bow-Yaw Wang (Academia Sinica) Farn Wang (National Taiwan University) Ji Wang (National U. of Techn. of China) Yi Wang (Uppsala University) Baowen Xu (Southeast University of China) Hsu-Chun Yen (National Taiwan University) Tomohiro Yoneda (Tokyo Institute of Technology) Wenhui Zhang (Chinese Academy of Sciences) Lenore Zuck (University of Illinois at Chicago) LOCAL ARRANGEMENT CHAIR: Naijun Zhan (Chinese Academy of Sciences) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf at imag.fr ------------------------------------------------------------------------ From carsten at itu.dk Wed Jul 19 11:00:44 2006 From: carsten at itu.dk (Carsten Schuermann) Date: Wed, 19 Jul 2006 17:00:44 +0200 Subject: [TYPES/announce] Ph.D. scholarships at ITU of Copenhagen, Denmark Message-ID: <44BE491C.8070504@itu.dk> A number of Ph.D. scholarships are now available at the IT University of Copenhagen, Denmark. There are openings in several areas, including the research areas of Programming, Logic, and Semantics group: semantics of logics and programming languages, categorical logic and type theory, logical frameworks, automated theorem proving, proof assistants, models of concurrency, verification, mobile and global computing. The official announcement of the Ph.D. scholarships can be found at http://www1.itu.dk/sw49645.asp Application deadline is Oct. 2, 2006. More information about the Programming, Logic and Semantics group at ITU can be found at http://www.itu.dk/research/pls and suggestions for possible Ph.D. topics can be found at http://www.itu.dk/research/pls/wiki/index.php/PhDtopics Best regards, Lars Birkedal and Carsten Schuermann From grust at in.tum.de Wed Jul 19 11:20:39 2006 From: grust at in.tum.de (Torsten Grust) Date: Wed, 19 Jul 2006 17:20:39 +0200 Subject: [TYPES/announce] PLAN-X 2007: Call for Papers and Demos Message-ID: <52A8A63B-0360-4373-AF52-7A7A2E73D2A2@in.tum.de> Call for Papers and Software Demonstrations P L A N - X 2 0 0 7 Programming Language Techniques for XML An ACM SIGPLAN Workshop colocated with POPL 2007 Nice, France -- January 20, 2007 http://www.plan-x-2007.org/ -- PLAN-X 2007 Aim and Scope The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming languages can embrace, for example, tree-shaped XML data structures, regular expression types extracted from schema descriptions, very small or large XML instances, queries against XML data, and XML transformations. XML reaches deep into all aspects of language design, type systems, compilers, as well as runtimes and PLAN-X 2007 is THE forum to present and discuss novel research work in this area. We invite contributions -- papers as well as software demonstrations -- from members of the programming language, database, theory, and document processing communities and look forward to a workshop in which this diversity of contributions and attendees leads to lively discussion and a fun event. If you are architecting a software system that fuses programming language and XML technology in interesting and innovative ways, please submit a software demonstration proposal to PLAN-X 2007. The workshop program will feature a special demo session. A two-page description of the accepted software demonstrations will be included in the proceedings. PLAN-X 2007 will be held in cooperation with and just after POPL 2007, the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages in the Plaza Hotel in Nice, France, on Januar 20, 2007. -- PLAN-X 2007 Topics of Interest Topics of interest include the following (though interesting and/or innovative papers on all aspects of programming languages for XML are welcome): - Design of programming and query languages for XML - Programming in the XML data model itself (e.g., extending XQuery into a full-fledged programming language) - Formal accounts of XML and its processors (based on logic, automata, variants of lambda calculus, etc.) - Compilers and interpreters for XML-aware languages and optimization techniques - Type systems, schema languages, and other constraints (e.g., keys) for tree-shaped data - Tree automata and transducers - Languages and systems that can cope with XML fragments (messages) or very large XML instances (beyond main-memory size) - Programming language glue between browsers, web services, and databases - Pioneering applications of XML-aware language technology -- Proceedings Accepted submissions will be collected to form the informal PLAN-X 2007 proceedings, to be indexed on Michael Ley's DBLP site and distributed at the workshop. The material may thus be published elsewhere at a later date. -- Paper Submission PLAN-X 2007 calls for contributions relevant to the open list of topics sketched above. We explicitly welcome reports on innovative, off-beat, and ''early stage'' approaches as long as the submission reports on original work not published or submitted elsewhere. - Please format your papers according to the ACM guidelines and SIG proceedings templates available at http://www.acm.org/sigs/pubs/proceed/template.html The mandatory submission file format is PDF. - Papers should not exceed 10 pages in length including references and appendices, but shorter abstracts (of, e.g., 2000 words) often suffice and are acceptable as well. - Software demonstration proposals are limited to 2 pages and should include a sketch of the methods you employ as well as a description of what exactly will be demoed. Details on the PLAN-X 2007 paper submission process will be posted on the workshop web site and mailing lists in due course. -- Important Dates - Paper submission: Sun, Oct 1, 2006 - Notification of acceptance: Thu, Nov 23, 2006 - Camera-ready copy due: Sun, Dec 17, 2006 - Workshop: Sat, Jan 20, 2007 -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Roquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders M?ller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rh?ne-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK) -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU M?nchen U Pisa Munich, Germany Pisa, Italy grust at in.tum.de ghelli at di.unipi.it From afelty at site.uottawa.ca Wed Jul 19 23:05:40 2006 From: afelty at site.uottawa.ca (Amy Felty) Date: Wed, 19 Jul 2006 23:05:40 -0400 (EDT) Subject: [TYPES/announce] PCC 2006 Call for Participation In-Reply-To: References: Message-ID: CALL FOR PARTICIPATION - PCC 2006 International Workshop on Proof-Carrying Code Seattle, USA, August 11, 2006 http://www.easychair.org/FLoC-06/PCC.html Affiliated with LOGIC IN COMPUTER SCIENCE (LICS 2006) and part of the Federated Logic Conference (FLoC 2006) PCC 2006 PROGRAM: SESSION 1: Welcoming and Keynote Address (9:15-10:30) 09:15 Welcoming Remarks 09:30 Andrew Appel (Princeton University) A Very Modal Model of a Modern, Major, General Type System BREAK (10:30-11:00) SESSION 2: Invited Talks (11:00-12:30) 11:00 Amal Ahmed (Harvard University) 11:30 Adriana Compagnoni (Stevens Institute of Technology) Information Flow Analysis for Low-Level Languages 12:00 Dachuan Yu (DoCoMo USA Labs) Toward More Typed Assembly Languages for Confidentiality LUNCH (12:30-14:00) SESSION 3: Keynote Address (14:00-15:00) 14:00 Ian Stark (University of Edinburgh) Resource Guarantees and PCC: 50 ways to say it with a proof SESSION 4: Posters (15:00-15:30) BREAK (15:30-16:00) SESSION 5: Posters (continued) (16:00-16:30) SESSION 6: Invited Talks (16:30-17:30) 16:30 Tamara Rezk (INRIA) Certificate Translation 17:00 Zhong Shao (Yale University) A Translation from Typed Assembly Languages to Certified Assembly Programming From regnier at iml.univ-mrs.fr Thu Jul 20 09:30:31 2006 From: regnier at iml.univ-mrs.fr (Laurent Regnier) Date: Thu, 20 Jul 2006 15:30:31 +0200 Subject: [TYPES/announce] Position in Marseille Message-ID: <17599.34167.113073.72886@iml69.univ-mrs.fr> In 2007, the Logique De la Programmation (LDP) group of the Institut de Math?matiques de Luminy is likely to get a Ma?tre de Conf?rences position in Marseille. The LDP group was founded in 1992 by Jean-Yves Girard. At this time the thematic was related to proof-theory, lambda-calculus, linear logic and implicit complexity. Since then the group has enlarged his thematics; a good approximation of its new interests is the scientific programme of the Geocal06 session organised in Luminy during February 2006. Some of the current area of research currently explored in the group are: - logic and operator algebras (J.-Y. Girard) - semantics of programming languages (T. Ehrhrard, L. Regnier) - geometry of computation (Y. Lafont) - logic and modelisation of biological networks (P. Ruet) - formal method for language analysis (M. Quatrini, M.-R. Fleury) - ... On the research side we wishe to recrut a young researcher with a good background in mathematics, logic and/or theoretical computer science and able to work on the thematics described above. On the teaching side, the recruted person will be member of the d?partement de math?matiques de Luminy and give lectures and/or exercise sessions in mathematics at undergraduate and graduate level. In particular he/she might lecture in the research master Math?matiques Des Fondements de l'Informatique (5th year of university), typically for an advanced course on mathematical logic. The amount of teaching is about 6 hours a week. Ma?tre de conf?rence (MdC) is a permanent teaching and researching position in french university. The only requirement for application is to have defended a Phd thesis (in mathematics or theoretical computer science for this particular position) by December 14 2006. Knowledge in french is not required but strongly advised as all teaching is in french. Application is in two steps: - September 11 to October 16 2006: application for qualification by the Conseil National des Universit?s (CNU); - February 2007: application on MdC positions in french universities. Application for qualification is primarily done via an electronic form (and further tasks). If the candidate is successfully qualified, he may apply in any french university during spring 2007. The complete application procedure is described on the french governement site(4). If interested please contact us. Laurent Regnier --------------------------------------------- * Logic group at IML: http://iml.univ-mrs.fr/ldp/ * Geocal06 session: http://iml.univ-mrs.fr/geocal06/ * Institut de Math?matiques de Luminy: http://iml.univ-mrs.fr/ * D?partement de math?matiques de Luminy: http://lumimath.univ-mrs.fr/ * French governement site for administrative information: http://www.education.gouv.fr/personnel/enseignant_superieur/enseignant_chercheur/default.htm From Vincent.vanOostrom at phil.uu.nl Thu Jul 20 10:22:02 2006 From: Vincent.vanOostrom at phil.uu.nl (Vincent van Oostrom) Date: Thu, 20 Jul 2006 16:22:02 +0200 Subject: [TYPES/announce] Position in Logic in Utrecht Message-ID: <44BF918A.5050708@phil.uu.nl> Position in Logic, vacancy nr 68626 Department of Philosophy, Utrecht University Located within one of the Netherlands oldest and largest Universities, Utrecht University's Department of Humanities/Philosophy has bachelor and master programmes in Philosophy, Cognitive Artificial Intelligence, Liberal Arts & Sciences and Applied Ethics. It participates in the master History and Philosophy of Science. All research is concentrated in the ZENO Research Institute for Philosophy. The department is strong in research and strives to keep the highest standards in education. The research group Theoretical Philosophy seeks a Lecturer in Logic for 1,0 fte. The salary is a maximum of Euro 4.705,- gross a month for a full time appointment. Description: We are looking for a Lecturer (Universitair Docent) in Logic. The lecturer will work in the programme Logic, Meaning & Cognition with a focus on Philosophical Logic or Foundations of Computer Science/Applied Logic. See: http://www.phil.uu.nl/onderzoek/theoretical.shtml. This programme obtained high scores in a recent external inspection. The group consists of researchers in Philosophy of Language, Philosophy of Science, Logic, Foundations of Computer Science/Applied Logic and Foundations of Linguistics. Teaching responsibilities (60% of the appointment) include bachelor's and master's courses in Philosophy and Cognitive Artificial Intelligence on all levels as well as thesis supervision. Candidates should have some evidence of outstanding teaching ability. This is a permanent position, conditional upon successful performance during an initial one-year probationary period. Salary is set at level 11/12 of the collectively bargained pay scale of Dutch Universities, which is minimum Euro 3.024,-- and maximum Euro 4.705,-- per month, depending on qualifications and experience. The university also has excellent secondary benefits, including a pension scheme, a contribution to the costs of childcare and 19 days Reduction of Working Hours annually. Conditions are supplemented with a holiday allowance of 8% per year. The successful candidate will be expected to learn Dutch within the first two years. The Department strives to increase the number of women on the academic staff, and where candidates are equally qualified; preference will be given to women. Contact: For more information, please contact prof. dr. Albert Visser by email: Albert.Visser at phil.uu.nl or by telephone +31.30.253.2173 Where to send your application: Applications (by e-mail or regular mail) should contain a curriculum vitae and a list of publications should be send before August 14th to the Personnel Department, attn. Mrs. Margot Hinderink, Kromme Nieuwegracht 46, 3512 HJ Utrecht, The Netherlands. Please refer to the vacancy number 68626. E-mail applications should be send in pdf or doc format to PenO at let.uu.nl , and should specify your name and vacancy number 68626 in the message as well as in the topic. Deadline application: August 14th 2006. Interviews are planned for the first weeks of September. (http://www.uu.nl/uupublish/homeuu/homeenglish/working/vacancies/25678main.html) From barbara_koenig at uni-due.de Fri Jul 21 08:46:15 2006 From: barbara_koenig at uni-due.de (Barbara Koenig) Date: Fri, 21 Jul 2006 14:46:15 +0200 Subject: [TYPES/announce] Position at the University of Duisburg-Essen (Germany) Message-ID: The Theoretical Computer Science Group (Prof. Barbara Koenig) at the University of Duisburg-Essen (Germany) has one open PhD position in the project SANDS paid according to BAT IIa (full-time). Candidates at post-doc level can also be considered. For more information have a look at our web pages: http://www.informatik.uni-duisburg.de/AGThInf/ http://www.informatik.uni-duisburg.de/AGThInf/research/sands/index.html Project SANDS - Static Analysis of Dynamically Evolving Systems --------------------------------------------------------------- Modern software systems must meet increasingly higher safety, security, and reliability standards. At the same time, they are becoming more dynamic in nature: At program level, modern code relies on dynamic creation of objects and dynamic dispatch of methods. At system level, communication protocols, computer networks or ubiquitous computing systems exhibit complex features involving process migration, remote execution or dynamic reconfiguration. This combination of higher requirements and more complex systems makes the task of meeting the standards one of the big challenges of software technology. Dynamic features are modelled in a natural way by means of transformation rules acting on graphs, also known as graph transformation systems. Comparatively little is known in terms of static analysis and verification techniques able to provide information about the behaviour of general graph transformation systems in reasonable time. The aim of this project is to apply static analysis techniques to dynamic systems, specified by graph transformation rules, to develop suitable specification languages and to apply these techniques in order to analyse systems with mobile processes and dynamically evolving data structures. We prefer applicants with experience in some of the following topics: static analysis, diagnosis, concurrency theory, logics, graph transformation systems, Petri nets and/or unfoldings. Requirements ------------ You should have or should be in the process of obtaining a MSc or equivalent degree. Prior knowledge about the topics of the projects is considered an advantage. Good English speaking and writing skills are demanded, as well as the willingness to learn German. Your Application ---------------- You can obtain further information by adressing your enquiries to: Barbara Koenig barbara_koenig at uni-due.de tel.: ++49-203-3793397 If you are interested in the position, please send your e-mail application to the address given above. Your application should include: * A description of your interest in the project, including your motivation and specific qualifications. * A curriculum vitae, including an abstract of your graduate thesis and the name of your supervisor. * If you are interested in a post-doc position, please include a list of your publications and the names of possible referees. There is no application deadline. Applications will be assessed on an on-going basis until the position is filled. From patrick.baillot at lipn.univ-paris13.fr Fri Jul 21 11:53:10 2006 From: patrick.baillot at lipn.univ-paris13.fr (Patrick Baillot) Date: Fri, 21 Jul 2006 17:53:10 +0200 Subject: [TYPES/announce] extended deadline: CFP for ToCL special issue on ICC Message-ID: <20060721175310.t41k5gsy4mlcc88o@lipn.univ-paris13.fr> !! Extended Deadline: september 30th 2006 !! (see 'Planned Schedule' below) ------------------------------------------------------------------------ SECOND 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 : **september 30th 2006** Notification : december 31th 2006 Final manuscripts : 1st of April 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 flokam at cs.tu-berlin.de Thu Jul 20 12:43:20 2006 From: flokam at cs.tu-berlin.de (Florian Kammueller) Date: Thu, 20 Jul 2006 18:43:20 +0200 Subject: [TYPES/announce] [isabelle] Junior researcher position at TU Berlin Message-ID: <44BFB2A8.9080305@cs.tu-berlin.de> [Sorry for multiple copies, please redistribute to any interested parties] Junior researcher position for two years (extension by one year possible) at Technische Universitaet Berlin in the ASCOT project. In this project we want to investigate the new language paradigms aspect-orientation and collaboration-based programming with interactive HOL theorem proving. The position is paid according to BAT2a -- the German salary scheme for public service. The salary varies according to age and martial status roughly between 2000 and 3000 euros per month. The applicant should have a strong background in HOL theorem proving (Isabelle or Coq) and an interest in programming languages. The position may be used to do a PhD, but may as well be considered as a post-doc position. Applications including a curriculum vitae and adresses of referees, should be sent preferably by email to flokam at cs.tu-berlin.de (or alternatively by regular mail to the address below). There is no strict deadline but we would like to start October or November. For further information and enquiries please feel free to contact this email or refer to the preliminary project web page http://www.cs.tu-berlin.de/~flokam/ascot. Dr. Florian Kamm?ller TU-Berlin, Institut f?r Softwaretechnik und Theoretische Informatik, FR 5-6, Franklinstr 28/29, 10587 Berlin From kwang at ropas.snu.ac.kr Sun Jul 23 22:13:20 2006 From: kwang at ropas.snu.ac.kr (Kwangkeun Yi) Date: Mon, 24 Jul 2006 11:13:20 +0900 Subject: [TYPES/announce] SAS 2006 Call for Participation Message-ID: <20060724021320.GA6399@ropas.snu.ac.kr> ***************************************************************************** Call For Participation The 13th International Static Analysis Symposium (SAS'06) Seoul, Korea 29-31 August 2006 http://ropas.snu.ac.kr/sas06 ***************************************************************************** IMPORTANT DATES: Early registration: 05 August 2006 INVITED TALKS - Unleashing the Power of Static Analysis Manuvir Das, Microsoft - Separation Logic and Program Analysis Peter W. O'Hearn, Queen Mary, U. of London - Shape Analysis for Low-level Code Hongseok Yang, Seoul National U. 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 13th SAS 2006 will 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. ACCEPTED PAPERS - Static Analysis in Disjunctive Numerical Domains Sriram Sankaranarayanan, Franjo Ivancic, Ilya Shlyakhter and Aarti Gupta - Static Analysis of Numerical Algorithms Eric Goubault and Sylvie Putot - Static Analysis of String Manipulations in Critical Embedded C Programs Xavier Allamigeon, Wenceslas Godard and Charles Hymans - Abstract Regular Tree Model Checking of Complex Dynamic Data Structures Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz and Tomas Vojnar - Structural Invariants Ranjit Jhala, Rupak Majumdar and Ru-Gang Xu - Existential Label Flow Inference via CFL Reachability Polyvios Pratikakis, Jeffrey S. Foster and Michael Hicks - Abstract Interpretation with Specialized Definitions Germ?n Puebla, Elvira Albert and Manuel Hermenegildo - Underapproximating Predicate Transformers David A. Schmidt - Combining Widening and Acceleration in Linear Relation Analysis Laure Gonnord and Nicolas Halbwachs - Beyond Iteration Vectors: Instancewise Relational Abstract Domains Pierre Amiranoff, Albert Cohen and Paul Feautrier - Specialized 3-Valued Logic Shape Analysis using Structure-Based Refinement and Loose Embedding Gilad Arnold - Recency-Abstraction for Heap-Allocated Storage Gogul Balakrishnan and Thomas Reps - Interprocedural Shape Analysis with Separated Heap Abstractions Alexey Gotsman, Josh Berdine and Byron Cook - Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm Alexey Loginov, Thomas Reps and Mooly Sagiv - Catching and Identifying Bugs in Register Allocation Yuqiang Huang, Bruce R. Childers and Mary Lou Soffa - Certificate Translation for Optimizing Compilers Gilles Barthe, Benjamin Gr?goire, C?sar Kunz and Tamara Rezk - Analysis of Low-Level Code Using Cooperating Decompilers Bor-Yuh Evan Chang, Matthew Harren and George C. Necula - Static Analysis for Java Servlets and JSP Christian Kirkegaard and Anders M?ller - Cryptographically-Masked Flows Aslan Askarov, Daniel Hedin and Andrei Sabelfeld - Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems Julien Bertrane - Parametric and Termination-Sensitive Control Dependence Feng Chen and Grigore Rosu - Memory Leak Analysis by Contradiction Maksim Orlovich and Radu Rugina - Path-Sensitive Dataflow Analysis with Iterative Refinement Dinakar Dhurjati, Manuvir Das and Yue Yang REGISTRATION FEE - Early regular USD 380, Early student USD 280 - Late regular USD 430, Late student USD 330 ************************************************************************ From mitsu at abelard.flet.keio.ac.jp Tue Jul 25 06:49:22 2006 From: mitsu at abelard.flet.keio.ac.jp (Mitsu OKADA) Date: Tue, 25 Jul 2006 19:49:22 +0900 Subject: [TYPES/announce] ASIAN06 on Secure Software : New Submission Deadlines (Annual ASIAN Tokyo Meeting, Dec 6-8, 2006) Message-ID: <44C5F732.4000409@abelard.flet.keio.ac.jp> -------------------------------------------------------------------------- ASIAN 06, Focusing on SECURE SOFTWARE and related issiues (Annual ASIAN COMPUTING SCIENCE CONFERENCE) TOKYO MEETING (December 6-8, 2006), hosted by National Institute of Informatics of Japan EXTENSIONS of Paper Submissions Deadline. (PLEASE NOTE THAT THE ABSTRACT SUBMISSION DEADLINE IS NOW MOVED TO AUGUST 24TH) Considering many requests for extending deadlines, we change the deadlines and publication schedule of ASIAN 06 as follows. Title and abstracts (100-300 words) by August 24th, 2006 Paper submission by August 31st, 2006 Notification by October 6th, 2006 http://www.nii.ac.jp/asian2006 Regular papers (up to 15 pages) and short-papers (up to 7 pages). The proceedings will be published as a volume of Springer LNCS. If you have any questions on paper submissions, please contact our conference office at asian06 at nii.ac.jp or directly the Program Committee Co-chair, Mitsuhiro Okada, Keio University, at mitsuATabelardDOTfletDOTkeioDOTacDOTjp ------------------------------------------------ Scope The theme of this year's Annual ASIAN Conference is Secure Software and related computer security issues. The conference aims at discovering and promoting new ways to apply theoretical and practical techniques in secure software analysis, design, development, and operation. Papers are invited on all aspects of theory, practice, applications, and experiences related to this theme. Moreover, papers targeting lessons learn from and education for the development and operation of secure software are particularly welcome. Topics of interest include but are not limited to: * Theoretical approaches to secure software * Formal specification and verification of software * Programming language semantics * Static analysis * Type systems and type theory for secure programming * Automated deduction and reasoning about secure software * Model checking for security * Testing and aspects of security in software * Secure protocols and networks * Authentication and cryptography issues * logic and semantics for protocol analysis * Dependable and autonomic architectures and design * Secure OS and middleware * Artificial intelligence for secure systems * Secure software engineering * Education for secure software development * Security-specific software development practices * Case analysis and failure analysis for secure software * Policy and standardization issues for secure software Important Dates -- SUBMISSION DEADLINE EXTENDED -- Considering many requests for extending deadlines, we change the deadlines and publication schedule of ASIAN 06 as follows. Title and abstracts (100-300 words) by August 24th, 2006 (NEW CHANGE) Papers submission by August 31st, 2006 Notification by October 6th, 2006 Abstracts and papers can be submitted through http://www.EasyChair.org/ASIAN06 until the deadlines. Motivation Security problems in computing systems, in particular software, become serious and widespread. We are confronted with an increasing number and variety of attacks by remote computers and malicious software, e.g., computer viruses, bots, worms, etc. Whatever the advances in hardware and software, the amount and consequences of such attacks remains serious. Moreover, the ubiquity of computing systems amounts to their use in dependable and mission-critical systems, failure of which can result in serious damages for our daily life. Most security incidents could be traced back to defects in software, thus secure software is becoming an essential requirement of modern computing. However, the development of secure software is a very difficult task that should be based on theoretical approaches and formal methods, such as logic, type theory, and proof theory, to increase the level of confidence in the design and implementation of security-critical systems. Automated tools and techniques are essential for the analysis and verification of software and systems. We also need processes that effectively and efficiently incorporate rigorous techniques for producing secure software and practitioners that are motivated, disciplined, and proficient in their execution. Security in computing systems often relies on the underlying system-level software, e.g., operating systems, network protocol stacks and middleware. Security mechanisms in these systems play therefore an important role. The aim of the Conference is to provide a forum for exchanging ideas among researchers of secure software, in a broad sense, from theoretical and practical fields, and from Asian, American, European and other regions. Submission and Proceedings Accepted papers will be published in a volume of the Springer Lecture Notes in Computer Science series, as all 10 former proceedings of the past ASIAN conferences were published in the series. Please prepare your manuscript using the series' style, following the instructions downloadable at http://www.springer.de/comp/lncs/authors.html. The length of proceedings papers will be limited to 15 pages for regular paper. A paper up to 7 pages can also be submitted as a short paper. With the notification of acceptance, the author(s) of an accepted paper will also receive further information on submitting the manuscript(s) presented in the pre-proceeding and formal proceedings. For inclusion of a paper for publication in the proceedings, at least one of the co-authors is required to pre-register for participation and present the paper at the Conference. http://www.nii.ac.jp/asian2006 ------------------------------------ About ASIAN Conference series The series of Annual Asian Computing Science Conferences (ASIAN) was initiated in 1995 by AIT, INRIA and UNU/IIST to provide a forum for researchers in computer science from the Asian region and to promote interaction with researchers from other regions. The first seven conferences were held, respectively, in Bangkok, Singapore, Kathmandu, Manila, Phuket, Penang, Hanoi, and Kunming. In addition to support from the host countries, they have also been sponsored by INRIA, France, UNU/IIST, Macau and NUS, Singapore. The proceedings have been published as Lecture Notes in Computer Science by Springer-Verlag. ------------------------------------------------------- General chairs * Akinori Yonezawa (University of Tokyo, Japan) * Philippe Codognet (Embassy of France in Japan) Program Committee Chairs * Mitsuhiro Okada (Keio University, Japan) * Ichiro Satoh (National Institute of Informatics, Japan) Program Committee * Patrick Cousot (Ecole Normale Supereure-Paris, France) * Anupam Datta (Stanford University, USA) * Sumanta Guha, (AIT, Thailand) * Masami Hagiya (University of Tokyo) * John Mitchell (Stanford University, USA) * Ching-Laung Lei (Taiwan National University, Taiwan) * Joxan Jaffar (National University of Singapore, Singapore) * Kanchana Kanchanasut (AIT, Thailand) * Ninghui Li (Purdue University, USA) * Xavier Leroy (INRIA, France) * Atsushi Ohori (Tohoku University, Japan) * Michael Rusinowitch (INRIA-Lorraine/University of Nancy/CNRS, France) * Etsuya Shibayama (Tokyo Insitute of Technology, Japan) * L. Yohanes Stefanus (University of Indonesia, Indonesia) * Kazushige Terui (National Institute of Informatics, Japan) * Kazunori Ueda (Waseda University, Japan) and others, to be announced. Local Organization Committee * Shin Nakajima (National Institute of Informatics, Japan) * Kensuke Fukuda (National Institute of Informatics, Japan) * Soichiro Hidaka (National Institute of Informatics, Japan) * Hiroshi Hosobe (National Institute of Informatics, Japan) * Hiroyuki Kato (National Institute of Informatics, Japan) * Michihiro Koibuchi (National Institute of Informatics, Japan) The conference is sponsored by National Institute of Informatics, Japan, the Embassy of France in Japan and INRIA. ------------------------- From femke at cs.vu.nl Tue Jul 25 07:25:32 2006 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Tue, 25 Jul 2006 13:25:32 +0200 (CEST) Subject: [TYPES/announce] HOR 2006: call for participation Message-ID: ************************************* * * * HOR'06 CALL FOR PARTICIPATION * * * ************************************* 3rd International Workshop on Higher-Order Rewriting Tuesday August 15, 2006 http://www.easychair.org/FLoC-06/HOR.html The aim of HOR is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. INVITED TALKS: * Hugo Herbelin (INRIA Futurs) The duality of computation * Eelco Visser (University of Utrecht) Dynamic rewrite rules TALKS: * Thomas Ehrhard and Olivier Laurent Embedding the finitary Pi-calculus in differential interaction nets * Caroline Priou Non-deterministic Bohm trees * Barry Jay Typing the pattern calculus * Barry Jay Quantifying the benefits of sub-typing * Nao Hirokawa and Aart Middeldorp Uncurrying for termination * Shane O'Conchuir Proving PSN by simulating non-cal substitution with local substitution 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 PROCEEDINGS: The proceedings of HOR 2006 are published as a technical report and will be made available via the HOR web page. From aserebre at win.tue.nl Tue Jul 25 13:11:38 2006 From: aserebre at win.tue.nl (A Serebrenik) Date: Tue, 25 Jul 2006 19:11:38 +0200 (CEST) Subject: [TYPES/announce] Call for Participation --- ICLP'06 In-Reply-To: References: Message-ID: Call for Participation --- ICLP'06 Seattle, Washington, USA August 17 -- August 20, 2006 http://www.easychair.org/FLoC-06/ICLP.html or http://www.cs.uky.edu/iclp06/ A member conference of The 2006 Federated Logic Conference Seattle, Washington, USA August 10 -- August 22, 2006 http://www.easychair.org/FLoC-06/ We are pleased to announce the 22nd International Conference on Logic Programming, a member of the 4th Federated Logic Conference (FLoC'06) to be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.easychair.org/FLoC-06/floc-hotel.html). The ICLP'06 program includes a keynote talk by David Harel, plenary talks by David Dill (both general FLoC'06 events), and invited talks by Monica Lam and Chris Welty. The technical program will also include 27 regular presentations, 17 poster presentations and the traditional Prolog programming contest. Online registration for ICLP/FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for early registration is July 10, 2006. Deadline for preferred hotel rate is July 21, 2006. The registration page offers an opportunity for ICLP 2006 participants to provide a voluntary contribution of $50 to the Association for Logic Programming (ALP). We encourage every participant to consider contributing to the ALP. Association of the ICLP 2006 with FLoC'06 offers many exciting opportunities to ICLP participants as FLoC'06 promises to be the premier scientific meeting in computational logic in 2006. The following conferences will participate in FLoC'06: CAV Conference on Computer Aided Verification (Aug 17-20) ICLP Int'l Conference on Logic Programming (Aug 17-20) IJCAR Int'l Joint Conference on Automated Reasoning (Aug 17-20) LICS IEEE Symposium on Logic in Computer Science (Aug 12-15) RTA Conference on Rewriting Techniques and Applications (Aug 12-14) SAT Int'l Conference on Theory and Applications of Satisfiability Testing (Aug 12-15) The six major conferences will be accompanied by 41 workshops, held on Aug. 10-11, 15-16, and 21-22. The FLoC'06 program, in addition to the events mentioned above and directly pertaining to ICLP 2006 program, includes also a keynote session to commemorate the Goedel Centenary, with John Dawson and Dana Scott as speakers, a plenary talk by Randy Bryant, and invited talks by F. Bacchus, A. Blass, B. Buchberger, A. Darwiche, M. Das, J. Esparza, J. Giesl, A. Gordon, T. Hoare, O. Kupferman, D. Miller, K. Sakallah and J. Stoy. FLoC has received an NSF grant to provide funds for travel grants of up to $750 for student attendees of FLoC'06. We expect to award about 50 grants. See application information on the website. Seattle, the Emerald city, sits on the shores of Puget Sound surrounded by mountains to the east and west. Lovely views of blue waters and snow capped peaks seem to appear everywhere - around the next bend in the road or between the buildings downtown. Seattle is the gateway to the Pacific Northwest, a premier tourist attraction. In Seattle, Mt. Rainier enchants visitors; in Vancouver, British Columbia, the Coast Range juts out over downtown; and in Portland, 5,000 acres of forestland north of the city center harbor deer, elk, and the odd bear and cougar. Online registration for FLoC is now open at: http://www.easychair.org/FLoC-06/ Deadline for preferred hotel rate is July 21, 2006. Deadline for early registration is July 10, 2006. FLoC'06 Steering Committee Moshe Y. Vardi (General Chair) Thomas Ball (Conference Co-Chair) Jakob Rehof (Conference Co-Chair) Edmund Clarke (CAV) Reiner Hahnle (IJCAR) Manuel Hermenegildo (ICLP) Phokion Kolaitis (LICS) Henry Kautz (SAT) Aart Middeldorp (RTA) Andrei Voronkov (IJCAR) From robby at cs.uchicago.edu Mon Jul 31 16:48:03 2006 From: robby at cs.uchicago.edu (Robby Findler) Date: Mon, 31 Jul 2006 15:48:03 -0500 (CDT) Subject: [TYPES/announce] Call for Participation: Scheme & Functional Programming Workshop 2006 Message-ID: <20060731204803.B2FD96C766@laime.cs.uchicago.edu> Dear all, The Scheme and Functional Programming Workshop pre-registration deadline is in about 2 and a half weeks -- do be sure to register for ICFP and the workshop before then. Come to hear Manuel Serrano talk about HOP, his new language for programming the web, a status report from the R6RS editors, and presentations of the work below. I look forward to seeing you in Portland! http://scheme2006.cs.uchicago.edu/ Best, Robby ======================================== A Self-Hosting Evaluator using HOAS Eli Barzilay (Northeastern University) We demonstrate a tiny, yet non-trivial evaluator that is powerful enough to run practical code, including itself. This is made possible using a Higher-Order Abstract Syntax (HOAS) representation -- a technique that has become popular in syntax-related research during the past decade. With a HOAS encoding, we use functions to encode binders in syntax values, leading to an advantages of reflecting binders rather than re-implementing them. In Scheme, hygienic macros cover problems that are associated with binders in an elegant way, but only when extending the language, i.e., when we work at the meta-level. In contrast, HOAS is a useful object-level technique, used when we need to represent syntax values that contain bindings -- and this is achieved in a way that is simple, robust, and efficient. We gradually develop the code, explaining the technique and its benefits, while playing with the evaluator. >From Variadic Functions to Variadic Relations William E. Byrd and Daniel P. Friedman (Indiana University) Scheme makes it easy to define variadic functions, which take an arbitrary number of arguments; miniKanren, a logic programming language embedded in R5RS Scheme, makes it easy to define variadic relations. A variadic miniKanren relation takes two arguments: a list containing input arguments and an output argument. A fresh or partially-instantiated logic variable passed to a variadic relation can represent the list of input arguments. A relation may also be super-variadic---such a relation takes a list of lists of input arguments. We show the variadic and super-variadic relational equivalent of several variadic functions, examples of their use, and several abstractions over these relations. We also present a brief miniKanren overview, along with an R5RS-compliant implementation of the subset of miniKanren that we use. Experiences with Scheme in an Electro-Optics Laboratory Richard Cleis and Keith Wilson (Air Force Research Laboratory) The Starfire Optical Range is an Air Force Research Laboratory engaged in Atmospheric Research near Albuquerque, New Mexico. Since the late 1980's it has developed numerous telescope systems and auxiliary devices. Nearly all are controlled by C programs that became difficult to manage due to the large number of configurations required to support the experiments. To alleviate the problem, Scheme has been introduced in at least six distinct ways. This paper describes the uses of Scheme, emerging programming techniques, and general experiences of the past several years. Rapid Case Dispatch in Scheme William D. Clinger (Northeastern University) The case expressions of Scheme can and should be implemented efficiently. A three-level dispatch performs well, even when dispatching on symbols, and scales to large case expressions. A Stepper for Scheme Macros Ryan Culpepper, Matthias Felleisen (Northeastern University) Even in the days of Lisp's simple defmacro systems, macro developers did not have adequate debugging support from their programming environment. Modern Scheme macro expanders are more complex than Lisp's, implementing lexical hygiene, referential transparency for macro definitions, and frequently other source properties. Scheme implementations, however, have only adapted Lisp's inadequate macro inspection tools. Unfortunately, these tools rely on a rather naive model of the expansion process, thus leaving a large gap between Scheme's complex mode of expansion and what the programmer sees. In this paper, we present a macro debugger with full support for modern Scheme macros. To construct the debugger, we have extended the macro expander so that it issues a series of expansion events. A parser turns these event streams into derivations in a natural semantics for macro expansion. From these derivations, the debugger extracts a reduction-sequence (stepping) view of the expansion. A programmer can specify with simple policies which parts of a derivation to omit and which parts to show. Last but not least, the debugger includes a syntax browser that graphically displays the various pieces of information attached to syntactic tokens. Automatic construction of parse trees for lexemes Danny Dub\'e (Universit\'e Laval) and Anass Kadiri (EPITA, Paris France) Recently, Dub\'e and Feeley presented a technique that makes lexical analyzers able to build parse trees for the lexemes that match regular expressions. While parse trees usually demonstrate how a word is generated by a context-free grammar, these parse trees demonstrate how a word is generated by a regular expression, in an analogous fashion. This paper describes the adaptation and implementation of that technique in a concrete lexical analyzer generator. The adaptation of the technique includes extending it to the rich set of operators handled by the generator and reversing the direction of the parse trees construction so that it corresponds to the natural right-to-left direction of the Scheme lists construction. The implementation of the adapted technique includes modifications to both the generation-time and the run-time parts of the generator. Uses of the new addition and empirical measurements of its cost are presented. Extensions and alternatives to the technique are considered. Concurrency Oriented Programming in Termite Scheme Guillaume Germain, Marc Feeley, Stefan Monnier (Universit\'e de Montr\'eal) Termite is a language and system offering a simple and powerful tool for expressing distributed computation. It is based on a message-passing model of concurrency inspired by Erlang, and on a variant of the functional language Scheme. Our system is an appropriate tool for building custom protocols and abstractions for distributed computation. Its open network model allows for the building of non-centralized distributed applications. The possibility of failure is reflected in the model, and ways to handle them are proposed. The existence of first-class continuations is exploited in order to allow the expression of high-level concepts such as migration of processes. We describe the Termite model with its implications and describe sample applications built with Termite. We conclude with a discussion of the current implementation and its performance. An Incremental Approach to Compiler Construction Abdulaziz Ghuloum (Indiana University) Compilers are perceived to be magical artifacts, carefully crafted by the wizards, and unfathomable by the mere mortals. Books on compilers are better described as wizard-talk: written by and for a clique of all-knowing practitioners. Real-life compilers are too complex to serve as an educational tool. And the gap between real-life compilers and the educational toy compilers is too wide. The novice compiler writer stands puzzled facing an impenetrable barrier, ``better write an interpreter instead.'' The goal of this paper is to break that barrier. We show that building a compiler can be as easy as building an interpreter. The compiler we construct accepts a large subset of the Scheme programming language and produces assembly code for the Intel-x86 architecture, the dominant architecture of personal computing. The development of the compiler is broken into many small incremental steps. Every step yields a fully working compiler for a progressively expanding subset of Scheme. Every compiler step produces real assembly code that can be assembled then executed directly by the hardware. We assume that the reader is familiar with the basic computer architecture: its components and execution model. Detailed knowledge of the Intel-x86 architecture is not required. The development of the compiler is described in detail in an extended tutorial. Supporting material for the tutorial such as an automated testing facility coupled with a a comprehensive test suite are provided with the tutorial. It is our hope that current and future implementors of Scheme find in this paper the motivation for developing high-performance compilers and the means for achieving that goal. Sage: Hybrid Checking for Flexible Specifications Jessica Gronski (University of California, Santa Cruz (UCSC)), Kenneth Knowles (UCSC), Aaron Tomb (UCSC), Stephen N. Freund (Williams College), and Cormac Flanagan (UCSC) Software systems typically contain large APIs that are informally specified and hence easily misused. This paper presents the Sage programming language, which is designed to enforce precise interface specifications in a flexible manner. The Sage type system uses a synthesis of the type ``dynamic'', first-class types, and arbitrary refinement types. Since type checking for this expressive language is not statically decidable, Sage uses hybrid type checking, which extends static type checking with dynamic contract checking, automatic theorem proving, and a database of refuted subtype judgments. Interaction-Safe State for the Web Jay McCarthy and Shriram Krishnamurthi (Brown University) Recent research has demonstrated that continuations provide a clean basis to describe interactive Web programs. This account, however, provides only a limited description of state, which is essential to several Web applications. This state is affected by the numerous control operators (known as navigation buttons) in Web browsers, which make Web applications behave in unexpected and even erroneous ways. We describe these subtleties as discovered in the context of working Web applications. Based on this analysis we present linguistic extensions that accurately capture state in the context of the Web, presenting a novel form of dynamic scope. We support this investigation with a formal semantics and a discussion of applications. The results of this paper have already been successfully applied to working applications. Component Deployment with PLaneT: You Want it Where? Jacob Matthews (University of Chicago) For the past two years we have been developing PLaneT, a package manager built into PLT Scheme's module system that simplifies program development by doing away with the distinction between installed and uninstalled packages. In this paper we explain how PLaneT works and the rationales behind our major design choices, focusing particularly on our decision to integrate PLaneT into PLT Scheme and the consequences that decision had for PLaneT's design. We also report our experience as PLaneT users and developers and describe what have emerged as its biggest advantages and drawbacks. Scheme for Client-Side Scripting in Mobile Web Browsing, or AJAX-Like Behavior Without Javascript Ray Rischpater (Rocket Mobile, Inc.) I present an implementation of Scheme embedded within a Web browser for wireless terminals. Based on a port of TinyScheme integrated with RocketBrowser, an XHTML-MP browser running on Qualcomm BREW-enabled handsets, the resulting application can support the same use cases as traditional JavaScript-enabled browsers, including asynchronous programming recently popularized via AJAX (Asynchronous Javascript and XML). In addition to a comparison of the resulting script capabilities, I present the changes required to bring TinyScheme to Qualcomm BREW, including adding support for BREW components as TinyScheme data types. SHard: a Scheme to Hardware Compiler Xavier Saint-Mleux (Universit\'e de Montr\'eal), Marc Feeley (Universit\'e de Montr\'eal) and Jean-Pierre David (\'Ecole Polytechnique de Montr\'eal) Implementing embedded systems in hardware can have several benefits (performance, power usage, etc.). Current hardware/software co-design methodologies, which offer a language for describing hardware and another language for programming the software, put the burden of system partitioning on the developer, which is tedious and makes component transformation and reuse difficult. Our goal is to put most of this burden on the compiler through the use of a single, simple programming language. We describe a prototype compiler that compiles a functional subset of Scheme into a high-level description of dataflow parallel hardware. The compiler supports tail and non-tail function calls and higher-order functions. Our approach makes it possible to implement software algorithms in hardware with very few modifications (e.g. IO channel declaration). Performance results of our system are given for FPGA hardware. Gradual Typing for Functional Languages Jeremy G. Siek and Walid Taha (Rice University) Static and dynamic type systems have well-known strengths and weaknesses, and each is better suited for different programming tasks. There have been many efforts to integrate static and dynamic typing and thereby combine the benefits of both typing disciplines in the same language. The flexibility of static typing can be improved by adding a type Dynamic and a typecase form. The safety and performance of dynamic typing can be improved by adding optional type annotations or by performing type inference (as in soft typing). However, there has been little formal work on type systems that allow a programmer-controlled migration between dynamic and static typing. Thatte proposed Quasi-Static Typing, but it does not statically catch all type errors in completely annotated programs. Anderson and Drossopoulou defined a nominal type system for an object-oriented language with optional type annotations. However, developing a sound, gradual type system for functional languages with structural types is an open problem. In this paper we present a solution based on the intuition that the structure of a type may be partially known/unknown at compile-time and the job of the type system is to catch incompatibilities between the known parts of types. We define the static and dynamic semantics of a lambda-calculus with optional type annotations and we prove that its type system is sound with respect to the simply-typed lambda-calculus for fully-annotated terms. We prove that this calculus is type safe and that the cost of dynamism is ``pay-as-you-go''. From svb at doc.ic.ac.uk Tue Aug 1 07:12:30 2006 From: svb at doc.ic.ac.uk (Steffen van Bakel) Date: Tue, 1 Aug 2006 12:12:30 +0100 Subject: [TYPES/announce] APAL SPECIAL ISSUE: "CLASSICAL LOGIC AND COMPUTATION" Message-ID: <1154430750.44cf371eb6c77@www.doc.ic.ac.uk> ********************************************************************* ANNALS OF PURE AND APPLIED LOGIC SPECIAL ISSUE ON CLASSICAL LOGIC AND COMPUTATION ********************************************************************* CALL FOR PAPERS =============== Contributions on the topic of Classical Logic and Computation are invited for a special issue of Annals of Pure and Applied Logic. On July 15 2006, the first meeting on "Classical Logic and Computation" took place in Venice, Italy, as satellite meeting to ICALP'06. The meeting intended to cover all work aiming to propose a programming language inspired by classical logic, and a semantics for it. The special issue is first of all set up for papers presented at the workshop, but the call is open to all researchers. TOPICS Topics of interest for contributions to the journal issue in- clude, but are not limited to: - 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), 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 should be substan- tially more complete or otherwise different. 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 APAL. In order to make a submission, please follow the instructions from: authors.elsevier.com/GuideForAuthors.html?PubID=505603&dc=GFA Please send a .ps or .pdf file to either svb at doc.ic.ac.uk or stefano at di.unito.it Deadline for submission: October 31, 2006. Steffen van Bakel, Imperial College, London, UK; Stefano Berardi, Universita` degli studi di Torino, Turin, I. From sweirich at cis.upenn.edu Thu Aug 3 09:29:02 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Thu, 03 Aug 2006 09:29:02 -0400 Subject: [TYPES/announce] Workshop on Mechanizing Metatheory Program Message-ID: <44D1FA1E.3090606@cis.upenn.edu> ------------------------------------------------------------------- Call for Participation 1st Informal ACM SIGPLAN Workshop on Mechanizing Metatheory September 21, 2006 Portland, OR, USA Immediately following ICFP 2006 http://www.cis.upenn.edu/~sweirich/wmm/ Dear all, I am pleased to announce the program for the first ever workshop on mechanizing programming language metatheory. I look forward to seeing you in Portland! Note that the early registration deadline is coming soon---August 18th! That is also the cutoff date for the hotel. See the ICFP web page (http://icfp06.cs.uchicago.edu/) for more logistical information. See you soon, Stephanie ----------------------- Program ---------------------------------- Thursday, September 21, 2006 Session I:9-10, chair Michael Norrish (Canberra Research Lab, National ICT Australia) On the Formalization of Logical Relation Arguments Jeffrey Sarnat (Yale University) and Carsten Schuermann (IT University of Copenhagen) Explicit Contexts in LF Karl Crary (Carnegie Mellon University) Session II:10:30-12, chair Karl Crary (Carnegie Mellon University) A Comparison between Concrete Representations for Bindings Arthur Chargueraud (ENS, Paris) Towards a Coq Library for Programming Languages Meta-Theory with Concrete Names Aaron Stump (Washington University in St. Louis) Mechanized Reasoning for Binding Constructs in Types Assembly Language Using Coq Nadeem Hamid (Berry College) Session III: 14-15:30, chair Peter Sewell (Cambridge University) Machine Obstructed Proof: How many months can it take to verify 30 assembly instructions? Nick Benton (Microsoft Research) Proof Weaving Anne Mulhern (University of Wisconsin-Madison) Mechanized Metatheory Model-Checking James Cheney (University of Edinburgh) Session IV:16-17, chair Stephanie Weirich (University of Pennsylvania) Mechanizing the Metatheory of an Elaborative Semantics for Standard ML Daniel Lee, Karl Crary, Robert Harper (Carnegie Mellon University) Mechanized Metatheory for User-Defined Type Extensions Daniel Marino, Brian Chin, Todd Millstein (University of California, Los Angeles), Gang Tan (Boston College), Rob Simmons, and David Walker (Princeton University) From eijiro.sumii at gmail.com Thu Aug 3 23:18:30 2006 From: eijiro.sumii at gmail.com (Eijiro Sumii) Date: Fri, 4 Aug 2006 12:18:30 +0900 Subject: [TYPES/announce] Call for Posters, APLAS 2006 (in Sydney, in November) Message-ID: CALL FOR POSTER PRESENTATIONS The Fourth ASIAN Symposium on Programming Languages and Systems (APLAS 2006) November 8-10, 2006 University of New South Wales, Sydney, Australia Deadline for Abstracts: September 11, 2006 APLAS 2006 will include a poster session during the conference. The session aims to give students and researchers an opportunity to present their research to the community, and to get responses from other researchers. SCOPE: Poster presentations are sought in all areas of programming languages and systems, including (but not limited to): - 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 FORMAT: A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. If you need more space, contact the poster chair (sumii AT ecei DOT tohoku DOT ac DOT jp). Links that may be useful for preparing good posters include: - http://www.kumc.edu/SAH/OTEd/jradel/Poster_Presentations/PstrStart.html - http://www.siam.org/siamnews/general/poster.htm REGISTRATION: Each presenter should e-mail a 1-2 page abstract in PDF or PostScript to the poster chair (sumii AT ecei DOT tohoku DOT ac DOT jp) by September 11th, 2006. The program of the poster session will be announced by September 22nd, 2006. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) for the limitation of space. We may also need to cancel the session if there are too few presentations. IMPORTANT DATES: - 1-2 page abstract submission deadline September 11, 2006 - notification September 22, 2006 - conference November 8-10, 2006 CONTACT: For questions or requests, please contact the APLAS 2006 poster chair, Eijiro Sumii (sumii AT ecei DOT tohoku DOT ac DOT jp). From miculan at dimi.uniud.it Mon Aug 7 09:29:51 2006 From: miculan at dimi.uniud.it (Marino Miculan) Date: Mon, 7 Aug 2006 15:29:51 +0200 Subject: [TYPES/announce] IFIP WG2.2 anniversary meeting: Last Call for Participation Message-ID: *********************************************** Note: the meeting is rather exceptional, both for the quality of the speakers and the form of the talks (mostly reflections on history and development of concepts) *********************************************** LAST CALL FOR PARTICIPATION FORMAL DESCRIPTION OF PROGRAMMING CONCEPTS: IFIP WG 2.2 Anniversary Meeting 11-13 September 2006 Udine, Italy http://www.dimi.uniud.it/ifip06/ Registration ~~~~~~~~~~~~ Registration page: http://www.dimi.uniud.it/ifip06/ registration.html Registration deadline: 31 August 2006. The meeting fee is 150 Euros. The workshop fee includes lunches, coffee-breaks, the social dinner and the excursion on Sunday afternoon. About the WG 2.2 ~~~~~~~~~~~~ The IFIP Working Group 2.2 was established in 1965 as one of the first IFIP Working Groups. The primary aim of the WG is to explain programming concepts through the development, examination and comparison of various formal models of these concepts. The WG thus explores the theory and the practice of formal methods for the specification, verification and the design of software and systems. Earliest members of the WG included Dana Scott, Erwin Engeler, Jaco de Bakker, Raymond Abrial, Peter Lauer, Manfred Paul, Erich Neuhold, Maurice Nivat, Ed Blum. Throughout the years, members of the WG shaped various styles of semantics, comprising denotational, operational, algebraic, and logical semantics. About the meeting ~~~~~~~~~~~~ The anniversary meeting commemorates the 40-th birthday of WG. In the meeting, a number of keynote speakers and current members of the WG will give tutorial presentations on topics relevant to the WG, focusing on history (of these topics, or of the WG), but also on current outlook and future developments. Keynote speakers: Amir Pnueli, Igor Walukiewicz, and Ernst-Rudiger Olderog (as current WG members), Dana Scott, Manfred Paul, and Hans Langmaack (as founding WG members), Leslie Lamport and Gordon Plotkin (as past WG members) . Programme and Speakers ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Sunday 10 September, afternoon Excursion: San Daniele countryside (and ham) Monday 11 September * 09.00-10.00: Amir Pnueli * 10.00-10.30: coffee break * 10.30-11.30: Hans Langmaack * 11.30-12.00: Maciej Koutny * 12.00-14.00: lunch * 14.00-15.00: Igor Walukiewicz * 15.00-15.30: coffee break * 15.30-16.30: Ugo Montanari * 16.30-17.00: Catuscia Palamidessi * 17.00-17.30: Andrzej Tarlecki * 17.30-18.00: Rocco De Nicola Tuesday 12 September * 09.00-10.00: Gordon Plotkin * 10.00-10.30: coffee break * 10.30-11.30: local speaker * 11.30-12.00: Mariangiola Dezani * 12.00-14.00: lunch * 14.00-15.00: Dana Scott * 15.00-15.30: coffee break * 15.30-16.30: Egon Boerger * 16.30-17.00: Markus Muller-Olm * 20.00- : Social Dinner Wednesday 13 September * 09.00-10.00: Leslie Lamport * 10.00-10.30: coffee break * 10.30-11.00: Manfred Paul * 11.00-11.30: J Strother Moore * 11.30-12.00: Peter Mosses * 12.00-14.00: lunch * 14.00-15.00: Ernst-Rudiger Olderog * 15.00-15.30: coffee break * 15.30-16.30: Shigeru Igarashi * 16.30-17.00: Stephan Merz * 17.00-17.30: Anders P. Ravn * 17.30-18.00: Philippe Darondeau *********************************************** From royer at ecs.syr.edu Mon Aug 7 16:15:46 2006 From: royer at ecs.syr.edu (James S. Royer) Date: Mon, 7 Aug 2006 16:15:46 -0400 Subject: [TYPES/announce] Paper Announcement: Adventures in Time and Space Message-ID: We would like to annouce the availability of a new paper: TITLE: Adventures in Time and Space AUTHORS: Norman Danner and James S. Royer This is the full version of our POPL'06 paper of the same name. ABSTRACT: This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its second-order programs characterize the type-2 basic feasible functionals of Mehlhorn and of Cook and Urquhart. (The ATR-types are confined to levels 0, 1, and 2.) The type system comes in two parts, one that primarily restricts the sizes of values of expressions and a second that primarily restricts the time required to evaluate expressions. The size-restricted part is motivated by Bellantoni and Cook's and Leivant's implicit characterizations of polynomial-time. The time-restricting part is an affine version of Barber and Plotkin's DILL. Two semantics are constructed for ATR. The first is a pruning of the naive denotational semantics for ATR. This pruning removes certain functions that cause otherwise feasible forms of recursion to go wrong. The second semantics is a model for ATR's time complexity relative to a certain abstract machine. This model provides a setting for complexity recurrences arising from ATR recursions, the solutions of which yield second-order polynomial time bounds. The time-complexity semantics is also shown to be sound relative to the costs of interpretation on the abstract machine. The paper is available as: ftp://ftp.cis.syr.edu/users/royer/ats.pdf ftp://ftp.cis.syr.edu/users/royer/ats.ps Norman Danner and Jim Royer From mitsu at abelard.flet.keio.ac.jp Fri Aug 11 07:17:40 2006 From: mitsu at abelard.flet.keio.ac.jp (Mitsu OKADA) Date: Fri, 11 Aug 2006 20:17:40 +0900 Subject: [TYPES/announce] The 11th Annual Asian (on Secure Software), Final Call for Papers Message-ID: <44DC6754.50202@abelard.flet.keio.ac.jp> ------------------------------------------------------------------------ ASIAN 06 on Secure Software (The 11th Annual Asian Computing Science Conference, Tokyo Meeting, Dec 6-8, 2006, focusing on Secure Software) The annual ASIAN conference series chooses one focused theme every year. This year's ASIAN (Tokyo Meeting) focuses on Secure Software and related areas. We would like to remind you the Important Dates for paper submissions. Title and abstracts (100-300 words) by August 24th, 2006 Paper submission by August 31st, 2006 Notification by October 6th, 2006 The regular paper category: up to 15 pages. The short paper category: up to 7 pages. The proceedings volume will be published in the Springer LNCS series. For further information, please see http://www.nii.ac.jp/asian2006 -------------------------------------------------------------------------------- From Francois.Pottier at inria.fr Fri Aug 11 09:39:28 2006 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Fri, 11 Aug 2006 15:39:28 +0200 Subject: [TYPES/announce] The 2006 ACM SIGPLAN Workshop on ML: Call for Participation Message-ID: <20060811133928.GA7359@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 Participation * * * * http://gallium.inria.fr/ml2006/ * ********************************************************************* Programme 9:30-10:30: chaired by Andrew Kennedy Welcome Invited talk: Whole-Program Compilation for MLton Stephen Weeks 10:30-11:00 Break 11:00-12:30: chaired by Derek Dreyer ML Grid Programming with ConCert Tom Murphy VII Type-Safe Modular Hash-Consing Jean-Christophe Filli?tre and Sylvain Conchon Type-Safe Distributed Programming for OCaml John Billings, Peter Sewell, Mark Shinwell and Rok Strnisa 12:30-14:30 Lunch 14:30-16:00: chaired by Stephanie Weirich A Separate Compilation Extension to Standard ML David Swasey, Tom Murphy VII, Karl Crary and Robert Harper Leveraging .NET Meta-Programming Components in F# Don Syme Backtracking Iterators Jean-Christophe Filli?tre 16:00-16:30 Break 16:30-18:00: chaired by Matthew Fluet SEMINAL: Searching for ML Type-Error Messages Benjamin Lerner, Dan Grossman and Craig Chambers Type-Sensitive control-flow analysis John Reppy Ocsigen: Typing interaction with Objective Caml Vincent Balat 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. Proceedings will be published by ACM Press and will appear in the ACM Digital Library. 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 henglein at diku.dk Sat Aug 12 07:16:56 2006 From: henglein at diku.dk (Fritz Henglein) Date: Sat, 12 Aug 2006 13:16:56 +0200 Subject: [TYPES/announce] Reminder: 4 Ph.D. scholarships available at DIKU Message-ID: Please note that Project 3gERP (www.3gerp.org) has 4 Ph.D. scholarships in computer science available, with deadline August 21, 2006. We are looking for candidates with interest in formal methods, programming language technology, process algebras, type systems, static analysis, abstract interpretation, or similar. See http://www.3gerp.org/scholarships.pdf for the full announcement. (Note that applications can be submitted electronically.) -- Fritz Henglein, Ph.D. Professor mso Dept. of Computer Science, University of Copenhagen (DIKU) Universitetsparken 1 DK-2100 Copenhagen Denmark Email: henglein at diku.dk Tel.: +45-35321463 (office at DIKU), +45-77343435 (office at home), +45-41414158 (cell) Skype: henglein From Oege.de.Moor at comlab.ox.ac.uk Sat Aug 12 09:56:35 2006 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Sat, 12 Aug 2006 13:56:35 GMT Subject: [TYPES/announce] aosd 2007 Message-ID: <200608121356.k7CDuZmW012771@mercury.comlab.ox.ac.uk> A non-text attachment was scrubbed... Name: not available Type: text Size: 544 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060812/2093e9ee/attachment.txt From mislove at tulane.edu Sun Aug 13 03:11:40 2006 From: mislove at tulane.edu (Michael Mislove) Date: Sun, 13 Aug 2006 02:11:40 -0500 Subject: [TYPES/announce] MFPS 23 Preliminary Announcement Message-ID: As it has in the past, MFPS welcomes submissions from members of the types community. MFPS 23 Preliminary Announcement The 23rd Conference on the Mathematical Foundations of Programming Semantics (MFPS 23) will take place in New Orleans, LA USA from April 11 to April 14, 2007. The Conference will be held on the campus of Tulane University, as has been the case with previous MFPS meetings in New Orleans. This is a preliminary announcement to provide important dates for submissions to the conference. MFPS 23 will feature invited addresses by six leading researchers in programming semantics, its mathematical and logical underpinnings, and in related areas. There also will be a number of special sessions, and a Tutorial Day on April 10 will precede the meeting. Among the special sessions will be one honoring Gordon Plotkin on the occasion of his 60th birthday year for his many contributions to the area. This session will be organized by Samson Abramsky (Oxford). The MFPS 23 Program Committee will be chaired by Marcelo Fiore (Cambridge). The important dates are: Friday, December 15 - Deadline for submission of titles and short abstracts of intended submissions Friday, December 22 - Deadline for submission of full papers Friday, February 9 - Announcement of accepted papers Friday, March 2 - Deadline for submission of accepted papers in final form As was done this year, the Proceedings of the meeting will be published in final form at the time of the meeting, in hard copy and online in the ENTCS series. In addition, there will be a special journal issue composed of selected papers from the meeting, compiled after the meeting takes place. A full Call for Papers will be forthcoming around September 15, including the list of PC members, the names of the invited speakers, the full list of special sessions and their organizers, and specifics about the Tutorial Day activities. More information about the MFPS series can be found at its web site http://www.math.tulane/edu/~mfps/ mfps.html From loeh at iai.uni-bonn.de Mon Aug 14 16:58:42 2006 From: loeh at iai.uni-bonn.de (Andres Loeh) Date: Mon, 14 Aug 2006 22:58:42 +0200 Subject: [TYPES/announce] Haskell Workshop 2006 Call for participation Message-ID: <20060814205842.GM15123@iai.uni-bonn.de> Please note that the early registration deadline is Friday this week, on August 18, 2006. Cheers, Andres -------------- next part -------------- --------------------------------------------------------------------------- ACM SIGPLAN 2006 Haskell Workshop Call for Participation Portland, Oregon Sunday, September 17, 2006 --------------------------------------------------------------------------- The Haskell Workshop 2006 will be part of the 2006 International Conference on Functional Programming (ICFP). 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. Preliminary Schedule 08:25 Welcome Session I 08:30 Stephanie Weirich (University of Pennsylvania) RepLib: A Library for Derivable Type Classes 09:00 Deling Ren and Martin Erwig (Oregon State University) A Generic Recursion Toolbox for Haskell (Or: Scrap Your Boilerplate Systematically) 09:30 Alexandra Silva (CWI, The Netherlands) and Joost Visser (Universidade do Minho, Portugal) Strong Types for Relational Databases (Functional Pearl) 10:00 Break Session II 10:30 Koji Kagawa (RISE, Kagawa University) Polymorphic Variants in Haskell 11:00 Dana N. Xu (University of Cambridge) Extended Static Checking for Haskell 11:30 Philip Derrin, Kevin Elphinstone, Gerwin Klein, David Cock and Manuel M.T. Chakravarty (University of New South Wales) Running the Manual: An Approach to High-Assurance Microkernel Development 12:00 Iavor S. Diatchki (OGI) and Mark P. Jones (Portland State University) Strongly Typed Memory Areas -- Programming Systems-Level Data Structures in a Functional Language 12:30 Lunch Session III 14:00 Peter Thiemann (Universit?t Freiburg) User-Level Transactional Programming in Haskell 14:30 Simon Marlow (Microsoft Research) An Extensible Dynamically-Typed Hierarchy of Exceptions 15:00 David Himmelstrup (Denmark) Demo: Interactive Debugging with GHCi 15:15 Andy Gill (Galois Connections) Demo: Introducing the Haskell Equational Reasoning Assistant 15:30 Break Session IV 16:00 Program Chair Report 16:15 Eric Kow (LORIA) GenI: Natural Language Generation in Haskell 16:45 Frederik Eaton (University College London) Demo: Statically Typed Linear Algebra in Haskell 17:00 Isaac Jones (Galois Connections) Haskell' Status Report -- An Update on the Next Haskell Standard Session V 17:15 Discussion: The Future of Haskell Program 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 jhr at cs.uchicago.edu Tue Aug 15 01:01:49 2006 From: jhr at cs.uchicago.edu (John Reppy) Date: Tue, 15 Aug 2006 00:01:49 -0500 Subject: [TYPES/announce] Reminder: ICFP'06 registration deadline Message-ID: [update: hotel help info and deadline reminder] ------------------------------------------------------------------------ CALL FOR PARTICIPATION The 11th ACM SIGPLAN International Conference on Functional Programming (ICFP 2006) Portland, Oregon September 18-20, 2005 ------------------------------------------------------------------------ For more details, see http://icfp06.cs.uchicago.edu Preliminary Program: http://icfp06.cs.uchicago.edu/schedule.html Registration information: http://regmaster2.com/conf/icfp2006.html Hotel information: http://icfp06.cs.uchicago.edu/hotel.html ------------------------------------------------------------------------ Reminder: the deadline for early registration is Friday, August 18th. Note: if you are having difficulty with your hotel reservation, please contact Larry Skaja (larry at cteusa dot com) for help. ------------------------------------------------------------------------ From wcook at cs.utexas.edu Tue Aug 15 11:13:52 2006 From: wcook at cs.utexas.edu (William Cook) Date: Tue, 15 Aug 2006 10:13:52 -0500 Subject: [TYPES/announce] OOPSLA 2006 Call for Participation (Portland, Oct 22-26) Message-ID: <000c01c6c07d$6c099490$0501a8c0@weston> OOPSLA 2006 will be held October 22-26 in historic Portland, Oregon (USA). You can learn all about OOPSLA at www.oopsla.org, and/or download the Advance Program PDF at http://www.oopsla.org/2006//program/oopsla_06_advance_program.pdf . OOPSLA is the premier gathering of professionals from industry and academia, all sharing their experiences with today's object technologies and its offshoots. OOPSLA appeals to practitioners, researchers, students, educators, and managers, all of whom discover a wealth of information and the chance to meet others with similar interests and varied experiences and knowledge. You can mold your own OOPSLA experience, attending your choices of technical papers, practitioner reports, expert panels, demonstrations, essays, lightning talks, formal and informal educator symposia, workshops, and diverse tutorials and certificate courses from world-class experts. Our invited speakers this year include: * Dr. Brenda Laurel (Chair and graduate faculty member of the graduate Media Design Program at the Art Center College of Design in Pasadena, California) * Dr. Guy Steele (A Sun Fellow and researcher for Sun Microsystems Laboratories) * Dr. Philip Wadler (Professor of Theoretical Computer Science at the University of Edinburgh.) * Joshua Bloch (Chief Java Architect at Google) Please see http://www.oopsla.org/2006/program/sessions/invited_speakers.html for more background on our invited speakers. OOPSLA provides nearly 70 tutorials to choose from! OOPSLA gathers the world's finest educators covering the full breadth of classic and cutting-edge topics. Our presenters not only have world-class expertise, they're also successful presenters who know how to share their hard-won knowledge with you. Visit www.oopsla.org/2006/submission/tutorials/introduction_to_tutorials.html . There will also be nearly 20 workshops at OOPSLA. They're fun! These workshops are highly interactive events, where groups of technologists meet to surface, discuss, and attempt to solve challenging problems. You learn a lot when you share your ideas and experiences with others in the field, and build relationships that are an essential part of the OOPSLA experience. Check out http://www.oopsla.org/2006/submission/workshops/introduction_to_workshops.ht ml . The popular Onward! track presents out-of-the-box thinking at the frontiers of computing. Posters discuss late-breaking results, culminating in the ACM Student Research Competition. Try your hand at solving the DesignFestR design challenge. And of course there are plenty of social opportunities for mingling and professional networking. In addition to all the great offerings at OOPSLA, four other conferences are collocated this year, including: * Generative Programming and Component Engineering (GPCE'06) * Pattern Languages of Programming (PLoP'06) * Dynamic Languages Symposium You can find links to more information about these collocated conferences at OOPSLA's main page, www.oopsla.org . It's important to register soon, to reserve your place at OOPSLA 2006. Before you register, you should partially plan your week, deciding which tutorials, symposia, and collocated conferences you'd like to attend. Then you can register at https://regmaster2.com/cgi-bin/OOP06/on1/RMSs.cgi . Go to the web (www.oopsla.org) today to reserve your place at OOPSLA '06. See you in Portland! William Cook OOPSLA 2006 Program Chair From davide at disi.unige.it Wed Aug 16 17:05:55 2006 From: davide at disi.unige.it (Davide Ancona) Date: Wed, 16 Aug 2006 23:05:55 +0200 Subject: [TYPES/announce] Call for papers: OOPS at SAC 2007 (changed submission instructions) Message-ID: <44E388B3.70702@disi.unige.it> Please notice that the *submission instructions have been changed*. Best regards, Davide Ancona ------------------------------------------------------------------------ OOPS 2007 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS07 Special Track at the 22nd ACM Symposium on Applied Computing, SAC 2007 http://www.acm.org/conferences/sac/sac2007 Seoul, Korea March 11 - 15, 2007 - Important Dates September 8, 2006: Paper Submission October 16, 2006: Author Notification October 30, 2006: Camera-Ready Copy March 11--15, 2007: SAC 2007 - SAC 2007 For the past twenty-one years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2007 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Seoul National University in Seoul and The Suwon University in Gyeonggi-do. - OOPS Track Today's large scale software systems are typically designed and implemented using the concepts of the object-oriented (OO) paradigm. However, there is still a need for existing OO languages and architectures to continuously adapt in response to demands for new features and innovative approaches. These new features, to name a few, include unanticipated software evolution, security, safety, distribution, and interoperability. The basic aim of the OOPS track at SAC 2007 is to promote and stimulate further research on the object-oriented programming and distributed-object paradigms. This track will foster the development of extensions and enhancements to the prevalent OO languages, such as Java, C\# and C++, the formulation of innovative OO-based middleware approaches, and the improvements to existing and well-established distributed-object based systems. Specifically, this track will invite papers investigating the applicability of new ideas to widespread, and standard object-oriented languages and distributed-object architectures. A medium to long-term vision is also solicited, tackling general issues about the current and future role of prevalent OO languages and distributed architectures in Computer Science and Engineering. Particularly of interest for this track are those papers that provide a thorough analysis covering following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. Original papers and implementation reports are invited from all areas of OO programming languages and distributed-object computing. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Programming abstractions * Advanced type mechanisms and type safety * Multi-paradigm features * Language features in support of open systems * Aspect-oriented and Component-based programming * Reflection, meta-programming * Program structuring, modularity, generative programming * Compositional languages * Distributed Objects and Concurrency * Middleware * Heterogeneity and Interoperability * Applications of Distributed Object Computing - Submission Instructions All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Electronic submission in PDF format is required at the following page: http://sac.cs.iupui.edu/SAC2007/SubmitAbstract.aspx?TrackID=106 Please, contact Jeff Allen (jallen at cs.iupui.edu) for any problems with the conference management system. Hardcopy and fax submissions will not be accepted. The author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be in the third person. This is to facilitate a blind review process. The preferred format for the submission is the ACM SIG Proceedings Template (available through http://www.acm.org/sigs/pubs/proceed/template.html). The body of the paper should not exceed 5,000 words (5 pages according to the above style). Papers that fail to comply with length limitations risk rejection. All papers must be submitted by September 8, 2006. Submission of the same paper to multiple tracks is not allowed. - Proceedings and special issue Accepted full papers will be published by ACM in the annual conference proceedings, with the option (at additional expense) to add 3 more pages. Accepted poster papers will be published as extended 2-page abstracts in the same proceedings. Please note that full registration is required for paper and poster inclusion in the conference proceedings and CD. Student registration does not cover paper and poster inclusion in the conference proceedings, but it is only intended to encourage student attendance. Finally, as it is customary, after the conference the accepted full papers will be selected for publication on a special issue. - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, Universita` di Genova Mirko Viroli (mviroli at deis.unibo.it) DEIS, Universita` di Bologna - Program Committee > Shigeru Chiba, Tokyo Institute of Technology, Japan > Alessandro Coglio, Kestrel Institute, USA > Pascal Costanza, Vrije Universiteit Brussel, Belgium > Ferruccio Damiani, Universit? di Torino, Italy > Erik Ernst, DAIMI, Denmark > Geoffrey Fox, Indiana University, USA > Jacques Garrigue, Nagoya University, Japan > Jeffrey Gray, University of Alabama at Birmingham, USA > Tom Hirschowitz, ENS Lyon, France > Atsushi Igarashi, Kyoto University, Japan > Doug Lea, Suny Oswego, USA > Giovanni Lagorio, Universit? di Genova, Italy > Francesco Logozzo, ?cole Polytechnique, France > Hidehiko Masuhara, University of Tokyo, Japan > Tamiya Onodera, IBM Tokyo Research Laboratory, Japan > Julian Rathke, University of Sussex, UK > Giovanni Rimassa, Whitestein Technologies, Switzerland > Don Syme, Microsoft Research, UK > Tetsuo Tamai, University of Tokyo, Japan From dpw at CS.Princeton.EDU Mon Aug 21 10:21:18 2006 From: dpw at CS.Princeton.EDU (David Walker) Date: Mon, 21 Aug 2006 10:21:18 -0400 Subject: [TYPES/announce] CGO-5: Call for Papers Message-ID: <44E9C15E.4000504@cs.princeton.edu> CGO (IEEE/ACM International Symposium on Code Generation and Optimization) is explicitly trying to broaden their focus to include more work on formal methods for compiler and optimization technology. Hence, contributions from the types community are strongly encouraged. In particular, the following topics are most suitable for submission to CGO: -- typed intermediate languages, typed assembly language and proof-carrying code -- type-preserving and type-directed optimization -- semantics-preserving compilers and compiler verification -- safe, secure or provably correct run-time systems ****************************************************************** *** *** *** Fifth Annual IEEE/ACM International Symposium on *** *** CODE GENERATION and OPTIMIZATION (CGO-5) *** *** *** *** March 11-14, 2007 - San Jose, California *** *** *** *** http://www.cgo.org *** *** *** *** CALL FOR PAPERS *** *** *** *** Submission deadline: Friday Sept. 8, 2006 at 6pm EDT. *** *** *** ****************************************************************** CALL FOR PAPERS The International Symposium on Code Generation and Optimization (CGO) provides a premier venue to bring together researchers and practitioners working on feedback-directed optimization and back-end compilation techniques. The conference covers optimization for parallelism, performance, power, and security, where that optimization occurs in the mapping from an input (including APIs, high-level languages, byte codes such as .NET or Java, or ISAs) to a similar or lower-level target machine representation. Papers are solicited in areas that support such mapping and optimization: - Compilers, back-end code generators, translators, binary optimization tools and runtime environments; static, dynamic, adaptive, or continuous techniques - Innovative analysis, transformation, and optimization techniques - Profiling and feedback-directed methodologies - Memory management, including data distribution, synchronization and GC - Thread extraction and thread-level speculation, especially for multi-core systems - Vertical integration of language features, representations, optimizations, and runtime support for parallelism (including support for transactional semantics, efficient message passing, and dynamic thread creation) - Phase detection and analysis techniques - Mechanisms and optimization techniques supporting the efficient implementation of security protection models, reliability and energy efficiency - Traditional compiler optimizations - Intermediate representations that enable more powerful or efficient optimization - Hardware mechanisms and systems that implement or assist in any of the above - Experiences with real dynamic optimization and compilation systems, particularly with large, complex applications - Explorations of trade-offs concerning when (static/dynamic) and where (software/hardware) to optimize - Particularly novel ideas of interest to this community SUBMISSION DEADLINE: Friday Sept. 8, 2006 at 6pm EDT. There is an automatic extension to Sept. 15th, 2006. There will be no other extensions. Submit one electronic copy of your 6000-word paper in PDF format. Please visit the website for paper format guidelines and submission instructions. Notification of acceptance will occur by November 8th. http://www.cgo.org General Co-Chairs Program Committee ----------------- ----------------- Roy Ju, AMD Ali Adl-Tabatabai, Intel Scott Mahlke, Michigan Matthew Arnold, IBM David August, Princeton Program Co-Chairs Andy Ayers, Microsoft ----------------- David Bacon, IBM David August, Princeton Ras Bodik, Berkeley Chris J. Newburn, Intel David Chase, Sun Cliff Click, Azul Systems Local Arrangements Chair Robert Cohn, Intel ------------------------ Jeff Collard, HP Labs Margarita Outley, Intel Tom Conte, NC State Jack Davidson, Virginia Workshops/Tutorials Chair Jim Dehnert, Google ------------------------- Evelyn Duesterwald, IBM David Tarditi, Microsoft Carol Eidt, Microsoft Matthew Frank, UIUC Registration Chair Seth Goldstein, CMU ------------------ Antonio Gonzalez, Intel Nancy Warter-Perez, CSULA Rajiv Gupta, Arizona Mary Hall, USC/ISI Publicity Chair Kim Hazelwood, Virginia --------------- Maurice Herlihy, Brown Jens Knoop, TU Vienna, Austria Wei Hsu, Minnesota Richard Johnson, NVIDIA Publications Chair Teresa Johnson, HP ------------------ Jens Knoop, TU Vienna, Austria Jeff Collard, HP Labs Christos Kozyrakis, Stanford Chandra Krintz UCSB Finance Chair Olof Lindholm, BEA ------------- Toshio Nakatani, IBM Richard Johnson, NVIDIA Chris J. Newburn, Intel Diego Novillo, Red Hat Web Chair Michael Paleczny, Sun --------- Keshav Pingali, Cornell Michal Cierniak, Google Michael D. Smith, Harvard David Tarditi, Microsoft Student Advocate Olivier Temam, INRIA ---------------- David Walker, Princeton Teresa Johnson, HP Cliff Young, DE Shaw Ben Zorn, Microsoft Steering Committee ------------------ Brad Calder, UC San Diego Tom Conte, NC State Evelyn Duesterwald, IBM Wen-mei Hwu, Illinois Chris J. Newburn, Intel Michael D. Smith, Harvard Ben Zorn, Microsoft CGO is co-sponsored by IEEE Computer Society TC-uARCH and ACM SIGMICRO In cooperation with ACM SIGPLAN. From skalka at cs.uvm.edu Mon Aug 21 13:46:37 2006 From: skalka at cs.uvm.edu (Christian Skalka) Date: Mon, 21 Aug 2006 13:46:37 -0400 Subject: [TYPES/announce] Postdoctoral Research Position at University of Vermont Message-ID: <00d501c6c549$c06ed010$190ac684@Pers> ================================================== POSTDOCTORAL RESEARCH POSITION IN COMPUTER SCIENCE The University of Vermont, USA ================================================== Location: Department of Computer Science, The University of Vermont (UVM), Burlington, Vermont, USA. http://www.cs.uvm.edu http://www.uvm.edu http://www.ci.burlington.vt.us Job Description: We are seeking a qualified postdoctoral research assistant for ongoing projects in the foundations of computer security. Our current research has two main thrusts. The first is type-and-effect analysis for enforcing temporal safety properties in software as a form of programming language based security. The second is the use of formalisms and programming logics to specify and implement distributed trust management (authorization) systems for applications such as web services. More information about these projects and associated publications is available online: http://www.cs.uvm.edu/~skalka/skalka-pubs/skalka-projects.html Research will be conducted in the context of larger projects being carried out by the Distributed Systems Group: http://www.cs.uvm.edu/research/distrsys This position is funded by a grant from the Department of Defense (DoD), Air Force Office of Scientific Research (AFOSR). Duration: 1 year minimum, with possible extensions. Inquiries: Please direct questions to Christian Skalka, skalka at cs.uvm.edu. Requirements: Applicants should have or be sufficiently near completion of a PhD, and have a background (including published work) in topics relevant to the projects described above. To Apply: Position will remain open until filled. Please send cv, statement of research, and contact information for 2 reference to (email is preferable): Christian Skalka Department of Computer Science University of Vermont 33 Colchester Ave. Burlington, VT 05405 skalka at cs.uvm.edu http://www.cs.uvm.edu/~skalka ============================== Christian Skalka Assistant Professor Department of Computer Science University of Vermont http://www.cs.uvm.edu/~skalka ============================== From txa at Cs.Nott.AC.UK Wed Aug 23 09:40:27 2006 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Wed, 23 Aug 2006 14:40:27 +0100 Subject: [TYPES/announce] Final Call for papers: TYPES 06 Message-ID: We have allowed more time for the full paper, to accomodate people returning from their summer holidays. Thorsten & Conor 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 (abstract and title) 16 September 2006 (full paper) 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 Susanne.Graf at imag.fr Mon Aug 28 04:21:12 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Mon, 28 Aug 2006 10:21:12 +0200 Subject: [TYPES/announce] final CFP: MARTES with MODELS 2006 - Modeling and Analysis of Real-Time and Embedded Systems Message-ID: <44F2A778.3060008@imag.fr> ************************************************************************ * MARTES * * Workshop on Modeling and Analysis of Real-Time and Embedded Systems * * October 2, 2006 * * Genova, Italy * * http://www.martes.org * * * * Workshop held in conjunction with MoDELS/UML 2006 * * http://www.umlconference.org/ * ************************************************************************ Submission deadline: August 30, 2006 ------------------------------------- The Model Driven Architecture (MDA) initiative of the OMG puts forward the idea that future process development will be centered around models, thus keeping application development and underlying platform technology as separate as possible. The aspects influenced by the underlying platform technology concern mainly non functional aspects and communication primitives. The first significant result of the MDA paradigm for engineers is the possibility of building application models that can be conveniently ported to new, emerging technologies - implementation languages, middleware, etc.- with minimal effort and risk in one hand, but also that can be analyzed either directly or through a model transformation toward a specific formal technological space in order to validate or/and verify real-time properties such as for example schedulability. In the area of DRES (distributed, Real-time and Embedded Systems), this model-oriented trend is also very active and promising. But DRES are different from general-purpose systems. The purpose of this workshop is to serve as an opportunity to gather researchers and industrials in order to survey some existing experiments related to modeling and model-based analysis of DRES. Moreover in order to be able to exchange models with the aim to apply formal validation tools and to achieve interoperability, it is important to have also a common understanding of the semantics of the given notations. Other important issues in the domain of real-time are methodology and modeling paradigms allowing breaking down the complexity, and tools which are able to verify well designed systems. The MARTES workshop is a merge of two series of complementary workshops that were dedicated to RT/E systems and UML and which had both taken place, amongst others, as workshops associated with the UML conferences, the predecessor of MODELS: SIVOES and SVERTS. Topics: ====== - Modeling RT/E using modelling languages such as UML o How to specify real-time requirements and characteristics o How to enhance modelling languages to capture real time, embedded and distributed aspects in a convenient manner o Declarative versus operational real-time specifications o Notations for defining the architecture of heterogeneous systems o Behavior modeling o RT/E platforms modeling, integration of scheduling aspects - Semantic aspects of real-time in modelling languages o Formal semantics, in particular, semantic integration of heterogeneous systems o Interpretations of annotations o Executability of models - Methods and tools for analysis of RT systems and components o Ensure consistency of timing constraints throughout the system o Validation of time and scheduling related properties o Validation of functional properties of time dependent systems Workshop Format =============== This full-day workshop will consist of an introduction of the topic by the workshop organizers, an invited presentation (to be determined), presentations of accepted papers, and in depth discussion of previously identified subjects emerging from the submissions. A summary of the discussions will be made available. Submission and Publication ========================== To contribute, please send a position paper or a technical paper to Susanne.Graf at imag.fr and Sebastien.Gerard at cea.fr. Position papers should not exceed 5 pages, and technical papers 20 pages. Preferably, submissions should be in pdf or postscript format. Workshop proceedings will be distributed to all participants and made available through the workshop website. Like in previous years, the two best papers and a workshop overview will be published in the MoDELS 2005 Satellite Post-Proceedings (as a volume of the LNCS series). Additionally, a selection will be considered for publication in a suitable technical journal following an agreement with an interested publisher (a selection of the SVERTS 2003 papers has recently appeared as a special section of Springer's STTT journal). IMPORTANT DATES =============== Submission deadline: August 30, 2006 Notification of acceptance: September 9, 2006 Final versions due: September 29, 2006 Workshop date : October 2, 2006 Organizers ========== S?bastien G?rard - CEA-LIST, France Susanne Graf - Verimag, France ?ystein Haugen - University of Oslo, Norway Iulian Ober - (ISYCOM, U. Toulouse, France) Bran Selic - IBM, Canada Programme Committee:(to be finalised) Daniel Amyot (U. of Ottawa, Canada) Jean-Philippe Babau (INSA Lyon, France) Heiko Doerr (Daimler Chrysler, Germany) Peter Feiler (CMU, Software Institute, US) Eran Gery (I-Logix) Sebastien Gerard (CEA-LIST, France) Holger Giese (Univ. of Paderborn, Germany) Susanne Graf (Verimag, France) ?ystein Haugen (Univ. of Oslo, Norway) Jozef Hooman (Embedded Systems Institute & Univ. of Nijmegen, NL) Bengt Jonsson (Uppsala, Sweden) Iulian Ober (ISYCOM, U. Toulouse, France) Dorina Petriu (Carleton U., Canada) Alan Moore (Artisan) Bran Selic (IBM, Canada) Richard Sanders (Sintef, Norway) Thomas Weigert (Motorola, Chicago) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf at imag.fr ------------------------------------------------------------------------ From grust at in.tum.de Mon Aug 28 04:44:40 2006 From: grust at in.tum.de (Torsten Grust) Date: Mon, 28 Aug 2006 10:44:40 +0200 Subject: [TYPES/announce] PLAN-X 2007: Second Call for Papers and Demos -- Submission is Open Message-ID: <38E3280C-FA98-4366-B4FA-A0AC364DEF53@in.tum.de> Second Call for Papers and Software Demonstrations P L A N - X 2 0 0 7 Programming Language Techniques for XML An ACM SIGPLAN Workshop colocated with POPL 2007 Nice, France -- January 20, 2007 http://www.plan-x-2007.org/ [ Update: PAPER SUBMISSION IS NOW OPEN! Details below. Submission deadline: Sun, Oct 1, 2006, 5 PM (PDT) ] -- PLAN-X 2007 Aim and Scope The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming languages can embrace, for example, tree-shaped XML data structures, regular expression types extracted from schema descriptions, very small or large XML instances, queries against XML data, and XML transformations. XML reaches deep into all aspects of language design, type systems, compilers, as well as runtimes and PLAN-X 2007 is THE forum to present and discuss novel research work in this area. We invite contributions -- papers as well as software demonstrations -- from members of the programming language, database, theory, and document processing communities and look forward to a workshop in which this diversity of contributions and attendees leads to lively discussion and a fun event. If you are architecting a software system that fuses programming language and XML technology in interesting and innovative ways, please submit a software demonstration proposal to PLAN-X 2007. The workshop program will feature a special demo session. A two-page description of the accepted software demonstrations will be included in the proceedings. PLAN-X 2007 will be held in cooperation with and just after POPL 2007, the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages in the Plaza Hotel in Nice, France, on Januar 20, 2007. -- PLAN-X 2007 Topics of Interest Topics of interest include the following (though interesting and/or innovative papers on all aspects of programming languages for XML are welcome): - Design of programming and query languages for XML - Programming in the XML data model itself (e.g., extending XQuery into a full-fledged programming language) - Formal accounts of XML and its processors (based on logic, automata, variants of lambda calculus, etc.) - Compilers and interpreters for XML-aware languages and optimization techniques - Type systems, schema languages, and other constraints (e.g., keys) for tree-shaped data - Tree automata and transducers - Languages and systems that can cope with XML fragments (messages) or very large XML instances (beyond main-memory size) - Programming language glue between browsers, web services, and databases - Pioneering applications of XML-aware language technology -- Proceedings Accepted submissions will be collected to form the informal PLAN-X 2007 proceedings, to be indexed on Michael Ley's DBLP site and distributed at the workshop. The material may thus be published elsewhere at a later date. -- Paper Format and Submission The web-based paper submission site for PLAN-X 2007 is open! Submit at URL http://www.easychair.org/PLANX2007/ (Please register as a New User to obtain a login and password for the submission site.) PLAN-X 2007 calls for contributions relevant to the open list of topics sketched above. We explicitly welcome reports on innovative, off-beat, and ''early stage'' approaches as long as the submission reports on original work not published or submitted elsewhere. - Please format your papers according to the ACM guidelines and SIG proceedings templates available at http://www.acm.org/sigs/pubs/proceed/template.html The mandatory submission file format is PDF. - Regular papers should not exceed 10 pages in length including references and appendices, but shorter abstracts (of, e.g., 2000 words) often suffice and are acceptable as well. - Software demonstration proposals are limited to 2 pages and should include a sketch of the methods you employ as well as a description of what exactly will be demoed. Please submit your demonstration proposal via the regular paper submission site and add "(Demo)" to your submission's title. -- Important Dates - Paper submission: Sun, Oct 1, 2006, 5 PM (PDT) - Notification of acceptance: Thu, Nov 23, 2006 - Camera-ready copy due: Sun, Dec 17, 2006 - Workshop: Sat, Jan 20, 2007 -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Roquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders M?ller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rh?ne-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK) -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU M?nchen U Pisa Munich, Germany Pisa, Italy grust at in.tum.de ghelli at di.unipi.it From suresh at cs.purdue.edu Tue Aug 29 10:51:39 2006 From: suresh at cs.purdue.edu (Suresh Jagannathan) Date: Tue, 29 Aug 2006 10:51:39 -0400 Subject: [TYPES/announce] Doctoral and Post-Doctoral Positions at Purdue Message-ID: <0D3886A3-2508-4E28-B014-36E51BBF4705@cs.purdue.edu> [ Applications from candidates with research interests in type systems are particularly welcome.] Doctoral and Post-Doctoral Positions Available Secure Software Systems Laboratory Department of Computer Science Purdue Univeristy The Purdue University S3 Laboratory invites applications for Doctoral Student and Post-doctoral Fellow positions. The S3 Lab was created in 1999 to foster systems and programming language research. It is run jointly by Patrick Eugster, Tony Hosking, Suresh Jagannathan, and Jan Vitek. We investigate the application of static and dynamic program analyses to object-oriented, functional, and real-time programs for the purposes of optimization and validation of correctness and security properties. We also develop open source software in the areas of mobile and untrusted computation, embedded systems, concurrent and distributed systems, and persistent programming. Our active research directions include software transactions, intrusion detection, ownership types, real-time Java, aspect-oriented programming, semantics of concurrency control, and static program analysis. Our work has current funding from the National Science Foundation, DARPA, IBM, Microsoft Research, Cisco, NEC, and Intel. The lab has close ties with industrial research labs at Motorola, Sun, IBM and Intel. We have a long history of placing students at those labs. We also collaborate with researchers across the US, Europe, and Asia. Applicants are expected to take part in the research and social life of the lab, interact with students and work closely with faculty. Presently, the lab has 12 graduate students, two Post-docs, and several undergraduates. We expect to hire up to four new graduate students and two additional post-docs. For post-doctoral positions a PhD in Computer Science is required, for doctoral students research experience is desirable. Preference will be given to applicants with experience in one of the following areas: * Runtime Systems and Virtual Machines * Programming Language Implementation * Program Analysis and Formal Verification * Type Systems & Language Semantics * Real-time and Embedded Systems Applicants should send a CV, a statement of research interests, and the name of three references who may be contacted for letters of recommendation. Application material and inquiries should be sent to either one of: - Suresh Jagannathan, suresh at cs.purdue.edu - Tony Hosking, hosking at cs.purdue.edu - Jan Vitek, jv at cs.purdue.edu Purdue is an Equal Opportunity Employer. Purdue University, the largest land-grant college of Indiana, has achieved international recognition in the areas of engineering, and science. The West Lafayette campus of Purdue enrolls about 38,000 students. Purdue University is located in West Lafayette, Indiana, which lies on the banks of the Wabash River. Lafayette can be reached by car from Indianapolis in one hour and from downtown Chicago in two hours. The larger Lafayette-West Lafayette area (population 130,000) has shopping malls, restaurants of note, two hospitals, two large municipal parks, and five golf courses. The Department of Computer Science at Purdue University, West Lafayette, was formed in 1962 and is recognized as one of the top computer science programs in the country. The department offers the degrees of Bachelor of Science, Master of Science, and Ph.D. in Computer Science. Currently, we have about 750 undergraduate majors and 180 graduate students working towards degrees. From glew at cs.cornell.edu Wed Aug 30 13:06:13 2006 From: glew at cs.cornell.edu (Neal Glew) Date: Wed, 30 Aug 2006 10:06:13 -0700 Subject: [TYPES/announce] DAMP 2007: Call for Papers Message-ID: <17653.50565.228139.490584@glew1.glew.org> DAMP 2007: Workshop on Declarative Aspects of Multicore Programming Nice, France 16 January 2007 (colocated with POPL 2007) http://www.cs.cmu.edu/~damp Parallelism is going mainstream. Many chip manufactures are turning to multicore processor designs rather than scalar-oriented frequency increases as a way to get performance in their desktop, enterprise, and mobile processors. This endeavor is not likely to succeed long term if mainstream applications cannot be parallelized to take advantage of tens and eventually hundreds of hardware threads. Parallelizing programs is a difficult problem. User specification of parallelism is fraught with pitfalls such as race conditions, non-determinism in thread interactions, a lack of debugging methods, and poorly understood performance consequences. Automatic parallelization of existing imperative languages will not meet the challenge due to dependencies and aliasing. Multicore architectures will differ in significant ways from their multisocket predecessors. For example, the communication to compute bandwidth ratio is likely to be higher, which will positively impact performance. More generally, multicore architectures introduce several new dimensions of variability in both performance guarantees and architectural contracts, such as the memory model, that may not stabilize for several generations of product. Programs written in functional or logic programming languages, or even in other languages with a controlled use of side effects, can greatly simplify parallel programming. Such declarative programming allows for a deterministic semantics even when the underlying implementation might be highly non-deterministic. In addition to simplifying programming this can simplify debugging and analyzing correctness. DAMP is a one day workshop seeking to explore ideas in programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. The emphasis will be on functional and logic programming, but any programming language ideas that aim to raise the level of abstraction are welcome. DAMP seeks to gather together researchers in declarative approaches to parallel programming and to foster cross fertilization across different approaches. Specific topics include, but are not limited to: * suitability of functional and logic programming languages to multicore applications; * run-time issues such as garbage collection or thread scheduling; * architectural features that may enhance the parallel performance of declarative languages; * type systems for accurately knowing or limiting dependencies, aliasing, effects, and nonpure features; * ways of specifying or hinting at parallelism * ways of specifying or hinting at data placement which abstract away from any details of the machine; * compiler techniques; * experiences of and challenges arising from making declarative programming practical; * technology for debugging parallel programs the design and implementation of domain-specific declarative languages for multi-core; We are looking for short papers (3-5) pages. These can be in the form of a position paper, new ideas, initial results, overview of ongoing research, or even a historical perspective. Submissions are due November 3; notification of acceptance will be sent by December 1; final copies will be due January 5. Programm Chair: Professor Guy Blelloch Department of Computer Science Carnegie Mellon University blelloch at cs.cmu.edu Programme Committee: Perry Cheng, IBM T. J. Watson Research Center Gopal Gupta, University of Texas at Dallas Kevin Hammond, University of St Andrews Robert Harper, Carnegie Mellon University Surresh Jagannathan, Purdue University Charles Leiserson, Massachuetts Institute of Technology Christian Lengauer, University of Passau Simon Peyton Jones, Microsoft Research General Chair: Neal Glew Intel Corporation Santa Clara, CA, USA neal.glew at intel.com From l2lu at oakland.edu Fri Sep 1 15:22:51 2006 From: l2lu at oakland.edu (Lunjin Lu) Date: Fri, 1 Sep 2006 15:22:51 -0400 Subject: [TYPES/announce] ACM SAC track on Software Verification, Seoul, Korea Message-ID: <200609011924.CJS90546@oakland.edu> (Apology if you receive multiple copies) ACM 2007 Symposium on Applied Computing, March 11-15, 2007, Seoul, Korea http://www.acm.org/conferences/sac/sac2007 Technical Track on Software Verification http://www.cs.wmich.edu/~zijiang/sac2007 1. SAC 2007 For the past twenty-one years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2007 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Seoul National University in Seoul and The Suwon University in Gyeonggi-do. 2. Technical track on software verification In the next decade the software industry will have to face its responsibility imposed by a computer-dependent society. Since software is increasing deployed in safety critical applications, correctness and reliability are becoming issues of utmost importance. Consequently, software verification will be a grand challenge for both academic world and computer industry. The track will focus on theoretical foundations, practical methods as well as case studies for verification of conventional and embedded software. We welcome papers that describe work on combinations of formal verification and program analysis techniques. Tool papers and case studies which report on advances in verifying large software systems are particularly sought. The list of topics includes but not limited to o Tools, and case studies for large scale software verification o Static analysis/Abstract interpretation for verification o Model checking and deductive techniques for software verification o Role of declarative programming languages (such as Prolog) for infinite state software verification. o Proof techniques for verifying specific classes of software (such as object-oriented programs) o Integration of testing and run-time monitoring with formal techniques o Validation of UML diagrams, and/or requirement specifications o Software certification and proof carrying code o Integration of formal verification into software development projects 3. Guidelines for paper submission Each paper must not exceed 4,000 words and should not be more than 15 pages long using 11 point font and 1 inch margins on all four sides on letter size paper. Papers that fail to comply with length limitations risk rejection. Each submitted paper will be fully referenced and undergo a blind review process. Author(s) must not be identified in the submissions, either explicitly or by implication. Before submitting paper, author(s) should submit a separate cover page that includes title, abstract, list of keywords, and list of authors with full names and postal addresses, telephone numbers, fax numbers, and e-mail addresses. One of the authors must be designated as the primary contact person. Please upload the cover page via conference website. A confirmation email with further instructions on paper submission will be sent to the contact author. Please contact track chairs for any problems with submission. Authors of accepted papers must submit an editorial revision of their papers that must fit within five two-column pages following the ACM proceedings format (an extra three extra pages may be available at additional cost to the authors). At least one of the authors of an accepted paper must register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2006 proceedings. 4. Program Committee Chandrasekhar Boyapati, University of Michigan, USA Samir Genaim, Universidad Politecnica de Madrid, Spain Francesco Loggozzo, Ecole Polytechnique, France Lunjin Lu (Track Co-Chair), Oakland Univ. ,USA Iman Poernomo, King's College of London, UK Eric Poll, Radboud Universiteit Nijmegen, The Netherlands Jan-Georg Smaus, Albert-Ludwigs-Universitaet Freiburg, Germany Fausto Spoto (Track Co-Chair), Universit?? di Verona, Italy Chao Wang, NEC Laboratories America, Inc, USA Ping Yang, Binghamton University, USA Zijiang Yang(Track Co-Chair), Western Michigan Univ., USA Tian Zhao, University of Wisconsin-Milwaukee , USA 5. Important dates Electronic submission of full papers: September 8, 2006 Notification of paper acceptance: October 16, 2006 Camera-ready copy of accepted paper due: October 30, 2006 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060901/fa765975/attachment.htm From yoshida at doc.ic.ac.uk Mon Sep 4 05:56:40 2006 From: yoshida at doc.ic.ac.uk (Nobuko Yoshida) Date: Mon, 04 Sep 2006 10:56:40 +0100 Subject: [TYPES/announce] Logical Reasoning for Higher-Order Functions with Local State Message-ID: <44FBF858.5030805@doc.ic.ac.uk> The following paper on Hoare Logic for imperative higher-order functions with local state is available. http://www.doc.ic.ac.uk/~yoshida/paper/middle2007.pdf Logical Reasoning for Higher-Order Functions with Local State by Nobuko Yoshida, Kohei Honda and Martin Berger We shall be grateful for any comments from you. Nobuko Yoshida (yoshida at doc.ic.ac.uk) Kohei Honda (kohei at dcs.qmul.ac.uk) Martin Berger (mberger at doc.ic.ac.uk) ---------------------------------------------------------- Abstract We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-like local reference generation. Local references may be generated dynamically and exported outside their scope, may store higher-order functions, and may be used to construct complex mutable data structures. This primitive is fully captured in the logic using a predicate which asserts reachability of a reference name from a possibly higher-order datum and quantifiers over hidden references. The logic enjoys a strong match with the semantics of programs, in the sense that valid assertions characterise the standard contextual congruence. We explore the logic's descriptive and reasoning power with non-trivial programming examples combining higher-order procedures and dynamically generated local state. Axioms for reachability and local invariant play a central role for reasoning about the examples. Our previous related papers can be also found from http://www.doc.ic.ac.uk/~yoshida/local/reference.html From maribel.fernandez at kcl.ac.uk Tue Sep 5 06:59:52 2006 From: maribel.fernandez at kcl.ac.uk (Maribel Fernandez) Date: Tue, 05 Sep 2006 11:59:52 +0100 Subject: [TYPES/announce] 3rd Int Workshop on the Rewriting Calculus --- London, 23-24 October In-Reply-To: <4447BE22.8040101@dcs.kcl.ac.uk> References: <4447BE22.8040101@dcs.kcl.ac.uk> Message-ID: <44FD58A8.10502@kcl.ac.uk> CALL FOR ABSTRACTS AND PARTICIPATION 3rd Int. Workshop on the Rewriting Calculus 23-24 October 2006 King's College London, UK http://rho.loria.fr The rewriting calculus has been introduced as a general means to uniformly integrate rewriting and lambda calculus. Matching (possibly modulo given theories), abstraction, application and substitutions are all first-class components of this calculus. The rewriting calculus is designed and used for logical and semantical purposes. It can be used with powerful type systems and for expressing the semantics of rule-based as well as object-oriented paradigms. It allows one to naturally express exceptions and imperative features as well as expressing elaborated rewriting strategies. The purpose of this workshop is to bring together researchers working on rewriting calculus and related topics, and to provide a forum for presenting new ideas and work in progress. It will be an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. The previous editions of the workshop were held in Nancy (2004) and Paris (2005) (see http://rho.loria.fr). This edition will take place in conjunction with the 3rd London Theoretical Computer Science Seminar (http://www.dcs.qmul.ac.uk/~ohearn/LondonTheory/). The topics of the workshop include, but are not limited to, the following aspects of the rewriting calculus: - types - operational semantics - models - implementation issues - applications - relationship with other rewriting formalisms (lambda-calculus, higher-order rewriting, combination of lambda-calculus and rewriting,etc) The abstracts describing research on the above mentioned area must be in pdf (or standard postscript) format, up to two pages long and should be sent by e-mail to workshop-rho at loria.fr. Informal proceedings will be available at the workshop. The deadline for submission of abstracts is 1st October 2006 Workshop chairs: ------------------- Claude Kirchner (INRIA and Loria) Luigi Liquori (INRIA Sophia-Antipolis) Workshop organiser: ------------------------------ Maribel Fernandez (King's College London) There is no registration fee, but please register by sending an email to workshop-rho at loria.fr before 15 October 2006. Important dates: ------------------------- Deadline for submissions: 1st October 2006 Notification of acceptance: 8 October 2006 Deadline for registration: 15 October 2006 Workshop: 23-24 October 2006 London Theoretical Computer Science Seminar: 25 October 2006 =============================================== From luca at ru.is Mon Sep 4 07:12:52 2006 From: luca at ru.is (Luca Aceto) Date: Mon, 4 Sep 2006 11:12:52 -0000 Subject: [TYPES/announce] Last Call for Contributions: Nordic Workshop on Programming Theory 2006 (Reykjavik, Iceland, 18-20 October, 2006) References: <07D05A69A3D0C14FAEA60C3ACE8E556409DC0B65@nike.hir.is> <07D05A69A3D0C14FAEA60C3ACE8E556409DC0B83@nike.hir.is> <07D05A69A3D0C14FAEA60C3ACE8E55640AD44E32@nike.hir.is> <07D05A69A3D0C14FAEA60C3ACE8E55640BDDF2D0@nike.hir.is> <07D05A69A3D0C14FAEA60C3ACE8E55640BDDF3F1@nike.hir.is> Message-ID: <07D05A69A3D0C14FAEA60C3ACE8E55640BDDF4B7@nike.hir.is> ***** This is the last call for contributions to the NWPT 2006 ** ***** We apologize for multiple postings ****************** The 18th Nordic Workshop on Programming Theory (NWPT'06) Reykjavik, Iceland, 18-20 October, 2006 http://www.ru.is/NWPT06/ The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries (but also elsewhere). The previous workshops were held in Uppsala (1989, 1999 and 2004), Aalborg (1990), Gothenburg (1991 and 1995), Bergen (1992 and 2000), Turku (1993, 1998, and 2003), Aarhus (1994), Oslo (1996), Tallinn (1997 and 2002), Lyngby (2001), and Copenhagen (2005). This time the workshop will visit Iceland for the first time, and will be held in Reykjav?k. SCOPE Typical topics of the workshop include (but are not limited to): * Semantics of programs * Programming logics * Program verification * Formal specification of programs * Program synthesis * Program transformation and program refinement * Real-Time and hybrid systems * Modeling of concurrency * Programming methods * Tools for program construction and verification INVITED SPEAKERS Gerd Behrmann, Aalborg University Matthew Hennessy, University of Sussex Hanne Riis Nielson, DTU David Sands, Chalmers University of Technology and University of G?teborg SUBMISSIONS Authors wishing to give a talk at the workshop are requested to submit an abstract of 1-3 pages (ps or pdf, printable on A4 paper) to nwpt06(at)ru(dot)is by the 19th September 2006. Submission of work submitted for formal publication elsewhere and work in progress is permitted. The abstracts of the accepted contributions will be available at the workshop. After the workshop, selected papers will be published in a special issue of Nordic Journal of Computing (awaiting confirmation). IMPORTANT DATES 19 September: Submission of abstracts 30 September: Registration OPENS (tentative) 5 October: Notification of acceptance 12 October: Registration CLOSES (tentative) 18-20 October: WORKSHOP (begins Wednesday morning/lunch, ends Friday lunch) Since the dates for the workshop coincide with the Iceland Airwaves music festival, we recommend that you book your travel and accommodation well in advance. PROGRAMME COMMITTEE * Luca Aceto, Reykjav?k Univ., Iceland, and Aalborg Univ., Denmark (co-chair) * Michael R. Hansen, Techn. U. of Denmark, Denmark * Anna Ing?lfsd?ttir, Reykjav?k Univ., Iceland, and Aalborg Univ., Denmark (co-chair) * Hannu-Matti Jarvinen, Tampere Univ. of Tech., Finland * Neil D. Jones, Univ. of Copenhagen, Denmark * Kim G. Larsen, Aalborg Univ., Denmark * Bengt Nordstr?m, Univ. of Gothenburg, Chalmers Univ. of Tech., Sweden * Olaf Owe, University of Oslo, Norway * Tarmo Uustalu, Inst. of Cybernetics, Estonia * J?ri Vain, Tallinn Technical University, Estonia * Marina Wald?n, ?bo Akademi University, Finland * Uwe E. Wolter, Univ. of Bergen, Norway * Wang Yi, Uppsala Univ., Sweden ORGANIZING COMMITTEE Luca Aceto, Anna Ing?lfsd?ttir, S?lr?n Sm?rad?ttir,.... EMAIL: nwpt06(at)ru(dot)is More (and more current) information is available at http://www.ru.is/NWPT06/ A short history of the workshop is available at http://www.cc.ioc.ee/nwpt02/history.html Vinsamlega athugi? a? uppl?singar ? t?lvup?sti ?essum og vi?hengi eru eing?ngu ?tla?ar ?eim sem p?stinum er beint til og g?tu innihaldi? uppl?singar sem eru tr?na?arm?l. Sj? n?nar: http://www.ru.is/trunadur Please note that this e-mail and attachments are intended for the named addresses only and may contain information that is confidential and privileged. Further information: http://www.ru.is/trunadur From eijiro.sumii at gmail.com Mon Sep 4 02:40:19 2006 From: eijiro.sumii at gmail.com (Eijiro Sumii) Date: Mon, 4 Sep 2006 15:40:19 +0900 Subject: [TYPES/announce] Call for Posters, APLAS 2006 (in Sydney, in November) In-Reply-To: References: Message-ID: The deadline of abstracts for APALS 2006 poster presentation is approaching. http://www.kb.ecei.tohoku.ac.jp/aplas2006/ http://www.kb.ecei.tohoku.ac.jp/aplas2006/call-for-posters.txt Our web server is now alive. (It was down because of power outage when this announcement was distributed last time. We are sorry if you experienced any inconvenience.) Eijiro Sumii APLAS 2006 Poster Chair > CALL FOR POSTER PRESENTATIONS > > The Fourth ASIAN Symposium on Programming Languages and Systems > (APLAS 2006) > > November 8-10, 2006 > University of New South Wales, Sydney, Australia > > Deadline for Abstracts: September 11, 2006 > > APLAS 2006 will include a poster session during the conference. The > session aims to give students and researchers an opportunity to > present their research to the community, and to get responses from > other researchers. > > SCOPE: > > Poster presentations are sought in all areas of programming languages > and systems, including (but not limited to): > > - 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 > > FORMAT: > > A space of A1 paper size (594 mm wide and 841 mm high) will be > provided for each presentation. If you need more space, contact the > poster chair (sumii AT ecei DOT tohoku DOT ac DOT jp). Links that may > be useful for preparing good posters include: > > - http://www.kumc.edu/SAH/OTEd/jradel/Poster_Presentations/PstrStart.html > - http://www.siam.org/siamnews/general/poster.htm > > REGISTRATION: > > Each presenter should e-mail a 1-2 page abstract in PDF or PostScript > to the poster chair (sumii AT ecei DOT tohoku DOT ac DOT jp) by > September 11th, 2006. The program of the poster session will be > announced by September 22nd, 2006. We hope to accommodate every > poster, but may restrict presentations (based on relevance and > interest to the community) for the limitation of space. We may also > need to cancel the session if there are too few presentations. > > IMPORTANT DATES: > > - 1-2 page abstract submission deadline September 11, 2006 > - notification September 22, 2006 > - conference November 8-10, 2006 > > CONTACT: > > For questions or requests, please contact the APLAS 2006 poster chair, > Eijiro Sumii (sumii AT ecei DOT tohoku DOT ac DOT jp). From carbonem at doc.ic.ac.uk Mon Sep 4 10:01:25 2006 From: carbonem at doc.ic.ac.uk (Marco Carbone) Date: Mon, 04 Sep 2006 15:01:25 +0100 Subject: [TYPES/announce] Paper on Structured Global Programming Message-ID: <44FC31B5.5030605@doc.ic.ac.uk> Dear All, we are pleased to announce the paper: "Structured Global Programming for Communication Behaviour" by M. Carbone, K. Honda and N. Yoshida This work is intended to offer one of the central formal underpinnings of W3C's web service choreography description language, WS-CDL. The development of the theory has benefited greatly from the dialogue between the invited scientists of W3C WS-CDL Working Group and WG's members. The type theory of the pi-calculus plays an important role in this work. You can find the paper at http://www.dcs.qmul.ac.uk/~carbonem/cdlpaper/SGPCBmiddle.pdf A longer version containing the detailed proofs and more examples will also be published as W3C working note together with R. Milner, G. Brown and S. Ross-Talbot. The document is available at http://www.dcs.qmul.ac.uk/~carbonem/cdlpaper/workingnote.pdf Best Regards, Marco, Kohei and Nobuko - Abstract This paper presents two different paradigms of description of communication behaviour, one focusing on global message flows and another on end-point behaviours, as formal calculi based on session types. The global calculus originates from Choreography Description Language, a web service description language developed by W3C WS-CDL working group. The end-point calculus is a typed pi-calculus. The global calculus describes an interaction scenario from a vantage viewpoint; the endpoint calculus precisely identifies a local behaviour of each participant. After introducing the static and dynamic semantics of these two calculi, we explore a theory of endpoint projection which defines three principles for well-structured global description. The theory then defines a translation under the three principles which is sound and complete in the sense that all and only behaviours specified in the global description are realised as communications among end-point processes. Throughout the theory, underlying type structures play a fundamental role. From martini at cs.unibo.it Tue Sep 5 11:42:36 2006 From: martini at cs.unibo.it (Simone Martini) Date: Tue, 5 Sep 2006 17:42:36 +0200 Subject: [TYPES/announce] Ackermann Award - Call for nominations Message-ID: <35FFF5A4-BFDA-415D-BE16-68B477F63FF0@cs.unibo.it> Ackermann Award 2007 Nominations are sollicted for the Ackermann Award 2007. The EACSL Outstanding Dissertation Award for Logic in Computer Science (The Ackermann Award) will be presented to the recipients at the annual conference of the EACSL (CSL'07). The jury is entitled to give more than one award per year. The first Ackermann Award was presented at CSL'05. The 2005 recipients were Mikolaj Bojanczyk Konstantin Korovin Nathan Segerlind The 2006 recipients were Stefan Milius Balder ten Cate A detailed report, citations and short bibliographies may be found in the proceedings of CSL'05 and of CSL'06, or at http://www.dimi.uniud.it/~eacsl/ http://www.cs.technion.ac.il/eacsl Eligible for the 2007 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.2005 and 31.12.2006. --------------------------------------- The deadline for submission is 31.1.2007. --------------------------------------- Submission details are available at www.dimi.uniud.it/~eacsl/award.html www.cs.technion.ac.il/eacsl 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. 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, S. Abramnsky (Oxford); * B. Courcelle (Bordeaux); * E. Graedel (Aachen); * M. Hyland (Cambridge); * A. Razborov (Moscow and Princeton). From dezani at di.unito.it Tue Sep 5 13:57:48 2006 From: dezani at di.unito.it (Mariangiola Dezani) Date: Tue, 5 Sep 2006 19:57:48 +0200 Subject: [TYPES/announce] PhD Positions at Torino University In-Reply-To: <43BC32C8.40109@cis.upenn.edu> References: <43BC32C8.40109@cis.upenn.edu> Message-ID: <3F5BB70D-D3D8-4243-88F8-5DA178115743@di.unito.it> Applications are solicited, candidates can find information at: http://www.cisi.unito.it/dottorato/bando_cicloXXII.htm @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Mariangiola Dezani-Ciancaglini Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : dezani at di.unito.it phone: 39-011-6706732 fax : 39-011-751603 mobile: 39-320-4359903 (preferred) 39-348-2251592 http://www.di.unito.it/~dezani ********************************************************************** Unless unavoidable, no Word, Excel or PowerPoint attachments, please. See http://www.gnu.org/philosophy/no-word-attachments.html ********************************************************************** "L'ITALIA RIPUDIA LA GUERRA come strumento di offesa alla libert? degli altri popoli e come mezzo di risoluzione delle controversie internazionali." (Art. 11 della Costituzione della Repubblica Italiana) From matthes at informatik.uni-muenchen.de Tue Sep 5 13:24:38 2006 From: matthes at informatik.uni-muenchen.de (Ralph Matthes) Date: Tue, 05 Sep 2006 19:24:38 +0200 Subject: [TYPES/announce] CFP MSCS special issue Isomorphisms of Types and Invertibility of Lambda-Terms Message-ID: <44FDB2D6.1030300@informatik.uni-muenchen.de> Mathematical Structures in Computer Science Special Issue on Isomorphisms of Types and Invertibility of Lambda-Terms Guest Editors: Ralph Matthes and Sergei Soloviev, Toulouse Call for contributions The study of invertibility of lambda-terms and related subjects such as isomorphisms of types, retractions and subtyping takes an important place in type theory. It is related to number theory, algebra and category theory, and it has applications to information retrieval systems, automatic code generation, data transformation, coding and cryptography. This special issue is a continuation of the series opened by the special issue of MSCS on Isomorphisms of Types published in 2005 (vol. 15, no. 5, Oct. 2005). Partly it is intended as a post-proceedings of WIT2005, a "Types" workshop at IRIT, Toulouse http://www.irit.fr/zeno/WIT2005/, but the contributions are subject to normal refereeing procedure and not limited to the papers presented by the participants of that workshop. Deadlines Deadline for submissions: 6 December 2006 Author's notification: 4 April 2007 Special issue's publication: Winter 2007/Spring 2008 Submissions The submissions should be sent in PDF or Postscript to the guest editors via email: {matthes, soloviev}@irit.fr. Extended versions of work previously published in conference proceedings are eligible for submission but authors should make it clear how their submission improves upon the conference publication; in those cases where Cambridge University Press is not the publisher of the original conference proceedings, authors should take care to avoid infringing that publisher's copyright. Authors who wish to discuss potential submissions are encouraged to contact the guest editors. The Mathematical Structures in Computer Science journal's policy is to impose restrictions in advance neither on the number of papers nor their length. However, as the special issue will contain approximately 180 pages, it is anticipated that it will contain a mixture of papers of between 15 and 45 pages. From Oege.de.Moor at comlab.ox.ac.uk Thu Sep 7 05:07:27 2006 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Thu, 7 Sep 2006 09:07:27 GMT Subject: [TYPES/announce] AOSD 2007: final call Message-ID: <200609070907.k8797RWR012556@mercury.comlab.ox.ac.uk> A non-text attachment was scrubbed... Name: not available Type: text Size: 873 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060907/9e59a071/attachment.txt From l2lu at oakland.edu Thu Sep 7 13:41:05 2006 From: l2lu at oakland.edu (Lunjin Lu) Date: Thu, 7 Sep 2006 13:41:05 -0400 Subject: [TYPES/announce] ACM SAC track on Software Verification -- deadline extension Message-ID: <200609071742.CJY02064@oakland.edu> ACM 2007 Symposium on Applied Computing, March 11-15, 2007, Seoul, Korea http://www.acm.org/conferences/sac/sac2007 Technical Track on Software Verification http://www.cs.wmich.edu/~zijiang/sac2007 1. SAC 2007 For the past twenty-one years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2007 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Seoul National University in Seoul and The Suwon University in Gyeonggi-do. 2. Technical track on software verification In the next decade the software industry will have to face its responsibility imposed by a computer-dependent society. Since software is increasing deployed in safety critical applications, correctness and reliability are becoming issues of utmost importance. Consequently, software verification will be a grand challenge for both academic world and computer industry. The track will focus on theoretical foundations, practical methods as well as case studies for verification of conventional and embedded software. We welcome papers that describe work on combinations of formal verification and program analysis techniques. Tool papers and case studies which report on advances in verifying large software systems are particularly sought. The list of topics includes but not limited to o Tools, and case studies for large scale software verification o Static analysis/Abstract interpretation for verification o Model checking and deductive techniques for software verification o Role of declarative programming languages (such as Prolog) for infinite state software verification. o Proof techniques for verifying specific classes of software (such as object-oriented programs) o Integration of testing and run-time monitoring with formal techniques o Validation of UML diagrams, and/or requirement specifications o Software certification and proof carrying code o Integration of formal verification into software development projects 3. Guidelines for paper submission Each paper must not exceed 4,000 words and should not be more than 15 pages long using 11 point font and 1 inch margins on all four sides on letter size paper. Papers that fail to comply with length limitations risk rejection. Each submitted paper will be fully referenced and undergo a blind review process. Author(s) must not be identified in the submissions, either explicitly or by implication. Before submitting paper, author(s) should submit a separate cover page that includes title, abstract, list of keywords, and list of authors with full names and postal addresses, telephone numbers, fax numbers, and e-mail addresses. One of the authors must be designated as the primary contact person. Please upload the cover page via conference website. A confirmation email with further instructions on paper submission will be sent to the contact author. Please contact track chairs for any problems with submission. Authors of accepted papers must submit an editorial revision of their papers that must fit within five two-column pages following the ACM proceedings format (an extra three extra pages may be available at additional cost to the authors). At least one of the authors of an accepted paper must register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2006 proceedings. 4. Program Committee Chandrasekhar Boyapati, University of Michigan, USA Samir Genaim, Universidad Politecnica de Madrid, Spain Francesco Loggozzo, Ecole Polytechnique, France Lunjin Lu (Track Co-Chair), Oakland Univ. ,USA Iman Poernomo, King's College of London, UK Eric Poll, Radboud Universiteit Nijmegen, The Netherlands Jan-Georg Smaus, Albert-Ludwigs-Universitaet Freiburg, Germany Fausto Spoto (Track Co-Chair), Universit?? di Verona, Italy Chao Wang, NEC Laboratories America, Inc, USA Ping Yang, Binghamton University, USA Zijiang Yang(Track Co-Chair), Western Michigan Univ., USA Tian Zhao, University of Wisconsin-Milwaukee , USA 5. Important dates Electronic submission of full papers: September 13, 2006 Notification of paper acceptance: October 18, 2006 Camera-ready copy of accepted paper due: October 30, 2006 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060907/6c959bd5/attachment.htm From carlos.martin at urv.cat Wed Sep 6 17:47:17 2006 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Wed, 06 Sep 2006 21:47:17 GMT Subject: [TYPES/announce] postdoctoral positions 2006-4 Message-ID: Apologies for multiple posting! Please, forward the announcement to whoever may be interested in it. Thanks. ---------------------- 2 postdoctoral positions may be available in the Research Group on Mathematical Linguistics at Rovira i Virgili University (Tarragona, Spain) under a scheme funded by the Regional Government of Catalonia. The web site of the host institute is: http://www.grlmc.com ELIGIBLE TOPICS (in decreasing order of priority) - Language and automata theory and its applications. - Biomolecular computing and nanotechnology. - Language and speech technologies. - Bioinformatics. - 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 junior scientists with a high potential and leadership willing to develop an academic career in the framework of the host institute for 2 years, starting in 2007. - They will be filled in under the form of a work contract. - Besides research, some doctoral teaching and supervising are expected too, as well as a strong involvement in the institute?s activities. - The candidate?s PhD degree must have been awarded not earlier than 2001. - Only candidates with a substantial publication record will be considered. ECONOMIC CONDITIONS - Annual salary amounting 23,900 euros before taxes. - Full Social Security rights, including health assistance. EVALUATION PROCEDURE It will consist of 2 steps: - a pre-selection based on CV and carried out by the host institute, - the application by the host institute on behalf of the pre-selected candidates. SCHEDULE Expressions of interest are welcome until September 15, 2006. They should contain the candidate's CV as an attachment and mention "2006-4" in the subject line. The outcome of the pre-selection will be reported immediately after. Pre-selected candidates should be ready to collaborate with the host institute in completing the application process by October 5, 2006. The final results will be publicized not earlier than December 2006. CONTACT Carlos Martin-Vide carlos.martin at urv.cat From carlos.martin at urv.cat Wed Sep 6 17:49:22 2006 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Wed, 06 Sep 2006 21:49:22 GMT Subject: [TYPES/announce] 6th International PhD School in Formal Languages andApplications Message-ID: Apologies for multiple posting! Please, forward the announcement to whoever may be interested in it. Thanks. ------------------ 6th INTERNATIONAL PhD SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS 2006-2008 Rovira i Virgili University Research Group on Mathematical Linguistics Tarragona, Spain http://www.grlmc.com Awarded with the Mark of Quality (Menci?n de Calidad) by the Spanish Ministry for Education and Science, MCD2003-00820 With the support of Xerox Corporation Courses and professors 1st term (March?July 2007) Languages - Alexander Okhotin (Turku) Combinatorics on Words - Tero Harju (Turku) Regular Grammars - Masami Ito (Kyoto) Context-Free Grammars - Manfred Kudlek (Hamburg) Context-Sensitive Grammars - Victor Mitrana (Tarragona) Mildly Context-Sensitive Grammars - Henning Bordihn (Potsdam) Finite Automata - Sheng Yu (London ON) Pushdown Automata - Hendrik Jan Hoogeboom (Leiden) Turing Machines - Holger Petersen (Stuttgart) Varieties of Formal Languages - Jean-?ric Pin (Paris) Semigroups for the Working Theoretical Computer Scientist - Stuart Margolis (Ramat Gan) Computational Complexity - Markus Holzer (Munich) Descriptional Complexity of Automata and Grammars - Detlef Wotschke (Frankfurt) Communication Complexity - Carsten Damm (G?ttingen) Patterns - Kai Salomaa (Kingston ON) Infinite Words - Juhani Karhum?ki (Turku) Partial Words - Francine Blanchet-Sadri (Greensboro NC) Two-Dimensional Languages - Kenichi Morita (Hiroshima) Grammars with Regulated Rewriting - J?rgen Dassow (Magdeburg) Contextual Grammars - Carlos Mart?n-Vide (Tarragona) Parallel Grammars - Henning Fernau (Trier) Grammar Systems - Erzs?bet Csuhaj-Varj? (Budapest) Automata Networks - P?l D?m?si (Debrecen) Tree Automata and Tree Languages - Magnus Steinby (Turku) Tree Adjoining Grammars - James Rogers (Richmond IN) Term Rewriting Systems - Nachum Dershowitz (Tel Aviv) Automata and Logic - Franz Baader (Dresden) Formal Languages and Concurrent Systems - Jetty Kleijn (Leiden) Petri Net Theory and Its Applications - Hsu-Chun Yen (Taipei) Graph Grammars and Graph Transformation - Hans-J?rg Kreowski (Bremen) Restarting Automata - Friedrich Otto (Kassel) Courses and professors 2nd term (September?December 2007) Parameterized Complexity - J?rg Flum (Freiburg, Germany) Modern Complexity Theory - Mitsunori Ogihara (Rochester NY) Fuzzy Formal Languages - Claudio Moraga (Dortmund) Cellular Automata - Martin Kutrib (Giessen) DNA Computing: Theory and Experiments - Natasha Jonoska (Tampa FL) Splicing Systems - Paola Bonizzoni (Milan) Aqueous Computing - Tom Head (Binghamton NY) Biomolecular Nanotechnology - Max Garzon (Memphis TN) Quantum Automata - Jozef Gruska (Brno) Symbolic Dynamics and Automata - Christiane Frougny (Paris) Unification Grammars - Shuly Wintner (Haifa) Context-Free Grammar Parsing - Giorgio Satta (Padua) Probabilistic Parsing - Mark-Jan Nederhof (Groningen) Categorial Grammars - Michael Moortgat (Utrecht) Grammatical Inference - Colin de la Higuera (Saint-?tienne) Mathematical Foundations of Learning Theory - Satoshi Kobayashi (Tokyo) Natural Language Processing with Symbolic Neural Networks - Risto Miikkulainen (Austin TX) Weighted Automata - Manfred Droste (Leipzig) An Introduction to the Theory of Finite Transducers - Jacques Sakarovitch (Paris) Sequential Pattern Matching - Thierry Lecroq (Rouen) Indexing and Query Evaluation for Text Retrieval - Justin Zobel (Melbourne) Combinatorial Algorithms in Bioinformatics and Computational Biology - Raffaele Giancarlo (Palermo) Mathematical Evolutionary Genomics - David Sankoff (Ottawa ON) Cryptography - Valtteri Niemi (Nokia, Helsinki) String Complexity - Lucian Ilie (London ON) Data Compression - Wojciech Rytter (Warsaw) Image Compression - Jarkko Kari (Turku) Algebraic Techniques in Language Theory - Zolt?n ?sik (Tarragona) Topics in Asynchronous Circuit Theory - John Brzozowski (Waterloo ON) Automata for Verification - Moshe Vardi (Houston TX) STUDENTS Candidate students for the programme are welcome from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Logic or Engineering) could be accepted provided they have a good undergraduate background in discrete mathematics. At the beginning of the first term, a few lessons on discrete mathematics advanced pre-requisites will be offered, in order to homogenize the students? mathematical background. In order to check eligibility for the programme, the student must be certain that the highest university degree s/he got enables her/him to be enrolled in a doctoral programme in her/his home country. TUITION FEES 2,120 euros in total, approximately. DISSERTATION After following the courses, the students enrolled in the programme will have to defend a research project and, later, a dissertation in English in their own area of interest, in order to get the so-called European PhD degree (which is a standard PhD degree with an additional mark of quality). All the professors in the programme will be allowed to supervise students? dissertations, as well as any other well-reputed scientist at the discretion of the host institute. FUNDING The university will cover the tuition fees and full-board accommodation expenses of all admitted students during the first term. For the second one, funding opportunities will be provided, among others, by the Spanish Ministry for Education and Science, the Spanish Ministry for Foreign Affairs and Cooperation (Becas MAEC-AECI), and the European Commission (Alban scheme for Latin American citizens). Immediately after the courses and during the writing of the PhD dissertation, some of the best students will be offered 4-year research fellowships, which will allow them to work in the framework of the host institute. PRE-REGISTRATION PROCEDURE In order to pre-register, one should post (not fax, not e-mail) to the programme chairman: - a xerocopy of the main page of the passport, - a xerocopy of the university education diplomas, - a xerocopy of the academic transcripts, - full CV, - letters of recommendation (optional), - any other document to prove background, interest and motivation (optional). SCHEDULE Announcement of the programme: August 8, 2006 Pre-registration deadline: October 15, 2006 Selection of students: October 22, 2006 Starting of the 1st term: March 5, 2007 End of the 1st term: July 27, 2007 Starting of the 2nd term (tentative): September 3, 2007 End of the 2nd term (tentative): December 21, 2007 Defense of the research project (tentative): September 13, 2008 DEA examination (tentative): May 16, 2009 QUESTIONS AND FURTHER INFORMATION Contact the programme chairman, Carlos Mart?n-Vide, at carlos.martin at urv.cat POSTAL ADDRESS Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial T?rraco, 1 43005 Tarragona, Spain Phone: +34-977-559543, +34-977-554391 Fax: +34-977-559597, +34-977-554391 From cortesi at unive.it Fri Sep 8 06:44:51 2006 From: cortesi at unive.it (Agostino Cortesi) Date: Fri, 8 Sep 2006 12:44:51 +0200 (CEST) Subject: [TYPES/announce] PhD studentships in Venice Message-ID: The Department of Computer Science of Ca' Foscari University of Venice (Italy) is recruiting PhD students for a 3 year Doctoral Program in Computer Science starting in 2007. The best four admitted PhD students will be supported with a 3-year grant. Two of the four grants will be funded to conduct research on specific subjects. In particular the first research subject is "Static analysis and its applications to problems of security in computer systems" and the second one is "Decision support systems based on interoperable data sources". Applicants should have an MSc degree (or equivalent), be proficient in English, and interested in an R&D career. A complete description of the application process can be found in http://www.unive.it/media/dipInformatica/phd/bando_en_2006/Call_for_PhD_2007.pdf Forms and documents concerning this application must be sent by October 30, 2006. For all enquires regarding the present call, please send e-mail to phd at dsi.unive.it. =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- 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 vs at ecs.soton.ac.uk Fri Sep 8 06:47:05 2006 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Fri, 8 Sep 2006 11:47:05 +0100 Subject: [TYPES/announce] Research fellowship -- job announcement Message-ID: <3CE05969-854B-416D-B2B8-758164ECC1A8@ecs.soton.ac.uk> [-- The skills required for this job are common among the readers of TYPES. I expect this advert may meet the interest of some. Thanks. --] Research Fellow - Ubiquitous and Distributed Computing Salary: ?24,161-- ?29,716 Duration: 33 months Start date: October 2006 Closing date for applications: 22/09/2006 Applications are invited for a Research Fellow in the School of Electronics and Computer Science at the University of Southampton (www.ecs.soton.ac.uk). The School is the largest of its kind in the UK and it was awarded the top grade (5*) for its research in Electronics and Computer Science in the 2001 national assessment of research in UK universities. You will undertake research in the area of Foundations of Ubiquitous and Distributed Computing directed to develop models, languages, techniques and tools underpinning the design and engineering of new middleware for market trading in pervasive computing. This work would take place within the context of the EPSRC-funded project UTIFORO under the supervision of Prof Vladimiro Sassone, in partnership with groups at UCL and King's College London, and the University of Sussex. You should possess a PhD in computer science or three years equivalent relevant experience with a particular focus in at least one of foundations of ubiquitous and distributed computing, game theory, process calculi, trust and security, computational logics. Informal enquires may be directed to Prof V. Sassone . More information and online application at From Susanne.Graf at imag.fr Sun Sep 10 13:32:39 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Sun, 10 Sep 2006 19:32:39 +0200 Subject: [TYPES/announce] TACAS 2007: Call for papers (submission deadline: October 13) Message-ID: <45044C37.6050100@imag.fr> CALL FOR PAPERS: TACAS 2007 Thirteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems www.doc.ic.ac.uk/tacas07/ Part of ETAPS 2007, March 24 - April 1, 2007, Braga, Portugal IMPORTANT DATES * 6 Oct 2006: Submission deadline (strict) for abstracts of research and tool demonstration papers * 13 Oct 2006: Submission deadline (strict) for full versions of research and tool demonstration papers * 8 Dec 2006: Notification of acceptance * 5 Jan 2007: Camera-ready versions due CONFERENCE DESCRIPTION TACAS is a forum for researchers, developers and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference serves to bridge the gaps between different communities that share common interests in, and techniques for, tool development and its algorithmic foundations. The research areas covered by such communities include but are not limited to formal methods, software and hardware verification, static analysis, programming languages, software engineering, real-time systems, communications protocols, and biological systems. The TACAS forum provides a venue for such communities at which common problems, heuristics, algorithms, data structures and methodologies can be discussed and explored. In doing so, TACAS aims to support researchers in their quest to improve the utility, reliability, flexibility and efficiency of tools and algorithms for building systems. Tool descriptions and case studies with a conceptual message, as well as theoretical papers with clear relevance for tool construction are all encouraged. The specific topics covered by the conference include, but are not limited to, the following: * Specification and verification techniques for finite and infinite-state systems * Software and hardware verification * Theorem-proving and model-checking * System construction and transformation techniques * Static and run-time analysis * Abstraction techniques for modeling and validation * Compositional and refinement-based methodologies * Testing and test-case generation * Analytical techniques for secure, real-time, hybrid, critical, biological or dependable systems * Integration of formal methods and static analysis in high-level hardware design or software environments * Tool environments and tool architectures * SAT solvers * Applications and case studies As TACAS addresses a heterogeneous audience, potential authors are strongly encouraged to write about their ideas and findings in general and jargon- independent, rather than in application- and domain-specific, terms. Authors reporting on tools or case studies are strongly encouraged to indicate how their experimental results can be reproduced and confirmed independently. PROGRAMME COMMITTEE Christel Baier (U. Bonn, Germany) Armin Biere (Johannes Kepler U., Austria) Jonathan Billington (University of South Australia, Australia) Ed Brinksma (ESI and U. of Twente, The Netherlands) Rance Cleaveland (U. of Maryland & Fraunhofer USA Inc, USA) Byron Cook (tool chair) (Microsoft Research, Cambridge, UK) Dennis Dams (Bell Labs, Lucent Technologies, Murray Hill, USA) Marsha Chechik (U. Toronto, Canada) Francois Fages (INRIA Rocquencourt, France) Kathi Fisler (Worcester Polytechnic, USA) Limor Fix (Intel Research Laboratory, Pittsburgh, USA) Hubert Garavel (INRIA Rhones-Alpes, France) Susanne Graf (VERIMAG, Grenoble, France) Orna Grumberg (co-chair) (TECHNION, Israel Institute of Technology, Israel) John Hatcliff (Kansas State U., USA) Holger Hermanns (U. des Saarlandes, Germany) Michael Huth (co-chair) (Imperial College London, UK) Daniel Jackson (Massachusetts Institute of Technology, USA) Somesh Jha (U. of Wisconsin at Madison, USA) Orna Kupferman (Hebrew U., Jerusalem, Israel) Marta Kwiatkowska (U. of Birmingham, UK) Kim Larsen (Aalborg U., Denmark) Michael Leuschel (Heinrich-Heine U., Duesseldorf, Germany) Andreas Podelski (Max-Planck-Institut fuer Informatik, Saarbruecken, Germany) Tiziana Margaria-Steffen (U. Goettingen, Germany) Tom Melham (Oxford U., UK) CR Ramakrishnan (SUNY Stony Brook, USA) Jakob Rehof (Fraunhofer ISST, Germany) Natarajan Shankar (SRI, Menlo Park, USA) Bernhard Steffen (U. Dortmund, Germany) Lenore Zuck (U. of Illinois, USA). INVITED SPEAKER K. Rustan M. Leino (Microsoft Research, USA) SUBMISSION GUIDELINES Papers should be submitted using the TACAS 2007 Conference Service. As with other ETAPS conferences, TACAS accepts two types of contributions: * research papers and * tool demonstration papers. Both types of contributions will appear in the proceedings and have oral presentations during the conference. Research papers: Research papers cover one or more of the topics above, including tool development and case studies from a perspective of scientific research. Research papers are evaluated by the TACAS Program Committee. Submitted research papers must: * be in English and have a maximum of 15 pages (including figures and bibliography) * present original research which is unpublished and not submitted elsewhere (conferences or journals) -- in particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden * use the Springer-LNCS style * be submitted electronically in Postscript or PDF form via the TACAS 2007 Conference Service (abstract no later than 6 October, 2006, and full paper no later than 13 October, 2006) Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Program Committee Co-Chairs Orna Grumberg (www.cs.technion.ac.il/users/orna/) or Michael Huth (www.doc.ic.ac.uk/~mrh/) prior to submitting. Tool demonstration papers: Tool demonstration papers present tools based on aforementioned technologies (e.g., theorem-proving, model-checking, static analysis, or other formal methods) or fall into the above application areas (e.g., system construction and transformation, testing, analysis of real-time, hybrid or biological systems, etc.). Tool demonstration papers are evaluated by the TACAS Tool Chair, Byron Cook (http://research.microsoft.com/users/bycook/default.htm) with the help of the Programme Committee. Submitted tool demonstration papers must: * be in English and have a maximum of 4 pages * have an appendix (not included in the 4 page count) that provides a detailed description of: - how the oral presentation will be conducted, e.g. illustrated by a number of snapshots - the availability of the tool, the number and types of users, other information which may illustrate the maturity and robustness of the tool - if applicable, a link to a web-page for the tool (The appendix will not be included in the proceedings, but during the evaluation of the tool demonstration papers it will be equally important as the pages submitted for publication in the proceedings.) * use the Springer-Verlag LNCS style * clearly describe the enhancements and novel features of the tool in case that one of its previous versions has already been presented at meetings or published in some form * be submitted electronically in Postscript or PDF form via the TACAS 2007 Conference Service (abstract no later than 6 October, 2006, and full paper no later than 13 October, 2006) Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Tool Chair Byron Cook. From verma at in.tum.de Mon Sep 11 08:58:03 2006 From: verma at in.tum.de (Kumar Neeraj Verma) Date: Mon, 11 Sep 2006 14:58:03 +0200 Subject: [TYPES/announce] Call For Papers: FoSSaCS 2007 Message-ID: <45055D5B.7090909@in.tum.de> CALL FOR PAPERS: FoSSaCS 2007 Tenth International Conference on Foundations of Software Science and Computation Structures http://www2.in.tum.de/~seidl/fossacs07/ Part of ETAPS 2007, March 24 - April 1, 2007, Braga, Portugal IMPORTANT DATES * 6 Oct 2006: Submission of abstracts (strict deadline) * 13 Oct 2006: Submission of full versions (strict deadline) * 8 Dec 2006: Notification of acceptance * 5 Jan 2007: Camera-ready versions due CONFERENCE DESCRIPTION FOSSACS seeks original papers on foundational research with a clear significance for software science. The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems. The specific topics covered by the conference include, but are not limited to, the following: * Algebraic models, * Automata and language theory, * Behavioural equivalences, * Categorical models, * Computation processes over discrete and continuous data, * Infinite state systems, * Computation structures, * Logics of programs, * Modal, spatial, and temporal logics, * Models of concurrent, reactive, distributed, and mobile systems, * Process algebras and calculi, * Semantics of programming languages, * Software specification and refinement, * Type systems and type theory. * Fundamentals of security * Semi-structured data * Program correctness and verification As FoSSaCS addresses a heterogeneous audience, potential authors are strongly encouraged to write about their ideas and findings in general and jargon-independent, rather than in application- and domain-specific, terms. ROGRAMME COMMITTEE * Martin Abadi, University of California at Santa Cruz and Microsoft Research * Michael Benedikt, Bell Laboratories * Ahmed Bouajjani, Universit? Paris 7 * Cristiano Calcagno, Imperial College London * Didier Caucal, IRISA-CNRS, Rennes * Flavio Corradini, University of Camerino * Robert van Glabbeek, Stanford University * Andrew D. Gordon, Microsoft Research, Cambridge * Hendrik Jan Hoogeboom, Leiden University * Anna Ingolfsdottir, Aalborg University * Florent Jacquemard, LSV, ENS de Cachan * Werner Kuich, TU Wien * Kamal Lodaya, Institute of Mathematical Sciences, Chennai * Antoine Min?, ENS Rue d'Ulm, Paris * Damian Niwinski, Warsaw University * David A. Schmidt, University of Kansas * Stefan Schwoon, Universit?t Stuttgart * Helmut Seidl, TU M?nchen (chair) * Scott A. Smolka, State University of New York at Stony Brook * P.S. Thiagarajan, National University of Singapore * Sophie Tison, Universit? des Sciences et Technologies de Lille * Heiko Vogler, TU Dresden * Christoph Weidenbach, Max-Planck-Institut f?r Informatik, Saarbr?cken INVITED SPEAKER Radha Jagadeesan, DePaul University (USA) SUBMISSION GUIDELINES Papers should be submitted using the FoSSaCS 2007 Conference Service at: http://sttt.cs.uni-dortmund.de/fossacs07/servlet/Conference Papers cover one or more of the topics above and are evaluated by the FoSSaCS Program Committee. Submitted papers must: * be in English and have a maximum of 15 pages (including figures and bibliography) * present original research which is unpublished and not submitted elsewhere (conferences or journals) -- in particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden * use the Springer-LNCS style * be submitted electronically in Postscript or PDF form via the FoSSaCS 2007 Conference Service (abstract no later than 6 October, 2006, and full paper no later than 13 October, 2006) Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Program Committee Chair ( http://www2.in.tum.de/~seidl ) prior to submitting. SPECIAL ISSUE If the quality of the accepted submissions warrants it, there will be a special issue of the electronic Journal Logical Methods in Computer Science devoted to selected papers from the conference. From ruy at cin.ufpe.br Tue Sep 12 22:15:00 2006 From: ruy at cin.ufpe.br (Ruy de Queiroz) Date: Tue, 12 Sep 2006 23:15:00 -0300 (BRT) Subject: [TYPES/announce] WoLLIC'2007 - Call for Papers Message-ID: <20060912231432.B36721@buique.cin.ufpe.br> [please post] [** sincere apologies for duplicates **] Call for Papers 14th Workshop on Logic, Language, Information and Computation (WoLLIC'2007) Rio de Janeiro, Brazil July 2-5, 2007 WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The Fourteenth WoLLIC will be held in Rio de Janeiro, Brazil, from July 2 to July 5, 2007, and sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computacao (SBC), and the Sociedade Brasileira de Logica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at www.cin.ufpe.br/~wollic/wollic2007/instructions.html A title and single-paragraph abstract should be submitted by February 23, and the full paper by March 2 (firm date). Notifications are expected by April 13, and final papers for the proceedings will be due by April 27 (firm date). PROCEEDINGS Proceedings, including both invited and contributed papers, will be published in advance of the meeting. Publication venue TBA. INVITED SPEAKERS: TBA STUDENT GRANTS ASL sponsorship of WoLLIC'2007 will permit ASL student members to apply for a modest travel grant (deadline: April 1, 2007). See www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES February 23, 2007: Paper title and abstract deadline March 2, 2007: Full paper deadline (firm) April 12, 2007: Author notification April 26, 2007: Final version deadline (firm) PROGRAM COMMITTEE Samson Abramsky (U Oxford) Michael Benedikt (Bell Labs) Lars Birkedal (ITU Copenhagen) Andreas Blass (U Michigan) Thierry Coquand (Chalmers U, Goteborg) Jan van Eijck (CWI, Amsterdam) Marcelo Finger (U Sao Paulo) Rob Goldblatt (Victoria U, Wellington) Yuri Gurevich (Microsoft Redmond) Hermann Haeusler (PUC Rio) Masami Hagiya (Tokyo U) Joseph Halpern (Cornell U) John Harrison (Intel UK) Wilfrid Hodges (U London/QM) Phokion Kolaitis (IBM San Jose) Marta Kwiatkowska (U Birmingham) Daniel Leivant (Indiana U) (Chair) Maurizio Lenzerini (U Rome) Jean-Yves Marion (LORIA Nancy) Dale Miller (Polytechnique Paris) John Mitchell (Stanford U) Lawrence Moss (Indiana U) Peter O'Hearn (U London/QM) Prakash Panangaden (McGill, Montreal) Christine Paulin-Mohring (Paris-Sud, Orsay) Alexander Razborov (Moscow U) Helmut Schwichtenberg (Munich U) Jouko Vaananen (U Helsinki) ORGANISING COMMITTEE Marcelo da Silva Correa (U Fed Fluminense) Renata P. de Freitas (U Fed Fluminense) Ana Teresa Martins (U Fed Ceara') Anjolina de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco, co-chair) Petrucio Viana (U Fed Fluminense, co-chair) WEB PAGE www.cin.ufpe.br/~wollic/wollic2007 From james.cheney at gmail.com Wed Sep 13 08:50:20 2006 From: james.cheney at gmail.com (James Cheney) Date: Wed, 13 Sep 2006 13:50:20 +0100 Subject: [TYPES/announce] Paper: Nominal logic programming Message-ID: <814253dd0609130550t2eb6ec6fo94a3119d1ab3e4df@mail.gmail.com> I am happy to announce on behalf of Christian Urban as well as myself the availability of a paper on nominal logic programming. Although the technical content of the paper concerns defining and relating various semantics for such programs, applications including implementing core type systems, operational semantics, and language translations are also discussed. It is available at http://arxiv.org/abs/cs.PL/0609062 Comments are very welcome. --James -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060913/c0999970/attachment.htm From necula at eecs.berkeley.edu Fri Sep 15 11:04:16 2006 From: necula at eecs.berkeley.edu (George Necula) Date: Fri, 15 Sep 2006 08:04:16 -0700 Subject: [TYPES/announce] Types in Language Design and Implementation 2007 - Call for Papers Message-ID: Read the html version of this CFP at http://www.cs.berkeley.edu/~necula/tldi07/cfp.html The ACM SIGPLAN Workshop on Types in Language Design and Implementation Affiliated with ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), 2007. Scope The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In light of this expanding role of types, the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) follows five previous International Workshops on types in compilation and language design(TIC'97, TIC'98, TIC'00, and TLDI'03 and TLDI'05), with the hope of bringing together researchers to share new ideas and results in this area. Submissions for this event are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI'07 specifically encourages papers from a broad field of programming language and compiler researchers, including those working in object-oriented, dynamically-typed, late-binding, systems programming, and mobile-code paradigms, as well as traditional fully-static type systems. Topics of interest include: Typed intermediate languages and type-directed compilation Type-based language support for safety and security Types for interoperability Type systems for system programming languages Type-based program analysis, transformation, and optimization Dependent types and type-based proof assistants Types for security protocols, concurrency, and distributed computing Type inference and type reconstruction Type based specifications of data structures and program invariants Type-based memory management Proof-carrying code and certifying compilation This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. We solicit submissions on original research not published or submitted for publication elsewhere. Technical summaries, in English and not to exceed 10 pages ACM format, should be submitted via the Web submission form by Sunday, October 1, 2006 5PM Pacific Daylight Savings Time. See what this means in your time zone. Web submission form: https://www.softconf.com/starts/tldi07/ Adobe Portable Document Format (PDF) is strongly preferred for all submissions. Authors should be sure to use full font inclusion to ensure portability. All papers must be formatted for US Letter (8.5"x11") paper. Postscript (PS) format submissions will also be accepted, provided that they preview and print properly using Ghostscript with standard fonts. Important Dates Please note: Due to the short time from submission to publication of the proceedings, the submission deadlines given below are firm. Sunday, October 1, 2006, 5PM PDT Deadline for submission of papers Friday, Nov 10, 2006 Notification of acceptance Friday, Nov 23, 2006 Camera-ready copy due Tuesday, Jan 16, 2007 TLDI'07 in Nice, France Jan 17-19, 2007 POPL'07 in Nice, France Program Chair George Necula University of California 783 Soda Hall Berkeley, CA 94720 Email: necula @ cs.berkeley.edu Tel.: +1-510-643-1481 Fax: +1-510-642-3962 Program Committee Damien Doligez, INRIA Peter Lee, Carnegie Mellon University Andrew Kennedy, Microsoft Research, Cambridge Naoki Kobayashi, Tohoku University George Necula (chair)ty of California, Berkeley Randy Pollack, Edinburgh University Norman Ramsey, Harvard University David Tarditi, Microsoft Research, Redmond Stephanie Weirich, University of Pennsylvania Hongwei Xi, Boston University General Chair Francois Pottier, NRIA Rocquencourt From pasalic at cs.rice.edu Mon Sep 18 11:28:29 2006 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Mon, 18 Sep 2006 10:28:29 -0500 Subject: [TYPES/announce] GPCE'06 Tutorials: Call for Participation Message-ID: <518DBCF8-2993-4861-9911-E9DEE777C56F@cs.rice.edu> GPCE'06 Call for Tutorial Participation October 22-26, 2006 Portland, Oregon (co-located with OOPSLA'06) http://www.gpce.org/06/ GPCE Tutorial Program GPCE tutorial registrations should be made before October 1st, 2006. For registration details, please see below. Tutorial G1 (GPCE): Model Driven Development Basics using Eclipse Bruce Trask, MDE Systems and Angel Roman, MDE Systems Date: Sunday, Oct 22, from 08:30 to 12:00 Tutorial G2 (GPCE): Building Domain Specific Languages with Eclipse and openArchitectureWare Markus Voelter, Independent Consultant and Arno Haase, Independent Software Architect Date: Sunday, Oct 22, from 13:30 to 17:00 Tutorial G3 (GPCE): Using Feature Models for Product Derivation Danilo Beuche, pure-systems GmbH Olaf Spinczyk, University Erlangen-Nuremberg Date: Monday, Oct 23, from 08:30 to 12:00 Tutorial G4 (GPCE): Building Java Transformations with Stratego/XT Martin Bravenboer, Utrecht University Karl Trygve Kalleberg, University of Bergen Eelco Visser, Utrecht University Date: Monday, Oct 23, from 13:30 to 17:00 Tutorial G5 (GPCE): Engineering Software Factories for Developing Enterprise Applications Using Model-Driven Techniques Vinay Kulkarni, Tata Research Development and Design Centre Sreedhar Reddy, Tata Research Development and Design Centre Date: Tuesday, Oct 24, from 13:30 to 17:00 Tutorial G6 (GPCE): Feature Modularity in Software Product Lines Don Batory, University of Texas at Austin Date: Tuesday, Oct 24, from 13:30 to 17:00 Tutorial G7 (GPCE): Generative Software Development Krzysztof Czarnecki, University of Waterloo Date: Wednesday, Oct 25, from 13:30 to 17:00 Direct access to GPCE confernce and tutorial registration: http://www.oopsla.org/2006/registration.html Direct access to GPCE tutorial summary page: http://www.hope.cs.rice.edu/twiki/bin/view/GPCE06/GpceTutorials GPCE Conference page http://www.gpce.org/06/ From urzy at mimuw.edu.pl Mon Sep 18 11:44:25 2006 From: urzy at mimuw.edu.pl (Pawel Urzyczyn) Date: Mon, 18 Sep 2006 17:44:25 +0200 Subject: [TYPES/announce] New book: Lectures on the Curry-Howard Isomorphism Message-ID: <200609181544.k8IFiP613564@absurd.mimuw.edu.pl> ======================= LECTURES ON THE CURRY-HOWARD ISOMORPHISM Studies in Logic and the Foundations of Mathematics, 149 by Morten Heine Sørensen, Pawel Urzyczyn ISBN: 0-444-52077-5, 456 pages This is an entirely rewritten book version of the DIKU lecture notes published online in 1998. The book gives an intruduction to various topics related to the formulas-as-types analogy, in particular: - Type-free and simply-typed lambda-calculus - Intuitionistic logic - Combinatory logic - Classical logic and control operators - Sequent calculus - Dialogue games - Intuitionistic arithmetic and Godel's system T - Second-order logic and polymorphism - Dependent types and pure type systems. The book contains a large number of exercises, many of these accompanied with extensive hints and solutions. ======================== From grust at in.tum.de Wed Sep 20 04:35:32 2006 From: grust at in.tum.de (Torsten Grust) Date: Wed, 20 Sep 2006 10:35:32 +0200 Subject: [TYPES/announce] PLAN-X 2007: Call for Papers and Demos (Deadline Extended) Message-ID: <17F5337B-0456-4AFB-A29C-7F89A92A9CE2@in.tum.de> Third Call for Papers and Software Demonstrations P L A N - X 2 0 0 7 Programming Language Techniques for XML An ACM SIGPLAN Workshop colocated with POPL 2007 Nice, France -- January 20, 2007 http://www.plan-x-2007.org/ || The submission deadline for PLAN-X 2007 has been || || postponed by a few days. New submission deadline: || || Tuesday, October 10, 2006, 5 PM (PDT) || -- PLAN-X 2007 Aim and Scope The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming languages can embrace, for example, tree-shaped XML data structures, regular expression types extracted from schema descriptions, very small or large XML instances, queries against XML data, and XML transformations. XML reaches deep into all aspects of language design, type systems, compilers, as well as runtimes and PLAN-X 2007 is THE forum to present and discuss novel research work in this area. We invite contributions -- papers as well as software demonstrations -- from members of the programming language, database, theory, and document processing communities and look forward to a workshop in which this diversity of contributions and attendees leads to lively discussion and a fun event. If you are architecting a software system that fuses programming language and XML technology in interesting and innovative ways, please submit a software demonstration proposal to PLAN-X 2007. The workshop program will feature a special demo session. A two-page description of the accepted software demonstrations will be included in the proceedings. PLAN-X 2007 will be held in cooperation with and just after POPL 2007, the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages in the Plaza Hotel in Nice, France, on Januar 20, 2007. -- PLAN-X 2007 Topics of Interest Topics of interest include the following (though interesting and/or innovative papers on all aspects of programming languages for XML are welcome): - Design of programming and query languages for XML - Programming in the XML data model itself (e.g., extending XQuery into a full-fledged programming language) - Formal accounts of XML and its processors (based on logic, automata, variants of lambda calculus, etc.) - Compilers and interpreters for XML-aware languages and optimization techniques - Type systems, schema languages, and other constraints (e.g., keys) for tree-shaped data - Tree automata and transducers - Languages and systems that can cope with XML fragments (messages) or very large XML instances (beyond main-memory size) - Programming language glue between browsers, web services, and databases - Pioneering applications of XML-aware language technology -- Proceedings Accepted submissions will be collected to form the informal PLAN-X 2007 proceedings, to be indexed on Michael Ley's DBLP site and distributed at the workshop. The material may thus be published elsewhere at a later date. -- Paper Format and Submission The web-based paper submission site for PLAN-X 2007 is open! Submit at URL http://www.easychair.org/PLANX2007/ (Please register as a New User to obtain a login and password for the submission site.) PLAN-X 2007 calls for contributions relevant to the open list of topics sketched above. We explicitly welcome reports on innovative, off-beat, and ''early stage'' approaches as long as the submission reports on original work not published or submitted elsewhere. - Please format your papers according to the ACM guidelines and SIG proceedings templates available at http://www.acm.org/sigs/pubs/proceed/template.html The mandatory submission file format is PDF. - Regular papers should not exceed 10 pages in length including references and appendices, but shorter abstracts (of, e.g., 2000 words) often suffice and are acceptable as well. - Software demonstration proposals are limited to 2 pages and should include a sketch of the methods you employ as well as a description of what exactly will be demoed. Please submit your demonstration proposal via the regular paper submission site and add "(Demo)" to your submission's title. -- Important Dates - Paper submission (extended): Tue, Oct 10, 2006, 5 PM (PDT) - Notification of acceptance: Sat, Nov 25, 2006 - Camera-ready copy due: Sun, Dec 17, 2006 - Workshop: Sat, Jan 20, 2007 -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Roquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders M?ller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rh?ne-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK) -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU M?nchen U Pisa Munich, Germany Pisa, Italy grust at in.tum.de ghelli at di.unipi.it From Marcelo.Fiore at cl.cam.ac.uk Fri Sep 22 17:04:56 2006 From: Marcelo.Fiore at cl.cam.ac.uk (Marcelo Fiore) Date: Fri, 22 Sep 2006 22:04:56 +0100 (BST) Subject: [TYPES/announce] MFPS XXIII --- Call for Papers Message-ID: CALL FOR PAPERS MFPS XXIII Twenty-third Conference on the Mathematical Foundations of Programming Semantics Tulane University New Orleans, LA USA April 11 - 14, 2007 Partially Supported by US Office of Naval Research The Twenty-third Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIII) will take place on the campus of Tulane University, New Orleans, LA USA from Wednesday, April 11 through Saturday, April 14, 2007. The MFPS conferences are devoted to those areas of mathematics, logic, and computer science which are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighboring areas. The INVITED SPEAKERS for MFPS XXIII are Gerard Berry (Esterel Technologies) --- to be confirmed --- Stephen Brookes (CMU) Jane Hillston (Edinburgh) John Mitchell (Stanford) Gordon Plotkin (Edinburgh) John Power (Edinburgh) In addition, there will be three special sessions: 1. A special session honoring GORDON PLOTKIN on his 60th birthday year, organised by Samson Abramsky (Oxford). 2. A special session on SECURITY, organised by Catherine Meadows (NRL). 3. A special session on SYSTEMS BIOLOGY, organised by Jane Hillston (Edinburgh) and Prakash Panangaden (McGill). 4. A Special Session on Physics, Information and Computation organized by Keye Martin (NRL). Further, there will be a TUTORIAL DAY on April 11. The topic will be Domain Theory; the speakers will be announced at a later date. This event will be free to those who are interested in attending. The remainder of the program will consist of papers selected by the following PROGRAM COMMITTEE Samson Abramsky (Oxford) Michael Mislove (Tulane) Andrej Bauer (Ljubljana) John Mitchell (Stanford) Stephen Brookes (CMU) Eugenio Moggi (Genova) Pierre-Louis Curien (CNRS & Paris 7) Laurent Regnier (Marseille) Andrzej Filinski (Copenhagen) Giuseppe Rosolini (Genova) Marcelo Fiore (Cambridge), CHAIR Davide Sangiorgi (Bologna) Masahito Hasegawa (Kyoto) Philip Scott (Ottawa) Achim Jung (Birmingham) Daniele Varacca (Paris 7) Ursula Martin (QM London) James Worrell (Oxford) Catherine Meadows (NRL) Steve Zdancewic (Pennsylvania) from submissions received in response to this call for papers. TOPICS include, but are not limited to, the following: biocomputation; categorical models; concurrent and distributed computation; constructive mathematics; domain theory; formal languages; formal methods; game semantics; lambda calculus; logic; non-classical computation; probabilistic systems; process calculi; program analysis; programming language theory; quantum computation; rewriting theory; security; specifications; topological models; type systems; type theory. The CONFERENCE PROCEEDINGS will be published by ENTCS (Electronic Notes in Theoretical Computer Science ). Submission instructions, style files for preparing a submission, and a link to the MFPS XXIII submission site are available from the conference web page: http://www.math.tulane.edu/~mfps/mfps23.htm IMPORTANT DATES: * Fri Dec 15: Paper registration deadline, with short abstracts. * Fri Dec 22: Paper submission deadline. * Fri Feb 4: Author notification. * Fri Mar 2: Final versions for the proceedings. The Organising Committee for MFPS consists of Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane), and Prakash Panangaden (McGill). The local arrangements for MFPS XXIII are being overseen by Michael Mislove. From koba at kb.ecei.tohoku.ac.jp Sun Sep 24 21:25:35 2006 From: koba at kb.ecei.tohoku.ac.jp (koba@kb.ecei.tohoku.ac.jp) Date: Mon, 25 Sep 2006 10:25:35 +0900 (JST) Subject: [TYPES/announce] APLAS 2006 Call for Particiaption Message-ID: <20060925.102535.26224183.koba@kb.ecei.tohoku.ac.jp> Apologies for multiple copies. --------------------- Call for Participation 4th Asian Symposium on Programming Languages and Systems November 8-10, 2006 Sydney, Australia http://www.cse.unsw.edu.au/~aplas06/ http://www.kb.ecei.tohoku.ac.jp/aplas2006/ Scope of the Conference ----------------------- 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). Conference Registration ----------------------- Registration information for APLAS 2006 is now available at http://www.cse.unsw.edu.au/~aplas06/registration.html Conference Location ------------------- APLAS'06 will be on the campus of the University of New South Wales in Sydney, Australia. The City of Sydney is with over 4 million population the largest city of Australia, and with its many attractions, it is one of the main cultural centres of Australia. Conference Program ------------------ 8 Nov (Wed) ------------ 915- 930 Opening note 930-1030 Invited talk #1 Type Processing by Constraint Reasoning Peter Stucky 1100-1230 Session 1 Principal Type Inference for GHC-Style Multi-Parameter Type Classes Martin Sulzmann, Tom Schrijvers and Peter J Stuckey Private row types: abstracting the unnamed Jacques Garrigue Type and Effect System for Multi-Staged Exceptions Hyunjun Eo, Ik-Soon Kim and Kwangkeun Yi 1400-1530 Session 2 Relational Reasoning for Recursive Types and References Nina Bohr and Lars Birkedal Proof Abstraction for Imperative Languages William L. Harrison Reading, Writing and Relations Nick Benton, Andrew Kennedy, Martin Hofmann and Lennart Beringer 1600-1700 Session 3 A Fine-Grained Join Point Model for More Reusable Aspects Yusuke Endoh, Hidehiko Masuhara and Akinori Yonezawa Automatic Testing of Higher Order Functions Pieter Koopman and Rinus Plasmeijer 9 Nov (Thu) ------------ 930-1030 Invited talk #2 Event Driven Software Quality Jens Palsberg 1110-1230 Session 4 Widening Polyhedra with Landmarks Axel Simon and Andy King Comparing completeness properties of static analyses and their logics David Schmidt Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis Tobias Gedell, Jorgen Gustavsson and Josef Svenningsson 1400-1530 Session 5 A Modal Language for the Safety of Mobile Values Sungwoo Park An Analysis for Proving Temporal Properties of Biological Systems Roberta Gori and Francesca Levi Computational Secrecy by Typing for the Pi Calculus Martin Abadi, Ricardo Corin and Cedric Fournet 1545-1715 Poster session 10 Nov (Fri) ------------ 930-1030 Invited tutorial Scheme with Classes, Mixins, and Traits Matthew Flatt 1100-1230 Session 6 Using Metadata Transformations to Integrate Class Extensions in an Existing Class Hierarchy Markus Lumpe Combining Offline and Online Optimizations: Register Allocation and Method Inlining Hiroshi Yamauchi and Jan Vitek A Localized Tracing Scheme for Garbage Collection Yannis Chicha and Stephen M. Watt 1400-1530 Session 7 A Pushdown Machine for Recursive XML Processing Keisuke Nakano and Shin-Cheng Mu XML Validation for Context-Free Grammars Yasuhiko Minamide and Akihiko Tozawa A Practical String Analyzer by the Widening Approach Tae-Hyoung Choi, Hyun-Ha Kim, Oukseh Lee and Kyung-Goo Doh 1600-1700 Session 8 A bytecode logic for JML and Types Lennart Beringer and Martin Hofmann On Jones-Optimal Specializers: A Case Study Using Unmix Johan Gade and Robert Glueck 1700-1715 Closing note Organization ------------- 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) From Daniel.Hirschkoff at ens-lyon.fr Tue Sep 26 06:21:19 2006 From: Daniel.Hirschkoff at ens-lyon.fr (Daniel.Hirschkoff@ens-lyon.fr) Date: Tue, 26 Sep 2006 11:21:19 +0100 Subject: [TYPES/announce] Position preannouncement at ENS Lyon Message-ID: <17688.65311.193452.190094@gargle.gargle.HOWL> POSITION PRE-ANNOUNCEMENT A position of Professor is likely to be opened next year at Ecole Normale Superieure de Lyon. The hired candidate will work in the LIP laboratory (Laboratoire d'Informatique du Parallelisme). The LIP hosts a research team, called Plume (see http://www.ens-lyon.fr/LIP/PLUME/index.html.en), working on the theory of programming languages, on proof theory, and on proof assistants -- hence this announcement to the types mailing list. The Ecole Normale Superieure (ENS) de Lyon is one of the leading academical institutions for computer science in France. We welcome few, carefully selected students. Being professor at ENS Lyon is hence a priviledged position from a teaching perspective. A certain fluency in French is required for the position. There is no specific profile as far as research is concerned, provided the research area fits in the rather broad themes mentioned above. The main criterion will be the scientific level of the candidate. The position will be opened around February 2007, with decisions taken around June 2007, and job starting in September 2007. But there is a preliminary phase called ** qualification **, through which all candidates to academic positions in France have to go. This procedure consists of an evaluation of both research and teaching experience of candidates in view of their potential application to a position in a French university. The first phase of this (rather light) procedure has started on September 11, 2006, and *** closes on October 16, 2006 *** and is entirely electronical (http://www.education.gouv.fr/personnel/enseignant_superieur/enseignant_chercheur/calendrier_qualification.htm). The section of qualification should be number 27 (computer science). This quickly approaching first deadline is the main reason for the present early announcement. I suggest potential candidates should contact me (now!), and I also encourage colleagues to point me to interesting potential candidates fitting the criteria. With best regards, Daniel Hirschkoff daniel.hirschkoff at ens-lyon.fr http://perso.ens-lyon.fr/daniel.hirschkoff From Gerard.Boudol at sophia.inria.fr Tue Sep 26 09:45:49 2006 From: Gerard.Boudol at sophia.inria.fr (Gerard Boudol) Date: Tue, 26 Sep 2006 15:45:49 +0200 Subject: [TYPES/announce] PhD grant at INRIA Sophia Antipolis Message-ID: <45192F0D.3030009@sophia.inria.fr> The MIMOSA team at INRIA Sophia Antipolis is offering a PhD position for 3 years. The main research direction in MIMOSA is on programming languages for concurrent and mobile systems, from theory to practice. See our web page: http://www-sop.inria.fr/mimosa/ The topic of the proposed thesis is language-based security, and more specifically the confidentiality dimension (access control and information flow control). A first step is to design and implement a polymorphic security type system for a high-level programming language of the reactive family (again see our web page), including declassification constructs. Another topic of study is the application of language-based security techniques to the (JAVA based) FRACTAL component model developped at France T?l?com R&D. This part of the work is supported by a contract with France T?l?com. Candidates must have a Master diploma (five years of studies at university), with a good knowledge of high-level programming languages (CAML, JAVA), including knowledge about semantics and type systems. Some familiarity with computer security would also be welcome. The candidates should send their application, including a cv, motivations, and names of university teachers or scientific referees to Gerard.Boudol at sophia.inria.fr with a copy to Ilaria.Castellani at sophia.inria.fr From jeremy.gibbons at comlab.ox.ac.uk Tue Sep 26 16:09:25 2006 From: jeremy.gibbons at comlab.ox.ac.uk (Jeremy Gibbons) Date: Tue, 26 Sep 2006 21:09:25 +0100 Subject: [TYPES/announce] Integrated Formal Methods 2007: First call for technical papers Message-ID: <929B81CE-C0C0-42B4-A65E-34130E2DAAF6@comlab.ox.ac.uk> IFM 2007 Sixth International Conference on Integrated Formal Methods 2nd - 6th July 2007, Oxford, UK http://www.ifm2007.org First Call for Technical Papers The design and analysis of computing systems presents a significant challenge: systems need to be understood at many different levels of abstraction, and examined from many different perspectives. Formal methods---languages, tools, and techniques with a sound, mathematical basis---can be used to develop a thorough understanding, and to support rigorous examination. However, further research into effective integration is required if these methods are to have a significant impact outside academia. The IFM series of conferences seeks to promote that research, to bring together the researchers carrying it out, and to disseminate the results of that research among the wider academic and industrial community. Original, technical contributions are invited in all aspects of formal methods integration, including: * the application of one or more formal methods as an integral part of a process of analysis or design * the development or extension of one method, based upon the inclusion of ideas or concepts from others * the addition of formality to informal or semi-formal modelling languages, tools, or techniques * the combination of different formal methods, in terms of semantic integration or practical application The programme of accepted contributions will be supported by a series of workshops and tutorials, including a doctoral symposium. Important dates: The deadline for full paper submission is January 29th, 2007. Authors will be notified on or before March 19th, 2007. Details of the electronic submission process will be made available at the conference website. Conference location: IFM 2007 will be held at St Anne's College, Oxford: one of the larger colleges of the University, with excellent facilities for conferences and workshops. Additional facilities will be available in the new Computing Laboratory building, less than 5 minutes' walk from the College grounds. Oxford is easily reached from most UK cities, and is 70 minutes from the country's largest airport. Programme committee: Didier Bert, Institute IMAG, Grenoble, France Eerke Boiten, University of Kent, UK Jonathan Bowen, Museophile Ltd, UK Michael Butler, University of Southampton, UK Paul Curzon, Queen Mary, University of London, UK Jim Davies, University of Oxford, UK John Derrick, University of Sheffield, UK Steve Dunne, University of Teesside, UK Andy Galloway, University of York, UK Chris George, United Nations University, Macau Jeremy Gibbons, University of Oxford, UK Wolfgang Grieskamp, Microsoft Research, Redmond, US Henri Habrias, University of Nantes, France Maritta Heisel, University of Magdeburg, Germany Soon-Kyeong Kim, University of Queensland, Australia Michel Lemoine, ONERA, Toulouse, France Shaoying Liu, Hosei University, Tokyo, Japan Dominique Mery, LORIA, France Stephan Merz, LORIA, France Richard Paige, University of York, UK Luigia Petre, Turku Centre for Computer Science, Finland Jaco van de Pol, Centre for Mathematics and Computer Science, The Netherlands Judi Romijn, Eindhoven University of Technology, The Netherlands Thomas Santen, Technical University of Berlin, Germany Steve Schneider, University of Surrey, UK Wolfram Schulte, Microsoft Research, Redmond, US Kaisa Sere, Abo Akademi University, Turku, Finland Jane Sinclair, University of Warwick, UK Graeme Smith, University of Queensland, Australia Jin Song Dong, National University of Singapore Bill Stoddart, University of Teesside, UK Kenji Taguchi, National Institute of Informatics, Japan Helen Treharne, University of Surrey, UK Heike Wehrheim, University of Paderborn, Germany Kirsten Winter, University of Queensland, Australia Jim Woodcock, University of York, UK Jeremy.Gibbons at comlab.ox.ac.uk Oxford University Computing Laboratory, TEL: +44 1865 283508 Wolfson Building, Parks Road, FAX: +44 1865 273839 Oxford OX1 3QD, UK. URL: http://www.comlab.ox.ac.uk/oucl/people/jeremy.gibbons.html From ab at cis.ksu.edu Wed Sep 27 07:00:57 2006 From: ab at cis.ksu.edu (Anindya Banerjee) Date: Wed, 27 Sep 2006 06:00:57 -0500 (CDT) Subject: [TYPES/announce] Two PhD Research Assistantships Available Message-ID: PhD Research Assistantships at Stevens Institute of Technology and Kansas State University Two Ph.D. research assistantships are available starting Spring 2007 for research in software security policy specification and program analyses for software security. Project title: Access Control and Downgrading in Information Flow Assurance The project is funded by the US National Science Foundation (CyberTrust). It also involves collaborations with several researchers in the European project Mobius, at IBM Research, Microsoft Research, the SAnToS Laboratory at Kansas State University, etc. One position is at the Department of Computer Science, Stevens Institute of Technology, and the other is at the Department of Computing and Information Sciences, Kansas State University. The Ph.D. supervisors will be Anindya Banerjee at Kansas State University and/or David Naumann at Stevens Institute of Technology. For more information and details about the application process, please look at the URL http://www.cis.ksu.edu/~ab/phd.html which also contains relevant contact information. The positions are available until filled. Project Summary *************** The project investigates techniques to achieve high assurance that systems satisfy end-to-end confidentiality and integrity policies. The techniques involve type checking/inference and correctness verification. The broad objective is for confidentiality and integrity requirements to be expressed as such, with clear meaning for requirements analysts and implementors. Designs should explicitly account for the use of access controls and other means to satisfy information flow requirements. Designs and implementations must be checked for conformance with information flow policies, accounting for interaction with less trustworthy components. Rigorous validation tools must serve both to ensure compliance and also to help avoid waste of resources in unnecessary runtime checks, monitoring, or other security measures. The tools should not only guide developers but also facilitate system administration, so that trustworthiness is maintained as circumstances change and systems evolve. From blanqui at loria.fr Fri Sep 29 07:20:07 2006 From: blanqui at loria.fr (Frederic Blanqui) Date: Fri, 29 Sep 2006 13:20:07 +0200 (CEST) Subject: [TYPES/announce] INRIA postdoc position Message-ID: A one-year INRIA postdoc position is available to work on the CoLoR project. The salary is 2150 ? gross per month. The postdoc must begin before December 1st. The candidates must have a good knowledge of some proof assistant like Coq, Isabelle, Agda, etc. See http://color.loria.fr/ for details. From vladimir at ias.edu Fri Sep 29 10:06:07 2006 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Fri, 29 Sep 2006 10:06:07 -0400 Subject: [TYPES/announce] homotopy lambda calculus Message-ID: <100819C7-1BC5-45C9-BFA3-9251200E9F38@ias.edu> I have recently produced a short note where I try to explain what homotopy lambda calculus is (or is supposed to be). Here it is: -------------- next part -------------- A non-text attachment was scrubbed... Name: 2006_09_Hlambda.pdf Type: application/pdf Size: 116584 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20060929/c8464d57/2006_09_Hlambda.pdf -------------- next part -------------- Vladimir (Voevodsky) From pieter.hartel at utwente.nl Sun Oct 1 15:16:19 2006 From: pieter.hartel at utwente.nl (Hartel, P.H. (Pieter)) Date: Sun, 1 Oct 2006 21:16:19 +0200 Subject: [TYPES/announce] Full Professor FormalMethods and Tools Twente Message-ID: <69E7A7D387181541BA19AC01E25D419462D5A0@ewiex11.dynamic.ewi.utwente.nl> [Type theory has many applications in the formal analysis of hardware and software] http://www.utwente.nl/vacatures/vacatures_externe_werving/06-088-eng.doc The Computer Science department of the Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente is one of the largest academic institutions in computer science in the Netherlands, with 220 faculty members and 1200 students. It provides courses in Technical Computer Science, Business Information Technology, and Telematics. In addition, the department contributes to computer science education within other academic programmes. The research of the department is part of the multidisciplinary research institute Centre for Telematics and Information Technology (CTIT). Full Professor Formal Methods and Tools The Formal Methods and Tools group (FMT) develops rigorous techniques and tools that are needed for the systematic design and analysis of hardware and software systems. In particular, the FMT group designs validation and verification techniques that support the design of complex hardware and software products, such as embedded systems and smart environments, in relation to modern software engineering practices, such as model-driven design and component-based development. The group has a strong track record in formal testing, model checking, stochastic, real-time and hybrid modeling and validation techniques. The group is involved in teaching activities at MSc and BSc level in the Computer Science, Telematics and Embedded Systems programs, in courses that are related to the above topics. FMT has an excellent international scientific reputation, and was ranked excellent in the last national research assessment. The young and ambitious team consists of 5 academic staff, 4 postdocs, 10 PhD students, and 3 technical and administrative support staff. FMT research is embedded in the CTIT research institute (see http://www.ctit.utwente.nl/), which is the largest academic ICT research institute in the Netherlands. FMT also is part of the NIRICT Centre of Excellence CeDAS (Centre for Design, Analysis and Synthesis of Dependable System, see http://www.nirict.nl/). The successful candidate will head the FMT group. He/she is expected to develop the above research agenda further, extend and maintain collaboration at departmental, national and international level, and be engaged in the group's teaching activities. Candidates must have an outstanding publication record, excellent leadership and management qualities, a strong vision on future development of the field and very good teaching skills. Applicants must have a PhD in a relevant area. The University offers a full time tenured position as Professor in the largest and most quickly developing academic organisation in the Netherlands in the field of embedded systems, with a competitive salary (maximum ? 8161,- gross per month) and benefits commensurate with your position, experience and qualifications. For more detailed information see our website (http://fmt.cs.utwente.nl/) or contact Professor Pieter Hartel (Pieter.Hartel at utwente.nl). Interested candidates are invited to send a resume, publication list and a statement of their research and teaching interests by January 12th, 2007 to the University of Twente, attn. Prof.dr.ir. A. J. Mouthaan, Dean of the Faculty of Electrical Engineering, Mathematics and Computer Science, P.O Box 217, 7500 AE Enschede, The Netherlands, quoting vacancy number 06/088. Applicants are advised that interviews will be held on February 14th and 15th, 2007. In several areas women are still underrepresented. Therefore women are expressly invited to apply. From kurz at mcs.le.ac.uk Tue Oct 3 09:31:20 2006 From: kurz at mcs.le.ac.uk (Alexander Kurz) Date: Tue, 03 Oct 2006 14:31:20 +0100 Subject: [TYPES/announce] PhD Studentship available In-Reply-To: <42AF4D88.50505@mcs.le.ac.uk> References: <42AF4D88.50505@mcs.le.ac.uk> Message-ID: <45226628.4090000@mcs.le.ac.uk> ----------------------------------------- Please distribute to potential candidates ----------------------------------------- The Department of Computer Science of the University of Leicester offers a PhD studentship (GTA). The GTA-scheme involves some teaching and runs for 4 years. Unfortunately, the university waives the fees only for EU nationals. The PhD student will join Nick Bezhanishvili and myself in our current work on "Coalgebras, Modal Logic, and Stone Duality". Colleagues in Leicester working in related areas include Roy Crole, Reiko Heckel, Vincent Schmitt, Emilio Tuosto, and Fer-Jan de Vries. Moreover, there will be close collaboration with logic groups at the University of Amsterdam (in particular with the VICI-project directed by Yde Venema at ILLC) and at the University of Oxford (Hilary Priestley, Alexandru Baltag). For more information on the topic see http://www.cs.le.ac.uk/people/akurz/ The official announcement and application form is available at (Ref S2995) http://www.le.ac.uk/personnel/supportjobs/index.html The applications should be submitted no later than 20 October 2006. If you have any questions please send me an email. Best wishes, Alexander From pmt6sbc at maths.leeds.ac.uk Tue Oct 3 12:12:14 2006 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Tue, 3 Oct 2006 17:12:14 +0100 (BST) Subject: [TYPES/announce] CiE 2007 - Preliminary Announcement Message-ID: ********************************************************************** PRELIMINARY ANNOUNCEMENT CiE 2007 http://www.mat.unisi.it/newsito/cie07.html Computability in Europe 2007: Computation and Logic in the Real World Department of Mathematics and Computer Science "Roberto Magari" University of Siena Siena, 18-23 June 2007 IMPORTANT DATES: Submission of papers: Jan. 12, 2007 Notification of authors: Feb. 16, 2007 Deadline for final revisions: Mar. 9, 2007 The Third Conference CiE 2007, organised by CiE (Computability in Europe) will take place at the University of Siena, June 18-23 2007. CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world. CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues. CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference (Siena, College Santa Chiara, June 16-18, 2007): http://cca-net.de/cca2007/ CiE 2007 conference topics include, but not exclusively - * Admissible sets * Analog computation * Artificial intelligence * Automata theory * Classical computability and degree structures * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational learning and complexity * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Mathematical models of emergence * Molecular computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebra * Programming language semantics * Proof mining * Proof theory and computability * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Swarm intelligence * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: M. Agrawal (Kanpur) M. Arslanov (Kazan) G. Ausiello (Roma) A. Bauer (Ljubljana) A. Beckmann (Swansea) U. Berger (Swansea) A. Cantini (Firenze) B. Cooper (Leeds, co-chair) L. Crosilla (Firenze) J. Diaz (Barcelona) C. Dimitracopoulos (Athens) F. Ferreira (Lisbon) S. Goncharov (Novosibirsk) P. Gruenwald (Amsterdam) D. Harel (Rehovot) A. Hodges (Oxford) J. Kempe (Paris) G. Longo (Paris) B. Loewe (Amsterdam) J. Makowsky (Haifa) E. Mayordomo (Zaragoza) W. Merkle (Heidelberg) F. Montagna (Siena) D. Normann (Oslo) T. Pheidas (Heraklion) G. Rozenberg (Leiden) G. Sambin (Padova) H. Schwichtenberg (Muenchen) W. Sieg (Carnegie Mellon) A. Sorbi (Siena, co-chair) I. Soskov (Sofia) P. van Emde Boas (Amsterdam). The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF-format, max 10 pages) for presentation at CiE 2007. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. There will also be journal special issues, collecting invited contributions related to the conference. The conference is sponsored by EATCS, ASL, EACSL, and AILA (Italian Association of Logic and Applications). ********************************************************************** From hassei at kurims.kyoto-u.ac.jp Tue Oct 3 21:23:24 2006 From: hassei at kurims.kyoto-u.ac.jp (Hasegawa Masahito) Date: Wed, 04 Oct 2006 10:23:24 +0900 Subject: [TYPES/announce] TLCA'07 - Preliminary Call for Papers Message-ID: <200610040123.k941NOVF006385@kurims.kurims.kyoto-u.ac.jp> Preliminary Call for Papers Eight International Conference on Typed Lambda Calculi and Applications (TLCA '07) Paris, June 26-28, 2007 Part of RDP 07 (http://www.lsv.ens-cachan.fr/rdp07/) The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive: * Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: Denotational semantics, game semantics, realisability, categorical models * Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation * Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving * Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checking The programme of TLCA will consist of three invited talks and about 25 papers selected from original contributions. Accepted papers will be published as a volume of Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html). Submissions: The submitted papers should describe original work and should allow the Programme Committee to assess the merits of the contribution: in particular references and comparisons with related work should be included. Submission of material already published or submitted to other conferences with published proceedings is not allowed. Papers should not exceed 15 pages in Springer LNCS format (http://www.springer.de/comp/lncs/authors.html). Instructions for submissions will appear soon. Program Committee * Chantal Berline (CNRS, France) * Peter Dybjer (Chalmers, Sweden) * Healfdene Goguen (Google, USA) * Robert Harper (Carnegie Mellon University, USA) * Olivier Laurent (CNRS, France) * Simone Martini (University of Bologna, Italy) * Simona Ronchi Della Rocca (University of Torino, Italy), chair * Peter Selinger (University of Dalhousie, Canada) * Paula Severi (University of Leicester, UK) * Kazushige Terui (University of Sokendai, Japan) * Pawel Urzyczyn (University of Warsaw, Poland) Important Dates December 22 Title and abstract due January 2 Deadline for submission March 10-15 Author review period March 25 Notification of acceptance-rejection April 20 Deadline for the final version Steering Committe Samson Abramsky, Oxford, chair Henk Barendregt, Nijmegen Mariangiola Dezani-Ciancaglini, Turin Roger Hindley, Swansea Martin Hofmann, Munich Pawel Urzyczyn, Warsaw Publicity Chair Masahito Hasegawa From sweirich at cis.upenn.edu Wed Oct 4 09:00:54 2006 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Wed, 4 Oct 2006 09:00:54 -0400 Subject: [TYPES/announce] Call for papers: PEPM 2007 Message-ID: ---------------------------------------------------------------------- electronic submission is open http://www.easychair.org/PEPM2007 ---------------------------------------------------------------------- Third Call For Papers ACM SIGPLAN 2007 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'07) Nice, France January 15-16, 2007 (Co-located with POPL 2007) http://www.program-transformation.org/PEPM07 ---------------------------------------------------------------------- The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2007 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue last year's successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule- based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. ---------------------------------------------------------------------- Topics of interest for PEPM'07 include, but are not limited to: + Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. + Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, and type systems. + Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. + Techniques that treat programs/models as data objects including meta-programming, generative programming, staged computation, and model-driven program generation and transformation. + Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking. Examples of application domains include legacy program understanding and transformation, domain-specific language implementations, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and web-based programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. ---------------------------------------------------------------------- Submission Categories and Guidelines Regular research papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style, and authors will be expected to present a live demonstration of the described tool at the workshop. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM'07 web site. Papers should be submitted electronically via the workshop web site. The workshop proceedings will be published in the ACM Digital Library and selected papers will be invited for a journal special issue dedicated to PEPM'07. ---------------------------------------------------------------------- Important Dates + Abstracts due: October 18, 2006 + Submission: October 20, 2006 + Notification: December 1, 2006 + Camera-ready: December 18, 2006 + Workshop: January 15-16, 2007 ----------------------------------------------------------------------- Program Chairs * G. Ramalingam (Microsoft Research, Bangalore) * Eelco Visser (Delft University of Technology, The Netherlands) Program Committee Members * Ras Bodik (University of California, Berkeley, USA) * Albert Cohen (INRIA, France) * Jim Cordy (Queen's University, Canada) * Martin Erwig (Oregon State University, USA) * Bernd Fischer (University of Southampton, UK) * John Hatcliff (Kansas State University, USA) * Jan Heering (CWI, The Netherlands) * Dan Grossman (University of Washington, USA) * Annie Liu (State University of New York at Stony Brook, USA) * Jacques Noy (cole des Mines de Nantes/INRIA, France) * German Puebla (Technical University of Madrid, Spain) * Peter Sestoft (Royal Veterinary and Agricultural University, Denmark) * Yannis Smaragdakis (Georgia Tech, Atlanta, USA) * Walid Taha (Rice University, Houston, USA) ----------------------------------------------------------------------- -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 2427 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061004/5916dca6/smime.p7s From shengchao.qin at durham.ac.uk Thu Oct 5 10:26:56 2006 From: shengchao.qin at durham.ac.uk (Shengchao Qin) Date: Thu, 5 Oct 2006 15:26:56 +0100 (BST) Subject: [TYPES/announce] A Funded Ph.D Position in Durham Message-ID: UNIVERSITY OF DURHAM DEPARTMENT OF COMPUTER SCIENCE EPSRC funded Ph.D. studentship (3.5 years) Applications are invited for a Ph.D. student to work on an EPSRC funded project entitled "resource analysis and verification for dependable embedded software" in the Department of Computer Science. The aim of the project is to build a resource (memory and time) analysis and verification system for object-oriented programs running in embedded devices. Prospective candidates will have a good honours (or equivalent) degree in Computer Science or other relevant topics. The successful applicant should have a good background in some of the following areas: program analysis, type system/theory, software verification, embedded systems. This fully funded studentship provides a tax-free living allowance at the standard EPSRC rate (0512,300 p.a. for 06/07) and student tuition fees at the UK/EU student rate. Overseas applicants may have to sort out tuition fee difference via other means. The studentship is expected to start in January 2007, or as soon as possible thereafter. Closing date: 1 December 2006 More specific details about the project can by obtained by contacting Dr Shengchao Qin at shengchao.qin at durham.ac.uk Applications should be sent to Dr S Qin, Computer Science Department, Durham University, Science Labs, South Road, Durham, DH1 3LE, United Kingdom. From Stephan.Merz at loria.fr Thu Oct 5 10:54:24 2006 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Thu, 05 Oct 2006 16:54:24 +0200 Subject: [TYPES/announce] Post-doctoral position on verification for domain-specific languages Message-ID: <45251CA0.2050907@loria.fr> Post-doctoral position: Verification for domain-specific languages Applications are invited for a post-doctoral fellowship on the modeling and verification of domain-specific languages in the MOSEL team at LORIA (http://www.loria.fr/equipes/mosel/). The research will be carried out within the project VeriTLA+ (A Verification Environment for TLA+ Applied to Service Descriptions, http://wiki.loria.fr/wiki/VeriTLA). Within this project, we aim to model domain-specific languages in the specification language TLA+ (http://research.microsoft.com/users/lamport/tla/tla.html) and to develop verification techniques for programs written in DSLs against (domain-specific) high-level correctness properties. Because the properties are fixed and the expressiveness of DSLs is limited, we hope to obtain a significant degree of automation. These techniques will be validated for DSLs for communication services (http://phoenix.labri.fr/research/commServices/) and for schedulers in operating systems (http://www.emn.fr/x-info/bossa/). The post-doctoral researcher will interact intensively with the designers of these languages. TLA+ is currently supported by a mature model checker, a proof environment is being developed in a companion project. Candidates must hold a PhD and should have demonstrated research interest in formal methods and formal reasoning. They should preferably have experience with interactive proof assistants. (Prior knowledge of TLA+ is not a prerequisite.) The fellowship gives an opportunity to carry out research in collaboration with four INRIA projects in France and with several international partners. The appointment is for one year, the salary is 2150 euros per month. The position must be filled by December 1, 2006. Applications, including a curriculum vitae, references, and a short description of research interests should be sent by email to Stephan.Merz at loria.fr, who is also available for informal inquiries and discussions about the position. -------------- next part -------------- A non-text attachment was scrubbed... Name: Stephan.Merz.vcf Type: text/x-vcard Size: 325 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061005/dc02ab51/Stephan.Merz.bin From curien at pps.jussieu.fr Sat Oct 7 05:16:56 2006 From: curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Sat, 7 Oct 2006 11:16:56 +0200 Subject: [TYPES/announce] Position preannouncement in Paris 7 (REMINDER, qualification deadline 16/10/06) Message-ID: <942C48DE-55E4-11DB-996C-000A95DC36FE@pps.jussieu.fr> **** REMINDER **** Deadline for the "qualification procedure is 16 October, strictly. ******************************** POSITION PRE-ANNOUNCEMENT A position of Maitre de Conferences (permanent position, more or less equivalent to "associate professor", or "lecturer") ** in mathematics** is likely to be opened next year at Paris 7 University. The hired candidate will work in the laboratory PPS (Preuves, Programmes et Systemes), which spreads its interests on both sides of the correspondence between proofs and programs, covering work on language design and implementation, rewriting, semantics (and game semantics in particular), categories, linear logic, realizability, probabilistic and topological methods, etc... See www.pps.jussieu.fr. The position will be opened around February 2007, with decisions taken around May 2007, and job starting in September 2007. But there is a preliminary phase called ** qualification **, through which all candidates to academic positions in France have to go. This procedure consists of an evaluation of both research and teaching experience of candidates in view of their potential application to a position in a French university. The first phase of this (rather light) procedure is opened on September 11, 2006, and *** closes on October 16, 2006 *** and is entirely electronical (http://www.education.gouv.fr/personnel/enseignant_superieur/ enseignant_chercheur/calendrier_qualification.htm). The section of qualification should be preferably number 25 (mathe'matiques), but candidates interested in multiple applications in France, including in CS departments, may also apply for qualification in section 27 (informatique) simultaneously. This approaching first deadline is the main reason for the present early announcement. A certain fluency in French is required for the position. The teaching will be in the mathematics department, so some experience in teaching mathematics (rather than computer science) is welcome Teaching is in French. I invite potential candidates to contact me, and I also encourage colleagues to point me to interesting potential candidates fitting the criteria. Best regards, Pierre=Louis Curien curien at pps.jussieu.fr From Susanne.Graf at imag.fr Sun Oct 8 15:38:50 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Sun, 08 Oct 2006 21:38:50 +0200 Subject: [TYPES/announce] Preliminary Program FMCO 2006: call for participation Message-ID: <452953CA.30101@imag.fr> 5th International Symposium on Formal Methods for Components and Objects (FMCO 2005) DATES: 7 - 10 November 2006 VENUE: CWI, Amsterdam, The Netherlands Registration form and more information at the FMCO site http://fmco.liacs.nl/fmco06.html PRELIMINARY PROGRAM Tuesday November 7th -------------------- OPENING SESSION 9:15 - 10:15 Keynote: Moshe Vardi (Rice University, USA) From verification to synthesis Break SESSION: COMPONENTS AND ACTORS 10:30 - 11:15 M. Sirjani Abstraction and compositional verification techniques for asynchronous communicating components Break 11:30 - 12:30 Keynote: Gul Agha (U. of Illinois at Urbana-Champaign, USA) Separating concerns: actors, coordination constraints, and implementation protocols in a reflective architecture Lunch break SESSION: TRUST AND SECURITY 14:00 - 15:00 Keynote: Vladimiro Sassone (University of Southampton, UK) t.b.a. Break 15:15 - 16:00 J. Gelissen Trust management framework in RoboCop Break 16:00 - 16:45 G. Barthe, L. Burdy, J. Charles, B. Gregoire, M. Huisman, J.-L. Lanet, M. Pavlova, and A. Requet JACK: a tool for validation of security and behaviour of Java applications Welcome reception Wednesday November 8th ---------------------- SESSION: TESTING 9:15 - 10:15 Keynote: Jan Tretmans (Radboud University Nijmegen, NL) Model-based testing with transition systems Break 10:30 - 11:15 C. Artho Testing I/O failures with Enforcer Break 11:30 - 12:30 Keynote: Thierry Jeron (INRIA Rennes, FR) Model-based test selection for infinite state reactive systems Lunch break SESSION: MODELS OF COMPUTATIONS 14:00 - 15:00 Keynote: Vijay A. Saraswat (IBM Research, USA) Determinate imperative programming Break 15:15 - 16:00 C. Palamidessi and F.D. Valancia Expressiveness of recursion, replication and scope mechanism Social event and dinner Thursday November 9th --------------------- SESSION: WIDE AREA AND DISTRIBUTED COMPUTING 9:15 - 10:15 Keynote: Jayadev Misra (Univ. of Texas at Austin, USA) Orchestrating computations on wide-area networks Break 10:30 - 11:15 A.Schmitt and J.-B. Stefani Towards a Calculus for Distributed Components Break 11:30 - 12:30 Keynote: Philip Wadler (University of Edinburgh, UK) Links, web programming without tiers Lunch break SESSION: PROGRAM VERIFICATION 14:00 - 15:00 Keynote: Radu Iosif (Verimag, FR) Applications of first-order integer arithmetic to the verification of programs with lists Break 15:15 - 16:00 M. Leuker Learning meets verification Break 16:15 - 17:00 W. Ahrendt, B. Beckert, R. Hahnle, P. Rummer, and P.H. Schmitt The KeY approach to deductive verifications of object-oriented programs Friday November 10th -------------------- SESSION: TYPES 9:00 - 10:00 Keynote: Sophia Drossopoulou (Imperial College, UK) Session types for object oriented languages Break 10:15 - 11:00 M. Plumicke Java type inference with wildcards 11:00 - 11:45 L. Desmet, B. Jacobs, F. Piessens, W. Schulte, J. Smans, and D. Vanoverberghe Concern-specific annotation languages to support static detection of bugs in Java-like programs Break CLOSING SESSION: THEORY MEETS PRACTICE 12:00 - 13:00 Keynote: Erik Meijer, (Microsoft research, USA) Theory and practice behind Visual Basic 9 and C# 3.0 Lunch From carlos.martin at urv.cat Sun Oct 8 15:30:42 2006 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Sun, 08 Oct 2006 19:30:42 GMT Subject: [TYPES/announce] LATA 2007: 2nd call for papers Message-ID: ******************************************************************************* 2nd Call for Papers 1st INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2007) Tarragona, Spain, March 29 - April 4, 2007 http://www.grammars.grlmc.com/LATA2007/ ******************************************************************************* AIMS: LATA 2007 intends to become a major conference in theoretical computer science and its applications. As linked to the International PhD School in Formal Languages and Applications that is being developed at the host institute since 2001, it will reserve significant room for young computer scientists at the beginning of their career. LATA 2007 will aim at attracting scholars from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - words, languages and automata - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - combinatorics on words - language varieties and semigroups - algebraic language theory - computability - computational, descriptional, communication and parameterized complexity - patterns and codes - regulated rewriting - trees, tree languages and tree machines - term rewriting - graphs and graph transformation - power series - fuzzy and rough languages - cellular automata - DNA and other models of bio-inspired computing - quantum, chemical and optical computing - biomolecular nanotechnology - automata and logic - automata for verification - automata, concurrency and Petri nets - parsing - weighted machines - foundations of finite state technology - grammatical inference and learning - symbolic neural networks - text retrieval and pattern recognition - string and combinatorial issues in computational biology and bioinformatics - mathematical evolutionary genomics - language-based cryptography - compression - circuit theory and applications - language theoretic foundations of artificial intelligence and artificial life STRUCTURE: LATA 2007 will consist of: - 3 invited talks - 2 invited tutorials - refereed contributions - open sessions for discussion in specific subfields - young sessions on professional issues INVITED SPEAKERS: Volker Diekert (UStuttgart), Equations: From Words to Graph Products (tutorial) Nissim Francez & Michael Kaminski (Technion), Extensions of Pregroup Grammars and Their Correlated Automata Eric Graedel (RWTH Aachen), Infinite Games (tutorial) Neil Immerman (UMass, Amherst), Nested Words Helmut J?rgensen (UWestern Ontario), Synchronization and Codes (tentative title) PROGRAMME COMMITTEE: Francine Blanchet-Sadri (Greensboro) Paola Bonizzoni (Milan) Henning Bordihn (Potsdam) John Brzozowski (Waterloo) Erzsebet Csuhaj-Varju (Budapest) Carsten Damm (Goettingen) Nachum Dershowitz (Tel Aviv) Pal Domosi (Debrecen) Manfred Droste (Leipzig) Zoltan Esik (Tarragona, co-chair) Joerg Flum (Freiburg, Germany) Jozef Gruska (Brno) Tero Harju (Turku) Colin de la Higuera (Saint-Etienne) Markus Holzer (Munich) Lucian Ilie (London, Canada) Masami Ito (Kyoto) Jarkko Kari (Turku) Andre Kempe (Grenoble) Jetty Kleijn (Leiden) Satoshi Kobayashi (Tokyo) Martin Kutrib (Giessen) Thierry Lecroq (Rouen) Stuart Margolis (Ramat Gan) Carlos Martin-Vide (Tarragona, co-chair) Risto Miikkulainen (Austin) Victor Mitrana (Tarragona, co-chair) Claudio Moraga (Dortmund) Kenichi Morita (Hiroshima) Mark-Jan Nederhof (Groningen) Mitsunori Ogihara (Rochester) Alexander Okhotin (Turku) Friedrich Otto (Kassel) Holger Petersen (Stuttgart) Wojciech Rytter (Warsaw) Kai Salomaa (Kingston, Canada) Magnus Steinby (Turku) Shuly Wintner (Haifa) Detlef Wotschke (Frankfurt) Hsu-Chun Yen (Taipei) Sheng Yu (London, Canada) ORGANIZING COMMITTEE: Madalina Barbaiani Gemma Bel-Enguix Cristina Bibire Carlos Cruz Reyes Adrian Horia Dediu Szilard Zsolt Fazekas Maria Adela Grando Mihai Ionescu M. Dolores Jimenez-Lopez Alexander Krassovitskiy Guangwu Liu Remco Loos Carlos Martin-Vide (chair) Tsetsegkhand Namsrai Anthonath Roslin Sagaya Mary Sherzod Turaev SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 pages and should be formatted according to the usual LNCS article style. Submissions have to be sent through the web page: http://www.easychair.org/LATA2007/ PUBLICATION: A volume of pre-proceedings will be available by the time of the conference. It is expected that a refereed volume of selected proceedings will be published soon after it in the LNCS Springer series. REGISTRATION: The period for registration will be since January 9 to March 29, 2007. Details about how to register will be provided through the website of the conference in due time. Early registration fees: 200 euros Early registration fees (PhD students): 50 euros Registration fees: 300 euros Registration fees (PhD students): 75 euros FUNDING: 40 grants covering partial-board accommodation in the university hostel will be available for nonlocal PhD students. To apply, the candidate must e-mail her/his CV together with a copy of the document proving her/his condition as a PhD student. IMPORTANT DATES: Paper submission: November 30, 2006 Application for funding (PhD students): December 15, 2006 Notification of funding acceptance or rejection: December 31, 2006 Notification of paper acceptance or rejection: January 31, 2007 Early registration: February 15, 2007 Final version of the paper for the pre-proceedings: February 28, 2007 Starting of the conference: March 29, 2007 Submission to the proceedings volume: May 15, 2007 FURTHER INFORMATION: carlos.martin at urv.cat ADDRESS: LATA 2007 Research Group on Mathematical Linguistics Rovira i Virgili University Plaza Imperial Tarraco, 1 43005 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-559597 From tho at ifs.tuwien.ac.at Mon Oct 9 13:00:29 2006 From: tho at ifs.tuwien.ac.at (Nguyen Manh Tho) Date: Mon, 9 Oct 2006 19:00:29 +0200 Subject: [TYPES/announce] ARES 2007: Paper Submission System is ready - Submission Deadline 19-11-2006 Message-ID: <20eb1f395604f4b3e225b6a9381882fd@manhtho-laptop> An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061009/9c2bbe6e/attachment.htm From luca.compagna at sap.com Tue Oct 10 09:18:41 2006 From: luca.compagna at sap.com (COMPAGNA, Luca) Date: Tue, 10 Oct 2006 15:18:41 +0200 Subject: [TYPES/announce] Three-years Ph.D. Research Fellowship position available - SAP Labs France Message-ID: <637C1D226CA096479FC2049B77821099030E2D67@dewdfe21.wdf.sap.corp> apologies for multiple copies. --------------------------------------- Three-years Ph.D. Research Fellowship --------------------------------------- SAP Labs France SAS Security & Trust research programme Sophia Antipolis, France SAP Labs France has a three-years PhD Research Fellowship available. Please refer to the attached pdf file for detailed information on the PhD context. Applications are invited from all suitable candidates. Any interested candidate is requested to send no later than November 15th his CV and the names and contact addresses of two referees electronically to Anne Hardy (anne_DOT_hardy_AT_sap_DOT_com). -------------- next part -------------- A non-text attachment was scrubbed... Name: PhD_Fellowship_Serenity.pdf Type: application/octet-stream Size: 77528 bytes Desc: PhD_Fellowship_Serenity.pdf Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061010/93ed1102/PhD_Fellowship_Serenity.dll From bruni at di.unipi.it Wed Oct 11 04:46:25 2006 From: bruni at di.unipi.it (Roberto Bruni) Date: Wed, 11 Oct 2006 10:46:25 +0200 Subject: [TYPES/announce] Call for Participation: TGC 2006 - 2nd symposium on Trustworthy Global Computing Message-ID: <452CAF61.1050201@di.unipi.it> [Apologies for multiple postings] -- ===================================================================== Dr. Roberto Bruni Computer Science Department Phone: +39 050 2212785 University of Pisa Fax: +39 050 2212726 Largo B. Pontecorvo, 3 Email: bruni at di.unipi.it I-56127 Pisa - ITALY WWW: http://www.di.unipi.it/~bruni ===================================================================== "Different people define different things differently" ===================================================================== -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: tgc-participation.txt Url: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061011/175a4b7f/tgc-participation.txt From Jeremy.Gibbons at comlab.ox.ac.uk Wed Oct 11 18:15:40 2006 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Wed, 11 Oct 2006 23:15:40 +0100 (BST) Subject: [TYPES/announce] Fun in the Afternoon: Thurs 16th Nov in Oxford Message-ID: <200610112215.k9BMFeFr007441@softeng.comlab.ox.ac.uk> Dear colleagues, Graham Hutton and Conor McBride at Nottingham and I are organizing a termly seminar "Fun in the Afternoon" on functional programming and related topics. The idea is to have a small number of talks as an antidote to mid-term blues, three afternoons a year. The hope is that talks will be informal and fun, and that there will be plenty of scope for discussion and chat as well. Fun in the Afternoon will be peripatetic. The first meeting will be in Oxford University Computing Laboratory on Thursday 16th November, and Phil Wadler of the University of Edinburgh will be opening proceedings. All are welcome, but if you'd like to come, could you please drop me (Jeremy Gibbons) a line so that I have an idea of numbers? If you'd like to give a talk, please also propose a title and a duration. We haven't yet fixed the timetable, because it depends in part on what offers of talks we get. But our current plan is to have talks 14:00-14:45 and 15:30-17:00. Brings sandwiches to eat together beforehand, and join us for drinks in a pub afterwards. There's a webpage with more information at http://sneezy.cs.nott.ac.uk/fun/ This page also explains how to subscribe to the mailing list, to which all further announcements will be sent. Directions to OUCL are at http://web.comlab.ox.ac.uk/oucl/about/directions.html Jeremy, Graham and Conor From eernst at daimi.au.dk Fri Oct 13 11:59:40 2006 From: eernst at daimi.au.dk (Erik Ernst) Date: Fri, 13 Oct 2006 17:59:40 +0200 Subject: [TYPES/announce] ECOOP 2007 - CFP - 2 months Message-ID: <200610131759.40818.eernst@daimi.au.dk> [Apologies for multiple copies] *** ECOOP 2007 *** The 21st European Conference on Object-Oriented Programming, ECOOP 2007, will take place in Berlin, Germany, July 30 - August 3, 2007. The ECOOP 2007 conference invites high quality papers presenting research results or experience in all areas relevant to object technology, including work that takes inspiration from or builds connections to areas not commonly considered object-oriented. The ECOOP 2007 conference also invites high quality proposals for workshops and for tutorials. Important submission dates (firm deadlines): - Technical paper submission: December 13, 2006. - Workshop proposal submission: December 20, 2006. - Tutorial proposal submission: December 20, 2006. For more details, please visit http://2007.ecoop.org/. -- Erik Ernst eernst at daimi.au.dk Department of Computer Science, University of Aarhus IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From koba at kb.ecei.tohoku.ac.jp Fri Oct 13 20:55:58 2006 From: koba at kb.ecei.tohoku.ac.jp (koba@kb.ecei.tohoku.ac.jp) Date: Sat, 14 Oct 2006 09:55:58 +0900 (JST) Subject: [TYPES/announce] APLAS 2006 2nd Call for Particiaption Message-ID: <20061014.095558.46621555.koba@kb.ecei.tohoku.ac.jp> Apologies for multiple copies. *** Early Registration Deadline: 20 October *** Call for Participation 4th Asian Symposium on Programming Languages and Systems November 8-10, 2006 Sydney, Australia http://www.cse.unsw.edu.au/~aplas06/ http://www.kb.ecei.tohoku.ac.jp/aplas2006/ Scope of the Conference ----------------------- 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. Conference Registration ----------------------- Registration information for APLAS 2006 is available at http://www.cse.unsw.edu.au/~aplas06/registration.html From joost.visser at di.uminho.pt Mon Oct 16 05:01:27 2006 From: joost.visser at di.uminho.pt (Joost Visser) Date: Mon, 16 Oct 2006 10:01:27 +0100 Subject: [TYPES/announce] GTTSE 2007 --- First call for participation (02-07 July 2007) Message-ID: GTTSE 2007, 02-07 July, 2007, Braga, Portugal 2nd International Summer School on Generative and Transformational Techniques in Software Engineering http://www.di.uminho.pt/GTTSE2007 SCOPE AND FORMAT The summer school brings together PhD students, lecturers, technology presenters, as well as other researchers and practitioners who are interested in the generation and the transformation of programs, data, models, meta-models, and documentation. This concerns many areas of software engineering: software reverse and re-engineering, model-driven approaches, automated software engineering, generic language technology, to name a few. These areas differ with regard to the specific sorts of meta-models (or grammars, schemas, formats etc.) that underlie the involved artifacts, and with regard to the specific techniques that are employed for the generation and the transformation of the artifacts. The tutorials are given by renowned representatives of complementary approaches and problem domains. Each tutorial combines foundations, methods, examples, and tool support. The program of the summer school also features invited technology presentations, which present setups for generative and transformational techniques. These presentations complement each other in terms of the chosen application domains, case studies, and the underlying concepts. The program of the school also features a participants workshop. All summer school material will be collected in proceedings that are handed out to the participants. Formal proceedings will be compiled after the summer school, where all contributions are subjected to additional reviewing. The formal proceedings of the first instance of the summer school (2005) are published as volume 4143 in the Lecture Notes in Computer Science series of Springer-Verlag. SUMMER SCHOOL CHAIRS * Ralf L?mmel (Program Chair), Microsoft Corp., Redmond, USA. * Jo?o Saraiva (Organizing Chair), Universidade do Minho, Braga, Portugal. * Joost Visser (Program Chair), Universidade do Minho, Braga, Portugal. ADDITIONAL INFORMATION For additional information on the program, venue, and other details of the summer school, please consult the web page: http://www.di.uminho.pt/GTTSE2007 Note that registration for the summer school will open in January 2007. Before that time, those who wish to be notified personally when registration opens are welcome to send an expression of interest to gttse2007 at di.uminho.pt. From dave at chalmers.se Mon Oct 16 11:28:58 2006 From: dave at chalmers.se (David Sands) Date: Mon, 16 Oct 2006 17:28:58 +0200 Subject: [TYPES/announce] Call for Participation: 4th ACM Workshop on Formal Methods in Security Engineering (FMSE'06) Message-ID: <4533A53A.5020405@chalmers.se> CALL FOR PARTICIPATION The 4th ACM Workshop on Formal Methods in Security Engineering: >From Specifications to Code http://www.cs.chalmers.se/~dave/FMSE06/ Friday November 3, 2006, Johnson Center, George Mason University, Fairfax, Virginia, USA held in conjunction with the 13th ACM Conference on Computer and Communications Security (ACM CCS'06) http://www.acm.org/sigs/sigsac/ccs/CCS2006/ ONLINE REGISTRATION http://www.regonline.com/Checkin.asp?EventId=107024 SCOPE Information security has become a crucial concern for the commercial deployment of almost all applications and middleware. Although this is commonly recognized, the incorporation of security requirements in the software development process is not yet well understood. The deployment of security mechanisms is often ad hoc, without a formal security specification or analysis, and practically always without a formal security validation of the final product. Progress is being made, but there remains a wide gap between high-level security models and actual code development. FMSE aims to bring together researchers and practitioners from both the security and the software engineering communities, from academia and industry, who are working on applying formal methods to the design and validation of large-scale systems. PROGRAM CHAIRS Andrew D. Gordon, Microsoft Research, UK David Sands, Chalmers University of Technology, Sweden PROGRAM COMMITTEE Michael Backes, Saarland University, Germany Jason Crampton, Royal Holloway, University of London, UK Virgil Gligor, University of Maryland, USA Andrew D. Gordon, Microsoft Research, UK Jean Goubault-Larrecq, CNRS and ENS, Cachan, France Alan Jeffrey, Bell Labs, USA Trevor Jim, AT&T Research, USA Heiko Mantel, RWTH Aachen, Germany Riccardo Pucella, Northeastern University, USA John Rushby, SRI, USA Mark Ryan, University of Birmingham, UK Pierangela Samarati, University of Milan, Italy David Sands, Chalmers University of Technology, Sweden Luca Vigan?, ETH Zurich, Switzerland Steve Zdancewic, University of Pennsylvania, USA FMSE STEERING COMMITTEE Michael Backes, Saarland University, Germany David Basin, ETH Zurich, Switzerland Michael Waidner, IBM Zurich Research Lab, Switzerland INVITED TALKS Searching for shapes Joshua Guttman, Mitre Corporation, USA Encoding Information Flow in Haskell Steve Zdancevic, University of Pennsylvania, USA CONTRIBUTED PAPERS Securing the Drop-Box Architecture for Assisted Living Michael J. May, Wook Shin, Carl A. Gunter and Insup Lee P-Congruences as Non-Interference for the pi-calculus Silvia Crafa and Sabina Rossi An Intruder Model for Verifying Liveness in Security Protocols Jan Cederquist and Muhammad Torabi Dashti Secure Information Flow with Random Assignment and Encryption Geoffrey Smith and Rafael Alpizar Defeasible Security Policy Composition for Web Services Adam J. Lee, Jodie Boyer, Lars E. Olson and Carl A. Gunter NETRA: Seeing Through Access Control Prasad Naldurg, Stefan Schwoon, Sriram Rajamani and John Lambert Bridging the Gap Between Web Application Firewalls and Web Applications Lieven Desmet, Frank Piessens, Wouter Joosen and Pierre Verbaeten From andrei at cs.chalmers.se Tue Oct 17 12:09:07 2006 From: andrei at cs.chalmers.se (Andrei Sabelfeld) Date: Tue, 17 Oct 2006 18:09:07 +0200 (MEST) Subject: [TYPES/announce] Computer Security Foundations Workshop (CSFW'07) call for papers Message-ID: <20061017160907.CB6DB31CA@zsh.cs.chalmers.se> A non-text attachment was scrubbed... Name: not available Type: text Size: 6530 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061017/df41e8e7/attachment.txt From tho at ifs.tuwien.ac.at Mon Oct 23 10:39:22 2006 From: tho at ifs.tuwien.ac.at (Nguyen Manh Tho) Date: Mon, 23 Oct 2006 16:39:22 +0200 Subject: [TYPES/announce] ARES 2007: Call for papers and workshops's papers - Deadline 19-11-2006 Message-ID: <623e9a8778d06fd71d6459b96168b73a@manhtho-laptop> An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061023/4a0ea5f2/attachment.htm From Ricky.Robinson at nicta.com.au Tue Oct 24 03:06:10 2006 From: Ricky.Robinson at nicta.com.au (Ricky Robinson) Date: Tue, 24 Oct 2006 17:06:10 +1000 Subject: [TYPES/announce] CFP: DAIS 2007 Message-ID: <09D3F703EF3B0A4CBE28449EA9F3D3200414BEAD@nicta-atp-mail.in.nicta.com.au> --------------------------------------------------------------------- First CALL FOR PAPERS DAIS 2007 7th IFIP International Conference on Distributed Applications and Interoperable Systems "Towards Sustainability" Paphos, Cyprus 6 - 8 June 2007 --------------------------------------------------------------------- Abstract submission: 8 January 2007 Paper submission: 15 January 2007 Work-in-progress papers: 26 January, 2007 Author notification: 7 March 2007 Camera-ready copy: 26 March 2007 --------------------------------------------------------------------- http://www.discotec07.cs.ucy.ac.cy --------------------------------------------------------------------- The 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS) is part of the federated conferences DisCoTec (Distributed Computing Techniques),together with the 9th International Conference on Coordination Models and Languages (COORDINATION) and the 9th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS). It will be organised by the Department of Computer Science of the University of Cyprus. ABOUT THE CONFERENCE Distributed applications and interoperable systems have become an integral part of everyday living, part of the socio-economic ecosystem of our human environment. With such interdependence between society and software, distributed software applications must be sustainable and adaptable in the long term, despite the changes in our environment. What do we understand by sustainability in distributed applications and interoperable systems? How do we ensure our distributed applications can make local adaptation to specific circumstances of their deployment? How do we make our interoperable systems evolvable in the face of widespread change in their environment? How do we integrate distributed software within the wider fabric of computing within our modern world? How can distributed applications and interoperable systems capitalise and exploit future trends and the changing user demographic? The DAIS conference series addresses all aspects of distributed applications and interoperable systems: design, implementation, operation and maintenance. This time we particularly solicit papers that address sustainability issues. DAIS'07 is the 7th event in this successful international conference series, commencing in 1997. It will be a forum for researchers, vendors and users to come together to review, discuss and learn about the future of distributed applications and interoperable systems. DAIS is now an annual event. CONFERENCE THEMES DAIS'07 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'07 conference themes include: - innovative distributed applications in the areas of * enterprise computing * mobile, grid and peer-to-peer computing * context-aware, ubiquitous and pervasive computing - models and concepts supporting distributed applications in the areas of * sustainability * adaptability * evolution - middleware supporting distributed applications in the area of * autonomic applications and systems * context-aware, adaptive applications * reconfigurable and self-managing applications * quality of service-aware applications - evolution of application integration and interoperability in * enterprise-wide and inter-enterprise integration * semantic interoperability and semantic web services * service-oriented applications - software engineering of distributed applications * domain-specific modeling languages * model evolution * model-driven adaptation, testing and validation * re-engineering SUBMISSION GUIDELINES Submissions must be done electronically as postscript or PDF, using the Springer LNCS style. DAIS'07 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'07 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 8, 2007 Full paper submission: January 15, 2007 Work-in-progress papers: January 26, 2007 Notification of acceptance: March 7, 2007 Camera ready version: March 26, 2007 ORGANISERS General chair: George Angelos Papadopoulos, University of Cyprus, Cyprus 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: Jadwiga Indulska, University of Queensland, Australia Kerry Raymond, Queensland University of Technology, Australia Publicity chair: Ricky Robinson, National ICT Australia, Australia Program committee: N. Alonistioti, University of Athens, Greece D. Bakken, Washington State University, USA Y. Berbers, Katholieke Universiteit Leuven, Belgium A. Beugnard, ENST-Bretagne, France G. Blair, Lancaster University, UK I. Demeure, ENST, France C. Eckert TU Darmstadt, Germany F. Eliassen, University of Oslo, Norway P. Felber, Universit? de Neuch?tel, Switzerland, K. Geihs, University of Kassel, Germany 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 H. Koenig, BTU Cottbus, Germany R. Kroeger, Univeristy of Applied Sciences Wiesbaden, Germany L. Kutvonen, University of Helsinki, Finland W. Lamersdorf, University of Hamburg, Germany M. Lawley, Queensland University of Technology, Australia C. Linnhof-Popien, University of Munich, Germany K. Lund, Simula Research Laboratory, Norway R. Meier, Trinity College Dublin, Ireland L. Merakos, University of Athens, Greece A. Montresor, University of Trento, Italy E. Najm, ENST, France R. Oliveira, Universidade do Minho, Portugal A. Puder State University San Francisco, USA K. Raymond, Queensland University of Technology, Australia R. Robinson, National ICT Australia, Australia A. Schill, Technical University of Dresden, Germany T. Senivongse, Chulalongkorn University, Thailand K. Sere, ?bo Akademi University, Finland J.-B. Stefani, INRIA, France E. Tanter , University Santiago de Chile, Chile K. Zielinski, AGH Univ. of Science and Technology, Poland -- Ricky Robinson, Ph.D. Researcher Queensland Laboratory National ICT Australia Limited PO Box 10161 Brisbane QLD 4000 Australia Tel. +61 7 3000 0514 Fax. +61 7 3000 0480 The imagination driving Australia's ICT future. To receive the latest NICTA information register at http://nicta.com.au/registration.cfm -------------------------------------------------------------------------- This email and any attachments may be confidential. They may contain legally privileged information or copyright material. You should not read, copy, use or disclose them without authorisation. If you are not an intended recipient, please contact us at once by return email and then delete both messages. We do not accept liability in connection with computer virus, data corruption, delay, interruption, unauthorised access or unauthorised amendment. This notice should not be removed. From msteffen at ifi.uio.no Wed Oct 25 08:53:32 2006 From: msteffen at ifi.uio.no (Martin Steffen) Date: 25 Oct 2006 14:53:32 +0200 Subject: [TYPES/announce] FMOODS 06: 1st Call for Papers Message-ID: --------------------------------------------------------------------- First CALL FOR PAPERS FMOODS 2007 9th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems Paphos, Cyprus 6 - 8 June 2007 --------------------------------------------------------------------- Abstract submission: 8 January 2007 Paper submission: 15 January 2007 Author notification: 7 March 2007 Camera-ready copy: 26 March 2007 --------------------------------------------------------------------- http://www.discotec07.cs.ucy.ac.cy --------------------------------------------------------------------- The 9th 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 9th International Conference on Coordination Models and Languages (COORDINATION) and the 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS). FMOODS 2007 is sponsored by IFIP, and will be organised by the Department of Computer Science of the University of Cyprus. 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 - Formalization of runtime system evolution (e.g. dynamic updates, reconfiguration) - Multiple viewpoint modelling and consistency between different views - Model transformations and refactorings - Integration of quality of service requirements into formal models - Formal approaches to component-based design - Applications of formal methods (e.g. web services, multimedia, telecommunications) - Experience reports on best practices and tools INVITED SPEAKER Mariangiola Dezani-Ciancaglini (U. of Torino, IT) ORGANISERS: General chair: George Papadopoulos (U. of Cyprus, CY) PC chairs: Einar Broch Johnsen (U. of Oslo, NO) Marcello Bonsangue (LIACS, NL) Publicity Chair: Martin Steffen (U. of Oslo, NO) Steering Committee: John Derrick (U. of Sheffield, UK) Roberto Gorrieri (U. of Bologna, IT) Elie Najm (ENST, Paris, FR) Carolyn Talcott (SRI International, US) Program Committee Bernhard Aichernig (TU. of Graz, AT) Alessandro Aldini (U. of Urbino, IT) Frank de Boer (CWI, NL) Eerke Boiten (U. of Kent, UK) Marcello Bonsangue (LIACS, NL) John Derrick (U. of Sheffield, UK) Einar Broch Johnsen (U. of Oslo, NO) Robert France (Colorado State U., US) Naoki Kobayashi (Tohoku University, JP) David Naumann (Stevens Inst. of Technology, US) Uwe Nestmann (TU of Berlin, DE) Erik Poll (U. of Nijmegen, NL) Antonio Ravara (TU of Lisbon, PT) Arend Rensink (U. of Twente, NL) Ralf Reussner (U. of Karlsruhe, DE) Grigore Rosu (U. of Illinois at Urbana-Champaign, US) Bernhard Rumpe (TU Braunschweig, DE) Martin Steffen (U. of Oslo, NO) Carolyn Talcott (SRI International, US) Heike Wehrheim (U. of Paderborn, DE) Martin Wirsing (U. of Munich DE) Wang Yi (Uppsala University, SE) Liu Zhiming (UNU/IIST, MO) Gianluigi Zavattaro (U. of Bologna, IT) Elena Zucca (U. of Genova, IT) IMPORTANT DATES: 8 January 2007: Abstract submission 15 January 2007: Paper submission 7 March 2007: Author notification 26 March 2007: Camera-ready copy 5 June 2007: DisCoTec 2007 workshops 6-8 June 2007: FMOODS 2007 PROCEEDINGS: The FMOODS 2007 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 amar at math.ist.utl.pt Thu Oct 26 10:56:29 2006 From: amar at math.ist.utl.pt (Antonio Ravara) Date: Thu, 26 Oct 2006 15:56:29 +0100 Subject: [TYPES/announce] CONCUR 2007 Call for Workshop Proposals Message-ID: <4540CC9D.1040802@math.ist.utl.pt> [apologies for multiple copies] -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: call-for-ws.txt Url: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061026/3cae427c/call-for-ws.txt From tho at ifs.tuwien.ac.at Mon Oct 30 04:50:16 2006 From: tho at ifs.tuwien.ac.at (Nguyen Manh Tho) Date: Mon, 30 Oct 2006 10:50:16 +0100 Subject: [TYPES/announce] Call for papers - CISIS 2007: First International Conference on Complex, Intelligent and Software Intensive Systems Message-ID: (Apologies for multiple copies due to cross postings. Please send to interested colleagues and students) Call for Papers ##################################################################### First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS-2007) http://www.cisis-conference.eu/ April 10 - April 13, 2007 Vienna, Austria ##################################################################### To be held in conjunction with: ARES-2007 International Conference http://www.ares-conference.eu/ Aim ====== The aim of the conference is to deliver a platform of scientific interaction between the three interwoven challenging areas of research and development of future ICT-enabled applications: - Software Intensive Systems - Complex systems - Intelligent Systems Software Intensive Systems are systems which heavily deal with other systems, sensors, actuators, devices, other software systems and users. More and more domains are involved with software intensive systems, i.e. automotive, telecommunication systems, embedded systems in general, industrial automation systems, business applications. The outcome of web services delivers a new platform for enabling software intensive systems. The conference will focus on tools, practically relevant and theoretical foundations for engineering software intensive systems. Complex Systems Research is focused on the overall understanding of systems rather than its components. The ICT-enabling aspect of Complex Systems is the focus of the contributions to be presented at CISIS 2007. Complex Systems are very much characterised by the changing environments in which they act and by their multiple internal and external interactions. They evolve and adapt through internal and external dynamic interactions. The development of Intelligent Systems and agents which is more and more characterised by the use of ontologies and their logical foundations build a fruitful impulse for both Software intensive Systems and Complex Systems. Recent research in the field of intelligent systems ?robotics, neuroscience, artificial intelligence, and cognitive sciences- builds an important factor for the future development and innovation of software intensive and complex systems. CISIS 2007 is aiming at delivering a forum for in-depth scientific discussions amongst the three communities leading to significant contributions in areas such as: - Monitoring and Control of Large Systems or Environments. - Managing the heterogeneity of knowledge by means of ontologies - Use of Service Oriented Architectures for complex applications in business and industries - The consideration of Software Intensive Systems as Complex Systems - Enabling of Systems Biology concepts as software intensive complex systems - Knowledge management of complex IT-systems etc. Scope ========= Networks of today are going through a rapid evolution. Different kinds of systems with different characteristics are emerging and they are integrating in heterogeneous networks. For these reasons, there are many interconnection problems which may occur at different levels in the hardware and software design of communicating entities and communication networks. These kinds of networks need to manage an increasing usage demand, provide support for a significant number of services, guarantee their QoS, and optimize the utilization of network resources. Therefore, architectures and algorithms in these networks become very complex and it seems imperative to focus on new models and methods as well as mechanisms, which can enable the network to perform adaptive behaviors. Many new computing technologies have emerged as new paradigms for solving complex problems by enabling large-scale aggregation and sharing of computational, data and other geographically distributed resources. Rapid advances are being reported by many researchers and forums as regards understanding numerous issues in such paradigms, from theoretic to application aspects. Moreover, the continuous development of Internet and the construction of new infrastructures are making possible the development of large scale applications from many fields of science and engineering. To deal with complexity, we should construct physically instantiated systems that can perceive, understand, and interact with their environment ? but also evolve in order to achieve human-like performance in activities requiring context-specific knowledge. This is far beyond the current state of the art and will remain so for many years to come. Therefore, many research efforts are required to make headway towards this vision. The strategic challenges are motivated by recent research in the field of intelligent systems ? robotics, neuroscience, artificial intelligence, and cognitive sciences. In recent years, a large community of researchers has begun to realize the importance of brain-body interaction for understanding intelligence and its central role in a wide range of processes including perception, object manipulation, movement, and high-level cognition. The research challenges include theoretical frameworks based on the notions of embodiment, the dynamical systems metaphor, complete agents rather than individual components, self-reconfiguration and self-repair, morphology and development. Progress in the theoretical underpinnings of embodied intelligence will have strong technological implications in areas including robotics, actuator technology, materials, self-assembling systems. Research in intelligent and cognitive systems is an interdisciplinary field requiring the cooperation of researchers from artificial intelligence, neuroscience (including cognitive and computational), psychology (cognitive and developmental), linguistics, developmental biology, robotics (and engineering in general), biomechanics, and dynamical systems. Software has become a central part of a rapidly growing range of applications, products and services from all sectors of economic activity. Systems in which software interacts with other software, systems, devices, sensors and with people are called software- intensive systems. Examples include large-scale heterogeneous systems, embedded systems for automotive and avionics applications, telecommunications, wireless ad hoc systems, business applications with an emphasis on web services. Our daily activities increasingly depend on complex software-intensive systems that are becoming ever more distributed, heterogeneous, decentralized and inter-dependent, and that are operating more and more in dynamic and often unpredictable environments. There exist different kinds of complexity in the development of software. Software systems grew larger, the focus shifted from the complexity of developing algorithms to the complexity structuring large systems, and then to the additional complexities in building distributed, concurrent systems. In the next ten to fifteen years we will have to face another level of complexity arising from the fact that systems have to operate in large, open and non-deterministic environments: the complexity of knowledge, interaction and adaptation. Instead of developing computer-oriented systems where people have to adapt to the computer we have to develop human- oriented systems into which computers integrate seamlessly. Also, the requirements for software quality will dramatically increase. But our current methods are not sufficient to deal with adaptive software in a dynamic environment, especially not for large systems with complex interactions. We need to develop practically useful and theoretically well founded principles, methods and tools for engineering future software-intensive systems. All the complex systems depend on software that controls the behavior of individual components and the interaction between components, and on software which interacts with other software, systems, devices, sensors and with people. In other words: they depend on software- intensive systems. The CISIS-2007 seeks original contributions in all relevant areas, including but not limited to the following topics. Topics of interest ====================== ? Agent Technology ? Human-Oriented Systems ? Evolving Systems ? Intelligent and Cognitive Systems and Applications ? Genetic Programming and Algorithms ? Fuzzy Logic and Fuzzy Systems ? Neuro-computing and Applications ? Knowledge-based Systems ? Dynamic Systems ? Parallel and Distributed Algorithms ? Databases and Data Mining ? Grid and P2P Infrastructures ? Data Intensive and Computing Intensive Applications ? Scheduling, Resource Discovery and Allocation ? JXTA-based Applications ? Large-scale Collaborative Problem Solving Environments ? Methodology and Practice of Semantic Grid and Web ? Web and Grid Service-based Applications ? Ubiquitous Computing Applications ? Pervasive Computing and Applications ? Multimedia Systems and Applications ? Human-Robots ? Embedded Systems ? Overlay Networks for P2P Systems ? Autonomous Systems ? Autonomic Computing ? Bio-inspired Systems and Applications ? Fault-Tolerant Systems ? Heterogeneous Networks ? Heterogeneous Wireless Networks ? Sensor Networks ? Ad Hoc Networks ? Sensor and Actor Networks ? High-Speed Networks ? Routing Algorithms ? Software QoS ? Adaptive Software-Intensive Systems ? Self-Modifying Software Systems ? Self-Designing and Self-Maintaining software Important Dates ================== ? Submission Deadline: November 30, 2006 ? Author Notification: January 10, 2007 ? Author Registration: January 21, 2007 ? Proceedings Version: January 21, 2007 ? Conference Dates: April 10-April13, 2007 Submission Guidelines ========================= Authors are invited to submit research and application papers following the IEEE Computer Society Proceedings Manuscripts style: two columns, single-spaced, including figures and references, using 10 fonts, and number each page. You can confirm the IEEE Computer Society Proceedings Author Guidelines at one of the following web pages: * http://www.ieee.org/portal/pages/pubs/transactions/stylesheets.html * or http://www.tinmith.net/tabletop2006/IEEE/Format/instruct.htm Submission papers are classified into 3 categorizes (1) full paper (8 pages), (2) short paper (5 pages), and (3) poster (2 pages) representing original, previously unpublished work. Submitted papers will be carefully evaluated based on originality, significance, technical soundness, and clarity of exposition. Contact author must provide the following information at the CISIS-2007 web site: paper title, authors' names, affiliations, postal address, phone, fax, and e-mail address of the author(s), about 200-250 word abstract, and about five keywords. Submission of a paper implies that should the paper be accepted, at least one of the authors will register and present the paper in the conference. Accepted papers will be given guidelines in preparing and submitting the final manuscript(s) together with the notification of acceptance. Proceedings of the CISIS-2007 conference will be published by IEEE Computer Society Press. Based on quality and referee reviews, some papers not suitable for acceptance as full paper will be accepted for presentation at CISIS-2007 in Poster category and will be also included in the IEEE Proceedings. The best papers selected by CISIS-2007 program committee out of papers accepted for presentation at CISIS-2007 will be further published in some International Journals. The submission site for CISIS-2007 paper is available at http://www.ares-conf.org/confdriver/?q=confdriver/papers/add If you have any difficulty in submitting the papers, please do not hesitate to send them to tho at ifs.tuwien.ac.at. Conference Chairpersons ============================ Leonard Barolli, Fukuoka Institute of Technology, Japan A Min Tjoa, Vienna University of Technology, Austria International Liaison Co-Chairs ================================= Makoto Takizawa, Tokyo Denki University, Japan Arjan Durresi, Louisiana State University, USA Publicity Chairs ===================== Nguyen Manh Tho, Vienna University of Technology, Austria Fatos Xhafa, Polytechnic University of Catalonia, Spain Publication Co-Chairs ======================== Yoshitaka Shibata, Iwate Prefectural University, Japan Roland Wagner, University of Linz, Austria Local Organizing Chairs ========================== Maria Schweikert, Vienna University of Technology, Austria Markus Klemen, Vienna University of Technology, Austria Program Committee ===================== ? Chandra Krintz, University of California, USA ? Mukesh Mohania, IBM India Research Laboratory, India ? Tomoya Enokido, Risho University, Japan ? Joan Manel Marqu?s, Open University of Catalonia, Spain ? Akio Koyama, Yamagata University, Japan ? Nguyen Manh Tho, Vienna University of Technology, Austria ? Fatos Xhafa, Polytechnic University of Catalonia, Spain ? Arjan Durresi, Louisiana State University, USA ? Naohiro Hayashibara, Tokyo Denki University, Japan ? Claudi Paniagua Maci, IBM GTS, Virtualization and Grid Computing EBO, Spain ? Irfan Awan, University of Bradford, UK ? Hui-huang Hsu, Tamkang University, Taiwan ? Jin Hwan Park, State University of New York New Paltz, USA ? Kuo-Ming Chao, Coventry University, UK ? Muhammed Younas, Oxford Brookes University, UK ? Bhed Bahadur Bista, Iwate Prefectural University, Japan ? Minoru Uehara, Toyo University, Japan ? Elhadi Shakshuki, Acadia Univiversity, Canada ? David Taniar, Monash University, Australia ? Nobuyoshi Sato, Toyo University, Japan ? Hiroaki Kikuchi, Tokai University, Japan ? Sajid Hussain, Acadia University, Canada ? Fumiaki Sato, Toho University, Japan ? Kaoru Sugita, Fukuoka Institute of Technology, Japan ? Timothy K. Shih, Tamkang University, Taiwan ? Markus Aleksy, University of Mannheim, Germany ? Takahiro Hara, Osaka University, Japan ? Takuo Suganuma, Tohoku University, Japan ? Wenny Rahayu, La Trobe University, Australia ? Ismail Khalil Ibrahim, Johannes Kepler University Linz, Austria ? Giuseppe De Marco, Fukuoka Institute of Technology, Japan ? G?nther Pernul, University of Regensburg, Germany ? Andrei Doncesku, University Paul Sabatier, France ? Lin Guan, Loughborough University, UK ? Frank Ball, Bournemouth University, UK ? Ahmed Al-Dubai, Napier University, UK ? Qiang Ni, Brunel University, UK ? Juan Jose Alcaraz Espin, Polytechnic University of Cartagena, Spain ? Winston Seah, Institute for Infocomm Research, Singapore ? Antonio Pescape, University of Napoli, Italy ? Leonid Kalinichenko, Russian Academy of Science, Russia ? Lawrence Y. Deng, St. John's and St.Mary's Institute of Technology, Taiwan ? Xiangen Hu, University of Memphis, USA ? Ching-Sheng Wang, Aletheia University, Taiwan ? Kuei-Ping Shih Tamkang University, Taiwan ? Been-Chian Chien, National University of Tainan, Taiwan ? Wen-Yang Lin, National University of Kaohsiung, Taiwan ? Vincent Lee, Monash University, Australia ? Michael Sheng, CSIRO ICT Centre, Australia ? Soraya Kouadri M., Oxford Brookes University, UK ? S.C. Cheung, Hong Kong University of Science and Technology (HKUST), Hong Kong ? Karl R.P.H. Leung, Hong Kong Institute of Vocational Education (Tsing Yi) HKIVE, Hong Kong ? Victor C.S. Lee, City University of Hong Kong, Hong Kong ? Henry Chan, Hong Kong Polytechnic University, Hong Kong ? Hon-Va Leong, Hong Kong Polytechnic University, Hong Kong ? Qing Lu, Hong Kong Polytechnic University, Hong Kong ? Thomas Grill, University of Linz, Austria ? Fabio Postiglione, University of Salerno, Italy ? Said Mirza, Advanced Institute of Science and Technology, Japan ? Ajith Abraham, Yonsei University, Korea ? Takuo Nakashima, Kyushu Tokai University, Japan For any further questions or inquiries please contact Conference Organizers: Conference Organizers: ========================= Leonard Barolli Department of Information and Communication Engineering Faculty of Information Engineering Fukuoka Institute of technology (FIT) 3-30-1 Wajiro-Higashi, Higashi-ku, Fukuoka 811-0295 Japan Email: barolli at fit.ac.jp A Min Tjoa Institute for Software Technology and Interactive Systems Vienna University of Technology, Austria Favoritenstrasse 9-11/188 A-1040 Vienna, Austria E-mail: tjoa at ifs.tuwien.ac.at Nguyen Manh Tho Institute for Software Technology and Interactive Systems Vienna University of Technology, Austria Favoritenstrasse 9-11/188 A-1040 Vienna, Austria E-mail: tho at ifs.tuwien.ac.at From Jeremy.Gibbons at comlab.ox.ac.uk Mon Oct 30 12:30:28 2006 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Mon, 30 Oct 2006 17:30:28 GMT Subject: [TYPES/announce] University of Oxford: Lectureships in Software Engineering Message-ID: <200610301730.k9UHUShZ019933@mercury.comlab.ox.ac.uk> UNIVERSITY OF OXFORD Software Engineering Programme Kellogg College THREE UNIVERSITY LECTURERSHIPS IN SOFTWARE ENGINEERING Applications are invited for three new University Lecturerships in Software Engineering. The successful applicants will join the staff of the University's Software Engineering Programme in teaching and researching the application of scientific principles to the development of software systems. The salary will be on a scale up to GBP50,589 per annum. An advanced degree in a related subject, proven teaching ability, and a strong research record - of international standing - are all essential requirements. Applications are particularly welcome from those with expertise in software and systems security, service-oriented architectures, or model-driven development. The appointments will be associated with fellowships at Kellogg College, Oxford and the appointees will be members of the Governing Body of the college. The closing date for applications is 27th November 2006. For further information, including full details of the application procedure and selection criteria, see http://www.softeng.ox.ac.uk/jobs/ From pmt6sbc at maths.leeds.ac.uk Tue Oct 31 05:12:10 2006 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Tue, 31 Oct 2006 10:12:10 +0000 (GMT) Subject: [TYPES/announce] CiE 2007 - First Call for Papers Message-ID: [apologies for multiple copies] ************************************************************ CiE 2007 http://www.mat.unisi.it/newsito/cie07.html Computability in Europe 2007: Computation and Logic in the Real World University of Siena Siena, 18-23 June 2007 CALL FOR PAPERS Deadline: JANUARY 12, 2007 CiE 2007 invites submissions from a broad range of basic and applied areas of computability related research. While submissions close to the conference theme of 'Computation and Logic in the Real World' are specially invited, CiE also very much welcomes fundamental research papers in computability and logic. Submissions in emergent areas, such as bioinformatics and natural and quantum computation, where they have a basic connection with computability, are particularly welcome. For a fuller list of conference topics see: http://www.amsta.leeds.ac.uk/~pmt6sbc/cie07.descr.html#themes IMPORTANT DATES: Submission of papers: Jan. 12, 2007 Notification of authors: Feb. 16, 2007 Deadline for final revisions: Mar. 9, 2007 The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF-format, max 10 pages) for presentation at CiE 2007: see the conference website for the online submission procedure. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. There will also be journal special issues: APAL, JLC, TCS-C, ToCS - to which full versions of selected submissions to CiE 2007 will be invited, in consultation with the Programme Committee and Special Session Organisers, to submit. INVITED SPEAKERS: Pieter Adriaans (Amsterdam) Kobi Benenson (Harvard) Anne Condon (Vancouver) Stephen Cook (Toronto) Yuri Ershov (Novosibirsk) Wolfgang Maass (Graz) Sophie Laplante (Paris) Anil Nerode (Cornell) Roger Penrose (Oxford) Michael Rathjen (Leeds) Dana Scott (Carnegie Mellon, tbc) Robert I. Soare (Chicago) Philip Welch (Bristol) PROGRAMME COMMITTEE: M. Agrawal (Kanpur) M. Arslanov (Kazan) G. Ausiello (Roma) A. Bauer (Ljubljana) A. Beckmann (Swansea) U. Berger (Swansea) A. Cantini (Firenze) B. Cooper (Leeds, co-chair) L. Crosilla (Firenze) J. Diaz (Barcelona) C. Dimitracopoulos (Athens) F. Ferreira (Lisbon) S. Goncharov (Novosibirsk) P. Gruenwald (Amsterdam) D. Harel (Rehovot) A. Hodges (Oxford) J. Kempe (Paris) G. Longo (Paris) B. Loewe (Amsterdam) J. Makowsky (Haifa) E. Mayordomo Camara (Zaragoza) W. Merkle (Heidelberg) F. Montagna (Siena) D. Normann (Oslo) T. Pheidas (Heraklion) G. Rozenberg (Leiden) G. Sambin (Padova) H. Schwichtenberg (Muenchen) W. Sieg (Carnegie Mellon) A. Sorbi (Siena, co-chair) I. Soskov (Sofia) P. van Emde Boas (Amsterdam) SPECIAL SESSIONS: * Doing without Turing Machines: Constructivism and Formal Topology * Approaches to Computational Learning * Real Computation * Computability and Mathematical Structure * Complexity of Algorithms and Proofs * Logic and New Paradigms of Computability * Computational Foundations of Physics and Biology CONFIRMED SPONSORS OF CiE 2007: AILA (Associazione Italiana di Logica e Applicazioni), EATCS (European Association for Theoretical Computer Science), ASL (Association for Symbolic Logic), EACSL (European Association for Computer Science Logic) and FoLLI (The Association of Logic, Language and Information). CiE 2007 will be co-located with CCA 2007, the annual CCA (Computability and Complexity in Analysis) Conference (Siena, College Santa Chiara, June 16-18, 2007): http://cca-net.de/cca2007/ ================================================================ Andrea Sorbi Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari" Pian dei Mantellini 44 53100 Siena, Italy Phone: 0039-0577-233727 Fax: 0039-0577-233730 From herbert at doc.ic.ac.uk Tue Oct 31 06:43:52 2006 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Tue, 31 Oct 2006 11:43:52 +0000 (GMT) Subject: [TYPES/announce] Coordination'07 - Call for Papers Message-ID: +---------------------------------------------------------------------+ | First CALL FOR PAPERS | | | | COORDINATION 2007 | | 9th International Conference on Coordination Models and Languages | | | | - New directions in Coordination - | | | | Paphos, Cyprus 6 - 8 June 2007 | | | +---------------------------------------------------------------------+ | Paper submission: 27 January 2007 | | Author notification: 7 March 2007 | | Camera-ready copy: 26 March 2007 | +---------------------------------------------------------------------+ | http://www.discotec07.cs.ucy.ac.cy | +---------------------------------------------------------------------+ Modern information systems rely increasingly on combining concurrent, distributed, real-time, reconfigurable and heterogeneous components. New models, architectures, languages, and verification techniques are necessary to cope with the complexity induced by the demands of today's software development. COORDINATION aims to explore the spectrum of languages, middleware, services, and algorithms that separate behavior from interaction, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Topics of interest: - PROGRAMMING LANGUAGE techniques that support orchestration and control of distributed and concurrent interaction. - MIDDLEWARE ARCHITECTURES: shared spaces, publish-subscribe, event-based. - DYNAMIC SOFTWARE ARCHITECTURES: software composition and scripting languages, dynamic software evolution and update, configuration and deployment languages. - DEPENDABLE, RESOURCE-AWARE, REAL-TIME and EMBEDDED system coordination. - Models and Foundations: component composition, verification, management of security and dynamic aspects of coordination. - WEB SERVICES: Service-oriented Architectures, Workflow Systems. - Programming abstractions for decentralized distributed systems such as P2P, mobile ad-hoc and sensor networks. - TYPE SYSTEMS and SPECIFICATION LANGUAGES appropriate for coordination of concurrent systems. - CASE STUDIES from E-Commerce, Factory Automation, Collaboration, Command and Control, or other systems. PROGRAM COMMITTEE Nadia Busi University of Bologna, IT Vinny Cahill Trinity, IE Paolo Ciancarini University of Bologna, IT William Cook University of Texas, Austin, US John Field IBM, US Chris Gill Washington University, US Aniruddha Gokhale Vanderbilt, US Chris Hankin Imperial College, UK Mike Hicks University of Maryland, US Valerie Issarny INRIA, FR Christoph Kirsch University of Salzburg, AT Doug Lea SUNY Oswego, US Toby Lehman IBM, US Alberto Montresor University of Trento, IT Amy L. Murphy ITC-IRST, IT & U. of Lugano, CH (Co-chair) Oscar Nierstrasz University of Bern, CH Anna Philippou University of Cyprus, GR Ernesto Pimentel University of Malaga, ES Giovanni Russello Imperial College, UK Jan Vitek Purdue University, US (Co-chair) Jim Waldo SUN Microsystems, US Herbert Wiklicky Imperial College, UK PROCEEDINGS Proceedings of previous editions of this conference were published by Springer, in the Lecture Notes in Computer Science (LNCS) series and are available as LNCS volumes 1061, 1282, 1594, 1906, 2315, 2949, 3454 and 4038. Our intention is to continue this series. Selected papers from COORDINATION will be invited to a special issue of The Science of Computer Programming journal. A best student paper award will be given at the conference. To be eligible for consideration indicate on your submission if one or more of the paper's authors are students. SUBMISSION INSTRUCTIONS Authors are invited to submit full papers electronically in PDF before 27 January 2007. Further instructions are available from the conference web site. Submissions must be formatted according to the LNCS guidelines (see http://www.springer.de/comp/lncs/authors.html) and must not exceed 17 pages in length (including all supplementary material). Papers that are not in the requested format or exceed the mandated length will be rejected without going through the review process. Simultaneous or similar submissions to other conferences or journals are not allowed. IMPORTANT DATES * Submission of papers: 27 January 2007 * Notification of acceptance: 7 March 2007 * Conference: 6-8 June 2007 From R.Bornat at mdx.ac.uk Tue Oct 31 10:22:17 2006 From: R.Bornat at mdx.ac.uk (Richard Bornat) Date: Tue, 31 Oct 2006 15:22:17 +0000 Subject: [TYPES/announce] postdoc position at Middlesex, UK Message-ID: <4088C7D0-1AD1-4023-AB06-8FB4C0975897@mdx.ac.uk> Following the departure of Matthew Parkinson to an Academy of Engineering Fellowship, I have a postdoc vacancy. The official advertisement follows. Really, the project is to do interesting stuff with concurrency in separation logic, possibly including mechanical verification, certainly including puzzling over hard separation logic proofs. Richard Bornat > MIDDLESEX UNIVERSITY > > School of > Computing Science > > Researcher in Concurrency > ?24,974 - ?31,003 > > 20 months fixed term contract > to 31 April 2008 > > An opportunity to research into the application of program > verification techniques, specifically separation logo, to > concurrent programs, including non-blocking concurrency. > > You should: > ? have a good honours degree in Computing Science and have > completed > postgraduate study beyond Masters? level > ? possess demonstrable research capability > ? be competent in proof in Hoare logic and/or application of > logic to > program specification and proof > ? have programming skills in a wide range of languages including C > ? preferably have a PhD in Computer Science completed or near > submission. > > The post is based at the University?s Hendon campus, although > regular travel to meetings with partners in East London and > Cambridge, and occasional participation in national and > international conferences, is expected. > > For an informal discussion about this post please contact Professor > Richard Bornat via R.Bornat at mdx.ac.uk > > To apply please download an application pack from www.mdx.ac.uk/ > jobs or contact us requesting an application pack quoting reference > COM190J. > > Email recruit1 at mdx.ac.uk ? Telephone 020 8411 6110 > > Recruitment Office, Middlesex University, > North London Business Park, Oakleigh Road South, London N11 1QS. > > Closing date: 14 November 2006. > From ian.mackie at kcl.ac.uk Tue Oct 31 18:27:16 2006 From: ian.mackie at kcl.ac.uk (Ian Mackie) Date: Tue, 31 Oct 2006 23:27:16 +0000 Subject: [TYPES/announce] CFP: TERMGRAPH 2007 Message-ID: <4547DBD4.20608@kcl.ac.uk> ====================================================================== Call for Papers TERMGRAPH 2007 Workshop on Computing with Terms and Graphs http://www.termgraph.org.uk Braga, Portugal 31 March 2007 A satellite event of ETAPS 2007 ======================================================================= The advantage of computing with graphs rather than terms is that common subexpressions can be shared, improving the efficiency of computations in space and time. Sharing is ubiquitous in implementations of programming languages: many functional, logic, object-oriented and concurrent calculi are implemented using term graphs. Research in term and graph rewriting ranges from theoretical questions to practical implementation issues. Different research areas include: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the use of graphical frameworks such as interaction nets and sharing graphs (optimal reduction), rewrite calculi for the semantics and analysis of functional programs, graph reduction implementations of programming languages, graphical calculi modelling concurrent and mobile computations, object-oriented systems, graphs as a model of biological or chemical abstract machines, and automated reasoning and symbolic computation systems working on shared structures. The aim of this workshop is to bring together researchers working in these different domains and 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 term and graph rewriting. TERMGRAPH 2007 will be a one-day satellite event of ETAPS 2007, which will take place in Braga, Portugal. The first TERMGRAPH workshop took place in Barcelona in 2002, the second in Rome in 2004, and the third in Vienna in 2006. Topics ------ Topics of interest include all aspects of term graphs and sharing of common subexpressions in rewriting, programming, automated reasoning and symbolic computation. This includes (but is not limited to): term rewriting, graph transformation, programming languages, models of computation, graph-based languages, semantics and implementation of programming languages, compiler construction, pattern recognition, databases, bioinformatics, and system descriptions. Submissions and Publication --------------------------- Authors are invited to submit either a short paper (5-7 pages) or a complete paper (12 pages) by e-mail to mackie at lix.polytechnique.fr by 29 December, 2006. Preliminary proceedings will be available at the workshop. Submissions should be in PostScript or PDF format, using ENTCS style files. Important Dates --------------- Submission deadline: 29 December, 2006 Notification: 1 February, 2007 Pre-proceedings version due: 9 March, 2007 Workshop: 31 March, 2007 Programme Committee ------------------- Zena Ariola, University of Oregon, USA Andrea Corradini, University of Pisa, Italy Maribel Fernandez, King's College London, UK Bernhard Gramlich, Vienna University of Technology, Austria Annegret Habel, University of Oldenburg, Germany Claude Kirchner, INRIA & LORIA, France Jean-Jacques Levy, INRIA, France Ian Mackie, King's College London & Ecole polytechnique, France (co-chair) Aart Middeldorp, University of Innsbruck, Austria Ugo Montanari, University of Pisa, Italy Jorge Sousa Pinto, University of Minho, Braga, Portugal Detlef Plump, University of York, UK (co-chair) Arend Rensink, University of Twente, NL From david.baelde at gmail.com Wed Nov 1 07:52:39 2006 From: david.baelde at gmail.com (David Baelde) Date: Wed, 1 Nov 2006 13:52:39 +0100 Subject: [TYPES/announce] Bedwyr 1.0 Message-ID: <53c655920611010452k2719a233kf930613c69faa0ca@mail.gmail.com> Dear colleagues, We would like to announce the first release of Bedwyr, an extended logic programming language that allows model-checking directly on syntactic expressions possibly containing bindings. Bedwyr allows simple and declarative relational specifications of various systems, and provides a simple approach to reason on them. Examples of applications include type systems, process calculi, games, logics, etc. Bedwyr makes use of a simple form of tabling to support proof search for inductive and co-inductive specifications, typically allowing bisimulation checking for non-terminating processes. You will find a general description of Bedwyr below this message. More details can be found on Bedwyr website: http://slimmer.gforge.inria.fr/bedwyr/ Sincerely, Bedwyr developers %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Bedwyr A proof-search approach to model checking http://slimmer.gforge.inria.fr/bedwyr/ Bedwyr is a programming framework written in OCaml that facilitates natural and perspicuous presentations of rule oriented computations over syntactic expressions and that is capable of model checking based reasoning over such descriptions. Bedwyr is in spirit a generalization of logic programming. However, it embodies two important recent observations about proof search: (1) It is possible to formalize both finite success and finite failure in a sequent calculus; proof search in such a proof system can capture both may and must behavior in operational semantics specifications. (2) Higher-order abstract syntax can be supported at a logical level by using term-level lambda-binders, the nabla-quantifier, higher-order pattern unification, and explicit substitutions; these features allow reasoning directly on expressions containing bound variables. The distribution of Bedwyr includes illustrative applications to the finite pi-calculus (operational semantics, bisimulation, trace analyses and modal logics), the spi-calculus (operational semantics), value-passing CCS, the lambda-calculus, winning strategies for games, and various other model checking problems. These examples should also show the ease with which a new rule-based system and particular questions about its properties can be be programmed in Bedwyr. Because of this characteristic, we believe that the system can be of use to people interested in the broad area of reasoning about computer systems. The present distribution of Bedwyr has been developed by the following individuals: David Baelde & Dale Miller (INRIA & LIX/Ecole Polytechnique) Andrew Gacek & Gopalan Nadathur (University of Minneapolis) Alwen Tiu (Australian National University and NICTA). In the spirit of an open-source project, we welcome contributions in the form of example applications and also new features from others. From tho at ifs.tuwien.ac.at Mon Nov 6 11:01:01 2006 From: tho at ifs.tuwien.ac.at (Nguyen Manh Tho) Date: Mon, 6 Nov 2006 17:01:01 +0100 Subject: [TYPES/announce] ARES 2007 - Call for papers and workshops papers - Submission Deadline approaches in 2 weeks: 19-11-2006 Message-ID: An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061106/743737b4/attachment.htm From skalka at cs.uvm.edu Mon Nov 6 14:16:36 2006 From: skalka at cs.uvm.edu (Christian Skalka) Date: Mon, 06 Nov 2006 14:16:36 -0500 Subject: [TYPES/announce] PhD Position in Computer Science at UVM Message-ID: <008f01c701d8$17c1f7a0$2802a8c0@Pers> ================================= PhD POSITION IN COMPUTER SCIENCE FOUNDATIONS OF COMPUTER SECURITY The University of Vermont, USA ================================= Location: Department of Computer Science, The University of Vermont (UVM), Burlington, Vermont, USA. http://www.cs.uvm.edu http://www.uvm.edu http://www.ci.burlington.vt.us Description: We are seeking qualified applicants for doctoral research opportunities in the foundations of computer security. Our current research has two main thrusts. The first is type-and-effect analysis for enforcing temporal safety properties in software as a form of programming language based security. The second is the use of formalisms and programming logics to specify and implement distributed trust management (authorization) systems for applications such as web services. More information about these projects and associated publications is available online: http://www.cs.uvm.edu/~skalka/skalka-pubs/skalka-projects.html Research will be conducted in the context of larger projects being carried out by the Distributed Systems Group: http://www.cs.uvm.edu/research/distrsys This position is funded by a grant from the Department of Defense (DoD), Air Force Office of Scientific Research (AFOSR). Inquiries: Please direct questions to Christian Skalka, skalka at cs.uvm.edu, http://www.cs.uvm.edu/~skalka. To Apply: Information about the UVM Computer Science PhD Program, including information about applying, is available on the web: http://www.cs.uvm.edu/gradinfo/PhD-guide.shtml The deadline for applications to start in Fall 2007 is February 1, 2007. ============================== Christian Skalka Assistant Professor Department of Computer Science University of Vermont http://www.cs.uvm.edu/~skalka ============================== From rvg at cs.stanford.edu Fri Nov 10 21:44:03 2006 From: rvg at cs.stanford.edu (Rob van Glabbeek) Date: Fri, 10 Nov 2006 18:44:03 -0800 (PST) Subject: [TYPES/announce] CfP: Special issue I&C on SOS Message-ID: <200611110244.kAB2i3X04131@kilby.Stanford.EDU> Call for Papers: Special Issue of Information & Computation on Structural Operational Semantics Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. Moreover, it is becoming a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalisation of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This special issue aims at documenting state-of-the-art research, new developments and directions for future investigation in the field of structural operational semantics. Specific topics of interest include (but are not limited to): * programming languages * process algebras * higher-order formalisms * rule formats for operational specifications * meaning of operational specifications * comparisons between denotational, axiomatic and operational semantics * compositionality of modal logics with respect to operational specifications * congruence with respect to behavioural equivalences * conservative extensions * derivation of proof rules from operational specifications * software tools that automate, or are based on, SOS. Papers reporting on applications of SOS to software engineering and other areas of computer science are welcome. This special issue is an outgrowth of the series of SOS workshops, which started in 2004, and serves in part as a opportunity to publish the full versions of the best papers presented at SOS 2006. However, papers that were not presented at SOS 2006 are equally welcome, and all submissions will be refereed and subjected to the same quality criteria, meeting the standards of Information and Computation. Papers submitted to the special issue must contain original material that has not previously been published, and parallel submission for publication elsewhere is not allowed. However, an extended abstract or short version of the paper may be submitted for presentation at the SOS 2007 workshop, which will take place before the publication of the special issue. PAPER SUBMISSION: We solicit unpublished papers reporting on original research on the general theme of SOS. Papers should take the form of a dvi, postscript or pdf file. We recommend following Elsevier's instructions at http://authors.elsevier.com/JournalDetail.html?PubID=622844 and using LaTeX2e with documentclass elsart. IMPORTANT DATES: * Submission of tentative title and abstract: 15 December 2006 * Submission of full paper: 15 February 2006 CONTACT and submission address: sos2006 at cs.stanford.edu EDITORS of this special issue: Rob van Glabbeek National ICT Australia Locked Bag 6016 University of New South Wales Sydney, NSW 1466 Australia Peter D. Mosses Department of Computer Science Swansea University Singleton Park Swansea SA2 8PP United Kingdom From tho at ifs.tuwien.ac.at Mon Nov 13 03:09:01 2006 From: tho at ifs.tuwien.ac.at (Nguyen Manh Tho) Date: Mon, 13 Nov 2006 09:09:01 +0100 Subject: [TYPES/announce] ARES 2007 - Submission Deadline Extension: 30-11-2006 (firm deadline) Message-ID: Due to numerous requests, the submission deadline of ARES 2007 conference was extended to Nov. 30. It is a firm deadline and could not be extended anymore. Apologies for multiple copies due to cross postings. Please send to interested colleagues and students. Call for Papers +--------------------------------------------------------------------------------------------------------+ The Second International Conference on Availability, Reliability and Security (AReS) ARES 2007 - "The International Security and Dependability Conference" April 10th ? April 13th,2007 Vienna University of Technology, Austria http://www.ares-conf.org http://www.ares-conference.eu +-------------------------------------------------------------------------------------------------------+ Conference ---------------- The 1st International Conference on Availability, Reliability and Security conference (ARES 2006) has been successfully organized in Vienna, AUSTRIA from April 20 to April 22, 2006 by the Technical University of Vienna in cooperation with the European Network and Security Agency (ENISA). We have attracted 250 participants for this conference with its 3 keynotes speakers and its 9 workshops held in conjunction with. In continuation of the successful 1st ARES conference, The Second International Conference on Availability, Reliability and Security (?ARES 2007 ? The International Security and Dependability Conference?) will bring together researchers and practitioners in the area of IT-Security and Dependability. ARES 2007 will highlight the various aspects of security ? with special focus on secure internet solutions, trusted computing, digital forensics, privacy and organizational security issues. ARES 2007 aims at a full and detailed discussion of the research issues of security as an integrative concept that covers amongst others availability, safety, confidentiality, integrity, maintainability and security in the different fields of applications. Important Dates ---------------------- * Submission Deadline: November, 30th 2006 (firm deadline) * Author Notification: January, 7th 2007 * Author Registration: January, 21st 2007 * Proceedings Version: January, 21st 2007 Workshops -------------- In conjunction with the ARES 2007 conference, a number of workshops will be organized. We are very indebted for the effort of workshop's organizers and workshop's PC members. Proceedings of the ARES 2007 workshops will be published by IEEE Computer Society Press. * Workshop 1: Second International Workshop ?Dependability Aspects on Data WArehousing and Mining applications? (DAWAM 2007), Jimmy Huang, York University, Canada + Josef Schiefer, Senactive IT-Dienstleistungs GmbH, Austria + Nguyen Manh Tho, Vienna University of Technology, Austria .DAWAM 2007 http://dawam.ares-conference.eu/ Submission Deadline: December, 17th 2006 * Workshop 2: Second Workshop on ?Dependability and Security in e-Government? (DeSeGov 2007), A Min Tjoa, Vienna University of Technology, Austria + Erich Schweighofer, University of Vienna, Austria + Nguyen Manh Tho, Vienna University of Technology, Austria DeSeGov 2007 http://desegov.ares-conference.eu/ Submission Deadline: December, 15th 2006 * Workshop 3: Workshop on Foundations of Fault-tolerant Distributed Computing (FOFDC 2007), Wilhelm Hasselbring, University of Oldenburg, Germany + Matthias Rohr, University of Oldenburg, Germany + Christian Storm, University of Oldenburg, Germany + Oliver Theel, University of Oldenburg, Germany + Timo Warns, University of Oldenburg, Germany. FOFDC 2007 http://trustsoft.uni-oldenburg.de/fofdc07/ Submission Deadline: December, 1st 2006 * Workshop 4: "Secure Software Engineering" (SecSE 2007), Torbj?rn Skramstad, Norwegian University of Science and technology (NTNU) + Lillian R?stad, Norwegian University of Science and technology (NTNU) + Martin Gilje Jaatun, SINTEF ICT, Norway. SecSE 2007 http://secse.ares-conference.eu/ Submission Deadline: December, 17th 2006 * Workshop 5: Workshop on "Event-Based IT Systems", Modeling, Designing, and Testing Correct, Secure, and Dependable Event-Based System, Stefan Biffl, Vienna University of Technology + Eva K?hn, Vienna University of Technology + Alexander Schatten, Vienna Univeristy of Techology EBITS http://ebits.ares-conference.eu/ Submission Deadline: November, 19th 2006 * Workshop 6: "Distributed Healthcare Availability, Reliability and Security" (DIHARES 2007), Thomas Clark, Complete Cardiology Services Ltd, USA. DIHARES 2007 http://dihares.ares-conference.eu/ Submission Deadline: November, 17th, 2006 * Workshop 7: "First International Workshop on Advances in Information Security" (WAIS 2007), Leonard Barolli, Fukuoka Institute of Technology, Japan + Arjan Durresi, Louisiana State University, USA + Hiroaki Kikuchi, Tokai university, Japan.WAIS 2007 http://www.csc.lsu.edu/~durresi/wais2007/index.html Submission Deadline: December 1st, 2006 * Workshop 8: Second International Workshop on Bioinformatics and Security (BIOS 2007), Hochreiter Sepp, University of Linz, Bioinf, Austria + K?ng Josef, University of Linz, FAW Austria + Wagner Roland, University of Linz, FAW Austria. BIOS 2007 http://bios.ares-conference.eu/ Submission Deadline: November 20, 2006 * Workshop 9: Second International Workshop on Security and E- Learning, Edgar Weippl, Secure Business Austria. SEL 2007 http://sel.ares-conference.eu/ Submission Deadline: November 19, 2006 * Workshop 10: Second Workshop on Information Security Risk Management (ISRM), Professor Dr. D. Karagiannis, University of Vienna, Austria + Dr. L. Marinos, ENISA, Greece . ISRM http://www.ares-conference.eu/ares2006/www.ares-conf.org/index47da.html?q=isrm * Workshop 11: The First International Workshop on Spoofing, Digital Forensics and Open Source Tools (SDFOST), Judie Mulholland, Florida Cybersecurity Institute, USA. SDFOST http://www.ares-conference.eu/conf/index.php?option=com_content&task=view&id=33&Itemid=41 Submission Deadline: November 20, 2006 Topics of interest include, but are not limited to: ------------------------------------------------------------ * Process based Security Models and Methods * Autonomous Computing * Authorization and Authentication * Availability and Reliability * Common Criteria Protocol * Cost/Benefit Analysis * Cryptographic protocols * Dependability Aspects for Special Applications (e.g. ERP-Systems, Logistics) * Dependability Aspects of Electronic Government (e-Government) * Dependability administration * Dependability in Open Source Software * Designing Business Models with security requirements * Digital Forensics * E-Commerce Dependability * Failure Prevention * IPR of Security Technology * Incident Response and Prevention * Information Flow Control * Internet Dependability * Interoperability aspects * Intrusion Detection and Fraud Detection * Legal issues * Mobile Security * Network Security * Privacy-enhancing technologies * RFID Security and Privacy * Risk planning, analysis & awareness * Safety Critical Systems * Secure Enterprise Architectures * Security Issues for Ubiquitous Systems * Security and Privacy in E-Health * Security and Trust Management in P2P and Grid applications * Security and privacy issues for sensor networks, wireless/mobile devices and applications * Security as Quality of Service * Security in Distributed Systems / Distributed Databases * Security in Electronic Payments * Security in Electronic Voting * Software Engineering of Dependable Systems * Software Security * Standards, Guidelines and Certification * Survivability of Computing Systems * Temporal Aspects of Dependability * Trusted Computing * Tools for Dependable System Design and Evaluation * Trust Models and Trust Management * VOIP/Wireless Security Submission Guidelines ------------------------------- Authors are invited to submit research and application papers following the IEEE Computer Society Proceedings Manuscripts style: two columns, single-spaced, including figures and references, using 10 fonts, and number each page. You can confirm the IEEE Computer Society Proceedings Author Guidelines at the following web page: URL: http://computer.org/cspress/instruct.htm The Web site for paper registration and electronic submission is available at: http://www.ares-conf.org/confdriver/?q=confdriver/papers/add Please refer to ARES website (http://www.ares-conf.org or http://www.ares-conference.eu) for update information. If you have any difficluty in submitting the papers, please do not hesitate to send them to tho at ifs.tuwien.ac.at Honorary Co-Chairs --------------------------- Norman Revell, Middlesex University, United Kingdom Roland Wagner, University of Linz, Austria General Co-Chairs ------------------------ Guenther Pernul, University of Regensburg, Germany Makoto Takizawa, Tokyo Denki University, Japan Program Co-Chairs ------------------------ Gerald Quirchmayr, University of Southern Australia, Australia A Min Tjoa, Vienna University of Technology, Austria Workshops Co-Chairs --------------------------- Nguyen Manh Tho, Vienna University of Technology, Austria Abdelkader Hameurlain, University of Toulouse, France Leonard Barolli, Fukuoka Institute of Technology (FIT), Japan International Liaison Co-Chairs --------------------------------------- Maria Wimmer, University of Koblenz-Landau, Germany Charles Shoniregun, University of East London, United Kingdom Publicity Chair ------------------ Vladimir Marik, Czech Technical University, Czech Republic Publication Chair --------------------- Monika Lanzenberger, Norwegian University of Science and Technology, Trondheim, Norway Local Organizing Chairs ------------------------------ Maria Schweikert, Vienna University of Technology, Austria Markus Klemen, Vienna University of Technology, Austria Programme Committee ------------------------------ Jemal H. Abawajy, Deakin University, Australia Karl Aberer, EPFL, Switzerland Abiola Abimbola, Napier University, UK Rafael Accorsi, University of Freiburg, Germany Alessandro Acquisti, Carnegie Mellon University, USA Andre Adelsbach, Telindus PSF S.A., Luxembourg Vasilis Aggelis, PIRAEUS Bank (WINBANK), Greece John Andrews, Loughborough, University, UK Michael Backes, Saarland University, Germany Leonard Barolli, Fukuoka Institute of Technology (FIT), Japan Lisa Bartlett, Loughborough University, UK Massimo Bartoletti, Universita' di Pisa, Italy Darcy G. Benoit, Acadia University, Wolfville, Canada Helmut Berger, E-Commerce Competence Center - EC3, Austria Bharat Bhargava, Purdue University, USA Christophe Blanchet, CNRS IBCP, France Alexander B?hm, University of Mannheim, Germany Stephane Bressan, National University of Singapore, Singapore Luciano Burgazzi, ENEA, Italy Kevin Butler, Pennsylvania State University, USA Jesper Buus Nielsen , University of Aarhus, Denmark Catharina Candolin, The Finnish Defence Forces. Finland Jiannong Cao, Hong Kong Polytechnic University, Hongkong Jordi Castell?-Roca, Rovira i Virgili University of Tarragona, Spain David Chadwick, University of Kent, UK Surendar Chandra, University of Notre Dame, USA Guihai Chen, Nanjing University, China Simon Christophe, Nancy University, France Soon-Ae Chun, City University of New York, USA Nathan Clarke, University of Plymouth, UK Joey Coleman, University of Newcastle upon Tyne, UK Gao Cong, University of Edinburgh, UK Ricardo Corin, INRIA-MSR & University of Twente, The Netherlands George Davida, University of Wisconsinat Milwaukee, USA Robert H. Deng , Singapore Management University, Singapore Jochen Dinger, Universit?t Karlsruhe (TH), Germany Lucia Draque Penso, University of Mannheim, Germany Schahram Dustdar, Vienna University of Technology, Austria Christian Engelmann, Oak Ridge National Laboratory, USA Yung-Chin Fang, Dell Inc., USA Hannes Federrath, University of Regensburg, Germany Pascal Felber, Universit? de Neuch?tel, Switzerland Elena Ferrari, University of Insubria, Italy Sergio Flesca, DEIS ? University of Calabria, Italy Vincenzo De Florio, University of Antwerp, Belgium Vladimir Fomichov, K.E. Tsiolkovsky Russian State Technological University, Russia Jordi Forn?, Technincal Universtiy of Catalonia, Spain Huirong Fu, Oakland University, MI, USA Steven Furnell, University of Plymouth, UK Javier Garcia-Villalba, Complutense University of Madrid, Spain Matthew Gebski, University of New South Wales, Australia Karl Goeschka, Vienna University of Technology, Austria Swapna S. Gokhale, University of Connecticut, USA Marcin Gorawski, Silesian University of Technology, Poland Stephan Gro?, Technische Universit?t Dresde, Germany Daniel Grosu, Wayne State University, USA Michael Grottke, Duke University, USA Le Gruenwald, University of Oklahoma, USA Qijun Gu, Texas State University, USA Yong Guan, Iowa State University, USA Ibrahim Haddad, Open Source Development Labs, USA Abdelkader Hameurlain, Paul Sabatier University, France Marit Hansen, Independent Centre for Privacy Protection, USA Naohiro Hayashibara, Tokyo Denki University, Japan Xubin (Ben) He, Tennessee Technological University, USA Yanxiang He, Wuhan University, China Rattikorn Hewett, Texas Tech University, USA Chin-Tser Huang, University of South Carolina, USA Jimmy Huang, York University, Canada Thomas Jensen, IRISA/CNRS, France Zhen Jiang, West Chester University, USA Hai Jin, Huazhong University of Science and Technology, China Oliver Jorns, ftw. Forschungszentrum Telekommunikation Wien, Austria Audun Josang, School of Software Engineering and Data Communications, Australia Jan Jurjens, Munich University of Technology, Germany and Open University, UK Holger Kenn, University of Bremen, Germany Dogan Kesdogan, RWTH Aachen, Germany Brian King, Indiana University Purdue University Indianapolis, USA Ted Krovetz, California State University, USA Raphael Kunis, Chemnitz University of Technology, Germany Helmut Kurth, Atsec Information Security, USA Marc Lacoste, France T?l?com R&D, France Kwok-Yan Lam, Tsinghua University, China Chokchai Box Leangsuksun, Louisiana Tech University, USA Yih-Jiun Lee, Department of Information Management, CTU, Taiwan Chin-Laung Lei, National Taiwan University, China Philippe Leray, INSA (National Institute of Applied Sciences) of Rouen, France Jun Li, University of Oregon, USA Sam Lightstone, IBM Canada Ltd., Canada Chae-Hoon Lim, Sejong University, Korea Ching Lin, Macquarie University, Australia Man Lin, St. Francis Xavier University, Canada Alex Zhaoyu Liu, University of North Carolina at Charlotte, USA Tong Liu, Dell Inc, USA Hua Liu , Xerox labs, USA Javier Lopez, University of Malaga, Spain Sanglu Lu, Nanjing University, China Jianhua Ma, Hosei University, Japan Qiang Ma, NEC, Japan Josef Makolm, Federal Ministry of Finance, Austria Carsten Maple, University of Luton, UK Keith Martin , University of London, UK Fabio Martinelli, National Research Council - C.N.R, Italy BeniaminoDi Martino, Second University of Naples, Italy Santiago Melia, University of Alicante, Spain Nasrullah Memon, Aalborg University Esbjerg, Denmark Geyong Min, University of Bradford, UK George Mohay, Queensland University of Technology, Australia Marina Mongiello, Technical University of Bari, Italy Stefania Montani, Universita' del Piemonte Orientale, Italy Yi Mu, University of Wollongong, Australia Junghyun Nam, Sungkyunkwan University, Korea Priya Narasimhan, Carnegie Mellon University, USA Tho Manh Nguyen, Vienna University of Technology, Austria Jesper Nielsen, University of ?rhus, Denmark Thomas Nowey, University of Regensburg, Germany Tomas Olovsson, Chalmers University of Technology, Sweden Hong Ong, Oak Ridge National Laboratory, USA Maria Papadaki, University of Plymouth, UK Manish Parashar, Rutgers University, USA Fernando Pedone, University of Lugano, Switzerland MariaS. Perez, UPM, Spain G?nther Pernul, University of Regensburg, Germany Rob Peters, University of Amsterdam, The Neitherland Thomas Phan, IBM Research, USA Mario Piattini, University of Castilla-La Mancha, Spain Makan Pourzandi, Ericsson Canada, Canada Christopher Price, University of Wales Aberystwyth, UK Jean-Jacques Quisquater, Universite catholique de Louvain, Belgium Wenny Rahayu, La Trobe University, Australia Indrajit Ray, Colorado State University, USA Domenico Rosaci, University "Mediterranea" of Reggio Calabria, Italy Heiko Rossnagel, Johann Wolfgang Goethe University Frankfurt, Germany Bimal Roy, Indian Statistical Institute, India Kenji Saito, Keio University, Japan Kouichi Sakurai, Kyushu University, Japan BiplabK. Sarker , University of New Brunswick, Fredericton, Canada Ingrid Schaum?ller-Bichl, FH O? Campus Hagenberg, Austria Stephen L. Scott, Oak Ridge National Laboratory - USA Dharmaraja Selamuthu, Indian Institute of Technology Delhi, India Tony Shan, Wachovia Bank, USA Thomas Shrimpton, Portland State University, USA Richard Sinnott, University of Glasgow, UK Amund Skavhaug, Norwegian University of Science and Technology, Norway Agusti Solanas, Rovira i Virgili University, Spain Alexander Speirs, University of Newcastle upon Tyne, UK Katarina Stanoevska-Slabeva, University St. Gallen, Switzerland Ketil St?len, SINTEF & University of Oslo, Norway Aaron Striegel, University of Notre Dame, USA Peter Struss, Munich University of Technology, Germany Tsuyoshi Takagi, Future University - Hakodate, Japan Makoto Takizawa, Tokyo Denki University, Japan Oliver Theel, University of Oldenburg, Germany Bj?rn Thuresson, KTH Computer Science and Communication, Sweden A Min Tjoa, Vienna University of Technology, Austria Kishor Trivedi, Duke University, USA Juan Trujillo, University of Alicante, Spain Alexander W. Tsow, Indiana University, USA Tomas Uribe, SRI International, USA Kalyan Vaidyanathan, Sun Microsystems, USA Luca Vigano, ETH Zurich, Switzerland Umberto Villano, Universita' del Sannio, Italy Melanie Volkamer, DFKI - German Research Center for Artificial Intelligence, Germany Michael Waidner, IBM Software Group, Switzerland Carine Webber, Universidade de Caxias do Sul, Brazil Edgar Weippl, Vienna University of Technology, Austria Robert Willison, Copenhagen Business School, Denmark Maria Wimmer, University of Koblenz-Landau, Germany Matthew Wright, University of Texas at Arlington, USA Qinghan Xiao , Defence R&D Canada, Canada Liudong Xing, University of Massachusetts, USA Cheng-Zhong Xu, Wayne State University, USA Mariemma.I. Yag?e, University of Malaga, Spain Jeff Yan, Newcastle University, UK Laurence Yang, St. Francis Xavier University, Canada Alec Yasinsac, Florida State University, USA George Yee, National Research Council, Canada Sung-Ming Yen, National Central University, Taiwan Xun Yi, Victoria University, USA Meng Yu, Monmouth University, USA William Yurcik, University of Illinois, USA Nicola Zannone, University of Trento, Italy Jianhong Zhang, North China University of Technology, China Liqiang Zhang, Indiana University South Bend, USA Jianying Zhou, Institute for Infocomm Research, Singapore Xudong Zhu, Alcatel shangHai Bell Co. LTD., China Enrico Zio, Polytechnic of Milan, Italy From eernst at daimi.au.dk Mon Nov 13 17:49:44 2006 From: eernst at daimi.au.dk (Erik Ernst) Date: Mon, 13 Nov 2006 23:49:44 +0100 Subject: [TYPES/announce] ECOOP 2007 - CFC - 1 month Message-ID: <200611132349.44453.eernst@daimi.au.dk> [Apologies for multiple copies] *** ECOOP 2007 *** The 21st European Conference on Object-Oriented Programming, ECOOP 2007, http://2007.ecoop.org/, will be in Berlin, Germany, on July 30 to August 3, 2007. Several submission deadlines are in approximately one month. Submission dates (firm deadlines): - Technical papers: December 13, 2006 - Workshop proposals: December 20, 2006 - Tutorial proposals: December 20, 2006 The ECOOP 2007 conference invites high quality technical papers presenting research results or experience in all areas relevant to object technology, including work that takes inspiration from or builds connections to areas not commonly considered object-oriented. For more details, please visit http://2007.ecoop.org/mainconf/. ECOOP 2007 invites proposals for workshops addressing different areas of object-oriented technology. Workshops should serve as a forum for exchanging late breaking ideas and theories in an evolutionary stage. For more details see http://2007.ecoop.org/workshops/. ECOOP 2007 invites proposals for tutorials addressing different areas of (post) object-orientation. The purpose of a tutorial is to give a deeper or more extensive insight into its area than a conventional lecture would do. Novel topics and topics of broad interest are especially welcome. Details at http://2007.ecoop.org/tutorials/. For more information about the conference in general, please visit http://2007.ecoop.org/. -- Erik Ernst eernst at daimi.au.dk Department of Computer Science, University of Aarhus IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From Francois.Pottier at inria.fr Tue Nov 14 04:57:19 2006 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Tue, 14 Nov 2006 10:57:19 +0100 Subject: [TYPES/announce] [ANN] Call for participation: TLDI'07 Message-ID: <20061114095719.GA6734@yquem.inria.fr> ****************************************************************************** The 2007 ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) Affiliated with the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07) Call for Participation http://www.cs.berkeley.edu/~necula/tldi07/ ****************************************************************************** Preliminary programme Invited talks: Kathleen Fisher (AT&T Research) Conor McBride (University of Nottingham) Accepted papers: A Garbage-Collecting Typed Assembly Language Chris Hawblitzel, Heng Huang, Lea Wittie and Juan Chen A graphical presentation of MLF types with a linear-time unification algorithm Didier R?my and Boris Yakobowski An Open Framework for Foundational Proof-Carrying Code Xinyu Feng, Zhaozhong Ni, Zhong Shao and Yu Guo Modular Information Hiding and Type-Safe Linking for C Saurabh Srivastava, Michael Hicks and Jeffrey Foster Semantics of an Effect Analysis for Exceptions Nick Benton and Peter Buchlovsky System F with Type Equality Coercions Martin Sulzmann, Manuel Chakravarty, Simon Peyton Jones and Kevin Donnelly ****************************************************************************** Scope The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In light of this expanding role of types, the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) follows five previous International Workshops on types in compilation and language design (TIC'97, TIC'98, TIC'00, and TLDI'03 and TLDI'05), with the hope of bringing together researchers to share new ideas and results in this area. ****************************************************************************** General Chair Fran?ois Pottier INRIA Rocquencourt BP 105 78153 Le Chesnay Cedex FRANCE francois.pottier at inria.fr Program Chair George Necula University of California 783 Soda Hall Berkeley, CA 94720 necula at cs.berkeley.edu Program Committee Damien Doligez, INRIA Peter Lee, Carnegie Mellon University Andrew Kennedy, Microsoft Research, Cambridge Naoki Kobayashi, Tohoku University George Necula (chair), University of California, Berkeley Randy Pollack, Edinburgh University Norman Ramsey, Harvard University David Tarditi, Microsoft Research, Redmond Stephanie Weirich, University of Pennsylvania Hongwei Xi, Boston University From till at informatik.uni-bremen.de Thu Nov 16 05:28:11 2006 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Thu, 16 Nov 2006 11:28:11 +0100 Subject: [TYPES/announce] 9 research assistant positions available Message-ID: <455C3D3B.802@informatik.uni-bremen.de> 9 research assistant positions (most of them TVL 13, approx. ? 35,000 to ? 50,000 p.a. gross) available, at Transregional Collaborative Research Center SFB/TR 8 Spatial Cognition: Reasoning, Action, Interaction at the Universities of Bremen and Freiburg, Germany The positions are in general concerned with interdisciplinary long-term research in Spatial Cognition. Some of the positions may be of interest to the readers of this list, because formal methods, logic and category theory are used. For details, see http://www.sfbtr8.uni-bremen.de/openpositions.html (in particular, projects I1, I3 and I4) -- Till Mossakowski Office: Phone +49-421-218-64226 DFKI Lab Bremen Cartesium Fax +49-421-218-9864226 Robert-Hooke-Str. 5 Enrique-Schmidt-Str. 5 till at tzi.de D-28359 Bremen Room 2.051 http://www.tzi.de/~till From Jeremy.Gibbons at comlab.ox.ac.uk Mon Nov 20 11:36:27 2006 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Mon, 20 Nov 2006 16:36:27 GMT Subject: [TYPES/announce] UTP'07 at IFM: Unifying Theories of Programming Message-ID: <200611201636.kAKGaRHc012258@mercury.comlab.ox.ac.uk> First call for papers UTP'07 at IFM: Unifying Theories of Programming Organised as a special session of IFM 2007, the Sixth International Conference on Integrated Formal Methods IFM 2007 will be held at St Anne's College, Oxford, UK, from the 2nd to the 6th of July, 2007 http://www.ifm2007.org This special session follows the successful First International Symposium on Unifying Theories of Programming, UTP'06, and aims to reaffirm the significance of the ongoing UTP project, to encourage efforts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise awareness of the benefits of unifying theoretical frameworks among the wider computer science and software engineering communities. Technical contributions are invited on the UTP themes of abstraction, refinement, choice, termination, feasibility, concurrency and communication, as well as related issues. These themes include, but are not limited to, linkage of theories, algebraic descriptions, healthiness conditions, normal forms, incorporation of probabilistic programming, timed calculi, and object-based descriptions. The deadline for paper submission is 29th January 2007. The submission mechanism - via the website - will allow authors to indicate that the paper should be considered for the UTP special session. Session co-chairs: Phil Brooke University of Teesside, UK Yifeng Chen University of Durham, UK From chris at ags.uni-sb.de Wed Nov 22 05:42:21 2006 From: chris at ags.uni-sb.de (Christoph Benzmueller) Date: Wed, 22 Nov 2006 10:42:21 +0000 Subject: [TYPES/announce] CADE-21 (2007) in Bremen: Call for Workshops Message-ID: <4564298D.9090301@ags.uni-sb.de> The 21th International Conference on Automated Deduction (CADE-21) Call for Workshop Proposals Bremen, Germany, 2007 CADE-21 Conference: July 17-20 Workshops: July 15-16 The CADE-21 conference will take place in Bremen, Germany, on July 17-20, 2007. More information is available at http://www.cadeconference.org/meetings/cade21/ The main CADE conference will be preceded on July 15-16, 2007, by workshops. They will provide an environment where participants will have the opportunity to discuss specific topics in an atmosphere that fosters the active exchange of ideas. Researchers are cordially invited to submit workshop proposals for review. Proposals related to automated deduction topics (see the web site above) as well as proposals at the boundary between automated deduction and other research fields are welcome. We encourage both proposals that build on previous events and proposals that are new. ------------------------------------------ * Workshop Participation and Publication * ------------------------------------------ Workshop participants will not be required to register for CADE-21 and there will be independent workshop registration fees. Workshop organizers may choose to have their proceedings/notes printed and distributed by the organizers of CADE-21. All organizers are expected to provide an on-line version of their proceedings/notes which will be made accessible via the official CADE-21 conference web site. ---------------------- * Workshop Proposals * ---------------------- Workshop Proposals should include: - Name and a brief description of the workshop, specifying its motivation, goal and topics - History of the workshop (if any), including web pointers and prior co-location information - Estimated number of workshop submissions and participants - Proposed format and expected duration (1 or 2 days) - Planned submission and selection procedure (including a tentative schedule) - Workshop chair(s) and organizing committee ---------------------------- * Deadlines and Submission * ---------------------------- - Proposal submission: Dec 15, 2006 - Proposal notification: Dec 22, 2007 Proposals should be submitted electronically to Christoph Benzmueller The University of Cambridge CADE-21 Workshop Chair ceb88 at cam.ac.uk The proposals will be reviewed and selected by the CADE-21 conference chair (Michael Kohlhase), the CADE-21 program chair (Frank Pfenning) and the CADE-21 workshop chair (Christoph Benzmueller). From bka at iist.unu.edu Fri Nov 24 18:06:04 2006 From: bka at iist.unu.edu (Bernhard K. Aichernig) Date: Sat, 25 Nov 2006 00:06:04 +0100 Subject: [TYPES/announce] CfP OpenCert 2007 (ETAPS Workshop) Message-ID: <1164409565.4971.159.camel@localhost.localdomain> Call for Papers - OpenCert 2007 1st International Workshop on Foundations and Techniques for OPEN SOURCE SOFTWARE CERTIFICATION Braga, Portugal - 31 March, 2007 Satellite Event of ETAPS 2007 http://opencert.iist.unu.edu/ Submission: 8 January, 2007 BACKGROUND AND OBJECTIVES The aim of this workshop is to bring together researchers from academia and industry who are interested in developing techniques for the quality assessment of Open Source Software (OSS), leading to the definition of a complete certification process. In recent years, Open Source Software (OSS) has gained considerable interest. Several reasons for this growing popularity can be identified: - Successful OSS projects, like the Linux operating system, the Mozilla web browser and the Apache web-server, have demonstrated the strength of the OSS development process. - Today, governments all over the world are becoming aware of growing dependence on proprietary formats and software in their administration. - OSS is free, and companies are beginning to reduce their development costs by integrating OSS into their products. However, state-of-the-art OSS development has two main weaknesses: (1) it is hard to objectively assess the quality of OSS, and (2) OSS projects are hard to control and to predict due the lack of central management. These make the use of OSS a risk, especially in security-sensitive domains. A standard approach to reduce such a risk is to establish an independent certification process. However, today we lack standards and methods to certify the quality of OSS. The workshop will focus on formal methods and model-based techniques that appear promising to facilitate OSS certification. Techniques should take those aspects into account which are specific to OSS, such as unconventional development, rapid evolution of the code, and huge amount of legacy code. Contributions to the workshop are expected to present foundations, methods, tools and case studies that integrate techniques from different areas such as - product and process certification - formal modelling - formal verification: model checking & theorem proving - reverse engineering - static analysis, testing and inspection - safety and security - language design and evolving systems - empirical software engineering - case studies The one-day workshop will feature keynote speaker and contributed paper presentations. All submitted papers will undergo a peer-review process. Accepted papers will be published by Elsevier in the series Electronic Notes in Theoretical Computer Science (ENTCS). Detailed information on the submission procedure will be available on the conference website. Publication of a selection of the papers in a special issue of a journal is also under consideration. SUBMISSION Submissions to the workshop must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the workshop. Papers should be written in English and not exceed 16 pages in ENTCS format (see http://www.entcs.org/prelim.html). All enquiries should be sent to: opencert07 at di.uminho.pt IMPORTANT DATES - Submission deadline: 8 January, 2007 - Acceptance notification: 25 Janaury, 2007 - Final version due: 03 February, 2007 ORGANISERS Bernhard Aichernig TU Graz, Austria Luis Barbosa Univ. of Minho, Portugal STEERING COMMITTEE Bernhard Aichernig TU Graz, Austria Jose Nuno Oliveira Univ. of Minho, Portugal Antonio Cerone UNU-IIST, Macau-China Martin Michlmayr Cambridge, UK David von Oheimb Siemens, Germany PROGRAM COMMITTEE Bernhard Aichernig TU Graz, Austria (Co-chair) Luis Barbosa Univ. of Minho, Portugal (Co-chair) Roberto Barbuti Univ. of Pisa, Italy Peter T. Breuer U. Carlos 3 Madrid, Spain Antonio Cerone UNU-IIST, Macau-China Marsha Chechik Univ. of Toronto, Canada Karim Djouani Univ. of Paris 12 , France Stefania Gnesi ISTI-CNR, Italy Paddy Krishnan Bond Univ., Australia Volkmar Lotz SAP, France Tom Maibaum McMaster Univ., Canada Leon Moonen TU Delft, The Netherlands Alexander Petrenko ISP RAS, Russia Arie van Deursen TU Delft, The Netherlands David von Oheimb Siemens AG, Germany -- Dr. Bernhard K. Aichernig, Associate Research Fellow of UNU-IIST http://www.iist.unu.edu/~bka ---------------------------------------------------------------------- From pjohann at camden.rutgers.edu Mon Nov 27 10:12:53 2006 From: pjohann at camden.rutgers.edu (Patricia Johann) Date: Mon, 27 Nov 2006 10:12:53 -0500 (EST) Subject: [TYPES/announce] Trends in Functional Programming 2007 -- First Call for Papers Message-ID: CALL FOR PAPERS Trends in Functional Programming 2007 New York, USA April 2-4, 2007 http://tltc.shu.edu/tfp2007/ OR http://cs.shu.edu/tfp2007/ 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 articles presented at the symposium for publication in a high-profile volume. TFP 2007 is co-hosted by Seton Hall University and The City College of New York (CCNY) and will be held in New York, USA, April 2-4, 2007 at the CCNY campus. 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 (co-located with IFL), in Munich, Germany in 2004, in Tallinn, Estonia in 2005 (co-located with ICFP and GPCE), and in Nottingham, UK in 2006 (co-located with Types). For further general information about TFP please see the TFP homepage at http://cs.shu.edu/tfp2007/ . SCOPE OF THE SYMPOSIUM The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles leading-edge, previously unpublished research work Position Articles on what new trends should or should not be Project Articles descriptions of recently started new projects Evaluation Articles what lessons can be drawn from a finished project Overview Articles summarizing work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcomed: 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 to Animate/Prototype/Implement Systems from Formal or Semi-Formal Specifications o Functional Languages for Telecommunications Applications o Functional Languages for Embedded Systems o Functional Programming Applied to Global Computing o Functional GRIDs o Functional Programming Ideas in Imperative or Object-Oriented Settings (and the converse) o Interoperability with Imperative Programming Languages o Novel Memory Management Techniques o Parallel/Concurrent Functional Languages o Program Transformation Techniques o Empirical Performance Studies o Abstract/Virtual Machines and Compilers for Functional Languages o New Implementation Strategies o any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2007 program chair, Marco T. Morazan, at tfp2007 at shu.edu. BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of articles for presentation at the symposium is based on the review of extended abstracts (6 to 10 pages in length) by the program committee. Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings and on-line. The submission must clearly indicate to which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2007 website. Submission procedures will be posted on the TFP 2007 website as the submission deadline is reached. The papers in the draft 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. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the draft 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. All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the 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. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process. Important DATES Abstract Submission: February 1, 2007 Notification of Acceptance: February 20, 2007 Registration Deadline: March 2, 2007 Camera Ready Full Paper Due: March 9, 2007 TFP Symposium: April 2-4, 2007 PROGRAMME COMMITTEE John Clements California Polytechnic State University, USA Marko van Eekelen Radboud Universiteit Nijmegen, The Netherlands Benjamin Goldberg New York University, USA Kevin Hammond University of St. Andrews, UK Patricia Johann Rutgers University, USA Hans-Wolfgang Loidl Ludwig-Maximilians Universit?t M?nchen, Germany Rita Loogen Philipps-Universit?t Marburg, Germany Greg Michaelson Heriot-Watt University, UK Marco T. Moraz?n (Chair) Seton Hall University, USA Henrik Nilsson University of Nottingham, UK Chris Okasaki United States Military Academy at West Point, USA Rex Page University of Oklahoma, USA Ricardo Pena Universidad Complutense de Madrid, Spain Benjamin C. Pierce University of Pennsylvania, USA John Reppy University of Chicago, USA Ulrik P. Schultz University of Southern Denmark, Denmark Clara Segura Universidad Complutense de Madrid, Spain Jocelyn S?rot Universit? Blaise Pascal, France Zhong Shao Yale University, USA Olin Shivers Georgia Institute of Technology, USA Phil Trinder Heriot-Watt University, UK David Walker Princeton University, USA ORGANIZATION Symposium Chair: Henrik Nilsson, University of Nottingham, UK Programme Chair: Marco T. Morazan, Seton Hall University, USA Treasurer: Greg Michaelson, Heriot-Watt University, UK Local Arrangements: Marco T. Morazan, Seton Hall University, USA SPONSORS The Department of Mathematics and Computer Science, Seton Hall University The Department of Computer Science, The City College of New York The Center for Algorithms and Interactive Scientific Software of The City College of New York The Grove School of Engineering of The City College of New York We are actively looking for additional TFP sponsors, who may, for example, help to subsidise attendance by research students. 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 Program Chair, Marco T. Morazan, or the Symposium Chair, Henrik Nilsson. Your students will be grateful! From andrei at cs.chalmers.se Tue Nov 28 05:44:58 2006 From: andrei at cs.chalmers.se (Andrei Sabelfeld) Date: Tue, 28 Nov 2006 11:44:58 +0100 (MET) Subject: [TYPES/announce] IEEE Computer Security Foundations 2007 - call for papers Message-ID: <20061128104458.EA8FD31E6@zsh.cs.chalmers.se> A non-text attachment was scrubbed... Name: not available Type: text Size: 6737 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061128/71655424/attachment.txt From carlos.martin at urv.cat Tue Nov 28 16:01:38 2006 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Tue, 28 Nov 2006 21:01:38 GMT Subject: [TYPES/announce] LATA 2007: paper submission deadline extended Message-ID: PAPER SUBMISSION DEADLINE EXTENDED TO DECEMBER 7, 2006 !!!!! ******************************************************************************* 2nd Call for Papers 1st INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2007) Tarragona, Spain, March 29 - April 4, 2007 http://www.grammars.grlmc.com/LATA2007/ ******************************************************************************* AIMS: LATA 2007 intends to become a major conference in theoretical computer science and its applications. As linked to the International PhD School in Formal Languages and Applications that is being developed at the host institute since 2001, it will reserve significant room for young computer scientists at the beginning of their career. LATA 2007 will aim at attracting scholars from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - words, languages and automata - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - combinatorics on words - language varieties and semigroups - algebraic language theory - computability - computational, descriptional, communication and parameterized complexity - patterns and codes - regulated rewriting - trees, tree languages and tree machines - term rewriting - graphs and graph transformation - power series - fuzzy and rough languages - cellular automata - DNA and other models of bio-inspired computing - quantum, chemical and optical computing - biomolecular nanotechnology - automata and logic - automata for verification - automata, concurrency and Petri nets - parsing - weighted machines - foundations of finite state technology - grammatical inference and learning - symbolic neural networks - text retrieval and pattern recognition - string and combinatorial issues in computational biology and bioinformatics - mathematical evolutionary genomics - language-based cryptography - compression - circuit theory and applications - language theoretic foundations of artificial intelligence and artificial life STRUCTURE: LATA 2007 will consist of: - 3 invited talks - 2 invited tutorials - refereed contributions - open sessions for discussion in specific subfields - young sessions on professional issues INVITED SPEAKERS: Volker Diekert (UStuttgart), Equations: From Words to Graph Products (tutorial) Nissim Francez & Michael Kaminski (Technion), Extensions of Pregroup Grammars and Their Correlated Automata Eric Graedel (RWTH Aachen), Infinite Games (tutorial) Neil Immerman (UMass, Amherst), Nested Words Helmut J?rgensen (UWestern Ontario), Synchronization PROGRAMME COMMITTEE: Francine Blanchet-Sadri (Greensboro) Paola Bonizzoni (Milan) Henning Bordihn (Potsdam) John Brzozowski (Waterloo) Erzsebet Csuhaj-Varju (Budapest) Carsten Damm (Goettingen) Nachum Dershowitz (Tel Aviv) Pal Domosi (Debrecen) Manfred Droste (Leipzig) Zoltan Esik (Tarragona, co-chair) Joerg Flum (Freiburg, Germany) Jozef Gruska (Brno) Tero Harju (Turku) Colin de la Higuera (Saint-Etienne) Markus Holzer (Munich) Lucian Ilie (London, Canada) Masami Ito (Kyoto) Jarkko Kari (Turku) Andre Kempe (Grenoble) Jetty Kleijn (Leiden) Satoshi Kobayashi (Tokyo) Martin Kutrib (Giessen) Thierry Lecroq (Rouen) Stuart Margolis (Ramat Gan) Carlos Martin-Vide (Tarragona, co-chair) Risto Miikkulainen (Austin) Victor Mitrana (Tarragona, co-chair) Claudio Moraga (Dortmund) Kenichi Morita (Hiroshima) Mark-Jan Nederhof (St. Andrews) Mitsunori Ogihara (Rochester) Alexander Okhotin (Turku) Friedrich Otto (Kassel) Holger Petersen (Stuttgart) Wojciech Rytter (Warsaw) Kai Salomaa (Kingston, Canada) Magnus Steinby (Turku) Shuly Wintner (Haifa) Detlef Wotschke (Frankfurt) Hsu-Chun Yen (Taipei) Sheng Yu (London, Canada) ORGANIZING COMMITTEE: Madalina Barbaiani Gemma Bel-Enguix Cristina Bibire Carlos Cruz Reyes Adrian Horia Dediu Szilard Zsolt Fazekas Maria Adela Grando Mihai Ionescu M. Dolores Jimenez-Lopez Alexander Krassovitskiy Guangwu Liu Remco Loos Carlos Martin-Vide (chair) Tsetsegkhand Namsrai Anthonath Roslin Sagaya Mary Sherzod Turaev SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 pages and should be formatted according to the usual LNCS article style. Submissions have to be sent through the web page: http://www.easychair.org/LATA2007/ PUBLICATION: A volume of pre-proceedings will be available by the time of the conference. It is expected that a refereed volume of selected proceedings will be published soon after it in the LNCS Springer series. REGISTRATION: The period for registration will be since January 9 to March 29, 2007. Details about how to register will be provided through the website of the conference in due time. Early registration fees: 200 euros Early registration fees (PhD students): 50 euros Registration fees: 300 euros Registration fees (PhD students): 75 euros FUNDING: 40 grants covering partial-board accommodation in the university hostel will be available for nonlocal PhD students. To apply, the candidate must e-mail her/his CV together with a copy of the document proving her/his condition as a PhD student. IMPORTANT DATES: Paper submission: December 7, 2006 Application for funding (PhD students): December 15, 2006 Notification of funding acceptance or rejection: December 31, 2006 Notification of paper acceptance or rejection: January 31, 2007 Early registration: February 15, 2007 Final version of the paper for the pre-proceedings: February 28, 2007 Starting of the conference: March 29, 2007 Submission to the proceedings volume: May 15, 2007 FURTHER INFORMATION: carlos.martin at urv.cat ADDRESS: LATA 2007 Research Group on Mathematical Linguistics Rovira i Virgili University Plaza Imperial Tarraco, 1 43005 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-559597 From grust at in.tum.de Wed Nov 29 06:11:13 2006 From: grust at in.tum.de (Torsten Grust) Date: Wed, 29 Nov 2006 12:11:13 +0100 Subject: [TYPES/announce] PLAN-X 2007: Call for Participation Message-ID: <1DFDDD2D-1885-46C6-8C62-6442EBE6997D@in.tum.de> Call for Participation P L A N - X 2 0 0 7 Programming Language Technologies for XML An ACM SIGPLAN Workshop collocated with POPL 2007 Nice, France -- January 20, 2007 www.plan-x-2007.org Please join us for PLAN-X 2007, the fifth workshop in the PLAN-X series, dedicated to the interaction and integration of programming language technology and the world of XML. The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming language technology can embrace and explain streaming XML transformations, types for XPath and XML updates, web service contracts, tree patterns in XQuery, LINQ and XML Schema, and more. PLAN-X 2007 will feature eight talks, three system demonstrations, extensive opportunity for discussion, and a keynote address (speaker to be announced). PLAN-X 2007 will be held in the Plaza Hotel (Nice, France) all-day on Saturday, January 20, 2007, just after and collocated with POPL 2007, the ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (January 17-19, 2007). -- ACCEPTED PAPERS Kazuhiro Inaba, Haruo Hosoya XML Transformation Language Based on Monadic Second Order Logic Nate Foster, Benjamin C. Pierce, Alan Schmitt A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice Alain Frisch, Keisuke Nakano Streaming XML Transformations Using Term Rewriting Giuseppe Castagna, Nils Gesbert, Luca Padovani A Theory of Contracts for Web Services Sebastian Maneth, Helmut Seidl Deciding Equivalences of Top-Down XML Transformations in Polynomial Time Jan Hidders, Philippe Michiels, Jerome Simeon, Roel Vercammen How to Recognise Different Kinds of Tree Patterns From Quite a Long Way Away Pierre Geneves, Nabil Layaida, Alan Schmitt XPath Typing Using a Modal Logic with Converse for Finite Trees James Cheney Lux: A Lightweight, Statically Typed XML Update Language -- ACCEPTED SYSTEM DEMONSTRATIONS Jorge Coelho, Mario Florido XCentric: A Logic-Programming Language for XML Processing Kazuhiro Inaba, Haruo Hosoya MTran: An XML Transformation Language Based on Monadic Second Order Logic Ralf L?mmel LINQ to XSD -- REGISTRATION PLAN-X 2007 is held in cooperation with POPL 2007. You can register for the workshop via the POPL 2007 registration process (online or offline). Please visit http://www.regmaster.com/conf/popl2007.html Registration rates are shown below. The rates are unaffected by the POPL 2007 early bird registration deadline. Note that you can upgrade an existing POPL 2007 registration to include PLAN-X 2007. Workshop-only registration is possible as well. ACM or SIGPLAN Member $89 Non-Member $99 Student $89 Your registration includes a copy of the PLAN-X 2007 informal proceedings, coffee breaks, and lunch. -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU M?nchen U Pisa Munich, Germany Pisa, Italy grust at in.tum.de ghelli at di.unipi.it -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Roquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders M?ller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rh?ne-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK) From P.B.Levy at cs.bham.ac.uk Thu Nov 30 12:12:07 2006 From: P.B.Levy at cs.bham.ac.uk (Paul B Levy) Date: Thu, 30 Nov 2006 17:12:07 +0000 (GMT) Subject: [TYPES/announce] HOSC paper on call-by-push-value Message-ID: Dear colleagues, I'd like to announce a paper, just published in Higher-Order and Symbolic Computation, about call-by-push-value, a canonical calculus for computational effects that unifies call-by-value and call-by-name. The paper answers (I hope) all your questions about the similarities and differences between call-by-push-value and the monad framework, but any more questions or comments are very welcome! regards, Paul ---------------------------------------------- Call-by-push-value: decomposing call-by-value and call-by-name Paul Blain Levy Higher-Order and Symbolic Computation, vol. 19(4), December 2006. Abstract We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operational side, we give big-step semantics and a stack machine for CBPV, which leads to a straightforward push/pop reading of CBPV programs. On the denotational side, we model CBPV using cpos and, more generally, using algebras for a strong monad. For storage, we present an O'Hearn-style ``behaviour semantics'' that does not use a monad. We present the translations from CBN and CBV to CBPV. All these translations straightforwardly preserve denotational semantics. We also study their operational properties: simulation and full abstraction. We give an equational theory for CBPV, and show it equivalent to a categorical semantics using monads and algebras. We use this theory to formally compare CBPV to Filinski's variant of the monadic metalanguage, as well as to Marz's language SFPL, both of which have essentially the same type structure as CBPV. We also discuss less formally the differences between the CBPV and monadic frameworks. -- Paul Blain Levy email: pbl at cs.bham.ac.uk School of Computer Science, University of Birmingham Birmingham B15 2TT, U.K. tel: +44 121-414-4792 http://www.cs.bham.ac.uk/~pbl From tho at ifs.tuwien.ac.at Wed Nov 29 21:13:00 2006 From: tho at ifs.tuwien.ac.at (Nguyen Manh Tho) Date: Thu, 30 Nov 2006 03:13:00 +0100 Subject: [TYPES/announce] ARES 2007 Last Call for papers - Submission due is today - (30-11-2006) Message-ID: Apologies for multiple copies due to cross postings. Please send to interested colleagues and students. Call for Papers +--------------------------------------------------------------------------------------------------------+ The Second International Conference on Availability, Reliability and Security (AReS) ARES 2007 - "The International Security and Dependability Conference" April 10th ? April 13th,2007 Vienna University of Technology, Austria http://www.ares-conf.org http://www.ares-conference.eu +-------------------------------------------------------------------------------------------------------+ Conference ---------------- The 1st International Conference on Availability, Reliability and Security conference (ARES 2006) has been successfully organized in Vienna, AUSTRIA from April 20 to April 22, 2006 by the Technical University of Vienna in cooperation with the European Network and Security Agency (ENISA). We have attracted 250 participants for this conference with its 3 keynotes speakers and its 9 workshops held in conjunction with. In continuation of the successful 1st ARES conference, The Second International Conference on Availability, Reliability and Security (?ARES 2007 ? The International Security and Dependability Conference?) will bring together researchers and practitioners in the area of IT-Security and Dependability. ARES 2007 will highlight the various aspects of security ? with special focus on secure internet solutions, trusted computing, digital forensics, privacy and organizational security issues. ARES 2007 aims at a full and detailed discussion of the research issues of security as an integrative concept that covers amongst others availability, safety, confidentiality, integrity, maintainability and security in the different fields of applications. Important Dates ---------------------- * Submission Deadline: November, 30th 2006 (firm deadline) * Author Notification: January, 7th 2007 * Author Registration: January, 21st 2007 * Proceedings Version: January, 21st 2007 Workshops -------------- In conjunction with the ARES 2007 conference, a number of workshops will be organized. We are very indebted for the effort of workshop's organizers and workshop's PC members. Proceedings of the ARES 2007 workshops will be published by IEEE Computer Society Press. * Workshop 1: Second International Workshop ?Dependability Aspects on Data WArehousing and Mining applications? (DAWAM 2007), Jimmy Huang, York University, Canada + Josef Schiefer, Senactive IT-Dienstleistungs GmbH, Austria + Nguyen Manh Tho, Vienna University of Technology, Austria .DAWAM 2007 http://dawam.ares-conference.eu/ Submission Deadline: December, 17th 2006 * Workshop 2: Second Workshop on ?Dependability and Security in e-Government? (DeSeGov 2007), A Min Tjoa, Vienna University of Technology, Austria + Erich Schweighofer, University of Vienna, Austria + Nguyen Manh Tho, Vienna University of Technology, Austria DeSeGov 2007 http://desegov.ares-conference.eu/ Submission Deadline: December, 15th 2006 * Workshop 3: Workshop on Foundations of Fault-tolerant Distributed Computing (FOFDC 2007), Wilhelm Hasselbring, University of Oldenburg, Germany + Matthias Rohr, University of Oldenburg, Germany + Christian Storm, University of Oldenburg, Germany + Oliver Theel, University of Oldenburg, Germany + Timo Warns, University of Oldenburg, Germany. FOFDC 2007 http://trustsoft.uni-oldenburg.de/fofdc07/ Submission Deadline: December, 1st 2006 * Workshop 4: "Secure Software Engineering" (SecSE 2007), Torbj?rn Skramstad, Norwegian University of Science and technology (NTNU) + Lillian R?stad, Norwegian University of Science and technology (NTNU) + Martin Gilje Jaatun, SINTEF ICT, Norway. SecSE 2007 http://secse.ares-conference.eu/ Submission Deadline: December, 17th 2006 * Workshop 5: Workshop on "Event-Based IT Systems", Modeling, Designing, and Testing Correct, Secure, and Dependable Event-Based System, Stefan Biffl, Vienna University of Technology + Eva K?hn, Vienna University of Technology + Alexander Schatten, Vienna Univeristy of Techology EBITS http://ebits.ares-conference.eu/ Submission Deadline: November, 19th 2006 * Workshop 6: "Distributed Healthcare Availability, Reliability and Security" (DIHARES 2007), Thomas Clark, Complete Cardiology Services Ltd, USA. DIHARES 2007 http://dihares.ares-conference.eu/ Submission Deadline: November, 17th, 2006 * Workshop 7: "First International Workshop on Advances in Information Security" (WAIS 2007), Leonard Barolli, Fukuoka Institute of Technology, Japan + Arjan Durresi, Louisiana State University, USA + Hiroaki Kikuchi, Tokai university, Japan.WAIS 2007 http://www.csc.lsu.edu/~durresi/wais2007/index.html Submission Deadline: December 1st, 2006 * Workshop 8: Second International Workshop on Bioinformatics and Security (BIOS 2007), Hochreiter Sepp, University of Linz, Bioinf, Austria + K?ng Josef, University of Linz, FAW Austria + Wagner Roland, University of Linz, FAW Austria. BIOS 2007 http://bios.ares-conference.eu/ Submission Deadline: November 20, 2006 * Workshop 9: Second International Workshop on Security and E- Learning, Edgar Weippl, Secure Business Austria. SEL 2007 http://sel.ares-conference.eu/ Submission Deadline: November 19, 2006 * Workshop 10: Second Workshop on Information Security Risk Management (ISRM), Professor Dr. D. Karagiannis, University of Vienna, Austria + Dr. L. Marinos, ENISA, Greece . ISRM http://www.ares-conference.eu/ares2006/www.ares-conf.org/index47da.html?q=isrm * Workshop 11: The First International Workshop on Spoofing, Digital Forensics and Open Source Tools (SDFOST), Judie Mulholland, Florida Cybersecurity Institute, USA. SDFOST http://www.ares-conference.eu/conf/index.php?option=com_content&task=view&id=33&Itemid=41 Submission Deadline: November 20, 2006 Topics of interest include, but are not limited to: ------------------------------------------------------------ * Process based Security Models and Methods * Autonomous Computing * Authorization and Authentication * Availability and Reliability * Common Criteria Protocol * Cost/Benefit Analysis * Cryptographic protocols * Dependability Aspects for Special Applications (e.g. ERP-Systems, Logistics) * Dependability Aspects of Electronic Government (e-Government) * Dependability administration * Dependability in Open Source Software * Designing Business Models with security requirements * Digital Forensics * E-Commerce Dependability * Failure Prevention * IPR of Security Technology * Incident Response and Prevention * Information Flow Control * Internet Dependability * Interoperability aspects * Intrusion Detection and Fraud Detection * Legal issues * Mobile Security * Network Security * Privacy-enhancing technologies * RFID Security and Privacy * Risk planning, analysis & awareness * Safety Critical Systems * Secure Enterprise Architectures * Security Issues for Ubiquitous Systems * Security and Privacy in E-Health * Security and Trust Management in P2P and Grid applications * Security and privacy issues for sensor networks, wireless/mobile devices and applications * Security as Quality of Service * Security in Distributed Systems / Distributed Databases * Security in Electronic Payments * Security in Electronic Voting * Software Engineering of Dependable Systems * Software Security * Standards, Guidelines and Certification * Survivability of Computing Systems * Temporal Aspects of Dependability * Trusted Computing * Tools for Dependable System Design and Evaluation * Trust Models and Trust Management * VOIP/Wireless Security Submission Guidelines ------------------------------- Authors are invited to submit research and application papers following the IEEE Computer Society Proceedings Manuscripts style: two columns, single-spaced, including figures and references, using 10 fonts, and number each page. You can confirm the IEEE Computer Society Proceedings Author Guidelines at the following web page: URL: http://computer.org/cspress/instruct.htm The Web site for paper registration and electronic submission is available at: http://www.ares-conf.org/confdriver/?q=confdriver/papers/add Please refer to ARES website (http://www.ares-conf.org or http://www.ares-conference.eu) for update information. If you have any difficluty in submitting the papers, please do not hesitate to send them to tho at ifs.tuwien.ac.at Honorary Co-Chairs --------------------------- Norman Revell, Middlesex University, United Kingdom Roland Wagner, University of Linz, Austria General Co-Chairs ------------------------ Guenther Pernul, University of Regensburg, Germany Makoto Takizawa, Tokyo Denki University, Japan Program Co-Chairs ------------------------ Gerald Quirchmayr, University of Southern Australia, Australia A Min Tjoa, Vienna University of Technology, Austria Workshops Co-Chairs --------------------------- Nguyen Manh Tho, Vienna University of Technology, Austria Abdelkader Hameurlain, University of Toulouse, France Leonard Barolli, Fukuoka Institute of Technology (FIT), Japan International Liaison Co-Chairs --------------------------------------- Maria Wimmer, University of Koblenz-Landau, Germany Charles Shoniregun, University of East London, United Kingdom Publicity Chair ------------------ Vladimir Marik, Czech Technical University, Czech Republic Publication Chair --------------------- Monika Lanzenberger, Norwegian University of Science and Technology, Trondheim, Norway Local Organizing Chairs ------------------------------ Maria Schweikert, Vienna University of Technology, Austria Markus Klemen, Vienna University of Technology, Austria Programme Committee ------------------------------ Jemal H. Abawajy, Deakin University, Australia Karl Aberer, EPFL, Switzerland Abiola Abimbola, Napier University, UK Rafael Accorsi, University of Freiburg, Germany Alessandro Acquisti, Carnegie Mellon University, USA Andre Adelsbach, Telindus PSF S.A., Luxembourg Vasilis Aggelis, PIRAEUS Bank (WINBANK), Greece John Andrews, Loughborough, University, UK Michael Backes, Saarland University, Germany Leonard Barolli, Fukuoka Institute of Technology (FIT), Japan Lisa Bartlett, Loughborough University, UK Massimo Bartoletti, Universita' di Pisa, Italy Darcy G. Benoit, Acadia University, Wolfville, Canada Helmut Berger, E-Commerce Competence Center - EC3, Austria Bharat Bhargava, Purdue University, USA Christophe Blanchet, CNRS IBCP, France Alexander B?hm, University of Mannheim, Germany Stephane Bressan, National University of Singapore, Singapore Luciano Burgazzi, ENEA, Italy Kevin Butler, Pennsylvania State University, USA Jesper Buus Nielsen , University of Aarhus, Denmark Catharina Candolin, The Finnish Defence Forces. Finland Jiannong Cao, Hong Kong Polytechnic University, Hongkong Jordi Castell?-Roca, Rovira i Virgili University of Tarragona, Spain David Chadwick, University of Kent, UK Surendar Chandra, University of Notre Dame, USA Guihai Chen, Nanjing University, China Simon Christophe, Nancy University, France Soon-Ae Chun, City University of New York, USA Nathan Clarke, University of Plymouth, UK Joey Coleman, University of Newcastle upon Tyne, UK Gao Cong, University of Edinburgh, UK Ricardo Corin, INRIA-MSR & University of Twente, The Netherlands George Davida, University of Wisconsinat Milwaukee, USA Robert H. Deng , Singapore Management University, Singapore Jochen Dinger, Universit?t Karlsruhe (TH), Germany Lucia Draque Penso, University of Mannheim, Germany Schahram Dustdar, Vienna University of Technology, Austria Christian Engelmann, Oak Ridge National Laboratory, USA Yung-Chin Fang, Dell Inc., USA Hannes Federrath, University of Regensburg, Germany Pascal Felber, Universit? de Neuch?tel, Switzerland Elena Ferrari, University of Insubria, Italy Sergio Flesca, DEIS ? University of Calabria, Italy Vincenzo De Florio, University of Antwerp, Belgium Vladimir Fomichov, K.E. Tsiolkovsky Russian State Technological University, Russia Jordi Forn?, Technincal Universtiy of Catalonia, Spain Huirong Fu, Oakland University, MI, USA Steven Furnell, University of Plymouth, UK Javier Garcia-Villalba, Complutense University of Madrid, Spain Matthew Gebski, University of New South Wales, Australia Karl Goeschka, Vienna University of Technology, Austria Swapna S. Gokhale, University of Connecticut, USA Marcin Gorawski, Silesian University of Technology, Poland Stephan Gro?, Technische Universit?t Dresde, Germany Daniel Grosu, Wayne State University, USA Michael Grottke, Duke University, USA Le Gruenwald, University of Oklahoma, USA Qijun Gu, Texas State University, USA Yong Guan, Iowa State University, USA Ibrahim Haddad, Open Source Development Labs, USA Abdelkader Hameurlain, Paul Sabatier University, France Marit Hansen, Independent Centre for Privacy Protection, USA Naohiro Hayashibara, Tokyo Denki University, Japan Xubin (Ben) He, Tennessee Technological University, USA Yanxiang He, Wuhan University, China Rattikorn Hewett, Texas Tech University, USA Chin-Tser Huang, University of South Carolina, USA Jimmy Huang, York University, Canada Thomas Jensen, IRISA/CNRS, France Zhen Jiang, West Chester University, USA Hai Jin, Huazhong University of Science and Technology, China Oliver Jorns, ftw. Forschungszentrum Telekommunikation Wien, Austria Audun Josang, School of Software Engineering and Data Communications, Australia Jan Jurjens, Munich University of Technology, Germany and Open University, UK Holger Kenn, University of Bremen, Germany Dogan Kesdogan, RWTH Aachen, Germany Brian King, Indiana University Purdue University Indianapolis, USA Ted Krovetz, California State University, USA Raphael Kunis, Chemnitz University of Technology, Germany Helmut Kurth, Atsec Information Security, USA Marc Lacoste, France T?l?com R&D, France Kwok-Yan Lam, Tsinghua University, China Chokchai Box Leangsuksun, Louisiana Tech University, USA Yih-Jiun Lee, Department of Information Management, CTU, Taiwan Chin-Laung Lei, National Taiwan University, China Philippe Leray, INSA (National Institute of Applied Sciences) of Rouen, France Jun Li, University of Oregon, USA Sam Lightstone, IBM Canada Ltd., Canada Chae-Hoon Lim, Sejong University, Korea Ching Lin, Macquarie University, Australia Man Lin, St. Francis Xavier University, Canada Alex Zhaoyu Liu, University of North Carolina at Charlotte, USA Tong Liu, Dell Inc, USA Hua Liu , Xerox labs, USA Javier Lopez, University of Malaga, Spain Sanglu Lu, Nanjing University, China Jianhua Ma, Hosei University, Japan Qiang Ma, NEC, Japan Josef Makolm, Federal Ministry of Finance, Austria Carsten Maple, University of Luton, UK Keith Martin , University of London, UK Fabio Martinelli, National Research Council - C.N.R, Italy BeniaminoDi Martino, Second University of Naples, Italy Santiago Melia, University of Alicante, Spain Nasrullah Memon, Aalborg University Esbjerg, Denmark Geyong Min, University of Bradford, UK George Mohay, Queensland University of Technology, Australia Marina Mongiello, Technical University of Bari, Italy Stefania Montani, Universita' del Piemonte Orientale, Italy Yi Mu, University of Wollongong, Australia Junghyun Nam, Sungkyunkwan University, Korea Priya Narasimhan, Carnegie Mellon University, USA Tho Manh Nguyen, Vienna University of Technology, Austria Jesper Nielsen, University of ?rhus, Denmark Thomas Nowey, University of Regensburg, Germany Tomas Olovsson, Chalmers University of Technology, Sweden Hong Ong, Oak Ridge National Laboratory, USA Maria Papadaki, University of Plymouth, UK Manish Parashar, Rutgers University, USA Fernando Pedone, University of Lugano, Switzerland MariaS. Perez, UPM, Spain G?nther Pernul, University of Regensburg, Germany Rob Peters, University of Amsterdam, The Neitherland Thomas Phan, IBM Research, USA Mario Piattini, University of Castilla-La Mancha, Spain Makan Pourzandi, Ericsson Canada, Canada Christopher Price, University of Wales Aberystwyth, UK Jean-Jacques Quisquater, Universite catholique de Louvain, Belgium Wenny Rahayu, La Trobe University, Australia Indrajit Ray, Colorado State University, USA Domenico Rosaci, University "Mediterranea" of Reggio Calabria, Italy Heiko Rossnagel, Johann Wolfgang Goethe University Frankfurt, Germany Bimal Roy, Indian Statistical Institute, India Kenji Saito, Keio University, Japan Kouichi Sakurai, Kyushu University, Japan BiplabK. Sarker , University of New Brunswick, Fredericton, Canada Ingrid Schaum?ller-Bichl, FH O? Campus Hagenberg, Austria Stephen L. Scott, Oak Ridge National Laboratory - USA Dharmaraja Selamuthu, Indian Institute of Technology Delhi, India Tony Shan, Wachovia Bank, USA Thomas Shrimpton, Portland State University, USA Richard Sinnott, University of Glasgow, UK Amund Skavhaug, Norwegian University of Science and Technology, Norway Agusti Solanas, Rovira i Virgili University, Spain Alexander Speirs, University of Newcastle upon Tyne, UK Katarina Stanoevska-Slabeva, University St. Gallen, Switzerland Ketil St?len, SINTEF & University of Oslo, Norway Aaron Striegel, University of Notre Dame, USA Peter Struss, Munich University of Technology, Germany Tsuyoshi Takagi, Future University - Hakodate, Japan Makoto Takizawa, Tokyo Denki University, Japan Oliver Theel, University of Oldenburg, Germany Bj?rn Thuresson, KTH Computer Science and Communication, Sweden A Min Tjoa, Vienna University of Technology, Austria Kishor Trivedi, Duke University, USA Juan Trujillo, University of Alicante, Spain Alexander W. Tsow, Indiana University, USA Tomas Uribe, SRI International, USA Kalyan Vaidyanathan, Sun Microsystems, USA Luca Vigano, ETH Zurich, Switzerland Umberto Villano, Universita' del Sannio, Italy Melanie Volkamer, DFKI - German Research Center for Artificial Intelligence, Germany Michael Waidner, IBM Software Group, Switzerland Carine Webber, Universidade de Caxias do Sul, Brazil Edgar Weippl, Vienna University of Technology, Austria Robert Willison, Copenhagen Business School, Denmark Maria Wimmer, University of Koblenz-Landau, Germany Matthew Wright, University of Texas at Arlington, USA Qinghan Xiao , Defence R&D Canada, Canada Liudong Xing, University of Massachusetts, USA Cheng-Zhong Xu, Wayne State University, USA Mariemma.I. Yag?e, University of Malaga, Spain Jeff Yan, Newcastle University, UK Laurence Yang, St. Francis Xavier University, Canada Alec Yasinsac, Florida State University, USA George Yee, National Research Council, Canada Sung-Ming Yen, National Central University, Taiwan Xun Yi, Victoria University, USA Meng Yu, Monmouth University, USA William Yurcik, University of Illinois, USA Nicola Zannone, University of Trento, Italy Jianhong Zhang, North China University of Technology, China Liqiang Zhang, Indiana University South Bend, USA Jianying Zhou, Institute for Infocomm Research, Singapore Xudong Zhu, Alcatel shangHai Bell Co. LTD., China Enrico Zio, Polytechnic of Milan, Italy From hassei at kurims.kyoto-u.ac.jp Sun Dec 3 20:25:26 2006 From: hassei at kurims.kyoto-u.ac.jp (Hasegawa Masahito) Date: Mon, 04 Dec 2006 10:25:26 +0900 Subject: [TYPES/announce] TLCA'07 - Second Call for Papers Message-ID: <200612040125.kB41PQDT011274@kurims.kurims.kyoto-u.ac.jp> [NEW: Invited Speakers and Special Events] [NEW: Online Submissions Now Open] Second Call for Papers Eighth International Conference on Typed Lambda Calculi and Applications (TLCA '07) Paris, June 26-28, 2007 http://www.rdp07.org/tlca.html http://www.lsv.ens-cachan.fr/rdp07/tlca.html Part of Federated Conference on Rewriting, Deduction, and Programming (RDP'07) ** Title and abstract due 22 December 2006 ** ** Deadline for submission 2 January 2006 *** The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive: * Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: Denotational semantics, game semantics, realisability, categorical models * Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation * Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving * Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checking The programme of TLCA'07 will consist of three invited talks and about 25 papers selected from original contributions. Accepted papers will be published as a volume of Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html). Invited Speakers and Special Events: ------------------------------------ There will be invited talks by * Patrick Baillot (CNRS, University Paris 13) * Greg Morrisett (Harvard University) * Frank Pfenning (Carnegie Mellon University), joint with RTA An evening session will celebrate the 75th anniversary of the lambda calculus: * Henk Barendregt (Nijmegen University): Diamond Anniversary of Lambda Calculus Submissions: ------------ The submitted papers should describe original work and should allow the Programme Committee to assess the merits of the contribution. In particular references and comparisons with related work should be included. Submission of material already published or submitted to other conferences with published proceedings is not allowed. Papers should not exceed 15 pages in Springer LNCS format (http://www.springer.de/comp/lncs/authors.html). Instructions for online submissions are found at the conference webpage (http://www.rdp07.org/tlca.html). Important Dates: ---------------- December 22 Title and abstract due January 2 Deadline for submission March 10-15 Author review period March 25 Notification of acceptance-rejection April 20 Deadline for the final version TLCA'07 Program Committee: -------------------------- Chantal Berline (CNRS, France) Peter Dybjer (Chalmers, Sweden) Healfdene Goguen (Google, USA) Robert Harper (Carnegie Mellon University, USA) Olivier Laurent (CNRS, France) Simone Martini (University of Bologna, Italy) Simona Ronchi Della Rocca (University of Torino, Italy), chair Peter Selinger (University of Dalhousie, Canada) Paula Severi (University of Leicester, UK) Kazushige Terui (University of Sokendai, Japan) Pawel Urzyczyn (University of Warsaw, Poland) TLCA Steering Committe: ----------------------- Samson Abramsky, Oxford, chair Henk Barendregt, Nijmegen Mariangiola Dezani-Ciancaglini, Turin Roger Hindley, Swansea Martin Hofmann, Munich Pawel Urzyczyn, Warsaw TLCA Publicity Chair: --------------------- Masahito Hasegawa, Kyoto From vv at di.fc.ul.pt Tue Dec 5 08:44:19 2006 From: vv at di.fc.ul.pt (Vasco T. Vasconcelos) Date: Tue, 5 Dec 2006 13:44:19 +0000 Subject: [TYPES/announce] Two post-doc/PhD positions in Lisbon Message-ID: <36C82578-433E-4FAC-97C0-CE6A974F86EE@di.fc.ul.pt> The Department of Informatics at the Faculty of Sciences, University of Lisbon is seeking candidates for two Ph.D. or post-doc positions, starting January 2007. The position is funded by Sensoria, Software Engineering for Service- Oriented Overlay Computers, (http:/sensoria.fast.de/), an IST project funded by the European Union as an Integrated Project under the 6th framework programme, and part of the Global Computing Initiative. Researchers in the Lisbon site include Lu«õs Caires, Ant«onia Lopes, Francisco Martins, Ant«onio Ravara, Jo÷ao Seco, and Vasco T. Vasconcelos. We seek candidates with a strong background in some of the following areas: service-oriented computing, software architectures, foundations and analysis of concurrent and distributed system. Monthly salary in the range euro 2.200Ð3.300. Post-doc applicants should hold a Ph.D. degree in Computer Science or equivalent, and justified expertise on the project themes. Ph.D. candidates should be eligible for a Ph.D programme at a Portuguese university. Applications are open until December 28, 2006. Applicants should send a detailed CV, together with a contact phone number, address, and e-mail address to: Prof. Vasco Thudichum Vasconcelos Secretaria do Departmento de Inform«atica Faculdade de Ciöencias da Universidade de Lisboa Bloco C6, piso 3, sala 38 Campo Grande, 1749Ð016 Lisboa Portugal From dmitry.sustretov at loria.fr Tue Dec 5 09:38:32 2006 From: dmitry.sustretov at loria.fr (Dmitry Sustretov) Date: Tue, 05 Dec 2006 15:38:32 +0100 Subject: [TYPES/announce] ESSLLI 2007 Student Session call for papers Message-ID: [Our apologies for multiple postings of this announcement.] ESSLLI 2007 STUDENT SESSION CALL FOR PAPERS August 6-17 2007, Dublin, Ireland Deadline: February 11, 2007 http://www.loria.fr/~sustreto/stus07/ We are pleased to announce the Student Session of the 19th European Summer School in Logic, Language and Information, which will be held in Dublin, Ireland on August 6-17, 2007. We invite submission of papers in the areas of Logic, Language and Computation for presentation at the Student Session and for appearance in the proceedings. AIM Student Session exists to bring together young researchers to present and discuss their work in progress with a possibility to get feedback from senior researchers. SUBMISSION Only original publications are accepted, previous published works are not allowed. All authors of the paper must be students: undergraduate (before the completion of the Masters degree) or graduate (before the completion of the PhD degree). Papers can be submitted either for oral (20min talk+10 min discussion), or poster presentation. There are three subject areas: Logic and Language (lola), Language and Computation (laco) and Logic and Computation (loco). The submissions should be sent by email before 11 February 2007 to dmitry.sustretov at loria.fr (the message should have subject "ESSLLI STUS submission") along with an identification file in plain text of the following format: Title: title of the submission First author: firstname lastname Affiliation: affiliation of the first author E-mail: e-mail of the first author ...... Last author: firstname lastname Affiliation: affiliation of the last author E-mail: e-mail of the last author Abstract: (5 lines) Subject area: Logic and Language or Language and Computation or Logic and Computation Modality: Poster or Oral The submission should be in one of the following formats: PostScript, PDF or RTF. (In case of acceptance, the final version of the paper will have to be submitted in LaTeX format.) The papers must use single column A4 size pages, 11pt or 12pt fonts, and standard margins, and may not exceed 7 pages of length exclusive of references. The paper and identification file should be named by the following convention: category-modality-last name(s) of author(s) (for example, "loco-oral-martin.pdf" and "loco-oral-martin.txt"). At least one of the authors of the paper must register as a participant of ESSLLI. Accepted papers will be published in the proceedings which will be available during ESSLLI. TIMELINE Submission deadline: February 11, 2007 Notification of authors: April 20, 2007 Full paper deadline: May 20, 2007 ESSLLI: August 6-17, 2007 PROGRAM COMMITTEE Chairs: Ville Nurmi and Dmitry Sustretov Co-chairs: Logic and Computation Bryan Renne, City University of New York Levan Uridia, University of Amsterdam Language & Computation Luciana Benotti, INRIA Lorraine Michael Kaisser, University of Edinburgh Logic & Language Jana H=E4ussler, University of Konstanz Miltiadis Kokkonidis, University of Oxford CONTACT The Student Session webpage is the place for relevant information. http://www.loria.fr/~sustreto/stus07/ Feel free to contact the chairs for any questions about the submissions or the Student Session in general. Ville Nurmi Phone: +358 9 191 51497 Fax: +358 9 191 51400 E-mail: ville.v.nurmi at helsinki.fi Dmitry Sustretov Phone: +33 3 83 59 20 35 Fax: +33 3 83 41 30 79 E-mail: dmitry.sustretov at loria.fr -- Dmitry Sustretov ------------------------------------------------------------ -- PhD student at INRIA Lorraine-LORIA=20 -- http://www.loria.fr/~sustreto/ ------------------------------------------------------------ -- From pmt6sbc at maths.leeds.ac.uk Tue Dec 5 12:46:43 2006 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Tue, 5 Dec 2006 17:46:43 +0000 (GMT) Subject: [TYPES/announce] CiE 2007 - Second Call for Papers Message-ID: ************************************************************ CiE 2007 http://www.mat.unisi.it/newsito/cie07.html Computability in Europe 2007: Computation and Logic in the Real World University of Siena Siena, 18-23 June 2007 SECOND CALL FOR PAPERS Deadline: JANUARY 12, 2007 The PROGRAMME COMMITTEE of CiE 2007 cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF-format, max 10 pages) for presentation at CiE 2007: see the conference website for the online submission procedure. The CONFERENCE PROCEEDINGS will be published by Springer Lecture Notes in Computer Science (LNCS). There will also be journal special issues: APAL, JLC, TCS-C, ToCS - to which full versions of selected submissions to CiE 2007 will be invited, in consultation with the Programme Committee and Special Session Organisers, to be submitted. For a list of conference topics see: http://www.amsta.leeds.ac.uk/~pmt6sbc/cie07.descr.html#themes IMPORTANT DATES: Submission of Papers: Jan. 12, 2007 Notification of Authors: Feb. 16, 2007 Deadline for Final Revisions: Mar. 9, 2007 Deadline for Submission of Informal Presentations: Apr. 27, 2007 PLENARY AND TUTORIAL SPEAKERS: Pieter Adriaans (Amsterdam) - Learning as Data Compression Kobi Benenson (Harvard) - Biological Computing Anne Condon (Vancouver) - Computational challenges in prediction and design of nucleic acid structure Stephen Cook (Toronto) - Low Level Reverse Mathematics Yuri Ershov (Novosibirsk) - tba Wolfgang Maass (Graz) - Theoretical Aspects of Biological Computation Sophie Laplante (Paris) - Using Kolmogorov Complexity to Define Individual Security of Cryptographic Systems Anil Nerode (Cornell) - Logic and Control Roger Penrose (Oxford) - tba Michael Rathjen (Leeds) - Theories and Ordinals in Proof Theory Dana Scott (Carnegie Mellon) - Two Categories for Computability Robert I. Soare (Chicago) - Computability and Incomputability Philip Welch (Bristol) - tba SPECIAL SESSIONS SPEAKERS: * Doing without Turing Machines: Constructivism and Formal Topology (Chairs: Giovanni Sambin, Dieter Spreen): Andrej Bauer (Ljubljana) Douglas Bridges (Canterbury, NZ) Thierry Coquand (Goeteborg) Martin Escardo (Birmingham) Maria Emilia Maietti (Padua) * Approaches to Computational Learning (Chairs: Marco Gori, Franco Montagna): John Case (Newark, Delaware) Klaus Meer (Odense) Frank Stephan (Singapore) Osamu Watanabe (Tokyo) * Real Computation (Chairs: Vasco Brattka, Pietro Di Gianantonio): Pieter Collins (Amsterdam) Abbas Edalat (London) Hajime Ishihara (Tokyo) Robert Rettinger (Hagen) Martin Ziegler (Paderborn) * Computability and Mathematical Structure (Chairs: Serikzhan Badaev, Marat Arslanov): Vasco Brattka (Cape Town) Barbara F. Csima (Waterloo) Sergey S. Goncharov (Novosibirsk) Jiri Wiedermann (Prague) Liang Yu (Nanjing) * Complexity of Algorithms and Proofs (Chairs: Elvira Mayordomo, Jan Johannsen): Eric Allender (Rutgers) Joerg Flum (Freiburg) Michal Koucky (Prague) Neil Thapen (Prague) Heribert Vollmer (Hannover) * Logic and New Paradigms of Computability (Chairs: Paola Bonizzoni, Olivier Bournez): Felix Costa (Lisbon) Natasha Jonoska (Tampa, Florida) Giancarlo Mauri (Milan) Grzegorz Rozenberg (Leiden) Damien Woods (Cork) * Computational Foundations of Physics and Biology (Chairs: Guglielmo Tamburrini, Christopher Timpson): James Ladyman (Bristol) Itamar Pitowsky (Jerusalem) Grzegorz Rozenberg (Leiden) Giuseppe Trautteur (Naples) PROGRAMME COMMITTEE: M. Agrawal (Kanpur) M. Arslanov (Kazan) G. Ausiello (Roma) A. Bauer (Ljubljana) A. Beckmann (Swansea) U. Berger (Swansea) A. Cantini (Firenze) B. Cooper (Leeds, co-chair) L. Crosilla (Firenze) J. Diaz (Barcelona) C. Dimitracopoulos (Athens) F. Ferreira (Lisbon) S. Goncharov (Novosibirsk) P. Gruenwald (Amsterdam) D. Harel (Rehovot) A. Hodges (Oxford) J. Kempe (Paris) G. Longo (Paris) B. Loewe (Amsterdam) J. Makowsky (Haifa) E. Mayordomo Camara (Zaragoza) W. Merkle (Heidelberg) F. Montagna (Siena) D. Normann (Oslo) T. Pheidas (Heraklion) G. Rozenberg (Leiden) G. Sambin (Padova) H. Schwichtenberg (Muenchen) W. Sieg (Carnegie Mellon) A. Sorbi (Siena, co-chair) I. Soskov (Sofia) P. van Emde Boas (Amsterdam) CONFIRMED SPONSORS OF CiE 2007: AILA (Associazione Italiana di Logica e Applicazioni), EATCS (European Association for Theoretical Computer Science), ASL (Association for Symbolic Logic), EACSL (European Association for Computer Science Logic), FoLLI (The Association of Logic, Language and Information), and The University of Siena. CiE 2007 will be co-located with CCA 2007, the annual CCA (Computability and Complexity in Analysis) Conference (Siena, College Santa Chiara, June 16-18, 2007): http://cca-net.de/cca2007/ ************************************************************ From lerner at cs.ucsd.edu Wed Dec 6 14:31:23 2006 From: lerner at cs.ucsd.edu (Sorin Lerner) Date: Wed, 6 Dec 2006 11:31:23 -0800 (PST) Subject: [TYPES/announce] POPL 2007 Call for Participation Message-ID: ********************************************************************* * ACM SIGPLAN-SIGACT Symposium * * on * * Principles of Programming Languages * * * * January 17-19, 2007 * * Nice, France * * * * Call for Participation * * * * http://www.cs.ucsd.edu/popl/07 * ********************************************************************* Important dates * Early registration deadline: December 15, 2006 * Conference: January 17-19, 2007 Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. Student Attendees Students who have a paper accepted for the conference are offered SIGPLAN student membership free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund (http://www.acm.org/sigs/sigplan/PAC.htm). Conference Chair Martin Hoffmann Ludwig-Maximilians-Universitat Oettingenstr 67, 80538, Munich, GERMANY Program Committee Chair Matthias Felleisen College of Computer Science Northeastern University Boston, MA 02115 USA Program Committee Hans Boehm HP Laboratories Craig Chambers U Washington Patrick Cousot ENS, Paris Benjamin Goldberg NYU, New York Andy Gordon Microsoft Research, Cambridge Dan Grossman U Washington John Hatcliff Kansas State U Tom Henzinger EPFL, Lausanne Paul Hudak Yale Mark Jones Portland State University, Portland Gabriele Keller University of New South Wales Oege de Moor Oxford Eliot Moss U Massachusetts, Amherst Benjamin Pierce U Pennsylvania Jakob Rehof Universitat Dortmund Olin Shivers Georgia Tech, Atlanta Scott Smith Johns Hopkins, Baltimore Kevin Sullivan U Virginia Carolyn Talcott SRI International David Walker Princeton Affiliated Events * Declarative Aspects of Multicore Programming (DAMP) * January 16th, 2007 * Foundations and Developments of Object-Oriented Languages (FOOL/WOOD) * January 20, 2007 * Partial Evaluation and Semantics-Based Program Manipulation (PEPM) * January 15-16, 2007 * Practical Applications of Declarative Languages (PADL) * January 14-15, 2007 * Programming Language Technologies for XML (PLAN-X) * January 20, 2007 * Types in Language Design and Implementation (TLDI) * January 16, 2007 * Verification, Model Checking and Abstract Interpretation (VMCAI) * January 14-16, 2007 Preliminary Program * Wednesday, 17 January 2007 * Invited Keynote: 9:00 - 10:00 Perl 6: Reconciling the Irreconcilable Audrey Tang * Session 1: 10:20 - 11:20 Operational Semantics for Multi-Language Programs Jacob Matthews and Robert Bruce Findler Semantics of Static Pointcuts in AspectJ Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, Oege de Moor, Damien Sereni, Julian Tibble, Mathieu Verbaere A Typed Intermediate Language for Compiling Multiple Inheritance Juan Chen * Session 2: 11:30 - 12:30 Cork: Dynamic Memory Leak Detection for Garbage- Collected Languages Maria Jump and Kathryn S McKinley Dynamic Heap Type Inference for Program Understanding and Debugging Marina Polishchuk, Ben Liblit, and Chloe W. Schulze Compositional Dynamic Test Generation Patrice Godefroid Locality Approximation Using Time Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Ding * Session 3: 14:00 - 15:15 Modular Type Classes Derek Dreyer, Robert Harper, and Manuel M.T. Chakravarty First-Class Nonstandard Interpretations by Opening Closures Jeffrey Mark Siskind and Barak A. Pearlmutter PADS/ML: A Functional Data Description Language Yitzhak Mandelbaum, Kathleen Fisher, David Walker, Mary Fernandez, and Artem Gleyzer Generative Unbinding of Names Andrew M Pitts and Mark R Shinwell * Session 4: 15:45 - 17:15 Types, Bytes, and Separation Logic Gerwin Klein, Harvey Tuch, Michael Norrish A Very Modal Model of a Modern, Major, General Type System Andrew W. Appel, Paul-Andre Mellies, Christopher D. Richards, Jerome Vouillon Context Logic as Modal Logic: Completeness and Parametric Inexpressivity Cristiano Calcagno, Philippa Gardner, Uri Zarfaty * Thursday, 18 January 2007 * Invited Keynote: 9:00 - 10:00 From Implementation to Theory in Product Synthesis Don Batory * Session 5: 10:20 - 11:30 Scrap your boilerplate with XPath-like combinators Ralf Lammel Lightweight Fusion by Fixed Point Promotion Atsushi Ohori , Isao Sasano Lazy Multivariate Higher-Order Forward-Mode AD Barak A. Pearlmutter and Jeffrey Mark Siskind * Session 6: 11:30 - 12:30 A Complete, Co-Inductive Syntactic Theory of Sequential Control and State Kristian Stoevring and Soren B. Lassen Towards a Mechanized Metatheory of Standard ML Daniel K. Lee, Karl Crary, Robert Harper * Session 7: 14:00 - 15:30 Logic-Flow Analysis of Higher-Order Programs Matthew Might Extracting Queries by Static Analysis of Transparent Persistence Ben Wiedermann and William R. Cook Variance analyses from invariance analyses Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter O'Hearn * Session 8: 16:00 - 17:30 Assessing security threats of looping constructs Pasquale Malacaria JavaScript Instrumentation for Browser Security Dachuan Yu, Ajay Chander, Nayeem Islam, and Igor Serikov Secure Implementations of Typed Channel Abstractions Michele Bugliesi and Marco Giunti * Friday, 19 January 2007 * Invited Keynote: 9:00 - 10:00 Advanced Programming Languages in Enterprise Software: A lambda-calculus theorist wanders into an enterprise datacenter Chet Murthy * Session 9: 10:20 - 11:20 Proving That Programs Eventually Do Something Good Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Vardi Program Verification as Probabilistic Inference Sumit Gulwani and Nebojsa Jojic * Session 10: 11:30 - 12:30 Lock Allocation Michael Emmi, Jeffrey Fischer, Ranjit Jhala, Rupak Majumdar Modular Verification of a Non-Blocking Stack Matthew Parkinson, Richard Bornat and Peter O'Hearn On the Analysis of Interacting Pushdown Systems Vineet Kahlon and Aarti Gupta * Session 11: 14:00 - 15:30 Specialization of CML message-passing primitives John Reppy, Yingqi Xiao Conditional Must Not Aliasing for Static Race Detection Mayur Naik and Alex Aiken Interprocedural Analysis of Asynchronous Programs Ranjit Jhala, Rupak Majumdar * Session 12: 16:00 - 17:30 Preferential Path Profiling: Compactly Numbering Interesting Paths Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi Geometry of Synthesis: A structured approach to VLSI design Dan Ghica A Semantics-Based Approach to Malware Detection Mila Dalla Preda, Mihai Christodorescu, Somesh Jha, Saumya Debray From Susanne.Graf at imag.fr Wed Dec 6 15:01:57 2006 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Wed, 06 Dec 2006 21:01:57 +0100 Subject: [TYPES/announce] Software Engineer position at Verimag Message-ID: <457721B5.2030107@imag.fr> Software Engineer position at Verimag: ------------------------------------- Verimag is opening a Research Engineer position in the context of a 3-year European project which started in May 2006. The projet aims at building infrastructure, methods and tools for Component-based Modeling and Validation of critical real-time systems. It is coordinated by a leading European industry and has a strong consortium with academic teams, tool providers, and users. The position provides a unique opportunity to collaborate with groups from academia and industry which are leading in their domain. We are looking for candidates with an engeneer or doctor degree and with competencies in Model Driven Development, Software Engineering, and Real-time Systems. For a more detailed information on both the expected work and the material conditions, please contact - Joseph Sifakis (sifakis at imag.fr, http://www-verimag.imag.fr/~sifakis/) or - Susanne Graf (susanne.graf at imag.fr, http://www-verimag.imag.fr/~graf) From eernst at daimi.au.dk Wed Dec 6 16:19:06 2006 From: eernst at daimi.au.dk (Erik Ernst) Date: Wed, 6 Dec 2006 22:19:06 +0100 Subject: [TYPES/announce] ECOOP 2007 - CFC, with last CFP - ONE WEEK Message-ID: <200612062219.06466.eernst@daimi.au.dk> - Apologies for multiple copies - *** ECOOP 2007 *** The 21st European Conference on Object-Oriented Programming, ECOOP 2007, http://2007.ecoop.org/, will be in Berlin, Germany, on July 30 to August 3, 2007. The deadline for submission of technical papers is in one week, and this is the last call for papers. Two other submission deadlines are in two weeks. Submission dates (firm deadlines): - Technical papers: December 13, 2006 - Workshop proposals: December 20, 2006 - Tutorial proposals: December 20, 2006 The ECOOP 2007 conference invites high quality technical papers presenting research results or experience in all areas relevant to object technology, including work that takes inspiration from or builds connections to areas not commonly considered object-oriented. Submission at http://cyberchairpro.borbala.net/ecooppapers/submit/. For more details, please visit http://2007.ecoop.org/mainconf/. ECOOP 2007 invites proposals for workshops addressing different areas of object-oriented technology. Workshops should serve as a forum for exchanging late breaking ideas and theories in an evolutionary stage. For more details see http://2007.ecoop.org/workshops/. ECOOP 2007 invites proposals for tutorials addressing different areas of (post) object-orientation. The purpose of a tutorial is to give a deeper or more extensive insight into its area than a conventional lecture would do. Novel topics and topics of broad interest are especially welcome. Details at http://2007.ecoop.org/tutorials/. For more information about the conference in general, please visit http://2007.ecoop.org/. -- Erik Ernst eernst at daimi.au.dk Department of Computer Science, University of Aarhus IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From jonathan.cohen at anu.edu.au Wed Dec 6 22:45:58 2006 From: jonathan.cohen at anu.edu.au (Jon Cohen) Date: Thu, 7 Dec 2006 14:45:58 +1100 Subject: [TYPES/announce] USMC'07 - Call for talks and participation Message-ID: <78769760-D1A4-4AA2-AA5F-3AAE41FD2571@anu.edu.au> [Apologies for multiple copies] CALL FOR TALKS AND PARTICIPATION Universal Structures in Mathematics and Computing http://usmc07.rsise.anu.edu.au The Australian National University Canberra, Australia 5 - 7 February 2007 Aim: Starting from very different motivations, various groups of mathematicians and computer scientists have sought to describe abstract structures in great generality. This parallel evolutionary process has led to various groups of researchers working on highly interrelated areas, though unable to effectively communicate with each other due to vastly differing languages. This workshop aims to bring together researchers working in category theory, universal algebra, logic and their applications to computer science in order to highlight recent advances in these fields and to facilitate dialogue between the different camps. Of particular interest is work which spans two or more of these areas. Structure and Scope: The workshop will consist of several invited keynote talks as well as shorter contributed talks. Topics of interest include (but are not limited to): * Operads and related structures * Higher dimensional categories * Coalgebras * Clones in universal algebra * Residuated lattices * Algebraic logic * Linear and other substructural logics * Higher dimensional automata * Concurrency theory * Domain theory * Type theory Keynote Speakers: * Brian Davey (La Trobe, Australia) * Rob Goldblatt (VUW, New Zealand) * Ross Street (Macquarie, Australia) * Glynn Winskel (Cambridge, UK) Talk submissions: We solicit talks on topics related to the themes and spirit of the workshop. We aim to facilitate all those who wish to speak at the workshop. Submission of talks can be made by email to Alwen Tiu (Alwen.Tiu at rsise.anu.edu.au) or Jon Cohen (Jonathan.Cohen at rsise.anu.edu.au). Registration: Registration for the workshop can be done online through the workshop website. The online registration will be opened on Friday, 15th December 2006 until 2nd February 2007. * Full registration: AU$ 55 (incl. GST) * Student registration: AU$ 35 (incl. GST) Important Dates and Information: * Deadline for registration: 2nd February 2007 * Deadline for talk titles and abstracts submission: 19th January 2007 * Workshop: 5 - 7 February 2007 Accommodation: A limited number of rooms have been reserved at University House (http://www.anu.edu.au/unihouse/) and Ursula College (http:// ursula.anu.edu.au/Ursula/12.html). Please quote the workshop name "USMC workshop" when reserving the rooms. In addition, there are many hotels and hostels for those wishing to arrange their own accommodation. Locations in the city centre as well as the suburbs of Turner and Braddon are within walking distance of the university. Details can be found at http://www.canberratourism.com.au/. Sponsors: The workshop is sponsored by the Australian Mathematical Sciences Institute (AMSI) and National ICT Australia. Travel support: There are limited travel funds available to support students and early-career researchers from AMSI members. Applications of funds have to be made directly to AMSI. See http://www.amsi.org.au for details. Organising Committee: * Jonathan Cohen (ANU and NICTA) * Brian Davey (La Trobe) * Greg Restall (Melbourne) * Alwen Tiu (ANU and NICTA) Contact: * Jon Cohen (Jonathan.Cohen at rsise.anu.edu.au) * Alwen Tiu (Alwen.Tiu at rsise.anu.edu.au) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061206/4da80554/attachment.htm From terkel at imm.dtu.dk Thu Dec 7 09:10:46 2006 From: terkel at imm.dtu.dk (terkel@imm.dtu.dk) Date: Thu, 7 Dec 2006 15:10:46 +0100 (CET) Subject: [TYPES/announce] SAS 2007 Preliminary Call for Papers Message-ID: <2471.217.226.220.63.1165500646.squirrel@www2.imm.dtu.dk> Call for papers Static Analysis Symposium SAS 2007 22-24 August 2007, Kongens Lyngby, Denmark (co-located with LOPSTR 2007) url http://www.imm.dtu.dk/sas2007 email sas2007 at imm.dtu.dk Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification of programming languages and systems. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The technical programme for SAS 2007 will consist of invited lectures, tutorials, panels, presentations of refereed papers, and software demonstrations. Contributions are welcome on all aspects of Static Analysis, including, but not limited to: abstract domain abstract interpretation abstract testing compiler optimisations control flow analysis data flow analysis model checking program specialization security analysis theoretical analysis frameworks type based analysis verification systems 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 from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published, or that are simultaneously submitted to a journal or a conference with refereed proceedings. Submitted papers should be at most 15 pages formatted in LNCS style excluding bibliography and well-marked appendices not intended for publication). PC members are not required to read the appendices, and thus papers should be intelligible without them. The proceedings will be ublished by Springer-Verlag in the Lecture Notes in Computer Science series. Program Committee Agostino Cortesi (U. Venice, Italy) Patrick Cousot (ENS, France) Manuel Fahndrich (Microsoft, USA) Gilberto Fil? (U. Padova, Italy, co-chair) Roberto Giacobazzi (U. Verona, Italy) Chris Hankin (Imperial College, UK) Manuel Hermenegildo (TU. Madrid, Spain) Jens Knoop (TU. Vienna, Austria) Naoki Kobayashi (Tohoku U., Japan) Julia Lawall (U. Copenhagen, Denmark) Hanne Riis Nielson (DTU, Denmark, co-chair) Andreas Podelski (U. Freiburg, Germany) Jakob Rehof (U. Dortmund, Germany) Radu Rugina (Cornell U., USA) Mooly Sagiv (Tel-Aviv U., Israel) Dave Schmidt (Kansas State U., USA) Helmut Seidl (TUM, Germany) Harald S?ndergaard (U. Melbourne, AU) Kwangkeun Yi (Seoul N. U., Korea) Organising committee Christian W. Probst Flemming Nielson Terkel K. Tolstrup Henrik Pilegaard Eva Bing Elsebeth Str?m Important dates Submission of abstract: March 26, 2007 Submission of full paper: March 30, 2007 Notification: May 7, 2007 Camera-ready version: June 4, 2007 Conference: August 22-24, 2007 --- Terkel K. Tolstrup Language-Based Technology Technical University of Denmark From leavens at cs.iastate.edu Mon Dec 11 12:42:52 2006 From: leavens at cs.iastate.edu (Gary T. Leavens) Date: Mon, 11 Dec 2006 11:42:52 -0600 (CST) Subject: [TYPES/announce] CFP: Foundations of Aspect-Oriented Languages FOAL 2007 Message-ID: [FOAL is very interested in papers on types and semantics related to aspect-oriented languages. Please contribute!] Call For Papers FOAL: Foundations of Aspect-Oriented Languages 2007 A one day workshop affiliated with AOSD 2007 in Vancouver, British Columbia. Submission Deadline: 23:00 GMT, 10 January 2007 Notification of Acceptance: 2 February 2007 Final Versions of Papers Due: 1 March 2007 Workshop: 13 March 2007 Themes and Goals FOAL is a forum for research in foundations of aspect-oriented programming languages. Areas of interest include but are not limited to: * Semantics of aspect-oriented languages * Specification and verification for such languages * Type systems * Static analysis * Theory of testing * Theory of aspect composition * Theory of aspect translation (compilation) and rewriting The workshop aims to foster work in foundations, including formal studies, promote the exchange of ideas, and encourage workers in the semantics and formal methods communities to do research in the area of aspect-oriented programming languages. All theoretical and foundational studies of this topic are welcome. The goals of FOAL are to: * Make progress on the foundations of aspect-oriented programming languages. * Exchange ideas about semantics and formal methods for aspect-oriented programming languages. * Foster interest within the programming language theory and types communities in aspect-oriented programming languages. * Foster interest within the formal methods community in aspect-oriented programming and the problems of reasoning about aspect-oriented programs. Workshop Format The planned workshop format is primarily presentation of papers and group discussion. Talks will come in three categories: long (30 minutes plus 15 minutes of discussion), regular (20 minutes plus 5 minutes of discussion) and short (7 minutes plus 3 minutes of discussion). The short talks will allow for presentations of topics for which results are not yet available, perhaps for researchers who are seeking feedback on ideas or seek collaborations. We also plan to ensure sufficient time for discussion of each presentation by limiting the overall number of talks. Submissions Invitation to the workshop will be based on papers selected by the program committee; those wishing to attend but not having a paper to submit should contact the organizers directly to see if there is sufficient space in the workshop. FOAL solicits long, regular, and short papers on all areas of formal foundations of AOP languages. Submissions will be read by the program committee and designated reviewers. Papers will be selected for long, regular, and short presentation at the workshop based on their length, scientific merit, innovation, readability, and relevance. Papers previously published or already being reviewed by another conference are not eligible. Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than their paper length would otherwise command. We will limit the length of paper presentations and the number of papers presented to make sure that there is enough time for discussion. Papers presented at the workshop will be included in a technical report (from Iowa State University). Authors will retain their own copyright to the papers. Publication of papers at other venues will thus remain possible. We will also investigate having a special issue of a journal for revisions of selected papers after the workshop. Authors should note the following details: * Submissions are due no later than 23:00 GMT, 10 January 2007. (This is a firm deadline.) * Authors must indicate whether they wish to be considered for a long, regular, or short presentation. * Papers for long presentations must not exceed 10 pages in length; those for regular presentations must not exceed 7 pages in length, and those for short presentations must not exceed 3 pages in length. * Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than requested. * We encourage use of the ACM Conference format for submissions, as this will be required for accepted papers. You must add page numbers (which are not part of the standard format) to your submissions, to make adding comments easier. * Submissions are to be made to the following URL: http://continue.cs.brown.edu/servlets/foal07/continue.ss We will notify the corresponding author of papers that are selected for presentation at the workshop by 2 February 2006. Early registration for AOSD (you must register for AOSD to attend the workshop) is 9 February 2006. Final versions of papers for the proceedings will be due on 1 March 2006. Important Dates Submission Deadline: 23:00 GMT, 10 January 2007 Notification of Acceptance: 2 February 2007 Final Versions of Papers Due: 1 March 2007 Workshop: 13 March 2007 For more information, visit the FOAL Workshop home page (at http://www.cs.iastate.edu/FOAL). Gary T. Leavens Department of Computer Science, Iowa State University 229 Atanasoff Hall, Ames, Iowa 50011-1041 USA http://www.cs.iastate.edu/~leavens phone: +1-515-294-1580 From msteffen at ifi.uio.no Tue Dec 12 02:22:58 2006 From: msteffen at ifi.uio.no (Martin Steffen) Date: 12 Dec 2006 08:22:58 +0100 Subject: [TYPES/announce] FMOODS 07: Second Call for Papers Message-ID: --------------------------------------------------------------------- Second CALL FOR PAPERS FMOODS 2007 9th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems Paphos, Cyprus 6 - 8 June 2007 --------------------------------------------------------------------- Abstract submission: 8 January 2007 Paper submission: 15 January 2007 Author notification: 7 March 2007 Camera-ready copy: 26 March 2007 --------------------------------------------------------------------- http://www.discotec07.cs.ucy.ac.cy --------------------------------------------------------------------- The 9th 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 9th International Conference on Coordination Models and Languages (COORDINATION) and the 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS). FMOODS 2007 is sponsored by IFIP, and will be organised by the Department of Computer Science of the University of Cyprus. 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 - Formalization of runtime system evolution (e.g. dynamic updates, reconfiguration) - Multiple viewpoint modelling and consistency between different views - Model transformations and refactorings - Integration of quality of service requirements into formal models - Formal approaches to component-based design - Applications of formal methods (e.g. web services, multimedia, telecommunications) - Experience reports on best practices and tools INVITED SPEAKER Mariangiola Dezani-Ciancaglini (U. of Torino, IT) ORGANISERS: General chair: George Papadopoulos (U. of Cyprus, CY) PC chairs: Einar Broch Johnsen (U. of Oslo, NO) Marcello Bonsangue (LIACS, NL) Publicity Chair: Martin Steffen (U. of Oslo, NO) Steering Committee: John Derrick (U. of Sheffield, UK) Roberto Gorrieri (U. of Bologna, IT) Elie Najm (ENST, Paris, FR) Carolyn Talcott (SRI International, US) Program Committee Bernhard Aichernig (TU. of Graz, AT) Alessandro Aldini (U. of Urbino, IT) Frank de Boer (CWI, NL) Eerke Boiten (U. of Kent, UK) Marcello Bonsangue (LIACS, NL) John Derrick (U. of Sheffield, UK) Einar Broch Johnsen (U. of Oslo, NO) Robert France (Colorado State U., US) Reiko Heckel (U. of Leicester, UK) Naoki Kobayashi (Tohoku University, JP) Zhiming Liu (UNU-IIST, MO) Elie Najm (ENST, Paris, FR) David Naumann (Stevens Inst. of Technology, US) Uwe Nestmann (TU of Berlin, DE) Erik Poll (U. of Nijmegen, NL) Antonio Ravara (TU of Lisbon, PT) Arend Rensink (U. of Twente, NL) Ralf Reussner (U. of Karlsruhe, DE) Grigore Rosu (U. of Illinois at Urbana-Champaign, US) Bernhard Rumpe (TU Braunschweig, DE) Martin Steffen (U. of Oslo, NO) Carolyn Talcott (SRI International, US) Heike Wehrheim (U. of Paderborn, DE) Martin Wirsing (U. of Munich DE) Wang Yi (Uppsala University, SE) Gianluigi Zavattaro (U. of Bologna, IT) Elena Zucca (U. of Genova, IT) IMPORTANT DATES: 8 January 2007: Abstract submission 15 January 2007: Paper submission 7 March 2007: Author notification 26 March 2007: Camera-ready copy 5 June 2007: DisCoTec 2007 workshops 6-8 June 2007: FMOODS 2007 PROCEEDINGS: The FMOODS 2007 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 Ricky.Robinson at nicta.com.au Tue Dec 12 18:30:47 2006 From: Ricky.Robinson at nicta.com.au (Ricky Robinson) Date: Wed, 13 Dec 2006 10:30:47 +1100 Subject: [TYPES/announce] Second CFP: DAIS 2007 Message-ID: <09D3F703EF3B0A4CBE28449EA9F3D320048FDFFA@nicta-atp-mail.in.nicta.com.au> --------------------------------------------------------------------- Second CALL FOR PAPERS DAIS 2007 7th IFIP International Conference on Distributed Applications and Interoperable Systems "Towards Sustainability" Paphos, Cyprus 6 - 8 June 2007 --------------------------------------------------------------------- Abstract submission: 8 January 2007 Paper submission: 15 January 2007 Work-in-progress papers: 26 January, 2007 Author notification: 7 March 2007 Camera-ready copy: 26 March 2007 --------------------------------------------------------------------- http://www.discotec07.cs.ucy.ac.cy --------------------------------------------------------------------- The 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS) is part of the federated conferences DisCoTec (Distributed Computing Techniques), together with the 9th International Conference on Coordination Models and Languages (COORDINATION) and the 9th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS). It will be organised by the Department of Computer Science of the University of Cyprus. ABOUT THE CONFERENCE Distributed applications and interoperable systems have become an integral part of everyday living, part of the socio-economic ecosystem of our human environment. With such interdependence between society and software, distributed software applications must be sustainable and adaptable in the long term, despite the changes in our environment. What do we understand by sustainability in distributed applications and interoperable systems? How do we ensure our distributed applications can make local adaptation to specific circumstances of their deployment? How do we make our interoperable systems evolvable in the face of widespread change in their environment? How do we integrate distributed software within the wider fabric of computing within our modern world? How can distributed applications and interoperable systems capitalise and exploit future trends and the changing user demographic? The DAIS conference series addresses all aspects of distributed applications and interoperable systems: design, implementation, operation and maintenance. This time we particularly solicit papers that address sustainability issues. DAIS'07 is the 7th event in this successful international conference series, commencing in 1997. It will be a forum for researchers, vendors and users to come together to review, discuss and learn about the future of distributed applications and interoperable systems. DAIS is now an annual event. CONFERENCE THEMES DAIS'07 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'07 conference themes include: - innovative distributed applications in the areas of * enterprise computing * mobile, grid and peer-to-peer computing * context-aware, ubiquitous and pervasive computing - models and concepts supporting distributed applications in the areas of * sustainability * adaptability * evolution - middleware supporting distributed applications in the area of * autonomic applications and systems * context-aware, adaptive applications * reconfigurable and self-managing applications * quality of service-aware applications - evolution of application integration and interoperability in * enterprise-wide and inter-enterprise integration * semantic interoperability and semantic web services * service-oriented applications - software engineering of distributed applications * domain-specific modeling languages * model evolution * model-driven adaptation, testing and validation * re-engineering SUBMISSION GUIDELINES Submissions must be done electronically as postscript or PDF, using the Springer LNCS style. DAIS'07 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'07 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 8, 2007 Full paper submission: January 15, 2007 Work-in-progress papers: January 26, 2007 Notification of acceptance: March 7, 2007 Camera ready version: March 26, 2007 ORGANISERS General chair: George Angelos Papadopoulos, University of Cyprus, Cyprus 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: Jadwiga Indulska, University of Queensland, Australia Kerry Raymond, Queensland University of Technology, Australia Publicity chair: Ricky Robinson, National ICT Australia, Australia Program committee: N. Alonistioti, University of Athens, Greece D. Bakken, Washington State University, USA Y. Berbers, Katholieke Universiteit Leuven, Belgium A. Beugnard, ENST-Bretagne, France G. Blair, Lancaster University, UK I. Demeure, ENST, France C. Eckert TU Darmstadt, Germany F. Eliassen, University of Oslo, Norway P. Felber, Universit? de Neuch?tel, Switzerland, K. Geihs, University of Kassel, Germany R. Gr?nmo, SINTEF ICT, Norway D. Hagimont, INP Toulouse, France S. Hallsteinsen, SINTEF ICT, Norway J. Indulska, University of Queensland, Australia H. Koenig, BTU Cottbus, Germany R. Kroeger, Univeristy of Applied Sciences, Wiesbaden, Germany L. Kutvonen, University of Helsinki, Finland W. Lamersdorf, University of Hamburg, Germany M. Lawley, Queensland University of Technology, Australia P. Linington, University of Kent, UK C. Linnhof-Popien, University of Munich, Germany K. Lund, Norwegian Defence Research Establishment (FFI), Norway R. Meier, Trinity College Dublin, Ireland L. Merakos, University of Athens, Greece A. Montresor, University of Trento, Italy E. Najm, ENST, France R. Oliveira, Universidade do Minho, Portugal A. Puder State University San Francisco, USA K. Raymond, Queensland University of Technology, Australia R. Robinson, National ICT Australia, Australia A. Schill, Technical University of Dresden, Germany T. Senivongse, Chulalongkorn University, Thailand K. Sere, ?bo Akademi University, Finland J.-B. Stefani, INRIA, France E. Tanter, University of Chile, Chile K. Zielinski, AGH Univ. of Science and Technology, Poland -- Ricky Robinson, Ph.D. Researcher Queensland Laboratory National ICT Australia Limited PO Box 10161 Brisbane QLD 4000 Australia Tel. +61 7 3000 0514 Fax. +61 7 3000 0480 The imagination driving Australia's ICT future. To receive the latest NICTA information register at http://nicta.com.au/registration.cfm -------------------------------------------------------------------------- This email and any attachments may be confidential. They may contain legally privileged information or copyright material. You should not read, copy, use or disclose them without authorisation. If you are not an intended recipient, please contact us at once by return email and then delete both messages. We do not accept liability in connection with computer virus, data corruption, delay, interruption, unauthorised access or unauthorised amendment. This notice should not be removed. From mwh at cs.umd.edu Wed Dec 13 16:25:46 2006 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 13 Dec 2006 16:25:46 -0500 Subject: [TYPES/announce] PLAS 2007: call for papers Message-ID: <86F6430D-0152-41C6-9793-28F0E9F0DDDA@cs.umd.edu> -- Note to types readers: we encourage submissions to PLAS that aim to provide measures of security using types; e.g., by type checking, type-based analysis, type-based specification, etc. ACM SIGPLAN Workshop on Programming Languages and Analysis for Security San Diego, California, June 14, 2007 Sponsored by ACM SIGPLAN Co-located with PLDI'07 as part of FCRC. http://www.cs.umd.edu/~mwh/PLAS07/index.html Submission Deadline: April 1, 2007 Call For Papers PLAS aims to provide a forum for exploring and evaluating ideas on the use of PROGRAMMING LANGUAGE and PROGRAM ANALYSIS TECHNIQUES to improve the SECURITY of SOFTWARE SYSTEMS. Strongly encouraged are proposals of new, speculative ideas; evaluations of new or known techniques in practical settings; and discussions of emerging threats and important problems. The scope of PLAS includes, but is not limited to: * Language-based techniques for security * Verification of security properties in software * Automated introduction and/or verification of security enforcement mechanisms * Program analysis techniques for discovering security vulnerabilities * Compiler-based security mechanisms, such as host-based intrusion detection and in-line reference monitors * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Applications, examples, and implementations of these security techniques Submission Guidelines The deadline for submissions is April 1, 2007. 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. Papers must be formatted according the ACM proceedings format: long submissions should not exceed 12 pages in this format; short submissions should not exceed 6 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. 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 Accepted papers will be made available to the participants at the workshop as part of an informal printed proceedings. Authors of accepted papers may choose whether they would like their work published in a formal proceedings as well, to be included in the ACM Digital Library and mailed to workshop participants on a CD shortly after the workshop. Those papers that are not published in the formal proceedings are not precluded 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. Program Committee Michael Hicks, University of Maryland, College Park (Chair) Martin Abadi, Microsoft Research and University of California, Santa Cruz Steve Chong, Cornell University Adriana Compagnoni, Stevens Institute of Technology Jeff Foster, University of Maryland, College Park K. Rustan M. Leino, Microsoft Research, Redmond Marco Pistoia, IBM T. J. Watson Research Center Andrei Sabelfeld, Chalmers University of Technology Dawn Xiaodong Song, Carnegie-Mellon University Eijiro Sumii, Tohoku University Jan Vitek, Purdue University David Walker, Princeton University Xialolan (Catherine) Zhang, IBM T. J. Watson Research Center From Francois.Pottier at inria.fr Thu Dec 14 03:12:26 2006 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Thu, 14 Dec 2006 09:12:26 +0100 Subject: [TYPES/announce] TLDI'07: Last Call for Participation Message-ID: <20061214081226.GA24394@yquem.inria.fr> ****************************************************************************** The 2007 ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) Affiliated with the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07) Call for Participation http://www.cs.berkeley.edu/~necula/tldi07/ ****************************************************************************** Preliminary programme Invited talks: Kathleen Fisher (AT&T Research) Conor McBride (University of Nottingham) Accepted papers: A Garbage-Collecting Typed Assembly Language Chris Hawblitzel, Heng Huang, Lea Wittie and Juan Chen A graphical presentation of MLF types with a linear-time unification algorithm Didier R?my and Boris Yakobowski An Open Framework for Foundational Proof-Carrying Code Xinyu Feng, Zhaozhong Ni, Zhong Shao and Yu Guo Modular Information Hiding and Type-Safe Linking for C Saurabh Srivastava, Michael Hicks and Jeffrey Foster Semantics of an Effect Analysis for Exceptions Nick Benton and Peter Buchlovsky System F with Type Equality Coercions Martin Sulzmann, Manuel Chakravarty, Simon Peyton Jones and Kevin Donnelly ****************************************************************************** Scope The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In light of this expanding role of types, the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) follows five previous International Workshops on types in compilation and language design (TIC'97, TIC'98, TIC'00, and TLDI'03 and TLDI'05), with the hope of bringing together researchers to share new ideas and results in this area. ****************************************************************************** General Chair Fran?ois Pottier INRIA Rocquencourt BP 105 78153 Le Chesnay Cedex FRANCE francois.pottier at inria.fr Program Chair George Necula University of California 783 Soda Hall Berkeley, CA 94720 necula at cs.berkeley.edu Program Committee Damien Doligez, INRIA Peter Lee, Carnegie Mellon University Andrew Kennedy, Microsoft Research, Cambridge Naoki Kobayashi, Tohoku University George Necula (chair), University of California, Berkeley Randy Pollack, Edinburgh University Norman Ramsey, Harvard University David Tarditi, Microsoft Research, Redmond Stephanie Weirich, University of Pennsylvania Hongwei Xi, Boston University From grust at in.tum.de Thu Dec 14 08:25:16 2006 From: grust at in.tum.de (Torsten Grust) Date: Thu, 14 Dec 2006 14:25:16 +0100 Subject: [TYPES/announce] PLAN-X 2007: Call for Participation [and Program Updates] Message-ID: Call for Participation P L A N - X 2 0 0 7 Programming Language Technologies for XML An ACM SIGPLAN Workshop collocated with POPL 2007 Nice, France -- January 20, 2007 www.plan-x-2007.org || UPDATE: - Christoph Koch (U Saarland, Germany) will give the || || PLAN-X 2007 keynote speech. || || - The detailed program is available (included below). || Please join us for PLAN-X 2007, the fifth workshop in the PLAN-X series, dedicated to the interaction and integration of programming language technology and the world of XML. The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming language technology can embrace and explain streaming XML transformations, types for XPath and XML updates, web service contracts, tree patterns in XQuery, LINQ and XML Schema, and more. PLAN-X 2007 will feature eight talks, three system demonstrations, extensive opportunity for discussion, and a keynote address (speaker to be announced). PLAN-X 2007 will be held in the Plaza Hotel (Nice, France) all-day on Saturday, January 20, 2007, just after and collocated with POPL 2007, the ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (January 17-19, 2007). -- PROGRAM (Saturday, January 20, 2007) 09:00--10:00 Welcome Invited Talk by Christoph Koch (U Saarland, Germany) (title to be announced) 10:00--10:30 Coffee break 10:30--12:00 Session 1: Research Papers Streaming XML Transformations Using Term Rewriting (Alain Frisch, Keisuke Nakano) How to Recognise Different Kinds of Tree Patterns From Quite a Long Way Away (Jan Hidders, Philippe Michiels, Jerome Simeon, Roel Vercammen) Lux: A Lightweight, Statically Typed XML Update Language (James Cheney) 12:00--01:30 Workshop lunch (provided) 01:30--03:10 Session 2: Research Papers and Demo Presentations A Theory of Contracts for Web Services (Giuseppe Castagna, Nils Gesbert, Luca Padovani) XML Transformation Language Based on Monadic Second Order Logic (Kazuhiro Inaba, Haruo Hosoya) Demo: MTran: An XML Transformation Language Bases on Monadic Second Order Logic (Kazuhiro Inaba, Haruo Hosoya) Demo: XCentric: A Logic-Programming Language for XML Processing (Jorge Coelho, M?rio Florido) Demo: LINQ to XSD (Ralf L?mmel) Demo: GeLaBa: A Framework to Define Classes of XML Documents and to Automatically Derive Specialized Infrastructures (Benoit Pin, Georges Andr? Silber) 03:10--04:00 Interactive Demos and Coffee break 04:00--05:30 Session 3: Research Papers XPath Typing Using a Modal Logic with Converse for Finite Trees (Pierre Geneves, Nabil Layaida, Alan Schmitt) Deciding Equivalence of Top-Down XML Transformations in Polynomial Time (Sebastian Maneth, Helmut Seidl) A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice (Nate Foster, Benjamin C. Pierce, Alan Schmitt) -- REGISTRATION PLAN-X 2007 is held in cooperation with POPL 2007. You can register for the workshop via the POPL 2007 registration process (online or offline). Please visit http://www.regmaster.com/conf/popl2007.html Registration rates are shown below. The rates are unaffected by the POPL 2007 early bird registration deadline. Note that you can upgrade an existing POPL 2007 registration to include PLAN-X 2007. Workshop-only registration is possible as well. ACM or SIGPLAN Member $89 Non-Member $99 Student $89 Your registration includes a copy of the PLAN-X 2007 informal proceedings, coffee breaks, and lunch. -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU M?nchen U Pisa Munich, Germany Pisa, Italy grust at in.tum.de ghelli at di.unipi.it -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Roquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders M?ller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rh?ne-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK) From afelty at site.uottawa.ca Thu Dec 14 23:48:49 2006 From: afelty at site.uottawa.ca (Amy Felty) Date: Thu, 14 Dec 2006 23:48:49 -0500 (EST) Subject: [TYPES/announce] CADE 2007 call for papers Message-ID: CADE-21 21st International Conference on Automated Deduction International University Bremen, Germany July 17-20, 2007 (workshops July 15-16) http://www.cadeconference.org/meetings/cade21 CALL FOR PAPERS CADE is the major forum for the presentation of research in all aspects of automated deduction. - Logics of interest include propositional, first-order, equational, higher-order, classical, intuitionistic, constructive, modal, temporal, many-valued, substructural, description, and meta-logics, logical frameworks, type theory and set theory. - Methods of interest include resolution, tableaux, term rewriting, induction, unification, constraint solving, SAT solving, decision procedures, saturation, model generation, model checking, natural deduction, sequent calculi, proof planning, proof presentation, proof checking, and explanation. - Applications of interest include hardware and software development, systems analysis and verification, deductive databases, functional and logic programming, computer mathematics, natural language processing, computational linguistics, robotics, planning, knowledge representation, and other areas of AI. Paper submission: Submission is electronic in PostScript or PDF format via the EasyChair system. Submitted papers must conform to the Springer LNCS style, preferrably using LaTeX2e and the Springer llncs class files. Submissions can be full papers, for work on foundations, applications, or implementation techniques (15 pages), as well as system descriptions (5 pages), for describing publicly available systems. The proceedings will be published in the Springer LNCS series. For further information and submission instructions, see http://www.cadeconference.org/meetings/cade21 Important dates: Submission of title and abstract: February 16, 2007 Submission papers: February 23, 2007 Notification of acceptance: April 16, 2007 Final version due: May 11, 2007 Workshops and tutorials: July 15-16, 2007 Conference: July 17-20, 2007 Conference Chair: Michael Kohlhase (IUB) Workshop and Tutorial Chair: Christoph Benzmueller (Saarland Univ) Program Chair: Frank Pfenning (CMU) Program Committee: David Basin ETH Zuerich Christoph Benzmueller Cambridge University Maria Paola Bonacina Universita degli Studi di Verona Simon Colton Imperial College London Gilles Dowek Ecole Polytechnique Rajeev Gore Australian National University Jean Goubault-Larrecq ENS Cachan Reiner Haehnle Chalmers University of Technology John Harrison Intel Corporation Michael Kohlhase International University Bremen Dale Miller INRIA-Futurs and Ecole Polytechnique Tobias Nipkow Technical University Munich Hans de Nivelle MPII Saarbruecken Albert Oliveras Technical University of Catalonia Frank Pfenning (chair) Carnegie Mellon University Ulrike Sattler University of Manchester Manfred Schmidt-Schauss University of Frankfurt Cesare Tinelli University of Iowa Andrei Voronkov University of Manchester Toby Walsh National ICT Australia and Univ of New South Wales From freek at cs.ru.nl Mon Dec 18 11:02:29 2006 From: freek at cs.ru.nl (Freek Wiedijk) Date: Mon, 18 Dec 2006 17:02:29 +0100 Subject: [TYPES/announce] Assistant Professor in Computer Mathematics in Nijmegen NL Message-ID: <20061218160229.GC16944@auriga.local> The Foundations group at the Radboud University Nijmegen invites applications for a 4 year position as: Assistant Professor (1.0 fte) in the area of Computer Mathematics The Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green campus, modern buildings, and state-of-the-art equipment, it has nine faculties and enrols over 17.500 students in approximately 90 study programmes. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal (a branch of the Rhine). The city has a rich history and one of the liveliest city centres in the Netherlands. The Foundations (F) group is part of the Institute for Computing and Information Sciences (ICIS) at the Radboud University Nijmegen. The group studies mathematical theories concerned with computability, provability and complexity. Notably, the group studies type theory, lambda calculus and logic and also applies these theories in the area of theorem proving and formalizing mathematics. Foundations has an excellent international reputation and its research program was singled out as "Excellent" in the last national research assessment. The group currently has a job opening for an assistant professor (1.0 fte), for the period of 4 years. The position is financed by the government sponsored mathematics cluster ``DIAMANT''.: Discrete, Interactive and Algorithmic Mathematics Algebra and Number Theory. See http://www.win.tue.nl/diamant/ Task description ---------------- You contribute actively to the research of the group, in particular in the field of Computer Mathematics, which is on the edge between computer science and mathematics and deals with research into computer formalized mathematics (formal definitions, computations and proofs) and covers the spectrum from the mathematical-logical foundations of systems for computer mathematics to the application of these systems (as computer tools) to problems from mathematics an computer science. This research forms part of the mathematics cluster DIAMANT. You will be active in the research activities of DIAMANT. You act as daily supervisor of PhD students. You actively contribute to the teaching activities at the BSc and MSc level carried out by the Foundations group, and to directing student projects. This captures courses in the Computing and Information Sciences curricula, but also courses taught within the DIAMANT cluster, more specifically the development of a course in Computer Mathematics that can both be followed by MSc students from icomputing science and mathematics (as part of the National master in mathematics). You also carry out group management and organizational tasks. Requirements ------------ We welcome strong candidates with a background in mathematics or computer science. Requirements are - a PhD degree - experience as a postdoc (or equivalent), preferably abroad - a strong research record as evidenced by publications and recognition by the international research community - affinity with the ongoing research within Foundations - demonstrated experience in attracting and managing external projects - ample teaching experience and very good teaching skills - strong committment to teaching - record of effective teamwork - good English speaking and writing skills are demanded, as well as the willingness to learn Dutch. Conditions of employment ------------------------ Maximum employment: 1.0 Maximum gross salary based on full-time employment: 4705 Euro Maximum salary scale: 12 Duration: 1 year with a possible extension for a 3 year period For additional information please see our website http://www.fnds.cs.ru.nl/ or contact prof.dr. Herman Geuvers Phone: +31 (0)24-3652603 E-mail: H.Geuvers at cs.ru.nl Applicants should submit their application to --------------------------------------------- pz at science.ru.nl or via surface mail to Radboud University Nijmegen, Faculty of Science, P&O Department, Attn. Drs. D. Reinders, PO Box 9010, 6500 GL Nijmegen, The Netherlands, referring to number 62.71.06 Applications should include a cover letter, a research statement, a teaching statement, a curriculum vitae, a list of publications, and the names of at least two referees. Application deadline: January 20, 2007 From Belaid.Benhamou at cmi.univ-mrs.fr Sun Dec 24 11:17:35 2006 From: Belaid.Benhamou at cmi.univ-mrs.fr (benhamou) Date: Sun, 24 Dec 2006 17:17:35 +0100 Subject: [TYPES/announce] Second CFP TABLEAUX 2007 Message-ID: <458EA81F.8070604@cmi.univ-mrs.fr> -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: 2NDCFPTABLEAUX.txt Url: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061224/748ad5c1/2NDCFPTABLEAUX.txt From ruy at cin.ufpe.br Mon Dec 25 11:45:16 2006 From: ruy at cin.ufpe.br (ruy@cin.ufpe.br) Date: Mon, 25 Dec 2006 14:45:16 -0200 (BRST) Subject: [TYPES/announce] WoLLIC'2007 - 2nd CFP Message-ID: <2547.200.164.147.77.1167065116.squirrel@webmail.cin.ufpe.br> [** sincere apologies for duplicates **] Call for Papers 14th Workshop on Logic, Language, Information and Computation (WoLLIC'2007) Rio de Janeiro, Brazil July 2-5, 2007 WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The Fourteenth WoLLIC will be held in Rio de Janeiro, Brazil, from July 2 to July 5, 2007, and sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computacao (SBC), and the Sociedade Brasileira de Logica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at www.cin.ufpe.br/~wollic/wollic2007/instructions.html A title and single-paragraph abstract should be submitted by February 23, and the full paper by March 2 (firm date). Notifications are expected by April 13, and final papers for the proceedings will be due by April 27 (firm date). PROCEEDINGS Proceedings, including both invited and contributed papers, will be published in advance of the meeting. Publication venue: Springer's Lecture Notes in Computer Science. INVITED SPEAKERS: Veronique Cortier (LORIA Nancy) Martin Escardo (Birmingham) Georg Gottlob (Oxford) Achim Jung (Birmingham) Louis Kauffman (U Illinois Chicago) Sam Lomonaco (U Maryland Baltimore) Paulo Oliva (London/QM) John Reif (Duke) Yde Venema (Amsterdam) STUDENT GRANTS ASL sponsorship of WoLLIC'2007 will permit ASL student members to apply for a modest travel grant (deadline: April 1, 2007). See www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES February 23, 2007: Paper title and abstract deadline March 2, 2007: Full paper deadline (firm) April 12, 2007: Author notification April 26, 2007: Final version deadline (firm) PROGRAM COMMITTEE Samson Abramsky (U Oxford) Michael Benedikt (Bell Labs) Lars Birkedal (ITU Copenhagen) Andreas Blass (U Michigan) Thierry Coquand (Chalmers U, Goteborg) Jan van Eijck (CWI, Amsterdam) Marcelo Finger (U Sao Paulo) Rob Goldblatt (Victoria U, Wellington) Yuri Gurevich (Microsoft Redmond) Hermann Haeusler (PUC Rio) Masami Hagiya (Tokyo U) Joseph Halpern (Cornell U) John Harrison (Intel UK) Wilfrid Hodges (U London/QM) Phokion Kolaitis (IBM Almaden Research Center) Marta Kwiatkowska (U Birmingham) Daniel Leivant (Indiana U) (Chair) Maurizio Lenzerini (U Rome) Jean-Yves Marion (LORIA Nancy) Dale Miller (Polytechnique Paris) John Mitchell (Stanford U) Lawrence Moss (Indiana U) Peter O'Hearn (U London/QM) Prakash Panangaden (McGill, Montreal) Christine Paulin-Mohring (Paris-Sud, Orsay) Alexander Razborov (Steklov, Moscow) Helmut Schwichtenberg (Munich U) Jouko Vaananen (U Helsinki) ORGANISING COMMITTEE Marcelo da Silva Correa (U Fed Fluminense) Renata P. de Freitas (U Fed Fluminense) Ana Teresa Martins (U Fed Ceara') Anjolina de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco, co-chair) Petrucio Viana (U Fed Fluminense, co-chair) WEB PAGE www.cin.ufpe.br/~wollic/wollic2007 --- From pmt6sbc at maths.leeds.ac.uk Fri Dec 29 19:30:22 2006 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Sat, 30 Dec 2006 00:30:22 +0000 (GMT) Subject: [TYPES/announce] CiE'07 - Final Call for Papers Message-ID: ************************************************************ CiE'07: COMPUTABILITY IN EUROPE 2007 http://www.mat.unisi.it/newsito/cie07.html University of Siena Siena, 18 - 23 June 2007 FINAL CALL FOR PAPERS SUBMISSION DEADLINE: FRIDAY 12 JANUARY, 2007 The CONFERENCE PROCEEDINGS will be published by Springer Lecture Notes in Computer Science (LNCS). There will also be journal special issues: APAL, JLC, TCS-C, ToCS - to which full versions of selected submissions to CiE 2007 will be invited to be submitted. For a list of conference topics see: http://www.amsta.leeds.ac.uk/~pmt6sbc/cie07.descr.html#themes SUBMISSION OF PAPERS: Jan. 12, 2007 Notification of Authors: Feb. 16, 2007 Deadline for Final Revisions: Mar. 9, 2007 Deadline for Submission of Informal Presentations: Apr. 27, 2007 PLENARY AND TUTORIAL SPEAKERS: Pieter Adriaans (Amsterdam) Yaakov Benenson (Harvard) Anne Condon (Vancouver) Stephen Cook (Toronto) Yuri Ershov (Novosibirsk) Wolfgang Maass (Graz) Sophie Laplante (Paris) Anil Nerode (Cornell) Roger Penrose (Oxford) Michael Rathjen (Leeds) Dana Scott (Carnegie Mellon) Robert I. Soare (Chicago) Philip Welch (Bristol) SPECIAL SESSIONS SPEAKERS: Eric Allender (Rutgers) Andrej Bauer (Ljubljana) Vasco Brattka (Cape Town) Douglas Bridges (Canterbury, NZ) John Case (Newark, Delaware) Pieter Collins (Amsterdam) Thierry Coquand (Goeteborg) Felix Costa (Lisbon) Barbara F. Csima (Waterloo) Abbas Edalat (London) Martin Escardo (Birmingham) Joerg Flum (Freiburg) Sergey S. Goncharov (Novosibirsk) Hajime Ishihara (Tokyo) Natasha Jonoska (Tampa, Florida) Michal Koucky (Prague) James Ladyman (Bristol) Maria Emilia Maietti (Padua) Giancarlo Mauri (Milan) Klaus Meer (Odense) Itamar Pitowsky (Jerusalem) Robert Rettinger (Hagen) Grzegorz Rozenberg (Leiden) Frank Stephan (Singapore) Neil Thapen (Prague) Giuseppe Trautteur (Naples) Heribert Vollmer (Hannover) Osamu Watanabe (Tokyo) Jiri Wiedermann (Prague) Damien Woods (Cork) Liang Yu (Nanjing) Martin Ziegler (Paderborn) WOMEN IN COMPUTABILITY WORKSHOP in association with the Computer Research Association's Committee on the Status of Women in Computing Research (CRA-W) Organisers: Paola Bonizzoni, Elvira Mayordomo Speakers: Anne Condon (Vancouver), Natasha Jonoska (Florida), Carmen Leccardi (Milan), and others PROGRAMME COMMITTEE: M. Agrawal (Kanpur) M. Arslanov (Kazan) G. Ausiello (Roma) A. Bauer (Ljubljana) A. Beckmann (Swansea) U. Berger (Swansea) A. Cantini (Firenze) B. Cooper (Leeds, co-chair) L. Crosilla (Firenze) J. Diaz (Barcelona) C. Dimitracopoulos (Athens) F. Ferreira (Lisbon) S. Goncharov (Novosibirsk) P. Gruenwald (Amsterdam) D. Harel (Rehovot) A. Hodges (Oxford) J. Kempe (Paris) G. Longo (Paris) B. Loewe (Amsterdam) J. Makowsky (Haifa) E. Mayordomo Camara (Zaragoza) W. Merkle (Heidelberg) F. Montagna (Siena) D. Normann (Oslo) T. Pheidas (Heraklion) G. Rozenberg (Leiden) G. Sambin (Padova) H. Schwichtenberg (Muenchen) W. Sieg (Carnegie Mellon) A. Sorbi (Siena, co-chair) I. Soskov (Sofia) P. van Emde Boas (Amsterdam) CONFIRMED SPONSORS OF CiE 2007: AILA (Associazione Italiana di Logica e Applicazioni), EATCS (European Association for Theoretical Computer Science), ASL (Association for Symbolic Logic), EACSL (European Association for Computer Science Logic), FoLLI (The Association of Logic, Language and Information), and The University of Siena. CiE 2007 will be co-located with CCA 2007, the annual CCA (Computability and Complexity in Analysis) Conference (Siena, College Santa Chiara, June 16-18, 2007): http://cca-net.de/cca2007/ ************************************************************ From morazanm at shu.edu Sun Dec 31 12:46:27 2006 From: morazanm at shu.edu (Marco T Morazan) Date: Sun, 31 Dec 2006 12:46:27 -0500 Subject: [TYPES/announce] Second Call for Papers: TFP 2007, New York, USA Message-ID: CALL FOR PAPERS Trends in Functional Programming 2007 New York, USA April 2-4, 2007 http://cs.shu.edu/tfp2007/ 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 articles presented at the symposium for publication in a high-profile volume. TFP 2007 is co-hosted by Seton Hall University and The City College of New York (CCNY) and will be held in New York, USA, April 2-4, 2007 at the CCNY campus. SCOPE OF THE SYMPOSIUM The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles leading-edge, previously unpublished research work Position Articles on what new trends should or should not be Project Articles descriptions of recently started new projects Evaluation Articles what lessons can be drawn from a finished project Overview Articles summarizing work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcomed: 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 to Animate/Prototype/Implement Systems from Formal or Semi-Formal Specifications o Functional Languages for Telecommunications Applications o Functional Languages for Embedded Systems o Functional Programming Applied to Global Computing o Functional GRIDs o Functional Programming Ideas in Imperative or Object-Oriented Settings (and the converse) o Interoperability with Imperative Programming Languages o Novel Memory Management Techniques o Parallel/Concurrent Functional Languages o Program Transformation Techniques o Empirical Performance Studies o Abstract/Virtual Machines and Compilers for Functional Languages o New Implementation Strategies o any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2007 program chair, Marco T. Morazan, at tfp2007 at shu.edu. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of articles for presentation at the symposium is based on the review of extended abstracts (6 to 10 pages in length) by the program committee. Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings and on-line. Further details can be found at the TFP 2007 website. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the draft 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. IMPORTANT DATES Abstract Submission: February 1, 2007 Notification of Acceptance: February 20, 2007 Registration Deadline: March 2, 2007 Camera Ready Full Paper Due: March 9, 2007 TFP Symposium: April 2-4, 2007 PROGRAMME COMMITTEE John Clements California Polytechnic State University, USA Marko van Eekelen Radboud Universiteit Nijmegen, The Netherlands Benjamin Goldberg New York University, USA Kevin Hammond University of St. Andrews, UK Patricia Johann Rutgers University, USA Hans-Wolfgang Loidl Ludwig-Maximilians Universit?t M?nchen, Germany Rita Loogen Philipps-Universit?t Marburg, Germany Greg Michaelson Heriot-Watt University, UK Marco T. Moraz?n (Chair) Seton Hall University, USA Henrik Nilsson University of Nottingham, UK Chris Okasaki United States Military Academy at West Point, USA Rex Page University of Oklahoma, USA Ricardo Pena Universidad Complutense de Madrid, Spain Benjamin C. Pierce University of Pennsylvania, USA John Reppy University of Chicago, USA Ulrik P. Schultz University of Southern Denmark, Denmark Clara Segura Universidad Complutense de Madrid, Spain Jocelyn S?rot Universit? Blaise Pascal, France Zhong Shao Yale University, USA Olin Shivers Georgia Institute of Technology, USA Phil Trinder Heriot-Watt University, UK David Walker Princeton University, USA ORGANIZATION Symposium Chair: Henrik Nilsson, University of Nottingham, UK Programme Chair: Marco T. Morazan, Seton Hall University, USA Treasurer: Greg Michaelson, Heriot-Watt University, UK Local Arrangements: Marco T. Morazan, Seton Hall University, USA ************************************************************************************ Dr. Marco T. Morazan TFP 2007 Program Committee Chair http://cs.shu.edu/tfp2007/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20061231/1305eba2/attachment.htm