ACM Home Page
Please provide us with feedback. Feedback
An analyzer for extended compositional process algebras
Full text PdfPdf (77 KB)
Source
International Conference on Software Engineering archive
Companion of the 30th international conference on Software engineering table of contents
Leipzig, Germany
SESSION: Informal research demonstrations table of contents
Pages 919-920  
Year of Publication: 2008
ISBN:978-1-60558-079-1
Authors
Yang Liu  National University of Singapore, Singapore, Singapore
Jun Sun  National University of Singapore, Singapore, Singapore
Jin Song Dong  National University of Singapore, Singapore, Singapore
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1370175.1370187
What is a DOI?

ABSTRACT

System simulation and verification become more demanding as complexity grows. PAT is developed as an interactive system to support composing, simulating and reasoning of process algebra with various extensions like fairness events, global variables and parameterized processes. PAT provides user friendly interfaces to support system modeling and simulation. Furthermore, it embeds two complementing model checking techniques catering for different systems and properties, namely, an explicit on-the-fly model checker which is designed to verify event-based fairness constraints efficiently and a bounded model checker based on state-of-the-art SAT solvers. The model checkers are capable of proving reachability, deadlock-freeness and the full set of Linear Temporal Logic (LTL) properties. Compared to other model checkers, PAT has two key advantages. Firstly, it supports an intuitive annotation of fairness constraints so that it handles large number of fairness constraints efficiently. Secondly, the compositional encoding of system models as SAT problems allows us to handle compositional process algebra effectively. The experimental results show that PAT is capable of verifying systems with large number of states and outperforms the state-of-the-art model checkers in some cases.


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
J. S. Dong, P. Hao, J. Sun, and X. Zhang. A Reasoning Method for Timed CSP Based on Constraint Solving. In Proc. of the 8th Inter. Conf. on Formal Engineering Methods (ICFEM 2006), pages 342--359. Springer, 2006.
 
2
 
3
 
4
 
5
J. Sun, Y. Liu, and J. S. Dong. A Simulator and Model Checker for Extended CSP. http://www.comp.nus.edu.sg/~liuyang/pat/, 2008.

Collaborative Colleagues:
Yang Liu: colleagues
Jun Sun: colleagues
Jin Song Dong: colleagues