Sciweavers

118 search results - page 19 / 24
» Word-Level Sequential Memory Abstraction for Model Checking
Sort
View
93
Voted
RTAS
2010
IEEE
14 years 7 months ago
Timing Analysis for TDMA Arbitration in Resource Sharing Systems
Abstract--Modern computing systems have adopted multicore architectures and multiprocessor systems on chip (MPSoCs) for accommodating the increasing demand on computation power. Ho...
Andreas Schranzhofer, Jian-Jia Chen, Lothar Thiele
FOSSACS
2001
Springer
15 years 1 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
LCPC
2007
Springer
15 years 3 months ago
Multidimensional Blocking in UPC
Abstract. Partitioned Global Address Space (PGAS) languages offer an attractive, high-productivity programming model for programming large-scale parallel machines. PGAS languages, ...
Christopher Barton, Calin Cascaval, George Alm&aac...
SBMF
2009
Springer
105views Formal Methods» more  SBMF 2009»
15 years 4 months ago
Verifying Compiled File System Code
Abstract. This paper presents a case study on retrospective verication of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
Jan Tobias Mühlberg, Gerald Lüttgen
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 years 4 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir