Sciweavers

136 search results - page 18 / 28
» Assume-Guarantee Verification of Concurrent Systems
Sort
View
CACM
2010
179views more  CACM 2010»
13 years 7 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
CAV
2010
Springer
197views Hardware» more  CAV 2010»
13 years 10 months ago
Abstract Analysis of Symbolic Executions
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha C...
ENTCS
2008
99views more  ENTCS 2008»
13 years 7 months ago
ArcAngelC: a Refinement Tactic Language for Circus
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...
M. V. M. Oliveira, A. L. C. Cavalcanti
SRDS
2000
IEEE
13 years 12 months ago
Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
Jerzy Brzezinski, Michal Sajkowski
FM
2008
Springer
127views Formal Methods» more  FM 2008»
13 years 9 months ago
A Schedulerless Semantics of TLM Models Written in SystemC Via Translation into LOTOS
TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used fo...
Olivier Ponsini, Wendelin Serwe