65 search results - page 9 / 13 » Program termination and well partial orderings |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
CSCLP
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
FUIN
2006
13 years 9 months ago
2006
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
PDP
2007
IEEE
14 years 4 months ago
2007
IEEE
Universal Plug and Play (UPnP) is a widely accepted standard for automatically detecting devices and services in a local area network as well as for describing and controlling the...
MODELS
2009
Springer
14 years 2 months ago
2009
Springer
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...