Sciweavers

ICALP
2011
Springer
13 years 3 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
ESOP
2011
Springer
13 years 3 months ago
A New Method for Dependent Parsing
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
Trevor Jim, Yitzhak Mandelbaum
ESOP
2011
Springer
13 years 3 months ago
Typing Local Control and State Using Flow Analysis
Programs written in scripting languages employ idioms that confound conventional type systems. In this paper, we highlight one important set of related idioms: the use of local con...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
ESOP
2011
Springer
13 years 3 months ago
Linear Absolute Value Relation Analysis
Liqian Chen, Antoine Miné, Ji Wang, Patrick...
ESOP
2011
Springer
13 years 3 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
ESOP
2011
Springer
13 years 3 months ago
Barriers in Concurrent Separation Logic
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...
Aquinas Hobor, Cristian Gherghina
ESOP
2011
Springer
13 years 3 months ago
Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs
We present a static analysis by Abstract Interpretation to check for run-time errors in parallel C programs. Following our work on Astr´ee, we focus on embedded critical programs ...
Antoine Miné
ESOP
2011
Springer
13 years 3 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk
ESOP
2011
Springer
13 years 3 months ago
Polymorphic Contracts
João Filipe Belo, Michael Greenberg, Atsush...