Metitarski: Past and future
LC Paulson - International Conference on Interactive Theorem …, 2012 - Springer
A brief overview is presented of MetiTarski 4, an automatic theorem prover for real-valued
special functions: ln, \exp, sin, cos, etc. MetiTarski operates through a unique interaction …
special functions: ln, \exp, sin, cos, etc. MetiTarski operates through a unique interaction …
Coquelicot: A user-friendly library of real analysis for Coq
S Boldo, C Lelay, G Melquiond - Mathematics in Computer Science, 2015 - Springer
Real analysis is pervasive to many applications, if only because it is a suitable tool for
modeling physical or socio-economical systems. As such, its support is warranted in proof …
modeling physical or socio-economical systems. As such, its support is warranted in proof …
MetiTarski: An automatic theorem prover for real-valued special functions
B Akbarpour, LC Paulson - Journal of Automated Reasoning, 2010 - Springer
Many theorems involving special functions such as ln, exp and sin can be proved
automatically by MetiTarski: a resolution theorem prover modified to call a decision …
automatically by MetiTarski: a resolution theorem prover modified to call a decision …
Certification of bounds on expressions involving rounded operators
M Daumas, G Melquiond - ACM Transactions on Mathematical Software …, 2010 - dl.acm.org
Gappa is a tool designed to formally verify the correctness of numerical software and
hardware. It uses interval arithmetic and forward error analysis to bound mathematical …
hardware. It uses interval arithmetic and forward error analysis to bound mathematical …
Automatic estimation of verified floating-point round-off errors via static analysis
This paper introduces a static analysis technique for computing formally verified round-off
error bounds of floating-point functional expressions. The technique is based on a …
error bounds of floating-point functional expressions. The technique is based on a …
Formalization of Bernstein polynomials and applications to global optimization
C Munoz, A Narkawicz - Journal of Automated Reasoning, 2013 - Springer
This paper presents a formalization in higher-order logic of a practical representation of
multivariate Bernstein polynomials. Using this representation, an algorithm for finding lower …
multivariate Bernstein polynomials. Using this representation, an algorithm for finding lower …
Formalization of real analysis: A survey of proof assistants and libraries
S Boldo, C Lelay, G Melquiond - Mathematical Structures in …, 2016 - cambridge.org
In the recent years, numerous proof systems have improved enough to be used for formally
verifying non-trivial mathematical results. They, however, have different purposes and it is …
verifying non-trivial mathematical results. They, however, have different purposes and it is …
Embedding differential dynamic logic in PVS
JT Slagel, M Moscato, L White, CA Muñoz… - arXiv preprint arXiv …, 2024 - arxiv.org
Differential dynamic logic (dL) is a formal framework for specifying and reasoning about
hybrid systems, ie, dynamical systems that exhibit both continuous and discrete behaviors …
hybrid systems, ie, dynamical systems that exhibit both continuous and discrete behaviors …
Nonlinear dynamic systems parameterization using interval-based global optimization: Computing lipschitz constants and beyond
Numerous state-feedback and observer designs for nonlinear dynamic systems (NDS) have
been developed in the past three decades. These designs assume that NDS nonlinearities …
been developed in the past three decades. These designs assume that NDS nonlinearities …
Proving tight bounds on univariate expressions with elementary functions in Coq
É Martin-Dorel, G Melquiond - Journal of Automated Reasoning, 2016 - Springer
The verification of floating-point mathematical libraries requires computing numerical
bounds on approximation errors. Due to the tightness of these bounds and the peculiar …
bounds on approximation errors. Due to the tightness of these bounds and the peculiar …