Sciweavers

79 search results - page 13 / 16
» Structural Abstraction of Software Verification Conditions
Sort
View
ICSE
2008
IEEE-ACM
14 years 8 months ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
ICFEM
2010
Springer
13 years 6 months ago
Model-Driven Protocol Design Based on Component Oriented Modeling
Abstract. Due to new emerging areas in the communication field there is a constant need for the design of novel communication protocols. This demands techniques for a rapid and eff...
Prabhu Shankar Kaliappan, Hartmut König, Seba...
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 7 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
DC
2010
13 years 7 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh