Formal Methods in System Design

Papers
(The TQCC of Formal Methods in System Design is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-05-01 to 2024-05-01.)
ArticleCitations
Reluplex: a calculus for reasoning about deep neural networks18
Automatic verification of concurrent stochastic systems11
Boolean functional synthesis: hardness and practical algorithms7
Distributed bounded model checking6
Debug-localize-repair: a symbiotic construction for heap manipulations5
SAT modulo discrete event simulation applied to railway design capacity analysis5
Gray-box monitoring of hyperproperties with an application to privacy5
Abstraction and subsumption in modular verification of C programs4
Integrating formal specifications into applications: the ProB Java API4
Pegasus: sound continuous invariant generation4
Equivalence checking and intersection of deterministic timed finite state machines3
On solving quantified bit-vector constraints using invertibility conditions3
Temporal prophecy for proving temporal properties of infinite-state systems3
Multi-scale verification of distributed synchronisation3
Compositional verification of concurrent systems by combining bisimulations3
A relational shape abstract domain3
Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker2
Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic2
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations2
Bridging the gap between single- and multi-model predictive runtime verification2
Certified SAT solving with GPU accelerated inprocessing2
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs2
Learning inductive invariants by sampling from frequency distributions2
Static detection of uncoalesced accesses in GPU programs2
Mining definitions in Kissat with Kittens2
Faster algorithms for quantitative verification in bounded treewidth graphs2
Symbolic encoding of LL(1) parsing and its applications2
Certifying proofs for SAT-based model checking2
0.022081136703491