Sciweavers

36 search results - page 6 / 8
» concur 2010
Sort
View
CONCUR
2010
Springer
15 years 4 days ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
CONCUR
2010
Springer
15 years 1 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
CONCUR
2010
Springer
15 years 1 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
CONCUR
2010
Springer
15 years 1 months ago
A Theory of Design-by-Contract for Distributed Multiparty Interactions
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Y...
CONCUR
2007
Springer
15 years 6 months ago
Solving Games Via Three-Valued Abstraction Refinement
Games via Three-Valued Abstraction Refinement Luca de Alfaro, Pritam Roy PII: S0890-5401(10)00018-0 DOI: 10.1016/j.ic.2009.05.007 Reference: YINCO 3711 To appear in: Information an...
Luca de Alfaro, Pritam Roy