Sciweavers

2162 search results - page 296 / 433
» Automated Reasoning on Feature Models
Sort
View
LOPSTR
2009
Springer
15 years 11 months ago
Deciding Full Branching Time Logic by Program Transformation
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 ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
LOPSTR
2009
Springer
15 years 11 months ago
Using Rewrite Strategies for Testing BUpL Agents
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...
Lacramioara Astefanoaei, Frank S. de Boer, M. Birn...
LICS
2008
IEEE
15 years 11 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
CSL
2007
Springer
15 years 10 months ago
Linear Realizability
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...
Naohiko Hoshino
ECSQARU
2007
Springer
15 years 10 months ago
On Decision Support Under Risk by the WOWA Optimization
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...
Wlodzimierz Ogryczak, Tomasz Sliwinski