Clément Aubert — Assistant Professor in Computer Science

Aux visiteurs francophones

J’ai un site plus complet et plus orienté recherche à aubert.perso.math.cnrs.fr. La plupart des documents y sont en Anglais et en Français, d’ailleurs.

Presentation

I am an assistant professor in Computer Science at the School of Computer and Cyber Sciences, at Augusta University, in Georgia, USA. I am also a member of the ForML Lab, a member of the Graduate School, the Campus Champion of Affordable Learning Georgia, and a mentor for the African American Male Initiative.

Prior to that, I have been a post-doctoral researcher at the Appalachian State University (Boone, NC, USA), at the LACL (Créteil, Val-de-Marne, France), at the I2M (Marseille, Bouches-du-Rhône, France), and a PhD student at the LIPN (Villetaneuse, Île-de-France, France).

Please refer to my resume for a more complete presentation, and find below information about my teaching, my research, internships and projects, as well as miscellaneous factoids and how to contact me.

Teaching

Currently (Summer 2023)

This semester, I am responsible for

CURS 2990 - Undergraduate Research (×2),
CSCI 8940 - Dissertation Research.

Students can have a look at my "Quick Reflection on Course Evaluations", which includes my previous evaluations, to be better prepared for the classes I teach and know what to expect.

Notes

Previously

At Augusta University

Graduate Classes
- CSCI 8940 - Dissertation Research: Spring 2022, Summer 2022, Fall 2022, Spring 2023
- CSCI 8720 - Problems in Computer and Cyber Sciences: Fall 2021
- STAT 7880 - Special Topics: Spring 2021
- CSCI 6910 - Master's Thesis Research: Spring 2021, Spring 2022
- CSCI 6800 - Compiler Writing: Fall 2021
Undergraduate Classes
- CSCI 4990 - Undergraduate Research: Fall 2022,
- CURS 4990 - Undergrad Research III: Summer 2020, Summer 2022
- CSCI 4800 - Compiler Writing: Fall 2021
- CSCI 3410 - Database Systems: Fall 2017, Spring 2018, Spring 2019, Fall 2019, Spring 2020, Fall 2020, Spring 2021, Fall 2021
- CSCI 1301 - Principles of Computer Programming I: Spring 2018, Fall 2018, Spring 2019, Fall 2019, Fall 2020, Spring 2022, Fall 2022 (labs only), Spring 2023 (labs only)
- CSCI 3271 - Operating System I: Fall 2017, Fall 2018

Before Coming to Augusta University

Fall 2016 - CS 1440 - Computer Science I, at Appstate
Between 2010 and 2015, I taught various courses in France: please refer to a presentation of my teaching activities or my (French) webpage for more information.

Research

I work in the vast field of computational logic, which uses mathematical reasoning to discover and explain the mechanisms of computation.

You might want to have a look at (in decreasing order of preference)

an open directory of my publications at dissemin,
self-archived research works at HAL and arXiv,
my publication list, also hosted at dblp, or at the NIH's Library,
my reviewer profile at MathSciNet or at zbMATH,
my orcid.org profile,
my google scholar profile,
my ResearchGate profile (but, please, do not use it, and refer to this post as to why you should refrain from using it),
my Pure profile.

If I were to use keywords, it would probably be

Using 2020 Mathematics Subject Classification

03D15 Complexity of computation (including implicit computational complexity)
03F52 Proof-theoretic aspects of linear logic and other substructural logics
68N18 Functional programming and lambda calculus
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
18C50 Categorical semantics of formal languages

Using the 2012 ACM Computing Classification System

Computing methodologies → Concurrent computing methodologies → Concurrent programming languages
Theory of computation
- Logic
  - Linear logic
  - Proof theory
  - Type theory
- Semantics and reasoning
  - Program semantics
  - Program reasoning → Program analysis
- Models of computation
  - Concurrency → Process calculi
  - Computability
  - Abstract machines
- Models of computation
  - Formal languages and automata theory → Formalisms → Rewrite systems
Hardware → Emerging technologies → Reversible logic

Publications

@mastersthesis{aubert2009,
	title        = {L'élimination des coupures dans la Logique des Domaines Constants},
	author       = {Aubert, Clément},
	year         = 2009,
	url          = {https://aubert.perso.math.cnrs.fr/recherche/memoire_m1_c_aubert.pdf},
	note         = {sous la dir. de J.-B. Joinet},
	school       = {Paris 1},
	type         = {Mémoire de M1}
}
@mastersthesis{aubert2010,
	title        = {Réseaux de preuves booléens sous-logarithmiques},
	author       = {Aubert, Clément},
	year         = 2010,
	month        = sep,
	url          = {https://aubert.perso.math.cnrs.fr/recherche/stage/memoire_m2_c_aubert.pdf},
	note         = {sous la dir. de V. Mogbil et P. Jacobé de Naurois},
	school       = {L.M.F.I., Paris VII},
	type         = {Mémoire de M2}
}
@conference{aubert2011,
	title        = {Sublogarithmic uniform Boolean proof nets},
	author       = {Aubert, Clément},
	year         = 2011,
	booktitle    = {DICE 2011},
	series       = {Electronic Proceedings in Theoretical Computer Science},
	volume       = 75,
	pages        = {15--27},
	doi          = {10.4204/EPTCS.75.2},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/sublogarithmic_uniform_boolean_proof_nets.pdf},
	editor       = {Marion, Jean-Yves},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/sublogarithmic_uniform_boolean_proof_nets.tex}
}
@phdthesis{aubert2013,
	title        = {Linear Logic and Sub-polynomial Classes of Complexity},
	author       = {Aubert, Clément},
	year         = 2013,
	month        = nov,
	url          = {https://aubert.perso.math.cnrs.fr/recherche/these/these_c_aubert.pdf},
	note         = {sous la dir. de S. Guerrini et V. Mogbil},
	school       = {Université Paris 13--Sorbonne Paris Cité},
	type         = {Thèse de doctorat},
	archiveprefix = {tel},
	eprint       = {tel-00957653}
}
@inproceedings{aubert2014rta,
	title        = {Unification and Logarithmic Space},
	author       = {Aubert, Clément and Bagnol, Marc},
	year         = 2014,
	booktitle    = {RTA-TLCA 2014},
	publisher    = {Springer},
	series       = {Lecture Notes in Computer Science},
	volume       = 8650,
	pages        = {77--92},
	doi          = {10.1007/978-3-319-08918-8_6},
	isbn         = {978-3-319-08917-1},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/unification-and-logarithmic-space_conf.pdf},
	editor       = {Dowek, Gilles},
	archiveprefix = {arXiv},
	eprint       = {1402.4327},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/unification-and-logarithmic-space_conf.tex}
}
@inproceedings{aubert2014aplas,
	title        = {Logic Programming and Logarithmic Space},
	author       = {Aubert, Clément and Bagnol, Marc and Pistone, Paolo and Seiller, Thomas},
	year         = 2014,
	booktitle    = {APLAS 2014},
	publisher    = {Springer},
	series       = {Lecture Notes in Computer Science},
	volume       = 8858,
	pages        = {39--57},
	doi          = {10.1007/978-3-319-12736-1_3},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/logic-programming-and-logarithmic-space.pdf},
	editor       = {Garrigue, Jacques},
	archiveprefix = {hal},
	eprint       = {hal-01309159},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/logic-programming-and-logarithmic-space.tex}
}
@article{aubert2016mscs,
	title        = {Characterizing co-{NL} by a group action},
	author       = {Aubert, Clément and Seiller, Thomas},
	year         = 2016,
	month        = may,
	journal      = {Mathematical Structures in Computer Science},
	volume       = 26,
	pages        = {606--638},
	doi          = {10.1017/S0960129514000267},
	issn         = {1469-8072},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/characterizing_co_nl.pdf},
	issue        = {04},
	numpages     = 33,
	archiveprefix = {hal},
	eprint       = {hal-01005705},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/characterizing_co_nl.tex}
}
@techreport{aubert2015inria,
	title        = {Memoization for Unary Logic Programming: Characterizing Ptime},
	author       = {Aubert, Clément and Bagnol, Marc and Seiller, Thomas},
	year         = 2015,
	number       = {RR-8796},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/Memoization_for_Unary_Logic_Programming.pdf},
	type         = {Rapport de recherche},
	institution  = {{INRIA}},
	pagetotal    = 28,
	archiveprefix = {hal},
	eprint       = {hal-01107377},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/Memoization_for_Unary_Logic_Programming.tex}
}
@conference{aubert2015ice,
	title        = {Reversible Barbed Congruence on Configuration Structures},
	author       = {Aubert, Clément and Cristescu, Ioana},
	year         = 2015,
	booktitle    = {ICE 2015},
	series       = {Electronic Proceedings in Theoretical Computer Science},
	volume       = 189,
	pages        = {68--95},
	doi          = {10.4204/EPTCS.189.7},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/reversible_barbed_congruence_on_configuration_structures.pdf},
	editor       = {Knight, Sophia and Lluch Lafuente, Alberto and Lanese, Ivan and Vieira, Hugo Torres},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/reversible_barbed_congruence_on_configuration_structures.tex},
	archiveprefix = {hal},
	eprint       = {hal-01157974v1}
}
@conference{aubert2015dice,
	title        = {An in-between “implicit” and “explicit” complexity: Automata},
	author       = {Aubert, Clément},
	institution  = {LACL},
	year         = 2015,
	url          = {https://aubert.perso.math.cnrs.fr/recherche/an_in_beteen_implicit_and_explicit_complexity.pdf},
	booktitle    = {DICE 2015},
	archiveprefix = {hal},
	eprint       = {hal-01111737v2},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/an_in_beteen_implicit_and_explicit_complexity.tex}
}
@article{Aubert2018lmcs,
	title        = {Unification and Logarithmic Space},
	author       = {Aubert, Clément and Bagnol, Marc},
	year         = 2018,
	journal      = {Logical Methods in Computer Science},
	volume       = 14,
	number       = 3,
	doi          = {10.23638/LMCS-14(3:6)2018},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/unification-and-logarithmic-space_jour.pdf},
	archiveprefix = {hal},
	eprint       = {hal-01157984},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/unification-and-logarithmic-space_jour.tex}
}
@article{aubert2017jlamp,
	title        = {Contextual equivalences in configuration structures and reversibility},
	author       = {Aubert, Clément and Cristescu, Ioana},
	year         = 2017,
	journal      = {Journal of Logical and Algebraic Methods in Programming},
	volume       = 86,
	number       = 1,
	pages        = {77--106},
	doi          = {10.1016/j.jlamp.2016.08.004},
	issn         = {2352-2208},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/contextual_equivalences_in_configuration_structures_and_reversibility.pdf},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/contextual_equivalences_in_configuration_structures_and_reversibility.tex},
	archiveprefix = {hal},
	eprint       = {hal-01229408}
}
@inproceedings{aubert2016fossacs,
	title        = {Unary Resolution: Characterizing Ptime},
	author       = {Aubert, Clément and Bagnol, Marc and Seiller, Thomas},
	year         = 2016,
	booktitle    = {FOSSACS 2016},
	publisher    = {Springer},
	series       = {Lecture Notes in Computer Science},
	volume       = 9634,
	pages        = {373--389},
	doi          = {10.1007/978-3-662-49630-5_22},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/Unary_Resolution_Characterizing_Ptime.pdf},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/Unary_Resolution_Characterizing_Ptime.tex},
	editor       = {Jacobs, Bart and Löding, Christof},
	archiveprefix = {hal},
	eprint       = {hal-01107377}
}
@article{aubert2016iac,
	title        = {Logarithmic Space and Permutations},
	author       = {Aubert, Clément and Seiller, Thomas},
	year         = 2016,
	journal      = {Information and Computation},
	volume       = 248,
	pages        = {2--21},
	doi          = {10.1016/j.ic.2014.01.018},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/logarithmic_space_and_permutations.pdf},
	editor       = {Ronchi Della Rocca, Simona and Mogbil, Virgile},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/logarithmic_space_and_permutations.tex},
	archiveprefix = {hal},
	eprint       = {hal-01005701}
}
@techreport{aubert2019category,
	title        = {Categories for Me, and You?},
	author       = {Aubert, Clément},
	year         = 2019,
	number       = {},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/categories_for_me.pdf},
	type         = {Rapport de recherche},
	institution  = {Augusta University},
	pagetotal    = 45,
	archiveprefix = {hal},
	eprint       = {hal-02308858},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/categories_for_me.zip}
}
@conference{aubert2020ice,
	title        = {Structural Equivalence in Reversible Calculus of Communicating Systems (Abstract)},
	author       = {Aubert, Clément and Cristescu, Ioana},
	year         = 2020,
	url          = {https://aubert.perso.math.cnrs.fr/recherche/structural_equivalence_in_rccs_abstract.pdf},
	archiveprefix = {hal},
	eprint       = {hal-02118036},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/structural_equivalence_in_rccs_abstract.tex},
	booktitle    = {ICE 2020}
}
@inproceedings{Aubert2020concur,
	title        = {How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation},
	author       = {Aubert, Clément and Cristescu, Ioana},
	year         = 2020,
	booktitle    = {CONCUR 2022},
	publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
	series       = {LIPIcs},
	volume       = 2017,
	pages        = {7:1--7:23},
	doi          = {10.4230/LIPIcs.CONCUR.2020.7},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/how_reversibility_can_solve_traditional_questions.pdf},
	editor       = {Igor Konnov and Laura Kovács},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/how_reversibility_can_solve_traditional_questions.tex}
}
@conference{Aubert2020Process,
	title        = {{Process, Systems and Tests: Three Layers in Concurrent Computation}},
	author       = {Aubert, Clément and Varacca, Daniele},
	url          = {https://aubert.perso.math.cnrs.fr/recherche/process_systems_tests.pdf},
	file         = {https://aubert.perso.math.cnrs.fr/recherche/process_systems_tests.tex},
	editor       = {Lange, Julien and Mavridou, Anastasia and Safina, Larisa and Scalas,  Alceste},
	booktitle    = {Proceedings 14th Interaction and Concurrency Experience, {ICE} 2021, Online, 18th June 2021},
	series       = {{EPTCS}},
	volume       = {347},
	pages        = {1--21},
	year         = {2021},
	doi          = {10.4204/EPTCS.347.1}
}
@article{Aubert2022jlamp,
	title        = {Processes Against Tests: On Defining Contextual Equivalences},
	author       = {Aubert, Clément and Varacca, Daniele},
	year         = 2022,
	journal      = {Journal of Logical and Algebraic Methods in Programming},
	pages        = 100799,
	doi          = {10.1016/j.jlamp.2022.100799},
	issn         = {2352-2208},
	archiveprefix = {hal},
	eprint       = {hal-03535565}
}
@inproceedings{Aubert2021RC,
	title        = {Explicit Identifiers and Contexts in Reversible Concurrent Calculus},
	author       = {Aubert, Clément and Medić,  Doriana},
	year         = 2021,
	booktitle    = {RC 2021},
	publisher    = {Springer},
	series       = {Lecture Notes in Computer Sciences},
	volume       = 12805,
	pages        = {144--162},
	doi          = {10.1007/978-3-030-79837-6_9},
	editor       = {Yamashita, Shigeru and Yokoyama, Tetsuo},
	archiveprefix = {hal},
	eprint       = {hal-03183053v1}
}
@proceedings{ICE2022,
	title        = {Proceedings 15th Interaction and Concurrency Experience, {ICE} 2022, Lucca, Italy, 17th June 2022},
	year         = 2022,
	series       = {EPTCS},
	volume       = 365,
	doi          = {10.4204/EPTCS.365},
	publisher    = {Open Publishing Association},
	editor       = {Aubert, Clément and Di Giusto, Cinzia and Safina, Larisa and Scalas, Alceste} 
}
@inproceedings{Aubert2022ExpressSos,
	title        = {Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus},
	author       = {Aubert, Clément and Horne, Ross and Johansen, Christian},
	year         = 2022,
	booktitle    = {EXPRESS/SOS 2022},
	series       = {{EPTCS}},
	volume       = 368,
	pages        = {3--22},
	doi          = {10.4204/EPTCS.368.1},
	editor       = {Castiglioni, Valentina and Mezzina, Claudio Antares}
}
@inproceedings{Aubert2022Concur,
	title        = {Diamonds for Security: {A} Non-Interleaving Operational Semantics for the Applied Pi-Calculus},
	author       = {Aubert, Clément and Horne, Ross and Johansen, Christian},
	year         = 2022,
	booktitle    = {CONCUR 2022},
	publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
	series       = {LIPIcs},
	volume       = 243,
	pages        = {30:1--30:26},
	doi          = {10.4230/LIPIcs.CONCUR.2022.30},
	editor       = {Klin, Bartek and Lasota, Slawomir and Muscholl, Anca}
}
@inproceedings{Aubert2022RC,
	title        = {Concurrencies in Reversible Concurrent Calculi},
	author       = {Aubert, Clément},
	year         = 2022,
	booktitle    = {RC 2022},
	publisher    = {Springer},
	series       = {Lecture Notes in Computer Science},
	volume       = 13354,
	pages        = {146--163},
	doi          = {10.1007/978-3-031-09005-9\_10},
	editor       = {Mezzina, Claudio Antares and Podlaski, Krzysztof},
    archiveprefix = {hal},
	eprint       = {hal-03605003}
}
@inproceedings{Aubert2022FSCD,
	title        = {mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity},
	author       = {Aubert, Clément and Rubiano, Thomas and Rusch, Neea and Seiller, Thomas},
	year         = 2022,
	booktitle    = {FSCD 2022},
	publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
	series       = {LIPIcs},
	volume       = 228,
	pages        = {26:1--26:23},
	doi          = {10.4230/LIPIcs.FSCD.2022.26},
	editor       = {Felty, Amy P.}
}
@inproceedings{Aubert2022CRIS,
	title        = {Data Integration for the Study of Outstanding Productivity in Biomedical Research},
	author       = {Aubert, Clément and Balas, E Andrew and Townsend, Tiffany and Sleeper, Noah and Tran, CJ},
	year         = 2022,
	series       = {Procedia Computer Science},
	editor       = {Sicilia, Miguel-Angel and De-Castro, Pablo and Vancauwenbergh, Sadia and Simons, Ed and Ognjen, Orel},
	publisher    = {Elsevier},
	volume       = 211,
	pages        = {196--200},
	doi          = {10.1016/j.procs.2022.10.191},
	issn         = {1877-0509},
	booktitle    = {CRIS 2022},
    archiveprefix = {handle},
	eprint       = {11366/1987}
}
@conference{Aubert2022Types,
	title        = {Realizing Implicit Computational Complexity},
	author       = {Aubert, Clément and Rubiano, Thomas and Rusch, Neea and Seiller, Thomas},
	year         = 2022,
	editor       = {Kesner, Delia and Pédrot, Pierre-Marie}, 
	month        = Mar,
	booktitle    = {Types 2022},
    archiveprefix = {hal},
    eprint        = {hal-03603510}
}
@inproceedings{AubertRRS23,
  author    = {Aubert, Clément and Rubiano, Thomas and Rusch, Neea and Seiller, Thomas},
  editor    = {Dragoi, Cezara and Emmi, Michael and Wang, Jingbo},
  title     = {Distributing and Parallelizing Non-canonical Loops},
  booktitle = {{VMCAI} 2023},
  series    = {Lecture Notes in Computer Science},
  volume    = {13881},
  pages     = {1--24},
  publisher = {Springer},
  year      = {2023},
  doi       = {10.1007/978-3-031-24950-1\_1}
}

Internships and Projects

Please, contact me if you are interested in an internship with me. Some examples of internships proposals can be found below.

In the past, I have had the pleasure of working with (in no particular order) Bryana Vinson, Bobby Mcmanus, Minh Nguyen, Poonam Veeral, Cystal Anderson, Tim Cuny, John Natale, Assya Sellak, Mark Holcomb, Noah Sleeper and Hunter Wilkins, and I currently work with Peter Browning, CJ Tran and Neea Rusch.

Current Projects

I am mostly working on the StATyCC project with Neea Rusch lately.

I am also involved in the project led with Drs. Andrew Balas and Tiffany Townsend, Practices of outstanding productivity in biomedical research, that involves CJ Tran and Noah Sleeper. Some of the code written for that project is on-line.

I am also investigating and implementing concurrent and reversible process algebras with Peter Browning.

Past Projects

Student(s)	Project	Result
Samy Avrillon	Revisiting Contextual Equivalences for Process Algebras	During Summer 2022, please refer to the proposal for more information.
Peter Browning	An Implementation of Reversible Distributed Calculus (CCSK)	Ongoing (Fall 2021), CURS undergrad research project (cf. also this proposal) and source code
Redacted, Mark Holcomb, Assya Sellak, Sydney Strong, Patrick Woolard	Feature Implementation for Open-Source Pandoc Filters	Completed during Fall 2020, as a senior capstone project.
Bobby Mcmanus, Minh Nguyen, Poonam Veeral	Capstone Project – Lecture Notes for CSCI 3410 Database Systems	Completed during Fall 2020, as a senior capstone project
John Natale	Connecting Concurrent Computations	Completed during Summer 2020, as a CURS undergrad research project.

Future Projects

Title	Description
Implementing Reversible Concurrent Programs Specification Languages	Refer to this proposal for a capstone project for Spring 2023
Program Analysis and Manipulations in Compilers	Refer to this proposal for a capstone project for Spring 2023

Miscellaneous

Letterhead for the School

I wrote a letterhead for the Augusta University using XeTeX and pandoc, you can download and preview it on-line.

Template for MS & PhD Students

I wrote the template for the MS and PhD students at our School, you can find it on-line.

Traveling with Augusta University

I wrote a small guide to discuss how traveling is handled at Augusta University (it is quite probably outdated).

Reviewing Research Papers

I keep some notes to share some resources for first-time reviewers.

Contact

caubert@augusta.edu
University Hall, 105
33.47753, -82.02233
You can meet with me upon request, or during the CSCI 1301 labs, whose meeting time and place are indicated here.
CSCI 1301 students can also request a meeting with their UCA, ask for help on the discord channel, or schedule in-person tutoring in University Hall 129. Please, refer to this page for detailed and up-to-date guidance.
AU School of Computer and Cyber Sciences
Cyber Institute
1120 15th Street, UH 127
Augusta, GA 30904
United States of America
+1 706 737 1566
+1 828 278 4620
spots.augusta.edu/caubert/ or aubert.perso.math.cnrs.fr
@clementaubert