317 search results - page 37 / 64 » Reasoning about the Implementation of Concurrency Abstractio... |
123
click to vote
SAC
2008
ACM
15 years 1 days ago
2008
ACM
One reasonable categorization of coordination models is into data sharing or message passing, based on whether the information necessary to coordination is persistently stored and...
ZUM
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. This paper presents some of our requirements for a Z typechecker: that the typechecker accept all well-typeable formulations, however contrived; that it gather informatio...
132
click to vote
ESORICS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
113
click to vote
FASE
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
139
click to vote
TPCD
1994
15 years 2 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...