Databases Reference
In-Depth Information
[34] B. Livshits and T. Zimmermann. Dynamine: finding common error pat-
terns by mining software revision histories. In ESEC-FSE '05: 10th Eu-
ropean Software Engineering Conference and 13th ACM SIGSOFT In-
ternational Symposium on Foundations of Software Engineering, pages
296{305, 2005.
[35] D. Mandelin, L. Xu, R. Bodik, and D. Kimelman. Jungloid mining: help-
ing to navigate the api jungle. In PLDI '05: Proceedings of the ACM
SIGPLAN 2005 Conference on Programming Language Design and Im-
plementation, pages 48{61, 2005.
[36] J. Palsberg. Closure analysis in constraint form. ACM Trans. Program.
Lang. Syst., 17(1):47{62, 1995.
[37] M.K. Ramanathan, A. Grama, and S. Jagannathan. Path-sensitive in-
ference of function precedence protocols. In ICSE '07: Proceedings of the
29th International Conference on Software Engineering, 2007.
[38] M. Rinard, C. Cadar, D. Dumitran, D.M. Roy, T. Leu, and W.S. Bee-
bee. Enhancing server availability and security through failure-oblivious
computing. In OSDI '04: Proceedings of the 6th Usenix Symposium on
Operating Systems Design and Implementation, 2004.
[39] K. Sen, D. Marinov, and G. Agha. Cute: a concolic unit testing engine
forc. In Proceedings of ESEC-FSE, pages 263{272, 2005.
[40] O. Shivers.
Control-Flow Analysis of Higher-Order Languages.
Ph.D.
thesis, Carnegie Mellon University, May 1991.
[41] K. Vaswani, A.V. Nori, and T.M. Chilimbi. Preferential path profiling:
compactly numbering interesting paths.
In Proceedings of POPL '07,
Nice, France, January 2007.
[42] W. Weimer and G. Necula. Mining temporal specifications for error de-
tection. In TACAS '05: Eleventh International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, pages 461{476,
April 2005.
[43] J. Whaley, M. Martin, and M. Lam. Automatic extraction of object-
oriented component interfaces. In Proceedings of the International Sym-
posium of Software Testing and Analysis, ISSTA, 2002.
[44] Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability.
In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT Sympo-
sium on Principles of Programming Languages, pages 351{363, 2005.
[45] G. Yang. The complexity of mining maximal frequent itemsets and max-
imal frequent patterns. In KDD '04: Proceedings of the Tenth ACM
SIGKDD International Conference on Knowledge Discovery and Data
Mining, pages 344{353, 2004.
 
Search WWH ::




Custom Search