Sciweavers

501 search results - page 67 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
B
2007
Springer
15 years 1 months ago
Automatic Translation from Combined B and CSP Specification to Java Programs
Abstract. A recent contribution to the formal specification and verification of concurrent systems is the integration of the state- and event-based approaches B and CSP, specifical...
Letu Yang, Michael Poppleton
FMCAD
2004
Springer
15 years 1 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...
JUCS
2006
131views more  JUCS 2006»
14 years 9 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
KBSE
2005
IEEE
15 years 3 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
15 years 6 months ago
Stars in VCC: Complementing Simulation with Worst-Case Analysis
tems. STARS manipulates abstract representations of system components to obtain upper bounds on the number of various events in the system, as well as a bound on the response time....
Felice Balarin