Sciweavers

1410 search results - page 279 / 282
» Proving theorems by reuse
Sort
View
PLPV
2011
ACM
13 years 20 days ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
14 years 10 months ago
Detecting and resolving unsound workflow views for correct provenance analysis
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
Peng Sun, Ziyang Liu, Susan B. Davidson, Yi Chen
POPL
2010
ACM
14 years 7 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
DEXA
2009
Springer
151views Database» more  DEXA 2009»
14 years 4 months ago
Automatic Extraction of Ontologies Wrapping Relational Data Sources
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
Lina Lubyte, Sergio Tessaris
ICC
2007
IEEE
151views Communications» more  ICC 2007»
14 years 4 months ago
Sensing-Throughput Tradeoff for Cognitive Radio Networks
— In cognitive radio networks, the secondary network (users) are allowed to utilize the frequency bands of primary network (users) when they are not currently being used. To supp...
Ying-Chang Liang, Yonghong Zeng, Edward Chu Yeow P...