Formal Aspects of Computing

Papers
(The median citation count of Formal Aspects of Computing is 0. 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 2021-11-01 to 2025-11-01.)
ArticleCitations
TOrPEDO: witnessing model correctness with topological proofs35
Introduction to the Special Collection from FM 202324
The Universality of Functions in the Sciences at Large and in Computing23
Modelling and Analysing Routing Protocols Diagrammatically with Bigraphs19
Validation of CHC Satisfiability with ATHENA16
Editorial14
Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (Extended Version)11
Review of Logical Analysis of Hybrid Systems10
Embeddings Between State and Action Based Probabilistic Logics10
SecCT: Secure and Scalable Count Query Models on Encrypted Genomic Data9
Rod Burstall: In Memoriam8
Review on Formal Methods for Software Engineering: Languages, Methods, Application Domains8
Compositional Analysis of Probabilistic Timed Graph Transformation Systems7
Hybrid dynamic logic institutions for event/data-based systems7
Tight Error Analysis in Fixed-point Arithmetic6
Celebrating Rance. Walter Rance Cleaveland II: July 18, 1961 - March 27, 2024. An Obituary6
A Calculus for the Specification, Design, and Verification of Distributed Concurrent Systems6
Trace Semantics for C++11 Memory Model6
The Development and Deployment of Formal Methods in the UK6
Introduction to the Special Collection from PRDC 20235
Introduction to the Special Section on FM 20215
Memory Consistency and Program Transformations5
Mechanised Safety Verification for a Distributed Autonomous Railway Control System5
Verification of Crashsafe Caching in a Virtual File System Switch4
iStar Goal Model to Z Formal Model Translation and Model Checking of CBTC Moving Block Interlocking System4
Introduction to the Special Collection from iFM 20234
Review of Understanding Programming Languages3
FVF-AKA: A Formal Verification Framework of AKA Protocols for Multi-server IoT3
The Concept of Class Invariant in Object-oriented Programming3
Towards Formal Verification of a TPM Software Stack: Achievements and Opportunities3
State Machines for Large Scale Computer Software and Systems3
A Debugging Game for Probabilistic Models3
Refinement-based Specification and Analysis of Multi-core ARINC 653 Using Event-B3
Exploring Scalability of BFT Blockchain Protocols through Network Simulations2
PoTR: Accurate and Efficient Proof of Timely-Retrievability for Storage Systems2
A Deep Reinforcement Learning Framework with Formal Verification2
Waitfree Linearization of an Arbitrary Data Object2
SMT based parameter identifiable combination detection for non-linear continuous and hybrid dynamics2
Efficient data validation for geographical interlocking systems2
Multi-objective ω-Regular Reinforcement Learning2
Automated Generation of Modular Assurance Cases with the System Assurance Reference Model2
Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays2
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies1
A Refinement-based Formal Development of Cyber-physical Railway Signalling Systems1
Statistical model checking for variability-intensive systems: applications to bug detection and minimization1
Theoretical and Practical Approach to the Soundness and Completeness of Operational Semantics based on Denotational Semantics for MDESL1
Obituary for Niklaus Wirth1
Fast Automated Abstract Machine Repair Using Simultaneous Modifications and Refactoring1
Editorial1
JMLKelinci+: Detecting Semantic Bugs and Covering Branches with Valid Inputs Using Coverage-guided Fuzzing and Runtime Assertion Checking1
Review on Theories of Programming: The Life and Works of Tony Hoare1
CUBES: A Parallel Synthesizer for SQL Using Examples1
Review on : Domain Science and Engineering - A Foundation for Software Development1
Language Family Engineering with Product Lines of Multi-level Models1
Formal Verification of Transcendental Fixed- and Floating-point Algorithms using an Automatic Theorem Prover1
Specification and Verification of Multi-Clock Systems Using a Temporal Logic with Clock Constraints1
Measurement-Noise Filtering for Automatic Discovery of Flow Splitting Ratios in ISP Networks1
A refinement-based development of a distributed signalling system1
Benchmarking Combinations of Learning and Testing Algorithms for Automata Learning1
In Memoriam: Peter H. G. Aczel (1941-2023)0
BPPChecker: An SMT-based Model Checker on Basic Parallel Processes0
Parameterized Hardware Verification Through A Term-level Generalized Symbolic Trajectory Evaluation And Its Linkage With Concrete Hardware Verification At Netlist Level0
Analysing an autonomous tramway positioning system with the Uppaal Statistical Model Checker0
Review on Functional Algorithms, Verified!0
Integration of Formal Proof into Unified Assurance Cases with Isabelle/SACM0
Introduction to the Special Section on iFM 20200
Compositional modeling of railway Virtual Coupling with Stochastic Activity Networks0
A Survey of Practical Formal Methods for Security0
A tale of two graph models: a case study in wireless sensor networks0
Formal Specification and Verification of JDK’s Identity Hash Map Implementation0
Algebra-Based Reasoning for Loop Synthesis0
Practical Modelling with Bigraphs0
Modeling and Verification of Natural Language Requirements based on States and Modes0
Review on Verified Functional Programming in Agda0
Introduction to the Special Collection from iFM 20220
Review of Formal Methods: An Appetizer0
Internal and External Performance Fuzzing of Well-Defined Constraints for the B Method0
Improving Bigraph Rewriting with GrGen.NET to Enable Efficient System Simulation0
From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers0
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS0
OMAHA: Opportunistic Message Aggregation for pHase-based Algorithms0
Formal Methods in Industry0
Formalization of Android Activity-Fragment Multitasking Mechanism and Static Analysis of Mobile Apps0
ω-Regular Energy Problems0
Introduction to the Special Section on Reliability, Safety, and Security of Railway Systems0
Does Every Computer Scientist Need to Know Formal Methods?0
On Formal Methods Thinking in Computer Science Education0
Special Collection on Computer Science Education0
Polymorphic dynamic programming by algebraic shortcut fusion0
Probabilistic Bigraphs0
Foundations of programming languages0
A Case in Point: Verification and Testing of a EULYNX Interface0
Introduction to the Special Collection from FACS 20220
Compositional Verification of Railway Interlocking Systems0
FuSeBMC v4: Improving Code Coverage with Smart Seeds via BMC, Fuzzing and Static Analysis0
Explanatory Denotational Semantics for Complex Event Patterns0
Footprint Logic for Object-Oriented Components (extended paper)0
Specification and Verification of the Alpha Swarm Algorithm using NuXMV and GROOVE0
from Predicative Programming to aPToP0
In Memoriam: Ernest Allen Emerson II0
Foundations for Change-driven Query-based Runtime Monitoring of Temporal Properties0
Canonical Automata for Persistent Linearizability - A Corrigendum0
Kaki: Efficient Concurrent Update Synthesis for SDN0
Termination and Expressiveness of Execution Strategies for Networks of Bidirectional Model Transformations0
Isabelle/Solidity: A deep embedding of Solidity in Isabelle/HOL0
Feature-Oriented Modelling and Analysis of a Self-Adaptive Robotic System0
Bit-Vector Typestate Analysis0
A Compositional Simulation Framework for Abstract State Machine Models of Discrete Event Systems0
Using Multi-dimensional Quorums for Optimal Resilience in Multi-resource Blockchains0
RNA: R1CS Normalization Algorithm Based on Data Flow Graphs for Zero-Knowledge Proofs0
Principles of Abstract Interpretation0
Compositional Reasoning for Non-multicopy Atomic Architectures0
Introduction to the Special Collection from the International Conference on Tests and Proofs (TAP) 2020 and 20210
Drawing with SAT: four methods and A tool for producing railway infrastructure schematics0
An SMT-Based Approach to the Verification of Knowledge-Based Programs0
Comprehensive Systems: A formal foundation for Multi-Model Consistency Management0
Reasoning About Exceptional Behavior At the Level of Java Bytecode with ByteBack0
Enhancing Probabilistic Model Checking with Ontologies0
Alfonso Caracciolo di Forino and Generalized Markov Algorithms0
Toward Verifying Cooperatively Scheduled Runtimes Using CSP0
Empirical Architecture Comparison of Two-input Machine Learning Systems for Vision Tasks0
Sound Runtime Assertion Checking for Memory Properties via Program Transformation0
RoboWorld: Verification of Robotic Systems with Environment in the Loop0
Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming0
Communicating Cooperatively Scheduled Processes: On the Unlikelihood of Implementing a Pure CSP Channel0
Introduction to the Special Collection from FASE 20210
Editorial0
On Lexicographic Proof Rules for Probabilistic Termination0
Review onModelling and Verification of Secure Exams0
0.059719085693359