1226 search results - page 146 / 246 » Proofs, Programs and Abstract Complexity |
130
Voted
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
147
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
133
click to vote
SAS
2009
Springer
15 years 10 months ago
2009
Springer
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
144
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
127
Voted
CLUSTER
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...