249 search results - page 8 / 50 » Polymorphic Binding-Time Analysis |
140
click to vote
LICS
2010
IEEE
15 years 25 days ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
140
click to vote
LICS
2010
IEEE
15 years 9 days ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
88
Voted
SERSCISA
2009
Springer
15 years 9 months ago
2009
Springer
Many visual similarity-based phishing page detectors have been developed to detect phishing webpages, however, scammers now create polymorphic phishing pages to breach the defense ...
145
click to vote
DLS
2005
15 years 4 months ago
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
117
click to vote
ICFP
1997
ACM
15 years 6 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...