=========================================
Topics in Theoretical Computer Science (TTCS 2015)
http://www.ttcs.ir/
Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
August 26-28, 2015
*Submission Deadline:*
May 15, 2015
========================================
Scope
------------------------------
TTCS is a new bi-annual conference series, intending to serve as a forum
for novel and high-quality research in all areas of Theoretical Computer
Science. The conference is held in cooperation with the European
Association for Theoretical Computer Science.
There will be a number of satellite events at TTCS, These will feature
presentation of early research results, and position papers. There will
also be a forum for Ph.D. students to receive comments about their ongoing
research projects.
Topics of interest include but are not limited to:
- algebra and co-algebra in computer science,
- algorithms and data structures,
- algorithmic coding theory,
- algorithmic graph theory and combinatorics,
- approximation algorithms,
- computational complexity,
- computational geometry,
- computational learning theory,
- concurrency theory,
- coordination languages,
- economics and algorithmic game theory,
- fixed parameter algorithms,
- formal verification and model-based testing,
- logic in computer science,
- machine learning
- methods, models of computation and reasoning for embedded, hybrid, and
cyber-physical systems,
- optimization,
- parallel and distributed algorithms,
- quantum computing,
- randomness in computing,
- stochastic and probabilistic specification and reasoning
- theoretical aspects of other CS-related research areas, e.g.,
computational science, databases, information retrieval, and networking,
- theoretical cryptography,
- theory of programming languages, and
- type theory and its application in program verification.
Keynote Speakers
------------------------------
Anuj Dawar, Cambridge University, UK
Michael Fellows, Charles Darwin University, Australia
Mehrnoosh Sadrezadeh, Queen Mary University of London, UK
Submission
------------------------------
For the main conference, we solicit research papers in all areas of
theoretical computer science. All papers will undergo a rigorous review
process and will be judged based on their originality, soundness,
significance of the results, and relevance to the theme of the conference.
Papers should be written in English. Research papers should not exceed 15
pages in the LNCS style format. Multiple and/or concurrent submission to
other scientific venues is not allowed and will result in rejection as well
as notification to the other venue. Any case of plagiarism (including
self-plagiarism from earlier publications) will result in rejection as well
as notification to the the authors' institutions.
Papers should be submitted through our EasyChair submission website:
https://www.easychair.org/conferences/?conf=ttcs2015 . The web site is open
for submissions.
Important Dates
------------------------------
- *Paper Submission:* May 15, 2015 (Anywhwere on Earth)
- *Author notification:* June 26, 2015
- *Camera ready paper due:* July 10, 2015
- *Conference:* August 26-28, 2015
Program Committee
------------------------------
*Track A: Algorithms and Complexity*
- Mohammad Ali Abam, Sharif University of Technology, Iran
- Saeed Akbari, Sharif University of Technology, Iran
- Saeed Alaei, Cornell University, USA
- Mohammad Hossein Bateni, Google Research, USA
- Salman Beigi, IPM, Iran
- Amir Daneshgar, Sharif University of Technology, Iran
- Fedor Fomin, University of Bergen, Norway
- Ali Ghodsi, University of Waterloo, Canada
- Mohammad Ghodsi, Sharif University of Technology, Iran
- Mohammad T. Hajiaghayi, University of Maryland, USA (Chair)
- Amin Karbasi, Yale University, USA
- Nicole Immorlica, Microsoft Research, USA
- Amit Kumar, IIT Delhi, India
- Mohammad Mahdian, Google Research, USA
- Hamid Mahini, University of Maryland, USA
- Bojan Mohar, Simon Fraser University, Canada
- Mohammad Mahmoody, University of Virginia, USA
- Vahab Mirrokni, Google Research, USA
- Morteza Monemizadeh, Frankfurt University, Germany
- Shayan Oveisgharan, UC Berkeley and University of Washington, USA
- Debmalya Panigrahi, Duke University, USA
- Jorg Sack, Carleton University, Canada
- Mohit Singh, Microsoft Research, USA
- Dimitrios M. Thilikos, CNRS, France and University of Athens, Greece
- Suresh Venkatasubramanian, University of Utah, USA
- Jan Vondrak, IBM Almaden Research Center, USA
*Track B: Logic, Semantics, and Programming Theory*
- Farhad Arbab, CWI and Leiden University, The Netherlands
- S. Arun-Kumar, IIT Delhi, India
- Ilaria Castellani, INRIA Sophia Antipolis, France
- Dave Clarke, Uppsala University, Sweden and KU Leuven, Belgium
- Pieter Cuijpers, Eindhoven University of Technology, The Netherlands
- Fatemeh Ghassemi, Tehran University, Iran
- Matthew Hennessy, Trinity College Dublin, Ireland
- Ichiro Hasuo, University of Tokyo, Japan
- Mahdi Jaghoori, AMC University of Amsterdam, The Netherlands
- Jeroen Keiren, Vrije Universiteit Amsterdam, The Netherlands
- Bas Luttik, Eindhoven University of Technology, The Netherlands
- Jose Meseguer, University of Illinois at Urbana, USA
- Lary Moss, Indiana University, USA
- Mohammad Mousavi, Halmstad University, Sweden (Chair)
- Jun Pang, University of Luxembourg, Luxembourg
- Gerardo Schneider, Chalmers University of Technology, Sweden
- Marjan Sirjani, Reykjavik University, Iceland
- Walter Vogler, Augsburg University, Germany
- Tim Willemse, Eindhoven University of Technology, The Netherlands
皆様
神戸大学の池上と申します。
来週の火曜日13:30から行われる神戸集合論セミナーのお知らせです。
講演者は、カーネギーメロン大学でポスドクをしている Nam Trang さんです。
どうぞお気軽にお越しください。
問合せ先:
池上 大祐
神戸大学大学院システム情報学研究科
E-mail: ikegami(a)people.kobe-u.ac.jp
=========================================================================
日時:2015年5月19日(火)13:30-15:00
講演者:Nam Trang (Carnegie Mellon University)
場所:神戸大学自然科学総合研究棟3号館4階421室(プレゼンテーション室)
交通:阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車、
「神大本部工学部前」停留所下車、徒歩すぐ。
http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html (「ローカルマップ」の59番の建物)
題目: Descriptive inner model theory and forcing axioms.
アブストラクト:
We discuss some recent developments in descriptive inner model theory,
focusing on works on constructing canonical inner models of large
cardinals and determinacy from combinatorial consequences of forcing
axioms such as PFA. The upshot is the speaker’s result, built on
earlier works of Steel and Sargsyan, that PFA implies the existence of
models of “AD_R + Θ is regular”. The talk is mostly a survey talk and
we aim to explain definitions and notions involved, hence should be
accessible to general set theorists.
=========================================================================
CALL FOR PARTICIPATION
WoLLIC 2015
22nd Workshop on Logic, Language, Information and Computation
July 20-23, 2015
Bloomington, IN, USA
CO-LOCATED WITH
Conference on Computing Natural Reasoning (CoCoNat'15 <http://www.indiana.edu/~iulg/wollic/coconat.htm>)
July 19-20, 2015
SCIENTIFIC SPONSORSHIP
Interest Group in Pure and Applied Logics (IGPL)
The Association for Logic, Language and Information (FoLLI)
Association for Symbolic Logic (ASL)
European Association for Theoretical Computer Science (EATCS)
European Association for Computer Science Logic (EACSL)
Sociedade Brasileira de Computação (SBC)
Sociedade Brasileira de Lógica (SBL)
ORGANISATION
Department of Computer Science, Indiana University, USA
Program in Pure and Applied Logic, Indiana University, USA
Centro de Informática, Universidade Federal de Pernambuco, Brazil
HOSTED BY
Department of Computer Science, Indiana University, USA
CALL FOR PARTICIPATION
WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-second WoLLIC will be held at the Department of Computer Science, Indiana University, Bloomington, from July 20th to 23rd, 2015. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).
PROCEEDINGS
The proceedings of WoLLIC 2015, including both invited and contributed papers, will be published in advance of the meeting as volume 9160 in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2015 issue of Mathematical Structures in Computer Science, CUP (tbc).
INVITED TALKS
. Adriana Compagnoni (Stevens Institute, USA)
Modeling Language Design for Complex Systems Simulation
. Nina Gierasimczuk (University of Amsterdam)
Learning in the Limit, General Topology and Modal Logic
. John Harrison (Intel, USA)
Formalization of Mathematics for Fun and Profit
. Peter Jipsen (Chapman U, USA)
From Residuated Lattices via GBI-algebras to BAOs
. André Joyal (U du Québec Montreal, Canada)
Categories of Games
. Mehrnoosh Sadrzadeh (Queen Mary, UK)
Multi-Linear Algebraic Semantics for Natural Language
. Chung-chieh Shan (Indiana U, USA)
(tba)
. Alexandra Silva (Radboud U Nijmegen, The Netherlands)
Towards a Nominal Chomsky Hierarchy.
TUTORIALS
Nina Gierasimczuk (University of Amsterdam)
John Harrison (Intel, USA)
André Joyal (U du Québec Montreal, Canada)
Alexandra Silva (Radboud U Nijmegen, The Netherlands)
SPECIAL SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS
In remembrance of the 30th anniversary of the passing away of Julia Hall Bowman Robinson (December 8, 1919 – July 30, 1985), an American mathematician best known for her work on decision problems and Hilbert's Tenth Problem, the program of the meeting will include a screening of George Csicsery's documentary "Julia Robinson and Hilbert's Tenth Problem" (2008). As a tribute to a recent breakthrough in mathematics, there will also be a screening of Csicsery's "Counting from Infinity: Yitang Zhang and the Twin Prime Conjecture" (2015) which centers on a very exciting string of mathematical discoveries that occurred during 2013, started when Yitang Zhang, a virtually unknown mathematician working as adjunct professor at the University of New Hampshire, submitted a paper to the Annals of Mathematics in April 2013.
PROGRAMME COMMITTEE
Juliana Küster Filipe Bowles (U St Andrews, Scotland)
Robin Cooper (U Gothenburg, Sweden)
Martín Escardó (U Birmingham, UK)
Nikos Galatos (U Denver, USA)
Achim Jung (U Birmingham, UK)
Sara Kalvala (U Warwick, UK)
Elham Kashefi (Edinburgh U, Scotland)
Peter Lefanu Lumsdaine (Institute for Advanced Study, USA)
Ian Mackie (U Sussex, UK)
Gerard de Melo (Tsinghua U, China)
Vivek Nigam (Federal U of Paraíba, Brazil)
Catarina Dutilh Novaes (U Groningen, The Netherlands)
Valeria de Paiva (Nuance Comm, USA) (CHAIR)
Luiz Carlos Pereira (PUC-Rio, Brazil)
Elaine Pimentel (Federal U of Rio Grande do Norte, Brazil)
Alexandra Silva (Radboud Nijmegen U, The Netherlands)
Carolyn Talcott (SRI International, USA)
Josef Urban (Radboud Nijmegen U, The Netherlands)
Laure Vieu (IRIT-Toulouse, France)
Renata Wasserman (U São Paulo, Brazil)
Anna Zamansky (U Haifa, Israel)
STEERING COMMITTEE
Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Ruy de Queiroz.
ORGANISING COMMITTEE
Daniel Leivant (Indiana U) (Local co-chair)
Larry Moss (Indiana U) (Local co-chair)
Anjolina G. de Oliveira (U Fed Pernambuco)
Ruy de Queiroz (U Fed Pernambuco) (co-chair)
REGISTRATION
Now open at http://www.indiana.edu/~iulg/wollic/registration.html <http://www.indiana.edu/~iulg/wollic/registration.html>
ACCOMODATION
Please visit http://www.indiana.edu/~iulg/wollic/venue.html <http://www.indiana.edu/~iulg/wollic/venue.html>
FURTHER INFORMATION
Contact one of the Co-Chairs of the Organising Committee.
WEB PAGE
www.indiana.edu/~iulg/wollic <http://www.indiana.edu/~iulg/wollic>
皆様
7月に京都で開催されます「第16回 論理と計算量に関するワークショップ LCC 2015」
の講演者募集の締切を延長致しました。
計算量理論からプログラムの計算量解析まで、計算量に関する研究発表を
広く募集しております。講演を検討頂けましたら幸いです。
廣川 直 (JAIST)
======================================================================
Third Call for Papers
(extended deadline)
LCC 2015
16th International Workshop on Logic and Computational Complexity
July 4-5, 2015, Kyoto, Japan
collocated with ICALP/LICS 2015
http://www.cs.swansea.ac.uk/lcc/
======================================================================
LCC meetings are aimed at the foundational interconnections between logic
and computational complexity, as present, for example, in
implicit computational complexity (descriptive and type-theoretic methods);
deductive formalisms as they relate to complexity (e.g. ramification,
weak comprehension, bounded arithmetic, linear logic and resource logics);
complexity aspects of finite model theory and databases;
complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity.
The program will consist of invited lectures as well as contributed talks
selected by the Program Committee.
IMPORTANT DATES:
* submission April 29, 2015 (extended)
* notification May 14, 2015
* workshop July 4-5, 2015
INVITED SPEAKERS:
* Olaf Beyersdorff (University of Leeds)
* Mikołaj Bojańczyk (Warsaw University)
* Akitoshi Kawamura (University of Tokyo)
* Jean-Yves Marion (LORIA, Nancy)
* ...
SUBMISSION:
We welcome submissions of abstracts based on work submitted or published
elsewhere, provided that all pertinent information is disclosed at
submission time. There will be no formal reviewing as is usually
understood in peer-reviewed conferences with published proceedings. The
program committee checks relevance and may provide additional feedback.
Submissions must be in English and in the form of an abstract of about 3-4
pages. All submissions should be submitted through Easychair at:
https://easychair.org/conferences/?conf=lcc2015
PROGRAM COMMITTEE:
* Albert Atserias (Universitat Politècnica de Catalunya, Barcelona) co-chair
* Guillaume Bonfante (LORIA, Nancy)
* Yijia Chen (Fudan University, Shanghai)
* Ugo Dal Lago (Università degli Studi di Bologna)
* Nao Hirokawa (JAIST, Nomi) co-chair
* Antonina Kolokolova (Memorial University of Newfoundland)
* Damiano Mazza (CNRS, LIPN - University Paris 13)
* Georg Moser (University of Innsbruck)
* Moritz Müller (Kurt Gödel Research Center for Mathematical Logic, Wien)
* Benjamin Rossman (National Institute of Informatics, Tokyo)
* Iddo Tzameret (Royal Holloway, University of London)
* Heribert Vollmer (Leibniz Universität Hannover)
京都大学数理解析研究所の佐藤です。
4月23日11:00から、北陸先端科学技術大学院大学の吉村 和人氏に
以下の講演をしていただくことになりましたので、
ご連絡いたします。どうぞお気軽にお越しください。
==========
Time: 11:00-12:00, 23 Apr, 2015
Place: Rm 478, Research Building 2, Main Campus, Kyoto University
京都大学 本部構内 総合研究2号館 4階478号室
http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (Building 34)
http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物)
Speaker: Yoshimura Kazuto (Japan Advanced Institute of Science and
Technology)
Title: A brief introduction to the theory of the Weihrauch lattice
Abstract:
The Weihrauch lattice and its underlying reducibility notion,
Weihrauch reducibility, was introduced in 1980s as fundamental
concepts for investigating the discontinuities of functions.
However it is only recently when the deep analysis of the Weihrauch
lattice started, being influenced by the project of constructive reverse
mathematics. In this talk, we aim to present a brief review on the
theory of the Weihrauch lattice from both historical and technical
perspectives, and try to point out the importance of the structure
for computable analysis, constructive mathematics and computer
science respectively.
皆様
7月に京都で開催されます、ICALP/LICS 併設のワークショップ
「第16回 論理と計算量に関するワークショップ LCC 2015」
の講演者募集のご案内を致します。
計算量理論からプログラムの計算量解析まで、計算量に関する研究発表を
広く募集しております。皆様、ぜひ投稿をご検討下さい!
廣川 直 (JAIST)
======================================================================
Second Call for Papers
LCC 2015
16th International Workshop on Logic and Computational Complexity
July 4-5, 2015, Kyoto, Japan
collocated with ICALP/LICS 2015
http://www.cs.swansea.ac.uk/lcc/
======================================================================
LCC meetings are aimed at the foundational interconnections between logic
and computational complexity, as present, for example, in
implicit computational complexity (descriptive and type-theoretic methods);
deductive formalisms as they relate to complexity (e.g. ramification,
weak comprehension, bounded arithmetic, linear logic and resource logics);
complexity aspects of finite model theory and databases;
complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity.
The program will consist of invited lectures as well as contributed talks
selected by the Program Committee.
IMPORTANT DATES:
* submission April 19, 2015
* notification May 14, 2015
* workshop July 4-5, 2015
INVITED SPEAKERS:
* Olaf Beyersdorff (University of Leeds)
* Mikołaj Bojańczyk (Warsaw University)
* Akitoshi Kawamura (University of Tokyo)
* Jean-Yves Marion (LORIA, Nancy)
* ...
SUBMISSION:
We welcome submissions of abstracts based on work submitted or published
elsewhere, provided that all pertinent information is disclosed at
submission time. There will be no formal reviewing as is usually
understood in peer-reviewed conferences with published proceedings. The
program committee checks relevance and may provide additional feedback.
Submissions must be in English and in the form of an abstract of about 3-4
pages. All submissions should be submitted through Easychair at:
https://easychair.org/conferences/?conf=lcc2015
PROGRAM COMMITTEE:
* Albert Atserias (Universitat Politècnica de Catalunya, Barcelona) co-chair
* Guillaume Bonfante (LORIA, Nancy)
* Yijia Chen (Fudan University, Shanghai)
* Ugo Dal Lago (Università degli Studi di Bologna)
* Nao Hirokawa (JAIST, Nomi) co-chair
* Antonina Kolokolova (Memorial University of Newfoundland)
* Damiano Mazza (CNRS, LIPN - University Paris 13)
* Georg Moser (University of Innsbruck)
* Moritz Müller (Kurt Gödel Research Center for Mathematical Logic, Wien)
* Benjamin Rossman (National Institute of Informatics, Tokyo)
* Iddo Tzameret (Royal Holloway, University of London)
* Heribert Vollmer (Leibniz Universität Hannover)
みなさま,
6月下旬の国際会議 CALCO の併設ワークショップ
CALCO Early Ideas の案内をお送りします.
特に学生さんに,いろいろとフィードバックがもらえて
おすすめです.どうか投稿をご検討ください.
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
**********************************************************
CALL FOR CONTRIBUTIONS: CALCO Early Ideas 2015
***********************************************************
A satellite event of CALCO 2015
6th International Conference on
Algebra and Coalgebra in Computer Science
In cooperation with ACM SIGLOG
June 24 - 26, 2015
Nijmegen, Netherlands
http://coalg.org/calco15/ei.html
==========================================================
Submission: May 8, 2015
Author notification: May 22, 2015
Final version: June 5, 2015
==========================================================
The programme of CALCO 2015 will include special sessions reserved for the
CALCO Early Ideas Workshop, featuring presentations of work in progress
and original research proposals. PhD students and young researchers
are particularly encouraged to contribute. Attendance at the workshop is
open to all conference participants.
The CALCO Early Ideas Workshop invites submissions on the same topics as
the CALCO conference: reporting results of theoretical work, the way these
results can support methods and techniques for software development, as well
as experience with the transfer of the resulting technologies into industrial
practice.
CALCO Early Ideas presentations will be selected according to originality,
significance, and general interest, on the basis of submitted 2-page short
contributions. It can be work in progress, a summary of work submitted to
a conference or workshop elsewhere, or work that in some other way might be
interesting to the CALCO audience. A booklet with the accepted short
contributions will be available at the workshop.
SUBMISSION INFORMATION
Submissions will be handled via the CALCO 2015 Early Ideas EasyChair site
https://www.easychair.org/conferences/?conf=calco2015ei
and will be evaluated by the CALCO PC chairs. Submissions should be
no more than 2 pages long in the format specified by LIPIcs. The volume of
selected papers will be made available in the arXiv and on the CALCO pages.
Authors will retain copyright, and are also encouraged to disseminate the
results by subsequent publication elsewhere.
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
LAST CALL FOR PAPERS
The 12th International Workshop on
Quantum Physics and Logic (QPL)
July 13-17, Oxford, United Kingdom
http://www.cs.ox.ac.uk/qpl2015
The 12th International Workshop on Quantum Physics and Logic (QPL)
will take place at the Department of Computer Science of the University
of Oxford between Wednesday 15 and Friday 17 July, 2015. The
workshop will be preceded by tutorials on Monday 13 and
Tuesday 14 July 2015.
This workshop brings together researchers working on mathematical
foundations of quantum physics, quantum computing, spatio-temporal
causal structures, and related areas such as computational linguistics.
Of particular interest are topics that use logical tools, ordered algebraic
and category-theoretic structures, formal languages, semantical
methods and other computer science methods for the study of physical
behaviour in general.
Previous QPL events were held in Kyoto (2014), Barcelona (2013),
Brussels (2012), Nijmegen (2011), Oxford (2010), Oxford (2009),
Reykjavik (2008), Oxford (2006), Chicago (2005), Turku (2004),
and Ottawa (2003).
INVITED SPEAKERS
Dan Browne (University College London)
Paul Busch (University of York)
Chris Douglas (University of Oxford)
Lucien Hardy (Perimeter Institute)
TUTORIAL SPEAKERS
Dan Browne (University College London)
Paul Busch (University of York)
Oscar Dahlsten (University of Oxford)
Pawel Sobocinski (University of Southampton)
IMPORTANT DATES
Submission Deadline: May 1, 2015
Notification of Acceptance: June 1
Papers Ready: June 15
Tutorials: July 13-14
Workshop: July 15-17
SUBMISSIONS
Prospective speakers are invited to submit a contribution to the workshop.
- *Short contributions* consist of a 3 page description of the work,
and a link to a paper available elsewhere.
- Longer *original contributions* consist of a 5-12 page extended
abstract which provides sufficient evidence of results of genuine
interest and provides sufficient detail to allow the program
committee to assess the merits of the work. Submissions of works
in progress are encouraged but must be more substantial than a
research proposal.
Extended versions of accepted original research contributions will be
published in Electronic Proceedings in Theoretical Computer Science
(EPTCS) after the workshop.
Submissions should be prepared using LaTeX, and must be submitted
in PDF format. Use of the EPTCS style is encouraged. Submission is
done via EasyChair:
https://www.easychair.org/conferences/?conf=qpl2015
There will be an award for the best paper whose authors are all students,
at the discretion of the programme committee.
REGISTRATION
Please visit the website to register. We encourage participation by
graduate students, and will be able to provide limited reimbursement
to partially support students for travel and accommodation. Further
information is found on the workshop website.
PROGRAMME COMMITTEE
John Baez (University of California Riverside)
Dan Browne (University College London)
Giulio Chiribella (Tsinghua University)
Bob Coecke (University of Oxford)
Ross Duncan (University of Strathclyde)
Tobias Fritz (Perimeter Institute)
Simon Gay (University of Glasgow)
Ichiro Hasuo (University of Tokyo)
Chris Heunen (University of Oxford, co-chair)
Matty Hoban (University of Oxford)
Bart Jacobs (Radboud University Nijmegen)
Viv Kendon (Durham University)
Matt Leifer (Perimeter Institute)
Prakash Panangaden (McGill University)
Dusko Pavlovic (University of Hawaii)
Simon Perdrix (CNRS Nancy)
Mehrnoosh Sadrzadeh (Queen Mary University of London)
Peter Selinger (Dalhousie University, co-chair)
Rob Spekkens (Perimeter Institute)
Bas Spitters (Aarhus University)
Isar Stubbe (Universite du Littoral-Cote-d'Opale)
Jamie Vicary (University of Oxford, co-chair)
Mingsheng Ying (University of Technology Sydney, Tsinghua University)
STEERING COMMITTEE
Bob Coecke (University of Oxford)
Prakash Panangaden (McGill University)
Peter Selinger (Dalhousie University)
LOCAL ORGANISATION
Destiny Chen
Chris Heunen
Jamie Vicary
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
*******************************************************
EXTENDED SUBMISSION DEADLINE: April 20
*******************************************************
Third Workshop on Natural Language and Computer Science
NLCS '15
July 5, 2015
Kyoto, Japan
http://www.indiana.edu/~iulg/nlcs.html
A workshop affiliated with 42nd International Colloquium on Automata, Languages and Programming (ICALP 2015) and 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015)
Endorsed by the Association for Computational Linguistics Special Interest Group on Computational Semantics
Paper submission deadline (extended): April 20, 2015
AIMS AND SCOPE
Formal tools coming from logic and category theory are important in both natural language semantics and in computational semantics. Moreover, work on these tools borrows heavily from all areas of theoretical computer science. In the other direction, applications having to do with natural language has inspired developments on the formal side. The workshop invites papers on both topics. Specific topics includes, but are not limited to:
• logic for semantics of lexical items, sentences, discourse and dialog
• continuations in natural language semantics
• formal tools in textual inference, such as logics for natural language inference
• applications of category theory in semantics
• linear logic in semantics
• formal approaches to unifying data-driven and declarative approaches to semantics
INVITED SPEAKERS
Makoto Kanazawa, National Institute of Informatics
Gerard de Melo, Tsinghua University
PROGRAM COMMITTEE
• Heather Burnett, Université de Toulouse 2
• Robin Cooper, University of Gothenburg
• Valeria de Paiva, Nuance Communications
• Tim Fernando, Trinity College
• Nissim Francez, The Technion
• Makoto Kanazawa, National Institute of Informatics
• Larry Moss, Indiana University
• Aarne Ranta, University of Gothenburg
• Christian Retoré, Université de Montpellier
PAPER SUBMISSIONS
Extended abstracts of up to 10 pages may be submitted through Easychair:
https://easychair.org/conferences/?conf=nlcs15
ORGANIZERS
Valeria de Paiva
Nuance.com
Email: Valeria.dePaiva at nuance .com
Makoto Kanazawa
National Institute of Informatics
Email: kanazawa at nii.ac.jp
Larry Moss
Indiana University
Email: lsm at cs.indiana . edu
IMPORTANT DATES
Paper submission deadline (extended): April 20, 2015
Author notification: May 1, 2015
Electronic versions of papers due: May 14, 2015
Workshop: July 5, 2015
京都大学数理解析研究所の勝股です。
3月26日11:00から、INRIA Paris-RocquencourtのGergei Bana氏に
以下の講演をしていただくことになりましたので、
ご連絡いたします。どうぞお気軽にお越しください。
==========
Time: 11:00-12:00, 26 Mar, 2015
Place: Rm 478, Research Building 2, Main Campus, Kyoto University
http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (See 34)
京都大学 本部構内 総合研究2号館 4階478号室
http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物)
Speaker: Gergei Bana (INRIA Paris-Rocquencourt)
Title: Formal Verification of Complexity-Theoretic Properties of
Security Protocols
Abstract:
Rigorous modeling of attackers to security protocols, and hence
the prospect of proving the security of protocols has been
developed from the 1980’s in two directions. One focused on
automated proving and accordingly modeled protocol execution and
attackers with a set of symbolic operations on symbolic terms,
treating cryptographic primitives such as encryption as black-box
operations (Dolev-Yao approach). The other took a
complexity-theoretic approach, modeled protocol execution and
attackers as probabilistic polynomial-time algorithms with the
aim of deriving protocol security from hardness assumptions such
as the DDH assumption (computational approach). While the first
technique is convenient for automation and is effective in
finding attacks, there is little guarantee that if there is no
Dolev-Yao attack, then there is no real-life attack
either. Computational approach approximates real life far closer,
but is not convenient for automation, proving by hand is too
laborious and error prone. From the beginning of the 2000’s
there have been numerous research directions trying to unify the
two approaches and provide automated verification of
computational properties, with variable success. In this talk we
briefly review the history of the unification process, the failed
attempts, the currently available tools, and we give a more
detailed account of our approach with Hubert Comon-Lundh of ENS
Cachan and Mitsuhiro Okada of Keio University, which we call
“computationally complete symbolic attacker”.