Tobias Hamberger. Kombination von Theorembeweisen und Model Checking fr I/O Automaten. Master's thesis, Computer Science Department, Technical University Munich, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Validas Validator Manual - Validas (2001) (Correct)
....barrier. Using abstractions and the verified abstract model we can insure the correctness of the concrete 119 model. The correctness proofs have not been carried out using VSE, due to limited resources within the project. However similar proofs have been carried out using the Isabelle system [Ham99] The essence of this work has been that it is much easier to discharge the proof obligations, compared with the finding of correct (and useful) abstractions. To ease this process we integrated the abstraction chooser within our framework. The comparators are described within Section 5.4.2, the ....
Tobias Hamberger. Kombination von Theorembeweisen und Model Checking fr I/O Automaten. Master's thesis, Computer Science Department, Technical University Munich, 1999.
Quest Users Guide - Braun, Loetzbeyer, Slotosch (2000) (Correct)
....surge barrier. Using abstractions and the verified abstract model we can insure the correctness of the concrete model. The correctness proofs have not been carried out using VSE, due to limited resources within the project. However similar proofs have been carried out using the Isabelle system [Ham99] The essence of this work has been that it is much easier to discharge the proof obligations, compared with the finding of correct (and useful) abstractions. To ease this process we integrated the abstraction chooser within our framework. The comparators are described within Section 7.2, the ....
Tobias Hamberger. Kombination von Theorembeweisen und Model Checking fr I/O Automaten. Master's thesis, Computer Science Department, Technical University Munich, 1999.
A Verification Environment for I/O Automata - Part II: Theorem.. - Müller (1999) (Correct)
....( S m2bool fS (m)g; S m2bool fR(m)g; fg) Buf trans j f(s ; a; s 0 ) j case a of S (m) queue(s 0 ) queue(s) m] j R(m) queue(s) m : rst queue(s 0 ) rstg There is an automatic translation of the precondition effect style into the set comprehension format. It is described in [18]. Therefore the user may always stay within his familiar specification format. 4.3 Executions and Traces Execution fragments of an I O automaton A are (1) finite or infinite sequences of alternating states s i and actions a i , where (2) triples s i a i s i 1 represent steps of A. The first ....
T. Hamberger. Kombination von Theorembeweisen und Model Checking fur I/O Automaten. Master's thesis, Computer Science Department, Technical University Munich, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC