Email Gateway (Aug 18 2022 at 13:48): Email Gateway (Aug 18 2022 at 13:48):From: Pedro Quaresma <pedro@mat.uc.pt>
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.
Registration is open: http://www.mat.uc.pt/~csl/
Early registration deadline: 31 July, 2009.
List of accepted papers: http://www.mat.uc.pt/~csl/ap.html
This year, CSL is opening a special session for Informal
Presentations. There are four categories for these presentations:
1) PhD students. Students which are about to finish their PhD are
invited to report on their results. It is expected that submissions
have the support of the supervisor.
2) Recent PhDs. Researchers which recently finished their PhD are
invited to report on their theses.
3) Work in progress. Researches who would like to discuss work in
progress which is not yet in the stage for publications.
4) Other conference papers. Researchers who have a paper of interest
for the CSL community that has already been presented at another
conference.
Informal presentations must be in English. Please send an abstract of
1 to 3 pages in Springer's LNCS style by 20 July 2009 to the CSL
submission server: http://www.easychair.org/conferences/?conf=csl2009
Please provide, in the Abstract field of the Easychair form, the
following information:
For category 1: Name and e-mail of your supervisor.
For category 2: Date and University of your PhD defense.
For category 4: Conference where the paper is accepted.
The submissions are evaluated by the programme committee chairs,
taking into account the appropriateness for CSL and possible timetable
restrictions.
Suggested topics of interest include: 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, 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, and nonmonotonic
reasoning.
Young researchers are especially encouraged to send submissions for
informal presentations.
The submission deadline for informal presentations is 20 July, 2009.
Last updated: Nov 21 2024 at 12:39 UTC