Open research questions in Formal Methods in Verification
47 unresolved questions extracted from the limitations and future-work sections of 277 Formal Methods in Verification papers in our library. Each links back to the study that raised it.
What the literature leaves open
Division is typically avoided or omitted in standard logic systems due to its complexity. The system needs to handle division without contradiction or error.
Standard quaternary logic maintains structural similarity to binary. Binary logic serves as the foundation for standard quaternary and most existing systems.
Manual testbench development is error-prone, coverage-limited, and cannot scale to modern SoC designs. Formal verification methods face scalability limitations for complex processor designs. The need for a practical, reproducible, and license-free verification framework applicable across different DUT types.
ConfigDrivenV: A Python-Integrated UVM Testbench for Automated RTL Verification with Self-Checking Scoreboard · 2026 · DOIPath verification remains a critical challenge in modern network architectures. Advanced attacks in which malicious intermediate nodes suppress TTL reduction. Sophisticated attacks attempting to manipulate packet metadata.
One challenge is designing a verification architecture that can handle complex claims and warrants. Another challenge is ensuring that the engine's verdict-reliability layer is robust and reliable.
To verify the correspondence with OCGS formally. To detect changes in the model. To exercise the language model layers in the test bench.
The gap in existing work is the lack of efficient algorithms for verifying and enforcing strong state-based opacity. The gap in existing work is the lack of a comprehensive understanding of the relationship between strong state-based opacity and other notions of opacity.
The early phases of a typical design process involve defining an initial set of requirements and allocating them to subsystems and components, which is challenging. There is a need for a compositional approach to the early modeling and analysis of complex aerospace systems.
The paper identifies a gap in the understanding of the identification boundary for temporally extended bounded observers. It highlights the limitations of classical halting logic.
The need for a deterministic structural solver. The lack of a system that operates over generic structural tension without a fixed domain.
The evaluation compares the Lazy and Lemma settings only on a 'small benchmark set' rather than the full 19,385-benchmark suite used for Lazy vs. Eager comparison. This limited evaluation of the lemma-based int-blasting translation function (TLem) prevents comprehensive assessment of when lemma-based approaches outperform lazy approaches across diverse bit-vector logics.
While the paper demonstrates that lazy int-blasting produces fewer modulo operations on average (51.15% fewer than eager), the evaluation notes that 'less modulo operations does not necessarily imply less [performance]' but does not provide a systematic analysis of the relationship between modulo operation count and solver performance on different benchmark classes.
No existing work directly integrates Python-generated golden reference data with UVM via file I/O on free simulation tools. The need for a practical, reproducible, and license-free verification framework applicable across different DUT types.
ConfigDrivenV: A Python-Integrated UVM Testbench for Automated RTL Verification with Self-Checking Scoreboard · 2026 · DOIPath verification remains a critical challenge in modern network architectures. The TeraflowSDN controller provides advanced traffic engineering capabilities, but lacks a robust path verification mechanism.
The state space explosion in verification and synthesis of discrete event systems is a major problem. Existing methods for model reduction have limitations.
Existing methods restrict safe temporal specifications to probabilistic-avoidance constraints. General PCTL synthesis is computationally hard and undecidable under certain assumptions.
98 million in confirmed public research funding, the VeriBee spin-off, and a defense industrial deployment at Lockheed Martin - and conclude with a structured agenda of open challenges spanning scalability, neurosymbolic verification, counterexample intelligibility, cross-language verification, safety standards compliance, and open-source sustainability.
ESBMC: A Survey of Its Evolution, Integration, and Future Directions in Formal Software Verification · 2026To extend the class of STPs and that of CSTPs to more general data structures. To improve the efficiency of the CHC solver incorporating the CSTP inference.
Fully automated verification of programs manipulating recursive data structures remains a challenge. Key invariants often involve inductive predicates, which are difficult to find automatically.
Obtaining high-quality bounds requires a domain expert to come up with a good idea and prove its admissibility. There is a need for a method to automatically derive high-quality admissible heuristics for DIDP.
We introduced operator-counting heuristics based on net- change constraints for DIDP. These heuristics achieve strong lower bounds, matching or exceeding some manually speci- fied bounds without requiring input from a domain expert. Preprocessing is the main bottleneck for our current ap- proach as each combination of an operator and a feature re- quires solving up to 64 SMT problems. Generating features incrementally up to a threshold would reduce the load. We also plan to study a per-domain lifted computation of the intervals ∆o,f to amortize the cost over multiple instances. In classical planning, potential heuristics can quickly approximate net-change constraints with high accuracy. Adopting this idea to our setting could speed up the dual bound computation. Conversely it would be interesting to try our heuristic in a (non-simple) numeric planning setting. Our framework can handle any commutative cost algebra using logic-based Benders decomposition. Extending it to non-commutative algebras is an interesting problem. We use abstract interpretations to derive invariants for DIDP which offers other directions for future work. For ex- ample, we could introduce explicit variables for ∆o,f inside our non-deterministic program and derive invariants on them without an SMT solver.
Despite these competing intuitions, the hardware-system-level trade-offs between NTT- and SumCheck-based proving primitives remain insufficiently understood.
When Proofs Meet Hardware: Comparing NTT and SumCheck in Zero-Knowledge Systems · 2026Modern computing is a patchwork of architectures separated by decades of design assumptions. Legacy systems operate through deterministic, low-variance pathways, while modern AI accelerators push massive parallelism, probabilistic workloads, and high-frequency stress patterns.
The Invariant Handshake: Stabilizing AI–Legacy Interoperability Through Geometric Normalization · 2026 · DOIFuture research should explore the application of the optimizer quotient to other decision models. It should investigate the development of more efficient certification algorithms. The paper suggests exploring the complexity of certification problems in other contexts.
The paper identifies a gap in the understanding of the complexity of certification problems. It highlights the need for a framework to understand the relationship between the optimizer quotient and the certification trilemma.
Most-cited papers in Formal Methods in Verification
- Formal Methods in Industry · Formal Aspects of Computing · 2024 · 35 citations
- VTF-01 — Synkyria as an Operator-and-Witness Extension of Viability Theory under Finite Capacity · Zenodo (CERN European Organization for Nuclear Research) · 2026 · 10 citations
- Scratch-Based User-Friendly Requirements Definition for Formal Verification of Control Systems · Informatics in Education · 2020 · 6 citations
- Description styles of fault-tolerant finite state machines for unmanned aerial vehicles · RADIOELECTRONIC AND COMPUTER SYSTEMS · 2024 · 6 citations
- VECTAETOS™ Non-Agentic License v1.1 · Zenodo (CERN European Organization for Nuclear Research) · 2026 · 4 citations
- Implementation with a sympathizer · Mathematical Social Sciences · 2022 · 4 citations
- Functional safety verification of train control procedure in train-centric CBTC by colored petri net · Archives of Transport · 2020 · 4 citations
- Non-Circular Projection Undemonstrability of the Riemann Hypothesis · Zenodo (CERN European Organization for Nuclear Research) · 2026 · 2 citations
- Unbounded Model Checking for ATL · Studia Informatica System and information technology · 2021 · 2 citations
- The Robustness Requirement on Alternative Possibilities · The Journal of Ethics · 2022 · 1 citations
Most recent work
- VTF-01 — Synkyria as an Operator-and-Witness Extension of Viability Theory under Finite Capacity · Zenodo (CERN European Organization for Nuclear Research) · 2026
- VECTAETOS™ Non-Agentic License v1.1 · Zenodo (CERN European Organization for Nuclear Research) · 2026
- Non-Circular Projection Undemonstrability of the Riemann Hypothesis · Zenodo (CERN European Organization for Nuclear Research) · 2026
- Bounded Model Checking for Multiplexer implemented Approximate Circuit · WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS · 2026
- A lazy and modular approach to int-blasting · Acta Informatica · 2026
- Generation Count and Residual Parameters in the Standard Model Representation Regime · Open MIND · 2026
- Artifact for Artificial Incorrectness: SMT and LLMs in Hardware Synthesis · Zenodo (CERN European Organization for Nuclear Research) · 2026
- Cathedral-OS / AOAG HAASA v2.0 Technical Handoff Package High-Assurance Governance Architecture for Autonomous Systems · Zenodo (CERN European Organization for Nuclear Research) · 2026
- SIS‑10: Safety Intelligence System: Formal Core v1.2 · Zenodo (CERN European Organization for Nuclear Research) · 2026
- Artifact of Model Checking Matrix Product States Against Linear Chain Logic · Zenodo (CERN European Organization for Nuclear Research) · 2026
Find a gap in your own Formal Methods in Verification sub-topic
This page shows what the Formal Methods in Verification literature already flags as unresolved. To narrow it to your specific question, run the guided finder — it searches the gap library on demand and checks candidates against 250M+ OpenAlex works.
Open the Research Gap Finder →