Skip to content
View SpencerL-Y's full-sized avatar
📜
Reading
📜
Reading
41 followers · 84 following
  • Institute of Software, CAS
  • Beijing

Achievements

Achievement: YOLOAchievement: Pull Sharkx2Achievement: Arctic Code Vault Contributor
BetaSend feedback

Achievements

Achievement: YOLOAchievement: Pull Sharkx2Achievement: Arctic Code Vault Contributor
BetaSend feedback

Highlights

  • Pro
Block or Report

Block or report SpencerL-Y

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
SpencerL-Y/README.md

Welcome to Clexma's Github👋

About me

I am a Ph.d. student at State Key Lab. of Computer Science, ISCAS.

Detailed bio can be found here

Research Interests

  • Program verification and analysis: which includes invariant synthesis, ranking function synthesis and memory safety analysis
  • New logic and corresponding deciding algorithm that can be used to extend the scope and capability of formal method.
  • Fuzzing techniques of Linux kernel

Other Interests

  • KTM 390 ADV
  • World of Warship

Pinned

  1. Z3-slhv Z3-slhv Public

    extension of z3 to logic SLHV

    C++ 2

  2. SESL SESL Public

    A Symbolic Executor based on Separaton Logic

    SWIG 7

  3. SVMRanker SVMRanker Public

    SVMRanker Version 1.0 --- Tool used for learning nested and multiphase ranking function based on SVM

    Python 1

  4. IOALearner IOALearner Public

    A learner for I/O automata implemented base on ROLL. This algorithm was proposed by Frits Vaandrager in Radboud University.

    Java

  5. Jinlong-He/ISADT Jinlong-He/ISADT Public

    C++

  6. OCAReach OCAReach Public

    Implementation of algorithm that convert the reachability problem of one-counter automata into a QFPA formula

    Java