Sciweavers

4212 search results - page 533 / 843
» Rights Expression Languages
Sort
View
ICFP
2001
ACM
16 years 6 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
POPL
2010
ACM
16 years 4 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...
ESOP
2010
Springer
16 years 4 months ago
Precise and Automated Contract-based Reasoning for Verification and Certification of Information Flow Properties of Programs wit
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
Torben Amtoft, John Hatcliff and Edwin Rodríguez
STACS
2010
Springer
16 years 1 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
POPL
2009
ACM
16 years 1 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...