Sciweavers

1205 search results - page 86 / 241
» Program Extraction from Large Proof Developments
Sort
View
CASCON
1996
111views Education» more  CASCON 1996»
15 years 2 months ago
A hybrid process for recovering software architecture
A large portion of the software used in industry today is legacy software. Legacy systems often evolve into dicult to maintain systems whose original design has been lost or else ...
Vassilios Tzerpos, Richard C. Holt
OSDI
2002
ACM
16 years 1 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
TIT
2010
128views Education» more  TIT 2010»
14 years 8 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
POPL
2010
ACM
15 years 11 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
ICLP
2010
Springer
15 years 5 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens