We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
with this, the thread abstraction was introduced. While threads are handling events, or awaiting specific events, unrelated events can be handled by other threads. Unfortunately, ...
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
This paper describes a modeling and simulation framework called VisualSense for wireless sensor networks that builds on and leverages Ptolemy II. This framework supports actor-ori...
Philip Baldwin, Sanjeev Kohli, Edward A. Lee, Xiao...
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
Bin Lei, Zhiming Liu, Charles Morisset, Xuandong L...