CSL 2011 - Annual Conference of the European Association for Computer Science Logic CSL 2011
Topics/Call fo Papers
Annual Conference of the European Association for Computer Science Logic
CSL 2011
September 12?15, 2011, Bergen, Norway
FIRST ANNOUNCEMENT
Programme Committee
Samson Abramsky (Oxford)
Andrea Asperti (Bologna)
Franz Baader (Dresden)
Matthias Baaz (Vienna)
Johan van Benthem
(Amsterdam/ Stanford)
Marc Bezem (Bergen, chair)
Patrick Blackburn (Nancy)
Andreas Blass (Michigan)
Jan van den Bussche (Hasselt)
Thierry Coquand (Gothenburg)
Nachum Dershowitz (Tel Aviv)
Valentin Goranko (Copenhagen)
Erich Gr¨adel (Aachen)
Wiebe van der Hoek (Liverpool)
Bart Jacobs (Nijmegen)
Reinhard Kahle (Lisbon)
Stephan Kreutzer (Oxford)
Viktor Kuncak (Lausanne)
Daniel Leivant (Indiana)
Benedikt Loewe (Amsterdam)
Jean-Yves Marion (Nancy)
Eugenio Moggi (Genova)
Albert Rubio (Barcelona)
Anton Setzer (Swansea)
Alex Simpson (Edinburgh)
John Tucker (Swansea)
Paweł Urzyczyn (Warsaw)
Helmut Veith (Vienna)
Andrei Voronkov (Manchester)
Organizing Committee
Isolde Adler
Marc Bezem
Magne Haveraaen
Michał Walicki
Uwe Wolter
Computer Science Logic (CSL) is the annual conference of the European Association
for Computer Science Logic (EACSL). The conference is intended for
computer scientists whose research activities involve logic, as well as for logicians
working on issues significant for computer science.
The 20th EACSL Annual Conference on Computer Science Logic (CSL 2011)
will take place in Bergen, Norway, from 12 to 15 September 2011.
Topics of interest include (but are not limited to) automated deduction and interactive
theorem proving, constructive mathematics and type theory, equational
logic and term rewriting, automata and games, modal and temporal logic, model
checking, decision procedures, logical aspects of computational complexity, finite
model theory, computational proof theory, logic programming and constraints,
lambda calculus and combinatory logic, categorical logic and topological semantics,
domain theory, database theory, specification, extraction and transformation
of programs, logical foundations of programming paradigms, verification and program
analysis, linear logic, higher-order logic, nonmonotonic reasoning.
Workshops. Proposals for satellite workshops on more specialized topics are
welcome.
Proceedings. The proceedings will be publised in the series LIPIcs, Leibniz International
Proceedings in Informatics.
The Ackermann Award for 2011 will be presented to the recipients at CSL11.
ConferenceWebsite. http://www.eacsl.org/csl11/
(under construction)
Conference address. CSL 2011, Department of Informatics, University of
Bergen, P.O.Box 7803, N-5020 Bergen, Norway, csl11-AT-eacsl.org
CSL 2011
September 12?15, 2011, Bergen, Norway
FIRST ANNOUNCEMENT
Programme Committee
Samson Abramsky (Oxford)
Andrea Asperti (Bologna)
Franz Baader (Dresden)
Matthias Baaz (Vienna)
Johan van Benthem
(Amsterdam/ Stanford)
Marc Bezem (Bergen, chair)
Patrick Blackburn (Nancy)
Andreas Blass (Michigan)
Jan van den Bussche (Hasselt)
Thierry Coquand (Gothenburg)
Nachum Dershowitz (Tel Aviv)
Valentin Goranko (Copenhagen)
Erich Gr¨adel (Aachen)
Wiebe van der Hoek (Liverpool)
Bart Jacobs (Nijmegen)
Reinhard Kahle (Lisbon)
Stephan Kreutzer (Oxford)
Viktor Kuncak (Lausanne)
Daniel Leivant (Indiana)
Benedikt Loewe (Amsterdam)
Jean-Yves Marion (Nancy)
Eugenio Moggi (Genova)
Albert Rubio (Barcelona)
Anton Setzer (Swansea)
Alex Simpson (Edinburgh)
John Tucker (Swansea)
Paweł Urzyczyn (Warsaw)
Helmut Veith (Vienna)
Andrei Voronkov (Manchester)
Organizing Committee
Isolde Adler
Marc Bezem
Magne Haveraaen
Michał Walicki
Uwe Wolter
Computer Science Logic (CSL) is the annual conference of the European Association
for Computer Science Logic (EACSL). The conference is intended for
computer scientists whose research activities involve logic, as well as for logicians
working on issues significant for computer science.
The 20th EACSL Annual Conference on Computer Science Logic (CSL 2011)
will take place in Bergen, Norway, from 12 to 15 September 2011.
Topics of interest include (but are not limited to) automated deduction and interactive
theorem proving, constructive mathematics and type theory, equational
logic and term rewriting, automata and games, modal and temporal logic, model
checking, decision procedures, logical aspects of computational complexity, finite
model theory, computational proof theory, logic programming and constraints,
lambda calculus and combinatory logic, categorical logic and topological semantics,
domain theory, database theory, specification, extraction and transformation
of programs, logical foundations of programming paradigms, verification and program
analysis, linear logic, higher-order logic, nonmonotonic reasoning.
Workshops. Proposals for satellite workshops on more specialized topics are
welcome.
Proceedings. The proceedings will be publised in the series LIPIcs, Leibniz International
Proceedings in Informatics.
The Ackermann Award for 2011 will be presented to the recipients at CSL11.
ConferenceWebsite. http://www.eacsl.org/csl11/
(under construction)
Conference address. CSL 2011, Department of Informatics, University of
Bergen, P.O.Box 7803, N-5020 Bergen, Norway, csl11-AT-eacsl.org
Other CFPs
- Medical Devices: EU Directives, Guidance Documents, CE Marking Process and ISO Certification Programs - Medical Devices webinar By ComplianceOnline
- The 12th International Conference on Web-Age Information Management
- CE Marking: Obtaining and Maintaining EU Compliance Under the Medical Device Directive - Medical Devices webinar By ComplianceOnline
- Validating Excel and Word Applications Documents - Medical Devices webinar By ComplianceOnline
- China - Compliance Processes for Life Science Products: - Clinical webinar By ComplianceOnline
Last modified: 2010-12-03 17:59:49