ACM Home Page
Please provide us with feedback. Feedback
Verifying properties of process definitions
Full text PdfPdf (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
Jamieson M. Cobleigh  Dept. of Computer Science, Univ. of Massachusetts, Amherst, MA
Lori A. Clark  Dept. of Computer Science, Univ. of Massachusetts, Amherst, MA
Leon J. Osterweil  Dept. of Computer Science, Univ. of Massachusetts, Amherst, MA
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 25,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/347324.348876
What is a DOI?

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
 
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
 
13
 
14


Collaborative Colleagues:
Jamieson M. Cobleigh: colleagues
Lori A. Clark: colleagues
Leon J. Osterweil: colleagues

Peer to Peer - Readers of this Article have also read: