皆様、産業技術総合研究所の北村です。
今年10月に ニュージーランドで開催される FTSCS2013 の論文募集の案内をお送りいたします。是非論文投稿をご検討下さい。
---------------------------------------------------------------------
Call for Papers
FTSCS 2013
2nd International Workshop on Formal Techniques for Safety-Critical Systems
Queenstown, New Zealand, October 29, 2013
(satellite workshop of ICFEM 2013)
http://www.ftscs.org
---------------------------------------------------------------------
*** Science of Computer Programming special issue ***
*** Springer CCIS proceedings ***
Aims and Scope:
There is an increasing demand in industry to use formal methods to
achieve software-independent verification and validation of
safety-critical systems, e.g., in fields such as avionics, automotive,
medical, and other cyber-physical systems. Newer standards, such as
DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for
formal methods and model-based development, speeding up the
adaptation of such methods in industry.
The aim of this workshop is to bring together researchers
and engineers who are interested in the application of formal and semi-formal
methods to improve the quality of safety-critical computer systems. In
particular, FTSCS strives strives to promote research and development of
formal methods and tools for industrial applications, and is particularly
interested in industrial applications of formal methods.
Specific topics include, but are not limited to:
* case studies and experience reports on the use of formal methods for
analyzing safety-critical systems, including avionics, automotive,
medical, and other kinds of safety-critical and QoS-critical systems
* methods, techniques and tools to support automated analysis,
certification, debugging, etc., of complex safety/QoS-critical systems
* analysis methods that address the limitations of formal methods in
industry (usability, scalability, etc.)
* formal analysis support for modeling languages used in industry,
such as AADL, Ptolemy, SysML, SCADE, Modelica, etc.
* code generation from validated models.
The workshop will provide a platform for discussions and the exchange of
innovative ideas, so submissions on work in progress are encouraged.
Invited speaker:
TBA
Submission:
We solicit submissions reporting on:
A- original research contributions (15 pages max, LNCS format);
B- applications and experiences (15 pages max, LNCS format);
C- surveys, comparisons, and state-of-the-art reports (15 pages max,
LNCS format);
D- tool papers (5 pages max, LNCS format);
E- position papers and work in progress (5 pages max, LNCS format)
related to the topics mentioned above.
All submissions must be original, unpublished, and not submitted concurrently
for publication elsewhere. Paper submission will be done electronically
via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2013.
The final version of the paper must be prepared in LaTeX, adhering to
the LNCS format available at
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.
Publication:
All accepted papers will appear in the pre-proceedings of FTSCS 2013.
Accepted papers in the categories A-D above will appear in
the workshop proceedings that will be published as a volume in
Springer's CCIS series.
The authors of a selected subset of accepted papers will be invited to submit
extended versions of their papers to appear in a special issue of the
Science of Computer Programming journal.
Important dates:
Submission deadline: September 1, 2013
Notification of acceptance: September 28, 2013
Workshop: October 29, 2013
Venue:
Queenstown, New Zealand
Program chairs:
Cyrille Artho AIST, Japan
Peter Olveczky University of Oslo, Norway
Program committee:
Erika Abraham RWTH Aachen University, Germany
Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia
Farhad Arbab Leiden University and CWI, The Netherlands
Cyrille Artho AIST, Japan
Saddek Bensalem Verimag, France
Armin Biere Johannes Kepler University, Austria
Santiago Escobar Universidad Politecnica de Valencia, Spain
Ansgar Fehnker University of the South Pacific, Fiji
Mamoun Filali IRIT, France
Bernd Fischer Stellenbosch University, South Africa and
University of Southampton, UK
Kokichi Futatsugi JAIST, Japan
Klaus Havelund NASA JPL, USA
Marieke Huisman University of Twente, The Netherlands
Ralf Huuck NICTA/UNSW, Sydney, Australia
Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan
Takashi Kitamura AIST, Japan
Alexander Knapp Augsburg University, Germany
Paddy Krishnan Oracle Labs Brisbane, Australia
Yang Liu Nanyang Technological University, Singapore
Robi Malik University of Waikato, New Zealand
Cesar Munoz NASA Langley, USA
Tang Nguyen UST Hanoi, Vietnam
Thomas Noll RWTH Aachen University, Germany
Peter Olveczky University of Oslo, Norway
Paul Pettersson Malardalen University, Sweden
Camilo Rocha Escuela Colombiana de Ingenieria, Colombia
Grigore Rosu University of Illinois at Urbana-Champaign, USA
Neha Rungta NASA Ames, USA
Ralf Sasse ETH Zurich, Switzerland
Oleg Sokolsky University of Pennsylvania, USA
Sofiene Tahar Concordia University, Canada
Carolyn Talcott SRI International, USA
Tatsuhiro Tsuchiya Osaka University, Japan
Michael Whalen University of Minnesota, USA
Peng Wu Chinese Academy of Sciences, China
Contact:
(web) http://www.ftscs.org
(email) peterol(a)ifi.uio.no and c.artho(a)aist.go.jp
--
Takashi KITAMURA Ph.D.
t.kitamura(a)aist.go.jp
http://staff.aist.go.jp/t.kitamura/
Research Institute for Secure Systems (RISEC)
National Institute of Advanced Industrial Science and Technology (AIST)
Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan
Tel: +81-6-6494-8054 Fax: +81-6-6494-8073
Internal Tel: *33-274-71902
APLASの締め切りが6月14日に迫って来ました。
重複をご容赦下さい。
===============================================================
APLAS 2013
11th Asian Symposium on Programming Languages and Systems
9-11 December 2013
Melbourne, Australia (colocated with CPP 2013)
CALL FOR PAPERS
===============================================================
==========
BACKGROUND
==========
APLAS aims to stimulate programming language research by providing a
forum for the presentation of latest results and the exchange of ideas
in programming languages and systems. APLAS is based in Asia, but is
an international forum that serves the worldwide programming language
community.
APLAS is sponsored by the Asian Association for Foundation of Software
(AAFS) founded by Asian researchers in cooperation with many researchers
from Europe and the USA. Past APLAS symposiums were successfully held
in Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore
('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and
Beijing ('03) after three informal workshops. Proceedings of the past
symposiums were published in Springer's LNCS.
======
TOPICS
======
The symposium is devoted to foundational and practical issues in
programming languages and systems. Papers are solicited on topics such
as
* semantics, logics, foundational theory;
* design of languages, type systems and foundational calculi;
* domain-specific languages;
* compilers, interpreters, abstract machines;
* program derivation, synthesis and transformation;
* program analysis, verification, model-checking;
* logic, constraint, probabilistic and quantum programming;
* software security;
* concurrency and parallelism;
* tools and environments for programming and implementation.
Topics are not limited to those discussed in previous symposiums.
Papers identifying future directions of programming and those
addressing the rapid changes of the underlying computing platforms
are especially welcome. Demonstration of systems and tools in the
scope of APLAS are welcome to the System and Tool presentations
category. Authors concerned about the appropriateness of a topic
are welcome to consult with program chair prior to submission.
==========
SUBMISSION
==========
We solicit submissions in two categories:
*Regular research papers* describing original scientific research
results, including tool development and case studies. Regular
research papers should not exceed 16 pages in the Springer LNCS
format, including bibliography and figures. They should clearly
identify what has been accomplished and why it is significant.
Submissions will be judged on the basis of significance, relevance,
correctness, originality, and clarity. In case of lack of space,
proofs, experimental results, or any information supporting the
technical results of the paper could be provided as an appendix or a
link to a web page, but reviewers are not obliged to read them.
*System and Tool presentations* describing systems or tools that support
theory, program construction, reasoning, or program execution in the
scope of APLAS. System and Tool presentations are expected to be
centered around a demonstration. The paper and the demonstration
should identify the novelties of the tools and use motivating
examples. System and Tool papers should not exceed 8 pages in the
Springer LNCS format, including bibliography and figures. Submissions
will be judged based on both the papers and the described systems or
tools. It is highly desirable that the tools are available on the
web.
Papers should be submitted electronically via the submission web page:
https://www.easychair.org/conferences/?conf=aplas2013
Acceptable formats are PostScript or PDF. Submitted papers must be
unpublished and not submitted for publication elsewhere. Papers must
be written in English. The proceedings will be published as a volume
in Springer's LNCS series. Accepted papers must be presented at the
conference. (While the general chair and the program chair cannot
submit papers, other members of the program committee can.)
=====
DATES
=====
Abstract due: 10 June 2013 (Monday), 23:59 UTC
Submission due: 14 June 2013 (Friday), 23:59 UTC
Notification: 26 August 2013 (Monday)
Final paper due: 19 September 2013 (Thursday)
Conference: 9-11 December 2013 (Monday-Wednesday)
==========
ORGANIZERS
==========
General chair:
Peter Schachte (University of Melbourne)
Program chair:
Chung-chieh Shan (Indiana University)
Program committee:
Filippo Bonchi (CNRS, ENS-Lyon, France)
Yu-Fang Chen (Academia Sinica, Taiwan)
Shigeru Chiba (The University of Tokyo, Japan)
Jacques Garrigue (Nagoya University, Japan)
Robert Glück (University of Copenhagen, Denmark)
R. Govindarajan (Indian Institute of Science, India)
Kazuhiro Inaba (Google, Inc., Japan)
Jie-Hong Roland Jiang (National Taiwan University, Taiwan)
Shin-ya Katsumata (Kyoto University, Japan)
Gabriele Keller (University of New South Wales, Australia)
Ana Milanova (Rensselaer Polytechnic Institute, USA)
Keisuke Nakano (The University of Electro-Communications, Japan)
Hakjoo Oh (Seoul National University, Korea)
Bruno C. d. S. Oliveira (National University of Singapore, Singapore)
Kaushik Rajan (Microsoft Research, India)
Max Schäfer (Nanyang Technological University, Singapore)
Ulrich Schöpp (Ludwig-Maximilians-Universität München, Germany)
Paula Severi (University of Leicester, UK)
Gang Tan (Lehigh University, USA)
Hiroshi Unno (University of Tsukuba, Japan)
Meng Wang (Chalmers University of Technology, Sweden)
Jingling Xue (University of New South Wales, Australia)
Mingsheng Ying (University of Technology, Sydney, Australia)
Kenny Q. Zhu (Shanghai Jiao Tong University, China)
=======
CONTACT
=======
http://aplas2013.soic.indiana.edu/ aplas2013(a)easychair.org
皆様
以下のメールを代理投稿します。 小野寛晰
----------------------------------------
Dear Madam/Sir,
I would like to announce the KEOD’s Special Session (this year in Vilamoura, Portugal) devoted to formal and non-formal aspects of nonmonotonicity. Strict applying of the definition of nonmonotonic inference shows that many examples for nonmonotonicity of human thinking as well as constructions, traditionally understood as nonmonotonic have nothing common with the negation of well known Tarski’s condition for monotonic operation. A rejection from nonmonotonic interpretation of those examples and constructions opens new perspectives in researches on human thinking.
http://www.keod.ic3k.org/non-nonmonotonicity.aspx
With kind regards,
Piotr Lukowski - Chair of KEOD’s Special Session: “Non-nonmonotonicity”
Department of Cognitive Science
Institute of Psychology
University of Lodz, Poland
みなさま,
こんにちは! 東京大学の蓮尾です.
SCメンバーとして,ゲーム意味論についてのワークショップ GaLoP
のご案内を再度お送りします.投稿締切は 5/31 ですが,
アブストラクトのみの投稿で,論文投稿は optional です.ぜひご検討ください.
どうかよろしくお願いいたします.それでは!
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/
---------- Forwarded message ----------
8th Workshop on Games for Logic and Programming Languages (GaLoP 2013)
// Queen Mary, University of London // London, UK // 18-19 July //
[http://www.gamesemantics.org]
-----------------------------------------------------------------------
Please note the deadline of *** MAY 31 *** for submission of abstracts.
-----------------------------------------------------------------------
GaLoP is an annual international workshop on game-semantic models for
logics and programming languages and their applications. This is an
informal workshop that welcomes work in progress, overviews of more
extensive work, programmatic or position papers and tutorials as well
as contributed papers and invited talks.
GaLoP VIII will be held in London, UK, on 18-19 July 2013.
It will be a stand-alone workshop hosted at the Mile End campus of
Queen Mary, University of London.
Contributions are invited on all pertinent subjects, with particular
interest in game-semantic and interaction models for logics and
programming languages, and applications to program analysis.
Typical but not exclusive areas of interest are:
* Game theory and interaction models in semantics;
* Games-based program analysis and verification;
* Logics for games and games for logics;
* Algorithmic aspects of games;
* Categorical aspects;
* Programming languages and full abstraction;
* Higher-order automata and Petri nets;
* Geometry of interaction;
* Ludics;
* Epistemic game theory;
* Logics of dependence and independence;
* Computational linguistics.
There will be no formal proceedings but the possibility of a special
issue in a journal will be considered (the 2005, 2008 and 2011
workshops led to special issues in Annals of Pure and Applied Logic).
// Submission Instructions //
Please submit an abstract of your proposed talk on the easychair
submission page below. You may also submit an accompanying paper for
the talk.
https://www.easychair.org/conferences/?conf=galop2013
// Important Dates //
Submission: May 31
Notification: June 7
Workshop: July 18-19
// Invited speakers //
* Ichiro Hasuo, Tokyo
* Colin Stirling, Edinburgh
* Viktor Winschel, Mannheim
* Nobuko Yoshida, Imperial
// Program Committee //
* Ugo Dal Lago, Bologna
* Dan Ghica, Birmingham
* Juha Kontinen, Helsinki
* Guy McCusker, Bath (co-chair)
* Andrzej Murawski, Warwick
* Nikos Tzevelekos, QMUL (co-chair)
* Glynn Winskel, Cambridge
Kobe Colloquium on Logic, Statistics and Informatics
以下の要領でコロキウムを開催します。
日時:2013年5月28日(火)13:20-14:50
講演者:Daisuke Ikegami (University of California, Berkeley)
場所:神戸大学自然科学総合研究棟3号館4階421室(プレゼンテーション室)
============================================================
題目: Inner models from logics
アブストラクト:
The goal of this research is to construct a model of set theory which
is "close to" HOD but easier to analyze. The motivation comes from
Woodin's HOD Conjecture, which states that HOD is very "close to" V
under the presence of a very strong large cardinal (extendible
cardinal). HOD Conjecture is closely related to the problem of
constructing a canonical extender model with a supercompact cardinal
and it has striking applications to the theory of large cardinals
without the Axiom of Choice.
To solve HOD Conjecture, one would expect a fine analysis of HOD. The
difficulty of the analysis of HOD lies in the fact that HOD is very
"non-absolute", e.g., one could force V = HOD with a proper class
partial order.
Given that HOD is obtained using full second order logic in the same
way as Gödel's constructible universe L via first order logic, in this
talk, we use Boolean valued higher order logics to construct inner
models of set theory which are more "absolute" than HOD and
investigate the properties of the models.
============================================================
交通:阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」
行きに乗車,「神大本部工学部前」停留所下車,徒歩すぐ.
http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm
連絡先:ブレンドレ ヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp
みなさま,
東京大学の蓮尾です.来週火曜日の研究室セミナーでは,
Leicester 大学の Irek Ulidowski さんをお迎えしてプロセス計算と
event structure に関するご研究をお話いただきます.
ぜひご参加ください.
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
________________________________
Tue 21 May 2013, 15:30-17:30
Irek Ulidowski (University of Leicester)
Modelling of bonding with processes ad events
理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7
アクセス: https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html (一番下)
Access: http://www-mmm.is.s.u-tokyo.ac.jp/ (see bottom)
We introduce two forms of modelling of systems that consist of objects
that are combined together by the means of bonds. In reaction systems
for bonding we define how bonds are created and dissolved via
reduction-style semantics. The usefulness of reaction systems is
illustrated with examples taken from software engineering and
biochemistry. We also introduce reversible event structures and define
the notion of configuration. We then discuss how to give semantics of
reaction systems for bonding in terms of reversible event structures.
皆様
東大の河村です
お世話になっております
直前の御連絡ですみませんが
20日(月)の講演会の御案内です
どうぞお越し下さい
--
河村彰星
東京大学大学院情報理工学系研究科コンピュータ科学専攻
助教(今井研究室)
03-5841-4097
http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html
ELC Seminar
http://www.al.ics.saitama-u.ac.jp/elc/event/list.cgi?regid=20130520-0000-20…
Monday 1 pm, May 20, 2013
Seminar room, ELC Centre, 5th floor of Tokyo Institute of Technology Tamachi office (東京工業大学キャンパスイノベーションセンター)
http://www.al.ics.saitama-u.ac.jp/elc/en/?celc
Algorithmically random infinite structures
Bakhadyr Khoussainov (University of Auckland)
The last two decades have witnessed significant advances in the investigation of algorithmic randomness of infinite strings. Monographs by Downey and Hirschfeldt, and by Nies account for the recent research activities in the area. In spite of much work, research on randomness of infinite strings has excluded the investigation of algorithmic randomness for infinite algebraic structures such graphs, trees, groups or more generally universal algebras. In this talk, we provide a framework for reasoning about algorithmic randomness for various classes of infinite structures.
皆様:
以下の要領で名古屋集合論セミナーを開催します。
奮って御参加下さい。
日時:5月24日(金) 15:30-
場所:名古屋大学 全学教育棟3階 SIS5 教室
(http://www.nagoya-u.ac.jp/2012website/global-info/images/access-map/map2.pdf の地図でB4(1)の建物です。
建物内配置図は http://www.ilas.nagoya-u.ac.jp/student/lectureroom/ でご覧になれます。
SIS5 教室は3階の中央より少し北, C36の北隣にあります。)
講演者:池上大祐 (学振海外特別研究員, カリフォルニア大学バークレー校)
題: Inner models from logics
アブストラクト:
The goal of this research is to construct a model of set theory which
is "close to" HOD but easier to analyze. The motivation comes from
Woodin's HOD Conjecture, which states that HOD is very "close to" V
under the presence of a very strong large cardinal (extendible
cardinal). HOD Conjecture is closely related to the problem of
constructing a canonical extender model with a supercompact cardinal
and it has striking applications to the theory of large cardinals
without the Axiom of Choice.
To solve HOD Conjecture, one would expect a fine analysis of HOD. The
difficulty of the analysis of HOD lies in the fact that HOD is very
"non-absolute", e.g., one could force V = HOD with a proper class
partial order.
Given that HOD is obtained using full second order logic in the same
way as Gödel's constructible universe L via first order logic, in this
talk, we use Boolean valued higher order logics to construct inner
models of set theory which are more "absolute" than HOD and
investigate the properties of the models.