Author:
Evangelista Sami,Kaiser Claude,Pradat-Peyre Jean-François,Rousseau Pierre
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. J. Blieberger, B. Burgstaller, and B. Scholz. Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In Proc. of the Ada-Europe International Conference on Reliable Software Technologies, Potsdam, Germany, 2000.
2. Lect Notes Comput Sci;G. Berthelot,1985
3. K. Barkaoui, C. Kaiser, and J.F. Pradat-Peyre. Petri nets based proofs of Ada95 solution for preference control. In Proc. of the Asia Pacific Software Engineering Conference (APSEC) and International Computer Science Conference (ICSC), Hong-Kong, 1997.
4. Lect Notes Comput Sci;E. Bruneton,1999
5. A. Burns and A. J. Wellings. How to verify concurrent Ada programs: the application of model checking. ACM SIGADA Ada Letters, 19(2):78–83, 1999.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Safe Parallelism: Compiler Analysis Techniques for Ada and OpenMP;Reliable Software Technologies – Ada-Europe 2018;2018
2. Solving the ignoring problem for partial order reduction;International Journal on Software Tools for Technology Transfer;2010-02-03
3. Distributed Colored Petri Net Model-Checking with Cyclades;Formal Methods: Applications and Technology;2007
4. A New Approach for Concurrent Program Slicing;Lecture Notes in Computer Science;2006
5. Dynamic Tasks Verification with Quasar;Reliable Software Technology – Ada-Europe 2005;2005