CSL 2009

From ConfIDent
Deadlines
2009-05-25
2009-03-30
2009-04-06
2009-06-22
30
Mar
2009
Abstract
6
Apr
2009
Paper
25
May
2009
Notification
22
Jun
2009
Submission
organization
Metrics
Submitted Papers
122
Accepted Papers
34
Venue

Departamento de Matemática, Coimbra, Portugal

Loading map...

The 23rd International Workshop on Computer Science Logic (CSL) 2009


Topics

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 logics,
  • 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,
  • nonmonotonic reasoning.


Submissions

Submitted papers must be in pdf format, formatted according to the Springer's LNCS style and of no more than 15 pages. They must present work not previously published and they must not be submitted concurrently to another conference with refereed proceedings. Any closely related work submitted to a conference or journal before April62, 2009 must be reported to the PC chairs. 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.


Important Dates

Submission of Abstracts: 30 March, 2009
Submission of Full Papers: 6 April, 2009
Notification: 25 May, 2009
Final version: 22 June, 2009

Cookies help us deliver our services. By using our services, you agree to our use of cookies.