On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal verification techniques. Among these, symbolic techniques h...
المؤلفون الرئيسيون: | Horn, A, Kroening, D |
---|---|
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
2015
|
مواد مشابهة
-
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
حسب: Horn, A, وآخرون
منشور في: (2015) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
حسب: Antonino, P, وآخرون
منشور في: (2019) -
An efficient SAT encoding of circuit codes
حسب: Chebiryak, Y, وآخرون
منشور في: (2008) -
A SAT−Based Algorithm for Reparameterization in Symbolic Simulation
حسب: Chauhan, P, وآخرون
منشور في: (2004) -
A SAT-based algorithm for reparameterization in symbolic simulation
حسب: Chauhan, P, وآخرون
منشور في: (2004)