Symbolic reaching definitions analysis of Ada programs-Reference-Cited by-同舟云学术

Symbolic reaching definitions analysis of Ada programs

Published:1998 Issue: Volume: Page:238-250
ISSN:0302-9743
Container-title:Reliable Software Technologies — Ada-Europe
language:
Short-container-title:

Author:

Blieberger Johann,Burgstaller Bernd

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055009

Reference12 articles.

1. A. V. Aho, R. Seti, and J. D. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley, Reading, MA, 1986.

2. J.-F. Bergeretti and B. A. Carré. Information-flow and data-flow analysis of while-programs. ACM Trans. Prog. Lang. Sys., 7(1):37–61, 1985.

3. J. Blieberger. Data-flow frameworks for worst-case execution time analysis. (submitted), 1997.

4. R. Chapman, A. Burns, and A. Wellings. Combining static worst-case timing analysis and program proof. Real-Time Systems, 11(2):145–171, 1996.

5. T. E. Cheatham, G. H. Hollowy, and J. A. Townley. Symbolic evaluation and the analysis of programs. IEEE Trans. on Software Engineering, 5(4):403–417, July 1979.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Practical Binary Code Similarity Detection: Vulnerability Verification via Patch Semantic Analysis;ACM Transactions on Software Engineering and Methodology;2023-09-30

2. Eliminating Redundant Range Checks in GNAT Using Symbolic Evaluation;Lecture Notes in Computer Science;2003

3. Real-Time Properties of Indirect Recursive Procedures;Information and Computation;2001-12

4. Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs;Reliable Software Technologies Ada-Europe 2000;2000

5. Interprocedural Symbolic Evaluation of Ada Programs with Aliases;Reliable Software Technologies — Ada-Europe’ 99;1999