A Constraint Oriented Proof Methodology based on Modal Transition Systems
Keyword(s):
In this paper, we present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the verification problem under investigation. Formal basis for this methodology are Modal Transition Systems allowing loose state-based specifications, which can be refined by successively adding constraints. Key concepts of our method are <em>projective views</em>, <em>separation of proof obligations</em>, <em> Skolemization</em> and <em>abstraction</em>. The method is even applicable to real time systems
Review of Software Fault-Tolerance Methods for Reliability Enhancement of Real-Time Software Systems
2016 ◽
Vol 6
(3)
◽
pp. 1031
1992 ◽
Vol 01
(01)
◽
pp. 1-35
◽
Review of Software Fault-Tolerance Methods for Reliability Enhancement of Real-Time Software Systems
2016 ◽
Vol 6
(3)
◽
pp. 1031
2006 ◽
Vol 16
(06)
◽
pp. 987-1014
◽
Keyword(s):
2017 ◽
Vol 7
(5)
◽
pp. 148-155