Matching μ-Logic

  • Xiaohong Chen
  • , Grigore Rosu

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    17 Citations (SciVal)
    Original languageEnglish
    Title of host publication2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9781728136080
    DOIs
    Publication statusPublished (VoR) - Jun 2019
    Event34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019 - Vancouver, Canada
    Duration: 24 Jun 201927 Jun 2019

    Publication series

    NameProceedings - Symposium on Logic in Computer Science
    Volume2019-June
    ISSN (Print)1043-6871

    Conference

    Conference34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019
    Country/TerritoryCanada
    CityVancouver
    Period24/06/1927/06/19

    Funding

    We made two main contributions in this paper. Firstly, we proposed a new sound and complete proof system H for matching logic (ML). Secondly, we extended ML with the least fixpoint µ-binder and proposed matching µ-logic (MmL). We showed the expressiveness of MmL by defining a variety of common logics about induction/fixpoints/verification in MmL. We hope that MmL may serve as a promising unifying foundation for specifying and reasoning about induction, fixpoints, as well as model checking and program verification. Acknowledgments: We thank the anonymous reviewers for their valuable comments on drafts of this paper. The work presented in this paper was supported in part by NSF CNS 16-19275. This material is based upon work supported by the United States Air Force and DARPA under Contract No. FA8750-18-C-0092.

    Fingerprint

    Dive into the research topics of 'Matching μ-Logic'. Together they form a unique fingerprint.

    Cite this