Formal Aspects of Computing

Papers
(The TQCC of Formal Aspects of Computing 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 2022-05-01 to 2026-05-01.)
ArticleCitations
Introduction to the Special Collection from FM 202329
The Universality of Functions in the Sciences at Large and in Computing21
Modelling and Analysing Routing Protocols Diagrammatically with Bigraphs18
Validation of CHC Satisfiability with ATHENA14
Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (Extended Version)13
Review of Logical Analysis of Hybrid Systems12
Embeddings Between State and Action Based Probabilistic Logics10
SecCT: Secure and Scalable Count Query Models on Encrypted Genomic Data9
Rod Burstall: In Memoriam8
Compositional Analysis of Probabilistic Timed Graph Transformation Systems7
Review on Formal Methods for Software Engineering: Languages, Methods, Application Domains7
Trace Semantics for C++11 Memory Model7
A Calculus for the Specification, Design, and Verification of Distributed Concurrent Systems7
Celebrating Rance. Walter Rance Cleaveland II: July 18, 1961 - March 27, 2024. An Obituary6
Introduction to the Special Section on FM 20216
Mechanised Safety Verification for a Distributed Autonomous Railway Control System5
Introduction to the Special Collection from PRDC 20234
Formal Methods - My 50+ Years as an Engineer, Researcher and Scientist4
Memory Consistency and Program Transformations4
On Inductive Characterization for Divergence-sensitive Probabilistic Branching Bisimilarity4
Refinement-based Specification and Analysis of Multi-core ARINC 653 Using Event-B3
An Introduction to Input/Output Automata3
iStar Goal Model to Z Formal Model Translation and Model Checking of CBTC Moving Block Interlocking System3
FVF-AKA: A Formal Verification Framework of AKA Protocols for Multi-server IoT3
Introduction to the Special Collection from iFM 20233
Decidability of Liveness on the TSO Memory Model3
Towards Formal Verification of a TPM Software Stack: Achievements and Opportunities3
The Concept of Class Invariant in Object-oriented Programming2
A Debugging Game for Probabilistic Models2
SMT based parameter identifiable combination detection for non-linear continuous and hybrid dynamics2
PoTR: Accurate and Efficient Proof of Timely-Retrievability for Storage Systems2
Review of Understanding Programming Languages2
Automated Generation of Modular Assurance Cases with the System Assurance Reference Model2
State Machines for Large Scale Computer Software and Systems2
0.15924787521362