Sciweavers

160 search results - page 3 / 32
» Structuring the verification of heap-manipulating programs
Sort
View
TSE
2010
120views more  TSE 2010»
12 years 12 months ago
Efficient Software Verification: Statistical Testing Using Automated Search
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
Simon M. Poulding, John A. Clark
JLP
2010
142views more  JLP 2010»
13 years 2 days ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
POPL
2010
ACM
14 years 2 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
EUROCAST
2007
Springer
108views Hardware» more  EUROCAST 2007»
13 years 9 months ago
Pattern-Based Verification for Trees
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
Milan Ceska, Pavel Erlebach, Tomás Vojnar
APLAS
2010
ACM
13 years 5 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi