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)