ACM Home Page
Please provide us with feedback. Feedback
An automated approach to monitoring and diagnosing requirements
Full text PdfPdf (532 KB)
Source
Automated Software Engineering archive
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering table of contents
Atlanta, Georgia, USA
SESSION: Inception table of contents
Pages 293-302  
Year of Publication: 2007
ISBN:978-1-59593-882-4
Authors
Yiqiao Wang  University of Toronto, Toronto, ON, Canada
Sheila A. McIlraith  University of Toronto, Toronto, ON, Canada
Yijun Yu  Open University, Milton Keynes, United Kingdom
John Mylopoulos  University of Toronto, Toronto, ON, Canada
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 89,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1321631.1321675
What is a DOI?

ABSTRACT

Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Requirement Engineering literature. To address this problem, we propose a framework adapted from artificial intelligence theories of action and diagnosis. Specifically, the framework monitors the satisfaction of software requirements and generates log data at a level of granularity that can be tuned adaptively at runtime depending on monitored feedback. When errors are found, the framework diagnoses the denial of the requirements and identifies problematic components. To support diagnostic reasoning, we transform the diagnostic problem into apropositional satisfiability (SAT) problem that can be solved by existing SAT solvers. We preprocess log data into a compact propositional encoding that better scales with problem size. The proposed theoretical framework has been implemented as a diagnosing component that will return sound and complete diagnoses accounting for observed aberrant system behaviors. Our solution is illustrated with two medium-sized publicly available case studies: a Web-based email client and an ATM simulation. Our experimental results demonstrate the feasibility of scaling our approach to medium-size software systems


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Bjork. An ATM simulation. http://www.cs.gordon.edu/courses/cs211/atmexample.
 
2
R. Castello. Squirrel mail, http://www.squirrelmail.org/.
3
 
4
 
5
 
6
 
7
 
8
 
9
Gero Iwan, History-based diagnosis templates in the framework of the situation calculus, AI Communications, v.15 n.1, p.31-45, January 2002
 
10
 
11
D. Le Berre. A satisfiability library for java. http://www.sat4j.org/.
 
12
S. McIlraith. Explanatory diagnosis: Conjecturing actions to explain observations. In KR'98, pages 167--179, 1998.
13
 
14
 
15
 
16
 
17
 
18
L. Ryan. Efficient algorithms for clause-learning SAT solvers. Master's thesis, Simon Fraser University, 2004.
 
19
R. Sebastiani, P. Giorgini, and J. Mylopoulos. Simple and minimum-cost satisfiability for goal models. In CAiSE'04, volume 4, pages 20--33. Springer, 2004.
 
20
 
21
Y. Wang, Y. Yu, and J. Mylopoulos. Monitoring and diagnosing requirements. Technical report, University of Toronto, 2007. CSRG-555.
 
22
 
23


Collaborative Colleagues:
Yiqiao Wang: colleagues
Sheila A. McIlraith: colleagues
Yijun Yu: colleagues
John Mylopoulos: colleagues