The 6th International Workshop on Symbolic-Numeric Methods for Reasoning about CPS and IoT (SNR) will take place in Vienna, Austria as a satellite event of QONFEST'20.
- Symbolic methods that operate on exact and discrete representations of systems, the set of reachable states, the distribution of model parameters or the possible gains for controller parameters.
- Numeric methods that operate on various forms of numerical approximations and continuous transformations of the systems, as developed in the area of continuous dynamical systems and control theory.
- Verification, parameter identification and control synthesis for hybrid systems
- Probabilistic inference and reachability for stochastic hybrid systems
- Symbolic and numerical integration and decision techniques
- Emerging applications to safe autonomous systems in uncertain environments
- Resiliency and dependability in CPS and IoT
- Verification of models used in machine learning and autonomous CPS
Learning algorithms are at the core of many engineering applications including robotics and autonomous vehicles. We invite research papers on verification of models used in machine learning and autonomous CPS. In particular, recent advances in autonomous cars require addressing challenging questions around their safety and reliability.
- Symbolic and numerical techniques for verification and synthesis of stochastic models
Autonomous systems operate in uncertain environments. Thus, it is essential to reason about the effect of uncertainty. We invite research papers on symbolic and numerical techniques for formal synthesis of stochastic systems.
- Invited Industrial Talk: Hermann Schichl, DAGOPT, University of Vienna
- Invited Tutorial: Alberto Griggio, Fondazione Bruno Kessler:
Solving non-linear arithmetic with SAT modulo theories and abstraction This tutorial will provide an introduction to SAT and SAT modulo theories solving techniques and their applications to deciding the satisfiability of formulae involving non-linear arithmetic. We will discuss how we can leverage the power of the symbolic search engines combined with abstraction and refinement to develop a simple, yet effective procedure for non-linear polynomial constraints over the reals. We will then show how the procedure naturally extends to handle also integer constraints and some common transcendental functions, and how it can be easily integrated into state-of-the-art symbolic verification engines for infinite-state transition systems.
The workshop solicits
- long research papers (not exceeding 15 pages excluding references),
- short research papers (not exceeding 6 pages excluding references) and
- work-in-progress papers (not exceeding 6 pages excluding references).
Research papers must present original unpublished work which is not submitted elsewhere. In order to foster the exchange of ideas, we also encourage work-in-progress papers, which present recent or on-going work.
The papers should be written in English and formatted according to the EPTCS guidelines.
Papers can be submitted using the EasyChair system.
All submissions will undergo a peer-reviewing process.
Accepted research papers will be presented at the workshop and published in the Electronic Proceedings in Theoretical Computer Science (EPTCS).
Accepted work-in-progress papers will be presented at the workshop but will not be included in the proceedings.
|Camera-ready version||August 20, 2020|
|Workshop||August 31, 2020|
Thao Dang (co-chair, Verimag/CNRS, France)
Stefan Ratschan (co-chair, Academy of Sciences of the Czech Republic)
Naijun Zhan (Institute of Software, Chinese Academy of Sciences)
Sergiy Bogomolov (Newcastle University, United Kingdom)
Taylor T. Johnson (Vanderbilt University, U.S.A.)
Martin Fränzle (Carl von Ossietzky Universität Oldenburg, Germany)
Indranil Saha (Indian Institute of Technology Kanpur)
Milan Češka (Brno University of Technology, Czech Republic)
Goran Frehse (ENSTA Paris, France)
Sofie Haesaert (Eindhoven University of Technology, The Netherlands)
Jens Oehlerking (Robert Bosch GmbH, Germany)
Erika Ábrahám (RWTH Aachen University, Germany)
- Erika Ábrahám (RWTH Aachen, Germany)
- Sergiy Bogomolov (Australian National University)
- Martin Fränzle (University of Oldenburg, Germany)
- Taylor T. Johnson (Vanderbilt University, USA)
- Ashish Tiwari (SRI International, USA)
- Andreas Rauh and Julia Kersten: Verification and Reachability Analysis of Fractional-Order Differential Equations Using Interval Analysis
- Negin Musavi, Dawei Sun, Sayan Mitra, Geir Dullerud and Sanjay Shakkottai: Optimistic Optimization for Statistical Model Checking with Regret Bounds
- Auguste Bourgois and Luc Jaulin: Interval centered form for proving stability of nonlinear discrete-time system
- Tommaso Dreossi, Giorgio Ballardin, Parth Gupta, Jan Bakus, Yu-Hsiang Lin and Vamsi Salaka: Analysis of E-commerce Ranking Signals via Signal Temporal Logic
- Luc Jaulin Characterizing Sliding Surfaces of Cyber-Physical Systems
- Sriram Sankaranarayanan: Reachability Analysis using Message Passing in Treewidth Bounded Systems
- Kostiantyn Potomkin
- David Monniaux
- Hoang-Dung Tran
4rd Int. Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR’18), affiliated with ETAPS'18.
3rd Int. Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR’17), affiliated with ETAPS'17.
2nd Int. Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR’16), affiliated with CPSWeek’16
1st Int. Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR’15), affiliated with CAV’15