Sciweavers

30 search results - page 2 / 6
» Pure Pointer Programs with Iteration
Sort
View
VMCAI
2010
Springer
14 years 1 months ago
Shape Analysis in the Absence of Pointers and Structure
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...
Matthew Might
FORTE
2010
13 years 5 months ago
Heap-Dependent Expressions in Separation Logic
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
Jan Smans, Bart Jacobs, Frank Piessens
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
13 years 9 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
FOSSACS
2003
Springer
13 years 9 months ago
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Andreas Abel, Ralph Matthes, Tarmo Uustalu
AUSSOIS
2001
Springer
13 years 8 months ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi