2003
DOI: 10.1145/780822.781152
|View full text |Cite
|
Sign up to set email alerts
|

Debugging temporal specifications with concept analysis

Abstract: Program verification tools (such as model checkers and static analyzers) can find many errors in programs. These tools need formal specifications of correct program behavior, but writing a correct specification is difficult, just as writing a correct program is difficult. Thus, just as we need methods for debugging programs, we need methods for debugging specifications.This paper describes a novel method for debugging formal, temporal specifications. Our method exploits the short program execution traces that … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(25 citation statements)
references
References 18 publications
0
25
0
Order By: Relevance
“…The full concept lattice is depicted on the left side of Figure 1 Snelting first introduced the idea of concept analysis for use in software engineering tasks, specifically for configuration analysis [32]. Concept analysis has also been applied to evaluating class hierarchies [33], debugging temporal specifications [34], redocumentation [35], and recovering components [36]- [39]. Ball introduced the use of concept analysis of test coverage data to compute dynamic analogs to static control flow relationships [40].…”
Section: Concept Analysismentioning
confidence: 99%
“…The full concept lattice is depicted on the left side of Figure 1 Snelting first introduced the idea of concept analysis for use in software engineering tasks, specifically for configuration analysis [32]. Concept analysis has also been applied to evaluating class hierarchies [33], debugging temporal specifications [34], redocumentation [35], and recovering components [36]- [39]. Ball introduced the use of concept analysis of test coverage data to compute dynamic analogs to static control flow relationships [40].…”
Section: Concept Analysismentioning
confidence: 99%
“…False is defined as ⊥ ≡ ¬ . In this paper, we assume that Bounded-MITL (3,2) formula is in Negation Normal Form (NNF) 4 where the negation operation is only applied on atomic propositions. NNF is easily obtainable by applying DeMorgan's Law, i.e ¬3 I ϕ ≡ 2 I ¬ϕ and ¬2 I ϕ ≡ 3 I ¬ϕ.…”
Section: A Metric Interval Temporal Logicmentioning
confidence: 99%
“…If the top operation of ϕ is a temporal operator (2 I , 3 I ), then the effective interval is modified according to Definition 10 and the interval I ← I ⊕ I is propagated to the subformulas of ϕ. For example, assume that the MITL specification is ϕ RR = 2 [1,2] (3 [3,5] b ⇒ (2 [4,6] (c ⇒ 3 [0,2] d))). The specification ϕ has two antecedents, α 1 = 3 [3,5] [5,8], respectively.…”
Section: Definition 8 (Request-response Mitl)mentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, we describe our work in analyzing user session data. By making minimal configuration changes to a web server, data can be collected as a set of user sessions, each session being a sequence of URL and namevalue pairs 1 . The collection of logged user sessions can be viewed as a set of use cases where a use case is a behaviorally related sequence of events performed by the user through a dialogue with the system [11].…”
Section: Introductionmentioning
confidence: 99%