Sciweavers

4460 search results - page 544 / 892
» Formal methods for interactive systems
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
CAV
2009
Springer
156views Hardware» more  CAV 2009»
16 years 1 months ago
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip desi...
Nicolas Coste, Holger Hermanns, Etienne Lantreibec...
SFM
2009
Springer
150views Formal Methods» more  SFM 2009»
16 years 1 months ago
Contract-Based Discovery and Composition of Web Services
In the context of Service Oriented Computing behavioural contracts are descriptions of the observable message-passing behaviour of services. In other terms, contracts are behaviour...
Mario Bravetti, Gianluigi Zavattaro
RSEISP
2007
Springer
16 years 24 days ago
Interpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
Yiyu Yao, Bing Zhou, Yaohua Chen
FM
2005
Springer
112views Formal Methods» more  FM 2005»
16 years 6 days ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...