Research PapersAPLAS 2019
We solicit contributions in the forms of regular research papers, and tool papers. Among others, solicited topics include:
- 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
- Applications of SAT/SMT to programming and implementation
Papers should be submitted electronically via the submission web page using EasyChair (see Submission Information). The acceptable format is 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.
Mon 2 Dec Times are displayed in time zone: Beijing, Chongqing, Hong Kong, Urumqi change
08:50 - 10:00: Keynote 1Keynote Talks at Bali Room Chair(s): Anthony Widjaja LinTechnische Universität Kaiserslautern | |||
08:50 - 10:00 Talk | Proving that Programs are Differentially Private Keynote Talks |
10:00 - 10:30: Coffee BreakCatering | |||
10:30 - 11:00 Talk | Manifest Contracts with Intersection Types Research Papers Pre-print | ||
11:00 - 11:30 Talk | A Dependently Typed Multi-Stage Calculus Research Papers Pre-print | ||
11:30 - 12:00 Talk | Existential Types for Relaxed Noninterference Research Papers |
13:30 - 15:00: Program AnalysisResearch Papers at Bali Room Chair(s): Annabelle McIverMacquarie University | |||
13:30 - 14:00 Talk | Dissecting Widening: Separating Termination from Information Research Papers Graeme Gange, Jorge A. NavasSRI International, Peter Schachte, Harald Sondergaard, Peter J. StuckeyMonash University | ||
14:00 - 14:30 Talk | A Type-Based HFL Model Checking Algorithm Research Papers Youkichi HosoiThe University of Tokyo , Naoki KobayashiUniversity of Tokyo, Japan, Takeshi TsukadaUniversity of Tokyo, Japan | ||
14:30 - 15:00 Talk | Reducing Static Analysis Alarms based on Non-impacting Control Dependencies Research Papers Tukaram MuskeTata Consultancy Services Ltd, Rohith TalluriTata Consultancy Services Ltd, Alexander SerebrenikEindhoven University of Technology |
15:00 - 15:30: Coffee BreakCatering | |||
15:30 - 17:00: SemanticsResearch Papers at Bali Room Chair(s): Atsushi IgarashiKyoto University, Japan | |||
15:30 - 16:00 Talk | Factorization and Normalization, Essentially Research Papers Beniamino AccattoliInria & Ecole Polytechnique, Claudia FaggianIRIF, Giulio GuerrieriUniversity of Bath | ||
16:00 - 16:30 Talk | Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion Research Papers | ||
16:30 - 17:00 Talk | Recursion Schemes in Coq Research Papers |
18:00 - 20:00: Poster sessionPosters at Puri Bali Chair(s): Andreea CosteaSchool of Computing, National University Of Singapore | |||
Tue 3 Dec Times are displayed in time zone: Beijing, Chongqing, Hong Kong, Urumqi change
10:00 - 10:30: Coffee BreakCatering | |||
10:30 - 12:00: Language Design and ImplementationResearch Papers at Bali Room Chair(s): Sandrine BlazyUniv Rennes- IRISA | |||
10:30 - 11:00 Talk | Lightweight Functional Logic Meta-Programming Research Papers Nada AminHarvard University, William E. ByrdUniversity of Alabama at Birmingham, USA, Tiark RompfPurdue University | ||
11:00 - 11:30 Talk | Mimalloc: Free List Sharding in Action Research Papers | ||
11:30 - 12:00 Talk | LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL Research Papers Yutaka NagashimaData61, Australia |
13:30 - 14:00 Talk | Android Multitasking Mechanism: Formal Semantics and Static Analysis of Apps Research Papers Taolue ChenBirkbeck, University of London, Jilong HeInstitute of Software, Chinese Academy of Sciences, Yu-Ping WangTsinghua University, China, Zhilin WuState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Jun YanInstitute of Software, Chinese Academy of Sciences | ||
14:00 - 14:30 Talk | Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects Research Papers Thomas DickersonBrown University, Paul GazzilloUniversity of Central Florida, Maurice HerlihyBrown University, USA, Eric KoskinenStevens Institute of Technology | ||
14:30 - 15:00 Talk | Transactional Forest: A DSL for Managing Concurrent Filestores Research Papers Jonathan DiLorenzoCornell University, Kathryn ManciniCornell University, Kathleen FisherTufts University, USA, Nate FosterCornell University |
15:00 - 15:30: Coffee BreakCatering | |||
15:30 - 17:15: VerificationResearch Papers at Bali Room Chair(s): Zhilin WuState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences | |||
15:30 - 15:45 Talk | J-ReCoVer: Java Reducer Commutativity Verifier [Tool Paper] Research Papers Yu-Fang ChenAcademia Sinica, Chang-Yi ChiangGraduate Institute of Information Management, National Taipei University, Taiwan, Lukáš HolíkBrno University of Technology, Wei-Tsung KaoInstitute of Information Science, Academia Sinica, Taiwan, Hsin-Hung LinInstitute of Information Science, Academia Sinica, Taiwan, Yean-Fu WenGraduate Institute of Information Management, National Taipei University, Taiwan, Tomáš VojnarBrno University of Technology, Wei-Cheng WuInstitute of Information Science, Academia Sinica, Taiwan | ||
15:45 - 16:15 Talk | Uniform Random Process Model Revisited Research Papers Wenbo Zhang, Huan LongShanghai Jiao Tong University, Xian XuEast China University of Science and Technology | ||
16:15 - 16:45 Talk | Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions Research Papers Makoto TatsutaNational Institute of Informatics, Koji NakazawaGraduate School of Informatics, Nagoya University, Daisuke KimuraToho University | ||
16:45 - 17:15 Talk | Compositional Verification of Heap-Manipulating Programs through Property-Guided Learning Research Papers Long H. PhamSingapore University of Technology and Design, Jun SunSingapore Management University, Singapore, Quang Loc LeTeesside University |
Wed 4 Dec Times are displayed in time zone: Beijing, Chongqing, Hong Kong, Urumqi change
10:00 - 10:30: Coffee BreakCatering | |||
10:30 - 12:00: Logic and AutomataResearch Papers at Bali Room Chair(s): Peter ThiemannUniversity of Freiburg, Germany | |||
10:30 - 11:00 Talk | Pumping, With or Without Choice Research Papers Aquinas HoborNational University of Singapore, Singapore, Elaine LiRuntime Verification, Inc., Frank StephanNational University of Singapore | ||
11:00 - 11:30 Talk | Simulations in Rank-Based Buchi Automata Complementation Research Papers Yu-Fang ChenAcademia Sinica, Vojtěch HavlenaBrno University of Technology, Ondřej LengálBrno University of Technology | ||
11:30 - 12:00 Talk | Succinct Determinisation of Counting Automata via Sphere Construction Research Papers Lukáš HolíkBrno University of Technology, Tomáš VojnarBrno University of Technology, Ondřej LengálBrno University of Technology , Lenka TuroňováBrno University of Technology, Margus VeanesMicrosoft Research, Olli Saarikivi |
Call for Tool Papers
We solicit submissions in the form of tool papers describing a demonstration of a tool or a system that support theory, program construction, reasoning, or program execution in the scope of APLAS. The main purpose of a tool paper is to display a completed, robust and well-documented tool-highlighting the overall functionality of the tool, the interfaces of the tool, interesting examples and applications of the tool, an assessment of the tool’s strengths and weaknesses, and a summary of documentation/support available with the tool. Authors of tool demonstration proposals are expected to present a live demonstration of the tool at the conference. It is highly desirable that the tools are available on the web. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. They may include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo.
Call for Regular Research Papers
We solicit submissions in the form of regular research papers describing original scientific research results, including system development and case studies. Among others, solicited topics include:
- 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
- Applications of SAT/SMT to programming and implementation
Regular research papers should not exceed 18 pages in the Springer LNCS format, including bibliography and figures. This category encompasses both theoretical and implementation (also known as system descriptions) papers. In either case, submissions 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. System descriptions papers should contain a link to a working system and will be judged on originality, usefulness, and design. 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.
Accepted Papers
Submission Information
Papers should be submitted electronically via the submission web page using EasyChair. The acceptable format is 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.
Review Process
APLAS 2019 will use a lightweight double-blind reviewing process. Following this process means that reviewers will not see the authors’ names or affiliations as they initially review a paper. The authors’ names will then be revealed to the reviewers only once their reviews have been submitted.
To facilitate this process, submitted papers must adhere to the following:
-
Author names and institutions must be omitted and
-
References to the authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”).
The purpose of this process is to help the reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission, makes the job of reviewing the paper more difficult, or interferes with the process of disseminating new ideas. For example, important background references should not be omitted or anonymized, even if they are written by the same authors and share common ideas, techniques, or infrastructure. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.
Tool papers
To facilitate the reviewing process, tool papers should clearly be so indicated in the EasyChair submission. We strongly recommend that the authors add the suffix ‘[Tool Paper]’ to the title of the submission in the EasyChair, but not necessarily in the paper itself.
Author Response Period
During the author response period, authors will be able to read reviews and respond to them as appropriate.
Research Integrity
The Program Committee reserves the right, up until the time of publication, to reverse a decision of paper acceptance. Reversal is possible if fatal flaws are discovered in the paper, or research integrity is found to have been seriously breached.