Difference between revisions of "CSL 2009"

From Openresearch
Jump to navigation Jump to search
(Added page provenance(#264) and contribution type(#271))
 
Line 24: Line 24:
 
|has Proceedings DOI=https://doi.org/10.1007/978-3-642-04027-6
 
|has Proceedings DOI=https://doi.org/10.1007/978-3-642-04027-6
 
|has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F978-3-642-04027-6
 
|has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F978-3-642-04027-6
 +
|pageCreator=Tolga.karaarslan
 +
|pageEditor=Tolga.karaarslan
 +
|contributionType=1
 
}}
 
}}
 
The 23rd International Workshop on Computer Science Logic (CSL) 2009
 
The 23rd International Workshop on Computer Science Logic (CSL) 2009

Latest revision as of 20:21, 1 April 2022

CSL 2009
23rd International Workshop on Computer Science Logic
Ordinal 23
Event in series CSL
Dates 2009/09/07 (iCal) - 2009/09/11
Presence presence
Homepage: http://www.mat.uc.pt/~csl/
Submitting link: http://www.easychair.org/conferences/?conf=csl2009
Location
Location: Coimbra, Portugal
Loading map...

Important dates
Abstracts: 2009/03/30
Papers: 2009/04/06
Submissions: 2009/06/22
Notification: 2009/05/25
Papers: Submitted 122 / Accepted 34 (27.9 %)
Committees
PC chairs: Erich Grädel, Reinhard Kahle
Keynote speaker: MIKOŁAJ BOJAŃCZYK, Thierry Coquand, Martin Grohe, Yiannis Moschovakis, Paulo Oliva
Table of Contents

,



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