U. Engberg. Reasoning in the Temporal Logic of Actions. PhD thesis, Department of Computer Science, University of Aarhus, September 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....existing verification and proof tools. But for the moment, we use an ad hoc logic that we have defined and for which no tool exists. We thus have to define modules where behaviors are defined with another logic. We have began to work on TLA [11] in order to use tools associated to TLA (such as TLP [4]) We are also studying TRIO [7] it is a temporal logic with a notion of duration and there exist tools for the proof of logical properties and for model and test case generation. We are involved in a project where our aim is to work on the modularization of the specification and validation of an ....

U. Engberg. Reasoning in the Temporal Logic of Actions. PhD thesis, Department of Computer Science, University of Aarhus, September 1995.

....project does not deal at all with temporal reasoning. By most accounts, 90 of all reasoning in TLA speci cations occurs at the action level, where temporal logic has been eliminated [15, 20] Interestingly, action reasoning seems to be the least discussed aspect in previous TLA veri cation work [2, 11, 20]. On second look, this is not surprising, since reasoning about ordinary math is a problem all to its own. While there is no hope of providing satisfactory support a good degree of automation for an arbitrary theorem stated in TLA, we bene t from the fact that TLA speci cations and theorems follow ....

....1 e 1 2 : 2p n e n case p 1 e 1 2 : 2p n e n 2 other e let d = f in e Mechanical Support for TLA Ours is not the rst e ort to provide mechanical support for TLA. A parser and a model checker [14] have detected bugs in TLA speci cations. In the theorem proving arena, Larch [2], Isabelle [20] and HOL [11] have been used to verify TLA theorems. Among these, TLP has been used to verify large speci cations. The above research has highlighted the bene t in separating temporal reasoning from action reasoning. While most of the previous work pays great attention to the ....

Urban Engberg, Reasoning in the Temporal Logic of Actions. PhD thesis, Aarhus University, 1994.

....of at least a reasonable size. Thus, TLA in Isabelle has been used to re prove the correctness of an increment algorithm, which has already been proved in both TLP [4] and HOL [13] The proofs concerning this algorithm are explained informally by Lamport [8] and in much more detail by Engberg [3]. The specification of the algorithm is illustrated in Figure 4. Formula Phi describes the problem in an abstract level: there are two variables, x and y, which are asynchronously updated, in such a way that while one is being updated the other one remains constant, There is also a fairness ....

....system, consisting of an Emacs front end, an SML translator, and several back ends, which at present include the Larch Prover and a BDD procedure for temporal tautologies. The translator program translates TLA expressions into input for the various back ends. TLP has been used extensively [3]. Another mechanisation of TLA, this time in HOL, is due to von Wright and Langbacka. Instead of axiomatizing the proof rules given by Lamport, they have decided to derive them from the interpretation of temporal logic. Their representation of the semantics of state is slightly different from the ....

U. Engberg. Reasoning in the Temporal Logic of Actions. PhD thesis, Aarhus University, 1994.

....concentrated on methodological guidelines and the incorporation of existing components and well known techniques into a development. Their ideas seem compatible with the work presented here. Finally, there are several incorporation of TLA (or parts thereof) into existing theorem provers, e.g. [15, 16, 12, 3]. While this work provides useful experience, the problems discussed in this paper do not seem to have been treated up to now. ....

U. Engberg. Reasoning in the temporal logic of actions. http://www.daimi.aau.dk/~urban/tlp/tlp.html, 1995.

....and assumption commitment specifications in particular, is a difficult and error prone task. What is needed therefore is adequate tool support both for specification and for verification. The VSE II project was set up to develop a tool which goes beyond a pure theorem prover for TLA, like [3, 4, 5, 6, 7, 8], and can be used for formal software development of distributed and reactive systems. The VSE II system provides a specification language based on TLA, including assumption commitment specifications, 9, 10] In addition to the communication by input output variables used in [1] the VSE II ....

Urban Engberg. Reasoning in the temporal logic of actions. http://www.daimi.aau.dk/~urban/tlp/tlp.html, 1995.

....x refers not to a value directly but to a function from a state to a value. The discrepancy between the superficial syntax of formulas and the semantics of TLA adds practical difficulties in designing a theorem prover for TLA, an issue commented upon by builders of several existing implementations [24, 7, 12]. Proofs involving temporal aspects are difficult to automate. There are other formalisms which attempt to address the representation of dynamic systems by considering transitions between states rather than states directly. The calculus is an algebraic formulation of the notion of processes and ....

Urban Engberg. Reasoning in the Temporal Logic of Actions. PhD thesis, Aarhus University, 1994.

....property. TLA users can take advantage of the existence of a theorem prover, named TLP, that can be used to certify proofs [13] TLP is a (semi)automatic verifier that allows to incrementally build and verify proofs in a structured and top down fashion. The current TLP version is described in [12]. Presently TLP is made up of an interactive interface and of a translator acting as a front end for the automatic verifier Larch Prover (LP) 15, 16] The front end is a translator that transforms TLP formulae in a codification understandable by LP and augments LP by TLA axioms and inference ....

U. Engberg. Reasoning in the Temporal Logic of Actions. PhD thesis, CS Dept., Univ. of Aarhus, Denmark, September 1995.

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