Sciweavers

622 search results - page 24 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
DSN
2005
IEEE
14 years 1 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
35
Voted
AI
2011
Springer
13 years 3 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 3 months ago
Boom: Taking Boolean Program Model Checking One Step Further
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 ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
ENTCS
2006
112views more  ENTCS 2006»
13 years 8 months ago
Distributed Symbolic Bounded Property Checking
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
Pradeep Kumar Nalla, Roland J. Weiss, Prakash Moha...