Sciweavers

632 search results - page 87 / 127
» Proving Invariants of Functional Programs
Sort
View
SIGSOFT
2009
ACM
16 years 1 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
SAS
2009
Springer
172views Formal Methods» more  SAS 2009»
16 years 1 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...
118
Voted
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
15 years 9 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
ISCI
2007
135views more  ISCI 2007»
15 years 12 days ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
83
Voted
CP
2007
Springer
15 years 6 months ago
Model-Driven Visualizations of Constraint-Based Local Search
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
Grégoire Dooms, Pascal Van Hentenryck, Laur...