35 search results - page 2 / 7 » Monotonic Abstraction in Parameterized Verification |
FORTE
2009
14 years 8 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
78
Voted
IJFCS
2008
14 years 10 months ago
2008
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
78
Voted
FORTE
2008
14 years 11 months ago
2008
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
128
click to vote
CHARME
2003
Springer
15 years 1 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
74
Voted
FMCAD
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...