Sciweavers

ENTCS
2007
108views more  ENTCS 2007»
13 years 4 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig
PEPM
2010
ACM
13 years 6 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
GMP
2006
IEEE
13 years 10 months ago
Subdivision Termination Criteria in Subdivision Multivariate Solvers
Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] ...
Iddo Hanniel, Gershon Elber