Sciweavers

25 search results - page 2 / 5
» A Basis for Verifying Multi-threaded Programs
Sort
View
ORL
2008
82views more  ORL 2008»
13 years 7 months ago
On test sets for nonlinear integer maximization
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
Jon Lee, Shmuel Onn, Robert Weismantel
PPDP
2009
Springer
14 years 2 months ago
Model-checking higher-order functions
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
Naoki Kobayashi
POPL
2007
ACM
14 years 7 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
PDSE
1998
108views more  PDSE 1998»
13 years 8 months ago
An Algebraic Framework for Optimizing Parallel Programs
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
Ichiro Satoh
AOSD
2011
ACM
13 years 2 months ago
EventCJ: a context-oriented programming language with declarative event-based context transition
This paper proposes EventCJ, a context-oriented programming (COP) language that can modularly control layer activation based on user-defined events. In addition to defining cont...
Tetsuo Kamina, Tomoyuki Aotani, Hidehiko Masuhara