posted by organizer: erikaabraham || 471 views || tracked by 1 users: [display]

SNR 2017 : 3nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis

FacebookTwitterLinkedInGoogle

Link: http://snr2017.pages.ist.ac.at
 
When Apr 22, 2017 - Apr 22, 2017
Where Uppsala, Sweden
Abstract Registration Due Jan 27, 2017
Submission Deadline Feb 3, 2017
Notification Due Mar 10, 2017
Final Version Due Mar 24, 2017
 

Call For Papers

Scope
=====

Hybrid systems are complex dynamical systems that combine discrete and continuous components. Reachability questions, regarding whether a system can run into a certain subset of its state space, stand at the core of verification and synthesis problems for hybrid systems.

There are several successful methods for hybrid systems reachability analysis. Some methods explicitly construct flow-pipes that over-approximate the set of reachable states over time, where efficient computation of such over-approximations requires symbolic representations such as support functions. Other methods based on satisfiability checking technologies, symbolically encode reachability properties as logical formulas, while solving such formulas requires numerically-driven decision procedures. Last but not least, also automated deduction and the usage of theorem provers led to efficient analysis approaches. The goal of this workshop is to bring together researchers working with different reachability analysis techniques and to seek for synergies between the different approaches.

The SNR workshop solicits papers broadly in the area of analysis and synthesis of continuous and hybrid systems. The scope of the workshop includes, but is not restricted to, the following topics with application to continuous and hybrid systems:

- Reachability analysis
- Flow-pipe construction; symbolic state set representations
- Logical frameworks for reasoning
- Bounded model checking
- Automated deduction
- Invariant generation
- Symbolic execution
- Trajectory generation; counterexample computation
- Abstraction techniques
- Reliable integration
- Simulation
- Reachability analysis for planning and synthesis
- Domain-specific approaches in biology, robotics, etc.
- Stochastic/probabilistic hybrid systems

Submission Information
======================

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 (http://style.eptcs.org/).

Papers can be submitted using the EasyChair system:
https://easychair.org/conferences/?conf=snr2017
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, http://www.eptcs.org/).

Accepted work-in-progress papers will be presented at the workshop but will not be included in the proceedings.

Related Resources

NSAD 2017   Numerical and Symbolic Abstract Domains
IMDA 2018   INTELLIGENT METHODS FOR DATA ANALYSIS AND COMPUTER AIDED SOFTWARE ENGINEERING
PLS 2017   9th International Conference on PLS and Related Methods
Cluster-BigData 2018   Call for Springer book Chapters: Clustering methods for Big Data Analytics: techniques, toolboxes and applications, Springer (USA)
RP 2017   Reachability Problems
ISSTA 2018   International Symposium on Software Testing and Analysis
IEEE - ICBDA 2018   2018 IEEE 3rd International Conference on Big Data Analysis (ICBDA 2018)--IEEE Xplore and Ei Compendex
SYNASC 2017   19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
FM 2018   22nd International Symposium on Formal Methods
LICS 2018   Logic in Computer Science