Dependable Software Engineering. Theories, Tools, and Applications

1. Front Matter

   Pages I-XVIII

   PDF

2. Invited Talk

   1. Front Matter

      Pages 1-1

      PDF

   2. General Lessons from a Rely/Guarantee Development

      • Cliff B. Jones, Andrius Velykis, Nisansala Yatapanage

      Pages 3-22

3. Probabilistic and Statistical Analysis

   1. Front Matter

      Pages 23-23

      PDF

   2. Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs

      • Vahid Hashemi, Andrea Turrini, Ernst Moritz Hahn, Holger Hermanns, Khaled Elbassioni

      Pages 25-41

   3. Better Automated Importance Splitting for Transient Rare Events

      • Carlos E. Budde, Pedro R. D’Argenio, Arnd Hartmanns

      Pages 42-58

   4. On the Criticality of Probabilistic Worst-Case Execution Time Models

      • Luca Santinelli, Zhishan Guo

      Pages 59-74

4. Timed and Hybrid Systems

   1. Front Matter

      Pages 75-75

      PDF

   2. Nested Timed Automata with Invariants

      • Yuwei Wang, Guoqiang Li, Shoji Yuen

      Pages 77-93

   3. Multi-core Cyclic Executives for Safety-Critical Systems

      • Calvin Deutschbein, Tom Fleming, Alan Burns, Sanjoy Baruah

      Pages 94-109

   4. Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus

      • Dimitar P. Guelev, Shuling Wang, Naijun Zhan

      Pages 110-127

5. Program Analysis

   1. Front Matter

      Pages 129-129

      PDF

   2. Termination of Semi-algebraic Loop Programs

      • Yi Li

      Pages 131-146

   3. Computing Exact Loop Bounds for Bounded Program Verification

      • Tianhai Liu, Shmuel Tyszberowicz, Bernhard Beckert, Mana Taghdiri

      Pages 147-163

   4. AndroidLeaker: A Hybrid Checker for Collusive Leak in Android Applications

      • Zipeng Zhang, Xinyu Feng

      Pages 164-180

6. Modeling and Verification

   1. Front Matter

      Pages 181-181

      PDF

   2. Remark on Some \(\pi \) Variants

      • Jianxin Xue, Huan Long, Yuxi Fu

      Pages 183-199

   3. Reasoning About Periodicity on Infinite Words

      • Wanwei Liu, Fu Song, Ge Zhou

      Pages 200-215

   4. On Equivalence Checking of Nondeterministic Finite Automata

      • Chen Fu, Yuxin Deng, David N. Jansen, Lijun Zhang

      Pages 216-231

   5. A New Decomposition Method for Attractor Detection in Large Synchronous Boolean Networks

      • Andrzej Mizera, Jun Pang, Hongyang Qu, Qixia Yuan

      Pages 232-249

This book constitutes the proceedings of the Third International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2017, held in Changsha, China, in October
2017.
The 19 full papers presented together with 3 invited talks  were carefully reviewed and selected from 31 submissions. The aim of the symposium is to bring together international researchers and practitioners in the field of software technology. Its focus is on probabilistic and statistical analysis; timed and hybrid systems; program analysis; modeling and verification; formalization; and tools.

• Modeling and Verification
• Timed and Hybrid models
• Formal languages and automata theory
• Program Analysis
• Probabilistic and statistical analysis
• Formal Methods
• Formal Tools and Applications
• Cyber-Physical Systems
• Software Engineering

• Aalborg University, Aalborg, Denmark

  Kim Guldstrand Larsen

• University of Pennsylvania, Philadelphia, USA

  Oleg Sokolsky

• National University of Defense Technology, Changsha, China

  Ji Wang

Policies and ethics