Sciweavers

128 search results - page 16 / 26
» Rewriting Constraint Models with Metamodels
Sort
View
PADL
2007
Springer
14 years 1 months ago
From Zinc to Design Model
We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically...
Reza Rafeh, Maria J. García de la Banda, Ki...
LATA
2009
Springer
14 years 2 months ago
Rigid Tree Automata
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 rest...
Florent Jacquemard, Francis Klay, Camille Vacher
CONSTRAINTS
2007
89views more  CONSTRAINTS 2007»
13 years 7 months ago
Cardinal: A Finite Sets Constraint Solver
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Francisco Azevedo
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
FDL
2006
IEEE
14 years 1 months ago
MCF: A Metamodeling-based Visual Component Composition Framework
Reusing IP-cores to construct system models facilitated by automated generation of glue-logic, and automated composability checks can help designers to create efficient simulation...
Deepak Mathaikutty, Sandeep K. Shukla