M. Kaltenbach. Interactive Verification Exploiting Program Design Knowledge: A Model-Checker for UNITY. PhD thesis, The University of Texas at Austin, 1996. Available through URL http://www.cs.utexas.edu/users/markus/diss.html. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Strategic Directions in Computing Research Concurrency.. - Cleaveland, (eds.) (1996) (2 citations) (Correct)
....in linear time formalisms; the Concurrency Workbench [CPS93] FDR [Ros94] and AUTO [RdS90] which compute various semantic relations and (in the case of the Workbench) implement branching time model checkers; and Xesar [QS82] and SMV [CMCHG96] which support branching time model checking. UV [Kal96] is a model checker for UNITY that combines automatic checking of linear time temporal properties with interactive features that allow a user to supply hints for speeding up the checking procedure. PEP [GB96] allows the automatic analysis of Petri net based systems. Other tools have been ....
M. Kaltenbach. Interactive Verification Exploiting Program Design Knowledge: A Model-Checker for UNITY. PhD thesis, The University of Texas at Austin, 1996. Available through URL http://www.cs.utexas.edu/users/markus/diss.html.
Progress - Misra (1999) (Correct)
....hope for. Such completeness results appear in Cohen[4] Jutla and Rao[11] Knapp[14] Pachl[23] and Rao ( 24] and [25] The fact that the disjunction rule, in the definition of leads to, is unnecessary for finite state programs is due to van de Snepscheut[27] It has been exploited by Kaltenbach[12] in implementing an automatic verifier for finite state programs. The leads to operator has been extended to probabilistic programs in [25] Carruth[1] shows how the progress operators can be extended for stating and proving real time progress properties. His extensions preserve the derived rules ....
Markus Kaltenbach. Interactive Verification Exploiting Program Design Knowledge: A Model-Checker for UNITY. PhD thesis, The University of Texas at Austin, 1996. http://www.cs.utexas.edu/users/markus/diss.html.
Mechanizing UNITY in Isabelle - Paulson (1999) (7 citations) (Correct)
....or infinite families of systems (for example, a token ring with n nodes) Misra [1995b] supplies many examples where the program to be verified is not given as specific commands but is described abstractly to be any program satisfying certain low level constraints. Despite these objections, Kaltenbach [1996] has developed a model checker for UNITY. Others have investigated alternative means of verifying UNITY programs automatically, using decision procedures for example [Thirioux 1998] However promising automatic methods may be, a general treatment requires formal proof. A most impressive e#ort is ....
Kaltenbach, M. 1996. Interactive Verification Exploiting Program Design Knowledge: A Model-Checker for UNITY. Ph. D. thesis, University of Texas at Austin.
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