ABSTRACT We present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the veri cation problem under investigation. Formal basis for this methodology are Modal Transition Systems allowing loose state-based speci cations, which can be re ned by successively adding constraints. Key concepts of our method are projective views, separation of proof obligations, Skolemization and abstraction. Central to the method is the use of Parametrized Modal Transition Systems. The method easily transfers to real-time systems, where the main problem are parameters in timing constraints.
Larsen et al. use projective views for a constrained-based proof methodology on modal transition systems REF .
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS
Computer Science