194 results on '"C.-H. Luke Ong"'
Search Results
52. Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars.
53. Verifying higher-order functional programs with pattern-matching algebraic data types.
54. Recursion Schemes and Logical Reflection.
55. Analysing Mu-Calculus Properties of Pushdown Systems.
56. Boom: Taking Boolean Program Model Checking One Step Further.
57. Models of Higher-Order Computation: Recursion Schemes and Collapsible Pushdown Automata.
58. Higher-Order Constrained Horn Clauses and Refinement Types.
59. Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus.
60. On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.
61. Homer: A Higher-Order Observational Equivalence Model checkER.
62. Functional Reachability.
63. A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes.
64. Winning Regions of Pushdown Parity Games: A Saturation Method.
65. Collapsible Pushdown Automata and Recursion Schemes.
66. Winning Regions of Higher-Order Pushdown Games.
67. Verification of Higher-Order Computation: A Game-Semantic Approach.
68. Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.
69. Fully abstract semantics of additive aspects by translation.
70. The Safe Lambda Calculus.
71. Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.
72. On Model-Checking Trees Generated by Higher-Order Recursion Schemes.
73. Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).
74. Idealized Algol with Ground Recursion, and DPDA Equivalence.
75. Safety Is not a Restriction at Level 2 for String Languages.
76. The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.
77. Collapsible Pushdown Parity Games
78. Syntactic Control of Concurrency.
79. Nominal Games and Full Abstraction for the Nu-Calculus.
80. Applying Game Semantics to Compositional Software Modeling and Verification.
81. Games Characterizing Levy-Longo Trees.
82. Model Checking Algol-Like Languages Using Game Semantics.
83. Observational Equivalence of 3rd-Order Idealized Algol is Decidable.
84. Evolving Games and Essential Nets for Affine Polymorphism.
85. Dominator Trees and Fast Verification of Proof Nets.
86. Discreet Games, Light Affine Logic and PTIME Computation.
87. A saturation method for the modal μ-calculus over pushdown systems.
88. A Universal Innocent Game Model for the Böhm Tree Lambda Theory.
89. A Curry-Howard Foundation for Functional Computation with Control.
90. Normalisation by Traversals.
91. Unboundedness and Downwards Closures of Higher-Order Pushdown Automata.
92. A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract).
93. Fast verification of MLL proof nets via IMLL.
94. Syntactic control of concurrency.
95. Pi-Calculus, Dialogue Games and PCF.
96. An approach to deciding the observational equivalence of Algol-like languages.
97. Games characterizing Levy-Longo trees.
98. On an interpretation of safe recursion in light affine logic.
99. Non-Determinism in a Functional Setting
100. Modified Realizability Toposes and Strong Normalization Proofs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.