研究会のご案内
以下の要領で計算可能性,逆数学等に関する
研究会を開催いたします.
Computability Theory and Foundations of Mathematics (CTFM 2013)
(2013年2月18日(月)〜2月20日(水),東京工業大学大岡山キャンパス)
参加ご希望の方は参加登録ページよりお申込ください.
http://sendailogic.math.tohoku.ac.jp/CTFM/registration.html
参加申込締切:2013年2月4日(月)
多くの方々の参加申込をお待ちいたします.
江口直日,Sam Sanders, 田中一之
CTFM(a)math.tohoku.ac.jp
============================================================
Computability Theory and Foundations of Mathematics
(Tokyo Institute of Technology, Tokyo, Japan, February 18 - 20, 2013)
http://sendailogic.math.tohoku.ac.jp/CTFM/
============================================================
Computability Theory and Foundations of Mathematics (CTFM) aims to
develop computability theory and logical foundations of Mathematics. The
scope involves the topics Computability Theory, Reverse Mathematics,
Nonstandard Analysis, Proof Theory, Constructive Mathematics, Theory of
Randomness and Computational Complexity Theory.
This is a successor workshop to Workshop on Proof Theory and
Computability Theory 2012 - Philosophical Frontiers in Reverse
Mathematics (February 20 - 23, 2012, Tokyo, Japan).
--------------------------------------------
Deadline of Registration: February 4th, 2013
--------------------------------------------
Invited Speakers:
Chi Tat Chong (National University of Singapore)
Erik Palmgren (Stockholm University)
Michael Rathjen (University of Leeds)
Helmut Schwichtenberg (LMU Munich)
Stephen G. Simpson (Pennsylvania State University)
Yang Yue (National University of Singapore)
Wu Guohua (Nanyang Technological University)
--------------------------------------------
Programme Committee:
Toshiyasu Arai (Chiba)
Naohi Eguchi (Tohoku)
Hajime Ishihara (JAIST)
Ryo Kashima (Tokyo Institute of Technology)
Sam Sanders (Ghent)
Kazuyuki Tanaka (Tohoku, Co-chair)
Andreas Weiermann (Ghent, Co-chair)
Takeshi Yamazaki (Tohoku)
Keita Yokoyama (Tokyo Institute of Technology)
--------------------------------------------
NIIレクチャーシリーズのお知らせ
国立情報学研究所(NII)では、海外の情報学に関係する著名研究者を招聘し、レクチャーシリーズを行っております。
今回は、AIの黎明期からAIの研究をされてきたカナダ・アルバータ大学のRandy
Goebel先生の連続レクチャーのお知らせです。
今回はAI原理をビッグデータに応用する最先端の研究の講演を行っていただきます。
講師:Prof. Randy Goebel (department of Computing Science at the University
of Alberta, in Edmkonton, Alberta, Canada)
講義名 :Do the emerging tools for managing big data fit with the founding
principles of Artificial Intelligence?
http://www.nii.ac.jp/en/event/list/0212
場所:国立情報学研究所 20階 2010室
講義日:2013/2/12, 20, 26, 3/1
時間: 13:30-15:00
出席は無料で、どなたでも参加できます。
参加のご検討よろしくお願いします。
佐藤 健
国立情報学研究所および総研大
=======
NII Lecture Series Title:
Do the emerging tools for managing big data fit with the founding
principles of Artificial Intelligence?
ideas on the integration of the advice taker, structured inference,
reasoning with incomplete information, and building multi-scale models from
data.
Speaker: Prof. Randy Goebel (department of Computing Science at the
University of Alberta, in Edmkonton, Alberta, Canada)
He is also vice president of the innovates Centre of Research Excellence
(iCORE) at Alberta Innovates Technology Futures (AITF), chair of the Alberta
Innovates Academy, and principle investigator in the Alberta Innovates
Centre for Machine Learning. He received the B.Sc. (Computer Science), M.Sc.
(Computing Science), and Ph.D. (Computer Science) from the Universities of
Regina, Alberta, and British Columbia, respectively.
At AITF, Randy is in charge of reshaping research investments (graduate
student scholarships, research chairs, research centres). His research
interests include applications of machine learning to systems biology,
visualization, and web mining, as well as work on natural language
processing, web semantics, and belief revision. Randy has experience working
on industrial research projects in crew scheduling, pipeline scheduling, and
steel mill scheduling, as well as scheduling and optimization projects for
the energy industry in Alberta.
Randy has held appointments at the University of Waterloo, University of
Tokyo, Multimedia University (Malaysia), Hokkaido University (Sapporo), and
has had research collaborations with DFKI (German Research Centre for
Artificial Intelligence), NICTA (National ICT Australia), RWC (Real World
Computing project, Japan), ICOT (Institute for New Generation Computing,
Japan), NII (National Institute for Informatics, Tokyo), and is actively
involved in academic and industrial collaborative research projects in
Canada, Australia, Europe, and China.
Abstract:
The modern discipline of computer science has many facets, but what has
clearly emerged in the last decade are three themes based on 1) rapidly
accumulating volumes of data, 2) inter- and cross-disciplinary application
of computer science to all scientific disciplines, and 3) a renewed interest
in the semantics of complex information models, spanning a spectrum from
semantic web, natural language, to multi-scale systems biology.
This series of four lectures will attempt to knit together these three
themes, by presenting the ideas that have emerged in their support: the
rapid development and extension of machine learning theory and methods to
help make sense of accumulating volumes of data, the application of computer
science to nearly all scientific disciplines, especially those whose
progress now necessarily relies on the management and interpretation of
large data, and finally, the revival of a focus on semantics of information
models based on data.
Outline:
Lecture 1: Connecting Advice Taking and Big Data
Lecture 2: Structured inference and incomplete information
Lecture 3: Natural Language Processing: Compressing Data to Models
Lecture 4: Hypothesis Management with Symbols and Pictures
Place:
Lecture room 2010, 20th floor, National Institute of Informatics
Date:
13:30pm-15:00pm, February 12, 20, 26, March 1, 2013
Lecture 1
Connecting Advice Taking and Big Data
Tuesday, February 12, 2013, 13:30 - 15:00
A fundamental premise of Artificial Intelligence (AI) is the ability for
a computer program to improve its behaviour by taking advice. Incremental
accumulation of advice or knowledge has never been easier than today, when
the rate of data capture is higher than ever before, and the management of
big data and deployment of machine learning are coupled to help manage the
transition from data to knowledge. This lecture uses simple technical
concepts from nearly sixty years of AI, to identify some of the research
challenges of managing big data, and exploiting knowledge emergent from big
data. The goal is to find some important research priorities based on the
motivation of the Advice Taker, and the current state of big data management
and machine learning.
Lecture 2
Structured inference and incomplete information
Wednesday. February. 20, 13:30 - 15:00
If the foundation of Artificial Intelligence (AI) is the accumulation
and use of knowledge, then a necessary stop is the structuring knowledge to
be able to make inferences. The organization structures required to
facilitate inference now span a broad spectrum of mathematical methods,
including everything from simple propositional logic to sophisticated
statistical and probabilistic inference. The two foundational components of
computational inference are semantics of formal reasoning, and the
development of reasoning methods to deal with incomplete information. This
lecture reviews the foundational components of semantics and reasoning
systems, including the development of goal-oriented reasoning based on
abductive reasoning, the connection between logical and probabilistic
systems, and especially how the architecture of reasoning systems can
provide the basis for managing hypotheses in the face of incomplete
information.
Lecture 3
Natural Language Processing: Compressing Data to Models
Tuesday. February. 26, 13:30 - 15:00
The problem of machine processing of natural language (NLP) has long
been a research focus of artificial intelligence. This is partly because the
use of natural language is easily conceived as a cognitive task requiring
human-like intelligence. It is also because the rational structures for
computer interpretation of language require the full suite of computational
tools developed over the last hundred years (grammar, dictionaries, logic,
parsing, inference, and context management). Most of the recent practical
advances in NLP have arisen in the context of simple machine learning
applied to large language corpora, to induce fragments of language models
that provide the basis for interpretive and generative manipulation of
language. These largely statistical models are arisen in what has been
called the "pendulum swing" of NLP, in which statistical models have
recently dominated those based on structural linguistics. In this lecture,
we look at the concept of noisy corpora and their role in language models,
including some interesting alternative sources of data for building language
models. The applications range from complex language summary to the
information extraction from medical, legal, and historical documents.
Lecture 4
Hypothesis Management with Symbols and Pictures
Friday. March. 1, 13:30 - 15:00
The current suite of Artificial Intelligence (AI) tools has provided a
basis for sophisticated human-computer interfaces based on more than typing
in language. In fact, one can develop multi-level representations that
provide the basis for direct manipulation of visualizations. By constraining
the repertoire of direct manipulations, one can enrich human computer
interaction so that both humans and machines can understand and exploit
visual interaction. This lecture shows how such direction manipulation
requires a large repertoire of formal reasoning methods, and provides the
sketch of formal framework and the problems arising in its development.
<重複してお受け取りの方はご容赦ください>
皆様:
中央大学の只木と申します。
中央大学研究開発機構では、来週19日土曜日、ニュー
ジーランド研究者Cristian S. Calude氏(オークランド大学)
およびElena Calude氏(マッセイ大学)をお招きし、下記
要領で講演会を開催します。
皆様、奮ってご参加下さい。
----------------------------------
只木孝太郎 (Kohtaro Tadaki)
中央大学研究開発機構
〒112-8551 東京都文京区春日1-13-27
E-mail: tadaki(a)kc.chuo-u.ac.jp
WWW: http://www2.odn.ne.jp/tadaki/
----------------------------------------------------------
Cristian S. Calude氏、Elena Calude氏 講演会
◆日時: 2013年1月19日(土)15時00分 〜 17時30分
◆場所: 中央大学 後楽園キャンパス 5号館1階 5138号室(下記参照)
◆参加申込: 不要
----------------------------------------------------------
[ 講演内容 ]
◆15時00分〜16時00分
講演題目:The complexity of mathematical problems
講演者:Cristian S. Calude (University of Auckland, NZ) and
Elena Calude (Massey University, NZ)
講演要旨:
Evaluating (or even guessing) the degree of complexity of an open
problem, conjecture or mathematically proven statement is not an
easy task not only for beginners, but also for the most experienced
mathematicians.
Is there a (uniform) method to evaluate, in some objective way,
the difficulty of a mathematical statement or problem? The question
is not trivial because mathematical problems can be so diverse.
But, is there any indication that all, or most, or even a large part
of mathematical problems have a kind of "commonality" allowing a
uniform evaluation of their complexity? How could one compare a
problem in number theory with a problem in complex analysis, a
problem in algebraic topology or a theorem in dynamical systems?
Surprisingly enough, such "commonalities" do exist for many
mathematical problems. One of them is based on the possibility
of expressing the problem in terms of (very) simple programs
reducible to a (natural) question in theoretical computer science,
the so-called "halting problem". A more general "commonality"
can be discovered using the inductive type of computation, a
computation more general the Turing computability. As a consequence,
uniform approaches for evaluating the complexity of a large class
of mathematical problems/conjectures/statements can be, and
have been, developed. This talks reviews current progress and
some open problems.
◆16時30分〜17時30分
講演題目: The Kochen-Specker theorem and quantum randomness
講演者: Cristian S. Calude (University of Auckland, NZ)
講演要旨:
The Kochen-Specker theorem shows the impossibility for a hidden
variable theory to consistently assign values to certain (finite) sets
of observables in a way that is noncontextual and consistent with
quantum mechanics. If we require noncontextuality, the consequence
is that many observables must not have pre-existing definite values.
However, the Kochen-Specker theorem does not allow one to
determine which observables must be value indefinite. In this talk we
present an improvement on the Kochen-Specker theorem which
allows one to actually locate observables which are provably value
indefinite. Various technical and subtle aspects relating to this formal
proof and its connection to quantum mechanics are discussed. This
result is then utilized for the proposal and certification of a dichotomic
quantum random number generator operating in a three-dimensional
Hilbert space.
------------------------------------------------------------
会場への道順:
[中央大学後楽園キャンパスへのアクセスガイド]
http://www.chuo-u.ac.jp/chuo-u/access/index_j.htmlhttp://www.chuo-u.ac.jp/chuo-u/access/access_korakuen_j.html
[中央大学後楽園キャンパスマップ]
http://www.chuo-u.ac.jp/chuo-u/campusmap/korakuen_j.html
------------------------------------------------------------
みなさま,
東京大学の蓮尾です.あけましておめでとうございます.
以前お知らせした ETAPS 併設ワークショップの HAS,締切が 1/21
に延長になりました.Post-proceeding ですので,論文の preliminary
version でも大歓迎,とのことです.ご投稿を検討いただければ幸いです.
どうかよろしくお願いいたします.それでは!
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
===========================
[Apologies for multiple copies]
[Please note: submission deadline extended to January, 12]
************************************************************************************************************
*********
CALL FOR PAPERS
Third Workshop on Hybrid Autonomous Systems (HAS 2013)
A satellite event of European Joint Conferences on Theory and Practice
of Software, ETAPS 2013
March 17, 2013, Rome, Italy
http://www2.warwick.ac.uk/fac/sci/maths/people/staff/bujorianu/has2013/
************************************************************************************************************
*********
SCOPE:
The interest on autonomous systems is increasing both in industry and academia.
Such systems must operate with limited human intervention in a changing
environment and must be able to compensate for significant system failures
without external intervention. The hybrid discrete-continuous models
constitute appropriate models of
autonomous systems . Hybrid systems have behaviours characterised by
the interaction between
continuous and discrete dynamics and research in the area is driven by
several school of thoughts. One
approach is mainly focussed on applications to automation systems and
the models and methods are
centred on the concept of hybrid automaton (deterministic or
probabilistic). A distinct school of thought
interprets hybrid systems as control systems with regime change. Such
systems are highly adaptive and
suitable for modelling autonomic behaviours. The most prominent models
of this approach are the
stochastic hybrid systems and the mixed logical and dynamical systems.
There is a clear research
opportunity to combine these approaches for developing models,
methods, techniques, methodologies,
tools and environments for autonomous systems engineering. This
workshop brings together researchers
interested in all aspects
of autonomy and resilience of hybrid systems.
TOPICS:
Topics include (but are not limited to):
Ø new modelling paradigms for autonomous systems;
Ø verification and safety certification techniques;
Ø modelling, analysis and control of hybrid systems;
Ø uncertainty and stochastic modelling;
Ø multi-agent systems;
Ø algebraic and categorical methods;
Ø interaction between hybrid modelling and complexity science;
Ø reports on case studies and practical experiments;
Ø autonomous systems in natural science (e.g. from biology, ecology, climate).
INVITED SPEAKERS:
* Maria Domenica di Benedetto, L'Aquila University, IT
* Radu Grosu, Vienna University of Technology, AU
* Rafael Wisniewski, Aalborg University, DEN
SUBMISSIONS:
In order to encourage participation and discussion, this workshop solicits
the submission of regular papers, which must contain original work, and
must not have been previously published, nor be under consideration for
publication elsewhere. The accepted submissions should clearly indicate
the membership to one of the following categories:
- technical contributions;
- tutorials on a topic of importance;
- surveys on large extent cross-disciplinary research (e.g., project
outcomes);wor
- reports on early stage or ongoing work.
For each category of submission the novelty of the submission has to
be clearly stated and
the page limit should vary between 6 and 15 pages.
All submissions must be in PDF format and use the EPTCS latex style, see
http://style.eptcs.org/. Submissions can be made on the following website:
https://www.easychair.org/conferences/login_as_yes.cgi?a=3413468
The workshop PC will review all regular paper submissions to select
appropriate ones, ones for acceptance in each category, based on their
relevance, merit, originality, and technical content.
The authors of accepted submissions are expected to present and discuss
their work at the workshop. Accepted regular papers will be published
in the Electronic Proceedings in Theoretical Computer Science (EPTCS).
A special issue in a journal is under consideration.
IMPORTANT DATES:
Submission (regular paper): *extended* January 12, 2013
Notification: January 24, 2013
Final version (ETAPS proceedings): February 14, 2013
Workshop: March 17, 2013
Final version (EPTCS post proceedings): TBA
ORGANIZATION:
PC Chairs:
* Luca Bortolussi, University of Trieste, IT
* Manuela Bujorianu, University of Warwick, UK
* Giordano Pola, University of L’Aquila, IT
Program Committee:
* Ezio Bartocci, TU Wien, AU
* Maria Domenica di Benedetto, L'Aquila University, IT
* Luca Bortolussi, University of Trieste, IT (co-Chair)
* Manuela Bujorianu, University of Warwick, UK (co-Chair)
* Alberto Casagrande, Univeristy of Trieste, IT
* Thao Dang, Verimag, FR
* Louise Dennis, University of Liverpool, UK
* Clare Dixon, University of Liverpool, UK
* Alexandre Donzé, UC Berkeley, US
* Martin Fränzle, Carl von Ossietzky Universität, DE
* Ichiro Hasuo, University of Tokio, JP
* Agung Julius, Rensselaer Polytechnic Institute, US
* Toshimitsu Ushio, Osaka University, JP
* Giordano Pola, L'Aquila University, IT (co-Chair)
* Rom Langerak, University of Twente, NL
* David Parker, University of Birmingham, UK
* Guido Sanguinetti, University of Edinburgh, UK
* Olaf Stursberg, University of Kassel, DE
みなさま,
こんにちは! 東京大学の蓮尾です.
国際会議 CALCO 2013 の案内を(再度)お送りします.
トピックは代数・余代数・形式検証の理論一般,
開催地はポーランド・ワルシャワ,締切は2月末です.
どうか投稿をご検討ください.それでは!
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
[Apologies for multiple copies]
=========================================================================
SECOND CALL FOR PAPERS: CALCO 2013
5th International Conference on Algebra and Coalgebra in Computer Science
September 3 - 6, 2013
Warsaw, Poland
http://coalg.org/calco13/
=========================================================================
Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
=========================================================================
-- SCOPE --
CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science.
It is a high-level, bi-annual conference formed by joining the
forces and reputations of CMCS (the International Workshop on
Coalgebraic Methods in Computer Science), and WADT (the Workshop on
Algebraic Development Techniques). Previous CALCO editions took place
in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009)
and Winchester (UK, 2011). The fifth edition will be held in Warsaw,
the capital of Poland.
-- INVITED SPEAKERS --
Andrej Bauer - University of Lubljana, Sl
Miko??aj Boja??czyk - Warsaw University, PL
Neil Ghani - University of Strathclyde, UK
Damien Pous - CNRS, ENS-Lyon, F
-- TOPICS OF INTEREST --
We invite submissions of technical papers that report results of
theoretical work on the mathematics of algebras and coalgebras, 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. We encourage submissions in
topics included or related to those listed below.
* Abstract models and logics
- Automata and languages
- Categorical semantics
- Modal logics
- Relational systems
- Graph transformation
- Term rewriting
- Adhesive categories
* Specialised models and calculi
- Hybrid, probabilistic, and timed systems
- Calculi and models of concurrent, distributed, mobile, and
context-aware computing
- General systems theory and computational models (chemical,
biological, etc.)
* Algebraic and coalgebraic semantics
- Abstract data types
- Inductive and coinductive methods
- Re-engineering techniques (program transformation)
- Semantics of conceptual modelling methods and techniques
- Semantics of programming languages
* System specification and verification
- Algebraic and coalgebraic specification
- Formal testing and quality assurance
- Validation and verification
- Generative programming and model-driven development
- Models, correctness and (re)configuration of
hardware/middleware/architectures,
- Process algebra
-- NEW TOPICS --
This edition of CALCO will feature two new topics, and submission of
papers on these topics is especially encouraged.
* Corecursion in Programming Languages
- Corecursion in logic / constraint / functional / answer set
programming
- Corecursive type inference
- Coinductive methods for proving program properties
- Implementing corecursion
- Applications
* Algebra and Coalgebra in quantum computing
- Categorical semantics for quantum computing
- Quantum calculi and programming languages
- Foundational structures for quantum computing
- Applications of quantum algebra
-- SUBMISSION GUIDELINES --
Prospective authors are invited to submit full papers in English
presenting original research. Submitted papers must be unpublished and
not submitted for publication elsewhere. Experience papers are
welcome, but they must clearly present general lessons learned that
would be of interest and benefit to a broad audience of both
researchers and practitioners. As with previous editions, the
proceedings will be published in the Springer LNCS series. Final
papers should be no more than 15 pages long in the format specified by
Springer (see http://www.springer.de/comp/lncs/authors.html). It is
recommended that submissions adhere to that format and
length. Submissions that are clearly too long may be rejected
immediately. Proofs omitted due to space limitations may be included
in a clearly marked appendix. Both an abstract and the full paper must
be submitted by their respective submission deadlines.
A special issue of the open access journal Logical Methods in Computer
Science (http://www.lmcs-online.org), containing extended versions of
selected papers, is also being planned.
Submissions will be handled via EasyChair
https://www.easychair.org/conferences/?conf=calco2013
-- BEST PAPER AND BEST PRESENTATION AWARDS --
For the first time, this edition of CALCO will feature two kinds of
awards: a best paper award whose recipients will be selected by the PC
before the conference and a best presentation award, elected by the
participants.
-- IMPORTANT DATES --
Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
-- PROGRAMME COMMITTEE --
Luca Aceto - Reykjavik University, Iceland
Ji???? Ad??mek - TU Braunschweig, D
Lars Birkedal - IT University of Copenhagen, DK
Filippo Bonchi - CNRS, ENS-Lyon, F
Corina Cirstea - University of Southhampton, UK
Bob Coecke - University of Oxford, UK
Andrea Corradini - University of Pisa, I
Mai Gehrke - Universit?? Paris Diderot - Paris 7, F
H. Peter Gumm - Philipps University Marburg, D
Gopal Gupta - University of Texas at Dallas, USA
Ichiro Hasuo - Tokyo University, Japan
Reiko Heckel - University of Leicester, UK (cochair)
Bart Jacobs - Radboud University Nijmegen, NL
Ekaterina Komendantskaya - University of Dundee, Scotland, UK
Barbara K??nig - University of Duisburg-Essen, D
Jos?? Meseguer - University of Illinois, Urbana-Champaign, USA
Marino Miculan - University of Udine, I
Stefan Milius - Friedrich-Alexander Universit??t Erlangen-N??rnberg, D (cochair)
Larry Moss - Indiana University, Bloomington, USA
Till Mossakowski - DFKI Lab Bremen and University of Bremen, D
Prakash Panangaden - McGill University, Montreal, Canada
Dirk Pattinson - Imperial College London, UK
Dusko Pavlovic - Royal Holloway, University of London, UK
Daniela Petrisan - University of Leicester, UK
John Power - University of Bath, UK
Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL
Lutz Schr??der - Friedrich-Alexander Universit??t Erlangen-N??rnberg, D
Monika Seisenberger - Swansea University, UK
Sam Staton - University of Cambridge, UK
Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL
Pawel Sobocinski - University of Southampton, UK
Yde Venema - University of Amsterdam, NL
Uwe Wolter - University of Bergen, NO
-- ORGANISING COMMITTEE --
Bartek Klin (University of Warsaw, Poland)
Andrzej Tarlecki (University of Warsaw, Poland)
-- LOCATION --
Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.
-- SATELLITE WORKSHOPS --
CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired
by Monika Seisenberger (Swansea University). The workshop is dedicated
to presentation 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 -
it is anticipated that many CALCO conference participants will want to
attend the CALCO Early Ideas workshop (and vice versa).
A workshop dedicated to tools based on algebraic and/or coalgebraic
principles, CALCO Tools, will be held alongside the main conference,
chaired by Lutz Schr??der (Friedrich Alexander Universit??t
Erlangen-N??rnberg). Papers of this workshop will be included in the
CALCO proceedings.
-- CALCO Early Ideas Overview --
The CALCO Early Ideas Workshop invites submissions on the same topics
as the CALCO conference: reporting results of theoretical work on the
mathematics of algebras and coalgebras, 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. The list of topics of particular interest is
shown on the main CALCO 2013 page.
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.
Submissions will be handled via EasyChair
https://www.easychair.org/conferences/?conf=calcoearlyideas2013
The use of LNCS style is strongly encouraged.
After the workshop, authors will have the opportunity to submit
a full 10-15 page paper on the same topic. The reviewing will be carried out by
the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of
selected papers will be available online. Authors will retain copyright, and are
also encouraged to disseminate the results by subsequent publication elsewhere.
http://coalg.org/calco13/workshops.html#ei
-- CALCO Early Ideas Dates --
2-page short contribution submission: May 27, 2013
Notification for short contribution: June 24, 2013
Final short contribution due: July 15, 2013
CALCO Early Idead Workshop: September 2, 2013
10-15 page paper submission: October 15, 2013
Notification for paper: December 15, 2013
Final paper version due: January 15, 2014
-- CALCO Early Ideas Program Committee --
Bartek Klin, University of Warsaw, Poland
John Power, University of Bath, UK
Monika Seisenberger, Swansea University, UK (chair)
-- CALCO-Tools Overview --
CALCO-Tools will take place on the same dates as the main CALCO
conference, with no overlap between the technical programmes of the
two events. Topics of interest include systems, prototypes, and tools
developed specifically for the design, checking, execution, and
verification of (co)algebraic specifications, but also tools targeting
different application domains while making core or interesting use of
(co)algebraic techniques.
Tool submissions should not exceed 5 pages in LNCS format. The
accepted tool papers will be included in the final proceedings of the
conference. The tools should be made available on the web at the time
of submission. Each submission will be evaluated by at least three
reviewers; one or more of the reviewers will be asked to download and
use the tool. At least one of the authors of each tool paper must
attend the conference to demo the tool.
http://coalg.org/calco13/workshops.html#tools
-- CALCO-Tools Dates --
Paper submission: April 8, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
-- CALCO-Tools Programme Committee --
Einar Broch Johnsen, University of Oslo, Norway
Mark Hills, CWI Amsterdam, The Netherlands
Barbara K??nig, University of Duisburg-Essen, Germany
Dorel Lucanu, Alexandru Ioan Cuza University, Romania
Dominik Luecke, CWI Amsterdam, The Netherlands
Till Mossakowski, DFKI, Germany
Lutz Schr??der, Friedrich-Alexander Universit??t Erlangen-N??rnberg,
Germany (chair)
Alexandra Silva, Radboud University Nijmegen and CWI Amsterdam, The Netherlands
-- FURTHER INFORMATION --
Queries related to submission, reviewing, and programme should be sent
to the relevant conference or workshop chairs.
Queries related to the organisation should be emailed to
calco2013(a)mimuw.edu.pl
.
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]