POLARIS Advancing Polynomial and Logical Approaches for Trusted Automated Reasoning over Integrated Systems
- Coordinator
- Technische Universitaet Wien, Austria
- Runs
- 1 January 2027 to 31 December 2031
- Status
- Running
- EU funding
- €1.5m
- Total cost
- €1.5m
- Partners
- 1 organisations in 1 countries
- Type
- European Research Council grant
- Grant agreement
- 101302778
What the project is doing
In the project's own words, from its summary on CORDIS.
In today's digital world, the correctness of systems is notoptional; it is essential. From hardware circuits in medical devices andaircraft to cryptographic protocols securing our data, the systems thatunderpin society demand absolute precision down to the level of individualbits. Formal verification employs rigorous mathematical techniques and logicalreasoning to guarantee that such systems behave exactly as intended.
A wide range of central verification tasks, including proving the correctnessof hardware circuits, analyzing cryptographic encodings, and reasoning aboutbit-vectors that model computer memory, can be naturally encoded as non-linearpolynomials over finite variable domains. State-of-the-art reasoningapproaches, such as satisfiability modulo theory solvers, however, reduce thesetasks to propositional reasoning on the bit-level and apply satisfiabilitysolving, which becomes infeasible when confronted with the complexity of modernsystems involving non-linear arithmetic and large state spaces.
POLARIS addresses this bottleneck by developing a new generation of trustedverification techniques that operate directly on polynomial representationswhile preserving bit-level accuracy. Central to this vision is the tightintegration of algebraic methods for word-level reasoning with establishedbit-level approaches, combined with proof logging that producesmachine-checkable certificates. This ensures that every verification result isboth scalable and independently trustworthy.
Reaching this ambitious goal will enable verification capabilities that arecurrently unattainable, in particular for complex arithmetic circuits,cryptographic protocols, and low-level memory models with high arithmeticcomplexity. By advancing the theoretical foundations and practical algorithmsfor bit-precise reasoning, the project will extend the frontier of formalverification and decisively strengthen the reliability and trustworthiness offuture digital systems.
Topics
Who is involved
| Organisation | City | Country | Role |
|---|---|---|---|
| Technische Universitaet Wien | Wien | Austria | Coordinator |
Source: CORDIS, European Commission. Data of 5 Nov 2026, reused under the Commission's reuse policy. View on CORDIS · Grant DOI