2,298 Hits in 5.0 sec

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.  ...  Kodandapani for his contribution in the early stages of this work, and Bob Kurshan for stinmlating discussions which sparked our interest in automatic reduction.  ... 
doi:10.1007/3-540-56496-9_19 fatcat:fcplzmvnvbgenp753nv3cja7w4

Formula-dependent equivalence for compositional CTL model checking [chapter]

Adnan Aziz, Thomas R. Shiple, Vigyan Singhal, Alberto L. Sangiovanni-Vincentelli
1994 Lecture Notes in Computer Science  
Also, we show that in some cases our approach can detect if a formula passes or fails, without composing all the component machines. The method is exact and fully automatic, and handles full CTL.  ...  We use this equivalence to manage the size of the transition relations encountered when model checking a system of interacting FSMs.  ...  In addition, the second author was supported by an SRC Fellowship.  ... 
doi:10.1007/3-540-58179-0_65 fatcat:wysrwkpeafcp5dibb6zjv4vpum

Automatic Properties Classification Approach for Guiding the Verification of Complex Reconfigurable Systems

Mohamed Ramdani, Laid Kahloul, Mohamed Khalgui
2018 Proceedings of the 13th International Conference on Software Technologies  
The classic model-checking using computation tree logic (CTL) and its extensions (extended CTL, Timed CTL, etc) produces a large number of properties, possibly redundant, to be verified in a complex R-TNCES  ...  An algorithm is proposed for the automatic classification of CTL properties before starting model-checking process. A case study is exploited to illustrate the impact of using this technique.  ...  Using our proposed approach, we minimize the validation time by reducing the number of properties to be verified, and we improve model-checking of reconfigurable systems and make it more efficient by automatizing  ... 
doi:10.5220/0006863006250632 dblp:conf/icsoft/RamdaniKK18 fatcat:zy4udhesprbcfi4nvko2cv773u

Branching-Time Temporal Logics with Minimal Model Quantifiers [chapter]

Fabio Mogavero, Aniello Murano
2009 Lecture Notes in Computer Science  
In this paper, we address both issues by extending the classical branching-time temporal logic CTL * with minimal model quantifiers (MCTL * ).  ...  These quantifiers allow to extract, from a model, minimal submodels on which we check the specification (also given by an MCTL * formula). We show that MCTL * is strictly more expressive than CTL * .  ...  The first and last items are easily achievable in PTIME (resp., in PSPACE) by applying a classical CTL (resp., CTL * ) model checking algorithm.  ... 
doi:10.1007/978-3-642-02737-6_32 fatcat:hywbevwminc7jc6bwmi24n6dei

A language for compositional specification and verification of finite state hardware controllers

E.M. Clarke, D.E. Long, K.L. McMillan
1991 Proceedings of the IEEE  
These extensions allow a compositional approach to model checking which can substantially reduce its complexity.  ...  The state tables produced by the SML compiler can be used as input to a temporal logic model checker that can automatically determine whether a specification in the logic CTL is satisfied.  ...  checked automatically.  ... 
doi:10.1109/5.97298 fatcat:kzg2gcs2qzbpdkwadiuonkwlwi

A symbolic model checking approach in formal verification of distributed systems

Alireza Souri, Amir Masoud Rahmani, Nima Jafari Navimipour, Reza Rezaei
2019 Human-Centric Computing and Information Sciences  
Also, automating temporal logic is the main challenge to define critical specification rules in the model checking.  ...  The code generation time for transforming the behavioral model is compared to other model checking platforms.  ...  This translator supports just CTL formulas to embed in code generation. Designing the model structure is not automatic because the extensibility of the model checking approach is covered.  ... 
doi:10.1186/s13673-019-0165-x fatcat:524ylqifmze6xckhhqrupvgyyy

Goanna: Syntactic Software Model Checking [chapter]

Ralf Huuck, Ansgar Fehnker, Sean Seefried, Jörg Brauer
2008 Lecture Notes in Computer Science  
The CTL-based model checking approach enables a high degree of flexibility in writing checks, scales to large number of checks, and can scale to large code bases.  ...  Goanna is an industrial-strength static analysis tool used in academia and industry alike to find bugs in C/C++ programs.  ...  Goanna uses standard symbolic CTL model checking as implemented in the NuSMV [6] tool on a high-level program abstraction.  ... 
doi:10.1007/978-3-540-88387-6_17 fatcat:n7frxhem5veg7a4qehrh4vnzli

Automatic verification of finite-state concurrent systems [chapter]

Edmund M. Clarke
1994 Lecture Notes in Computer Science  
In 1995, Ho and Wong-Toi verified an abstraction of this protocol automatically using HyTech.  ...  The first model had more than X states and was not directly analyzable. By using semantic minimization it was possible to derive a much smaller model.  ... 
doi:10.1007/3-540-58152-9_1 fatcat:x45iuwj33vh3hmah7rhbcs3kvu

Page 6351 of Mathematical Reviews Vol. , Issue 89K [page]

1989 Mathematical Reviews  
Sec- tion 3 contains the CTL model-checking algorithm, while Section 4 deals with fairness constraints in concurrent systems described by the CT L’ logic.  ...  Section 5 applies the model-checking algorithm to concurrent program verification.  ... 

Generic Methodology for Formal Verification of UML Models

K.H. Kochaleema, G. Santhosh Kumar
2022 Defence Science Journal  
Property specifications are derived from system requirements and corresponding Computational Tree Logic (CTL)/Linear Temporal Logic (LTL) model checking procedure verifies property entailment in LTS.  ...  The steep learning curve associated with formal methods is avoided through the automatic formal model generation and thus reduces the reluctance of using formal methods in software development projects  ...  The existing CTL model checking algorithm verifies property entailment in the LTS generated.  ... 
doi:10.14429/dsj.72.17228 fatcat:oiofljfysjcazcvqp6uwgjx3ni

A Semi-automatic Semantic Consistency-Checking Method for Learning Ontology from Relational Database

Chuangtao Ma, Bálint Molnár, András Benczúr
2021 Information  
Furthermore, the task of checking semantic consistency could be converted into a global model checking problem that could be solved automatically by the symbolic model checker.  ...  checking method based on graph intermediate representation and model checking is presented.  ...  Data Availability Statement: The data and code presented in this study are available on request from the author. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/info12050188 doaj:f569f6902547442789f5d29c9da94ab3 fatcat:aft6b7hyafhddosj4zgv4xvtfu

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.  ...  Model Checking the System We used SMV [9] to model check the components. Each client and server property was verified in isolation by model checking.  ... 
doi:10.1109/ipdps.2002.1016616 dblp:conf/ipps/AndradeS02 fatcat:26sgsm5feva2bfqqgcu2m5b32m

An approach for verifying correctness of web service compositions

C. Saranya Jothi, Ravikumar S, Antony Kumar K, A. Suresh
2018 International Journal of Engineering & Technology  
Existing modeling techniques capture these properties and perform model checking only statically.  ...  Hence in this work, a two level model verification approach has been proposed to verify the correctness of dynamically composed services.  ...  Model checking is a programmed, display based, property confirmation approach. Given a model of a system, test automatically whether this model meets a given specification.  ... 
doi:10.14419/ijet.v7i1.7.9378 fatcat:mgjskkcb7fglhexnlzyqnw3dzm

Efficient Patterns for Model Checking Partial State Spaces in CTL ∩ LTL

Adam Antonik, Michael Huth
2006 Electronical Notes in Theoretical Computer Science  
Compositional model checks of partial Kripke structures are efficient but incomplete as they may fail to recognize that all implementations satisfy the checked property.  ...  for all model checks.  ...  Conclusions We showed that the patterns of the SPECS PATTERN repository are either all pessimistically self-minimizing, and so their efficient compositional check is as precise as the thorough check (whether  ... 
doi:10.1016/j.entcs.2006.04.004 fatcat:2nzj76v4e5canm2d5t2n3w7dfm

Automated synthesis of composite services with correctness guarantee

Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, Huipeng Guo
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
constraints in Computation Tree Logic formula.  ...  An automated synthesis algorithm based on learning algorithm is introduced, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured  ...  Due to space limitations, we do not present the DFA models of services and the correct constraints in CTL logic formula.  ... 
doi:10.1145/1526709.1526890 dblp:conf/www/DengHLDG09 fatcat:2zojcsbc4rfoznqwy3vb3hkeyy
« Previous Showing results 1 — 15 out of 2,298 results