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...
Những tác giả chính: | Horn, A, Kroening, D |
---|---|
Định dạng: | Journal article |
Ngôn ngữ: | English |
Được phát hành: |
2015
|
Những quyển sách tương tự
-
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
Bằng: Horn, A, et al.
Được phát hành: (2015) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
Bằng: Antonino, P, et al.
Được phát hành: (2019) -
An efficient SAT encoding of circuit codes
Bằng: Chebiryak, Y, et al.
Được phát hành: (2008) -
A SAT−Based Algorithm for Reparameterization in Symbolic Simulation
Bằng: Chauhan, P, et al.
Được phát hành: (2004) -
A SAT-based algorithm for reparameterization in symbolic simulation
Bằng: Chauhan, P, et al.
Được phát hành: (2004)