Sciweavers

3513 search results - page 382 / 703
» Super Logic Programs
Sort
View
POPL
2006
ACM
16 years 3 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»
15 years 10 months 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
15 years 9 months 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
158
Voted
WCFLP
2005
ACM
15 years 9 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
140
Voted
IFIP
2004
Springer
15 years 9 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham