Sciweavers

429 search results - page 46 / 86
» Theorem Proving Languages for Verification
Sort
View
VSTTE
2010
Springer
13 years 6 months ago
Dafny Meets the Verification Benchmarks Challenge
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...
K. Rustan M. Leino, Rosemary Monahan
ECOOP
2008
Springer
13 years 10 months ago
Computing Stack Maps with Interfaces
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...
Frédéric Besson, Thomas P. Jensen, T...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
14 years 12 days ago
Small Spans in Scaled Dimension
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,...
John M. Hitchcock
APLAS
2011
ACM
12 years 8 months ago
Constructing List Homomorphisms from Proofs
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...
Yun-Yan Chi, Shin-Cheng Mu
POPL
2007
ACM
14 years 9 months ago
Logic-flow analysis of higher-order programs
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: ...
Matthew Might