Program slicing of hardware description languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1703, Issue , 1999, Pages 298-313

  Clarke, E M ^a,f   Fujita, M ^c   Rajan, S P ^c   Reps, T ^d,g   Shankar, S ^a,e,f   Teitelbaum, T ^b,d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c FUJITSU LABORATORIES OF AMERICA   (United States)

^d GRAMMATECH INC   (United States)

^e CITY UNIVERSITY OF NEW YORK   (United States)

^f Verysys Design Automation   (United States)

^g UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; DESIGN; FORMAL VERIFICATION; HARDWARE; PROGRAM PROCESSORS; RECONFIGURABLE HARDWARE; SEMANTICS;

AUTOMATIC PROGRAMS; EXECUTION SEMANTICS; INTER-PROCEDURAL; PROGRAM SLICING; REDUCTION TECHNIQUES; SOURCE CODES; STATIC PROGRAM ANALYSIS; VHDL PROGRAMS;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 84958626871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48153-2_22     Document Type: Conference Paper

References (29)

1. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
2. D. Déharbe, S. Shankar, and E.M. Clarke. Model checking VHDL with CV. In Formal Methods in Computer Aided Design (FMCAD), page to appear, 1997.
3. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4):352-357, 1984.
4. M. Weiser. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, 1979.
5. K.J. Ottenstein and L.M. Ottenstein. The program dependence graph in a software development environment. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 177-184, New York, NY, 1984. ACM Press.
6. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 3(9):319-349, 1987.
7. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, January 1990.
8. S. Horwitz, T. Reps, M. Sagiv, and G. Rosay. Speeding up slicing. In Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 11-20, New York, NY, December 1994. ACM Press.
9. F. Tip. A survey of program slicing techniques. Technical Report CS-R9438, Centrum voor Wiskunde en Informatica, 1994.
10. D. Binkley and K. Gallagher. Program slicing. In M. Zelkowitz, editor, Advances in Computers, Vol. 43. Academic Press, San Diego, CA, 1996.
11. K.B. Gallagher and J.R. Lyle. Using program slicing in software maintenance. IEEE Transactions on Software Engineering, SE-17(8):751-761, August 1991.
12. J. Lyle and M. Weiser. Experiments on slicing-based debugging tools. In Proceedings of the First Conference on Empirical Studies of Programming, June 1986.
13. D. Binkley. Using semantic differencing to reduce the cost of regression testing. In Proceedings of the 1992 Conference on Software Maintenance (Orlando, FL, November 9-12, 1992), pages 41-50, 1992.
14. S. Bates and S. Horwitz. Incremental program testing using program dependence graphs. In ACM Symposium on Principles of Programming Languages, pages 384-396, 1993.
15. S. Horwitz, J. Prins, and T. Reps. Integrating non-interfering versions of programs. ACM Transactions on Programming Languages and Systems, 11(3):345-387, July 1989.
16. S. Horwitz. Identifying the semantic and textual differences between two versions of a program. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 234-245, 1990.
17. T. Reps and T. Turnidge. Program specialization via program slicing. In O. Danvy, R. Glueck, and P. Thiemann, editors, Proc. of the Dagstuhl Seminar on Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, pages 409-429, Schloss Dagstuhl, Wadern, Germany, February 1996. Springer-Verlag.
18. J.Q. Ning, A. Engberts, and W. Kozaczynski. Automated support for legacy code understanding. Communications of the ACM, 37(5):50-57, May 1994.
19. D. Jackson and E.J. Rollins. A new model of program dependences for reverse engineering. SIGSOFT 94: Proceedings of the Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, (New Orleans, LA, December 7-9, 1994), ACM SIGSOFT Software Engineering Notes, 19, December 1994.
20. T. Reps and G. Rosay. Precise interprocedural chopping. SIGSOFT 95: Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, (Washington, DC, October 10-13, 1995), ACM SIGSOFT Software Engineering Notes, 20(4), 1995.
21. D. Binkley. Precise executable interprocedural slices. ACM Letters on Programming Languages and Systems, 2:31-45, 1993.
22. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, SE- 10(4):352-357, July 1984.
23. IEEE. IEEE Standard VHDL Language Reference Manual, 1987. Std 1076-1987.
24. E.M. Clarke, M. Fujita, S.P. Rajan, T. Reps, S. Shankar, and T. Teitelbaum. Program slicing of hardware description languages. Technical Report CMU-CS- 99-103, Carnegie Mellon University, 1999.
25. M. Iwaihara, M. Nomura, S. Ichinose, and H. Yasuura. Program slicing on VHDL descriptions and its applications. In Asian Pacific Conference on Hardware Description Languages (APCHDL), pages 132-139, 1996.
26. S. Ichinose, M. Iwaihara, and H. Yasuura. Program slicing on VHDL descriptions and its evaluation. Technical report, Kyushu University, 1998.
27. L. Millett and T. Teitelbaum. Slicing promela and its applications to protocol understanding and analysis. In 4th International SPIN Workshop, pages 75-83, 1998.
28. Robert P. Kurshan. “Computer-Aided Verification of Coordinating Processes”. Princeton University Press, 1994.
29. T. Reps. Program analysis via graph reachability. In Proc. of ILPS’97: Int. Logic Programming Symposium, pages 5-19, Cambridge, MA, 1997. M.I.T.