[Past issues of the newsletter are available at http://www.bell-labs.com/topic/conferences/lics/] 10th INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY (CONCUR'99) Eindhoven, The Netherlands, August 24-27, 1999. Call for papers http://www.win.tue.nl/concur99/ * Topics. Concurrency related aspects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, verification techniques, refinement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, tools and environments for programming and verification. * Submission. Papers of at most 15 pages, accompanied by a one-page abstract) should preferably be submitted electronically as uuencoded PostScript files to concur99@win.tue.nl before 26 February 1999. * Programme committee. Ralph Back, Jos Baeten (co-chair), Jan Bergstra, Manfred Broy, Rocco De Nicola, Andrew Gordon, Roberto Gorrieri, Tom Henzinger, Bengt Jonsson, Maciej Koutny, Nancy Lynch, Sjouke Mauw (co-chair), Arend Rensink, Philippe Schnoebelen, Robert de Simone, P.S. Thiagarajan, David Walker, Glynn Winskel. * Invited speakers. Rance Cleaveland, Javier Esparza, Rob van Glabbeek, Catuscia Palamidessi. TUTORIAL AND WORKSHOP ON LOGIC AND COGNITIVE SCIENCE Linking Finite Model Theory, Descriptive Complexity, and the Study of Cognition Call for Participation Workshop: April 16-18, 1999, Tutorial: April 12-15, 1999 Philadelphia, PA http://www.cis.upenn.edu/~ircs/workshops/lcs.html * The goal of the workshop is to generate a lively discussion between researchers in finite model theory and descriptive complexity and investigators in various areas of cognitive science. Obvious areas of potential interaction include the study of constraint satisfaction problems, the analysis and application of modal and temporal logics, and the construction of adequate languages for knowledge representation in areas from computational learning theory to robotics. It is our hope that the workshop will also bring to light further areas of potential interaction between finite model theory and cognitive science. * Program. The program of the workshop will consist of hour-long survey talks as well as shorter half-hour talks and the schedule will allow ample time for creative interaction. The workshop will be preceded by a four day program of tutorials on finite model theory, descriptive complexity theory, and their potential connections with areas of research in cognitive science. * Organizers. Moshe Y. Vardi and Scott Weinstein. * Invited speakers. Jon Barwise, Tom Dean, Henry Kautz, Christos Papadimitriou, Bill Rounds, Gyorgy Turan. * Tutorials will be presented by Johan van Benthem, Erich Graedel, Phokion Kolaitis, Leonid Libkin, Joel Spencer, Moshe Vardi. * Both the workshops and tutorials will be open events which anyone may attend. In order to encourage student participation in the tutorial program, small number of travel subsidies will be made available to graduate students. To be considered for such a subsidy, send mail to weinstein@cis.upenn.edu as soon as possible. A TUTORIAL WORKSHOP ON REALIZABILITY SEMANTICS AND APPLICATIONS Trento, Italy, June 30-July 1, 1999 Call for papers * There has been recently a reawaking of interest in many aspects of realizability interpretations -- especially as regards semantics of type theories for constructive reasoning and semantics of programming languages. But, the details of realizability can be quite technical, and so the aim of the workshop is to have several tutorial lectures on history, basic definitions and results, recent applications, connections to category theory, and then leave room for contributed research talks of 30 minutes each. Beside the topics mentioned above, contributions are solicited on applications of realizability to topics such as: Recursive Definitions of Types, Connections with Synthetic/Axiomatic Domain Theory, Applications to Normalization, Modal Logics, Logical Relations, Uses for Specification and Verification, Automated Deduction, and Extraction of Algorithms. Reports on work in progress are encouraged. * Submission. Send an extended abstract of at most 10 pages (as postscript file) to wr@athena.disi.unige.it before April 15, 1999. * Tutorial presentations will be given by Jaap van Oosten, Andrew Pitts, Aurelio Carboni, Luke Ong, Dag Normann, Ulrich Berger, Bernhard Reus. * Organizing Committee. Dana Scott, Giuseppe Rosolini, Andrew M. Pitts, Alex Simpson, Jaap van Oosten, Giuseppe Longo, Bernhard Reus, Dag Normann, Lars Birkedal. LABELLED DEDUCTION An edited volume intended for the Applied Logic Series http://www.informatik.uni-freiburg.de/~ld98/ * In September 1998, the University of Freiburg (Germany) hosted The First International Workshop on Labelled Deduction (LD'98). The members of the program committee of LD'98 will edit a volume collecting original papers on this topic. * Topics. Logical modeling based on Labelled Deduction Formal metatheory for, or based on, Labelled Deduction Hybrid reasoners and combinations of logics based on labelling Automated reasoning, implementation, and system support Annotated logic programming Applications * Submissions. Authors are invited to submit full papers of at most 18 pages to be received by January 31st, 1999. The primary means of submission is electronic, in PostScript format. Papers should be e-mailed to ld98@informatik.uni-freiburg.de. WORKSHOP ON FORMAL DESIGN OF SAFETY CRITICAL EMBEDDED SYSTEMS (FEmSys'99) March, 15 - 17, 1999, Munich, Germany Call for participation http://set.gmd.de/EES/femsys99 * Tutorials. A. Benveniste: Distributing Synchronous Programs; R. Budde: Object-Orientation and Synchronous Programming; E. Clarke: Model Checking; L. Feijs: Experiences with Formal Methods for Specification, Analysis and Testing; N. Halbwachs: Synchronous Programming of Reactive Systems; D. Harel: Some Issues on Behavioral Modeling of Complex Object-Oriented Systems; K. Mueller-Glaser: Hybrid System Modeling & Simulation 1; R. Nikoukhah: Hybrid System Modeling & Simulation 2; A. Pnueli: Tool Certification and Code Validation. * See the above URL for further details. 10th IFIP WG10.5 ADVANCED RESEARCH WORKING CONFERENCE ON CORRECT HARDWARE DESIGN AND VERIFICATION METHODS (CHARME'99) 27-29 September 1999, Bad Herrenalb (Germany) Call for papers http://goethe.ira.uka.de/hvg/charme99/ * Topics. Formal specification languages; formal methods for commercial hardware description languages; correctness preserving transformations; formal synthesis methods; use of theorem provers for verification; BDD and FSM based approaches, including model checking; correctness aspects in HW/SW co;design; verification of hybrid systems; abstraction and compositional techniques; formal verification of hybrid systems; formal verification of protocols; diagnosis of design errors; practical and industrial applications of formal techniques. * Submission. Papers should not exceed 15 pages (LNCS style). Prospective authors are invited to submit by email an electronic copy (Postscript files, UNIX gzip or compress, uuencoded) of their paper to the Program Chair, Laurence.Pierre@gyptis.univ-mrs.fr, by March 7, 1999. Papers should not exceed 15 pages in the LNCS style. * Program Committee. Francois Anceau, Dominique Borrione, Albert Camilleri, Paolo Camurati, Luc Claesen, Eduard Cerny, Werner Damm, Hans Eveking, Ganesh Gopalakrishnan, Mike Gordon, Werner Grass, Mark Greenstreet, Warren Hunt, Steven Johnson, Ramayya Kumar, Robert Kurshan, Tiziana Margaria, Andrew Martin, Ken McMillan, Tom Melham, Paolo Prinetto, Rajeev Ranjan, Mary Sheeran, Jorgen Staunstrup, Sofiene Tahar. RESEARCH POSITIONS AT BRICS RESEARCH CENTRE AND INTERNATIONAL PHD SCHOOL BRICS, Basic Research in Computer Science Universities of Aarhus and Aalborg http://www.brics.dk/ * There are several research positions at BRICS starting next year. Applications are welcome by researchers in theoretical computer science and related areas, especially, but not exclusively, within the following areas: Semantics of Computation, Logic, Algorithms and Data Structures, Complexity Theory, Data Security, Programming Languages, Distributed Computing, Verification. Openings, while likely to start as postdoctoral positions, generally for 1-2 years, have the possibility of extension to longer-term positions. * How to apply. Applications for positions should preferably be sent by e-mail (brics@brics.dk), preferably early in January 1999, and include: curriculum vitae, and a description of research interests, two or three names of referees for recommendations with the referees' regular mail addresses and, if possible, e-mail addresses, as well as an URL to WWW home directory if available. PROFESSORSHIP IN COMPUTER SCIENCE (PROGRAMMING THEORY) Department of Informatics, University of Bergen http://www.ii.uib.no/gen/profpututl.html * The successful applicant will be expected to join the research group in Foundations and Theory of Programming, whose current interests focus on: formal design and development of software systems, basic theory of software systems, in particular, the algebraic and logical foundations, and theory, design and implementation of specification and programming languages and tools. * Further information. See the URL above. 1999 IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP (CSFW12) Call for papers June 28-30, 1999, Mordano, Italy http://www.csl.sri.com/csfw/ * This workshop series brings together researchers in computer science to examine foundational issues in computer security. This year the workshop moves to continental Europe for the first time, near Bologna Italy. It is also timed to coordinate with FLoC (the Federated Logic Conference) taking place later the same week in relatively nearby Trento. * Topics. Access control, authentication, data and system integrity, database security, network security, distributed systems security, information flow, privacy, anonymity, security protocols, security models, formal methods for security, mobile code security, executable content. * Submission. Submission is open to anyone. Workshop attendance is limited to about 40 participants. Prospective participants should send an electronic copy of a paper (limit 7500 words) or proposal for panel discussion to Paul Syverson at syverson@itd.nrl.navy.mil. Please clearly identify the contact author and provide email addresses and telephone numbers (both voice and fax). (Paper submissions will be accepted if received by the deadline, but electronic submission of postscript is strongly encouraged.) Submissions are due February 1, 1999. * Program committee. Martin Abadi, Simon Foley, Dieter Gollman, Joshua Guttman, Dahlia Malkhi, John McLean, Jon Millen, Jon Mitchell, George Necula, Peter Ryan, Pierangela Samarati, Fred Schneider, Paul Syverson (chair), Dennis Volpano, Aris Zakinthinos. * Publication. Proceedings will be published by IEEE CS Press and will be available at the workshop. Selected papers will be invited for submission to the Journal of Computer Security. * Further information. E-mail syverson@itd.nrl.navy.mil, or see the URL above. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS '99) August 15-21, 1999, Wroclaw, Poland http://www.tcs.uni.wroc.pl/mfcs99/ * Topics. Design and analysis of algorithms and data structures; parallel, distributed and concurrent computing; cryptography and computer security; complexity theory; databases and knowledge-based systems; foundations of programming; formal specifications and programme development; model checking; semantics and logics of programs; automata, grammars and formal languages. * Submission deadline. March 11, 1999. * Programme Committee. Bogdan Chlebus, Friedhelm Meyer auf der Heide, Fritz Henglein, Stasys Jukna, Achim Jung, Michal Karonski, Matthias Krause, Mirek Kutylowski (co-chairman), Ernst Mayr, Leszek Pacholski (chairman), Wojciech Penczek, Jean-Eric Pin, Birgit Pfitzmann, Branislaw Rovan, Michael Rusinowitch, Georg Schnitger, Gabor Tardos, Mikkel Thorup, Pawel Urzyczyn, Thomas Wilke. * Further information. See the URL above. RESEARCH ASSOCIATE POST University of Manchester, Department of Computer Science http://www.cs.man.ac.uk/fmethods/projects/AHV-PROJECT/ahv-project.html * A new position for a research associate is now available on the EPSRC funded `Reasoning about Rainbow' Project, to develop formal support and analysis tools for asynchronous hardware design. Applicants should have at least a good honours degree in computer science or a related discipline, with relevant research experience (preferably to PhD level) being a significant advantage. A background in the development of formal semantics and verification techniques is desirable, together with an interest in applications to hardware modeling and analysis. * The post is available 1st February, 1999, and is tenable until 30th June 2001. Informal enquires may be made to: Professor Howard Barringer, email: rainbow@cs.man.ac.uk. PAUL ERDOS AND HIS MATHEMATICS Budapest, July 4-11, 1999 http://www.math-inst.hu/~erdos99 * The Hungarian Academy of Sciences, The Janos Bolyai Mathematical Society, The Eotvos Lorand University of Budapest and The Mathematical Institute of The Hungarian Academy of Sciences, announce a conference dedicated to the memory of Paul Erdos. The topics of the conference include all basic fields that Paul Erdos contributed to: Analysis, Combinatorics (including Combinatorial Algebra, Combinatorial Geometry and Theoretical Computer Science), Number Theory, Probability Theory, and Set Theory. * Plenary speakers. N. Alon, B. Bollobas, P. Borwein, P.D.T.A. Elliott, R.L. Graham, A. Hajnal, P. Komjath, D.S. Lubinsky, C. Pomerance, I.Z. Ruzsa, M. Simonovits and J. Spencer. * Further information. See the URL above. KNOWLEDGE REPRESENTATION MEETS DATABASES (KRDB'99) Linkoeping (Sweden), July 29-30, 1999 Call for papers http://www.cs.man.ac.uk/img/krdb99/ * Topics. In 1999, KRDB will focus on the representation, management, and retrieval of incomplete information. Topics include: Query languages for incomplete information, Null values and querying, Trade-off between the expressivity of the models for incomplete information and the complexity of query answering, Logical database approach: Closed vs. Open World Assumption, Completion axioms, etc, Modal operators and autoepistemic logics, Negation and incomplete information, Disjunctive databases and logic programs, Nonmonotonic reasoning for databases, Incompleteness in views and the view update problem, Nondeterministic queries, Object-oriented approaches to dealing with incomplete information, ABox reasoning in Description Logics and its relationship to databases. * Submission. Authors are invited to submit extended abstracts not exceeding 5 pages (LaTeX 12-point article-style pages). Email submissions as self-contained standard Postscript attachments to Enrico Franconi (franconi@cs.man.ac.uk) by March 15, 1999. * Workshop chairs. Enrico Franconi and Michael Kifer. * Program committee. Elisa Bertino, Antony Bonner, Alex Borgida, Mokrane Bouzeghoub, Jan Van den Bussche, Diego Calvanese, Vinay Chaudhri, Jan Chomicki, Rick Hull, Mathias Jarke, Georg Lausen, John Mylopoulos, Werner Nutt, Luigi Palopoli. 2nd INTERNATIONAL WORKSHOP ON FIRST-ORDER THEOREM PROVING (FTP'98) (Took place November 23-25, 1998 in Vienna, Austria) The proceedings are now available on the net: * http://www.logic.at/ftp98/ * ftp://ftp.logic.at/pub/ftp98/