1342 search results - page 54 / 269 » Ordered Programs as Abductive Systems |
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
ECP
1997
Springer
14 years 26 days ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
OPODIS
2003
13 years 10 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
SPIN
2000
Springer
14 years 8 days ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
ICSEA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—In order to check the fulfilment of non-functional requirements at an early system design and development stage, we provide a framework that facilitates the combination ...