Sciweavers

4770 search results - page 54 / 954
» Flexible Type Analysis
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
15 years 3 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
FPCA
1995
15 years 7 months ago
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
David N. Turner, Philip Wadler, Christian Mossin
126
Voted
ACL
2004
15 years 5 months ago
Optimizing Typed Feature Structure Grammar Parsing through Non-Statistical Indexing
This paper introduces an indexing method based on static analysis of grammar rules and type signatures for typed feature structure grammars (TFSGs). The static analysis tries to p...
Cosmin Munteanu, Gerald Penn
IFIP
2009
Springer
15 years 10 months ago
Towards a Type System for Security APIs
Security API analysis typically only considers a subset of an API’s functions, with results bounded by the number of function calls. Furthermore, attacks involving partial leakag...
Gavin Keighren, David Aspinall, Graham Steel
ICDAR
2005
IEEE
15 years 9 months ago
ScatterType: A Legible but Hard-to-Segment CAPTCHA
The ScatterType CAPTCHA, designed to resist character– segmentation attacks and shown to be highly legible to human readers, is analyzed for vulnerabilities and is offered for e...
Henry S. Baird, Michael A. Moll, Sui-Yu Wang