| Verifying properties of process definitions |
| Full text |
Pdf
(216 KB)
|
| Source
|
International Symposium on Software Testing and Analysis
archive
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
table of contents
Portland, Oregon, United States
Pages: 96 - 101
Year of Publication: 2000
ISBN:1-58113-266-2
Also published in ...
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 6
|
|
|
ABSTRACT
It seems important that the complex processes that synergize humans and computers to solve widening classes of societal problems be subjected to rigorous analysis. One approach is to use a process definition language to specify these processes and to then use analysis techniques to evaluate these definitions for important correctness properties. Because humans demand flexibility in their participation in complex processes, process definition languages must incorporate complicated control structures, such as various concurrency, choice, reactive control, and exception mechanisms. The underlying complexity of these control abstractions, however, often confounds the users' intuitions as well as complicates any analysis.Thus, the control abstraction complexity in process definition languages presents analysis challenges beyond those posed by traditional programming languages. This paper explores some of the difficulties of analyzing process definitions. We explore issues arising when applying the FLAVERS finite state verification system to processes written in the Little-JIL process definition language and illustrate these issues using a realistic auction example. Although we employ a particular process definition language and analysis technique, our results seem more generally applicable.
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
|
|
| |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
C. Fernstr~ om. PROCESS WEAVER: Adding process support to UNIX. In Second Int. Conf. on the Software Process, pages 12-26, 1993.
|
| |
6
|
David Harel , Amir Pnueli , Hagi Lachover , Amnon Naamad , Michal Politi , Rivi Sherman , Aharon Shtull-Trauring , Mark Trakhtenbrot, STATEMATE: A Working Environment for the Development of Complex Reactive Systems, IEEE Transactions on Software Engineering, v.16 n.4, p.403-414, April 1990
[doi> 10.1109/32.54292]
|
| |
7
|
|
 |
8
|
|
| |
9
|
M. Kumar and S. I. Feldman. Internet auctions. TR, IBM Institute for Advanced Commerce, Nov 1998.
|
| |
10
|
|
| |
11
|
National Institute of Standards and Technology. Integration Definition For Function Modeling (IDEF0), 1993. Federal Information Processing Standards 183.
|
 |
12
|
Gleb Naumovich , George S. Avrunin , Lori A. Clarke, Data flow analysis for checking properties of concurrent Java programs, Proceedings of the 21st international conference on Software engineering, p.399-410, May 16-22, 1999, Los Angeles, California, United States
[doi> 10.1145/302405.302663]
|
| |
13
|
|
| |
14
|
|
CITED BY 6
|
|
Bin Chen , George S. Avrunin , Elizabeth A. Henneman , Lori A. Clarke , Leon J. Osterweil , Philip L. Henneman, Analyzing medical processes, Proceedings of the 30th international conference on Software engineering, May 10-18, 2008, Leipzig, Germany
|
|
|
Jamieson M. Cobleigh , Leon J. Osterweil , Alexander Wise , Barbara Staudt Lerner, Containment units: a hierarchically composable architecture for adaptive systems, Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering, November 18-22, 2002, Charleston, South Carolina, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|