429 search results - page 46 / 86 » Theorem Proving Languages for Verification |
104
Voted
VSTTE
2010
Springer
14 years 9 months ago
2010
Springer
A suite of verification benchmarks for software verification tools and techniques, presented at VSTTE 2008 [11], provides an initial catalogue of benchmark challenges for the Verif...
ECOOP
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
COCO
2004
Springer
15 years 2 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
111
click to vote
APLAS
2011
ACM
13 years 11 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
189
click to vote
POPL
2007
ACM
15 years 11 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...