Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Formal Verification Based Synthesis for Behavior Trees

    Behavior trees (BTs) have been extensively applied in the area of both computer games and robotics, as the control architectures. However, the construction of BTs is labor-expensive, time-consuming, and even i...

    Weijiang Hong, Zhenbang Chen, Minglong Li in Dependable Software Engineering. Theories,… (2024)

  2. No Access

    Chapter and Conference Paper

    Collaborative Verification of Uninterpreted Programs

    Given a set of uninterpreted programs to be verified, the trace abstraction-based verification method can be used to solve them once at a time. The verification of different programs is independent of each oth...

    Yide Du, Weijiang Hong, Zhenbang Chen in Theoretical Aspects of Software Engineering (2022)

  3. No Access

    Chapter and Conference Paper

    Trace Abstraction-Based Verification for Uninterpreted Programs

    The verification of uninterpreted programs is undecidable in general. This paper proposes to employ counterexample-guided abstraction refinement (CEGAR) framework for verifying uninterpreted programs. Differen...

    Weijiang Hong, Zhenbang Chen, Yide Du, Ji Wang in Formal Methods (2021)

  4. No Access

    Chapter and Conference Paper

    Using Coq for Formal Modeling and Verification of Timed Connectors

    Formal modeling and verification of connectors in component-based software systems are getting more interest with recent advancements and evolution in modern software systems. In this paper, we use the proof a...

    Weijiang Hong, M. Saqib Nawaz, **yue Zhang in Software Engineering and Formal Methods (2018)