Sciweavers

211 search results - page 36 / 43
» Verification of Java Programs with Generics
Sort
View
PLDI
2010
ACM
14 years 4 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
POPL
2008
ACM
14 years 7 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
POPL
1989
ACM
13 years 11 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
POPL
2007
ACM
14 years 7 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
OOPSLA
2010
Springer
13 years 5 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...