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)