Sciweavers

1757 search results - page 29 / 352
» Alternating Refinement Relations
Sort
View
102
Voted
ACTA
2006
108views more  ACTA 2006»
15 years 16 days ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
BIBE
2007
IEEE
125views Bioinformatics» more  BIBE 2007»
15 years 6 months ago
Large-scale Discovery of Regulatory Motifs Involved in Alternative Splicing
Alternative splicing is a highly important process in many eukaryotic organisms, but surprisingly little is known about its regulation. Often, this process involves cis-regulatory ...
Sihui Zhao, Jihye Kim, Steffen Heber
FAC
2010
107views more  FAC 2010»
14 years 9 months ago
Atomic actions, and their refinements to isolated protocols
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an isolated atomic action as a family of transitions with a common before-state, an...
Richard Banach, Gerhard Schellhorn
FAC
2010
121views more  FAC 2010»
14 years 9 months ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...
FDL
2007
IEEE
15 years 6 months ago
Modelling Alternatives for Cycle Approximate Bus TLMs
Transaction level models (TLMs) can be constructed at t levels of abstraction, denoted as untimed (UT), cycle-approximate (CX), and cycle accurate (CA) in this paper. The choice o...
Martin Radetzki, Rauf Salimi Khaligh