Eugene W. Stark  Home/Search
Context Related
| sunysb.edu:18080/~...tailmenttcs.ps.gz 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: sunysb.edu:18080/~stark/R...INDEX (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The lack of expressive power of temporal logic as a specification language can be compensated to a certain extent by the introduction of powerful, high-level temporal operators, which are difficult to understand and reason about. A more natural way to increase the expressive power of a temporal specification language is by introducing conceptual state variables, which are auxiliary (unimplemented) variables whose values serve as an abstract representation of the internal state of the... (Update)
Context of citations to this paper: More
...A to B and from B to C, respectively, f ffi f is a forward simulation from A to C. 11 Theorem 3. 10 (Soundness of forward simulations, [35, 20, 47]) A F B ) A T B. Proof: Versions of this proof appears in the cited papers. The proof is similar to that of Theorem 3.4. Also the...
.... prototype implementation was sufIicient since for most of the ver ifications, the state spaces involved were relatively small (less than 300,000 states) Although for two of the verifications the results were inconclusive due to time and space demands, the decomposition of the...
Cited by: More
The Existence of Refinement Mappings - Mart'in Abadi And (1991) (Correct)
Forward and Backward Simulations for Timing-Based Systems - Lynch, Vaandrager (1991) (Correct)
Formal Verification of TCP and T/TCP - Smith (1997) (Correct)
Similar documents (at the sentence level):
74.4%: Proving Entailment Between Conceptual State Specifications.. - Stark (1988) (Correct)
Active bibliography (related documents): More All
0.7: Foundations of a Theory of Specification for Distributed Systems - Stark (1984) (Correct)
0.4: A Proof Technique for Rely/Guarantee Properties - Stark (1986) (Correct)
0.4: Hierarchical Correctness Proofs for Distributed Algorithms - Tuttle (1987) (Correct)
Similar documents based on text: More All
0.0: Emulating Unimplemented Instructions in a Simultaneous.. - Suan Yong And (Correct)
0.0: Absolutely Continuous Spectrum of Perturbed Stark Operators - Kiselev (1997) (Correct)
0.0: Stark's Conjectures and Hilbert's Twelfth Problem - Roblot (1999) (Correct)
Related documents from co-citation: More All
11: Hierarchical Correctness Proofs for Distributed Algorithms - Lynch, Tuttle - 1987
8: The existence of refinement mappings - Abadi, Lamport - 1991
8: An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
BibTeX entry: (Update)
E. W. Stark. Proving entailment between conceptual state specifications. Theoretical Comput. Sci., 56:135--154, 1988. http://citeseer.ist.psu.edu/stark86proving.html More
@inproceedings{ stark86proving,
author = "Eugene W. Stark",
title = "Proving Entailment Between Conceptual State Specifications",
booktitle = "European Symposium on Programming",
pages = "197-209",
year = "1986",
url = "citeseer.ist.psu.edu/stark86proving.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Lamport, program - 1983
539 The temporal logic of programs (context) - Pnueli - 1977
265 Proof of correctness of data representations (context) - Hoare - 1972
177 Temporal logic can be more expressive (context) - Wolper - 1981
104 Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982
43 Verification of Concurrent Programs: A Temporal Proof System (context) - Manna, Pnueli - 1983
39 Abstract data types and software validation (context) - Guttag, Horowitz et al. - 1978
35 Development Methods for Computer Programs Including a Notion.. (context) - Jones - 1981
34 is sometimes (context) - Lamport - 1980
23 Foundations of a Theory of Specification for Distributed Sys.. - Stark - 1984
17 Concurrency control for resilient nested transactions (context) - Lynch - 1983
11 Temporal logic specification of distributed systems (context) - Schwartz, Melliar-Smith - 1981
10 Verifying Temporal Properties Without Using Temporal Logic (context) - Alpern, Schneider - 1985
9 Now you may compose temporal specifications (context) - Barringer, Kuiper - 1984
8 Verifying Network Protocols Using Temporal Logic (context) - Hailpern, Owicki - 1980
6 A temporal logic specification method supporting hierarchica.. (context) - Barringer, Kuiper - 1983
5 Internal Consistency of a Distributed Transaction System wit.. (context) - Goree - 1981
2 Specification and Verification Techniques for Parallel Progr.. (context) - Yonezawa - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://bsd7.cs.sunysb.edu:18080/~stark/REPORTS/INDEX.html): More
A Calculus of Dataflow Networks (Extended Abstract) - Stark (Correct)
Formally Defining Debuggers: A Comparison of Three Approaches - Bernstein, Stark (1995) (Correct)
A Proof Technique for Rely/Guarantee Properties - Stark (1986) (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