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...
Main Authors: | Horn, A, Kroening, D |
---|---|
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
2015
|
פריטים דומים
-
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
מאת: Horn, A, et al.
יצא לאור: (2015) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
מאת: Antonino, P, et al.
יצא לאור: (2019) -
An efficient SAT encoding of circuit codes
מאת: Chebiryak, Y, et al.
יצא לאור: (2008) -
A SAT−Based Algorithm for Reparameterization in Symbolic Simulation
מאת: Chauhan, P, et al.
יצא לאור: (2004) -
A SAT-based algorithm for reparameterization in symbolic simulation
מאת: Chauhan, P, et al.
יצא לאור: (2004)