Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ong, Chih-Hao Luke - Computing Laboratory, University of Oxford
Fully Abstract Semantics of Additive Aspects by Translation S. B. Sanjabi C.-H. L. Ong
Functional Reachability C.-H. L. Ong N. Tzevelekos
Collapsible Pushdown Automata and Recursion Schemes A. S. Murawski
Winning Regions of Pushdown Parity Games: A Saturation Method
Collapsible Pushdown Automata and Recursion Schemes A. S. Murawski
Winning regions of higher-order pushdown games C.-H. L. Ong
HOMER: a Higher-order Observational equivalence Model checkER
COMPLEXITY OF MODEL CHECKING RECURSION SCHEMES FOR FRAGMENTS OF THE MODAL MU-CALCULUS
Verification of Higher-Order Computation: A Game-Semantic Approach
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Complexity of Model Checking Recursion Schemes for Fragments of the Modal
On model-checking trees generated by higher-order recursion schemes
Winning regions of higher-order pushdown games C.-H. L. Ong
A Concrete Presentation of Game Semantics C.-H. L. Ong
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
Syntactic Control of Concurrency D. R. Ghica, A. S. Murawski and C.-H. L. Ong
On model-checking trees generated by higher-order recursion schemes C.-H. L. Ong
