The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Finite Model Finding for Parameterized Verification
[article]
2010
arXiv
pre-print
Preserved Fulltext
Other Versions
The verification of a safety property is reduced to a pure logical problem of finding a countermodel for a first-order formula. ...
of large classes of infinite state and parameterized systems. ...
A negative answer for the above question means the safety property ("not B") holds for the parameterized system. ...
arXiv:1011.0447v2
fatcat:eeiehou3hnhjpcpnxzvskbnz64
Finite countermodels for safety verification of parameterized tree systems
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper we deal with verification of safety properties of parameterized systems with a tree topology. ...
The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. ...
Acknowledgments The author is grateful to anonymous referees of FMCAD 2011 conference who provided with many helpful comments on the previous version of this paper. ...
arXiv:1107.5142v1
fatcat:jluqdti7ojghzpsqvhtphjmul4
A Survey of Regular Model Checking
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. ...
Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, ...
Verification Problems We will consider two types of verification problems in this paper. The first problem is verification of safety properties. ...
doi:10.1007/978-3-540-28644-8_3
fatcat:xblrrywqhzhpbfqvudbhfrl5za
Liveness and Acceleration in Parameterized Verification
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Most previous approaches to the uniform verification of parameterized systems, only considered safety properties of such systems. ...
The paper considers the problem of uniform verification of parameterized systems by symbolic model checking, using formulas in fs1s (a syntactic variant of the 2nd order logic ws1s) for the symbolic representation ...
parameterized verification of safety properties. ...
doi:10.1007/10722167_26
fatcat:3x7gvdur7zc7pnvija45rr64v4
First-order logic for safety verification of hedge rewriting systems
2015
Electronic Communications of the EASST
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we deal with verification of safety properties of hedge rewriting systems and their generalizations. ...
The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which is further tackled by a generic finite model finding procedure. ...
Safety verification for hedge rewriting systems has been already addressed e.g. in [14, 11, 27] with the regular invariants playing the major role. ...
doi:10.14279/tuj.eceasst.72.1020
dblp:journals/eceasst/Lisitsa15
fatcat:u6b4weflsbbt5hll3zk3wjekz4
Poster Abstract: Getting Out of the Way -- Safety Verification without Compromise
2012
2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The intelligent transportation systems problems of adaptive cruise control and variable timing for traffic intersection signals are explored with emphasis on verification of safety properties. ...
Moreover, designs for ACC for convoying put emphasis on properties like string stability [1] and take safety for granted. ...
Hybrid Systems Model Checking for Safety Rather than assuming that no information is known about the braking capabilities of adjacent vehicles, we assume that the braking class of that surrounding vehicles ...
doi:10.1109/iccps.2012.51
dblp:conf/iccps/PavlicPSW12
fatcat:rqgtwqhrofc6xpg3zihmyr7snu
McScM: A General Framework for the Verification of Communicating Machines
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
McScM provides tools for the safety verification and controller synthesis of these infinite-state models. ...
Seen as a general framework for the class of transition systems with finite control/infinite data, McScM delivers the basic infrastructure for implementing verification algorithms, and privileges to conveniently ...
If a CM system does not satisfy a safety property, control automatically computes a restriction of this system that assures safety by implementing the distributed control algorithm presented in [7] ( ...
doi:10.1007/978-3-642-28756-5_34
fatcat:n5mqloosaffj5dqnzse6htx7um
Parameterized Synthesis with Safety Properties
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel learning based approach to the synthesis of reactive controllers for parameterized systems from safety specifications. ...
Parameterized synthesis offers a solution to the problem of constructing correct and verified controllers for parameterized systems. ...
In particular, for verification of those properties in parameterized systems regular model checking has seen successful application [16, 29] . ...
arXiv:2009.13459v1
fatcat:r4y2laxzizeippl37xxqin5fda
Monotonic Abstraction in Parameterized Verification
2008
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes which are organized in a linear array. ...
This makes it possible to use existing methods for verification of well quasi-ordered programs. ...
The main techniques used for verification of parameterized systems have been defined within the paradigm of regular model checking [14, 7, 9] . ...
doi:10.1016/j.entcs.2008.12.027
fatcat:lhhgzxxwyjedvdu6bmpa5tbn4q
Fair Termination for Parameterized Probabilistic Concurrent Systems
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
One well-known symbolic framework for the parameterized verification of non-probabilistic concurrent systems is regular model checking. ...
In contrast to safety, the parameterized verification of liveness is currently still considered extremely challenging especially in the presence of probabilities in the model. ...
There are few techniques for automatic verification of liveness properties of parameterized probabilistic programs. ...
doi:10.1007/978-3-662-54577-5_29
fatcat:pm5gupls4fcnjanif4kz5nrdhq
View Abstraction – A Tutorial (Invited Paper)
2015
International Workshop on Synthesis of Complex Parameters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We consider parameterized verification, i.e., proving correctness of a system with an unbounded number of processes. ...
We describe the method of view abstraction whose aim is to provide a small model property, i.e., showing correctness by only inspecting instances of the system consisting of a small fixed number of processes ...
For such systems, we consider the verification of safety properties. Intuitively, a safety property states that nothing bad will happen during the execution of the system. ...
doi:10.4230/oasics.syncop.2015.1
dblp:conf/syncop/AbdullaHH15
fatcat:6g4svreqgvd3zbj7ydetogdinu
LEVER: A Tool for Learning Based Verification
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This makes verification of these systems hard-in fact, for most common classes of infinite state systems, the verification problem is undecidable. ...
To see our main idea, consider the problem of identifying the set of reachable states which is needed for verifying safety properties. ...
doi:10.1007/11817963_43
fatcat:4cfwwhjmijecxkd53n53mgycq4
Regular Model Checking
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also present a method for verifying ω-regular properties of parameterized systems, by computation of the transitive closure of a transition relation. ...
We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. ...
Acknowledgments We are grateful to Amir Pnueli for fruitful discussions. Collaboration was supported by a travel grant from the ARTES network for real time research and graduate education in Sweden. ...
doi:10.1007/10722167_31
fatcat:2alyobcqofgzxfa6bwxux4xq3y
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
One well-known symbolic framework for the parameterized verification of non-probabilistic concurrent systems is regular model checking. ...
In contrast to safety, the parameterized verification of liveness is currently still considered extremely challenging especially in the presence of probabilities in the model. ...
This involves constructing a new parameterization of the system (using the idea of weakly finite systems) and a proof that the transformation preserves reachability probabilities. 2. ...
arXiv:1710.10756v1
fatcat:seuaetagorfwdkhx7aqhagzw4y
Finite Countermodel Based Verification for Program Transformation (A Case Study)
2015
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2015 pre-print arXiv:1512.03859v1 fatcat:znalgrr6yzafrcu2wab5xcxpeu
properties of computing systems were introduced and demonstrated. ...
This paper considers the question how finite countermodels for safety verification method might be used in Turchin's supercompilation method. ...
Acknowlegements We are grateful to the reviewers of the paper for their generous and constructive comments, which allowed us to improve the presentation of this paper and gives us lines for future work ...
doi:10.4204/eptcs.199.2
fatcat:k4g2rkvklvedfjnnrkqzh6anye
« Previous
Showing results 1 — 15 out of 3,924 results