1. Advances in verification presented in TACAS’13

   • Nir Piterman

   Introduction Open access 09 June 2017 Pages: 511 - 515

2. Flexible SAT-based framework for incremental bounded upgrade checking

   • Grigory Fedyukovich
   • Ondrej Sery
   • Natasha Sharygina

   TACAS 2013 20 October 2015 Pages: 517 - 534

   

3. Synthesis of circular compositional program proofs via abduction

   • Isil Dillig
   • Thomas Dillig
   • Mooly Sagiv

   TACAS 2013 19 August 2015 Pages: 535 - 547

   

4. An integrated specification and verification technique for highly concurrent data structures

   • Parosh Aziz Abdulla
   • Frédéric Haziza
   • Ahmed Rezine

   TACAS 2013 16 March 2016 Pages: 549 - 563

   

5. Underapproximation of procedure summaries for integer programs

   • Pierre Ganty
   • Radu Iosif
   • Filip Konečný

   TACAS 2013 20 April 2016 Pages: 565 - 584

   

6. Efficient family-based model checking via variability abstractions

   • Aleksandar S. Dimovski
   • Ahmad Salim Al-Sibahi
   • Andrzej Wąsowski

   Regular Paper 26 May 2016 Pages: 585 - 603

   

7. metaSMT: focus on your application and not on solver integration

   • Heinz Riener
   • Finn Haedicke
   • Goerschwin Fey

   Regular Paper 17 June 2016 Pages: 605 - 621

   

8. A general model checking framework for various memory consistency models

   • Tatsuya Abe
   • Toshiyuki Maeda

   Regular Paper 19 July 2016 Pages: 623 - 647