Automatic generation of hints for symbolic traversal

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

Volumn 3725 LNCS, Issue , 2005, Pages 207-221

  Ward, David ^a   Somenzi, Fabio ^b  

^a IBM   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; CALCULATIONS; CIRCUIT THEORY; COMPUTER HARDWARE; CONSTRAINT THEORY; CONTROL SYSTEMS; FINITE AUTOMATA; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; STATE SPACE METHODS;

AUTOMATIC GENERATION; FINITE TRANSITION SYSTEM; HARDWARE VERIFICATION; SYMBOLIC TRAVERSAL;

AUTOMATIC PROGRAMMING;

EID: 33646462739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_17     Document Type: Conference Paper

References (15)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. R. K. Brayton et al. VIS. In Formal Methods in Computer Aided Design, pages 248-256. Springer-Verlag, Berlin, Nov. 1996. LNCS 1166.
3. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. An Introduction to Algorithms. McGraw-Hill, New York, 1990.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by constructions or approximation of fixpoints. In Proceedings of the ACM Symposium on the Principles of Programming Languages, pages 238-250, 1977.
6. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems (TOPLAS), 9(3):319-349, July 1987.
7. J. Gustafsson, B. Lisper, R. Kirner, and P. Puschner. Input-dependency analysis for hard real-time software. In International Workshop on Object-Oriented Real-Time Dependable System, Oct. 2004.
8. S. Horwitz and T. Reps. The use of program dependence graphs in software engineering. In Fourteenth International Conference on Software Engineering, 1992.
9. ITC'99 benchmark home page, http://www.cerc.utexas.edu/itc99-benchmarks/ bench.html.
10. D. B. Johnson. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, 4:77-84, 1975.
11. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994.
12. K. L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In A. J. Hu and M. Y. Vardi, editors, Tenth Conference on Computer Aided Verification (CAV'98), pages 110-121. Springer-Verlag, Berlin, 1998. LNCS 1427.
13. K. J. Ottenstein and L. M. Ottenstein. The program dependence graph in a software development environment. In Symposium on Practical Software Development Environments, pages 177-184, New York, NY, 1984.
14. K. Ravi and F. Somenzi. Hints to accelerate symbolic traversal. In Correct Hardware Design and Verification Methods (CHARME'99), pages 250-264, Berlin, Sept. 1999. Springer-Verlag. LNCS 1703.
15. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4):352-357, 1984.