Sciweavers

180 search results - page 26 / 36
» Loop Invariants on Demand
Sort
View
JLP
2007
114views more  JLP 2007»
13 years 7 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
TCOM
2010
141views more  TCOM 2010»
13 years 6 months ago
Communications over the Best Singular Mode of a Reciprocal MIMO Channel
We consider two nodes equipped with multiple antennas that intend to communicate i.e. both of which transmit and receive data. We model the responses of the communication channels...
Saeed Gazor, Khalid AlSuhaili
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 2 months ago
Partition Functions of Normal Factor Graphs
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...
G. David Forney Jr., Pascal O. Vontobel
POPL
2010
ACM
14 years 5 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
VSTTE
2005
Springer
14 years 1 months ago
Verifying Design with Proof Scores
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
Kokichi Futatsugi, Joseph A. Goguen, Kazuhiro Ogat...