Sciweavers

1497 search results - page 135 / 300
» Extended static checking
Sort
View
ECEASST
2008
60views more  ECEASST 2008»
15 years 2 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer
IGPL
2006
130views more  IGPL 2006»
15 years 2 months ago
Verifying Temporal Heap Properties Specified via Evolution Logic
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard...
ENTCS
2002
73views more  ENTCS 2002»
15 years 2 months ago
Reducing the Overhead of Dynamic Analysis
Dynamic analysis (instrumenting programs with code to detect and prevent errors during program execution) can be an effective approach to debugging, as well as an effective means ...
Suan Hsi Yong, Susan Horwitz
ENTCS
2008
90views more  ENTCS 2008»
15 years 1 months ago
Formal Verification of Websites
In this paper, a model for websites is presented. The model is well-suited for the formal verification of dynamic as well as static properties of the system. A website is defined ...
Sonia Flores, Salvador Lucas, Alicia Villanueva
AOSD
2011
ACM
14 years 9 months ago
Reducing combinatorics in testing product lines
A Software Product Line (SPL) is a family of programs where each program is defined by a unique combination of features. Testing or checking properties of an SPL is hard as it ma...
Chang Hwan Peter Kim, Don S. Batory, Sarfraz Khurs...