Ausgabe 5/2017
TACAS 2013 (pp. 511-584)
Inhalt (8 Artikel)
TACAS 2013
Flexible SAT-based framework for incremental bounded upgrade checking
Grigory Fedyukovich, Ondrej Sery, Natasha Sharygina
TACAS 2013
Synthesis of circular compositional program proofs via abduction
Isil Dillig, Thomas Dillig, Boyang Li, Ken McMillan, Mooly Sagiv
TACAS 2013
An integrated specification and verification technique for highly concurrent data structures
Parosh Aziz Abdulla, Frédéric Haziza, Lukáš Holík, Bengt Jonsson, Ahmed Rezine
TACAS 2013
Underapproximation of procedure summaries for integer programs
Pierre Ganty, Radu Iosif, Filip Konečný
Regular Paper
Efficient family-based model checking via variability abstractions
Aleksandar S. Dimovski, Ahmad Salim Al-Sibahi, Claus Brabrand, Andrzej Wąsowski
Regular Paper
metaSMT: focus on your application and not on solver integration
Heinz Riener, Finn Haedicke, Stefan Frehse, Mathias Soeken, Daniel Große, Rolf Drechsler, Goerschwin Fey
Regular Paper
A general model checking framework for various memory consistency models
Tatsuya Abe, Toshiyuki Maeda