2002
DOI: 10.1007/3-540-45619-8_3
|View full text |Cite
|
Sign up to set email alerts
|

An Abductive Approach for Analysing Event-Based Requirements Specifications

Abstract: Abstract. We present a logic and logic programming based approach for analysing event-based requirements specifications given in terms of a system's reaction to events and safety properties. The approach uses a variant of Kowalski and Sergot's Event Calculus to represent such specifications declaratively and an abductive reasoning mechanism for analysing safety properties. Given a system description and a safety property, the abductive mechanism is able to identify a complete set of counterexamples (if any exi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
49
0

Year Published

2002
2002
2014
2014

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 42 publications
(49 citation statements)
references
References 25 publications
0
49
0
Order By: Relevance
“…Several authors have proposed using logic programming to reason about software behaviour described in other formalisms [1,2,25].…”
Section: Conclusion and Related And Future Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Several authors have proposed using logic programming to reason about software behaviour described in other formalisms [1,2,25].…”
Section: Conclusion and Related And Future Workmentioning
confidence: 99%
“…Further, the formalism and semantics used here allow the modelling of concurrency without the need to introduce special actions explicitly in the language (e.g., 'tick' actions in [19]), removing one threat to scalability. The work in [25] for generating Event Calculus logic programs from descriptions expressed in a tabular specification language and applying abductive logic programming to discover violations to a restricted class of invariants, namely 'single-state' invariants. That work finds a restricted class of violations, and cannot repair specifications.…”
Section: Conclusion and Related And Future Workmentioning
confidence: 99%
“…Since its initial presentation [4], a number of variations of the Event Calculus have been presented in the literature [6]. In this work we use the form presented in [7], consisting of (i) a set of time points (that can be mapped to the non-negative integers); (ii) a set of properties that can vary over the lifetime of the system, called fluents; and (iii) a set of event types. In addition the language includes a number of base predicates, initiates, terminates, holdsAt, happens, which are used to define some auxiliary predicates; and domain independent axioms.…”
Section: Event Calculusmentioning
confidence: 99%
“…Since its initial presentation [6], a number of variations of the Event Calculus have been presented in the literature [11]. In this work we use the form presented in [12], consisting of (i) a set of time points (that can be mapped to the non-negative integers); (ii) a set of properties that can vary over the lifetime of the system, called fluents; and (iii) a set of event types. In addition the language includes a number of base predicates, initiates, terminates, holdsAt, happens, which are used to define some auxiliary predicates; and domain independent axioms.…”
Section: Event Calculus and Abductive Reasoningmentioning
confidence: 99%
“…The work described in [12] outlines how abduction can be used in conjunction with Event Calculus to analyse requirements specifications and presents a specialised set of Event Calculus axioms that reduce the computational complexity of the abductive proof procedure.…”
Section: Event Calculus and Abductive Reasoningmentioning
confidence: 99%