227 search results - page 13 / 46 » Bounded Model Checking of Concurrent Programs |
156
click to vote
SPIN
2000
Springer
15 years 9 months ago
2000
Springer
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
145
click to vote
ICALP
2007
Springer
16 years 22 hour ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
170
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
144
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
140
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...