7th International Workshop on
Numerical and Symbolic Abstract Domains (NSAD 2017)
New York City, NY, USA - August 29, 2017
Scope
Abstract domains are a key notion in Abstract Interpretation theory and practice. They embed the semantic choices, data-structures and algorithmic aspects, and implementation decisions. The Abstract Interpretation framework provides constructive and systematic formal methods to design, compose, compare, study, prove, and apply abstract domains. Many abstract domains have been designed so far: numerical domains (intervals, congruences, polyhedra, polynomials, etc.), symbolic domains (shape domains, trees, etc.), but also domain operators (products, powersets, completions, etc.), and have been applied to several kinds of static analyses (safety, termination, probability, etc.).
The 7th International Workshop on Numerical and Symbolic Abstract Domains is intended to discuss on-going works and ideas in the field.
The program of NSAD 2017 will consist mainly of presentations of refereed papers. Contributions are welcomed on all aspects of abstract domains, including, but not limited to:
- numeric abstract domains
- symbolic abstract domains
- extrapolations and accelerations
- compositions and operations on abstract domains
- data structures and algorithms for abstract domains
- novel applications of abstract domains implementations
- practical experiments and comparisons
- implementations
Venue
NSAD 2017 is co-located with SAS 2017 and takes place in the Forbes Building of the New York University.Publication
NSAD 2017 proceedings will be published electronically in a volume of the Electronic Notes in Theoretical Computer Science series by ScienceDirect©, Elsevier.
Organization
Program Chair
- Francesca Scozzari (Università di Chieti-Pescara, Italy)
Program Committee
- Gianluca Amato (Università di Chieti-Pescara, Italy)
- Roberto Bagnara (University of Parma and BUGSENG, Italy)
- Arlen Cox (IDA Center for Computing Sciences, USA)
- Laure Gonnord (University of Lyon, France)
- Denis Gopan (GrammaTech, USA)
- Andy King (University of Kent, UK)
- Jorge A. Navas (SRI International, USA)
- Thomas Reps (University of Wisconsin-Madison and GrammaTech, USA)
- Axel Simon (Google, USA)
Local Chair
- Patrick Cousot (New York University, USA)
Invited talk (joint with TAPAS 2017): Sriram Sankaranarayanan
Static Analysis of Programs with Probabilities
Reasoning about the effect of uncertainties on programs is a fundamental challenge in static analysis. A large volume of research has focused on numerical and symbolic abstract domains for reasoning about nondeterministic choices in programs. In this talk, we will explore recent results on proving properties of programs with probabilities. Such programs arise in a wide variety of applications ranging from data mining to cyber-physical systems. We examine how existing abstract domains can reason about such programs, and present recent work that considers the combination of abstract domain reasoning with results from martingale theory and concentration of measure inequalities. We conclude with an examination of open challenges and future applications in this area.
Gianluca Amato, Marco Rubino
Experimental Evaluation of Numerical Domains for Inferring Ranges
Among the numerical abstract domains for detecting linear relationships between program variables, the polyhedra domain is, from a purely theoretical point of view, the most precise one. Other domains, such as intervals, octagons and parallelotopes, are less expressive but generally more efficient. We focus our attention on interval constraints and, using a suite of benchmarks, we experimentally show that, in practice, polyhedra may often compute results less precise than the other domains, due to the use of the widening operator.
Invited talk: Enea Zaffanella
On the Efficiency of Convex Polyhedra
The domain of convex polyhedra plays a special role in the collection of numerical domains considered for program analysis and verification. As far as precision is concerned, it would be the most natural choice in many contexts but, due to its worst case exponential complexity, it is sometimes considered an unaffordable option. This has lead to a systematic quest for simpler domains that are capable of reasonable precision using less computational resources. There are anyway cases where the use of the domain of convex polyhedra turns out to be feasible, also due to recent progresses in their implementation. After reviewing a few known approaches to decrease the amount of resources needed when computing on this domain, we will introduce a couple of novel techniques that can be used to further improve the efficiency of the domain, without incurring precision losses.
Jacob Lidman, Josef Svenningsson
Fuzzy set abstraction
Program analysis plays a key part in improving modern software. Static (sound) analyses produce globally correct, but often pessimistic results while dynamic (complete) analyses yield highly precise results but with limited coverage. We present the Fuzzy set abstraction which generalizes previous work based on 3-valued logic. Our abstraction allows for hybrid analysis where static results are refined dynamically through the use of fuzzy control systems.
Registration
Since NSAD 2017 will be co-located with SAS 2017, please refer to the SAS 2017 registration website.
Submission
Submissions are invited in two categories:
- 1-page abstract (for presentation of ongoing work or already published papers) NEW!
- regular paper (not exceeding 12 pages including references)
Submission of 1-page abstracts
Authors of accepted 1-page abstracts will have the opportunity for short oral presentations at the workshop, but they will not be included in the proceedings.
- 1-page abstract submission: July 20, 2017
- Notification: August 01, 2017
Submission website: https://easychair.org/conferences/?conf=nsad2017
Submission of regular papers
Submitted papers should not exceed 12 pages including bibliography, and follow the ENTCS guidelines. Submitted papers may include, in addition, an appendix containing technical details, which reviewers may read or not, at their discretion.
Papers must be written and presented in English, and describe original work that does not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings.
All submitted papers will be peer-reviewed by the program committee.
Authors of regular papers have the option to be part of the proceedings or not. By default, all accepted regular papers will be included in the proceedings.
- Regular paper submission: July 20, 2017 EXTENDED!
- Notification: August 01, 2017
Submission website: https://easychair.org/conferences/?conf=nsad2017
Co-Located Events
- 24th Static Analysis Symposium (SAS 2017)
Chair: Francesco Ranzato (University of Padova, Italy) - 8th Workshop on Static Analysis and Systems Biology (SASB 2017)
Chair: Jean Yang (Carnegie Mellon University, USA) - 8th Workshop on Tools for Automatic Program Analysis (TAPAS 2017)
Chair: Thomas Wies (New York University, USA)
Previous workshops
1-page abstract submission: July 20, 2017 (AoE) NEW!
Regular paper submission: July 20, 2017 (AoE) EXTENDED!
Notification: August 01, 2017
Final version: August 07, 2017
Workshop day: August 29, 2017
