Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Cyrano Ruiz Cabarrus

dblp:10/3564 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automated reasoning and model checking · 62% Logic in computer science · 38%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › document organization
hypertext
0.011998
Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking · ACM Trans. Inf. Syst. 1998
Logic in computer science › temporal logic
branching-time temporal logic
0.011998
Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking · ACM Trans. Inf. Syst. 1998
Logic in computer science
temporal logic
0.011998
Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking · ACM Trans. Inf. Syst. 1998

Methods — techniques the papers use, named apart from their topics

model checking · 0.0links-automaton · 0.0HTL* · 0.0
YearPublicationVenuePosition
1998 Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking
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.
P. David Stotts, Richard Furuta, Cyrano Ruiz Cabarrus
ACM Trans. Inf. Syst.3