Sciweavers

1415 search results - page 83 / 283
» Verified systems by composition from verified components
Sort
View
ICNP
2005
IEEE
15 years 12 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
ISSTA
2004
ACM
15 years 11 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
IAJIT
2008
94views more  IAJIT 2008»
15 years 6 months ago
Enforcing User-Defined Constraints during the Run-Time in OODB
: In this paper a run-time model is proposed. The run-time model enforces integrity constraints for attributes that are derived from composition and inheritance hierarchies. The ru...
Belal Zaqaibeh, Hamidah Ibrahim, Ali Mamat, Md Nas...
TII
2010
166views Education» more  TII 2010»
15 years 1 months ago
Source-to-Source Architecture Transformation for Performance Optimization in BIP
Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions ...
Marius Bozga, Mohamad Jaber, Joseph Sifakis
ICALP
2010
Springer
15 years 11 months ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink