Sciweavers

3713 search results - page 407 / 743
» Constructing a Calculus of Programs
Sort
View
POPL
2001
ACM
16 years 5 months ago
Oracle-based checking of untrusted software
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
George C. Necula, Shree Prakash Rahul
120
Voted
ICFP
2006
ACM
16 years 4 months ago
Transactional events
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
Kevin Donnelly, Matthew Fluet
137
Voted
ICFP
2006
ACM
16 years 4 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
134
Voted
CC
2010
Springer
172views System Software» more  CC 2010»
15 years 11 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
SASO
2008
IEEE
15 years 11 months ago
Cells Are Plausible Targets for High-Level Spatial Languages
—High level languages greatly increase the power of a programmer at the cost of programs that consume more s than those written at a lower level of abstraction. This inefficienc...
Jacob Beal, Jonathan Bachrach