Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Model Mining and Efficient Verification of Software Product Lines

Soleimanifard, SiavashGurov, DilianSchaefer, InaØstvold, BjarteMarkov, Minko — 2015

Serdica Journal of Computing

Software product line modeling aims at capturing a set of software products in an economic yet meaningful way. We introduce a class of variability models that capture the sharing between the software artifacts forming the products of a software product line (SPL) in a hierarchical fashion, in terms of commonalities and orthogonalities. Such models are useful when analyzing and verifying all products of an SPL, since they provide a scheme for divide-and-conquer-style decomposition of the analysis...

A Note on Negative Tagging for Least Fixed-Point Formulae

Dilian GurovBruce Kapron — 2010

RAIRO - Theoretical Informatics and Applications

Proof systems with sequents of the form ⊢ Φ for proving validity of a propositional modal -calculus formula Φ over a set of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without...

Page 1

Download Results (CSV)