Sciweavers

309 search results - page 24 / 62
» Termination proofs for systems code
Sort
View
POPL
2008
ACM
14 years 8 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
TMC
2010
130views more  TMC 2010»
13 years 6 months ago
SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes
—This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative ackn...
Michele Rossi, Nicola Bui, Giovanni Zanca, Luca St...
CATS
2006
13 years 9 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
CADE
2002
Springer
14 years 8 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
ENTCS
2008
139views more  ENTCS 2008»
13 years 7 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova