Sciweavers

378 search results - page 61 / 76
» Formalizing Spider Diagrams
Sort
View
AMAI
2007
Springer
15 years 4 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
VLSID
2006
IEEE
121views VLSI» more  VLSID 2006»
16 years 5 months ago
An Integrated Approach for Combining BDD and SAT Provers
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...
Rolf Drechsler, Görschwin Fey, Sebastian Kind...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 10 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
EDOC
2006
IEEE
15 years 10 months ago
Structural Patterns for Soundness of Business Process Models
The correctness of business process models is of paramount importance for the application on an enterprise level. A severe problem is that several languages for business process m...
Boudewijn F. van Dongen, Jan Mendling, Wil M. P. v...
169
Voted
MODELS
2009
Springer
15 years 9 months ago
On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
Hartmut Ehrig, Claudia Ermel, Frank Hermann, Ulrik...