1,006,760 Hits in 4.6 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).  ...  The formulation, which is referred to as the parametric compositional model checking problem (PCMCP), asks whether a parameterized family has a compositional proof that the specification is met for all  ... 
doi:10.1007/978-3-662-49674-9_39 fatcat:t2tj5wifivhw3kkq4ihzuyopky

LTL-Model-Checking via Model Composition [chapter]

Ingo Felscher
2012 Lecture Notes in Computer Science  
We develop a composition technique for linear time logic (LTL) over ordered disjoint sums of words.  ...  The basis of the solution of the model-checking problem is a composition result on infinite words.  ...  For the cases where the composition theorem is applicable it allows to reduce the model checking problem in a product or sum to model checking problems over the components.  ... 
doi:10.1007/978-3-642-33512-9_5 fatcat:fk52ypdi7nbzjgkutgfhlamari

Model Checking Security Pattern Compositions

Jing Dong, Tu Peng, Yajing Zhao
2007 Seventh International Conference on Quality Software (QSIC 2007)  
In this paper, we present an approach to model checking the compositions of security patterns.  ...  In this way, the properties of the security patterns can be checked by a model checker when they are composed. Composition errors and problems can be discovered early in the design stage.  ...  In this paper, we use model checking techniques to analyze the consistency of security pattern compositions.  ... 
doi:10.1109/qsic.2007.4385483 fatcat:talbtm2hzndbni7zhkkpwnsw5i

Induction in Compositional Model Checking [chapter]

Kenneth L. McMillan, Shaz Qadeer, James B. Saxe
2000 Lecture Notes in Computer Science  
This paper describes a technique of inductive proof based on model checking.  ...  The method is integrated with a compositional proof system based on the SMV model checker. It is illustrated by examples, including the N -process "bakery" mutual exclusion algorithm.  ...  They embedded the mu-calculus in PVS, using model checking to verify formulas on finite abstract models.  ... 
doi:10.1007/10722167_25 fatcat:dz4pmenq65bx5n6qftlsuptifm

Compositional Reasoning in Model Checking [chapter]

Sergey Berezin, Sérgio Campos, Edmund M. Clarke
1998 Lecture Notes in Computer Science  
We describe several compositional model checking techniques used in practice and show a few examples demonstrating their performance. 120  ...  The main problem in model checking that prevents it from being used for verification of large systems is the state explosion problem.  ...  In general, all of the compositional model checking techniques have their limitations and much work remains to be done. The most important problem is the trade-off between efficiency and automation.  ... 
doi:10.1007/3-540-49213-5_4 fatcat:quilkf54sjgfveohuiku2h7u6q

Model checking adaptive service compositions

M. Bugliesi, A. Marin, S. Rossi
2014 Science of Computer Programming  
Based on the above, we devise a model checking algorithm for adaptive service compositions which automatically synthesises the maximal (most expressive / permissive) filter enforcing the desired security  ...  Based on such characterization, the properties of interest in a given composition may be verified by model checking the composition's characteristic formula with, e.g. the NCSU Concurrency Workbench model  ...  We show how such algorithms can be exploited to develop an adaptive model checking technique for service compositions which adapts, when it is possible, the composition under investigation in such a way  ... 
doi:10.1016/j.scico.2013.11.031 fatcat:mw3ol7wr2nhj5l6vmagtrgxm6a

Model Checking Adaptive Multilevel Service Compositions [chapter]

Sabina Rossi
2012 Lecture Notes in Computer Science  
Moreover, we use filters as prescriptions of behavior (coercions to prevent service misbehavior) and we devise a model checking algorithm for adaptive service compositions which automatically synthesizes  ...  In this paper we present a logic-based technique for verifying both security and correctness properties of multilevel service compositions.  ...  In this paper we develop a method for verifying both security and correctness properties of multilevel service compositions based on the use of model-checking techniques [9] .  ... 
doi:10.1007/978-3-642-27269-1_7 fatcat:7nhwe2da5fevhjoizgtp47n4r4

An approach to compositional model checking

H.A. Andrade, B. Sanders
2002 Proceedings 16th International Parallel and Distributed Processing Symposium  
In this paper, we explore an approach to compositional reasoning that uses model checking to verify component specifications and deduction to verify the constraints that a component imposes on the system  ...  We use CTL as the specification language along with the SMV model checker.  ...  proof (model checking).  ... 
doi:10.1109/ipdps.2002.1016616 dblp:conf/ipps/AndradeS02 fatcat:26sgsm5feva2bfqqgcu2m5b32m

Compositional Model Checking of Concurrent Systems

Hao Zheng, Zhen Zhang, Chris J. Myers, Emmanuel Rodriguez, Yingying Zhang
2014 IEEE transactions on computers  
This paper presents a compositional framework to address the state explosion problem in model checking of concurrent systems.  ...  The experimental results show significant scaleup of this compositional verification framework on a number of non-trivial concurrent system models. from Stanford University, Stanford, CA, in 1993 and 1995  ...  This paper presents a compositional model checking framework that aims to verify complex highly concurrent systems.  ... 
doi:10.1109/tc.2014.2329701 fatcat:wnrgleyl2zgrdoqsu3bvzkuhay

Bounded Model Checking of Compositional Processes

Jun Sun, Yang Liu, Jin Song Dong, Jing Sun
2008 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering  
Applying bounded model checking to compositional process algebras is, however, not a trivial task.  ...  This paper presents a compositional encoding of hierarchical processes as SAT problems and then applies state-of-theart SAT solvers for bounded model checking.  ...  In recent years, bounded model checking [13] have been proposed to complement ex-plicit model checking and symbolic model checking with great success.  ... 
doi:10.1109/tase.2008.12 dblp:conf/tase/SunLDS08 fatcat:imruubkrmbchzntshmc35ynory

Statistical Model Checking for Composite Actor Systems [chapter]

Jonas Eckhardt, Tobias Mühlbauer, José Meseguer, Martin Wirsing
2013 Lecture Notes in Computer Science  
To enable statistical model checking we introduce a new scheduling approach for composite actor models which guarantees the absence of unquantified nondeterminism.  ...  In this paper we propose the so-called composite actor model for specifying composed entities such as the Internet.  ...  The above mentioned analysis approaches, however, rely on flat actor models and cannot handle and model check composite models in a direct way.  ... 
doi:10.1007/978-3-642-37635-1_9 fatcat:impkwpxfarfahjoivqml3tfdqe

Automatic reduction in CTL compositional model checking [chapter]

Thomas R. Shiple, Massimiliano Chiodo, Alberto L. Sangiovanni-Vincentelli, Robert K. Brayton
1993 Lecture Notes in Computer Science  
We describe a method for reducing the complexity of temporal logic model checking of a system of interacting finite state machines, and prove that it yields correct results.  ...  The method consists essentially of reducing each component machine with respect to the property we want to verify, and then verifying the property on the composition of the reduced components.  ...  Compositional Model Checker Tim compositional model checker procedure cmc consists of four phases (Figure 4). Phase 1 The first phase is to check the components independently.  ... 
doi:10.1007/3-540-56496-9_19 fatcat:fcplzmvnvbgenp753nv3cja7w4

Parallelizing a Symbolic Compositional Model-Checking Algorithm [chapter]

Ariel Cohen, Kedar S. Namjoshi, Yaniv Sa'ar, Lenore D. Zuck, Katya I. Kisyova
2011 Lecture Notes in Computer Science  
Model Checking Algorithm HVC -2010 14  ...  Model Checking Algorithm HVC -2010 16 Model Checking method compute reachable states, Reach, as a least fixpoint; take θ to be Reach; check subset relation Reach → ϕ;Computing the Split InvariantFOREACH  ... 
doi:10.1007/978-3-642-19583-9_9 fatcat:vbcs4chrt5dpnhoycvd5d7hnta

Compositional Model Checking of Real Time Systems

Francois Laroussinie, Kim G. Larsen
1995 BRICS Report Series  
A major problem in applying model checking to finite-state systems<br />is the potential combinatorial explosion of the state space arising from<br />parallel composition.  ...  Recent work by Andersen<br />[And95] proposes a very promising compositional model checking<br />technique, which has experimentally been shown to improve results obtained<br />using Binary Decision Diagrams  ...  Acknowledgement The authors would like to thank Henrik Reif Andersen for interesting and enlightening discussions on the topic of compositional (partial) model-checking.  ... 
doi:10.7146/brics.v2i19.19921 fatcat:6p7qo3yq3rdale35cnafczikka

Model checking service compositions under resource constraints

Howard Foster, Wolfgang Emmerich, Jeff Kramer, Jeff Magee, David Rosenblum, Sebastian Uchitel
2007 Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07  
We show how model checking can take execution resource constraints into account.  ...  The approach is supported by a tool suite, known as WS-Engineer, providing automated process translation, architecture and model-checking views.  ...  Secondly, we describe a technique for model checking service compositions under resource constraints and evaluate this approach using the polymorph case study.  ... 
doi:10.1145/1287624.1287657 dblp:conf/sigsoft/FosterEKMRU07 fatcat:wcbfozo7hfentdbtskclttvdtq
« Previous Showing results 1 — 15 out of 1,006,760 results