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-06-01 to 2025-06-01.)
ArticleCitations
TOrPEDO: witnessing model correctness with topological proofs31
The Universality of Functions in the Sciences at Large and in Computing24
Introduction to the Special Collection from FM 202322
Validation of CHC Satisfiability with ATHENA20
Modelling and Analysing Routing Protocols Diagrammatically with Bigraphs18
Editorial13
Review of Logical Analysis of Hybrid Systems12
Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (Extended Version)11
SecCT: Secure and Scalable Count Query Models on Encrypted Genomic Data11
Embeddings Between State and Action Based Probabilistic Logics10
Rod Burstall: In Memoriam10
Verifying correctness of persistent concurrent data structures: a sound and complete method9
The Development and Deployment of Formal Methods in the UK9
Tight Error Analysis in Fixed-point Arithmetic8
Hybrid dynamic logic institutions for event/data-based systems8
Compositional Analysis of Probabilistic Timed Graph Transformation Systems8
Introduction to the Special Section on FM 20217
A Calculus for the Specification, Design, and Verification of Distributed Concurrent Systems7
Trace Semantics for C++11 Memory Model7
Memory Consistency and Program Transformations6
Verification of Crashsafe Caching in a Virtual File System Switch6
Mechanised Safety Verification for a Distributed Autonomous Railway Control System6
Introduction to the Special Collection from PRDC 20236
Celebrating Rance. Walter Rance Cleaveland II: July 18, 1961 - March 27, 2024. An Obituary6
iStar Goal Model to Z Formal Model Translation and Model Checking of CBTC Moving Block Interlocking System6
RiskStructures : A design algebra for risk-aware machines5
Efficient data validation for geographical interlocking systems5
A Debugging Game for Probabilistic Models5
Refinement-based Specification and Analysis of Multi-core ARINC 653 Using Event-B5
SMT based parameter identifiable combination detection for non-linear continuous and hybrid dynamics5
The Concept of Class Invariant in Object-oriented Programming5
FVF-AKA: A Formal Verification Framework of AKA Protocols for Multi-server IoT5
State Machines for Large Scale Computer Software and Systems5
Review of Understanding Programming Languages5
Automated Generation of Modular Assurance Cases with the System Assurance Reference Model4
Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter4
Language Family Engineering with Product Lines of Multi-level Models4
PoTR: Accurate and Efficient Proof of Timely-Retrievability for Storage Systems4
From generic partition refinement to weighted tree automata minimization3
Waitfree linearization of an arbitrary data object3
Editorial3
Multi-objective ω-Regular Reinforcement Learning3
Formal Verification of Transcendental Fixed- and Floating-point Algorithms using an Automatic Theorem Prover3
A Deep Reinforcement Learning Framework with Formal Verification3
Exploring Scalability of BFT Blockchain Protocols through Network Simulations3
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies2
JMLKelinci+: Detecting Semantic Bugs and Covering Branches with Valid Inputs Using Coverage-guided Fuzzing and Runtime Assertion Checking2
Machine learning steered symbolic execution framework for complex software code2
Review on Theories of Programming: The Life and Works of Tony Hoare2
A Refinement-based Formal Development of Cyber-physical Railway Signalling Systems2
Specification and Verification of Multi-Clock Systems Using a Temporal Logic with Clock Constraints2
Termination and Expressiveness of Execution Strategies for Networks of Bidirectional Model Transformations1
Counterexample-guided inductive synthesis for probabilistic systems1
On Lexicographic Proof Rules for Probabilistic Termination1
Benchmarking Combinations of Learning and Testing Algorithms for Automata Learning1
Theoretical and Practical Approach to the Soundness and Completeness of Operational Semantics based on Denotational Semantics for MDESL1
A refinement-based development of a distributed signalling system1
Review on : Domain Science and Engineering - A Foundation for Software Development1
GR(1)*: GR(1) specifications extended withexistential guarantees1
An axiomatic approach to existence and liveness for differential equations1
Statistical model checking for variability-intensive systems: applications to bug detection and minimization1
Measurement-Noise Filtering for Automatic Discovery of Flow Splitting Ratios in ISP Networks1
Canonical Automata for Persistent Linearizability - A Corrigendum1
Editorial1
Introduction to the Special Collection from FASE 20211
Fast Automated Abstract Machine Repair Using Simultaneous Modifications and Refactoring1
Obituary for Niklaus Wirth1
Polymorphic dynamic programming by algebraic shortcut fusion0
L∗-based learning of Markov decision processes (extended version)0
Formal Methods in Industry0
Quantitative verification of Kalman filters0
Integration of Formal Proof into Unified Assurance Cases with Isabelle/SACM0
Enhancing Robustness Verification for Deep Neural Networks via Symbolic Propagation0
Compositional Verification of Railway Interlocking Systems0
Formal Specification and Verification of JDK’s Identity Hash Map Implementation0
SDLV: Verification of Steering Angle Safety for Self-Driving Cars0
An SMT-Based Approach to the Verification of Knowledge-Based Programs0
Denotational semantics of channel mobility in UTP-CSP0
Introduction to the Special Collection from the International Conference on Tests and Proofs (TAP) 2020 and 20210
Review onModelling and Verification of Secure Exams0
Modeling and Verification of Natural Language Requirements based on States and Modes0
Review on Verified Functional Programming in Agda0
BPPChecker: An SMT-based Model Checker on Basic Parallel Processes0
Editorial0
Compositional modeling of railway Virtual Coupling with Stochastic Activity Networks0
Analysing an autonomous tramway positioning system with the Uppaal Statistical Model Checker0
Parameterized Hardware Verification Through A Term-level Generalized Symbolic Trajectory Evaluation And Its Linkage With Concrete Hardware Verification At Netlist Level0
Formalization of Android Activity-Fragment Multitasking Mechanism and Static Analysis of Mobile Apps0
A Compositional Simulation Framework for Abstract State Machine Models of Discrete Event Systems0
Feature-Oriented Modelling and Analysis of a Self-Adaptive Robotic System0
Introduction to the Special Collection from FACS 20220
Introduction to the Special Section on iFM 20200
Review of Formal Methods: An Appetizer0
Editorial0
Toward Verifying Cooperatively Scheduled Runtimes Using CSP0
Learning safe neural network controllers with barrier certificates0
Drawing with SAT: four methods and A tool for producing railway infrastructure schematics0
Footprint Logic for Object-Oriented Components (extended paper)0
Internal and External Performance Fuzzing of Well-Defined Constraints for the B Method0
Inferring Switched Nonlinear DynamicalSystems0
Isabelle/Solidity: A deep embedding of Solidity in Isabelle/HOL0
Exploiting augmented intelligence in the modeling of safety-critical autonomous systems0
In Memoriam: Ernest Allen Emerson II0
OMAHA: Opportunistic Message Aggregation for pHase-based Algorithms0
Symbolic execution formally explained0
Kaki: Efficient Concurrent Update Synthesis for SDN0
Introduction to the Special Section on Reliability, Safety, and Security of Railway Systems0
Semantics of the probabilistic Lambda CalculusBy Dirk Draheim0
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS0
Principles of Abstract Interpretation0
Probabilistic Bigraphs0
From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers0
Foundations of programming languages0
RNA: R1CS Normalization Algorithm Based on Data Flow Graphs for Zero-Knowledge Proofs0
Compositional Reasoning for Non-multicopy Atomic Architectures0
A Case in Point: Verification and Testing of a EULYNX Interface0
A tale of two graph models: a case study in wireless sensor networks0
Explanatory Denotational Semantics for Complex Event Patterns0
Introduction to the Special Collection from iFM 20220
Algebra-Based Reasoning for Loop Synthesis0
Practical Modelling with Bigraphs0
FuSeBMC v4: Improving Code Coverage with Smart Seeds via BMC, Fuzzing and Static Analysis0
Enhancing Probabilistic Model Checking with Ontologies0
RoboWorld: Verification of Robotic Systems with Environment in the Loop0
Bit-Vector Typestate Analysis0
Comprehensive Systems: A formal foundation for Multi-Model Consistency Management0
Sound Runtime Assertion Checking for Memory Properties via Program Transformation0
Using Multi-dimensional Quorums for Optimal Resilience in Multi-resource Blockchains0
Empirical Architecture Comparison of Two-input Machine Learning Systems for Vision Tasks0
Reasoning About Exceptional Behavior At the Level of Java Bytecode with ByteBack0
On Formal Methods Thinking in Computer Science Education0
A Survey of Practical Formal Methods for Security0
Review on Functional Algorithms, Verified!0
ω-Regular Energy Problems0
Special Collection on Computer Science Education0
Does Every Computer Scientist Need to Know Formal Methods?0
Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming0
0.038470983505249