3713 search results - page 346 / 743 » Constructing a Calculus of Programs |
154
click to vote
SCAM
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we describe an improved formalisation of slicing in WSL transformation theory and apply the result to a particularly challenging slicing problem: the SCAM mug [1]. W...
125
click to vote
POPL
1997
ACM
15 years 8 months ago
1997
ACM
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
152
click to vote
MPC
1992
Springer
15 years 8 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
137
Voted
AMAST
2006
Springer
15 years 8 months ago
2006
Springer
This article demonstrates how a powerful and expressive ion from concurrency theory--monads of resumptions--plays a dual r^ole as a programming tool for concurrent applications. Th...
136
click to vote
OOPSLA
1991
Springer
15 years 8 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...