Sciweavers

195 search results - page 27 / 39
» Efficient Model Checking of PSL Safety Properties
Sort
View
TSE
2010
110views more  TSE 2010»
14 years 10 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
POPL
2007
ACM
16 years 6 hour ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...
FMCAD
2004
Springer
15 years 3 months ago
A Simple Method for Parameterized Verification of Cache Coherence Protocols
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...
Ching-Tsun Chou, Phanindra K. Mannava, Seungjoon P...
ECAI
2008
Springer
15 years 1 months ago
Incremental Component-Based Construction and Verification of a Robotic System
Abstract-- Autonomous robots are complex systems that require the interaction/cooperation of numerous heterogeneous software components. Nowadays, robots are critical systems and m...
Ananda Basu, Matthieu Gallien, Charles Lesire, Tha...
FUIN
2010
172views more  FUIN 2010»
14 years 9 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...