Sciweavers

348 search results - page 56 / 70
» Verification of Language Based Fault-Tolerance
Sort
View
ECEASST
2008
69views more  ECEASST 2008»
13 years 8 months ago
Verifying Model Transformations by Structural Correspondence
: Model transformations play a significant role in model based software development, and the correctness of the transformation is crucial to the success of the development effort. ...
Anantha Narayanan, Gabor Karsai
POPL
2006
ACM
14 years 8 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
POPL
2009
ACM
14 years 9 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
FOAL
2008
ACM
13 years 10 months ago
Incremental analysis of interference among aspects
Often, insertion of several aspects into one system is desired and in that case the problem of interference among the different aspects might arise, even if each aspect individual...
Emilia Katz, Shmuel Katz