Sciweavers

233 search results - page 20 / 47
» Specifying, Programming and Verifying with Equational Logic
Sort
View
133
Voted
POPL
2010
ACM
15 years 3 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
127
Voted
ICFP
2000
ACM
15 years 8 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
238
Voted
POPL
2005
ACM
16 years 3 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
143
Voted
ICFP
2008
ACM
16 years 3 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...
114
Voted
SAC
2010
ACM
15 years 5 months ago
A heterogeneous approach to service-oriented systems specification
Service-oriented architecture (SOA) is a relatively new approach to software system development. It divides system functionality to independent, loosely coupled, interoperable ser...
Alexander Knapp, Grzegorz Marczynski, Martin Wirsi...