| CARVIEW |
Select Language
HTTP/2 200
server: GitHub.com
content-type: text/html; charset=utf-8
last-modified: Sun, 28 Sep 2025 04:46:57 GMT
access-control-allow-origin: *
strict-transport-security: max-age=31556952
etag: W/"68d8bdc1-37a3"
expires: Tue, 30 Dec 2025 00:53:22 GMT
cache-control: max-age=600
content-encoding: gzip
x-proxy-cache: MISS
x-github-request-id: AF16:3946E9:9610BD:A89D27:69532029
accept-ranges: bytes
age: 0
date: Tue, 30 Dec 2025 00:43:22 GMT
via: 1.1 varnish
x-served-by: cache-bom-vanm7210083-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1767055402.963053,VS0,VE215
vary: Accept-Encoding
x-fastly-request-id: a618f98b32086b01b38464028206eb4f63d72d19
content-length: 4333
Pedro Saccomani
Hi! I am Pedro Saccomani, a first year PhD student at Universidade Federal de Minas Gerais, working under Haniel Barbosa supervision.
My general research interest is the interplay of symbolic computation and satisfiability checking. Currently, I am working on the production of proof certificates of Satisfiability Modulo Theories (SMT) procedures based on computer algebra.
Specifically, I am working towards a proof producing SMT theory of finite fields. I am also interested in proof generation for the theory of non-linear real arithmetic.