$B$_$J$5$^(B
$B1"7W;;NLM}O@$N%o!<%/%7%g%C%W$N$40FFb$r$5$;$F$$$?$@$-$^$9!#(B $B1"7W;;NL$H$$$&$H$+$J$j8BDj$5$l$?OCBj$G$9$,(B $BO@M}$d%W%m%0%i%_%s%08@8l$H7W;;NLMm$_$NOC$J$i$"$kDxEY<u$1F~$l$F$/$l$k5$$5$/$J%o!<%/%7%g%C%W$G$9!#(B $B$J$*!":#G/EY$OElBg$N2OB<>4@1@h@8$,>7BT9V1i$r$5$l$^$9!#(B $B$h$m$7$1$l$P$<$REj9F!&;22C$r$48!F$$/$@$5$$!#(B
$B>H0f(B
DICE 2014 Fifth Workshop on Developments in Implicit Computational Complexity ==================================================================== http://dice14.tcs.ifi.lmu.de
Grenoble, France April 5-6, 2014 (a satellite event of ETAPS 2014)
Invited Speakers -----------------
* Akitoshi Kawamura (University of Tokyo) * Georg Moser (University of Innsbruck)
Important Dates ----------------
* Abstract Submission: January 5, 2014 * Notification: January 20, 2014 * Final version: February 10, 2014
Scope ------
The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are:
* to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; * to design methods suitable for static verification of program complexity.
Therefore ICC connects both to the study of complexity classes and to static program analysis. The workshop is open to contributions on various aspects of ICC including (but not exclusively):
* types for controlling complexity * logical systems for implicit computational complexity * linear logic * semantics of complexity-bounded computation * rewriting and termination orderings * interpretation-based methods for implicit complexity * programming languages for complexity-bounded computation * theoretical foundations of program complexity analysis * application of implicit complexity to security
Submission -----------
Authors are invited to submit an extended abstract of up to 5 pages. Accepted abstracts will be presented at the workshop. Submissions will be judged on originality, relevance, interest and clarity. Preference will be given to abstracts describing work (including work in progress) that has not been published elsewhere before the workshop. Any previous publication or submission of submitted work should be clearly indicated in the submission. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue.
Abstracts should be written in English and can be submitted in PDF form to the DICE 2014 EasyChair page: https://www.easychair.org/account/signin.cgi?conf=dice2014
Submissions of abstracts by PC members are allowed and encouraged.
Program Committee ------------------
* Martin Avanzini (University of Innsbruck) * Amir Ben-Amram (Tel-Aviv Academic College) * Pierre Clairambault (CNRS & ENS Lyon) * Daniel de Carvalho (Datalogisk Institut, K(IC8(Bbenhavns Universitet) * David Nowak (CNRS & Lille 1 University) * Michele Pagani (LIPN $Bc`(B Universit(IC)(B de Paris 13) * Romain P(IC)(Bchoux (Universit(IC)(B de Lorraine) * Brian Redmond (Grande Prairie Regional College, Canada) * Ulrich Sch(IC6(Bpp (LMU Munich) (Chair) * Kazushige Terui (RIMS, Kyoto University)
Steering Committee -------------------
* Patrick Baillot (ENS Lyon, CNRS) * Ugo Dal Lago (Universit(IC(B di Bologna) * Martin Hofmann (Ludwig-Maximilians-Universit(IC$(Bt M(IC<(Bnchen) * Jean-Yves Marion (Loria - INPL Nancy) * Simona Ronchi Della Rocca (Universit(IC(B di Torino)
------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 [email protected] http://www.kurims.kyoto-u.ac.jp/~terui/