96 search results - page 10 / 20 » Analyzing recursive programs using a fixed-point calculus |
TGC
2005
Springer
15 years 3 months ago
2005
Springer
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
85
Voted
VMCAI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
78
Voted
CAV
2008
Springer
14 years 11 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...