Logic-ml December 2019

9 participants
10 discussions

第52回TRSミーティング参加者募集のご案内
by Nao Hirokawa 03 Jan '20

03 Jan '20

皆様来年2月20日〜22日に石川県加賀市で行われます「第52回TRSミーティング」の参加者募集案内をお送り致します。本ミーティングは口頭発表からなるインフォーマルな国内集会でして、項書換え分野の発表だけでなくその隣接分野、応用分野の発表も大歓迎です。参加をご検討頂けると幸いです。廣川直 (JAIST) ====================================================================== CALL FOR PARTICIPATION 52nd TRS Meeting February 20 - 22, 2020, Kaga, Ishikawa https://www.jaist.ac.jp/~hirokawa/trs-meeting/original/52.html ====================================================================== The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk of approximately 15 to 60 minutes in English on their research activities. The subject of the talk is not required to be one's original result; for example, explaining an interesting paper is perfectly OK. See also: http://www.jaist.ac.jp/~hirokawa/trs-meeting/ * Information Date: February 20 (Thu) - 22 (Sat), 2020 Venue: Hotel Arrowle (http://www.arrowle.co.jp/) 5-1 Shibayama-cho, Kaga, Ishikawa, Japan Registration fee: tba (but most likely around 26,000 JPY) Accommodation fees: - 7,850 JPY per night for a single room - 6,200 JPY per night for a twin room shared with two persons * Registration Please send the following registration form to Nao Hirokawa <hirokawa(a)jaist.ac.jp> by January 7 (Tue), 2020. ---------------------------------------------------------------------- Registration Form of the 52nd TRS Meeting Name: Affiliation: Title of talk (*): Duration of talk (*): Preference on your room: [single / shared] [Male / Female] (leave one) Requests/comments (on foods, partial participation, etc.): ---------------------------------------------------------------------- The items marked with * can be sent later.

1 1

IJCAR 2020: CFP
by Takahito Aoto 24 Dec '19

24 Dec '19

皆様，国際会議IJCARの投稿募集です(概要締切1/16，論文締切1/23)．今回は，CADE, FroCoS, TABLEAUX だけでなくて，ITP (International Conference on Interactive Theorem Proving)の合同会議になっています．また，FSCDとの同時開催(6/29-7/5，@パリ)になります．ぜひ，ご投稿を検討頂けますよう，よろしくお願い申し上げます． --- 青戸等人(新潟大学) =============================================================================== CALL FOR PAPERS IJCAR 2020 The 10th International Joint Conference on Automated Reasoning Paris, France, June 29-July 5, 2020 https://ijcar2020.org =============================================================================== IJCAR is the premier international joint conference on all topics in automated reasoning. The IJCAR 2020 technical program will consist of presentations of high-quality original research papers, short papers describing interesting work in progress, system descriptions, and invited talks. IJCAR 2020 (+ workshops, tutorials, etc.) will take place in Paris (France) from June 29 to July 5 2020. It will be co-located with the conference FSCD. IJCAR 2020 is the merger of leading events in automated reasoning: * CADE (Conference on Automated Deduction) * FroCoS (Symposium on Frontiers of Combining Systems) * ITP (International Conference on Interactive Theorem Proving) * TABLEAUX (Conference on Analytic Tableaux and Related Methods) TOPICS ====== IJCAR 2020 invites submissions related to all aspects of automated or interactive reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems or proof assistants are solicited. IJCAR topics include the following ones: * Logics of interest include: propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, type theory. * Methods of interest include: tableaux, sequent calculi, resolution, model- elimination, inverse method, paramodulation, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, AI-related methods for deductive systems, proof presentation, automated theorem proving, combination of decision or proof procedures, SAT and SMT solving, integration of proof assistants with automated provers and other symbolic tools, etc. * Applications of interest include: verification, formal methods, program analysis and synthesis, computer mathematics, declarative programming, deductive databases, knowledge representation, education, formalization of mathematics etc. The proceedings of IJCAR 2020 will be published by Springer in the LNAI/LNCS series (www.springer.com/lncs). IMPORTANT DATES =============== * Abstract submission: January 16, 2020 * Paper submission: January 23, 2020 * Rebuttal: March 6-10, 2020 * Notification: March 20, 2020 * Final version of papers due: April 10, 2020 * IJCAR Conference + Workshops: June 29 - July 5, 2020 INVITED SPEAKERS ================ * Clark Barrett (Stanford University, USA) * John Harrison (Amazon Web Services, USA) Joint IJCAR-FSCD speaker * Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil) * Ruzica Piskac (Yale University, USA) * Rene Thiemann (University of Innsbruck, Austria) Joint FSCD-IJCAR speaker SUBMISSION GUIDELINES ===================== Submission is electronic, through https://easychair.org/conferences/?conf=ijcar2020 Authors are strongly encouraged to use LaTeX and the Springer "llncs" format, which can be obtained from http://www.springer.de/comp/lncs/authors.html We solicit three categories of submissions: REGULAR PAPERS. Submissions, not exceeding fifteen (15) pages excluding bibliography, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and software available with their submission for reproducibility. In particular submissions describing formal proofs are expected to be accompanied by the source files of the formalization. The PC will take availability of software and data into account when evaluating submissions. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses and strength in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. SYSTEM DESCRIPTIONS. Submissions, not exceeding seven (7) pages excluding bibliography, should describe the implemented tool and its novel features. Submissions in this category should bear the phrase "(system description)" beneath the title. One author is expected to be able to perform a demonstration on demand to accompany a tool presentation. Papers describing tools that have already been presented in other conferences before will be accepted only if significant and clear enhancements to the tool are reported and implemented. SHORT PAPERS. Submissions, not exceeding five (5) pages excluding bibliography, and describing interesting work in progress. Such a preliminary report may consist of an extended abstract. Each of these papers should bear the phrase "(short paper)" beneath the title. Accepted submissions in this category will be presented as short talks and published in the main proceedings. There will be no downgrading from regular papers or system descriptions to short papers. All submissions should meet high academic standards; proofs of theoretical results that do not fit in the page limit, executables of systems, and input data of experiments should be made available, via a reference to a website or in an appendix of the paper. BEST PAPER AWARD ================ IJCAR 2020 will recognize the most outstanding submission with a best paper award at the conference. STUDENT TRAVEL AWARDS ==================== Woody Bledsoe Travel Awards will be available to support selected students attending the conference. SPECIAL ISSUE ============= The authors of a selection of the best IJCAR 2020 papers will be invited to submit an extended version of their paper after the conference, to be published in a special issue of Logical Methods in Computer Science. ORGANIZATION ============ Conference Chair: * Kaustuv Chaudhuri (INRIA, Ecole Polytechnique) Programme Chairs: * Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France), * Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany) Workshop, Tutorial and Competition Chairs: * Giulio Manzonetto (Université Paris-Nord, France) * Andrew Reynolds (University of Iowa, USA) Programme Committee: * Takahito Aoto (Niigata University, Japan) * Carlos Areces (FaMAF Universidad Nacional de Cordoba, Argentina) * Jeremy Avigad (Carnegie Mellon University, USA) * Franz Baader (TU Dresden, Germany) * Peter Baumgartner (Data 61 and CSIRO, Australia) * Christoph Benzmüller (Freie Universität Berlin, Germany) * Yves Bertot (INRIA, Sophia Antipolis, France) * Armin Biere (Johannes Kepler University Linz, Austria) * Nikolaj Bjorner (Microsoft Research, USA) * Jasmin Blanchette (Vrije Universiteit Amsterdam, Netherlands) * Maria Paola Bonacina (Universita degli Studi di Verona, Italy) * James Brotherston (University College London, UK) * Serenella Cerrito (IBISC, Univ. Evry, Paris Saclay University, France) * Agata Ciabattoni (Vienna University of Technology, Austria) * Koen Claessen (Chalmers University of Technology, Gothenburg, Sweden) * Leonardo de Moura (Microsoft Research, USA) * Stéphane Demri (CNRS, LSV, ENS Paris-Saclay, France) * Gilles Dowek (Inria and ENS Paris-Saclay, France) * Marcelo Finger (University of São Paulo, Brazil) * Pascal Fontaine (Universite de Lorraine, CNRS, Inria, LORIA, France) * Didier Galmiche (Universite de Lorraine - LORIA, France) * Silvio Ghilardi (Universita degli Studi di Milano, Italy) * Martin Giese (Universitetet i Oslo, Norway) * Juergen Giesl (RWTH Aachen University, Germany) * Valentin Goranko (Stockholm University, Sweden) * Rajeev Gore (The Australian National University, Australia) * Stefan Hetzl (Vienna University of Technology, Austria) * Marijn J. H. Heule (The University of Texas at Austin, USA) * Cezary Kaliszyk (University of Innsbruck, Austria) * Deepak Kapur (University of New Mexico, USA) * Laura Kovacs (Vienna University of Technology, Austria) * Andreas Lochbihler (Digital Asset (Switzerland) GmbH) * Christopher Lynch (Clarkson University, USA) * Assia Mahboubi (Inria, France) * Panagiotis Manolios (Northeastern University, USA) * Dale Miller (Inria and LIX/Ecole Polytechnique, France) * Claudia Nalon (University of Brasilia, Brazil) * Tobias Nipkow (Technical University of Munich, Germany) * Albert Oliveras (Universitat Politècnica de Catalunya, Spain) * Jens Otten (University of Oslo, Norway) * Lawrence Paulson (University of Cambridge, UK) * Nicolas Peltier (CNRS, LIG, Univ. Grenoble Alpes, Grenoble France) * Frank Pfenning (Carnegie Mellon University, USA) * Andrei Popescu (Middlesex University London, UK) * Andrew Reynolds (University of Iowa, USA) * Christophe Ringeissen (LORIA-INRIA, France) * Christine Rizkallah (University of New South Wales, Australia) * Katsuhiko Sano (Hokkaido University, Japan) * Renate Schmidt (The University of Manchester, UK) * Stephan Schulz (DHBW Stuttgart, Germany) * Roberto Sebastiani (DISI, University of Trento, Italy) * Viorica Sofronie-Stokkermans (University Koblenz-Landau, Koblenz, Germany) * Matthieu Sozeau (INRIA Paris, France) * Martin Suda (Czech Technical University, Czech Republic) * Geoff Sutcliffe (University of Miami, USA) * Sofiene Tahar (Concordia University, Canada) * Cesare Tinelli (The University of Iowa, USA) * Christian Urban (King's College London, UK) * Josef Urban (Czech Technical University in Prague, Czech Republic) * Uwe Waldmann (Max Planck Institute for Informatics, Germany) * Christoph Weidenbach (Max Planck Institute for Informatics, Germany)

1 0

Call for submissions: MT-CPS 2020
by Kohei SUENAGA 17 Dec '19

17 Dec '19

皆様，（重複してお受け取りの方はご容赦ください．）京都大学の末永です．来年4月下旬に開催される CPS-IoT Week 2020 併設のワークショップ MT-CPS 2020 の発表募集をお送りします． https://sites.google.com/view/mt-cps2020/ サイバーフィジカルシステムのモニタリングとテストを中心として関連するトピックに関する発表を募集しております． CPs-IoT Week にお越しの方は特に，それ以外の方もどうぞ発表をご検討ください．末永 ========================================================================== 5th Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS 2020) https://sites.google.com/view/mt-cps2020/home Part of CPS-IoT Week 2020 https://www.cse.unsw.edu.au/~cpsiot/cpsweek2020/ April 21, 2020 - Sydney, Australia ========================================================================== * Description Cyber-physical systems (CPS) model the integration of computational modules, like decision logic, with physical phenomena in the environment, such as the phenomenon being controlled by the logic. Several CPS applications, such as self-driving cars and other autonomous ground/aerial/underwater vehicles, medical devices, surgical robots, as well as many Internet of Things (IoT) applications, particularly for Industrial IoT or Industry 4.0, are safety-critical, where human lives can be at stake. CPS exhibit complex and unpredictable behaviors, thus making their correctness and robustness analysis a challenging task. Given the gap between the complexity of such systems and the scalability of current formal methods, exhaustive formal verification remains an elusive goal. However, simulation-based lightweight verification techniques, such as monitoring and testing, achieve both rigor and efficiency by enabling the evaluation of systems according to the properties of their exemplar behaviors. The Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS) aims to bring together researchers and practitioners interested in the problems of detecting, testing, measuring, and extracting qualitative and quantitative properties from individual behaviors of CPS. * Topics of interest include (but are not limited to): - Specification languages for monitoring and testing - Runtime verification and monitoring of CPS - Model/Software/Hardware/Processor-in-the-loop (MIL/SIL/HIL/PIL) testing - Testing the integration of heterogeneous components - Monitoring and testing of streaming and/or historical IoT data - Interpretation of multi-dimensional counter-examples - Black-box and white-box testing - Measuring and statistical information gathering for data-driven analyses - Simulation-based verification and parameter synthesis - Fault diagnostics, localization, and recovery - Combination of static and dynamic analysis - Applications and case studies from safety-critical domains * Workshop format MT-CPS is intended to be a forum for exchanging the latest scientific activity and emerging trends between researchers and practitioners. We encourage submission of abstracts that address any of the aforementioned topics of interest and cover recently published or work in progress. In addition to the contributed material, the workshop will include a combination of invited talks from leading researchers and/or practitioners from industry, academia, and government research labs around the world. The workshop is intended to be an informal gathering about latest results and, as such, it will not have formal proceedings. However, we will make accepted abstracts and presentation material publicly available. Abstracts are submitted via Easychair: https://easychair.org/conferences/?conf=mtcps2020 * Submission instructions Abstracts should be in PDF form, up to 2 pages in length with 1-inch margins and at least 10-point font size, and may contain up to two figures. Abstracts should list the full names, affiliations, and contact information of all authors. If you are interested in demonstrating a technology you are working on at the workshop, please indicate so in your abstract submission. Abstracts will be reviewed by the Program Committee. Those that are selected for oral presentations will be posted on the workshop website, and will be part of the papers distributed to CPS-IoT Week participants. * Important Dates Abstract submission deadline: February 16, 2020 Notification: March 8, 2020 Final version: March 29, 2020 Workshop: April 21, 2020 * Committee - Program Chairs Paolo Arcaini, National Institute of Informatics Kohei Suenaga, Kyoto University - Program Committee Houssam Abbas, Oregon State University Shaukat Ali, Simula Research Laboratory Ezio Bartocci, Vienna University of Technology Thao Dang, Verimag Jyotirmoy Deshmukh, University of Southern California Alexandre Donzé, Decyphir Georgios Fainekos, Arizona State University Ichiro Hasuo, National Institute of Informatics Bardh Hoxha, Souther Illinois University Baekgyu Kim, Toyota InfoTechnology Center Konstantinos Mamouras, Rice University Mohammad Mousavi, University of Leicester Jens Oehlerking, Robert Bosch GmbH Akshay Rajhans, MathWorks Kristin Yvonne Rozier, Iowa State University Oleg Sokolsky, University of Pennsylvania - Steering Committee Houssam Abbas, Oregon State University Ezio Bartocci, Vienna University of Technology Jyotirmoy Deshmukh, University of Southern California Georgios Fainekos, Arizona State University Sajed Miremadi, Volvo Cars Dejan Nickovic, AIT Austrian Institute of Technology Jens Oehlerking, Bosch

1 0

FSCD 2020 - Second CFP
by Nao Hirokawa 13 Dec '19

13 Dec '19

皆様 6月末にパリで行われます FSCD 2020 の二回目の論文募集案内をお送り致します。招待講演者の情報が加筆されております。ぜひ論文の投稿をご検討下さい。廣川 (JAIST) ========================================================================= Updated information on: Invited speakers ========================================================================= CALL FOR PAPERS Fifth International Conference on Formal Structures for Computation and Deduction (FSCD 2020) June 29 – July 5, 2020, Paris, France http://fscd2020.org/ IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: February 6, 2020 Submission: February 9, 2020 Rebuttal: March 27-29, 2020 Notification: April 13, 2020 Final version: April 27, 2020 INVITED SPEAKERS ---------------- - René Thiemann: FSCD-IJCAR joint speaker (http://cl-informatik.uibk.ac.at/users/thiemann/) - John Harrison: FSCD-IJCAR joint speaker (https://www.cl.cam.ac.uk/~jrh13/) - Brigitte Pienta (https://www.cs.mcgill.ca/~bpientka/) - Andrew Pitts (https://www.cl.cam.ac.uk/~amp12/) - Simona Ronchi della Rocca (http://www.di.unito.it/~ronchi/) FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation, semantics and verification in new challenging areas. The suggested, but not exclusive, list of topics for submission is: 1. Calculi: Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.); Lambda calculus; Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.); Proof theory (natural deduction, sequent calculus, proof nets, etc.); Type theory and logical frameworks; Homotopy type theory; Quantum calculi. 2. Methods in Computation and Deduction: Type systems (poly- morphism, dependent, recursive, intersection, session, etc.); Induction, coinduction; Matching, unification, completion, order- ings; Strategies (normalization, completeness, etc.); Tree automata; Model building and model checking; Proof search and theorem proving; Constraint solving and decision procedures. 3. Semantics: Operational semantics and abstract machines; Game Semantics and applications; Domain theory and categorical models; Quantitative models (timing, probabilities, etc.); Quantum computation and emerging models in computation. 4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference and type checking; Abstract Interpretation; Complexity analysis and implicit computational complexity; Checking termination, confluence, derivational complexity and related properties; Symbolic computation. 5. Tools and Applications: Programming and proof environments; Verification tools; Proof assistants and interactive theorem provers; Applications in industry; Applications of formal sys- tems in other sciences. 6. Semantics and Verification in new challenging areas: Certification; Security; Blockchain protocols; Data Bases; Deep learning and machine learning algorithms; Planning. PUBLICATION ————— The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SPECIAL ISSUE ------------- Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science. SUBMISSION GUIDELINES --------------------- Submissions can be made in two categories. Regular research papers are limited to 15 pages (including references, with the possibility to add an annex for technical details, e.g. proofs) and must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages (including references) and must present new software tools in which FSCD topics play an important role, or significantly new versions of such tools. Complete instructions on submitting a paper can be found on the conference web site. BEST PAPER AWARD BY JUNIOR RESEARCHERS -------------------------------------- The program committee will select a paper in which at least one author is a junior researcher, i.e. either a student or whose PhD award date is less than three years from the first day of the meeting. Other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s). PROGRAM COMMITTEE CHAIR ----------------------- Zena M. Ariola, University of Oregon fscd2020(a)easychair.org PROGRAM COMMITTEE ----------------- M. Alpuente, Technical Univ. of Valencia S. Alves, University of Porto A. Bauer, University of Ljubljana M. P. Bonacina, Università degli studi di Verona P-L. Curien, CNRS - Univ. of Paris Diderot P. Dybjer, Chalmers Univ. of Technology U. De’Liguoro, University of Torino M. Fernández, King’s College London M. Gaboardi, Boston University D. Ghica, University of Birmingham S. Ghilezan, University of Novi Sad J. Giesl, RWTH Aachen University S. Guerrini, University of Paris 13 R. Harper, Carnegie Mellon University M. Hasegawa, Kyoto University N. Hirokawa, JAIST P. Johann, Appalachian State University O. Kammar, University of Edinburgh D. Kesner, University of Paris Diderot C. Kop, Radboud University O. Laurent, ENS Lyon D. Licata, Wesleyan University A. Middeldorp, University of Innsbruck J. Mitchell, Stanford University K. Nakata, SAP Postdam M. Pagani, University of Paris Diderot E. Pimentel, Fed. Univ. Rio Grande do Norte F. van Raamsdonk, Vrije University Amsterdam G. Rosu, University of Illinois A. Sabry, Indiana University A. Stump, University of Iowa P. Urzyczyn, University of Warsaw T. Uustalu, Reykjavik University S. Zdancewic, University of Pennsylvania CONFERENCE CHAIR ---------------- Stefano Guerrini, University of Paris 13 WORKSHOP CHAIR -------------- Giulio Manzonetto, University of Paris 13 STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- J. Vicary, Oxford University PUBLICITY CHAIR --------------- S. Alves, University of Porto FSCD STEERING COMMITTEE ----------------------- S. Alves (University of Porto), M. Ayala-Rincón (University of Brasilia) C. Fuhs (Birkbeck, London University) H. Geuvers (Radboud University) D. Kesner (Chair, University of Paris Diderot ) H. Kirchner (Inria) C. Kop (Radboud University) D. Mazza (University of Paris 13) D. Miller (Inria) L. Ong (Oxford University) J. Rehof (TU Dortmund) S. Staton (Oxford University)

1 0

【投稿受付中】第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020)
by Kazuyuki ASADA 10 Dec '19

10 Dec '19

皆様，（重複受信ご容赦ください） # カテゴリ1（国内外未発表論文）の発表申込締切2週間前となりましたので， # 改めてCFPを送らせていただきます．ぜひ投稿をご検討ください．日本ソフトウェア科学会プログラミング論研究会は，第22回プログラミングおよびプログラミング言語ワークショップ（PPL 2020）を，2020年3月2日（月）～3月4日（水）に佐賀県嬉野市で開催いたします．理論・実装を問わずプログラミング・プログラミング言語に関する研究発表を幅広く募集します．どうぞ投稿をご検討ください．森畑明昌（東京大学）平石拓（京都大学）（PPL 2020 プログラム共同委員長）（代理で浅田和之（東北大学）が送信しました） ================================================== 第22回プログラミングおよびプログラミング言語ワークショップ (PPL 2020) 発表募集 2020年3月2日（月）-- 3月4日（水）佐賀県嬉野市「嬉野温泉　和多屋別荘」 https://jssst-ppl.org/workshop/2020/ ** 重要な日程 ** カテゴリ1: 発表申込締切 2019年12月24日（火）17:00 (JST) 論文提出締切 2020年 1月 7日（火）17:00 (JST) 採否通知 2020年 1月31日（金）最終原稿締切 2020年 2月12日（水）カテゴリ2: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月）カテゴリ3: 発表申込締切 2020年 2月 3日（月）17:00 (JST) 採否通知 2020年 2月 7日（金）カテゴリ4: 発表申込締切 2020年 1月21日（火）17:00 (JST) 採否通知 2020年 2月 3日（月） ** PPL2020とは ** PPL2020は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果や新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．代表的なトピックは以下のようなものですが，これに限らず，プログラミング・プログラミング言語に関する研究発表を幅広く受け入れます．基礎理論: 意味論，ラムダ計算，型理論，項書き換え，形式論理と証明，形式言語とオートマトン，圏論，チューリング機械，アルゴリズムなど言語デザイン: 各種プログラミングパラダイム（オブジェクト指向・関数型・論理型・アスペクト指向，その他あらゆるパラダイムを含む），モジュール化，メタプログラミング，並行・並列・分散計算，型システム，言語や言語システム等の相互運用，領域限定言語など言語処理系技術: コンパイラ，インタプリタ，実行時システム，仮想機械，プログラム最適化，プログラム解析，プログラム変換，メモリ管理などプログラミング補助: プログラム検証器，デバッガ，プロファイラ，統合開発環境，プログラム合成，リファクタリングなどケーススタディ: ソフトウェア開発報告，プログラミング技法，ツールの紹介など応用: システムソフトウェア，Webシステム，データベースシステム，数値計算，ユーザーインタフェース，セキュリティ，プログラミング教育，人工知能・機械学習など ** 招待講演 ** PPL2020では，以下のお二方の招待講演を予定しております．石川冬樹（NII）関浩之（名古屋大学）「データ値を扱うオートマトンと文法」 ** 発表募集カテゴリ ** 以下の4カテゴリの研究発表を募集します．カテゴリ1: 国内外で未発表の研究の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表カテゴリ4: サーベイ・チュートリアル発表カテゴリ1では，国内外で未発表の研究についての論文発表を募集します．PPL での議論をもとに研究を発展させ，国際会議や学術論文誌への投稿につなげることを奨励しています．会場で実りある議論ができるような，発展途上の研究を特に歓迎します．カテゴリ1の発表は，複数名の査読者によってその新規性・重要性・根拠の確かさ・説明の明瞭さを評価し，プログラム委員による議論によって採否を判断します．特に以下の点に注意してください． - 理論的な研究については，形式化の明瞭さと正しさが重要です．論文中に明示してあれば証明等が未完成でも構いませんが，証明等について議論できる程度の形式化は求められます． - 実装研究については，実装したソフトウェアやツールの有用性，実装のデザインチョイス，実装技術などが明瞭に説明されているかが重要です．論文中に明示してあれば実装や実験が未完成でも構いませんが，上記の点を議論できる程度の完成度は求められます．カテゴリ1で発表された研究のうち，PPL2020プログラム委員会により優れていると認められたものは， PPL2020終了後（2020年6月中旬投稿締切予定），「コンピュータソフトウェア」誌のPPL2020推薦論文としての投稿が可能です．推薦論文は，PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．また，特集号の締切後であっても，推薦を受けた研究もしくはそれをさらに発展させた研究をPPL推薦論文として「コンピュータソフトウェア」誌に投稿することが可能です．たとえば，PPLで発表した研究を国際会議等で発表した後，さらに発展させて推薦論文として投稿することができます．カテゴリ2では，国際会議や国際学術論文誌等で発表された，または採録決定済みの，国内では未発表の研究成果の紹介を募集します．PPLとの関連性・プログラム全体のバランス・発表された媒体をもとに，プログラム委員による議論によって採否を判断します．カテゴリ3では，PPLに関連する内容（未発表・既発表いずれでも構いません）についてのポスター発表を募集します．萌芽的なアイデアの紹介やツールのデモンストレーションなども歓迎します．PPLとの関連性・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ4では，既存研究のサーベイやツールのチュートリアルなど，PPLの聴衆にとって有益な学術知識の紹介を募集します．内容は未発表・既発表いずれでも構いません．PPLとの関連性・内容の重要性・発表者の経歴・プログラム全体のバランスをもとに，プログラム委員による議論によって採否を判断します．カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．さらに，カテゴリ1・2・4の全発表のなかから最も聴衆の支持を集めたものに発表賞，カテゴリ3の全発表のなかから最も聴衆の支持を集めたものにポスター賞を授与する予定です（いずれも一般の部・学生の部の2種類，ただし「発表賞」は既受賞者を除く）． ** 投稿・発表申込要領 ** すべてのカテゴリの投稿・発表について，以下のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2020 申込にあたってはEasyChairのアカウントが必要です．申し込み時にEasychair で入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．各カテゴリの申込要領の詳細は以下の通りです．カテゴリ1（国内外未発表論文） --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込: 著者名，所属，論文タイトル，論文概要（日本語300〜400字程度，もしくは英語200 words程度），キーワード（3つ以上）を提出してください．論文提出: 本文10〜15ページ程度（参考文献を除く）の論文（日本語もしくは英語， PDF形式．PPL2020ウェブページにて指定のスタイルファイルを利用のこと）を提出してください．最大ページ数を超える付録は投稿版に入れることができます（最終原稿においては削除いただく可能性があります）．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採録された論文の最終原稿の提出方法は，採否通知にてお知らせします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください．また，採録された論文等著作物に対して著作権の譲渡を求めません． (注) 投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ2（国外既発表論文） ------------------------- 原論文（ページ数不問，PDF形式）と論文概要（テキスト形式）を，著者名，所属，論文タイトル，キーワード（3つ以上）と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．カテゴリ3（ポスター・デモ発表） ----------------------------- 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要（200〜 300字程度），キーワード（3つ以上）を提出してください．発表形態については発表タイトル（Title欄）の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 著者名，所属，発表タイトル，キーワード（3つ以上），発表概要（3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの）提出してください． ** プログラム委員会 ** 安部達也千葉工業大学荒堀喜貴東京工業大学石崎一明日本IBM 今井敬吾岐阜大学岩崎英哉電気通信大学岩間太日本IBM 馬谷誠二神奈川大学江本健斗九州工業大学大岩寛産業技術総合研究所紙名哲生大分大学亀山幸義筑波大学川端英之広島市立大学川本裕輔産業技術総合研究所菊池健太郎東北大学木村大輔東邦大学小島健介京都大学新屋良磨秋田大学関山太朗国立情報学研究所叢悠悠東京工業大学寺内多智弘早稲田大学日高宗一郎法政大学平石拓京都大学 (プログラム共同委員長) 廣川直北陸先端科学技術大学院大学水島宏太オプト森口草介関西学院大学森畑明昌東京大学 (プログラム共同委員長) ** スポンサー（2019/12/10現在） ** プラチナスポンサー KLab株式会社ゴールドスポンサー株式会社オプトシルバースポンサー株式会社HERP 株式会社ぺあのしすてむ ** 問い合わせ先 ** ppl2020-oc ＠ googlegroups.com（ワークショップ全般について） ppl2020-pc-chair ＠ jssst-ppl.org（発表/プログラムについて）

1 0

Arnold Beckmann教授講演会
by 山形賴之 10 Dec '19

10 Dec '19

皆様、産総研の山形と申します。Swansea大学のArnold Beckmann教授の講演会を下記の通り開催いたします。Beckmann教授は限定算術、証明複雑度およびそれらと計算複雑度との関係などを研究されています。入構に事前登録が必要なため、参加ご希望の方は12月12日正午までに山形まで、お名前と所属をお知らせください。参加ご希望の方は必ず事前に連絡していただくようお願いします。講演日時：12月13日14:00-15:00 場所：産総研関西センター C-6棟2階第16会議室 https://goo.gl/maps/ZJzcgE1agWLxypsk7 ************************* Arnold Beckmann: Consistency of equational theories and the separation problem for bounded arithmetic Abstract: The separation problem for bounded arithmetic is one of the most important problems in the area due to its tight connections to the question whether computational complexity classes can be separated, the Millennium problem whether P equals NP or not being the most well-known one. Well studied candidates for separating theories of bounded arithmetic are consistency statements of formal theories, building on Kurt Goedel's famous incompleteness theorems. The most promising consistency statements are given by those of certain equational theories. In our talk, we will review the results on consistency of equational theories in the context of the separation problem for bounded arithmetic. We explain the progress that has been made over recent years to advance this problem, and state the research programme that has resulted from it. ************************* よろしくご参集ください。 — 山形賴之国立研究開発法人産業技術総合研究所主任研究員 http://staff.aist.go.jp/yoriyuki.yamagata/

2 2

RC 2020 first CFP
by Kazutaka Matsuda 10 Dec '19

10 Dec '19

皆様，東北大学の松田です．来年の7月9-10にオスロで開催される国際会議 RC 2020 の論文募集の案内をお送りいたします．何卒投稿をご検討いただければ幸いです． ======================================================================= 12th Conference on Reversible Computation (RC 2020) July 9th-10th, 2020, Oslo, Norway Abstract Submission: January 31th, 2020 Submission Deadline: February 7th, 2020 https://reversible-computation-2020.github.io/ ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== Abstract submission: January 31, 2020 Submission deadline: February 7, 2020 Notification to authors: March 20, 2020 Final version: April 10, 2020 Conference: July 9 - July 10, 2020 ===== Invited speakers ===== TO BE ANNOUNCED ===== Paper submission ===== Interested researchers are invited to submit full research papers (16 pages maximum), tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format. Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere. Submissions not adhering to the specified constraints may be rejected without review. Each paper will undergo a peer review of at least 3 anonymous reviewers. All accepted papers will be included in the conference proceedings and published by Springer as a Lecture Notes in Computer Science (LNCS) volume. Papers can be submitted electronically in pdf via the RC 2020 interface of the EasyChair system: https://easychair.org/conferences/?conf=rc2020 ===== General Chair ===== Rudolf Schlatte University of Oslo Norway ===== Program Chairs ===== Ivan Lanese University of Bologna/INRIA Italy Mariusz Rawski Warsaw University of Technology Poland ===== Program Committee ===== * Gerhard Dueck (University of New Brunswick, Canada) * Robert Glück (University of Copenhagen, Denmark) * Jarkko Kari (University of Turku, Finland) * Jean Krivine (CNRS, France) * Martin Lukac (Nazarbayev University, Kazakhstan) * Kazutaka Matsuda (Tohoku University, Japan) * Claudio Antares Mezzina (Università di Urbino, Italy) * Lukasz Mikulski (Nicolaus Copernicus University, Poland) * Torben Ægidius Mogensen (University of Copenhagen, Denmark) * Claudio Moraga (TU Dortmund University, Germany) * Iain Phillips (Imperial College London, UK) * Krzysztof Podlaski (University Of Lodz, Poland) * Markus Schordan (Lawrence Livermore National Laboratory, US) * Peter Selinger (Dalhousie University, Canada) * Mathias Soeken (Ecole Polytechnique Fédérale de Lausanne, Switzerland) * Milena Stankovic (University of Nis, Serbia) * Himanshu Thapliyal (University of Kentucky, US) * Irek Ulidowski (University of Leicester, UK) * German Vidal (Universitat Politecnica de Valencia, Spain) * Robert Wille (Johannes Kepler University Linz, Austria) * Tetsuo Yokoyama (Nanzan University, Japan) ===== Contacts ===== rc2020(a)easychair.org https://reversible-computation-2020.github.io/

1 0

ラムダ計算と論理の早春セミナー2020
by Naosuke MATSUDA 10 Dec '19

10 Dec '19

みなさま神奈川大学の松田と申します．今年度も「ラムダ計算と論理の早春セミナー」を，下記要領で開催することになりました．場所：草津セミナーハウス日程：2020年3月7日(土)-11日(水) 詳細: https://sites.google.com/view/lls2020/home つきまして，ラムダ計算・論理およびその周辺の話題を広く募集しています．本セミナーでは，講演枠や講演時間を事前に固定せず，当日の参加者に状況に合わせて柔軟に計画をしてもらうようになっています．議論し成果を挙げる場・学生の簡単な発表の場など，さまざまな用途で利用していただければ幸いです．なお，今年度で草津セミナーハウスが閉鎖とのことで，草津セミナーハウスでの開催は今回が最後になります．多くの皆様のご参加をお待ちしております． -- 神奈川大学情報科学科松田直祐

1 0

リマインド　2020年度奨励研究生の選考について
by Teruyuki YORIOKA 06 Dec '19

06 Dec '19

みなさま静岡大学の依岡です．「２０２０年度奨励研究生」の募集期限が今月15日と近づいてまいりましたのであらためましてご案内申し上げます。 http://mathsoc.jp/publicity/news20191001/2020shourei.html 日本数学会事務局から，現時点で申請件数が極めて少ない状況であるという連絡を受けております．申請資格を持つ方々，申請資格を持つ指導学生がおられます先生方，ぜひ申請をご検討ください．よろしくお願いします．

1 0

基礎論セミナー
by arai toshiyasu 02 Dec '19

02 Dec '19

みなさま第3回の基礎論セミナーのお知らせです。どなたでも聴講できますのでご興味のおありの方はどうぞいらして下さい。 web page: https://www.ms.u-tokyo.ac.jp/seminar/logic/ 新井敏康第3回基礎論セミナー日時：2019年12月20日（金）13:00-14:30 場所：東京大学大学院数理科学研究科 156号室講演者：池上大祐 title: On supercompactness of \omega_1 abstract:: In ZFC, all the large cardinals are much bigger than \omega_1, the least uncountable cardinal, while without assuming the Axiom of Choice, \omega_1 could have some large cardinal properties. Jech and Takeuti independently proved that if the axiom system ZFC + There is a measurable cardinal is consistent, then so is ZF + \omega_1 is a measurable cardinal. Takeuti also proved that one can replace "measurable cardinal" above with "supercompact cardinal" as well as some other large cardinals. Woodin proved that one can reduce the assumption, i.e., the consistency of ZFC + a supercompact cardinal, to that of ZFC + There are proper class many Woodin cardinals which are limits of Woodin cardinals, to obtain the consistency of ZF + \omega_1 is a supercompact cardinal. Furthermore, the model he constructed also satisfies the Axiom of Determinacy (AD). In this talk, after giving some background on the connections between large cardinals and determinacy, we discuss some consequences of the axiom system ZF + \omega_1 is a supercompact cardinal. This is joint work with Nam Trang.

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml December 2019