Markus Kaltenbach  Home/Search
Context Related
| utexas.edu/pub/techrepor...tr9622.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: vii List of Figures xiv Chapter 1 Introduction 1 1.1 Design and Verification of Concurrent Programs . . . . . . . . . . . 2 1.2 Overview of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2.1 Foundations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2.2 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2.3 Structure of the Thesis . . . . . . . . . . . . . . . . . . . . . . 6 Chapter 2 Preliminaries 8 2.1 Notation and Terminology . . . . . . ... (Update)
Context of citations to this paper: More
...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...
.... 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...
Cited by: More
Strategic Directions in Computing Research Concurrency.. - Cleaveland, (eds.) (1996) (Correct)
Progress - Misra (1999) (Correct)
Mechanizing UNITY in Isabelle - Paulson (1999) (Correct)
Active bibliography (related documents): More All
1.2: A Logic for Concurrent Programming - Misra (1994) (Correct)
0.6: Safety Properties - Misra (1994) (Correct)
0.6: The UV System - User Interface Manual (Correct)
Similar documents based on text: More All
0.4: Ameliorating the State Space Explosion Problem - Namjoshi (1998) (Correct)
0.3: Self-Adjusting Quorum Systems For Byzantine Fault Tolerance - Pierce (2000) (Correct)
0.2: An Automation-Based Design Methodology for Distributed, Hard.. - Puchol (1998) (Correct)
Related documents from co-citation: More All
2: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
2: Springer-Verlag (context) - Francez - 1986
2: Proving the correctness of multiprocess programs (context) - Lamport - 1977
BibTeX entry: (Update)
Kaltenbach, M. 1996. Interactive Verification Exploiting Program Design Knowledge: A Model-Checker for UNITY. Ph. D. thesis, University of Texas at Austin. http://citeseer.ist.psu.edu/kaltenbach96interactive.html More
@techreport{ kaltenbach97interactive,
author = "Markus Kaltenbach",
title = "Interactive Verification Exploiting Program Design Knowledge: {AM}odel-Checker for {UNITY}",
number = "CS-TR-96-22",
month = "1,",
year = "1997",
url = "citeseer.ist.psu.edu/kaltenbach96interactive.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1726 Graph-based algorithms for Boolean function manipulation - Bryant - 1986
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
652 A Discipline of Programming (context) - Dijkstra - 1976
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1981
316 Efficient implementation of a BDD package (context) - Brace, Bryant et al. - 1990
297 Symbolic Model Checking (context) - McMillan - 1992
297 Symbolic Model Checking (context) - McMillan - 1993
275 Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993
267 Computer-Aided Verification of Coordinating Processes (context) - Kurshan - 1994
258 A lattice-theoretical fixpoint theorem and its application (context) - Tarski - 1955
231 Information Processing Letters (context) - Alpern, Schneider - 1985
221 Specification and verification of concurrent systems in CESA.. (context) - Quielle, Sifakis - 1982
206 Results on the propositional mu-calculus (context) - Kozen - 1983
202 International Series in Computer Science (context) - Milner, Concurrency - 1989
197 The revised 3 report on the algorithmic language Scheme - Rees, Clinger - 1986
195 Parallel Program Design (context) - Chandy, Misra - 1988
157 Proving the correctness of multiprocess programs (context) - Lamport - 1977
155 ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
126 Introduction to HOL (context) - Gordon, Melham - 1993
122 Synthesis of synchronization skeletons for branching time te.. (context) - Clarke, Emerson - 1981
116 A structural induction theorem for processes (context) - Kurshan, McMillan - 1989
111 Springer Verlag (context) - Francez - 1986
108 Verification of synchronous sequential machines based on sym.. (context) - Coudert, Berthet et al. - 1989
101 Better verification through symmetry - Ip, Dill - 1993
97 STeP: the Stanford Temporal Prover - Manna - 1994
97 Chapman and Hall (context) - Conway, finite - 1971
91 An integration of model checking with automated proof checki.. - Rajan, Shankar et al. - 1995
87 Verification of arithmetic functions with binary moment diag.. - Bryant, Chen - 1995
78 Text and Monographs in Computer Science (context) - Dijkstra, Scholten et al. - 1990
77 A unified framework for the formal verification of sequentia.. (context) - Coudert, Madre - 1990
71 User Guide for the PVS Specification and Verification System - Owre, Shankar et al. - 1993
67 ACM Transactions on Programming Languages and Systems (context) - Grumberg, Long et al. - 1994
66 Reasoning about networks with many identical finite state pr.. (context) - Brown, Clarke - 1989
59 Modalities for model checking: Branching time strikes back (context) - Emerson, Lei - 1985
58 Representing circuits more efficiently in symbolic model che.. (context) - Burch, Clarke et al. - 1991
55 and the formal derivation of programs (context) - Dijkstra, nondeterminacy - 1975
51 Soundness and completeness of an axiom system for program ve.. (context) - Cook - 1978
51 Eliminating the substitution axiom from UNITY logic (context) - Sanders - 1991
43 Professional Computing Series (context) - Ousterhout, the - 1994
43 Verifying Temporal properties of Systems (context) - Bradfield - 1993
40 Reasoning about rings - Emerson, Namjoshi - 1995
36 A logic for concurrent programming: Safety (context) - Misra - 1995
35 A UNITY-style programming logic for a shared dataspace langu.. - Cunningham, Roman - 1990
35 A logic for concurrent programming: Progress (context) - Misra - 1995
34 Temporal Verification of Reactive Systems (context) - Manna, Pnueli - 1995
33 The treadmill: Real-time garbage collection without motion s.. - Baker - 1992
27 Implicit enumeration of finite state machines using bdd's (context) - Touti, Savoj et al. - 1990
26 Word-level symbolic model checking - a new approach for veri.. (context) - Clarke, Zhao - 1996
24 Action Refinement: The Easy Way (context) - Broy, Calculi et al. - 1993
23 Basic Algebra II (context) - Jacobson - 1980
21 Dynamic algebras as a well-behaved fragment of relation alge.. - Pratt - 1988
21 Application of the composition principle to UNITY-like speci.. (context) - Collette - 1993
21 Parametric circuit representation using inductive boolean fu.. - Gupta, Fisher - 1993
20 Personal communications (context) - Cohen - 1996
19 A computational theory and implementation of sequential hard.. (context) - Pixley - 1990
19 Combining model checking and theorem proving to verify paral.. (context) - Hungar - 1993
16 Efficient verification with BDDs using implicitely conjoined.. - Hu, Dill - 1993
14 Mechanically Supported Design of Self-Stabilizing Algorithms (context) - Prasetya - 1995
13 A predicate transformer approach to semantics of parallel pr.. (context) - Jutla, Knapp et al. - 1989
12 On Kleene algebras and closed semirings - Kozen - 1990
10 A discipline of multiprogramming - Misra - 1994
9 User's Manual (context) - Kaltenbach, System - 1995
8 Soundness of the substitution axiom (context) - Misra - 1990
7 Model checking for UNITY (context) - Kaltenbach - 1994
7 Mechanically verifying concurrent programs - Goldschlag - 1992
7 unpublished manuscript (context) - Misra
5 Refinement as a Basis for Concurrent Program Design (context) - Knapp - 1992
5 Personal communications (context) - Jain - 1996
4 Specification and verification of large-scale reactive progr.. (context) - Staskauskas - 1992
4 A family of 2-process mutual exclusion algorithms (context) - Misra - 1990
4 Modular Progress Proofs of Asynchronous Programs - Cohen - 1993
4 Extensions of the UNITY Methodology (context) - Rao - 1995
3 DUALITY: A simple formalism for the analysis of UNITY (context) - Dijkstra - 1995
3 Technical Report TR (context) - Carruth - 1994
3 A compositional proof system for UNITY based on rely/guarant.. (context) - Collette, Knapp - 1993
2 volume 6 of The Definitive Guides to the X Window System (context) - Heller, Manual - 1992
1 a family of 2-process mutual exclusion algorithms: Notes on .. (context) - Dappert-Farquhar, on - 1990
1 Notes on UNITY - Misra - 1990
1 Concurrent programming witha single thread of control (context) - Adams - 1995
1 Personal communications (context) - Filkorn - 1994
1 The temporal logic of transitions (context) - Cuellar, Wildgruber et al. - 1994
1 ftp access at ftp://ftp (context) - Misra, of et al. - 1996
1 An interactive formal system for concurrent program design (context) - Kaltenbach - 1995
1 HSIS: a BDD-based environment for formal verification (context) - Group - 1994
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.utexas.edu.html): More
Stack Tracing In A Statically Typed Language - Diwan (1991) (Correct)
Combining Top-down and Bottom-up Techniques in Inductive .. - Zelle, Mooney, Konvisser (1994) (Correct)
Expert Systems for Monitoring and Control - Dvorak (1987) (Correct)
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