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...
Autors principals: | Horn, A, Kroening, D |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2015
|
Ítems similars
-
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
per: Horn, A, et al.
Publicat: (2015) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
per: Antonino, P, et al.
Publicat: (2019) -
An efficient SAT encoding of circuit codes
per: Chebiryak, Y, et al.
Publicat: (2008) -
A SAT−Based Algorithm for Reparameterization in Symbolic Simulation
per: Chauhan, P, et al.
Publicat: (2004) -
A SAT-based algorithm for reparameterization in symbolic simulation
per: Chauhan, P, et al.
Publicat: (2004)