Sciweavers

POPL
2016
ACM
8 years 8 months ago
Is sound gradual typing dead?
Programmers have come to embrace dynamically-typed languages for prototyping and delivering large and complex systems. When it comes to maintaining and evolving these systems, the...
Asumu Takikawa, Daniel Feltey, Ben Greenman, Max S...
POPL
2016
ACM
8 years 8 months ago
Symbolic computation of differential equivalences
Ordinary differential equations (ODEs) are widespread in many natural sciences including chemistry, ecology, and systems biology, and in disciplines such as control theory and ele...
Luca Cardelli, Mirco Tribastone, Max Tschaikowski,...
POPL
2016
ACM
8 years 8 months ago
From MinX to MinC: semantics-driven decompilation of recursive datatypes
Reconstructing the meaning of a program from its binary executable is known as reverse engineering; it has a wide range of applications in software security, exposing piracy, lega...
Edward Robbins, Andy King, Tom Schrijvers
POPL
2016
ACM
8 years 8 months ago
Kleenex: compiling nondeterministic transducers to deterministic streaming transducers
We present and illustrate Kleenex, a language for expressing general nondeterministic finite transducers, and its novel compilation to streaming string transducers with worst-cas...
Niels Bjørn Bugge Grathwohl, Fritz Henglein...
POPL
2016
ACM
8 years 8 months ago
Estimating types in binaries using predictive modeling
Reverse engineering is an important tool in mitigating vulnerabilities in binaries. As a lot of software is developed in object-oriented languages, reverse engineering of object-o...
Omer Katz, Ran El-Yaniv, Eran Yahav
POPL
2016
ACM
8 years 8 months ago
Decidability of inferring inductive invariants
Induction is a successful approach for verification of hardware and software systems. A common practice is to model a system using logical formulas, and then use a decision proce...
Oded Padon, Neil Immerman, Sharon Shoham, Aleksand...
POPL
2016
ACM
8 years 8 months ago
Pushdown control-flow analysis for free
Traditional control-flow analysis (CFA) for higher-order languages introduces spurious connections between callers and callees, and different invocations of a function may pollut...
Thomas Gilray, Steven Lyde, Michael D. Adams 0001,...
POPL
2016
ACM
8 years 8 months ago
Effects as sessions, sessions as effects
Effect and session type systems are two expressive behavioural type systems. The former is usually developed in the context of the λcalculus and its variants, the latter for the ...
Dominic A. Orchard, Nobuko Yoshida
POPL
2016
ACM
8 years 8 months ago
PSync: a partially synchronous language for fault-tolerant distributed algorithms
Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, d...
Cezara Dragoi, Thomas A. Henzinger, Damien Zuffere...
POPL
2016
ACM
8 years 8 months ago
Example-directed synthesis: a type-theoretic interpretation
Input-output examples have emerged as a practical and user-friendly specification mechanism for program synthesis in many environments. While example-driven tools have demonstrat...
Jonathan Frankle, Peter-Michael Osera, David Walke...