Sciweavers

331 search results - page 26 / 67
» Abstract Interpretation of Graph Transformation
Sort
View
AGTIVE
2007
Springer
15 years 9 months ago
Verification and Synthesis of OCL Constraints Via Topology Analysis
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
Jörg Bauer, Werner Damm, Tobe Toben, Bernd We...
ICLP
2007
Springer
15 years 11 months ago
Automatic Binding-Related Error Diagnosis in Logic Programs
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
Pawel Pietrzak, Manuel V. Hermenegildo
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
15 years 11 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
15 years 10 months ago
Development and Application of Design Transformations in ForSyDe
The ForSyDe methodology has been developed for system level design. Starting with a formal specification model, that captures the functionality of the system at a high abstractio...
Ingo Sander, Axel Jantsch, Zhonghai Lu
129
Voted
APLAS
2006
ACM
15 years 11 months ago
Using Metadata Transformations to Integrate Class Extensions in an Existing Class Hierarchy
Abstract. Class extensions provide a fine-grained mechanism to define incremental modifications to class-based systems when standard subclassing mechanisms are inappropriate. To...
Markus Lumpe