Skip to main content
Conference ProceedingsOPEN ACCESS

JBernstein: A validity checker for generalized polynomial constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8044 LNCS 656-661
DOI: 10.1007/978-3-642-39799-8_43
3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Efficient and scalable verification of nonlinear real arithmetic constraints is essential in many automated verification and synthesis tasks for hybrid systems, control algorithms, digital signal processors, and mixed analog/digital circuits. Despite substantial advances in verification technology, complexity issues with classical decision procedures for nonlinear real arithmetic are still a major obstacle for formal verification of real-world applications. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Cheng, C. H., Ruess, H., & Shankar, N. (2013). JBernstein: A validity checker for generalized polynomial constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8044 LNCS, pp. 656–661). https://doi.org/10.1007/978-3-642-39799-8_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free