Journal of Logical and Algebraic Methods in Programming

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-05-01 to 2025-05-01.)
ArticleCitations
Exception-sensitive program slicing17
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic15
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic9
Bunch theory: Axioms, logic, applications and model8
Editorial Board7
Maude2Lean: Theorem proving for Maude specifications using Lean6
Editorial Board6
ElixirST: A session-based type system for Elixir modules6
Decomposing monolithic processes in a process algebra with multi-actions5
Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar5
Generation of algebraic data type values using evolutionary algorithms5
Efficient analysis of belief properties in process algebra5
Operational semantics with semicommutations5
Verification of the ROS NavFn planner using executable specification languages5
Composition of synchronous communicating systems4
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis4
The power of Tarski's relation algebra on trees4
Plotkin's call-by-value λ-calculus as a modal calculus4
A type language for distributed reactive components governed by communication protocols4
Guest Editor's foreword4
Fair termination of multiparty sessions4
From symbolic constraint automata to Promela4
Time distance-based computation of the DBM over-approximation of preemptive real-time systems4
The origins of the halting problem4
First order Büchi automata and their application to verification of LTL specifications4
Editorial Board3
An algebraic theory of nondeterministic finite automata3
Back to the format: A survey on SOS for probabilistic processes3
Program slicing of Java programs3
Optimization of rewrite theories by equational partial evaluation3
A model of systems with modes and mode transitions3
Coalgebraic tools for randomness-conserving protocols3
Trace preservation in B and Event-B refinements3
Program equivalence in a typed probabilistic call-by-need functional language3
A process calculus for privacy-preserving protocols in location-based service systems3
A dynamic logic with branching modalities3
Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday3
Expressive power and succinctness of the positive calculus of binary relations3
Semantics of quantum programming languages: Classical control, quantum control3
Editorial Board3
Relation-changing models meet paraconsistency3
Expressing discrete spatial relations under granularity2
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net2
Verification of mutable linear data structures and iterator-based algorithms in Dafny2
Capturing constrained constructor patterns in matching logic2
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models2
Editorial message from the new Editor-in-Chief2
Book review2
Explaining safety failures in NetKAT2
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework2
Advancing orchestration synthesis for contract automata2
Probabilistic mediator: A coalgebraic perspective2
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting2
Towards refinable choreographies2
Editorial Board2
CRYSTAL framework: Cybersecurity assurance for cyber-physical systems2
Open compliance in multiparty sessions with partial typing2
Session-based concurrency in Maude: Executable semantics and type checking2
0.062797069549561