Search Results - "Doumane, Amina"

  • Showing 1 - 6 results of 6
Refine Results
  1. 1

    Constructive completeness for the linear-time μ-calculus by Doumane, Amina

    “…We give a new proof of completeness for the linear-time μ-calculus w.r.t. Kozens's axiomatization. Our proof has the advantage of being constructive, i.e., it…”
    Get full text
    Conference Proceeding
  2. 2

    Towards Completeness via Proof Search in the Linear Time µ-calculus : The case of Büchi inclusions by Doumane, Amina, Baelde, David, Hirschi, Lucca, Saurin, Alexis

    “…Modal µ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures…”
    Get full text
    Conference Proceeding
  3. 3

    Tree algebras and bisimulation-invariant MSO on finite graphs by Colcombet, Thomas, Doumane, Amina, Kuperberg, Denis

    Published 17-07-2024
    “…We establish that the bisimulation invariant fragment of MSO over finite transition systems is expressively equivalent over finite transition systems to modal…”
    Get full text
    Journal Article
  4. 4

    First-order tree-to-tree functions by Bojańczyk, Mikołaj, Doumane, Amina

    Published 21-02-2020
    “…We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows…”
    Get full text
    Journal Article
  5. 5

    Bouncing threads for infinitary and circular proofs by Baelde, David, Doumane, Amina, Kuperberg, Denis, Saurin, Alexis

    Published 17-05-2020
    “…We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed…”
    Get full text
    Journal Article
  6. 6

    Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions by Doumane, Amina, Baelde, David, Hirschi, Lucca, Saurin, Alexis

    “…Modal μ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures…”
    Get full text
    Conference Proceeding