Sciweavers

58 search results - page 8 / 12
» Verifying Concurrent Systems with Symbolic Execution
Sort
View
PPOPP
2005
ACM
14 years 4 months ago
Automated type-based analysis of data races and atomicity
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
Amit Sasturkar, Rahul Agarwal, Liqiang Wang, Scott...
NFM
2011
223views Formal Methods» more  NFM 2011»
13 years 5 months ago
Generating Data Race Witnesses by an SMT-Based Analysis
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakal...
FATES
2004
Springer
14 years 4 months ago
Online Testing of Real-time Systems Using Uppaal
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
Kim Guldstrand Larsen, Marius Mikucionis, Brian Ni...
TLDI
2010
ACM
210views Formal Methods» more  TLDI 2010»
14 years 7 months ago
Effects for cooperable and serializable threads
Reasoning about the correctness of multithreaded programs is complicated by the potential for unexpected interference between threads. Previous work on controlling thread interfer...
Jaeheon Yi, Cormac Flanagan
IPPS
2010
IEEE
13 years 8 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik