Sciweavers

1302 search results - page 247 / 261
» Free-Style Theorem Proving
Sort
View
MICAI
2000
Springer
13 years 11 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
AMC
2006
104views more  AMC 2006»
13 years 7 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith
IJAC
2006
118views more  IJAC 2006»
13 years 7 months ago
A Correspondence between Balanced Varieties and Inverse Monoids
There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...
Mark V. Lawson
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian