Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(13 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: César A. Muñoz / rank
Normal rank
 
Property / author
 
Property / author: César A. Muñoz / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6585552 / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear arithmetic
Property / zbMATH Keywords: nonlinear arithmetic / rank
 
Normal rank
Property / zbMATH Keywords
 
decision procedure
Property / zbMATH Keywords: decision procedure / rank
 
Normal rank
Property / zbMATH Keywords
 
prototype verification system (PVS)
Property / zbMATH Keywords: prototype verification system (PVS) / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial inequalities
Property / zbMATH Keywords: polynomial inequalities / rank
 
Normal rank
Property / zbMATH Keywords
 
Sturm's theorem
Property / zbMATH Keywords: Sturm's theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
Tarski's theorem
Property / zbMATH Keywords: Tarski's theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
automated theorem proving
Property / zbMATH Keywords: automated theorem proving / rank
 
Normal rank
Property / zbMATH Keywords
 
interactive theorem proving
Property / zbMATH Keywords: interactive theorem proving / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PVSio / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MetiTarski / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RealPaver / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gappa / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: dReal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PVS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-015-9320-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978149312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MetiTarski: An automatic theorem prover for real-valued special functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization and Execution of Linear Algebra: From Theorems to Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying the Floating-Point Implementation of an Elementary Function Using Gappa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Real Number Calculations: A Library for Interval Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Refinement-Based Approach to Computational Algebra in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fundamental Theorem of Algebra Made Effective: An Elementary Real-algebraic Proof via Sturm Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: dReal: An SMT Solver for Nonlinear Theories over the Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Bernstein expansion to the solution of control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-Free, Set-Free Concrete Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Nonlinear Real Formulas Via Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the cylindrical algebraic decomposition within the Coq system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Bounds on Real-Valued Functions with Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Generation of Positivstellensatz Witnesses in Degenerate Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of Bernstein polynomials and applications to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Decision Techniques for the Existential Theory of the Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 02:09, 12 July 2024

scientific article
Language Label Description Also known as
English
Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems
scientific article

    Statements

    Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    nonlinear arithmetic
    0 references
    decision procedure
    0 references
    prototype verification system (PVS)
    0 references
    polynomial inequalities
    0 references
    Sturm's theorem
    0 references
    Tarski's theorem
    0 references
    automated theorem proving
    0 references
    interactive theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers