By series

A conference on automated verification with an Asian base, covering model checking, synthesis, automata-theoretic methods and the analysis of hybrid and probabilistic systems. Each edition has its own site rather than a permanent one.

Conference on Automated Deduction (CADE), since 1974: theorem provers, proof search, unification, decision procedures. Alternates with IJCAR and runs the CASC prover competition.

Computer Aided Verification (CAV), since 1989: theory and practice of automated proof about hardware and software - model checking, SAT/SMT, abstract interpretation, synthesis and their tools.

The annual conference of the European Association for Computer Science Logic, on logic as it is used in computer science — proof theory, model theory, finite model theory and their applications to verification and databases.

One of the ETAPS conferences. ESOP is about programming languages and systems from the design side: type systems, semantics, program logics and the analyses that follow from them, where TACAS beside it takes the tools.

The symposium of Formal Methods Europe, held every year or two since 1987 and the broadest gathering in the field: specification, refinement, proof, and reports of what happened when these were used on real systems.

A conference on formal methods for open, object-based distributed systems, run from 1996. It merged with FORTE in 2007, so citations to it stop there and continue under the joint name.

The theory conference within ETAPS: semantics, automata, type theory, categorical models and the mathematics underlying programming and verification.

Foundations of Software Technology and Theoretical Computer Science (FSTTCS): India's main theory conference, every December since 1981, published in LIPIcs (open access) since 2008.

A conference on combining formal methods rather than choosing between them — pairing state-based specification with process algebra, proof with model checking, and so on. Each edition has its own site.

Leveraging Applications of Formal Methods (ISoLA): a symposium on putting formal methods to work, with themed tracks mixing academics and industrial adopters.

A small biennial conference on deriving programs from specifications: calculational methods, algebra of programming, and the mathematics of getting from a problem statement to code that provably solves it.

NASA's formal methods symposium, on techniques with a path into safety-critical practice — aerospace software, autonomy, and the verification of systems whose failure is not recoverable.

The Passive and Active Measurement conference: empirical work on how the internet actually behaves — routing, latency, censorship, traffic — measured rather than modelled. Each edition has its own site; proceedings appear in Springer's LNCS.

A conference on where software engineering and formal methods meet: applying rigorous techniques at the scale and under the constraints of actual software development.

Tools and Algorithms for the Construction and Analysis of Systems (TACAS), part of ETAPS: verification tools and their algorithms, with an emphasis on runnable artefacts. Hosts SV-COMP.

A European conference series on the theory and practice of software development, running from 1985 to 1997. It was folded into ETAPS, so its later editions are cited as ETAPS conferences and TAPSOFT itself is closed.

A conference on theorem proving in higher-order logics, run from 1988 until 2009. It became ITP, the Interactive Theorem Proving conference, which is where its community publishes now.

A conference on verified software, founded around the grand-challenge idea of a verifying compiler: proof-carrying tools, verified components, and experiments in building software that comes with its guarantees.

The annual conference of the European Association for Computer Science Logic, on logic as it is used in computer science — proof theory, model theory, finite model theory and their applications to verification and databases.