Sciweavers

3572 search results - page 395 / 715
» Nominal Logic Programming
Sort
View
POPL
2007
ACM
16 years 6 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...
POPL
2006
ACM
16 years 6 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
16 years 25 days ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
SAC
2006
ACM
16 years 7 days ago
Union types for object-oriented programming
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
Atsushi Igarashi, Hideshi Nagira
WCFLP
2005
ACM
15 years 12 months ago
A declarative debugger of incorrect answers for constraint functional-logic programs
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...
Rafael Caballero