Formal Methods in Verification
This cluster of papers revolves around formal methods in software verification and control, focusing on topics such as model checking, symbolic model checking, satisfiability modulo theories, temporal logic, hybrid systems, automata, safety verification, control barrier functions, runtime verification, and probabilistic systems.
Papers listed on taxonomy pages are the top few works per node from the OpenAlex snapshot. That list is not exhaustive and is not an endorsement. The topic map and the journal registry remain separate: there is still no authoritative topic-to-venue or topic-to-organization edge. Search is a lexical lookup, not a claim that a venue publishes a topic.
Most cited
- Statecharts: a visual formalism for complex systems
- A theory of timed automata
- Protocol Analysis: Verbal Reports as Data
- Planning and acting in partially observable stochastic domains
- The model checker SPIN
- Automatic verification of finite-state concurrent systems using temporal logic specifications
Most recent
- Checking Timed Bisimilarity with Virtual Clocks
- Solving rational expectations models on non-periodic time domains
- Runtime Pass Is Not Correctness: A Negative Reasoning-Efficiency Post-Training Result and Verifier Audit on Qwen3.8-27B
- Runtime Pass Is Not Correctness: A Negative Reasoning-Efficiency Post-Training Result and Verifier Audit on Qwen3.8-27B
- Model-based robustness analysis as constraint-checking
- Empirical Comparison of Multi-Output Boolean Function Minimization Algorithms using Ternary-Indexed Prime Implicants