Monadic Second-order Logic for Parameterized Verification
نویسندگان
چکیده
منابع مشابه
Monadic Second-order Logic for Parameterized Verification
Much work in automatic verification considers families of similar finite-state systems. But an often overlooked property is that sometimes a single finite-state system can be used to describe a parameterized, infinite family of systems. Thus verification of unbounded state spaces can take place by reduction to finite ones. The purpose of this article is to introduce Monadic Second-order Logic a...
متن کاملHardware Verification using Monadic Second-Order Logic
We show how the second-order monadic theory of strings can be used to specify hardware components and their behavior. This logic admits a decision procedure and counter-model generator based on canonical automata for formulas. We have used a system implementing these concepts to verify, or find errors in, a number of circuits proposed in the literature. The techniques we use make it easier to i...
متن کاملOn the Parameterized Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixedparameter tractable (fpt) on C by linear time parameterized algorithms, where the parameter is the tree-width plus the size of the formula. An immediate question is whether this is best possible or whether the result can be extended...
متن کاملGraph-Query Verification using Monadic Second-Order Logic
This paper presents a static verification algorithm for a core subset of UnCAL, the query algebra for graph-structured databases proposed by Bunemann et al. Given a query and input/output schemas, our algorithm statically verifies that any graph satisfying the input schema is converted by the query to a graph satisfying the output schema. The basic idea is to reformulate the semantics of UnCAL ...
متن کاملAsymptotic Monadic Second-Order Logic
In this paper we introduce so-called asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic Second-Order Logic over infinite words. This is a logic talking about ωwords labelled by integers. It contains full monadic second-order logic and can express asymptotic properties of integers ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1994
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v1i10.21660