P. D. Stotts, R. Furuta, and C. R. Cabarrus. Hyperdocuments as automata: verification of trace-based browsing properties by model checking. ACM Transactions on Information Systems (TOIS), 16(1):1--30, January 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....can be model checked very efficiently. The program models and the logic are slightly different. Technically, they are based on branching structures (instead of linear structures) and computation tree logics (CTL) There are many concrete examples of model checking in the literature. For example, [21] show how they can verify hyperdocuments using a trace based approach. Verification of real time systems has been been addressed in [22] while the verification of audio protocol has been reported in [2] The article [6] presents the model checking of certain types of concurrent C applications ....

P. D. STOTTS,R.FURUTA, AND C. R. CABARRUS (1998) Hyperdocuments as Automata: Verification of Trace Based Browsing Properties by Model Checking, ACM Transactions on Information Systems, 16.

....remarks on the thesis. Dr. Jorg Westbomke s engagement in initiating this paper is also very much appreciated. 2 Related Work In [Fronk, 2002b] we discuss some work related to structuring media objects and locating positions in them, such as the Trellis model [Stotts and Furuta, 1989, Stotts et al. 1998] XPath and XLink (c.f. Deitel et al. 2001] or the Composite design pattern [Gamma et al. 1995] Chang and Shih give a detailed survey of hypermedia process models [Chang and Shih, 2002] developed in the recent years, covering di#erent phases in the life cycle of hypermedia applications. ....

Stotts, P. D., Furuta, R., and Cabarrus, C. R. (1998). Hyperdocuments as automata: Verification of trace-based browsing properties by model checking. ACM Transactions on Information Systems, 16(1):1--30.

....As any language based on SGML XML, those tags are textually placed within the media objects themselves. Separating a link structure from this description is not possible. Furuta and Stotts formally model document structure by Petri nets [29] Thereby, they concentrate on browsing information. In [30], they use model checking to analyze browsing properties. Design and implementation of hyperdocuments is proposed by HDM [24] and OOHDM [25, 26] This model distinguishes between the design of content, link structure, and views, followed by their implementation. This four phase process model ....

P. D. Stotts, R. Furuta, and C. R. Cabarrus. Hyperdocuments as automata: Verification of trace-based browsing properties by model checking. ACM Transactions on Information Systems, 16(1):1--30, January 1998.

....by giving a rigorous definition of the logic used, by considering the underlying proof theory, by considering the issue of framing and its relationship to multi authoring, and by presenting more complex examples which treat the issue of composition in a more rigorous fashion. Furuta and Stotts [18, 19] make use of a temporal logic for specifying and tracing dynamic link paths in hypertext documents. Their logic is somewhat di#erent from ours, and does not require, for example, any notion of projection, and their application is also rather di#erent. In contrast, interval temporal logic has a ....

P.D. Stotts, R. Furuta, and J.C. Ruiz. "Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking". ACM Trans. Information Systems, 1997. To appear.

....information from the database. The possible values for user input are predefined in these cases. Forms are only used where user input has to be gathered. Using groups of links instead of forms to interact with the database, the finite state machine model well known from static hypertext documents [5] can be remodelled to be suitable for dynamically generated hypertext [3] It is proposed to view a static document as an abstract automaton that specifies the process of browsing within it. The linked structure of a document can usually be thought of as the state transition diagram of a FSM. ....

Stotts, D.P.; Furuta, R.; Cabarrus, C.R.: Hyperdocuments as Automata: Verification of Traces-Based Browsing Properties by Model Checking. ACM Transactions on Information Systems, Vol. 16, No. 1, pp. 1-30, January 1998.

....some property P becomes true: fl :P P . Example 6 above provides a specific example. 5 Related Work There has been little previous work on applying temporal logic to the field of electronic publishing. King [10, 11] justify the use of ITL in this area and present examples. Furuta and Stotts [16, 15] make use of a temporal logic for specifying and tracing dynamic link paths in hypertext documents. Their logic is somewhat different from ours, and does not require, for example, any notion of projection, and their application is also rather different. In contrast, interval temporal logic has a ....

P.D. Stotts, R. Furuta, and J.C. Ruiz. Hyperdocuments as automata: Verification of trace-based browsing properties by model checking. ACM Transactions on Information Systems, 1997. To appear.

....(collaboration protocol) to be dynamically defined (as opposed to being hard wired in the source code) In this way, group interactions can be developed and changed without changing the MMM software. Further research has led to methods for verifying the correctness of collaboration protocols [20,21]. In the experiments we have done, the shared artifact is, at the lowest level, the entire PC screen. We wanted to explore the technological feasibility of distributed pair programming with the simplest of technical structure. Thus we chose not to experiment with shared artifacts at the code ....

P. D. Stotts, R. Furuta, and C. R. Cabarrus, Hyperdocuments as Automata: Verification of Trace-based Browsing Properties by Model Checking, ACM Trans. on Information Systems, vol. 16, pp. 1-30, January 1998.

.... the analysis of behavioral properties and performance assessment, as well as for systematic building of systems [24] Therefore, authors can use Petri net analysis techniques to verify and validate the behavioral characteristics of developed hypertext systems before they are handed over to users [20]. Firstly it is possible to verify that all nodes in a hypertext can be reached via some path; more important, it also is possible to verify that certain nodes cannot be reached from particular initial markings, giving the basis for access control. Additionally, the following characteristics may ....

STOTTS, P.D., FURUTA, R., and CABARRUS, C.R. "Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking", ACM Trans. On Information Systems, vol. 16, no. 1, (1998), pp. 1-30

....enabled) boundness (i.e. if there is a place that has unbounded number of tokens) and safeness (i.e. if every place has only one token) In Petri net analysis, in addition to dead marks, boundness is important since the tokens may represent limited system resources. In the context of Trellis, [25] explores the analysis of basic Petri nets for various browsing characteristics. To activate the debugging tool, the user first pushes a recording button (see the Rec Tool buttons in Figure 2) Thereafter, when a dead link or an overflow place occurs while the user fires transitions, warning ....

STOTTS, P.D., FURUTA, R., and CABARRUS, C.R. "Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking", ACM Transactions on Information Systems, 16, 1 (1998), pp. 1-30.

....as a colored net, we can analyze it for correct browsing properties using a model checking approach, first developed by Clarke [3] for analysis of algorithms in concurrent programming languages. We first applied these methods to analysis of hypermedia documents in the original Trellis model [17], encoded as basic nets (not colored nets) Current Ph.D. research is extending our early analysis to colored nets and full collaboration protocols [13] Properties that a CobWeb collaboration protocol should exhibit are encoded in a temporal logic for verification. Without going into detail on ....

Stotts, P. D., Furuta, R., and Ruiz, J. C. Hyperdocuments as automata: Verification of trace-based browsing properties by model checking. ACM Trans. on Information Systems 16, 1 (Jan. 1998), 1--30.

No context found.

P. D. Stotts, R. Furuta, and C. R. Cabarrus. Hyperdocuments as automata: verification of trace-based browsing properties by model checking. ACM Transactions on Information Systems (TOIS), 16(1):1--30, January 1998.

No context found.

P. D. Stotts, R. Furuta, and C. R. Cabarrus, "Hyperdocuments as automata: Verification of trace-based browsing properties by model checking", ACM Transactions on Information Systems 16(1) (1998) 1--30.

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