2162 search results - page 296 / 433 » Automated Reasoning on Feature Models |
187
click to vote
LOPSTR
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
195
click to vote
LOPSTR
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
168
click to vote
LICS
2008
IEEE
16 years 24 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
114
click to vote
CSL
2007
Springer
16 years 18 days ago
2007
Springer
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
135
click to vote
ECSQARU
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. The problem of averaging outcomes under several scenarios to form overall objective functions is of considerable importance in decision support under uncertainty. The fuz...