622 search results - page 24 / 125 » Answer Set Programming and Bounded Model Checking |
152
click to vote
ACSD
2005
IEEE
15 years 11 months ago
2005
IEEE
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...
182
click to vote
DSN
2005
IEEE
15 years 11 months ago
2005
IEEE
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...
189
click to vote
AI
2011
Springer
15 years 28 days ago
2011
Springer
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...
147
click to vote
TACAS
2010
Springer
16 years 26 days 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 ...
138
click to vote
ENTCS
2006
15 years 5 months ago
2006
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...