1757 search results - page 29 / 352 » Alternating Refinement Relations |
147
click to vote
ACTA
2006
15 years 6 months ago
2006
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...
138
click to vote
BIBE
2007
IEEE
16 years 7 days ago
2007
IEEE
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 ...
148
click to vote
FAC
2010
15 years 3 months ago
2010
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...
180
click to vote
FAC
2010
15 years 3 months ago
2010
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...
194
click to vote
FDL
2007
IEEE
16 years 7 days ago
2007
IEEE
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...