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