The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

C.-H. Luke Ong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. B. Sanjabi, C.-H. Luke Ong
    Fully abstract semantics of additive aspects by translation. [Citation Graph (0, 0)][DBLP]
    AOSD, 2007, pp:135-148 [Conf]
  2. C.-H. Luke Ong
    Light Logic and Resource Bounded Computation. [Citation Graph (0, 0)][DBLP]
    APLAS, 2000, pp:181- [Conf]
  3. C.-H. Luke Ong
    Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:31-40 [Conf]
  4. Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
    A Universal Innocent Game Model for the Böhm Tree Lambda Theory. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:405-419 [Conf]
  5. Andrzej S. Murawski, C.-H. Luke Ong
    Discreet Games, Light Affine Logic and PTIME Computation. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:427-441 [Conf]
  6. C.-H. Luke Ong, Eike Ritter
    A Generic Strong Normalization Argument: Application to the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:261-279 [Conf]
  7. C.-H. Luke Ong
    Fully Abstract Models of the Lazy Lambda Calculus [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:368-376 [Conf]
  8. Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
    Safety Is not a Restriction at Level 2 for String Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:490-504 [Conf]
  9. J. M. E. Hyland, C.-H. Luke Ong
    Pi-Calculus, Dialogue Games and PCF. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:96-107 [Conf]
  10. C.-H. Luke Ong
    Model Checking Algol-Like Languages Using Game Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:33-36 [Conf]
  11. C.-H. Luke Ong
    Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:487-498 [Conf]
  12. Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
    Syntactic Control of Concurrency. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:683-694 [Conf]
  13. Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz
    Idealized Algol with Ground Recursion, and DPDA Equivalence. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:917-929 [Conf]
  14. C.-H. Luke Ong, Pietro Di Gianantonio
    Games Characterizing Levy-Longo Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:476-487 [Conf]
  15. Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian D. B. Stark
    Nominal Games and Full Abstraction for the Nu-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:150-159 [Conf]
  16. C.-H. Luke Ong
    Observational Equivalence of 3rd-Order Idealized Algol is Decidable. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:245-256 [Conf]
  17. C.-H. Luke Ong
    On Model-Checking Trees Generated by Higher-Order Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:81-90 [Conf]
  18. C.-H. Luke Ong
    Non-Determinism in a Functional Setting [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:275-286 [Conf]
  19. C.-H. Luke Ong
    A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:230-241 [Conf]
  20. Andrzej S. Murawski, C.-H. Luke Ong
    Dominator Trees and Fast Verification of Proof Nets. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:181-191 [Conf]
  21. C.-H. Luke Ong, Charles A. Stewart
    A Curry-Howard Foundation for Functional Computation with Control. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:215-227 [Conf]
  22. Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong
    Route oscillations in I-BGP with route reflection. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2002, pp:235-247 [Conf]
  23. Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
    Applying Game Semantics to Compositional Software Modeling and Verification. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:421-435 [Conf]
  24. Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
    The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. [Citation Graph (0, 0)][DBLP]
    TLCA, 2005, pp:39-54 [Conf]
  25. J. M. E. Hyland, C.-H. Luke Ong
    Modified Realizability Toposes and Strong Normalization Proofs. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:179-194 [Conf]
  26. Andrzej S. Murawski, C.-H. Luke Ong
    Evolving Games and Essential Nets for Affine Polymorphism. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:360-375 [Conf]
  27. C.-H. Luke Ong
    An approach to deciding the observational equivalence of Algol-like languages. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:130, n:1-3, pp:125-171 [Journal]
  28. Samson Abramsky, C.-H. Luke Ong
    Full Abstraction in the Lazy Lambda Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:2, pp:159-267 [Journal]
  29. J. M. E. Hyland, C.-H. Luke Ong
    On Full Abstraction for PCF: I, II, and III. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:163, n:2, pp:285-408 [Journal]
  30. Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
    Syntactic control of concurrency. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:234-251 [Journal]
  31. Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
    Innocent game models of untyped lambda-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:247-292 [Journal]
  32. Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
    Adapting innocent game models for the Böhm treelambda -theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:308, n:1-3, pp:333-366 [Journal]
  33. Thong wei Koh, C.-H. Luke Ong
    Internal Languages for Autonomous and *-Autonomous Categories. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:29, n:, pp:- [Journal]
  34. Andrzej S. Murawski, C.-H. Luke Ong
    Exhausting strategies, joker games and full completeness for IMLL with Unit. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:1/2, pp:269-305 [Journal]
  35. Andrzej S. Murawski, C.-H. Luke Ong
    On an interpretation of safe recursion in light affine logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:197-223 [Journal]
  36. Andrzej S. Murawski, C.-H. Luke Ong
    Exhausting Strategies, Joker Games and IMLL with Units. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:29, n:, pp:- [Journal]
  37. C.-H. Luke Ong, Pietro Di Gianantonio
    Games characterizing Levy-Longo trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:1, pp:121-142 [Journal]
  38. Andrzej S. Murawski, C.-H. Luke Ong
    Fast verification of MLL proof nets via IMLL. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:3, pp:473-498 [Journal]
  39. Matthew Hague, C.-H. Luke Ong
    Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:213-227 [Conf]
  40. C.-H. Luke Ong
    Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:15-21 [Conf]
  41. William Blum, C.-H. Luke Ong
    The Safe Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:39-53 [Conf]

  42. Homer: A Higher-Order Observational Equivalence Model checkER. [Citation Graph (, )][DBLP]


  43. Winning Regions of Pushdown Parity Games: A Saturation Method. [Citation Graph (, )][DBLP]


  44. Verification of Higher-Order Computation: A Game-Semantic Approach. [Citation Graph (, )][DBLP]


  45. On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP]


  46. Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. [Citation Graph (, )][DBLP]


  47. Functional Reachability. [Citation Graph (, )][DBLP]


  48. Collapsible Pushdown Automata and Recursion Schemes. [Citation Graph (, )][DBLP]


  49. A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP]


  50. Recursion Schemes and Logical Reflection. [Citation Graph (, )][DBLP]


  51. Winning Regions of Higher-Order Pushdown Games. [Citation Graph (, )][DBLP]


  52. Boom: Taking Boolean Program Model Checking One Step Further. [Citation Graph (, )][DBLP]


  53. Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems [Citation Graph (, )][DBLP]


  54. The Safe Lambda Calculus [Citation Graph (, )][DBLP]


  55. A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002