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)