Sciweavers

11 search results - page 2 / 3
» Small bisimulations for reasoning about higher-order imperat...
Sort
View
JAR
2007
123views more  JAR 2007»
14 years 9 months ago
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...
ICFP
2008
ACM
15 years 9 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...
POPL
2011
ACM
14 years 12 days ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
POPL
2005
ACM
15 years 10 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
POPL
2006
ACM
15 years 10 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao