Sciweavers

238 search results - page 23 / 48
» Compositional Proof Methods for Concurrency: A Semantic Appr...
Sort
View
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...
ISOLA
2010
Springer
14 years 8 months ago
Ten Years of Performance Evaluation for Concurrent Systems Using CADP
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
Nicolas Coste, Hubert Garavel, Holger Hermanns, Fr...
ENTCS
2010
118views more  ENTCS 2010»
14 years 7 months ago
Systematic Refinement of Performance Models for Concurrent Component-based Systems
Model-driven performance prediction methods require detailed design models to evaluate the performance of software systems during early development stages. However, the complexity...
Lucia Kapová, Steffen Becker
FORTE
2009
14 years 7 months ago
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
Luciano Baresi, Domenico Bianculli, Sam Guinea, Pa...
AGP
1996
IEEE
15 years 1 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella