Computational forensic techniques for intellectual property protection

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

Volumn 2137, Issue , 2001, Pages 66-81

  Wong, Jennifer L ^a   Kirovski, Darko ^b   Potkonjak, Miodrag ^a  

^a University of California   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; INTELLECTUAL PROPERTY;

BENCHMARK SELECTION; COMPUTATIONAL FORENSICS; DATA COLLECTION; HARDWARE/SOFTWARE DESIGN; INTELLECTUAL PROPERTY PROTECTION; IP PROTECTION; MOBILE CODES; OPTIMIZATION ALGORITHMS;

FORENSIC ENGINEERING;

EID: 84947291784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45496-9_6     Document Type: Conference Paper

References (34)

1. B. S. Baker and U. Manber. Deducing similarities in Java sources from byte-codes. USENIX Technical Conference, pp. 179-90, 1998.
2. R. J. Bayardo and R. Schrag. Using CSP look-back techniques to solve exceptionally hard SAT instances. Principles and Practice of Constraint Programming, pp. 46-60, 1996.
3. B. C. Behrens and R. R. Levary. Practical legal aspects of software reverse engineering. Comm. of the ACM, vol.41, (no.2), pp. 27-9, 1998.
4. D. Brelaz. New methods to color the vertices of a graph. Comm. of the ACM, vol.22, (no.4), pp. 251-6, 1979.
5. S. Brin, J. Davis, and H. Garcia-Molina. Copy detection mechanisms for digital documents. SIGMOD Record, vol.24, (no.2), pp. 398-409, 1995.
6. R. E. Bryant. Binary decision diagrams and beyond: enabling technologies for formal verification. ICCAD, pp. 236-243, 1995.
7. E. Charbon and I. Torunoglu. Watermarking layout topologies. ASP-DAC, pp. 213-16, 1999.
8. C. S. Collberg and C. Thomborson. Software Watermarking: Models and Dynamic Embeddings. Symposium on Principles of Programming Languages, 1999.
9. J. M. Crawford. Solving Satisfiability Problems Using a Combination of Systematic and Local Search. Second DIMACS Challenge, 1993.
10. http://www.cs.ualberta.ca/~joe
11. M. DeGroot. Probability and Statistics. Addison-Wesley, Reading, 1989.
12. S. Devadas. Optimal layout via Boolean satisfiability. Internationsl Conference on Computer-Aided Design, pp. 294-7, 1989.
13. B. Efron, R. Tibshirani. An introduction to the bootstrap. 1993.
14. C. Fleurent and J. A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, vol.63, pp. 437-461, 1996.
15. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
16. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. of the ACM, vol.5, (no.6), pp. 1115-45, 1995.
17. D. Grover. Forensic copyright protection. Computer Law and Security Report, vol14, (no.2), pp. 121-2, 1998.
18. I. T. Jolliffe. Principal component analysis. New York, Springer-Verlag, 1986.
19. A. B. Kahng et al. Robust IP Watermarking Methodologies for Physical Design. DAC, 1998.
20. H. Karhunen. Ueber lineare Methoden in der Wahrscheinlichkeitsrechnung. Ann. Acad. Sci. Fenn. AI, 37, 1947.
21. D. Kirovski and M. Potkonjak. Efficient coloring of a large spectrum of graphs. DAC, pp. 427-32, 1998.
22. H. Konuk and T. Larrabee. Explorations of sequential ATPG using Boolean Satisfiability. IEEE VLSI Test Symposium, pp. 85-90, 1993.
23. F. T. Leighton. A Graph Coloring Algorithm for Large Scheduling Algorithms. Journal of Res. Natl. Bur. Standards, vol.84, pp. 489-506, 1979.
24. M. Loeve. Fonctions Aleatoire de Seconde Ordre. Hermann. Paris. 1948.
25. D. F. McGahn. Copyright infringement of protected computer software: an analytical method to determine substantial similarity. Rutgers Computer & Technology Law Journal, vol.21, (no.1), pp. 88-142, 1995.
26. G. Qu and M. Potkonjak. Analysis of watermarking techniques for graph coloring problem. ICCAD, 1998.
27. N. Rudin, K. Inman, G. Stolvitzky, and I. Rigoutsos. DNA Based Identification. BIOMETRICS personal Identification in Networked Society, Kluwer, 1998.
28. B. Selman, H. J. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. National Conference on Artificial Intelligence, 1992.
29. B. Selman, et al. Local Search Strategies for Satisfiability Testing. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993.
30. B. Selman. Stochastic search and phase transitions: AI meets physics. IJCAI, pp. 998-1002, vol.1, 1995.
31. J. P. Marques-Silva and K. A. Sakallah. GRASP: a search algorithm for propositional satisfiability. T. on Computers, vol.48, (no.5), pp. 506-21, 1999.
32. P. Stephan, et al. Combinational test generation using satisfiability. Transactions on Computer-Aided Design of Intergrated Circuits and Systems, vol.15, (no.9), pp. 1167-76, 1996.
33. R. Thisted and B. Efron Did Shakespeare Write a newly discovered Poem? Biometrika, 74, pp. 445-455, 1987
34. D. de Werra. An Introduction to Timetabling. European Journal of Operations Research, vol.19, pp. 151-162, 1985.