155,043 Hits in 2.8 sec

Constraint design rewriting

Roberto Bruni, Alberto Lluch Lafuente, Ugo Montanari
2015 Science of Computer Programming  
We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting.  ...  Constraint network transformations such as constraint propagations are specified with rewrite rules exploiting the network's structure provided by terms.  ...  Constraint Design Rewriting In this section we will first present an algebraic notation for networks of constraints [6] (Section 2.1).  ... 
doi:10.1016/j.scico.2013.11.015 fatcat:hdpxatplqncrleettwnljkmb6q

A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints

Hilderick A. van der Meiden, Willem F. Bronsvoort
2010 Computer-Aided Design  
The solver is based on the cluster rewriting approach, which can efficiently solve large systems of constraints on points, and incrementally handle changes to a system, but can so far solve only a limited  ...  We present a new constructive solving approach for systems of 3D geometric constraints.  ...  Finally, we have presented a way to solve systems of constraints on 3D primitives. The basic cluster rewriting algorithm can only solve systems of constraints on points.  ... 
doi:10.1016/j.cad.2009.03.003 fatcat:o45f7j3zdrhtlbjo6r4jv6jnpq

Rewriting with constraints in T-ruby [chapter]

Robin Sharp, Ole Rasmussen
Lecture Notes in Computer Science  
The synthesis method is based on syntactic rewriting of Ruby terms, combined with the introduction of constraints into the specification.  ...  The rewriting process is described in a recta-language based on the use of tactics and tacticals, which makes it possible to develop complex speciallsed strategies for the refinement of specifications.  ...  This style of design has been described by Rossen in [10] .  ... 
doi:10.1007/bfb0021727 dblp:conf/charme/SharpR93 fatcat:wo573tpo65ghtakcrsjhogoiw4

Using graph rewriting methods for the semi-automatic generation of parametric infrastructure models

Simon Vilgertshofer, André Borrmann
2017 Advanced Engineering Informatics  
However, the correct application of parametric constraints and procedural dependencies has shown to be a very complex and timeconsuming process.  ...  For the design of large infrastructure projects such as inner-city subway tracks, it proves necessary to consider differing model scales, ranging from the scale of several kilometers down to a few millimeters  ...  The set of parametric constraints that is implemented by all major constraint solvers is defined as the standard geometric constraint language [39] .  ... 
doi:10.1016/j.aei.2017.07.003 fatcat:o3tje75t2ngglfeldq2imwkrhy

CDR: A Rewriting Based Tool to Design FPLA Circuits [chapter]

Zahir Maazouzi, Nirina Andrianarivelo, Wadoud Bousdira, Jacques Chabin
2001 Lecture Notes in Computer Science  
A rewriting based method to design circuits on FPLA electronic devices is presented. It is an improvement of our previous work.  ...  This is done thanks to new forms of rewriting rules denoting new interesting properties on boolean vectors, associated to boolean products.  ...  The Rewriting Approach We use the paradigm of conditional rewriting [3] to perform the circuit design. The formalism of constraints used here is also the usual one.  ... 
doi:10.1007/3-540-44990-6_17 fatcat:xz3m5zjdejbadd5pgtgc65svku

Rewriting in Practice [chapter]

Ashish Tiwari
2011 Lecture Notes in Computer Science  
We discuss applications of rewriting in three different areas: design and analysis of algorithms, theorem proving and term rewriting, and modeling and analysis of biological processes.  ...  Rewriting in the design of algorithms The theory of rewriting can be used as a basis to study the design and analysis of algorithms.  ...  Graph algorithms can be similarly presented abstractly using rewrite rules. General Paradigm Rewriting provides a general paradigm for the design of algorithms.  ... 
doi:10.1007/978-3-642-21691-6_3 fatcat:fa4763xizjhhbjt7vwxikz54wu

Metamodel-Based Model Transformation with Aspect-Oriented Constraints

László Lengyel, Tihamér Levendovszky, Gergely Mezei, Bertalan Forstner, Hassan Charaf
2006 Electronical Notes in Theoretical Computer Science  
It would be beneficial to describe a common constraint in a modular manner, and to designate the places where it is to be applied.  ...  A widely used approach to model transformation uses graph rewriting as the underlying transformation technique.  ...  The Object Constraint Language (OCL) [17] is a formal language for the analysis and design of software systems.  ... 
doi:10.1016/j.entcs.2005.10.020 fatcat:zvhxjknzzzeh7bknb2vlbe2fkm

Update rewriting and integrity constraint maintenance in a schema evolution support system

Carlo A. Curino, Hyun Jin Moon, Alin Deutsch, Carlo Zaniolo
2010 Proceedings of the VLDB Endowment  
that enable the rewriting of updates, and (iv) develop a unified approach for query and update rewriting under constraints.  ...  rewriting techniques used for queries.  ...  Our first attempt in this direction [11] , lacked the support of updates, was not designed to handle evolution steps modifying integrity constraints, and could only rewrite a limited class of queries.  ... 
doi:10.14778/1921071.1921078 fatcat:hzbitzrp7zcezdt42izapwwf7m

Constraint Validation in Model Compilers

László Lengyel, Tihamér Levendovszky, Hassan Charaf
2006 Journal of Object Technology  
An illustrative case study for constraint validation in rewriting rules is also provided. CONSTRAINT VALIDATION IN MODEL COMPILERS 108 J OURNAL OF OBJECT TECHNOLOGY V OL. 5, NO. 4 125  ...  Metamodeling is a central technique in the design of visual languages, and it reuses existing domains by extending the metamodel level.  ...  The Object Constraint Language [OMG OCL] is a formal language for analysis and design of software systems.  ... 
doi:10.5381/jot.2006.5.4.a3 fatcat:xkm3iawfbraodoxvwvy2tqj3ey


Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Marian Vittek
1996 Electronical Notes in Theoretical Computer Science  
ELAN implements computational systems, a concept that combines rewriting logic with the powerful description of rewriting strategies.  ...  Acknowledgment: We thank for their interaction in the design and the implementation of ELAN, Jounaidi Benhassen, Carlos Castro, Christophe Ringeissen, Patrick Viry and the Protheo team.  ...  Constraint Solving Combination Based on theoretical works on the modular combination of constraint solvers (see e.g.  ... 
doi:10.1016/s1571-0661(04)00032-5 fatcat:ky2gxehcrfbjxkj4zmcsqouqlq

Automated constraint-based nucleotide sequence selection for DNA computation

Alexander J. Hartemink, David K. Gifford, Julia Khodor
1999 Biosystems (Amsterdam. Print)  
The first version of scan utilized 24 hours of compute time to search a space of over 7.5 billion unary counter designs and found only 9 designs satisfying all of the pre-specified constraints.  ...  We present techniques for automating the design of computational systems built using DNA, given a set of high-level constraints on the desired behavior and performance of the system.  ...  constraints.  ... 
doi:10.1016/s0303-2647(99)00050-7 pmid:10636048 fatcat:pcjhoxqkrbft7mlt3tahk4kzzq

From Zinc to Design Model [chapter]

Reza Rafeh, Maria Garcia de la Banda, Kim Marriott, Mark Wallace
2006 Lecture Notes in Computer Science  
Currently, mappings to three very different design models based on constraint programming (CP), mixed integer programming (MIP) and local search are provided.  ...  Zinc Model Data File Conceptual Model SI-FZM Instance CP Rewriting Rules CP Model MIP Model LS Model Design Models CP SD-FZM MIP SD-FZM LS SD-FZM LS Rewriting Rules MIP Rewriting Rules Zinc Compiler  ...  As the name suggests, the rewrite rules used in this process depend on the target design model, and rewriting produces a Flattened Zinc model which is very close to the final design model.  ... 
doi:10.1007/978-3-540-69611-7_14 fatcat:2wipomw2fvf2dnjcbpabozluzq

Solver technology for system-level to RTL equivalence checking

A. Koelbl, R. Jacoby, H. Jain, C. Pixley
2009 2009 Design, Automation & Test in Europe Conference & Exhibition  
Checking the equivalence of real-life designs requires strong solver technology.  ...  Checking the equivalence of a system-level model against an RTL design is a major challenge.  ...  A drawback of normalizing rewrites is that they might increase the size of the DFG and thus can be counter-productive. 5) Implications between the two designs These rewrites add constraints that describe  ... 
doi:10.1109/date.2009.5090657 dblp:conf/date/KoelblJJP09 fatcat:27qkxqluljas7isepbx6bbckm4

Leveraging Application Data Constraints to Optimize Database-Backed Web Applications [article]

Xiaoxuan Liu, Shuxian Wang, Mengzhu Sun, Sharon Lee, Sicheng Pan, Joshua Wu, Cong Yan, Junwen Yang, Shan Lu, Alvin Cheung
2022 arXiv   pre-print
Once identified, ConstrOpt leverages the found constraints to optimize the application's physical design and query execution by rewriting queries.  ...  Instead of developing a fixed set of predefined rewriting rules, ConstrOpt employs an enumerate-test-verify technique to automatically exploit the discovered data constraints to improve query execution  ...  ConstrOpt's modular design makes it easy to add new types of rewrite rules.  ... 
arXiv:2205.02954v1 fatcat:culrfazmhvf4nma5baxsnygdg4

Modularized Constraint Management in Model Transformation Frameworks

2013 Acta Polytechnica Hungarica  
The precise definition of graph rewriting-based model transformation requires that beyond the topology of the rules, further textual constraints be added.  ...  The processing of visual models, within these frameworks, is an essential issue that can be addressed using graph rewriting techniques.  ...  This step is performed by the transformation designer. 2 Selecting the appropriate rewriting rules. This step is also completed by the transformation designer.  ... 
doi:10.12700/aph.10.01.2013.1.6. fatcat:kdndtvrlp5f4je2lxmd46e3cmu
« Previous Showing results 1 — 15 out of 155,043 results