Sciweavers

69 search results - page 5 / 14
» Automated fixing of programs with contracts
Sort
View
DAC
1999
ACM
14 years 8 months ago
Constraint Driven Code Selection for Fixed-Point DSPs
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
Steven Bashford, Rainer Leupers
IPSN
2007
Springer
14 years 1 months ago
Interface contracts for TinyOS
TinyOS applications are built with software components that communicate through narrow interfaces. Since components enable finegrained code reuse, this approach has been successf...
Will Archer, Philip Levis, John Regehr
LICS
1991
IEEE
13 years 11 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 7 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
AMAST
2008
Springer
13 years 9 months ago
Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving
Abstract. Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against func...
Stefan Maus, Michal Moskal, Wolfram Schulte