Sciweavers

717 search results - page 97 / 144
» Kill-safe synchronization abstractions
Sort
View
FM
2009
Springer
134views Formal Methods» more  FM 2009»
15 years 3 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
IPPS
2010
IEEE
15 years 3 months ago
Scalable parallel I/O alternatives for massively parallel partitioned solver systems
Abstract--With the development of high-performance computing, I/O issues have become the bottleneck for many massively parallel applications. This paper investigates scalable paral...
Jing Fu, Ning Liu, Onkar Sahni, Kenneth E. Jansen,...
ISPW
1991
IEEE
15 years 9 months ago
Policy-directed coordination and cooperation
product and the project as well as to define synchronization (or interaction) abstractions; activity definitions are used to model the process activities that transform the produ...
Dewayne E. Perry
DAC
1998
ACM
16 years 6 months ago
Design and Specification of Embedded Systems in Java Using Successive, Formal Refinement
Successive, formal refinement is a new approach for specification of embedded systems using a general-purpose programming language. Systems are formally modeled as Abstractable Sy...
James Shin Young, Josh MacDonald, Michael Shilman,...
CC
2009
Springer
141views System Software» more  CC 2009»
16 years 6 months ago
Compile-Time Analysis and Specialization of Clocks in Concurrent Programs
Abstract. Clocks are a mechanism for providing synchronization barriers in concurrent programming languages. They are usually implemented using primitive communication mechanisms a...
Nalini Vasudevan, Olivier Tardieu, Julian Dolby, S...