A SAT-based algorithm for reparameterization in symbolic simulation by Chauhan, P, Clarke, E, Kroening, D

“…We show experimental results on large industrial circuits and compare our new algorithm to both SAT-based Bounded Model Checking and BDD based symbolic simulation. We were able to achieve on average 3x improvement in time and space over BMC and able to complete many examples that BDD based approach could not even finish.…”

Contextual Policy Enforcement in Android Programs with Permission Event Graphs by Chen, K, Johnson, N, D'Silva, V, Dai, S, Magrino, T, Macnamarra, K, Wu, E, Rinard, M, Song, D

“…Our work centres around a new abstraction of Android applications, called a Permission Event Graph, which we construct with static analysis, and query using model checking. We evaluate application-independent properties on 152 malicious and 117 benign applications, and application-specific properties on 8 benign and 9 malicious applications. …”

DNA Walker Circuits: Computational Potential, Design, and Verification by Dannenberg, F, Kwiatkowska, M, Thachuk, C, Turberfield, A

“…We develop a discrete stochastic model of DNA walker 'circuits' based on experimental data, and demonstrate the merit of using probabilistic model checking techniques to analyse their reliability, performance and correctness. © 2013 Springer-Verlag.…”

Under-approximating loops in C programs for fast counterexample detection by Kroening, D, Lewis, M, Weissenbacher, G

“…We paired our techniques with lazy abstraction and bounded model checking, and evaluated the resulting tool on a number of buffer overflow benchmarks, demonstrating its ability to efficiently detect deep counterexamples in C programs that manipulate arrays.…”

Making the most of BMC counterexamples by Groce, A, Kroening, D

“…The value of model checking counterexamples for debugging programs (and specifications) is widely recognized. …”

Likelihood based inference for diffusion driven models. by Chib, S, Pitt, M, Shephard, N

“…We also discuss issues of model choice, model checking and filtering. The techniques and ideas are applied to both simulated and real data.…”

Verifying multi-threaded software with impact by Wachter, B, Kroening, D, Ouaknine, J

“…Lazy abstraction with interpolants, also known as the Impact algorithm, is en vogue as a state-of-the-art software model-checking technique for sequential programs. However, a direct extension of the Impact algorithm to concurrent programs is bound to be inefficient as it has to explore all thread interleavings, which leads to control-state explosion. …”

Under-approximating loops in C programs for fast counterexample detection by Kroening, D, Lewis, M, Weissenbacher, G

“…We paired our techniques with lazy abstraction and bounded model checking, and evaluated the resulting tool on a number of buffer overflow benchmarks, demonstrating its ability to efficiently detect deep counterexamples in C programs that manipulate arrays.…”

Initial limit Datalog: a new extensible class of decidable constrained Horn clauses by Cathcart Burn, T, Ong, C-H, Ramsay, S, Wagner, D

“…Whilst the set of all models is typically uncountable, the set of all entwined structures is recursively enumerable, and model checking is decidable.…”

Successful use of incremental BMC in the automotive industry by Schrammel, P, Kroening, D, Brain, M, Martins, R, Teige, T, Bienmüller, T

“…Formal verification of behavioural requirements, finding runtime errors and automated test case generation are some of the most common applications of automated verification tools based on Bounded Model Checking (BMC). Existing industrial tools for embedded software use an off-the-shelf Bounded Model Checker and apply it iteratively to verify the program with an increasing number of unwindings. …”

Functional requirements-based automated testing for avionics by Sun, Y, Brain, M, Kroening, D, Guzmán Jiménez, F, Daniel, S, Hawthorn, A, Wilson, T, Schanda, F, Bryan, C, Broster, I

“…We achieve this through the application of Bounded Model Checking (BMC) to formal low-level requirements, in order to generate tests automatically that are good enough to replace existing labor-intensive test writing procedures while maintaining independence from implementation artefacts. …”

SMT-based verification applied to non-convex optimization problems by Araujo, R, Bessa, I, Cordeiro, L, Filho, J

“…This paper presents a novel, complete, and flexible optimization algorithm, which relies on recursive executions that re-constrains a model-checking procedure based on Satisfiability Modulo Theories (SMT). …”

Cognitive reasoning and trust in human-robot interactions by Kwiatkowska, M

“…The logic is founded on a probabilistic notion of belief, supports cognitive reason-ing about goals and intentions, and admits quantitative verification via model checking, which can be used to evaluate trust in human-robot interactions. …”

Concurrent logic games on partial orders by Gutierrez, J

“…Two applications can be cast within this unified approach: bisimulation and model-checking.…”

Formalisations and Applications of BPMN by Wong, P, Gibbons, J

“…Our approach is specifically designed to allow behavioural properties of BPMN diagrams to be mechanically verified via automatic model-checking as provided by the FDR tool. We use two examples to illustrate our approach.…”

A method to localize faults in concurrent C programs by Alves, E, Cordeiro, L, Filho, E

“…We describe a new approach to localize faults in concurrent programs, which is based on bounded model checking and sequentialization techniques. The main novelty is the idea of reproducing a faulty behavior, in a sequential version of a concurrent program. …”

Automatic Verification of Competitive Stochastic Systems. by Chen, T, Forejt, V, Kwiatkowska, M, Parker, D, Simaitis, A

“…This logic allows us to reason about the collective ability of a set of players to achieve a goal relating to the probability of an event's occurrence or the expected amount of cost/reward accumulated. We give a model checking algorithm for verifying properties expressed in this logic and implement the techniques in a probabilistic model checker, based on the PRISM tool. …”

Bayesian estimation for Poisson process models with grouped data and covariate by Arasan, Jayanthi, Loh, Yue Fang

“…We also used the posterior predictive distribution for model checking by comparing the observed and posterior predictive mean number of failures.…”
Get full text

Formalism-Driven Development: Concepts, Taxonomy, and Practice by Yepeng Ding, Hiroyuki Sato

“…Properties of system graphs are specified in propositional and temporal logics and verified by model-checking techniques with interpretation over transition system. …”
Get full text

Possibilistic Cost Computation Tree Logic and Related Equivalence, Abstraction Technique by Hui Deng, Yuzhe Zhang, Zhilong Huang

“…Finally, as solutions to the state space explosion problem of possibilistic cost computation tree logic model checking, abstraction and equivalence are presented as methods to reduce the state numbers and frameworks of possibilistic Kripke cost structures.…”
Get full text