Sciweavers

2529 search results - page 37 / 506
» The Logical Structure of Binding
Sort
View
LICS
2003
IEEE
15 years 3 months ago
Model-checking Trace Event Structures
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
P. Madhusudan
VMCAI
2010
Springer
15 years 7 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
POPL
2010
ACM
15 years 7 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 4 months ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...
POPL
2012
ACM
13 years 5 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka