315 search results - page 31 / 63 » Reasoning about Assignments in Recursive Data Structures |
144
click to vote
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
231
click to vote
ICDE
1997
IEEE
16 years 5 months ago
1997
IEEE
The need to transform data between heterogeneous databases arises from a number of critical tasks in data management. These tasks are complicated by schema evolution in the underl...
241
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
250
Voted
POPL
2007
ACM
16 years 4 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
125
click to vote
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...