1888 search results - page 91 / 378 » Proof theory and computational analysis |
173
click to vote
ECCC
2000
15 years 6 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
207
click to vote
TGC
2010
Springer
15 years 4 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
279
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
166
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper presents novel analysis results for input-to-state stability (ISS) that utilise dynamic programming techniques to characterise minimal ISS gains and transient bounds. Th...
169
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...