| Evaluating and improving the automatic analysis of implicit invocation systems |
| Full text |
Pdf
(173 KB)
|
| Source
|
Foundations of Software Engineering
archive
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
table of contents
Helsinki, Finland
SESSION: Software architectures, patterns, and frameworks
table of contents
Pages: 78 - 87
Year of Publication: 2003
ISBN:1-58113-743-5
Also published in ...
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 28, Citation Count: 4
|
|
|
ABSTRACT
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially difficult to analyze software systems developed with the implicit invocation architectural style because the loose coupling of their components increases the size of the finite state model. In this paper we provide insight into the larger problem of how to make model checking a better analysis and verification tool for software systems. Specifically, we will extend an existing approach to model checking implicit invocation to allow for the modeling of larger and more realistic systems. Our focus will be on improving the representation of events, event delivery policies and event-method bindings. We also evaluate our technique on two non-trivial examples. In one of our examples, we will show how with iterative analysis a system parameter can be chosen to meet the appropriate system requirements.
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
|
James C. Corbett , Matthew B. Dwyer , John Hatcliff , Shawn Laubach , Corina S. Păsăreanu , Robby , Hongjun Zheng, Bandera: extracting finite-state models from Java source code, Proceedings of the 22nd international conference on Software engineering, p.439-448, June 04-11, 2000, Limerick, Ireland
[doi> 10.1145/337180.337234]
|
 |
2
|
D. Garlan , S. Jha , D. Notkin , J. Dingel, Reasoning about implicit invocation, Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering, p.209-221, November 01-05, 1998, Lake Buena Vista, Florida, United States
|
| |
3
|
J. Dingel, D. Garlan, S. Jha, and D. Notkin. Towards a formal treatment of implicit invocation using rely/guarantee reasoning. Formal Aspects of Computing, 10:193--213, 1998.
|
| |
4
|
|
| |
5
|
D. Garlan, S. Khersonsky, and J. S. Kim. Model checking publish-subscribe systems. In Proc. of the 10th Int'l SPIN Workshop on Model Checking of Software, May 2003.
|
| |
6
|
|
| |
7
|
K. L. McMillan. The SMV Language. Cadence Berkeley Labs, Mar. 1999.
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
 |
11
|
|
 |
12
|
|
CITED BY 4
|
|
|
|
|
|
|
|
|
|
|
Luciano Baresi , Giorgio Gerosa , Carlo Ghezzi , Luca Mottola, Playing with time in publish-subscribe using a domain-specific model checker, Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, p.55-62, September 03-04, 2007, Dubrovnik, Croatia
|
|