Sciweavers

71
Voted
POPL
2015
ACM
9 years 11 months ago
On Characterizing the Data Access Complexity of Programs
Venmugil Elango, Fabrice Rastello, Louis-Noël...
85
Voted
POPL
2015
ACM
9 years 11 months ago
Succinct Representation of Concurrent Trace Sets
We present a method and a tool for generating succinct representations of sets of concurrent traces. We focus on trace sets that contain all correct or all incorrect permutations ...
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakr...
86
Voted
POPL
2015
ACM
9 years 11 months ago
From Communicating Machines to Graphical Choreographies
Graphical choreographies, or global graphs, are general multiparty session specifications featuring expressive constructs such as forking, merging, and joining for representing a...
Julien Lange, Emilio Tuosto, Nobuko Yoshida
87
Voted
POPL
2015
ACM
9 years 11 months ago
A Coalgebraic Decision Procedure for NetKAT
Program equivalence is a fundamental problem that has practical applications across a variety of areas of computing including compilation, optimization, software synthesis, formal...
Nate Foster, Dexter Kozen, Matthew Milano, Alexand...
POPL
2015
ACM
9 years 11 months ago
Principal Type Schemes for Gradual Programs
Gradual typing is a discipline for integrating dynamic checking into
Ronald Garcia, Matteo Cimini