Sciweavers

915 search results - page 84 / 183
» Proof labeling schemes
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Basic Observables for a Calculus for Global Computing
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
Rocco De Nicola, Daniele Gorla, Rosario Pugliese
APLAS
2007
ACM
14 years 1 days ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
ENTCS
2006
133views more  ENTCS 2006»
13 years 8 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Ando Saabas, Tarmo Uustalu
IANDC
2010
128views more  IANDC 2010»
13 years 6 months ago
A coinductive calculus of binary trees
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on ...
Alexandra Silva, Jan J. M. M. Rutten
MIR
2005
ACM
198views Multimedia» more  MIR 2005»
14 years 1 months ago
Semi-automatic video annotation based on active learning with multiple complementary predictors
In this paper, we will propose a novel semi-automatic annotation scheme for video semantic classification. It is well known that the large gap between high-level semantics and low...
Yan Song, Xian-Sheng Hua, Li-Rong Dai, Meng Wang