41 citations · 45 across the 4 of their papers we have counts for
5 papers
A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification
Alex Horn, Ali Kheradmand, Mukul R. Prasad
Network verification promises to detect errors, such as black holes and forwarding loops, by logically analyzing the control or data plane. To do so efficiently, the state-of-the-a…
Delta-net: Real-time Network Verification Using Atoms
Alex Horn, Ali Kheradmand, Mukul R. Prasad
Real-time network verification promises to automatically detect violations of network-wide reachability invariants on the data plane. To be useful in practice, these violations nee…
A Concurrency Problem with Exponential DPLL(T) Proofs
Liana Hadarean, Alex Horn, Tim King
Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction…
Faster linearizability checking via -compositionality
Alex Horn, Daniel Kroening
Linearizability is a well-established consistency and correctness criterion for concurrent data types. An important feature of linearizability is Herlihy and Wing's locality princi…
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
Alex Horn, Daniel Kroening
Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in pa…