Monotonicity Analysis Can Speed Up Verification

نویسندگان

  • Marcelo F. Frias
  • Rodolfo Gamarra
  • Gabriela Steren
  • Lorena Bourg
چکیده

We introduce a strategy for the verification of relational specifications based on the analysis of monotonicity of variables within formulas. By comparing with the Alloy Analyzer, we show that for a relevant class of problems this technique outperforms analysis of the same problems using SAT-solvers, while consuming a fraction of the memory SAT-solvers require.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity has only a relative effect on the complexity of quantifier verification

We discuss a computational model of quantifier verification. It predicts that there is no effect of monotonicity on the verification of numerical quantifiers but only the interaction of monotonicty and sentential truth-values. Moreover, it predicts no monotonicity or interaction with truth-values effects for proportional quantifiers. We present an experimental study supporting the predictions o...

متن کامل

Static Monotonicity Analysis for λ-Definable Functions over Lattices

We employ static analysis to examine monotonicity of functions defined over lattices in a λ-calculus augmented with constants, branching, meets, joins and recursive definitions. The need for such a verification procedure has recently arisen in our work with a static analyzer generator called Zoo, in which the specification of static analysis (input to Zoo) consists of finite-height lattice defi...

متن کامل

Trading Monotonicity Demands versus Eciency

The present paper deals with the learnability of indexed families L of uniformly recursive languages from positive data. We consider the in uence of three monotonicity demands and their dual counterparts to the e ciency of the learning process. The e ciency of learning is measured in dependence on the number of mind changes a learning algorithm is allowed to perform. The three notions of (dual)...

متن کامل

Robust speaker verification using short-time frequency with long-time window and fusion of multi-resolutions

This study presents a novel approach of feature analysis to speaker verification. There are two main contributions in this paper. First, the feature analysis of short-time frequency with long-time window (SFLW) is a compact feature for the efficiency of speaker verification. The purpose of SFLW is to take account of short-time frequency characteristics and longtime resolution at the same time. ...

متن کامل

Local Monotonicity and Full Stability for Parametric Variational Systems

B. S. MORDUKHOVICH and T. T. A. NGHIA Abstract. The paper introduces and characterizes new notions of Lipschitzian and Hölderian full stability of solutions to general parametric variational systems described via partial subdifferential of prox-regular functions acting in finite-dimensional and Hilbert spaces. These notions, postulated certain quantitative properties of single-valued localizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006