Filters








70,362 Hits in 2.2 sec

Parameterized Compositional Model Checking [chapter]

Kedar S. Namjoshi, Richard J. Trefler
2016 Lecture Notes in Computer Science  
The Parameterized Compositional Model Checking Problem (PCMCP) is to decide, using compositional proofs, whether a property holds for every instance of a parameterized family of process networks.  ...  For the verification of safety properties, the PCMCP is shown to be much more tractable than the more general Parameterized Model Checking Problem (PMCP).  ...  This is referred to as the parameterized model checking problem (PMCP). The problem is, however, generally undecidable [5] .  ... 
doi:10.1007/978-3-662-49674-9_39 fatcat:t2tj5wifivhw3kkq4ihzuyopky

Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking [chapter]

K. L. McMillan
2001 Lecture Notes in Computer Science  
The proof uses the SMV proof assistant, a proof system based on symbolic model checking. The proof process is described step by step.  ...  The protocol model is derived from an earlier proof of the FLASH protocol, using the PVS system, allowing a direct comparison between the two methods.  ...  Here, we consider applying methods of compositional model checking to the problem.  ... 
doi:10.1007/3-540-44798-9_17 fatcat:73hvrs7fjvfonl772fmegy7iia

An invariant-based approach to the verification of asynchronous parameterized networks

Igor V. Konnov, Vladimir A. Zakharov
2010 Journal of symbolic computation  
Emerson and Namjoshi (1995) demonstrated how to exploit symmetry to cope with model checking of parameterized specifications.  ...  In order to verify parameterized RSVP model according to the technique described in Section 4 we break the checking procedure into two stages.  ... 
doi:10.1016/j.jsc.2008.11.006 fatcat:z2erlk7mpjcfdovfv3kbgazzpq

Model-Checking Parameterized Concurrent Programs Using Linear Interfaces [chapter]

Salvatore La Torre, P. Madhusudan, Gennaro Parlato
2010 Lecture Notes in Computer Science  
We propose that such programs can be model-checked by iteratively considering the program under k roundrobin schedules, for increasing values of k, using a novel compositional construct called linear interfaces  ...  We implement a symbolic model-checker, and report on experiments verifying parameterized predicate abstractions of Linux device drivers interacting with a kernel to show the efficacy of our technique.  ...  Model-checking parameterized programs, even when the data domain is finite, is, in general, undecidable.  ... 
doi:10.1007/978-3-642-14295-6_54 fatcat:uf2ryxxmkvcffi367mjmcsaywy

Parameterized Verification of π-Calculus Systems [chapter]

Ping Yang, Samik Basu, C. R. Ramakrishnan
2006 Lecture Notes in Computer Science  
In this paper we present an automatic verification technique for parameterized systems where the subsystem behavior is modeled using the πcalculus.  ...  We demonstrate the effectiveness of our technique by using it to verify properties of a wide variety of parameterized systems that are beyond the reach of existing techniques.  ...  -Optimizations to compositional model checking.  ... 
doi:10.1007/11691372_3 fatcat:ssvgcwr6ffef7cdzeta6ngiiri

Action Language Verifier, Extended [chapter]

Tuba Yavuz-Kahveci, Constantinos Bartzis, Tevfik Bultan
2005 Lecture Notes in Computer Science  
ALV uses symbolic model checking techniques to verify or falsify CTL properties of the input specifications.  ...  Polymorphic Verification: Due to the object oriented design of the ALV, implementation of the model checking algorithms are polymorphic.  ... 
doi:10.1007/11513988_40 fatcat:q3ei4xi2pne6jew7rw5qwre4ly

An Approach to the Verification of Symmetric Parameterized Distributed Systems

I. V. Konnov, V. A. Zakharov
2005 Programming and computer software  
The parameterized model checking (PMC) problem is formulated as follows. For a given family of models { M n }, check, for each n ( n ≥ 1), if the specification ϕ n is satisfied on the model M n .  ...  Symbolic model checking methods proved to be useful for the verification of parameterized systems [11] [12] [13] [14] .  ...  If ϕ = Aψ, where ψ is a path formula, then, in order to prove (5), we consider an arbitrary path σ beginning in the state s of the model M.  ... 
doi:10.1007/s11086-005-0034-4 fatcat:pvmzwbwejzdphauhy3lfdt7szu

State space reduction in modeling checking parameterized cache coherence protocol by two-dimensional abstraction

Yang Guo, Wanxia Qu, Long Zhang, Weixia Xu
2012 Journal of Supercomputing  
State space reduction in mc parameterized cache coherence 829 Keywords Parameterized cache coherence protocol · True concurrency · Model checking · Two-dimensional abstraction 1.  ...  The state space explosion is the first hurdle while applying model-checking to scalable protocols.  ...  A complex parameterized system is modeled as a composition of such smaller processes when the following conditions are met.  ... 
doi:10.1007/s11227-012-0755-0 fatcat:sxnedag54rhmdidwnh3bw6jiru

A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems

Long Zhang, Wenyan Hu, Wanxia Qu, Yang Guo, Sikun Li
2017 Mobile Information Systems  
Then, a novel algorithm, which uses IC3 (the state-of-the-art model checking algorithm) as the back-end engine, is presented to verify the Petri net model.  ...  Verification via model checking typically becomes impracticable due to the state space explosion caused by the system parameters and concurrency.  ...  Figure 3 shows a comparison of the -bounded model checking algorithm with the incremental bounded model checking algorithm on five parameterized protocols.  ... 
doi:10.1155/2017/5731678 fatcat:r7co6hiqt5fglhbuzx7ubjfbnm

XMC: A Logic-Programming-Based Verification Toolset [chapter]

C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Yifei Dong, Xiaoqun Du, Abhik Roychoudhury, V. N. Venkatakrishnan
2000 Lecture Notes in Computer Science  
A distinguishing aspect of XMC is that model checking is carried out as query evaluation, by building proof trees using tabled resolution.  ...  For example, XMC provides the foundation for the XMC-RT [DRS99] model checker for real-time systems, and for XMC-PS [RKR + 00], a verification technique for parameterized systems.  ...  In XMC, model checking is done by resolving a query to the models predicate.  ... 
doi:10.1007/10722167_48 fatcat:e3zte62oqngijbv55f5yszo4cm

Parameterized Verification of Multithreaded Software Libraries [chapter]

Thomas Ball, Sagar Chaki, Sriram K. Rajamani
2001 Lecture Notes in Computer Science  
We have developed a tool called Beacon that does parameterized model checking of LGFSMs.  ...  We demonstrate the expressiveness of LGFSMs as models, and the effectiveness of Beacon as a model checking tool by (1) modeling a multithreaded memory manager Rockall developed at Microsoft Research as  ...  The link between PNs and parameterized networks has also been known for a long time. German and Sistla investigated temporal logic model checking of parameterized networks [GS92] .  ... 
doi:10.1007/3-540-45319-9_12 fatcat:zijvhfsakbdmpiexymexcmp5q4

Language support for feature-oriented product line engineering

Wonseok Chae, Matthias Blume
2009 Proceedings of the First International Workshop on Feature-Oriented Software Development - FOSD '09  
Third, its macro system simplifies specification and composition of feature related code.  ...  Second, its module language provides extensible and parameterized modules, which make large-scale extensible programming possible.  ...  In this setup, assume one wants to build an SAL interpreter I, which is the composition of the combinators eval and check where o means function composition: I = eval o check Sometimes, we want to replace  ... 
doi:10.1145/1629716.1629720 dblp:conf/models/ChaeB09 fatcat:u7kmlhp2xbhglcux3qzec6t2jq

Faster Existential FO Model Checking on Posets

Jakub Gajarský, Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak, Martin Grohe
2015 Logical Methods in Computer Science  
We complement this result by showing that, under a certain complexity-theoretical assumption, the existential FO model checking problem does not have a polynomial kernel.  ...  We prove that the model checking problem for the existential fragment of first-order (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of  ...  (Poset FO-Model Checking is an extension of Poset ∃-FO-Model Checking to the full FO logic.)  ... 
doi:10.2168/lmcs-11(4:8)2015 fatcat:lrodm2fxdndljao7f6bqzf7pfa

Faster Existential FO Model Checking on Posets [chapter]

Jakub Gajarský, Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak
2014 Lecture Notes in Computer Science  
We prove that the model checking problem for the existential fragment of firstorder (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of  ...  While there is a long line of research into FO model checking on graphs, the study of this problem on posets has been initiated just recently by Bova, Ganian and Szeider (CSL-LICS 2014), who proved that  ...  (Poset FO-Model Checking is an extension of Poset ∃-FO-Model Checking to the full FO logic.)  ... 
doi:10.1007/978-3-319-13075-0_35 fatcat:2e2yqfdzgfbvfciyubgh3a7cpe

Formal Verification of a Parameterized Data Aggregation Protocol [chapter]

Sergio Feo-Arenis, Bernd Westphal
2013 Lecture Notes in Computer Science  
We report on our experiences on the successful verification of a parameterized wireless fault-tolerant data aggregation protocol.  ...  We outline our verification method that involves automatic verification of a model of the node processing algorithm under system topology constraints.  ...  In general, this Parameterized Model Checking Problem is undecidable [1] .  ... 
doi:10.1007/978-3-642-38088-4_29 fatcat:3l6erltrpfg6za4glbiqcdnf4u
« Previous Showing results 1 — 15 out of 70,362 results