3513 search results - page 213 / 703 » Super Logic Programs |
253
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
132
click to vote
TASE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
125
click to vote
VMCAI
2010
Springer
16 years 26 days ago
2010
Springer
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
97
Voted
OOPSLA
2009
Springer
15 years 10 months ago
2009
Springer
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
120
Voted
SAC
2005
ACM
15 years 9 months ago
2005
ACM
A mixin is a reusable module that provides uniform extend modifications to classes. It is an abstract subclass that is composable with a variety of superclasses. In mixinbased co...