article

Free access

Hyperdocuments as automata: verification of trace-based browsing properties by model checking

Editor: Robert B. Allen Authors:

P. David Stotts,

Richard Furuta,

Cyrano Ruiz CabarrusAuthors Info & Claims

ACM Transactions on Information Systems (TOIS), Volume 16, Issue 1

Pages 1 - 30

https://doi.org/10.1145/267954.267955

Published: 01 January 1998 Publication History

Abstract

We present a view of hyperdocuments in which each document encodes its own browsing semantics in its links. This requires a mental shift in how a hyperdocument is thought of abstractly. Instead of treating the links of a document as defining a static directed graph, they are thought of as defining an abstract program, termed the links-automaton of the document. A branching temporal logic notation, termed HTL*, is introduced for specifying properties a document should exhibit during browsing. An automated program verification technique called model checking is used to verify that browsing specifications in a subset of HTL* are met by the behavior defined in the links-automation. We illustrate the generality of these techniques by applying them first to several Trellis documents and then to a Hyperties document.

References

[1]

ATLEE, J. M. AND GANNON, J.D. 1993. State-based model checking of event-driven system requirements. IEEE Trans. Softw. Eng. 19, 1 (Jan.), 24-40.

[2]

BARRINGER, H., KUIPER, R., AND PNUELI, A. 1984. Now you may compose temporal logic specifications. In Proceedings of the 16th ACM Symposium on Theory of Computing. ACM, New York, 51-63.

[3]

BEERI, C. AND KORNATZKY, Y. 1990. A logical query language for hypertext systems. In Hypertext: Concepts, Systems, and Applications, Proceedings of the European Conference on Hypertext, A. Rizk, N. Streitz, and J. Andre, Eds. Cambridge University Press, New York, 67-80.

[4]

BEN-ARI, M., PNUELI, A., AND MANNA, Z. 1981. The temporal logic of branching time. In Proceedings of the 8th ACM Symposium on Principles of Programming Languages. ACM, New York, 164-176.

[5]

BURSH, J. R., CLARK, E. M., AND MCMILLAN, K.L. 1989. Symbolic model checking: 10 to the 20 states and beyond. Carnegie Mellon and Stanford Universities.

[6]

BURSTALL, R. M. 1974. Program proving as hand simulation with a little induction. Inf. Process. 74, 308-312.

[7]

CAMPBELL, B. AND GOODMAN, g. M. 1988. HAM: A general purpose hypertext abstract machine. Commun. ACM 31, 7 (July), 856-861.

[8]

CAPPS, M., LADD, B., AND STOTTS, D. 1996. Enhanced graph models in the Web: Multi-client, multi-head, multi-tail browsing. In Proceedings of the 5th International World Wide Web Conference (May 6-10). World Wide Web Consortium, Cambridge, Mass., 1105-1112. Available at http://www5conf.inria.fr/fich_html/papers/P19/Overview.html.

[9]

CHRISTODOULAKIS, S., THEODORIDOU, M., HO, F., AND PAPA, M. 1986. Multimedia document presentation, information extraction, and document formation in MINOS: A model and a system. ACM Trans. Office Inf. Syst. 4, 4 (Oct.), 345-383.

[10]

CLARKE, E. M. AND GRUMBERG, O. 1987. Research on automatic verification of finite-state concurrent systems. Ann. Rev. Comput. Sci. 2, 269-290.

[11]

CLARKE, E. M., EMERSON, E. A., AND SISTLA, A.P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2, 244-263.

[12]

EMERSON, E. A. AND HALPERN, J. Y. 1983. "Sometimes" and "not never" revisited: On branching vs. linear time. In Proceedings of the lOth ACM Symposium on Principles of Programming Languages. ACM, New York, 127-140.

[13]

EMERSON, E. A. AND LEI, C.L. 1985. Modalities for model checking: Branching time strikes back. In the 12th Symposium on Principles of Programming Languages. ACM, New York, 84 -96.

[14]

EMERSON, E. A. AND SRINIVASAN. 1989. Branching time temporal logic. In Proceedings of the REX School#Workshop 1988 on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency.

[15]

FURUTA, R. AND STOTTS, P.D. 1991. Structured dynamic behavior in hypertext. Tech. Rep. CS-TR-2597 (UMIACS-TR-91-14) Dept. of Computer Science and Inst. for Advanced Computer Studies, Univ. of Maryland, College Park, Md.

[16]

FURUTA, R. AND STOTTS, P. D. 1994. Interpreted collaboration protocols and their use in groupware prototyping. In Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work (CSCW '94) (Oct.). ACM, New York, 121-131.

[17]

GABBAY, D., PNUELI, A., SHELAH, S., AND STAVI, J. 1980. On the temporal analysis of fairness. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages. ACM, New York, 163-173.

[18]

GALTON, A. 1987. Temporal Logics and Their Applications. Academic Press, New York.

[19]

HALASZ, F. G. 1988. Reflections on NoteCards: Seven issues for the next generation of hypermedia systems. Commun. ACM 31, 7 (July), 836-852.

[20]

KAHN, K. AND GORRY, G.A. 1977. Mechanizing temporal knowledge. Artif Intell. 9, 67-95.

[21]

KOWALSKI, R. A. AND SERGOT, M. J. 1983. A logic-based calculus of events. New Gen. Comput. 4, 67-95.

[22]

K_ROGER, F. 1987. Temporal Logic of Programs. Springer-Verlag, Berlin.

[23]

LADD, B., CAPPS, M., STOTTS, D., AND FURUTA, R. 1995. Multi-Head/Multi-Tail mosaic: Adding parallel automata semantics to the Web. In Proceedings of the 4th International World Wide Web Conference (Dec. 11-14, Boston, Mass.). World Wide Web Consortium, Cambridge, Mass., 433-440. Available at http://www.w3.org/pub/Conferences/WWW4/ Papers/118/.

[24]

LAMPORT, L. 1980. "Sometime" is sometimes "not never": On the temporal logic of programs. In Proceedings of the 7th ACM Symposium on Programming Languages. ACM, New York, 174-185.

[25]

LEE, R. M., COELHO, H., AND COTTA, J. C. 1985. Temporal inferencing on administrative databases. Inf. Syst. 10, 197-206.

[26]

LICHTENSTEIN, O. AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specification. In the 12th Annual ACM Symposium on Principles on Programming Languages. ACM, New York, 97-107.

[27]

LLOYD, J.W. 1987. Foundations of Logic Programming. 2nd ed. Springer-Verlag, Berlin.

[28]

MANNA, Z. 1995. Temporal Verification of Reactive Systems. Springer-Verlag, Berlin.

[29]

MANNA, Z. AND PNUELI, A. 1981. Verification of concurrent programs: The temporal framework. In The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore, Eds. Academic Press, New York, 215-273.

[30]

MARCHIONINI, G. AND SHNEIDERMAN, B. 1988. Finding facts vs. browsing knowledge in hypertext systems. Computer 21, 1 (Jan.), 70-80.

[31]

MOSZKOWSKI, B. 1983. Reasoning about digital circuits. Ph.D. thesis, Stanford Univ., Stanford, Calif.

[32]

MURATA, T. 1989. Petri nets: Properties, analysis and applications. Proc. IEEE 77, 4 (Apr.), 541-580.

[33]

PETERSON, J.L. 1981. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, N.J.

[34]

PINTER, S. S. AND WOLPER, P. 1984. A temporal logic for reasoning about partially ordered computations. In Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing. ACM, New York.

[35]

PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 46-67.2

[36]

REISIG, W. 1985. Petri Nets: An Introduction. Springer-Verlag, Berlin.

[37]

SHNEIDERMAN, B. 1987. User interface design for the Hyperties electronic encyclopedia. In Proceedings of Hypertext '87 (Nov.). 189-194.

[38]

SINACHOPOULOS, A. 1989. Logics for Petri-nets: Partial order logics, branching time logics and how to distinguish between them. Petri Net Newsl. 3, 8 (Aug.), 9-14.

[39]

STOTTS, D. AND FURUTA, R. 1990a. Browsing parallel process networks. J. Parallel Distrib. Comput. 9, 2, 224-235.

[40]

STOTTS, P. D. AND FURUTA, R. 1989. Petri-net-based hypertext: Document structure with browsing semantics. ACM Trans. Inf. Syst. 7, 1 (Jan.), 3-29.

[41]

STOTTS, P. D. AND FURUTA, R. 1990b. Temporal hyperprogramming. J. Visual Lang. Cornput. 1, 3, 237-253.

[42]

STOTTS, P. D., FURUTA, R., AND RUIZ, J.C. 1992. Hyperdocuments as automata: Trace-based browsing property verification. In Proceedings of the ACM Conference on Hypertext (ECHT '92), D. Lucarella, J. Nanard, M. Nanard, and P. Paolini, Eds. ACM Press, New York, 272-281.

[43]

WOLPER, Z. 1981. Temporal logic can be more expressive. In Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science. IEEE, New York, 340-348.

[44]

ZELLWEGER, P.T. 1988. Active paths through multimedia documents. In Document Manipulation and Typography, J. C. van Vliet, Ed. Cambridge University Press, New York, 19-34. Also in Proceedings of the International Conference on Electronic Publishing, Document Manipulation, and Typography (Nice, France, April 20-22).

Cited By

Bocić IBultan TUchitel SOrso ARobillard M(2017)Symbolic model extraction for web application verificationProceedings of the 39th International Conference on Software Engineering10.1109/ICSE.2017.72(724-734)Online publication date: 20-May-2017
https://dl.acm.org/doi/10.1109/ICSE.2017.72
Nijjar JBocić IBultan T(2015)Data Model Property Inference, Verification, and Repair for Web ApplicationsACM Transactions on Software Engineering and Methodology10.1145/269969124:4(1-27)Online publication date: 2-Sep-2015
https://dl.acm.org/doi/10.1145/2699691
Bocić IBultan TJalote PBriand LHoek A(2014)Inductive verification of data model invariants for web applicationsProceedings of the 36th International Conference on Software Engineering10.1145/2568225.2568281(620-631)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2568225.2568281
Show More Cited By

Index Terms

Recommendations

Model checking cobweb protocols for verification of HTML frames behavior
WWW '02: Proceedings of the 11th international conference on World Wide Web

HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document editors) to verify that complex frame construction exhibits the intended ...
Formal specification and verification of a coordination protocol for an automated air traffic control system

Safe separation between aircraft is the primary consideration in air traffic control. To achieve the required level of assurance for this safety-critical application, the Automated Airspace Concept (AAC) proposes three levels of conflict detection and ...
Another Look at LTL Model Checking

We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a {\em symbolic} LTL model checker that appears to be quite efficient in practice. In particular, we ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information Systems

ACM Transactions on Information Systems Volume 16, Issue 1

Jan. 1998

100 pages

ISSN:1046-8188

EISSN:1558-2868

DOI:10.1145/267954

Editor:
Robert B. Allen
Bellcore, Morristown, NJ

Issue’s Table of Contents

Copyright © 1998 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1998

Published in TOIS Volume 16, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
609
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)12

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bocić IBultan TUchitel SOrso ARobillard M(2017)Symbolic model extraction for web application verificationProceedings of the 39th International Conference on Software Engineering10.1109/ICSE.2017.72(724-734)Online publication date: 20-May-2017
https://dl.acm.org/doi/10.1109/ICSE.2017.72
Nijjar JBocić IBultan T(2015)Data Model Property Inference, Verification, and Repair for Web ApplicationsACM Transactions on Software Engineering and Methodology10.1145/269969124:4(1-27)Online publication date: 2-Sep-2015
https://dl.acm.org/doi/10.1145/2699691
Bocić IBultan TJalote PBriand LHoek A(2014)Inductive verification of data model invariants for web applicationsProceedings of the 36th International Conference on Software Engineering10.1145/2568225.2568281(620-631)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2568225.2568281
Cortés HNavarro A(2014)NMMp: A Model-Driven UML Extension for the Description of Navigation Maps for Web ApplicationsInternational Journal of Software Engineering and Knowledge Engineering10.1142/S021819401450015624:03(391-417)Online publication date: Apr-2014
https://doi.org/10.1142/S0218194014500156
Hallé SBreton GMaronnaud FMassé AGaboury S(2014)Exhaustive Exploration of Ajax Web Applications with Selective JumpingProceedings of the 2014 IEEE International Conference on Software Testing, Verification, and Validation Workshops10.1109/ICSTW.2014.26(243-252)Online publication date: 31-Mar-2014
https://dl.acm.org/doi/10.1109/ICSTW.2014.26
Wusheng WWeiping LZhonghai WZhichao Z(2014)Petri Net-Based Context-Aware Service System ModellingProceedings of the 2014 International Conference on Service Sciences10.1109/ICSS.2014.14(60-65)Online publication date: 22-May-2014
https://dl.acm.org/doi/10.1109/ICSS.2014.14
Besson JLupeikienė AMedvedev V(2012)Comparing Real and Intended System UsagesInformatica10.5555/2699267.269926923:2(191-201)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.5555/2699267.2699269
Zuzak IBudiselic IDelac G(2011)A finite-state machine approach for modeling and analyzing restful systemsJournal of Web Engineering10.5555/2230856.223085910:4(353-390)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.5555/2230856.2230859
Zuzak IBudiselic IDelac G(2011)Formal modeling of RESTful systems using finite-state machinesProceedings of the 11th international conference on Web engineering10.5555/2027776.2027802(346-360)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.5555/2027776.2027802
Nijjar JBultan TDwyer MTip F(2011)Bounded verification of Ruby on Rails data modelsProceedings of the 2011 International Symposium on Software Testing and Analysis10.1145/2001420.2001429(67-77)Online publication date: 17-Jul-2011
https://dl.acm.org/doi/10.1145/2001420.2001429
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents