Formal Methods in System Design

Papers
(The median citation count of Formal Methods in System Design is 1. 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 2022-08-01 to 2026-08-01.)
ArticleCitations
Preface of the special issue on the conference on Computer-Aided Verification 2020 and 202117
Abstraction Modulo Stability10
Editorial: Special issue on formal methods in computer-aided design8
Reachability of Koopman linearized systems using explicit kernel approximation and polynomial zonotope refinement8
Linear temporal constraints for sketch-based synthesizers8
Linearization, model reduction and reachability in nonlinear odes7
Bounded verification for finite-field-blasting in a compiler for zero knowledge proofs6
Symbolic encoding of LL(1) parsing and its applications6
The probabilistic termination tool amber5
Preface for the Formal Methods in System Design special issue on ‘FASE 2022’5
Divider verification using symbolic computer algebra and delayed don’t care optimization: theory and practical implementation5
Synbit: synthesizing bidirectional programs using unidirectional sketches4
Towards neural-network-guided program synthesis and verification4
Formally verified roundoff error bounds on LogSumExp-based computations4
Partial bounding for recursive function synthesis4
Memory-efficient fixpoint computation3
Enhancing active model learning with equivalence checking using simulation relations3
Round- and context-bounded control of dynamic pushdown systems3
Mining of extended signal temporal logic specifications with ParetoLib 2.02
Automatic WSTS-based repair and deadlock detection of parameterized systems2
Bounded-memory runtime enforcement with probabilistic and performance analysis2
Termination of triangular polynomial loops2
Formalization of robot collision detection method based on conformal geometric algebra2
Stratified guarded first-order transition systems2
Symbolic computer algebra for multipliers revisited - demonstrating the significance of order and phase optimization1
(Un)Solvable loop analysis1
Runtime verification of partially-synchronous distributed system1
Construction of verifier combinations from off-the-shelf components1
Information-flow interfaces1
Certified SAT solving with GPU accelerated inprocessing1
Dynamic dependability analysis of shuffle-exchange networks1
Preserving provability over GPU program optimizations with annotation-aware transformations1
Efficient monitoring of timed properties1
Formal methods for mobile ad hoc networks: a survey1
Compositional verification of priority systems using sharp bisimulation1
Automatic assume-guarantee reasoning for safety and liveness using passive learning1
SAT solving for variants of first-order subsumption1
Preface of the special issue on the static analysis symposium 2020 and 20221
Dissecting ltlsynt1
A program instrumentation framework for automatic verification1
Hashing-based approximate counting of minimal unsatisfiable subsets1
Porous invariants for linear systems1
Preface for the formal methods in system design special issue on ‘Formal Methods 2021’1
Concise outlines for a complex logic: a proof outline checker for TaDA1
0.066689968109131