2162 search results - page 157 / 433 » Automated Reasoning on Feature Models |
151
click to vote
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
124
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using t...
115
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
Syntax and Variable Binding d Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh op a theory of abstract synt...
117
click to vote
EWCBR
1998
Springer
1998
Springer
Collecting Experience on the Systematic Development of CBR Applications Using the INRECA Methodology
15 years 8 months ago
This paper presents an overview of the INRECA methodology for building and maintaining CBR applications. This methodology supports the collection and reuse of experience on the sys...
138
click to vote
EWCBR
1998
Springer
15 years 8 months ago
1998
Springer
Object-oriented case representations require approaches for similarity assessment that allow to compare two differently structured objects, in particular, objects belonging to diff...