Process algebra model of Ada protected objects
Authors: 
Yuan Liu, Baowen XuAuthors Info & Claims
Yuan Liu, Baowen XuAuthors Info & ClaimsAbstract
The feasibility and efficiency of analyzing concurrent programs mostly relies on the programs' representations. So modeling concurrent programs in a proper and suitable way is very important. Protected objects, which have been introduced in Ada95, are of significant importance in concurrent programming language. In this paper, process algebra is used to model Ada95 protected objects in a neat and tidy way. Because using process algebra can simplify process composition and conveniently hide internal details, it becomes easy to analyze Ada concurrent programs with protected objects and to combat problems of state explosion. In addition, many mechanisms similar to protected objects can be modeled in this way. With these models, many analyses, such as model checking, can be performed.
References
[1]
ISO/IEC 8652:1995(E). Ada Reference Manual---Language and Standard Libraries.]]
[2]
J. Blieberger, B. Burgstaller, B. Scholz. Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In Proceedings of the Ada Europe International Conference on Reliable Software Technologies, Potsdam, Germany, Springer, June 2000, pp. 225--237.]]
[3]
R. Gedela and S. M. Shatz. Formal Modeling of Advanced Tasking in Ada: A Petri Net Perspective. 2nd International Workshop on Software Engineering for Parallel and Distributed Systems (PDSE-97), Boston, May 1997, pp. 4--14.]]
[4]
Ravi K. Gedela, Sol M. Shatz Haiping Xu. Compositional Petri Net Models of Advanced Tasking in Ada-95. Computer Language, July 1999, 25(2), pp. 55--87.]]
[5]
K. Lundqvist, L. Asplund, and S. Michell. A Formal Model of the Ada Ravenscar Tasking Profile; Protected Objects. In Proceedings of the Ada Europe Conference on Reliable Software Technologies, LNCS 1622, 1999, pp. 12--25.]]
[6]
J. C. M. Baeten, W. P. Weijland. Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990.]]
[7]
J. Baeton, C. Verhoef, Concrete Process Algebra. Handbook of Logic in Computer Science, Oxford University Press, 1995, pp. 149--268.]]
[8]
A. H. M ter Hofstede. Task Structure Semantics through Process Algebra. Software Engineering Journal, January 1993, 8(1), pp. 14--20.]]
[9]
John Barnes. Programming in Ada 95. Addison-Wesley Publishing Company, Boston, USA, 1995.]]
[10]
M. Kwiatkowska. Model Checking for Probability and Time: From Theory to Practice (Invited paper). In Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS 2003), IEEE Computer Society Press, 2003, pp. 351--360.]]
[11]
H. Hermanns, J. P. Katoen, J. Meyer-Kayser, M. Siegle. Towards Model Checking Stochastic Process Algebra. In Proceedings of Integrated Formal Methods, LNCS 1945, 2000, pp. 420--439.]]
[12]
B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, C. Baier. Model-checking Performability Properties. In Proceedings of International IEEE Conference on Dependable Systems and Networks (DSN), IEEE CS Press, Washington (D.C.), USA, 2002, pp. 103--112.]]
[13]
D. Atiya, S. King, and J. C. P. Woodcock. A Circus semantics for Ravenscar protected objects. In proceedings of Formal Methods 2003, September 2003, pp. 617--635.]]
[14]
W. J. Yeh, M. Young. Re-Designing Tasking Structures of Ada Programs for Analysis: A Case Study. Software Testing, Verification and Reliability, December 1994, pp. 223--253.]]
[15]
Zhenqiang Chen, Baowen Xu, Huiming Yu. Detecting Concurrently Executed Pairs of Statements Using Adapted MHP Algorithm. ACM SIGAda 2001, Ada Letters, 2001, 21(4), pp. 107--113.]]
[16]
Zhenqiang Chen, Baowen Xu, Hongji Yang, Jianjun Zhao. Concurrent Ada Dead Statements Detection. Information and Software Technology, 2002, 44(13), pp. 733--741.]]
[17]
Zhenqiang Chen, Baowen Xu, Hongji Yang, Jianjun Zhao. Static Dependency Analysis for Concurrent Ada 95 Programs. In Proceedings of Ada Europe Conference, LNCS 2361, 2002, pp. 219--230.]]
[18]
Yuan Liu, Baowen Xu, Zhenqiang Chen. Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process Algebra. In Proceedings of 4th International Conference on Formal Engineering Methods, LNCS 2495, 2002, pp. 262--27.]]
Index Terms
- Process algebra model of Ada protected objects
Index terms have been assigned to the content through auto-classification.
Recommendations
Deadlock detection in distribution object systems
ESEC/FSE-9: Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineeringThe behaviour of a distributed system is largely determined by the use of synchronization primitives and threading policies of the underlying middleware. The inherent parallel nature of distributed systems may cause liveness problems, such as deadlocks ...
Model Checking Process Algebra of Communicating Resources for Real-Time Systems
AGILE '14: Proceedings of the 2014 Agile ConferenceThis paper presents a new process algebra, called PACOR, for real-time systems which deals with resource constrained timed behavior as an improved version of the ACSR algebra. We define PACOR as a Process Algebra of Communicating Resources which allows ...
Process Algebra with Strategic Interleaving
In process algebras such as ACP (Algebra of Communicating Processes), parallel processes are considered to be interleaved in an arbitrary way. In the case of multi-threading as found in contemporary programming languages, parallel processes are actually ...
Comments
Information & Contributors
Information
Published In
Copyright © 2004 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 2004
Published in SIGPLAN Volume 39, Issue 2
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 300Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in