Limor Fix and Fred B. Schneider. Reasoning about programs by exploiting the environment. In Annual International ColloquiumonAutomata, Languages and Programming, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Verification, Refinement and Scheduling of Real-time Programs - Liu, Joseph (Correct)
....enabled for at least L( time units; and must not be continuously enabled for U ( time units without being performed . The Temporal Logic of Actions (TLA) Lam94] is used as the specification notation and the proof system for these programs. Volatile time bounds have been used widely (e.g. [HMP91, AL92, FS94, HMP94, LJJ95]) to specify the time criticality of an operation. However, when dealing with pre emption (interruption) in real time scheduling, use of volatile time bounds requires a scheduled action to be explicitly divided into smaller actions (or steps) between whose execution pre emption can occur. Then the ....
L. Fix and F.B. Schneider. Reasoning about programs by exploiting the environment. Technical Report TR94-1409, Department of Computer Science, Cornell University, Ithaca, New York 14853, 1994.
Caltech Infospheres Project Overview: Information.. - Mani Chandy (1996) (9 citations) (Correct)
....the problems listed in the previous section are problems in distributed algorithm design and implementation, except that the algorithms now have to deal with competing sessions. The literature on systematic methods for designing sequential and concurrent programs [DS90, CT92, AL93, Cha94, Lam94, SF94, CS95] deals in large part with compositional design and reasoning: proving that a composition of components meets the specification of the composed program by using the specification (but not the implementation) of the components. Compositional design is critical to our vision as well, except ....
F.B. Schneider and L. Fix. Reasoning About Programs by Exploiting the Environment. Proceedings of the 21st International Colloquium, ICALP 94, pages 328--339, July 1994. Jerusalem, Israel; Lecture Notes in Computer Science 820, Springer-Verlag, New York.
On TLA as a Logic - Abadi, Merz (1996) (2 citations) (Correct)
....Lamport s original work on TLA [19] provides much additional, useful material, and in particular some motivation for the TLA approach and a proof system for TLA. Other papers discuss mechanical verification in TLA [11, 16] refinement and composition [6, 4] real time systems and hybrid systems [5, 18, 12], and medium size examples [20] There are also works on PTLA [1, 29] a propositional logic based on a preliminary version of TLA. Finally, the logic TLR has many similarities with TLA [28] 2 Mart in Abadi and Stephan Merz 2 A Definition of TLA In this section we define a syntax and a ....
Limor Fix and Fred B. Schneider. Reasoning about programs by exploiting the environment. In Annual International Colloquium on Automata, Languages and Programming, 1994.
Hybrid Verification by Exploiting the Environment - Fix, Schneider (1994) (2 citations) Self-citation (Fix Schneider) (Correct)
....the valve drains water. In fact, correctness of the control program is defined in terms of permissible states of the environment, because correctness is based on the water level. One simply cannot specify or reason about such a control program without saying something about its environment. In [10] we introduced two principles for verifying programs whose executions are affected by an environment. The state of the environments considered in [10] change discretely along with each atomic action of the program. Nevertheless, our principles were shown to be usable for verifying real time ....
....is based on the water level. One simply cannot specify or reason about such a control program without saying something about its environment. In [10] we introduced two principles for verifying programs whose executions are affected by an environment. The state of the environments considered in [10] change discretely along with each atomic action of the program. Nevertheless, our principles were shown to be usable for verifying real time behavior of concurrent programs, because schedulers and resource limitations that affect execution time can be regarded as part of the environment. In this ....
[Article contains additional citation context not shown here]
L. Fix and F.B. Schneider. Reasoning about programs by exploiting the environment. To appear, 21st International Colloquium On Automata, Languages and Programming.
On TLA as a Logic - Abadi, Merz (1996) (2 citations) (Correct)
No context found.
Limor Fix and Fred B. Schneider. Reasoning about programs by exploiting the environment. In Annual International ColloquiumonAutomata, Languages and Programming, 1994.
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