11th Workshop on Tools for Automatic Program Analysis
In recent years, a wide range of static analysis tools have emerged, some of which are currently in industrial use or are well beyond the advanced prototype level. Many impressive practical results have been obtained, which allow complex properties to be proven or checked in a fully or semi-automatic way, even in the context of complex software developments. In parallel, the techniques to design and implement static analysis tools have improved significantly, and much effort is being put into engineering the tools. This workshop is intended to promote discussions and exchange experience between specialists in all areas of program analysis design and implementation, formal methods and static analysis tool users.
Previous workshops have been held in Perpignan, France (2010), Venice, Italy (2011), Deauville, France (2012), Seattle, WA, USA (2013), Munich, Germany (2014), Saint-Malo, France (2015), Edinburgh, UK (2016), New York, NY, USA (2017), Freiburg, Germany (2018), and Porto, Portugal (2019).
TAPAS 2020 will be co-located with OOPSLA 2020 and SAS 2020.Thu 19 Nov Times are displayed in time zone: Central Time (US & Canada) change
00:20 - 01:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
02:20 - 03:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
03:00 - 03:20 Paper | Program Slicing with Exception Handling TAPAS | ||
03:20 - 03:40 Paper | MetaCG: Annotated call-graphs to facilitate whole-program analysis TAPAS Jan-Patrick LehrScientific Computing, TU Darmstadt, Alexander HückInstitute for Scientific Computing, TU Darmstadt, Yannic FischlerTU Darmstadt, Christian BischofScientific Computing, TU Darmstadt | ||
03:40 - 04:00 Paper | Data Dependence for Object-Oriented Programs TAPAS | ||
04:00 - 04:20 Paper | Type checking beyond type checkers, via Slice & Run TAPAS Pre-print |
04:20 - 05:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
05:00 - 06:00 Keynote | Toward More Scalable Symbolic Execution via Code Chopping TAPAS Cristian CadarImperial College London, UK Media Attached | ||
06:00 - 07:00 Keynote | Enterprise-scale static analysis: A Pinpoint experience TAPAS Charles ZhangThe Hong Kong University of Science and Technology Media Attached |
06:20 - 07:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
07:00 - 08:20 Keynote | Why Digital Agriculture is Fertile Ground for Software Systems Researchsupported by IBM Research Keynotes Vikram S. AdveUniversity of Illinois at Urbana-Champaign Link to publication |
08:20 - 09:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
09:00 - 09:20 Short-paper | API Analytics for Curating Static Analysis Rules TAPAS | ||
09:20 - 09:40 Paper | Online Verification of Commutativity TAPAS Aditi KabraCarnegie Mellon University, Dietrich GeislerCornell University, Adrian SampsonCornell University Pre-print | ||
09:40 - 10:00 Short-paper | Towards Checkpoint Placement for Dynamic Memory Allocation in Intermittent Computing TAPAS Nicholas Shoemaker, Ruzica PiskacYale University, USA, Mark SantolucitoBarnard College, Columbia University, USA |
10:20 - 11:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
11:00 - 12:20 Poster | Student Research Competition Student Research Competition |
11:00 - 12:00 Keynote | Moving Fast with High Reliability using Pluggable Types TAPAS Manu SridharanUniversity of California at Riverside Media Attached | ||
12:00 - 12:20 Other | Closing TAPAS |
12:20 - 13:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
14:20 - 15:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
16:20 - 17:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
18:20 - 19:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
19:00 - 20:20 Keynote | Why Digital Agriculture is Fertile Ground for Software Systems Researchsupported by IBM Research Keynotes Vikram S. AdveUniversity of Illinois at Urbana-Champaign Link to publication |
20:20 - 21:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
22:20 - 23:00 Social Event | Meet The Speakers Meet The Speakers (MTS) |
Call for Papers
Objectives
In recent years, a wide range of static analysis tools have emerged, some of which are currently in industrial use or are well beyond the advanced prototype level. Many impressive practical results have been obtained, which allow complex properties to be proven or checked in a fully or semi-automatic way, even in the context of complex software developments. In parallel, the techniques to design and implement static analysis tools have improved significantly, and much effort is being put into engineering the tools. This workshop is intended to promote discussions and exchange experience between specialists in all areas of program analysis design and implementation, formal methods and static analysis tool users.
Scope
The technical program of TAPAS 2020 will consist of invited talks, together with presentations based on submitted papers. Submissions can cover any aspect of program analysis tools including, but not limited to the following:
-
design and implementation of static analysis tools (including practical techniques used for obtaining precision and performance)
-
components of static analysis tools (front-ends, abstract domains, etc.)
-
integration of static analyzers (in proof assistants, test generation tools, IDEs, etc.)
-
reusable software infrastructure (analysis algorithms and frameworks)
-
experience reports on the use of static analyzers (both research prototypes and industrial tools)
The workshop also welcomes work in progress, overviews of more extensive work, programmatic or position papers and tool presentations.
Submission Guidelines
We invite high-quality papers in the following three categories:
-
Regular papers (6-10 pages)
-
Short papers (4-6 pages)
-
Extended abstract (up to 2 pages)
Please use the SIGPLAN style (sigplan
with a two-column format) for all papers (http://www.sigplan.org/Resources/Author/) and submit via EasyChair (https://easychair.org/conferences/?conf=tapas2020).
Publication
All papers will be considered for publication in the ACM Digital Library, except if the authors prefer not to be included.