Sciweavers

46 search results - page 9 / 10
» Reasoning About Data-Parallel Pointer Programs in a Modal Ex...
Sort
View
POPL
2010
ACM
14 years 2 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
ICFP
2008
ACM
14 years 5 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
ICECCS
2007
IEEE
129views Hardware» more  ICECCS 2007»
13 years 9 months ago
Automated Verification of Shape, Size and Bag Properties
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
GLOBAL
2003
Springer
13 years 10 months ago
The Klaim Project: Theory and Practice
Klaim (Kernel Language for Agents Interaction and Mobility) is an experimental language specifically designed to program distributed systems consisting of several mobile component...
Lorenzo Bettini, Viviana Bono, Rocco De Nicola, Gi...
SIGADA
2004
Springer
13 years 10 months ago
Enforcing security and safety models with an information flow analysis tool
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...
Roderick Chapman, Adrian Hilton