Formal Aspects of Computing

1.2(top 50%)

impact factor

949(top 20%)

papers

14.1K(top 20%)

citations

50(top 10%)

h-index

1.3(top 50%)

extended IF

1.1K

all documents

15.2K

doc citations

84(top 10%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	A logic for reasoning about time and reliability	Formal Aspects of Computing	1994	1,055
2	A New Approach to Abstract Syntax with Variable Binding	Formal Aspects of Computing	2002	350
3	Soundness of workflow nets: classification, decidability, and analysis	Formal Aspects of Computing	2011	271
4	Real time process algebra	Formal Aspects of Computing	1991	245
5	Automatic Verification of a Behavioural Subset of UML Statechart Diagrams Using the SPIN Model-checker	Formal Aspects of Computing	1999	215
6	Frama-C: A software analysis perspective	Formal Aspects of Computing	2015	208
7	Safety, liveness and fairness in temporal logic	Formal Aspects of Computing	1994	158
8	Institution Morphisms	Formal Aspects of Computing	2002	138
9	Inductive families	Formal Aspects of Computing	1994	127
10	The ASM Refinement Method	Formal Aspects of Computing	2003	120
11	Duration calculus: Logical foundations	Formal Aspects of Computing	1997	114
12	A formal approach to adaptive software: continuous assurance of non-functional requirements	Formal Aspects of Computing	2012	112
13	Temporal theories as modularisation units for concurrent system specification	Formal Aspects of Computing	1992	105
14	A Refinement Strategy for Circus	Formal Aspects of Computing	2003	105
15	A UTP semantics for Circus	Formal Aspects of Computing	2009	102
16	The rely-guarantee method for verifying shared variable concurrent programs	Formal Aspects of Computing	1997	97
17	Preserving correctness during business process model configuration	Formal Aspects of Computing	2010	94
18	Testing equivalence as a bisimulation equivalence	Formal Aspects of Computing	1993	93
19	Compositional minimisation of finite state systems using interface specifications	Formal Aspects of Computing	1996	93
20	Issues in the design of a parallel object-oriented language	Formal Aspects of Computing	1989	91
21	Specification and verification challenges for sequential object-oriented programs	Formal Aspects of Computing	2007	86
22	Superposition refinement of reactive systems	Formal Aspects of Computing	1996	82
23	Essential concepts of algebraic specification and program development	Formal Aspects of Computing	1997	78
24	Paramorphisms	Formal Aspects of Computing	1992	76
25	Deciding bisimilarity is P -complete	Formal Aspects of Computing	1992	74
26	Active learning for extended finite state machines	Formal Aspects of Computing	2016	74
27	Eliminating the substitution axiom from UNITY logic	Formal Aspects of Computing	1991	73
28	Reasoning about Prolog programs: From modes through types to assertions	Formal Aspects of Computing	1994	73
29	An algebraic verification of a mobile network	Formal Aspects of Computing	1992	69
30	Refinement-oriented probability for CSP	Formal Aspects of Computing	1996	69
31	Transformation of programs for fault-tolerance	Formal Aspects of Computing	1992	68
32	On the lattice of specifications: Applications to a specification methodology	Formal Aspects of Computing	1992	68
33	Formal Aspects of Correctness and Optimality of Interval Computations	Formal Aspects of Computing	2006	68
34	Interpreting Message Flow Graphs	Formal Aspects of Computing	1995	67
35	MetateM: An introduction	Formal Aspects of Computing	1995	67
36	Generalised folds for nested datatypes	Formal Aspects of Computing	1999	67
37	A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol	Formal Aspects of Computing	2003	66
38	Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol	Formal Aspects of Computing	2003	66
39	CSP theorems for communicating B machines	Formal Aspects of Computing	2005	64
40	An approach to formal verification of human–computer interaction	Formal Aspects of Computing	2007	64
41	Processes with probabilities, priority and time	Formal Aspects of Computing	1994	63
42	Conformance Tests for Real-Time Systems with Timed Automata Specifications	Formal Aspects of Computing	2000	60
43	A fully abstract semantics of classes for Object-Z	Formal Aspects of Computing	1995	59
44	A single complete rule for data refinement	Formal Aspects of Computing	1993	58
45	Winskel is (almost) Right: Towards a Mechanized Semantics Textbook	Formal Aspects of Computing	1998	57
46	csp2B: A Practical Approach to Combining CSP and B	Formal Aspects of Computing	2000	56
47	Context induction: A proof principle for behavioural abstractions and algebraic implementations	Formal Aspects of Computing	1991	55
48	Parametric probabilistic transition systems for system design and analysis	Formal Aspects of Computing	2007	55
49	Refinement concepts formalised in higher order logic	Formal Aspects of Computing	1990	53
50	A theory of processes with localities	Formal Aspects of Computing	1994	53

Scientometrics

Overviews

Citing Bodies

Formal Aspects of Computing

Top Articles