-
61
Linear Encodings of Bounded LTL Model Checking
Published 2006-11-01“…We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). …”
Get full text
Article -
62
Model Checking Lower Bounds for Simple Graphs
Published 2014-03-01“…Second, we show that there is no model-checking algorithm with elementary parameter dependence for MSO logic even restricted to paths (or equivalently to unary strings), unless E=NE. …”
Get full text
Article -
63
Abstracting Strings for Model Checking of C Programs
Published 2020-11-01Subjects: Get full text
Article -
64
Statistical Model Checking for Stochastic Hybrid Systems
Published 2012-08-01“…The extensions allow for statistical model checking of stochastic hybrid systems. We show how our race-based stochastic semantics extends to networks of hybrid systems, and indicate the integration technique applied for implementing this semantics in the UPPAAL-SMC simulation engine. …”
Get full text
Article -
65
Intuitionistic implication makes model checking hard
Published 2012-04-01“…We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. …”
Get full text
Article -
66
Real-Time Model-Checking: Parameters everywhere
Published 2007-02-01“…In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). …”
Get full text
Article -
67
Using models to model-check recursive schemes
Published 2015-06-01“…We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given property. …”
Get full text
Article -
68
Faster Existential FO Model Checking on Posets
Published 2015-12-01“…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 a poset (the maximum size of an antichain). …”
Get full text
Article -
69
Model Checking Properties on Reduced Trace Systems
Published 2014-07-01Subjects: Get full text
Article -
70
-
71
Model checking approach to cancer systems biology
Published 2015Get full text
Final Year Project (FYP) -
72
Multi-core model checking algorithm development
Published 2015“…Model checking is an automatic technique for verifying finite state systems. …”
Get full text
Final Year Project (FYP) -
73
-
74
-
75
-
76
-
77
-
78
-
79
More effective interpolations in software model checking
Published 2017“…An approach to CEGAR-based model checking which has proved to be successful on large models employs Craig interpolation to efficiently construct parsimonious abstractions. …”
Conference item -
80
Intersection types and higer-order model checking
Published 2014“…The key is a characterisation of model checking as a problem of intersection type assignment. …”
Thesis