Preface for the special issue for ATVA 2015
- 322 Downloads
This volume contains extended versions of selected papers presented at ATVA 2015, the 13th International Symposium on Automated Technology for Verification and Analysis, held during October 12–15, 2015, in Shanghai, China. ATVA is an international recognized conference, focusing on theoretical and practical aspects of automated analysis, verification, and synthesis by providing an international forum for interaction among researchers in academia and industry. ATVA 2015 had 95 regular and 13 tool submissions, with 33 papers accepted (six of them are tool papers). The program also included three invited talks and three invited tutorials given by Dino Distefano (Facebook and Queen Mary University of London), Martin Fränzle (Carl von Ossietzky University), Joost-Pieter Katoen (RWTH Aachen University), and J Strother Moore (University of Texas at Austin). After the conference, we invited the authors of a selection of the conference papers to submit extended versions for this special issue. The extended versions went through a separate reviewing process.
Looking at mean-payoff through foggy window by Paul Hunter, Guillermo Alberto Perez, Jean-François Raskin.
TSO to TSO linearizability is undecidable by Chao Wang, Yi Lv, Peng Wu.
Hierarchical information and the synthesis of distributed strategies by Dietmar Berwander, Anup Basil Mathew, and Marie van den Bogaard.
Spanning the spectrum from safety to Liveness by Orna Kupferman and Rachel Minkov.
In formal verification, safety specifications assert that the system stays within some allowed region, in which nothing “bad” happens. Classical investigated safety specification is binary: a specification is either safety or not safety. In this paper, the authors introduce a quantitative measure for safety. Intuitively, the safety level of a language L measures the fraction of words not in L that have a bad prefix–a prefix all whose extensions violate the specification. The authors formalize the notion of safety level and study the problem of finding the safety level of languages given by means of automata (deterministic and nondeterministic) as well as linear temporal logic formulas. They also study the problem of deciding their membership in specific classes (including safety, almost-safety, fraction-safety, etc.). Finally, the authors investigate properties of the different classes and the structure of deterministic automata for them.
We thank the authors as well as the ATVA 2015 program committee and the reviewers for their hard work to make this special issue possible.