The Dynamic Impact of Periodic Review on Women’s Rights

Human rights treaty bodies have been frequently criticized as useless and the regime’s self-reporting procedure widely viewed as a whitewash. Yet very little research explores what, if any, influence this periodic review process has on governments’ implementation of and compliance with treaty obligations. We argue oversight committees may play an important role in improving rights on the ground by providing information for international and primarily domestic audiences. This paper examines the cumulative effects on women’s rights of self-reporting and oversight review, using original data on the history of state reporting to and review by the Committee on the Elimination of Discrimination against Women (CmEDAW). Using a dynamic approach to study the effects of the periodic review process, we find that self-reporting has a significant positive effect on women’s rights. We explore three clusters of evidence for the domestic mobilization mechanism: information provision through domestic civil society organizations; publicity and critique through the domestic media; and parliamentary attention, debate, and implementation of recommendations. This is the first study to present positive evidence on the effects of self-reporting on rights and to describe the mechanisms that link Geneva bodies with local politics. Our findings challenge the received wisdom that the process of reporting to these treaty bodies is basically useless

An Instantiation-Based Approach for Solving Quantified Linear Arithmetic

This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, implementation, and evaluation. Using this framework we derive decision procedures for linear real arithmetic (LRA) and linear integer arithmetic (LIA) formulas with one quantifier alternation. Our procedure can be integrated into the solving architecture used by typical SMT solvers. Experimental results on standardized benchmarks from model checking, static analysis, and synthesis show that our implementation of the procedure in the SMT solver CVC4 outperforms existing tools for quantified linear arithmetic

SMT-based Model Checking for Recursive Programs

We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both "over-" and "under-approximations" of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible counterexamples and detect convergence to a proof. We show that for programs and properties over a decidable theory, the algorithm is guaranteed to find a counterexample, if one exists. However, efficiency depends on an oracle for quantifier elimination (QE). For Boolean Programs, the algorithm is a polynomial decision procedure, matching the worst-case bounds of the best BDD-based algorithms. For Linear Arithmetic (integers and rationals), we give an efficient instantiation of the algorithm by applying QE "lazily". We use existing interpolation techniques to over-approximate QE and introduce "Model Based Projection" to under-approximate QE. Empirical evaluation on SV-COMP benchmarks shows that our algorithm improves significantly on the state-of-the-art.Comment: originally published as part of the proceedings of CAV 2014; fixed typos, better wording at some place