Advancing Polynomial and Logical Approaches for Trusted Automated Reasoning over Integrated Systems
The status, timeline and source of this project. A free account opens every field.
Source: EU Funding & Tenders Portal
In today's digital world, the correctness of systems is not optional; it is essential. From hardware circuits in medical devices and aircraft to cryptographic protocols securing our data, the systems that underpin society demand absolute precision down to the level of individual bits. Formal verification employs rigorous mathematical techniques and logical reasoning to guarantee that such systems
- Status
- Prospective
- Sector
- Hospital, Aerospace & Defense
- Location
- Austria
- Updated
- 19 Nov 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Advancing Polynomial and Logical Approaches for Trusted Automated Reasoning over Integrated Systems
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | forthcoming |
Taiyo status | Prospective |
Taiyo last update | 2026-11-19 |
Contact
| Not available for this record. |
Description
Description | In today's digital world, the correctness of systems is not optional; it is essential. From hardware circuits in medical devices and aircraft to cryptographic protocols securing our data, the systems that underpin society demand absolute precision down to the level of individual bits. Formal verification employs rigorous mathematical techniques and logical reasoning to guarantee that such systems behave exactly as intended. A wide range of central verification tasks, including proving the correctness of hardware circuits, analyzing cryptographic encodings, and reasoning about bit-vectors that model computer memory, can be naturally encoded as non-linear polynomials over finite variable domains. State-of-the-art reasoning approaches, such as satisfiability modulo theory solvers, however, reduce these tasks to propositional reasoning on the bit-level and apply satisfiability solving, which becomes infeasible when confronted with the complexity of modern systems involving non-linear arithmetic and large state spaces. POLARIS addresses this bottleneck by developing a new generation of trusted verification techniques that operate directly on polynomial representations while preserving bit-level accuracy. Central to this vision is the tight integration of algebraic methods for word-level reasoning with established bit-level approaches, combined with proof logging that produces machine-checkable certificates. This ensures that every verification result is both scalable and independently trustworthy. Reaching this ambitious goal will enable verification capabilities that are currently unattainable, in particular for complex arithmetic circuits, cryptographic protocols, and low-level memory models with high arithmetic complexity. By advancing the theoretical foundations and practical algorithms for bit-precise reasoning, the project will extend the frontier of formal verification and decisively strengthen the reliability and trustworthiness of future digital systems. |
Location
Country | Austria |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Hospital, Aerospace & Defense |
Article published date | 2026-09-01 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
