Saturation-based model checking of higher-order recursion schemes
C Broadbent, N Kobayashi - Computer Science Logic 2013 (CSL …, 2013 - drops.dagstuhl.de
Abstract Model checking of higher-order recursion schemes (HORS) has recently been
studied extensively and applied to higher-order program verification. Despite recent efforts …
studied extensively and applied to higher-order program verification. Despite recent efforts …
Recursion schemes and logical reflection
Let R be a class of generators of node-labelled infinite trees, and Lbe a logical language for
describing correctness properties of the setrees. Given r in R and phi in L, we say that r_phi …
describing correctness properties of the setrees. Given r in R and phi in L, we say that r_phi …
C-shore: a collapsible approach to higher-order verification
Higher-order recursion schemes (HORS) have recently received much attention as a useful
abstraction of higher-order functional programs with a number of new verification techniques …
abstraction of higher-order functional programs with a number of new verification techniques …
A quantitative assessment of the effect of distributor type on particle circulation
Z Garncarek, L Przybylski, JSM Botterill… - Powder technology, 1997 - Elsevier
Garncarek's quantitative index of inhomogeneity has been used to compare the effect of
distributor type on the degree of uniformity of solids mixing in a gas-fluidized bed assessed …
distributor type on the degree of uniformity of solids mixing in a gas-fluidized bed assessed …
On global model checking trees generated by higher-order recursion schemes
C Broadbent, L Ong - … of Software Science and Computational Structures …, 2009 - Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols,
which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking …
which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking …
Higher-order recursion schemes and collapsible pushdown automata: Logical properties
This article studies the logical properties of a very general class of infinite ranked trees,
namely, those generated by higher-order recursion schemes. We consider, for both monadic …
namely, those generated by higher-order recursion schemes. We consider, for both monadic …
A measure of the degree of inhomogeneity in a distribution and its application in characterising the particle circulation in a fluidized bed
Z Garncarek, L Przybylski, JSM Botterill, J Bridgwater… - Powder technology, 1994 - Elsevier
A quantitative method to evaluate variational processes such as particle circulation in a
fluidized bed is presented. It involves the calculation of H, an index of the degree of …
fluidized bed is presented. It involves the calculation of H, an index of the degree of …
On bisimilarity of higher-order pushdown automata: Undecidability at order two
C Broadbent, S Göller - IARCS Annual Conference on …, 2012 - drops.dagstuhl.de
We show that bisimulation equivalence of order-two pushdown automata is undecidable.
Moreover, we study the lower order problem of higher-order pushdown automata, which …
Moreover, we study the lower order problem of higher-order pushdown automata, which …
Evalution of 'Slags' Program for the Prediction of Physical Properties of Coal Gasification Slags
KC Mills, CP Broadbent - The Impact Of Ash Deposition On Coal …, 2022 - taylorfrancis.com
Optimised operation of coat gasification processes in which mineral matter in coal is
removed in the form of a molten slag requires accurate information concerning the physico …
removed in the form of a molten slag requires accurate information concerning the physico …
On collapsible pushdown automata, their graphs and the power of links
C Broadbent, C Broadbent - 2011 - ora.ox.ac.uk
Abstract Higher-Order Pushdown Automata (HOPDA) are abstract machines equipped with
a nested stacks of stacks... of stacks of stacks. Collapsible pushdown automata (CPDA) …
a nested stacks of stacks... of stacks of stacks. Collapsible pushdown automata (CPDA) …