Write a Blog >>
Events (23 results)

All You Need is the Monad... What Monad Was That Again?

PPS 2016 When: Sat 23 Jan 2016 09:00 - 09:20 People: Norman Ramsey

… …

Keynote Talk: Generalising Abstraction

Off the Beaten Track When: Sat 23 Jan 2016 14:00 - 14:45 People: Bob Atkey

… is invariant under all changes of representation that act identically given …

Bisimulation Up-to Techniques for Psi-calculi

CPP When: Tue 19 Jan 2016 14:00 - 14:30 People: Johannes Å. Pohjola, Joachim Parrow

… algebraic and congruence properties of bisimilarity apply to all calculi within … these bisimulation proof methods can be adapted to psi- calculi. We formalise all our …

Constructing the Propositional Truncation using Non-recursive HITs

CPP When: Tue 19 Jan 2016 11:00 - 11:30 People: Floris van Doorn

… fully formalized all results in a new proof assistant, Lean. …

Operator Precedence for Data-Dependent Grammars

PEPM When: Tue 19 Jan 2016 11:00 - 11:30 People: Ali Afroozeh, Anastasia Izmaylova

… deal with all corner cases found in programming languages. In this paper we …

Practical, General Parser Combinators

PEPM When: Tue 19 Jan 2016 10:30 - 11:00 People: Anastasia Izmaylova, Ali Afroozeh, Tijs van der Storm

… present general parser combinators that support all context-free grammars …

Models for Probabilistic Programs with an Adversary

PPS 2016 When: Sat 23 Jan 2016 10:30 - 10:50 People: Robert Rand, Steve Zdancewic

… this to all the states in the distribution’s support, where b would evaluate … at the non-deterministic choice c1 ⊔ c2 this wasn’t true at all. If we reduced … ranging from security to game theory. All of these can be thought of as encoding what …

Finally, Safely-Extensible and Efficient Language-Integrated Query

PEPM When: Tue 19 Jan 2016 15:00 - 15:30 People: Kenichi Suzuki, Oleg Kiselyov, Yukiyoshi Kameyama

… Language-integrated query is an embedding of database queries into a host language to code queries at a higher level than the all-to-common concatenation of strings of SQL fragments. The eventually produced SQL is ensured to be well-formed …

A Lambda-Calculus Foundation for Universal Probabilistic Programming

PPS 2016 When: Sat 23 Jan 2016 14:00 - 14:20 People: Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak

… to a value, and showing that the distribution induced by integrating over all

eXchangeable Random Primitives

PPS 2016 When: Sat 23 Jan 2016 16:30 - 16:50 People: Nathanael L. Ackerman, Cameron Freer, Daniel Roy

… with XRPs. A formalization of all three components of XRPs — including …

An Interface for Black Box Learning in Probabilistic Programs

PPS 2016 When: Sat 23 Jan 2016 09:30 - 09:50 People: Jan-Willem van de Meent, Brooks Paige, David Tolpin, Frank Wood

… performs all steps of type 1 and relegates to an inference back end B when …

Printing Floating-Point Numbers: A Faster, Always Correct Method

Research Papers When: Thu 21 Jan 2016 17:20 - 17:45 People: Marc Andrysco, Ranjit Jhala, Sorin Lerner

… refinements achieve completeness – i.e. produce correct and optimal outputs on all … but sacrifices optimality for 0.5% of all inputs. We present Errol, a new complete algorithm that is guaranteed to produce correct and optimal results for all inputs …

Combining Static Analysis with Probabilistic Models to Enable Market-Scale Analysis

Research Papers When: Thu 21 Jan 2016 14:20 - 14:45 People: Damien Octeau, Somesh Jha, Matthew Dering, Patrick McDaniel, Alexandre Bartel, Hongyu Li, Jacques Klein, Yves Le Traon

… , scrutinizing all potential links is simply not feasible. We therefore overlay … an efficient algorithm for performing link resolution. We compute all potential links … probabilistic approach. We find that over 97.3% of all 489 million potential links …

A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions

Research Papers When: Fri 22 Jan 2016 10:55 - 11:20 People: Jean Pichon-Pharabod, Peter Sewell

… , one that admits all common optimisations without also admitting undesired … representations that represent all executions.

In this paper we propose a novel approach … thread, capturing all of its potential executions, and to permit interleaving …

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components

Research Papers When: Fri 22 Jan 2016 14:45 - 15:10 People: Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

… of all components and apply the best-known graph algorithm on the product … closure computation (i.e., the results of all possible queries), which provides …

Query-Guided Maximum Satisfiability

Research Papers When: Wed 20 Jan 2016 14:20 - 14:45 People: Xin Zhang, Ravi Mangal, Aditya Nori, Mayur Naik

… We propose a new optimization problem “Q-MaxSAT”, an extension of the well-known Maximum Satisfiability or MaxSAT problem. In contrast to MaxSAT, which aims to find an assignment to all variables in the formula, Q-MaxSAT computes …

PolyCheck: Dynamic Verification of Iteration Space Transformations on Affine Programs

Research Papers When: Thu 21 Jan 2016 16:55 - 17:20 People: Wenlei Bao, Sriram Krishnamoorthy, Louis-Noel Pouchet, Fabrice Rastello, P. (Saday) Sadayappan

… take a novel approach addressing all three limitations to provide an automatic bug …

Newtonian Program Analysis via Tensor Product

Research Papers When: Fri 22 Jan 2016 10:30 - 10:55 People: Thomas Reps, Emma Turetsky, Prathmesh Prabhu

… have claimed that "all effective and fast iterative [numerical] methods …

Pushdown Control-flow Analysis for Free

Research Papers When: Fri 22 Jan 2016 11:20 - 11:45 People: Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn

… to implement and require significant engineering effort. Furthermore, all three …

Scaling Network Verification using Symmetry and Surgery

Research Papers When: Wed 20 Jan 2016 10:55 - 11:20 People: Gordon Plotkin, Nikolaj Bjørner, Nuno P. Lopes, Andrey Rybalchenko, George Varghese

… . To do all this requires a formal theory of networks and their transforms. Our …

T6: Security and Privacy by Typing in Cryptographic Systems

Tutorials When: Mon 18 Jan 2016 10:30 - 12:00Mon 18 Jan 2016 14:00 - 15:30 People: Matteo Maffei

… . First of all, while early academic protocols mostly consisted of simple …

Is Sound Gradual Typing Dead?

Research Papers When: Thu 21 Jan 2016 15:35 - 16:00 People: Asumu Takikawa, Daniel Feltey, Ben Greenman, Max New, Jan Vitek, Matthias Felleisen

… untyped to typed seriously and calls for measuring the performance of all

Overhauling SC atomics in C11 and OpenCL

Research Papers When: Fri 22 Jan 2016 11:20 - 11:45 People: John Wickerson, Mark Batty, Alastair Donaldson

… that these strengthenings are natural, and prove that all of the formalised C11 …