4 papers:
DATE-2014-CabodiPQV #approximate #reachability #satisfiability- Tightening BDD-based approximate reachability with SAT-based clause generalization∗ (GC, PP, SQ, DV), pp. 1–6.
ICML-2010-GoldbergE #classification- Boosting Classifiers with Tightened L0-Relaxation Penalties (NG, JE), pp. 383–390.
LCTES-2010-AltmeyerMR #analysis #bound- Resilience analysis: tightening the CRPD bound for set-associative caches (SA, CM, JR), pp. 153–162.
CSL-2007-Kupferman #automaton- Tightening the Exchange Rates Between Automata (OK), pp. 7–22.