Witness Runs for Counter Machines
نویسندگان
چکیده
In this paper, we present recent results about the verification of counter machines by using decision procedures for Presburger arithmetic. We recall several known classes of counter machines for which the reachability sets are Presburger-definable as well as temporal logics with arithmetical constraints. We discuss issues related to flat counter machines, path schema enumeration, and the use of SMT solvers.
منابع مشابه
بررسی ضرورت کنترل کیفی دستگاههای شمارنده سلول های خونی در آزمایشگاههای تشخیص طبی
Background and aim:Blood cells have an important role in human healthy, so their shapes and numbers are defined as human healthy indexes. These factors are measured by cell counter machines. Presenting a high quality report according to cell counters output is dependant on their operational accuracy. Therefore it was necessary to do a study on quality control of blood cell counter machines in s...
متن کاملQuasi-Linearizability is Undecidable
Quasi-linearizability is a quantitative relaxation of linearizability. It preserves the intuition of the standard notion of linearizability and permits more flexibility. The decidability of quasi-linearizability has been remaining open in general for a bounded number of processes. In this paper we show that the problem of whether a library is quasilinearizable with respect to a regular sequenti...
متن کاملModel Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of registers and on the use of propositional variables for control locations). The logic has the ability to...
متن کاملReuse of Verification Results - Conditional Model Checking, Precision Reuse, and Verification Witnesses
Verification is a complex algorithmic task, requiring large amounts of computing resources. One approach to reduce the resource consumption is to reuse information from previous verification runs. This paper gives an overview of three techniques for such information reuse. Conditional model checking outputs a condition that describes the state space that was successfully verified, and accepts a...
متن کاملSome Zero-Knowledge Proofs
Consider a general proof system for a language in NP. That is, suppose we have a language L 2 NP and a string x 2 L. For example, let L be GRAPH-ISOMORPHISM and x = (G0; G1) a pair of isomorphic graphs. Suppose Victor is not convinced that x 2 L, so he calls his friend Peggy (who is infinitely powerful) and asks for a proof. Peggy agrees, because she’s nice that way, applies her infinite power,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013