Newsletter 108 January 10, 2007 ******************************************************************* * Past issues of the newsletter are available at http://www.informatik.hu-berlin.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://www.informatik.hu-berlin.de/lics/newsletters/inst.html * To unsubscribe, send an email with "unsubscribe" in the subject line to email@example.com ******************************************************************* REMINDER The LICS deadline is approaching. Titles & short abstracts due: 15 January 2007 Extended abstracts due: 22 January 2007 TABLE OF CONTENTS * VACANCIES LILLE - Permanent Researcher Positions UCLOUVAIN - Full-time academic position, Computing Science * AWARDS Ackermann Award - Call for Nominations * BOOKS Self-Reference - by Thomas Bolander, Vincent Hendricks and Stig Andur Pedersen (eds.) * CONFERENCES AND WORKSHOPS Universal Algebra and the Constraint Satisfaction Problem TARK XI - Call for Papers UTP 2007 - Call for Papers CAV 2007 - Call for Papers Logic Colloquium 2007 HyLo 2007 - Call for Papers Model-Theoretic Syntax AT 10 - Call for Papers SAS 2007 - Call for Papers RTA 2007 - Call for Papers FroCoS 2007 - Call for Papers DOMAINS VIII and Computability over Ccontinuous Data Types * JOURNALS Special Issue on Structural Operational Semantics - Call for Papers PERMANENT RESEARCHER POSITIONS IN LILLE * Applications are invited for permanent full-time researcher positions at Mostrare project, INRIA FUTURS LILLE, France. http://www.grappa.univ-lille3.fr/cgi-bin/twiki/view/Mostrare/Positions2007 * Subjects: XML database theory, logic, and automata machine learning from semi-structured documents * Position by INRIA and CNRS on all levels: junior researcher (PhD thesis + 4 years) experience junior researcher (PhD thesis + 5 years or more) senior researcher * Deadlines: January 15, 2007 : by CNRS February 15, 2007: by INRIA * Contact Mostrare (until end 2006 if possible) Joachim Niehren http://www.grappa.univ-lille3.fr/~niehren Rémi Gilleron http://www.grappa.univ-lille3.fr/~gilleron/indexeng.html FULL-TIME ACADEMIC POSITION, COMPUTING SCIENCE, UCLOUVAIN. BELGIUM * The Université catholique de Louvain (Belgium) invites applications for a full-time, tenure-track faculty position in the Department of Computing Science & Engineering (INGI), to be filled by September 1 2007. * Preference will be given to candidates with strong research achievements in one or several of the areas relating to the general fields of large-scale distributed systems, computer networks, artificial intelligence, programming systems or bioinformatics. Still, other areas of competence will also be considered, since qualifications take precedence over specialization. In case of similar qualifications, preference will be given to a candidate specialized in large-scale distributed systems. * Responsibilities include research, supervision of undergraduate and graduate students, as well as PhD theses, submission and management of research grants, and undergraduate/graduate teaching. * Rank and salary depend upon qualifications and experience. Highly qualified candidates may be given tenure immediately. * UCL is the oldest Belgian university and is consistently ranked in the top 100 universities worldwide. The Department belongs to the School of Engineering. it is located in the new city of Louvain-la-Neuve, 25 kms southeast of Brussels, the capital of Belgium, in the heart of Europe. * Additional information about the position may be obtained from: Prof. Yves Deville, Chair, Dept. Computing Science & Engineering Place Sainte-Barbe, 2, B-1348 Louvain-la-Neuve, Belgium Phone: +32 10 472067, Fax: +32 10 450345 E-mail: firstname.lastname@example.org URL: http://www.info.ucl.ac.be * Application deadline: January 19, 2007. * Additional details about the information to be provided and the administrative forms to be filled in is available from : http://www.uclouvain.be/en-38448.html ACKERMANN AWARD 2007 Nominations are sollicted for the Ackermann Award 2007. * The deadline for submission is 31.1.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. * 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. Abramsky (Oxford); - B. Courcelle (Bordeaux); - M. Grohe (Berlin); - M. Hyland (Cambridge); - A. Razborov (Moscow and Princeton). BOOK ANNOUNCEMENT Self-Reference CSLI Publications, 2006 by Thomas Bolander, Vincent Hendricks and Stig Andur Pedersen (eds.) ISBN (Paperback): 1-575-86516-5, 200 pages ISBN (Cloth): 1-575-86515-7, 200 pages * This is an anthology of previously unpublished essays on self-reference from some of the most outstanding scholars in philosophy, mathematics, and computer science. The volume is accessible to students and compelling for scholars as it reexamines the latest theories of self-reference, including those that attempt to explain and resolve the semantic and set-theoretic paradoxes. A thorough introduction by the editors sets the stage for original contributions from Andrea Cantini, Melvin Fitting, Anil Gupta, Vann McGee, Don Perlis, Graham Priest, Raymond M. Smullyan, and Stephen Yablo. * For over 2000 years self-reference, in the form of the Liar's Paradox, was considered a philosophical oddity. In 1902, self-referential set-theoretic paradoxes triggered a foundational crisis in mathematics. Since then, self-reference has continued to play a key role in philosophical and mathematical logic as well as, more recently, in theoretical computer science. This thought-provoking volume contains a collection of cutting-edge articles on this important topic. Moshe Y. Vardi * This is a book that every logician will want to read. The well-worn topics of self-reference and the paradoxes have been given new life in these papers by a distinguished group of logicians. Elliot Mendelson WORKSHOP ON UNIVERSAL ALGEBRA AND THE CONSTRAINT SATISFACTION PROBLEM (co-located with the International Conference on Order, Algebra, and Logics) Nashville, June 17 -- 20, 2007 http://www.math.vanderbilt.edu/~uacsp2007/ *Theme. The Constraint Satisfaction Problem (CSP) provides a framework for expressing a large number of combinatorial search problems that arise in wide areas of computer science and discrete mathematics. The primary goal of this workshop is to bring together researchers from the universal algebra/lattice theory and CSP communities to further the algebraic approach to several conjectures and problems related to constraint satisfaction. Tutorials will be offered to provide participants with the requisite background material and then a series of invited lectures on recent work on the CSP and algebra will be given. Secondary goals are to foster and strengthen links between computer science and mathematics and to provide graduate students and junior researchers with a rich and interesting set of new problems to work on. * Invited Speakers: Albert Atserias (Technical University of Catalonia), Manuel Bodirsky (Humboldt University), Andrei Bulatov (SFU), Hubie Chen (University Pompeu Fabra), Victor Dalmau (University Pompeu Fabra), Andrei Krokhin (University of Durham), Gabor Kun (University of Memphis), Benoit Larose (Champlain Regional College), Miklòs Maròti (University of Szeged), Petar Markovic (University of Novi Sad), Ralph McKenzie (Vanderbilt), Pascal Tesson (Laval University), Heribert Vollmer (University of Hannover), Ross Willard (University of Waterloo), Lázsló Zádori (University of Szeged) * A limited number of contributed talks will be presented. The deadline to submit an abstract is Wednesday, February 28, 2007. * Financial support will be available to a limited number of participants. Preference will be given to graduate students and post-doctoral fellows whose participation is not fully supported by other sources. Requests for support should be submitted as soon as possible but no later than March 15, 2007. * Organizing committee: Andrei Bulatov (SFU),Victor Dalmau (UPF), Ralph McKenzie (Vanderbilt) (Chair), Matt Valeriote (McMaster) ELEVENTH CONFERENCE ON THEORETICAL ASPECTS OF RATIONALITY AND KNOWLEDGE (TARK XI:) June 25-27, 2007 Brussels, Belgium http://www.tark.be * The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not limited to, semantic models for knowledge, belief, and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, epistemic logic, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision, and foundations of multi-agent systems. * Submission deadline: Jan. 30, 2007; See http://www.tark.be for details. Strong preference will be given to papers whose topic is of interest to an interdisciplinary audience, and papers should be accessible to such an audience. * Program committee: Sergei Artemov (CUNY), Vincent Conitzer (Duke), Lance Fortnow (Chicago), Aviad Heifetz (Open University, Israel), Franz Huber (California Institute of Technology), Adam Kalai (Georgia Institute of Technology), Ron Lavi (Technion), Jerome Lang (IRIT), Martin Meier (Instituto de Analisis Economico), Dov Samet (chair - Tel Aviv University) Burkhard Schipper (University of California, Davis_ Robert Stalnaker (MIT), Marc Pauly (Stanford), Muhamet Yildiz (MIT) UTP'07 AT IFM: UNIFYING THEORIES OF PROGRAMMING (a special session of IFM2007) First call for papers St Anne's College, Oxford, UK; 2nd to 6th July 2007 http://www.ifm2007.org * Motivation. 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. * Themes. 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. * Submission Deadline : 29th January 2007, via the website. * Session co-chairs. Phil Brooke (University of Teesside, UK), Yifeng Chen (University of Durham, UK) COMPUTER AIDED VERIFICATION (CAV 2007) 19th International Conference Berlin, Germany, July 3-7, 2007 Call for Papers http://www.cav2007.org * Aims and Scope: CAV'07 is the 19th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. * Topics of interest include: algorithms and tools for verifying models and implementations; hardware verification techniques; hybrid systems and embedded systems verification; program analysis and software verification; modeling and specification formalisms; deductive, compositional, and abstraction techniques for verification; testing and runtime analysis based on verification technology; applications and case studies; verification in industrial practice. * Submission: There are two categories of submissions: regular papers (not to exceed 13 pages) and tool presentations (not to exceed 4 pages). Information concerning the procedure for submissions will be available on the conference home page. * Submission Deadline: January 28, 2007 (firm) * Program Committee: Parosh Abdullah (Uppsala U), Rajeev Alur (U Penn), Sergey Berezin (Synopsis), Armin Biere (JKU Linz), Roderick Bloem (TU Graz), Ahmed Bouajjani (U Paris 7), Alessandro Cimatti (IRST Trento), Edmund M. Clarke (CMU), Werner Damm (U Oldenburg) (Co-Chair), E Allen Emerson (U Texas), Limor Fix (Intel), Patrice Godefroid (Microsoft Research), Ganesh Gopalakrishnan (U of Utah), Susanne Graf (Verimag), Orna Grumberg (Technion), Holger Hermanns (Saarland U) (Co-Chair), Robert Jones (Intel), Orna Kupferman (Hebrew U), Robert Kurshan (Cadence), John Lygeros (ETH Zuerich), Tom Melham (Oxford U), Ken McMillan (Cadence), Jakob Rehof (U Dortmund), Koushik Sen (UC Berkeley), Fabio Somenzi (U Boulder), Ashish Tiwari (SRI International), Frits Vaandrager (U Nijmegen), Yaron Wolfstal (IBM Haifa) 2007 ASL EUROPEAN SUMMER MEETING (LOGIC COLLOQUIUM '07) Wroclaw, Poland July 13--19, 2007 * This meeting will be co-located with the 2007 International Colloquium on Automata, Languages and Programming (ICALP 2007; see the ASL 'other meetings' wepage and http://www.eatcs.org/) and the Twenty-second Annual IEEE Symposium on Logic In Computer Science (LICS 2007; see the ASL 'other meetings' webpage and http://users.comlab.ox.ac.uk/luke.ong/LICS07/). * The Program Committee includes: A. Andretta, F. Delon, U. Kohlenbach, S. Lempp (Chair), P. Maddy, J. Marcinkowski, L. Newelski, A. Pitts, P. Pudlak, S. Solecki, F. Stephan, and G. Sundholm. * The Local Organizing Committee includes: J. Marcinkowski (Chair), T. Jurdzinksi, E. Kieronski, P. Kowalski, and B. Rusiecka. * Abstracts of contributed talks submitted by ASL members will be published in The Bulletin of Symbolic Logic if they satisfy the Rules for Abstracts (see above). Abstracts---hard copy or email---should be received before the deadline of April 17, 2006. The address to which abstracts should be sent will soon be announced at http://www.aslonline.org. International Workshop on Hybrid Logic 2007 (HyLo 2007) (affiliated with ESSLLI 2007) First Call for Papers Dublin, 6 - 10 August, 2007 http://hylomol.ruc.dk/HyLo2007 * Theme. Hybrid logic is a branch of modal logic allowing direct reference to worlds/times/states. It is easy to justify interest in hybrid logic on the grounds of applications as the additional expressive power is very useful. In addition, hybrid-logical machinery improves the behaviour of the underlying modal formalism. The topic of the HyLo workshop of 2007 is not only standard hybrid-logical machinery like nominals, satisfaction operators, and the downarrow binder, but generally extensions of modal logic that increase its expressive power.The workshop HyLo 2007 will be relevant to a wide range of people, including those interested in description logic, feature logic, applied modal logics, temporal logic, and labelled deduction. * Submission. Details will be announced at the workshop web page. The accepted papers will appear in the workshop proceedings published by ESSLLI. It is planned to publish revised versions of the accepted papers in a special issue of Journal of Logic, Language and Information. * Submission deadline: March 8, 2007 * Program committee. Carlos Areces (INRIA Lorraine, France) Patrick Blackburn (INRIA Lorraine, France) Thomas Bolander (Technical University of Denmark) - Co-Chair Torben Braüner (Roskilde University, Denmark) - Chair Mai Gehrke (New Mexico State University, USA) Valeria de Paiva (PARC, USA) Jørgen Villadsen (Technical University of Denmark) * Invited speakers. - Balder ten Cate (University of Amsterdam, The Netherlands) - Ian Hodkinson (Imperial College, UK) WORKSHOP: MODEL-THEORETIC SYNTAX AT 10 (affiliated with ESSLLI 2007) Call for Papers Dublin, Ireland, August 13--17, 2007 http://cs.earlham.edu/esslli07mts * Theme. Descriptive approaches to formalization of theories of syntax in terms of classes of ordinary mathematical structures. Descriptive Complexity, Monadic Second-Order Logic, Modal Logic, semantically constrained extensions of FOL/MSO, other declarative approaches to defining syntactic structures, automata and transducers over complex structures, logically defined translations between structures, logical query languages, model checking, applications to existing grammar formalisms, applications to Linguistics. * All submissions must be done electronically via the workshop website. * Submission Deadline: 15 February 2007 * Program committee: Patrick Blackburn (INRIA Lorraine), Laura Kallmeyer (Universität Tübingen), Stephan Kepser (Universität Tübingen, co-chair), Marcus Kracht (UCLA), Jens Michaelis (Universität Osnabrück), Uwe Mönnich (Universität Tübingen), Drew Moshier (Chapman University ), Lawrence Moss (Indiana University), Adi Palm (Universität Passau), Geoffrey Pullum (University of California, Santa Cruz), Frank Richter ( Universität Tübingen), James Rogers (Earlham College, co-chair), Edward Stabler (UCLA), Hans-Jörg Tiede (Illinois Wesleyan University). STATIC ANALYSIS SYMPOSIUM (SAS 2007) Call for Papers 22-24 August 2007, Kongens Lyngby, Denmark (co-located with LOPSTR 2007) url: http://www.imm.dtu.dk/sas2007 email: email@example.com * 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 * 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 * 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 published 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 CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA 2007) (Part of RDP'07; co-located with TLCA'07) Second Call for Papers Paris, France, June 26-28, 2007 http://www.lsv.ens-cachan.fr/rdp07/rta.html * THEME. RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; analysis of cryptographic protocols; proof checking; reasoning about programming languages and logics; program transformation; Foundations: matching and unification; narrowing; completion techniques; strategies; constraint solving; explicit substitutions; tree automata; termination; combination; Frameworks: string, term, graph, and proof rewriting; lambda-calculus and higher-order rewriting; proof nets; constrained rewriting/deduction; categorical and infinitary rewriting; integration of decision procedures; Implementation: compilation techniques; parallel execution; rewrite tools; termination checking; Semantics: equational logic; rewriting logic; rewriting models of programs. * SUBMISSIONS. Submission categories include regular research papers and system descriptions. Problem sets and submissions describing interesting applications of rewriting techniques are also welcome. The page limit for submissions is 15 pages in Springer LNCS style (10 pages for system descriptions). The submission Web page will be made available beginning of December. As usual, the proceedings of RTA'07 will be published in the Springer LNCS series. * IMPORTANT DATES: Jan 26, 2007: Deadline for electronic submission of title and abstract Jan 31, 2007: Deadline for electronic submission of papers Apr 02, 2007: Notification of acceptance of papers Apr 23, 2007: Deadline for final versions of accepted papers * PROGRAM COMMITTEE: Alessandro Armando (Genova, Italy), Franz Baader (Dresden, Germany, Chair), Roberto Di Cosmo (Paris, France), J=FCrgen Giesl (Aachen, Germany), Deepak Kapur (Albuquerque, USA), H=E9l=E8ne Kirchner (Nancy, France), Barbara K=F6nig (Duisburg, Germany), Salvador Lucas (Valencia, Spain), Narciso Mart=ED-Oliet (Madrid, Spain), Tobias Nipkow (Munich, Germany), Femke van Raamsdonk (Amsterdam, The Netherlands), Aaron Stump (St. Louis, USA), Sophie Tison (Lille, France), Ralf Treinen (Cachan, France) * CONFERENCE CHAIRS: Ralf Treinen (Cachan, France), Xavier Urbain (Paris, France) * For more information, see webpage INTERNATIONAL SYMPOSION ON FRONTIERS OF COMBINING SYSTEMS (FroCoS 2007) Call for Papers University of Liverpool, UK, September 10-12, 2007 http://www.csc.liv.ac.uk/~frocos07 *Theme. Typical topics of interest include: combinations of logics such as combined predicate, temporal, modal, or epistemic logics; combinations and modularity in ontologies; combination of decision procedures, of satisfiability procedures, and of constraint solving techniques; combinations and modularity in term rewriting; integration of equational and other theories into deductive systems; combination of deduction systems and computer algebra; logical aspects of combining and modularising programs and specifications. * Submission Deadline: April 30, 2007 * Programme Committee: Alessandro Armando, Franz Baader, Jacques Calmet, Silvio Ghilardi, Bernhard Gramlich, Deepak Kapur, Boris Konev, Till Mossakowski, Joachim Niehren, Albert Oliveras, Dirk Pattinson, Silvio Ranise, Christophe Ringeissen, Ulrike Sattler, Amilcar Sernadas, Cesare Tinelli, Luca Vigano, Frank Wolter JOINT WORKSHOP DOMAINS VIII AND COMPUTABILITY OVER CONTINUOUS DATA TYPES Announcement and Call for Abstracts Akademgorodok, Novosibirsk, September 11 -- 15, 2007 www.sbras.ru/ws/domains/ (Switch to English - upper right corner) email: firstname.lastname@example.org * Theme: The Workshop 'Domains' series is aimed at computer scientists and mathematicians alike who share an interest in the mathematical foundations of computation. It focusses on domain theory, its applications and related topics. It will be combined with topics based on the German--Russian project 'Computability Over Non-discrete Structures: Models, Semantics, Complexity'. * Scope: Topics for this workshop include, but are not limited to domains and topology for semantics, effective domains and spaces, computation over continuous spaces, program semantics, models of sequential computation, lambda calculus, realizability, proof mining, constructive mathematics and its semantics, computability theory, computable models, admissible sets. * Participation: If you would like to participate, indicate your interest at an early stage: email@example.com * Abstracts: One page abstracts should be submitted to firstname.lastname@example.org. They will be dealt with on a first come/first served basis. Deadline: 15 May 2007. * Conference Proceedings will be published in a Journal. Submission for the Proceddings will be after the Workshop. * Deadline for registration: 30 June, 2007 * Programme Committee: Yuri Ershov, Sergei Goncharov (both Sobolev Institute of Mathematics, Novosibirsk), Achim Jung (University of Birmingham), Klaus Keimel (Chair), Ulrich Kohlenbach (both Darmstadt University of Technology), Andrei Morozov (Co-Chair, Sobolev Institute of Mathematics, Novosibirsk), Victor Selivanov (Novosibirsk State Pedagogical University), Dieter Spreen (University of Siegen) * Workshop Secretary: Alexei Stukachev (email@example.com) SPECIAL ISSUE ON STRUCTURAL OPERATIONAL SEMANTICS Information & Computation, Elsevier Call for papers http://www.cse.unsw.edu.au/~rvg/SOS2006/spissue * Scope: 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 (SOS). Papers reporting on applications of SOS to software engineering and other areas of computer science are also welcome. This special issue is an outgrowth of the series of SOS workshops, which started in 2004, and serves in part as an 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. N.B. An extended abstract or short version of a paper submitted for the special issue may also be submitted for presentation at the SOS 2007 workshop, see http://www.cse.unsw.edu.au/~rvg/SOS2007/ * Submissions: All submissions will be refereed and subjected to the same quality criteria, meeting the standards of Information and Computation. * Submission deadlines: title and abstract by 15 January 2007, full paper by 15 February 2007. * Guest editors: Rob van Glabbeek and Peter Mosses * For further information see the URL above.
Back to the LICS web page.