Sciweavers

POPL
2016
ACM
10 years 20 days 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
10 years 20 days 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
10 years 20 days 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
10 years 20 days 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
10 years 20 days 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...