Sciweavers

565 search results - page 19 / 113
» A (De)constructive Approach to Program Checking
Sort
View
TOOLS
2009
IEEE
14 years 3 months ago
Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach
A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features. A fundamental difference from classical applicati...
Christian Kästner, Sven Apel, Salvador Trujil...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 9 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
VMCAI
2005
Springer
14 years 2 months ago
Generalized Typestate Checking for Data Structure Consistency
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...
Patrick Lam, Viktor Kuncak, Martin C. Rinard
DSN
2005
IEEE
14 years 2 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
KBSE
2007
IEEE
14 years 2 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid