Skip to content
View nicolasAmat's full-sized avatar
🛰️
🛰️

Highlights

  • Pro

Block or report nicolasAmat

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
nicolasAmat/README.md

Nicolas Amat

I am currently a postdoctoral researcher at the IMDEA Software Institute, working on new solving techniques for Presburger arithmetic (under the supervision of Pierre Ganty and Alessio Mansutti). I am interested in theoretical computer science, with a special interest in the theory and applications of decision procedures for formal verification. I completed my PhD at LAAS-CNRS, where I worked on new methods for taking advantage of Petri net reductions with an SMT-based model checker.

Download my resumé and visit my homepage.

🔭 Open Science

Open Source Software

Readme Card Readme Card Readme Card Readme Card

Education Materiels

Readme Card

📖 Publications

My publications tracked by DBLP.

Journal Papers

2023

2022

Conference Papers

2024

2023

2022

2021

Preprints

  • Amat, N, Dal Zilio, S, Le Botlan, D. On the Complexity of Proving Polyhedral Reductions. Submitted.
  • Amat, N, Amparore, E, Berthomieu, B, Bouvier, P, Dal Zilio, S, Jensen, P, Jezequel, L, Kordon, F, Li, S, Paviot-Adet, E, Srba, J, Thierry-Mieg, Y, Wolf, K. Behind the Scene of the Model Checking Contest, Analysis of Results from 2018 to 2023. TOOLympics 2023, Part III of the Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2023) (to appear)

Pinned Loading

  1. SMPT SMPT Public

    SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions).

    Python 27 5

  2. uSMPT uSMPT Public

    µSMPT: An environnement to experiment with SMT-based model checking for Petri nets

    Python 3 1

  3. Kong Kong Public

    Kong is a tool to compute the concurrency relation of a Petri using nets reduction (polyhedral approach).

    Python 5 1

  4. Octant Octant Public

    Quantifier eliminator for using Petri net reductions for model checking reachability properties.

    OCaml 2 1

  5. Reductron Reductron Public

    Reductron - The Polyhedral Abstraction Prover

    Python 2

  6. Separation-Logic-Formalization Separation-Logic-Formalization Public

    Formalisation of the Separation Logic on Isabelle

    Isabelle 1