1076 search results - page 39 / 216 » Operations on proofs and labels |
111
click to vote
MFCS
1998
Springer
15 years 5 months ago
1998
Springer
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
93
Voted
FOSSACS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
100
Voted
EJC
2008
15 years 27 days ago
2008
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
98
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
– This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic label...
101
Voted
CCS
2009
ACM
16 years 1 months ago
2009
ACM
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...