Sciweavers

337 search results - page 47 / 68
» Predicate abstraction for software verification
Sort
View
EMSOFT
2004
Springer
15 years 4 months ago
Separation of concerns: overhead in modeling and efficient simulation techniques
Separating the description of important aspects of a design such as behavior and architecture, or computation and communication, may yield significant advantages in design time as...
Guang Yang 0004, Alberto L. Sangiovanni-Vincentell...
115
Voted
JUCS
2010
162views more  JUCS 2010»
14 years 7 months ago
UML Behavior Models of Real-Time Embedded Software for Model-Driven Architecture
Abstract: Model-Driven Architecture (MDA) presents a set of layered models to separate design concerns from platform concerns. The model executability for each model element is sti...
Jin Hyun Kim, Jin-Young Choi, Inhye Kang, Insup Le...
IPPS
2010
IEEE
14 years 9 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
118
Voted
FASE
2008
Springer
15 years 2 months ago
A Logic of Graph Constraints
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
Fernando Orejas, Hartmut Ehrig, Ulrike Prange
119
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
Counterexample Guided Path Reduction for Static Program Analysis
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
Ansgar Fehnker, Ralf Huuck, Sean Seefried