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...
Main Authors: | Horn, A, Kroening, D |
---|---|
格式: | Journal article |
語言: | English |
出版: |
2015
|
相似書籍
-
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
由: Horn, A, et al.
出版: (2015) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
由: Antonino, P, et al.
出版: (2019) -
An efficient SAT encoding of circuit codes
由: Chebiryak, Y, et al.
出版: (2008) -
A SAT−Based Algorithm for Reparameterization in Symbolic Simulation
由: Chauhan, P, et al.
出版: (2004) -
A SAT-based algorithm for reparameterization in symbolic simulation
由: Chauhan, P, et al.
出版: (2004)