77 search results - page 4 / 16 » Partiality and Nondeterminacy in Program Proofs |
137
click to vote
ISNN
2005
Springer
15 years 9 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
154
click to vote
ENTCS
2006
15 years 4 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
131
click to vote
TPHOL
2000
IEEE
15 years 7 months ago
2000
IEEE
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
148
click to vote
SIGPRO
2010
15 years 2 months ago
2010
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
142
click to vote
ENTCS
2007
15 years 4 months ago
2007
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...