Structured Counterexamples for the Temporal Description Logic ALCCTL

Weitl, Franz; Nakajima, Shinichi; Freitag, Burkhard

doi:10.1109/sefm.2010.36

Cited by 5 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, we extend the case study in [27] as follows: 1) we demonstrate that the response time of the algorithm is sufficiently low to provide smooth user interaction even for web documents with several thousands of web pages; 2) we summarize the results of a new study on the scalability of the approach for documents up to 4000 pages. The rest of the paper is organized as follows: first, the research issues of this paper are presented.…”

Section: Support Of User Interactionmentioning

confidence: 92%

“…We disregard quantified roles in this paper merely because of space limitations. The algorithm presented in this paper can be extended to handle quantified roles by integrating the respective parts of the algorithm in [27].…”

Section: Q3)mentioning

confidence: 99%

“…ALC CTL has been applied for verifying properties of web documents [26] and technical manuals [21,23]. The proposed algorithm builds upon the concept of evidence tree introduced in [27]. It extends the algorithm presented in [27] in the following two aspects:…”

Section: Introductionmentioning

confidence: 99%

“…The proposed algorithm builds upon the concept of evidence tree introduced in [27]. It extends the algorithm presented in [27] in the following two aspects:…”

Section: Introductionmentioning

confidence: 99%

“…A preliminary, non-incremental version of Algorithm 10 has been proven to be sound for ALC CTL and complete for a larger fragment of ALC CTL [27] than previous counterexample algorithms [6,7,18]. Function getEvSet terminates because each calculated set is finite.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Incremental Construction of Counterexamples in Model Checking Web Documents

Weitl

Nakajima

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

A new algorithm for incrementally generating counterexamples for the temporal description logic ALC CTL is presented. ALC CTL is a decidable combination of the description logic ALC and computation tree logic CTL that is expressive for content-and structure-related properties of web documents being verified by model checking. In the case of a specification violation, existing model checkers provide a single counterexample which may be large and complex. We extend existing algorithms for generating counterexamples in two ways. First, a coarse counterexample is generated initially that can be refined subsequently to the desired level of detail in an incremental manner. Second, the user can choose where and in which way a counterexample is refined. This enables the interactive step-by-step analysis of error scenarios according to the user's interest.We demonstrate in a case study on a web-based training document that the proposed approach reveals more errors and explains the cause of errors more precisely than the counterexamples of existing model checkers. In addition, we demonstrate that the proposed algorithm is sufficiently fast to enable smooth interaction even in the case of large documents.

show abstract

Section: Support Of User Interactionmentioning

confidence: 92%

Section: Q3)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…The proposed algorithm builds upon the concept of evidence tree introduced in [27]. It extends the algorithm presented in [27] in the following two aspects:…”

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations