Filters








3,735 Hits in 3.6 sec

Bounded Model Checking for Partial Kripke Structures [chapter]

Heike Wehrheim
Lecture Notes in Computer Science  
In this paper we study the applicability of bounded model checking techniques to partial Kripke structures.  ...  Partial Kripke structures model incomplete state spaces with unknown parts.  ...  Chaff [MMZ + 01]) for bounded model checking of partial Kripke structures. Conclusion In this paper we have presented a technique for bounded model checking of threevalued Kripke structures.  ... 
doi:10.1007/978-3-540-85762-4_26 fatcat:jrvlwe6fcva6xfi5bauaympodm

Weak Kripke Structures and LTL [chapter]

Lars Kuhtz, Bernd Finkbeiner
2011 Lecture Notes in Computer Science  
We show that the classic PSPACE-hardness result is actually limited to a subclass of the Kripke frames, which is characterized by a simple structural condition: the model checking problem is only PSPACE-hard  ...  We revisit the complexity of the model checking problem for formulas of linear-time temporal logic (LTL).  ...  Theorem 2 (Kučera and Strejček Using this theorem, we will establish upper bounds for model checking of weak Kripke structures. Model Checking LTL with a single variable.  ... 
doi:10.1007/978-3-642-23217-6_28 fatcat:kujebsdzfbamjdkagplit3dzwq

On the Complexity of Semantic Self-minimization

Adam Antonik, Michael Huth
2009 Electronical Notes in Theoretical Computer Science  
A compositional model-checking algorithm for partial Kripke structures is efficient, sound (all answers true and false are truthful), but may lose precision by answering don't know instead of a factual  ...  Partial Kripke structures model only parts of a state space and so enable aggressive abstraction of systems prior to verifying them with respect to a formula of temporal logic.  ...  Acknowledgments We expressly thank the anonymous referees for their thoughtful comments, which helped to improve the presentation and clarity of this paper.  ... 
doi:10.1016/j.entcs.2009.08.002 fatcat:7k3vfxh23rbhzfp53gcabjdvty

Fast, Flexible, and Minimal CTL Synthesis via SMT [chapter]

Tobias Klenze, Sam Bayless, Alan J. Hu
2016 Lecture Notes in Computer Science  
Moreover, our approach is efficient at producing minimal Kripke structures on common CTL synthesis benchmarks. Electronic supplementary material The online version of this chapter (  ...  We show how to formulate CTL model checking in terms of "monotonic theories", enabling us to use the SAT Modulo Monotonic Theories (SMMT) [5] framework to build an efficient SAT-modulo-CTL solver.  ...  We also thank Javier Esparza for his encouragement and helpful advice.  ... 
doi:10.1007/978-3-319-41528-4_8 fatcat:hqjdzwzaprgwtmoojkmbszhxqa

The Complexity of Monitoring Hyperproperties

Borzoo Bonakdarpour, Bernd Finkbeiner
2018 2018 IEEE 31st Computer Security Foundations Symposium (CSF)  
model checks the growing Kripke structure.  ...  This calls for a rigorous complexity analysis of the model checking problem over tree-shaped and acyclic Kripke structures.  ...  For acyclic Kripke structures, the model checking problem is in coNP.  ... 
doi:10.1109/csf.2018.00019 dblp:conf/csfw/BonakdarpourF18 fatcat:k2jebj2bofa2fnxo4rogc6rebi

An automata-theoretic approach to branching-time model checking (Extended abstract) [chapter]

Orna Bernholtz, Moshe Y. Vardi, Pierre Wolper
1994 Lecture Notes in Computer Science  
Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking, and has enabled us to  ...  derive improved space complexity bounds for this long-standing problem.  ...  Technically, this means that we will now prove that model-checking for CTL is NLOGSPACE-complete in the size of the Kripke structure.  ... 
doi:10.1007/3-540-58179-0_50 fatcat:uwvhl43uvjht3ok7epblznjduy

Generating Java Compiler Optimizers Using Bidirectional CTL

Ling Fang, Masataka Sassa
2007 Electronical Notes in Theoretical Computer Science  
The model checker can check future and past temporal CTL operators symmetrically without any conversion.  ...  We implemented a new model checker for a bidirectional CTL (computational tree logic) called CTL bd , which is equivalent to CTL-FV [9] after removing free variables.  ...  In our system, such a name is not a free variable or the node number of the Kripke structure and need not be bound before use.  ... 
doi:10.1016/j.entcs.2007.09.007 fatcat:lvewxvcwxnhhnkkawqufckd7lm

Counterexamples Revisited: Principles, Algorithms, Applications [chapter]

Edmund Clarke, Helmut Veith
2003 Lecture Notes in Computer Science  
The practical value of counterexamples to the verification engineer is evident, and for many years, counterexample generation algorithms have been employed in model checking systems, even though they had  ...  Algorithmic counterexample generation is a central feature of model checking which sets the method apart from other approaches such as theorem proving.  ...  Wang for valuable discussions.  ... 
doi:10.1007/978-3-540-39910-0_9 fatcat:gq6mpwi5encf5huscxp3kins4m

Verifying CTL-live properties of infinite state models using an SMT solver

Amirhossein Vakili, Nancy A. Day
2014 Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2014  
We also examine modelling techniques to represent abstract models in first-order logic that facilitate this form of model checking.  ...  We show that using this method the verification of an infinite state model can sometimes complete more quickly than verifying a finite version of the model.  ...  ACKNOWLEDGEMENTS We thank the reviewers for their insightful and detailed comments, which have improved our paper.  ... 
doi:10.1145/2635868.2635911 dblp:conf/sigsoft/VakiliD14 fatcat:bvv2vf54nvfhpkzsr65i2lqtkm

Complexity analysis of a unifying algorithm for model checking Interval Temporal Logic

Laura Bozzelli, Angelo Montanari, Adriano Peron
2020 Information and Computation  
representation of Kripke structure paths called descriptors.  ...  In this paper we generalize the approach by providing a uniform framework for model-checking full HS and meaningful (almost maximal) fragments, where a specialized type of descriptor is defined for each  ...  The (finite) model-checking problem (against HS) consists in checking whether K |= ψ for a given HS formula ψ and a finite Kripke structure K .  ... 
doi:10.1016/j.ic.2020.104640 fatcat:alp76uf7ureqnpcfa6kmgc3ue4

LTL Generalized Model Checking Revisited [chapter]

Patrice Godefroid, Nir Piterman
2008 Lecture Notes in Computer Science  
In this paper, we revisit generalized model checking for linear time (LTL) properties.  ...  The usual definition of concretization is tailored for branching-time model checking. We then study a simpler linear completeness preorder for relating program abstractions.  ...  We thank Michael Huth for comments on an earlier version and Orna Kupferman for a discussion of the relative expressive power of NBT and NCT.  ... 
doi:10.1007/978-3-540-93900-9_11 fatcat:4omj3mchcnc6ha2mmms7dokrwa

LTL generalized model checking revisited

Patrice Godefroid, Nir Piterman
2010 International Journal on Software Tools for Technology Transfer (STTT)  
In this paper, we revisit generalized model checking for linear time (LTL) properties.  ...  The usual definition of concretization is tailored for branching-time model checking. We then study a simpler linear completeness preorder for relating program abstractions.  ...  We thank Michael Huth for comments on an earlier version and Orna Kupferman for a discussion of the relative expressive power of NBT and NCT.  ... 
doi:10.1007/s10009-010-0169-3 fatcat:zgiuc23tsrb4niiobauge5hrzm

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.  ...  Model checks then reason about such sets of Kripke structures.  ... 
doi:10.1016/j.entcs.2006.04.004 fatcat:2nzj76v4e5canm2d5t2n3w7dfm

Generating Counterexamples for Multi-valued Model-Checking [chapter]

Arie Gurfinkel, Marsha Chechik
2003 Lecture Notes in Computer Science  
In this paper we show how to generate counterexamples for multi-valued model-checking.  ...  Multi-valued model-checking, introduced in [4] is an extension of classical model-checking.  ...  We thank the anonymous referees for helping improve the presentation of this paper. Financial support for this research has been provided by NSERC and CITO.  ... 
doi:10.1007/978-3-540-45236-2_28 fatcat:zpfosbpgzfdy3amdzwvdjp7j7i

Automatic Abstraction Using Generalized Model Checking [chapter]

Patrice Godefroid, Radha Jagadeesan
2002 Lecture Notes in Computer Science  
Generalized model checking is a framework for reasoning about partial state spaces of concurrent reactive systems.  ...  We study the cost needed to improve precision by presenting new upper and lower bounds for the complexity of generalized model checking in the size of the abstraction.  ...  Examples of such richer modeling formalisms are partial Kripke structures [3] and Modal Transition Systems [19, 11] .  ... 
doi:10.1007/3-540-45657-0_11 fatcat:pq2p3k4hgjcvbef35ziwvs3kta
« Previous Showing results 1 — 15 out of 3,735 results