Family-based deductive verification of software product lines

Thomas Thüm, Ina Schaefer, Martin Hentschel, Sven Apel
2012 Proceedings of the 11th International Conference on Generative Programming and Component Engineering - GPCE '12  
A software product line is a set of similar software products that share a common code base. While software product lines can be implemented efficiently using feature-oriented programming, verifying each product individually does not scale, especially if human effort is required (e.g., as in interactive theorem proving). We present a family-based approach of deductive verification to prove the correctness of a software product line efficiently. We illustrate and evaluate our approach for
more » ... e product lines written in a feature-oriented dialect of Java and specified using the Java Modeling Language. We show that the theorem prover KeY can be used off-the-shelf for this task, without any modifications. Compared to the individual verification of each product, our approach reduces the verification time needed for our case study by more than 85 %.
doi:10.1145/2371401.2371404 dblp:conf/gpce/ThumSHA12 fatcat:bk4rgrznz5g2dbj6fcljjpbqam