Sciweavers

2084 search results - page 283 / 417
» Set Constraints in Logic Programming
Sort
View
CADE
2010
Springer
13 years 7 months ago
Monotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
Friedrich Neurauter, Aart Middeldorp, Harald Zankl
ICSE
2008
IEEE-ACM
14 years 9 months ago
Detecting model inconsistency through operation-based model construction
Nowadays, large-scale industrial software systems may involve hundreds of developers working on hundreds of different but related models representing parts of the same system spec...
Xavier Blanc, Isabelle Mounier, Alix Mougenot, Tom...
FLAIRS
2001
13 years 9 months ago
Detection of Inconsistencies in Complex Product Configuration Data Using Extended Propositional SAT-Checking
We present our consistency support tool BIS, an extension to the electronic product data management system (EPDMS) used at DaimlerChrysler AG to configure the Mercedes lines of pa...
Carsten Sinz, Andreas Kaiser, Wolfgang Küchli...
PLILP
1992
Springer
14 years 8 days ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ECOOP
2008
Springer
13 years 10 months ago
Extensible Universes for Object-Oriented Data Models
Abstract We present a datatype package that enables the shallow embedding technique to object-oriented specification and programming languages. This datatype package incrementally ...
Achim D. Brucker, Burkhart Wolff