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`

.

## Filters

##
###
Parameterized Compositional Model Checking
[chapter]

2016
*
Lecture Notes in Computer Science
*

The

doi:10.1007/978-3-662-49674-9_39
fatcat:t2tj5wifivhw3kkq4ihzuyopky
*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] . ...##
###
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
[chapter]

2001
*
Lecture Notes in Computer Science
*

The proof uses the SMV proof assistant, a proof system based on symbolic

doi:10.1007/3-540-44798-9_17
fatcat:73hvrs7fjvfonl772fmegy7iia
*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. ...##
###
An invariant-based approach to the verification of asynchronous parameterized networks

2010
*
Journal of symbolic computation
*

Emerson and Namjoshi (1995) demonstrated how to exploit symmetry to cope with

doi:10.1016/j.jsc.2008.11.006
fatcat:z2erlk7mpjcfdovfv3kbgazzpq
*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. ...##
###
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces
[chapter]

2010
*
Lecture Notes in Computer Science
*

We propose that such programs can be

doi:10.1007/978-3-642-14295-6_54
fatcat:uf2ryxxmkvcffi367mjmcsaywy
*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. ...##
###
Parameterized Verification of π-Calculus Systems
[chapter]

2006
*
Lecture Notes in Computer Science
*

In this paper we present an automatic verification technique for

doi:10.1007/11691372_3
fatcat:ssvgcwr6ffef7cdzeta6ngiiri
*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*. ...##
###
Action Language Verifier, Extended
[chapter]

2005
*
Lecture Notes in Computer Science
*

ALV uses symbolic

doi:10.1007/11513988_40
fatcat:q3ei4xi2pne6jew7rw5qwre4ly
*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. ...##
###
An Approach to the Verification of Symmetric Parameterized Distributed Systems

2005
*
Programming and computer software
*

The

doi:10.1007/s11086-005-0034-4
fatcat:pvmzwbwejzdphauhy3lfdt7szu
*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. ...##
###
State space reduction in modeling checking parameterized cache coherence protocol by two-dimensional abstraction

2012
*
Journal of Supercomputing
*

State space reduction in mc

doi:10.1007/s11227-012-0755-0
fatcat:sxnedag54rhmdidwnh3bw6jiru
*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. ...##
###
A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems

2017
*
Mobile Information Systems
*

Then, a novel algorithm, which uses IC3 (the state-of-the-art

doi:10.1155/2017/5731678
fatcat:r7co6hiqt5fglhbuzx7ubjfbnm
*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. ...##
###
XMC: A Logic-Programming-Based Verification Toolset
[chapter]

2000
*
Lecture Notes in Computer Science
*

A distinguishing aspect of XMC is that

doi:10.1007/10722167_48
fatcat:e3zte62oqngijbv55f5yszo4cm
*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. ...##
###
Parameterized Verification of Multithreaded Software Libraries
[chapter]

2001
*
Lecture Notes in Computer Science
*

We have developed a tool called Beacon that does

doi:10.1007/3-540-45319-9_12
fatcat:zijvhfsakbdmpiexymexcmp5q4
*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] . ...##
###
Language support for feature-oriented product line engineering

2009
*
Proceedings of the First International Workshop on Feature-Oriented Software Development - FOSD '09
*

Third, its macro system simplifies specification and

doi:10.1145/1629716.1629720
dblp:conf/models/ChaeB09
fatcat:u7kmlhp2xbhglcux3qzec6t2jq
*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 ...##
###
Faster Existential FO Model Checking on Posets

2015
*
Logical Methods in Computer Science
*

We complement this result by showing that, under a certain complexity-theoretical assumption, the existential FO

doi:10.2168/lmcs-11(4:8)2015
fatcat:lrodm2fxdndljao7f6bqzf7pfa
*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.) ...##
###
Faster Existential FO Model Checking on Posets
[chapter]

2014
*
Lecture Notes in Computer Science
*

We prove that the

doi:10.1007/978-3-319-13075-0_35
fatcat:2e2yqfdzgfbvfciyubgh3a7cpe
*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.) ...##
###
Formal Verification of a Parameterized Data Aggregation Protocol
[chapter]

2013
*
Lecture Notes in Computer Science
*

We report on our experiences on the successful verification of a

doi:10.1007/978-3-642-38088-4_29
fatcat:3l6erltrpfg6za4glbiqcdnf4u
*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] . ...
« Previous

*Showing results 1 — 15 out of 70,362 results*