624 search results - page 68 / 125 » The Complexity of Type Analysis of Object Oriented Programs |
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
ISSTA
2010
ACM
13 years 11 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
PASTE
2005
ACM
14 years 1 months ago
2005
ACM
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
UAIS
2010
13 years 2 months ago
2010
Abstract Text documents usually embody visually oriented meta-information in the form of complex visual structures, such as tables. The semantics involved in such objects result in...