10715 search results - page 93 / 2143 » Proofs from Tests |
207
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
87
Voted
SE
2010
15 years 2 months ago
2010
Abstract: Test methodologies for large embedded systems fail to reflect the test process as a whole. Instead, the test process is divided into independent test levels feaifferences...
150
click to vote
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
111
Voted
TCC
2009
Springer
16 years 1 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
79
Voted
ICSE
2000
IEEE-ACM
15 years 4 months ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...