DC Field
Value
Language
dc.contributor.author
Hader, Thomas
-
dc.contributor.author
Ozdemir, Alex
-
dc.date.accessioned
2025-01-30T11:38:18Z
-
dc.date.available
2025-01-30T11:38:18Z
-
dc.date.issued
2024
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Hader, T., &#38; Ozdemir, A. (2024). An SMT-LIB Theory of Finite Fields. In <i>Proceedings of the 22nd International Workshop on Satisfiability Modulo Theories (SMT 2024), Montreal, Canada, July, 22-23, 2024.</i> 22nd International Workshop on Satisfiability Modulo Theories (SMT 2024), Montreal, Canada. CEUR Workshop Proceedings. https://doi.org/10.34726/8461</div> </div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/210203
-
dc.identifier.uri
https://doi.org/10.34726/8461
-
dc.description.abstract
In the last few years there have been rapid developments in SMT solving for finite fields. These include new decision procedures, new implementations of SMT theory solvers, and new software verifiers that rely on SMT solving for finite fields. To support interoperability in this emerging ecosystem, we propose the SMT-LIB theory of finite field arithmetic (FFA). The theory defines a canonical representation of finite field elements as well as definitions of operations and predicates on finite field elements.
en
dc.language.iso
en
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
SMT solving
en
dc.subject
SMT-LIB
en
dc.subject
finite fields
en
dc.title
An SMT-LIB Theory of Finite Fields
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.rights.license
Creative Commons Namensnennung 4.0 International
de
dc.rights.license
Creative Commons Attribution 4.0 International
en
dc.relation.publication
Proceedings of the 22nd International Workshop on Satisfiability Modulo Theories (SMT 2024), Montreal, Canada, July, 22-23, 2024.
-
dc.identifier.doi
10.34726/8461
-
dc.contributor.affiliation
Stanford University, United States of America (the)
-
dc.rights.holder
© 2024 Copyright for this paper by its authors.
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
Proceedings of the 22nd International Workshop on Satisfiability Modulo Theories (SMT 2024), Montreal, Canada, July, 22-23, 2024
-
tuw.container.volume
3725
-
tuw.peerreviewed
true
-
tuw.relation.publisher
CEUR Workshop Proceedings
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
tuw.publication.orgunit
E056-10 - Fachbereich SecInt-Secure and Intelligent Human-Centric Digital Technologies
-
dc.identifier.libraryid
AC17422631
-
dc.description.numberOfPages
10
-
tuw.author.orcid
0000-0002-0181-6752
-
dc.rights.identifier
CC BY 4.0
de
dc.rights.identifier
CC BY 4.0
en
tuw.event.name
22nd International Workshop on Satisfiability Modulo Theories (SMT 2024)
en
dc.description.sponsorshipexternal
NSF
-
dc.relation.grantnoexternal
2110397
-
tuw.event.startdate
22-07-2024
-
tuw.event.enddate
23-07-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Montreal
-
tuw.event.country
CA
-
tuw.event.presenter
Hader, Thomas
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.grantfulltext
open
-
item.languageiso639-1
en
-
item.openairetype
conference paper
-
item.openaccessfulltext
Open Access
-
item.cerifentitytype
Publications
-
item.mimetype
application/pdf
-
item.fulltext
with Fulltext
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
crisitem.author.dept
Stanford University
-
crisitem.author.orcid
0000-0002-0181-6752
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
Appears in Collections:
Conference Paper
Thumbnail
Fulltext (Version of Record (published version))
Adobe PDF
(1.19 MB)
An SMT-LIB Theory of Finite Fields
Open Access CC BY 4.0
Show simple item record

Page view(s)

55
checked on Jan 30, 2025

Download(s)

13
checked on Jan 30, 2025

Google ScholarTM

Check