2540 search results - page 324 / 508 » Abstract Logics as Dialgebras |
108
Voted
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
100
click to vote
OOPSLA
2004
Springer
15 years 6 months ago
2004
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint exis that the abstract state of the object to whi...
81
Voted
CORR
2004
Springer
15 years 15 days ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
106
click to vote
POPL
2010
ACM
15 years 26 days ago
2010
ACM
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 ...
107
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...