Sciweavers

23 search results - page 3 / 5
» sas 2009
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 6 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
SAS
2009
Springer
204views Formal Methods» more  SAS 2009»
14 years 6 months ago
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
Kyung-Goo Doh, Hyunha Kim, David A. Schmidt
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
14 years 6 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»
14 years 6 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...
BIRTHDAY
2009
Springer
14 years 1 months ago
Formal Series of General Algebras over a Field and Their Syntactic Algebras
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...
Zoltán Fülöp, Magnus Steinby