Sciweavers

42 search results - page 5 / 9
» Building Verification Condition Generators by Compositional ...
Sort
View
POPL
2010
ACM
15 years 7 months ago
On the Verification Problem for Weak Memory Models
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...
SIGOPSE
1998
ACM
15 years 1 months ago
Goal-oriented programming, or composition using events, or threads considered harmful
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, ...
Robbert van Renesse
CAV
2007
Springer
212views Hardware» more  CAV 2007»
15 years 1 months ago
A Tutorial on Satisfiability Modulo Theories
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...
Leonardo Mendonça de Moura, Bruno Dutertre,...
IPSN
2004
Springer
15 years 2 months ago
Modeling of sensor nets in Ptolemy II
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...
ENTCS
2010
99views more  ENTCS 2010»
14 years 9 months ago
State Based Robustness Testing for Components
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...