Accepted Papers
Call for Full Research Papers
Research Papers describe fully developed work and complete results.
Maximum length is 10 pages (ACM Conference Format - including references).
Topics of interest include, but are not limited to:
- Formal verification techniques for automated analysis of software
- Formal analysis for modeling languages, such as UML/state charts
- Formal specification languages, temporal logic, design-by-contract
- Model checking
- Automated theorem proving, including SAT and SMT
- Verifying compilers
- Abstraction and symbolic execution techniques
- Static analysis and abstract interpretation
- Combination of verification techniques
- Modular and compositional verification techniques
- Verification of timed and probabilistic systems
- Automated testing using advanced analysis techniques
- Combination of static and dynamic analyses
- Derivation of specifications, test cases, or other useful material via formal analysis
- Case studies of interesting systems or with interesting results
- Engineering and implementation of software verification and analysis tools
- Benchmark and comparative studies for formal verification and analysis tools
- Formal methods education and training
- Insightful surveys or historical accounts on topics of relevance to the symposium
The contributions to SPIN 2017 will be published as ACM Proceedings, and should be submitted in the ACM Conference Format: https://www.acm.org/publications/proceedings-template (use the sigconf template)
Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this symposium. Authors are required to adhere to the ACM Policy and Procedures on Plagiarism and the ACM Policy on Prior Publication and Simultaneous Submissions.
A Best Research Paper award will be given.
A selection of best Research Papers will be invited to a special issue of the International Journal on Software Tools for Technology Transfer (STTT).
- View Call for All Papers
- View Call for Short Papers
Thu 13 JulDisplayed time zone: Tijuana, Baja California change
09:30 - 10:00 | Session 2: Symbolic VerificationSPIN Full Paper at ESB 1001 Chair(s): Klaus Havelund NASA/Caltech Jet Propulsion Laboratory | ||
09:30 30mTalk | Distributed Binary Decision Diagrams for Symbolic Reachability (Wytse Oortwijn, Tom van Dijk and Jaco van de Pol) SPIN Full Paper | ||
14:30 - 15:00 | |||
14:30 30mTalk | Increasing Usability of Spin-based C Code Verification Using a Harness Definition Language (Daniel Ratiu and Andreas Ulrich) SPIN Full Paper | ||
15:30 - 16:30 | |||
15:30 30mTalk | Runtime Enforcement Using Büchi Games (Matthieu Renard, Antoine Rollet and Ylies Falcone) SPIN Full Paper | ||
16:00 30mTalk | Runtime Enforcement of Reactive Systems Using Synchronous Enforcers (Srinivas Pinisetty, Partha Roop, Steven Smyth, Stavros Tripakis and Reinhard von Hanxleden) SPIN Full Paper | ||
Fri 14 JulDisplayed time zone: Tijuana, Baja California change
08:30 - 10:00 | Session 8: Program Synthesis SPIN Full Paper at ESB 1001 Chair(s): Stefan Leue University of Konstanz | ||
08:30 30mTalk | Practical Controller Synthesis for MTL_{0,∞} (Guangyuan Li, Peter Gjøl Jensen, Kim Guldstrand Larsen, Axel Legay and Danny Bøgsted Poulsen) SPIN Full Paper | ||
09:00 30mTalk | An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space (John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan and Dominik Wojtczak) SPIN Full Paper | ||
09:30 30mTalk | A Hot Method for Synthesising Cool Controllers (Idress Husien, Nicolas Berthier and Sven Schewe) SPIN Full Paper | ||
10:30 - 12:00 | |||
10:30 30mTalk | Backward Coverability with Pruning for Lossy Channel Systems (Thomas Geffroy, Jérôme Leroux and Grégoire Sutre) SPIN Full Paper | ||
11:00 30mTalk | Model Learning and Model Checking of SSH Implementations (Paul Fiterau-Brostean, Frits Vaandrager, Erik Poll, Joeri de Ruiter, Toon Lenaerts and Patrick Verleg) SPIN Full Paper | ||
11:30 30mTalk | CARET Model Checking for Malware Detection (Huu Vu Nguyen and Tayssir Touili) SPIN Full Paper | ||
14:30 - 15:00 | |||
14:30 30mTalk | EdSketch: Execution-Driven Sketching for Java (Jinru Hua and Sarfraz Khurshid) SPIN Full Paper | ||
15:30 - 16:30 | |||
15:30 30mTalk | Stateless Model Checking of the Linux Kernel's Hierarchical Read-Copy-Update (Tree RCU) (Michalis Kokologiannakis and Konstantinos Sagonas) SPIN Full Paper | ||
16:00 30mTalk | Optimizing Parallel Korat Using Invalid Ranges (Nima Dini, Cagdas Yelen and Sarfraz Khurshid) SPIN Full Paper | ||