Sciweavers

128 search results - page 20 / 26
» Rewriting Constraint Models with Metamodels
Sort
View
IANDC
2011
129views more  IANDC 2011»
13 years 2 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
ICLP
2005
Springer
14 years 1 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
ECEASST
2008
121views more  ECEASST 2008»
13 years 7 months ago
Analyzing Semantic Properties of OCL Operations by Uncovering Interoperational Relationships
The OCL (Object Constraint Language) as part of the UML (Unified Modeling Language) is a rich language with different collection kinds (sets, multi-sets, sequences) and a large var...
Mirco Kuhlmann, Martin Gogolla
BIRTHDAY
2005
Springer
14 years 1 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
ATVA
2010
Springer
142views Hardware» more  ATVA 2010»
13 years 5 months ago
On Scenario Synchronization
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla