Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Meta-F \(^\star \) : Proof Automation with SMT, Tactics, and Metaprograms
We introduce Meta-F \(^{\star }\) , a tactics and metaprogramming framework for the F
-
Chapter and Conference Paper
Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement
We show how to verify that large data center networks satisfy key properties such as all-pairs reachability under a bounded number of faults. To scale the analysis, we develop algorithms that identify network ...