Sciweavers

1763 search results - page 178 / 353
» A Formalization of Polytime Functions
Sort
View
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
16 years 4 months ago
Type Analysis for JavaScript
JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but ...
Anders Møller, Peter Thiemann, Simon Holm J...
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
16 years 4 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
POPL
2003
ACM
16 years 4 months ago
Guarded recursive datatype constructors
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
Hongwei Xi, Chiyan Chen, Gang Chen
ICFP
2008
ACM
16 years 4 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
16 years 1 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard