Sciweavers

4940 search results - page 443 / 988
» On the Complexity of Universal Programs
Sort
View
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
16 years 7 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...
ICSE
2008
IEEE-ACM
16 years 7 months ago
MimEc: intelligent user notification of faults in the eclipse IDE
The earlier in the software process a fault is detected, the cheaper the cost of fixing the fault. Automated fault detection tools can provide developers with information througho...
Lucas Layman, Laurie A. Williams, Robert St. Amant
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
16 years 3 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
PEPM
2010
ACM
16 years 3 months ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson
TACAS
2010
Springer
210views Algorithms» more  TACAS 2010»
16 years 1 months ago
Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
Alastair F. Donaldson, Daniel Kroening, Philipp R&...