OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Logical and Algebraic Methods in Programming 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 2021-08-01 to 2025-08-01.)

Article	Citations
Exception-sensitive program slicing	17
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic	16
Bunch theory: Axioms, logic, applications and model	8
Editorial Board	8
Maude2Lean: Theorem proving for Maude specifications using Lean	7
Editorial Board	7
Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar	6
Decomposing monolithic processes in a process algebra with multi-actions	6
Generation of algebraic data type values using evolutionary algorithms	6
ElixirST: A session-based type system for Elixir modules	6
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis	5
Guest Editor's foreword	5
Time distance-based computation of the DBM over-approximation of preemptive real-time systems	5
Verification of the ROS NavFn planner using executable specification languages	5
The power of Tarski's relation algebra on trees	5
First order Büchi automata and their application to verification of LTL specifications	5
Efficient analysis of belief properties in process algebra	5
Fair termination of multiparty sessions	5
Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday	4
Editorial Board	4
A model of systems with modes and mode transitions	4
Plotkin's call-by-value λ-calculus as a modal calculus	4
A process calculus for privacy-preserving protocols in location-based service systems	3
Program slicing of Java programs	3
A dynamic logic with branching modalities	3

Composition of synchronous communicating systems	3
Relation-changing models meet paraconsistency	3
Program equivalence in a typed probabilistic call-by-need functional language	3
Advancing orchestration synthesis for contract automata	3
Optimization of rewrite theories by equational partial evaluation	3
Editorial Board	3
Expressive power and succinctness of the positive calculus of binary relations	3
From symbolic constraint automata to Promela	3
A type language for distributed reactive components governed by communication protocols	3
Trace preservation in B and Event-B refinements	3
Open compliance in multiparty sessions with partial typing	3
CRYSTAL framework: Cybersecurity assurance for cyber-physical systems	3
Back to the format: A survey on SOS for probabilistic processes	3
Coalgebraic tools for randomness-conserving protocols	3
An algebraic theory of nondeterministic finite automata	3
Semantics of quantum programming languages: Classical control, quantum control	3
Verification of mutable linear data structures and iterator-based algorithms in Dafny	3
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework	2
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models	2
Expressing discrete spatial relations under granularity	2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net	2
Towards refinable choreographies	2
Probabilistic mediator: A coalgebraic perspective	2
Editorial message from the new Editor-in-Chief	2
Book review	2
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis	2
Capturing constrained constructor patterns in matching logic	2
Session-based concurrency in Maude: Executable semantics and type checking	2
Editorial Board	2
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting	2