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-11-01 to 2025-11-01.)
ArticleCitations
Exception-sensitive program slicing20
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic17
Bunch theory: Axioms, logic, applications and model10
Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar9
Maude2Lean: Theorem proving for Maude specifications using Lean8
Editorial Board8
Generation of algebraic data type values using evolutionary algorithms8
Editorial Board8
ElixirST: A session-based type system for Elixir modules6
Decomposing monolithic processes in a process algebra with multi-actions6
Efficient analysis of belief properties in process algebra6
First order Büchi automata and their application to verification of LTL specifications6
Verification of the ROS NavFn planner using executable specification languages6
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis6
An algebraic theory of nondeterministic finite automata5
Plotkin's call-by-value λ-calculus as a modal calculus5
Fair termination of multiparty sessions5
A model of systems with modes and mode transitions5
The power of Tarski's relation algebra on trees5
Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday5
Editorial Board5
Guest Editor's foreword5
Time distance-based computation of the DBM over-approximation of preemptive real-time systems5
Composition of synchronous communicating systems4
Coalgebraic tools for randomness-conserving protocols4
Semantics of quantum programming languages: Classical control, quantum control4
From symbolic constraint automata to Promela4
Expressive power and succinctness of the positive calculus of binary relations4
Back to the format: A survey on SOS for probabilistic processes4
A type language for distributed reactive components governed by communication protocols4
A dynamic logic with branching modalities4
Advancing orchestration synthesis for contract automata3
Program equivalence in a typed probabilistic call-by-need functional language3
Open compliance in multiparty sessions with partial typing3
Editorial Board3
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models3
Trace preservation in B and Event-B refinements3
Relation-changing models meet paraconsistency3
A process calculus for privacy-preserving protocols in location-based service systems3
Probabilistic mediator: A coalgebraic perspective3
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework3
Towards refinable choreographies3
Verification of mutable linear data structures and iterator-based algorithms in Dafny3
Capturing constrained constructor patterns in matching logic3
Optimization of rewrite theories by equational partial evaluation3
Program slicing of Java programs3
Session-based concurrency in Maude: Executable semantics and type checking3
CRYSTAL framework: Cybersecurity assurance for cyber-physical systems3
Monadic second-order incorrectness logic for GP 22
A memory-related vulnerability detection approach based on vulnerability model with Petri Net2
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis2
Editorial Board2
Monitorable hyperproperties of nonterminating systems2
Metalevel transformation of strategies2
Comodule representations of second-order functionals2
A generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications2
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting2
Preface to selected papers from 21st Workshop on Programming and Languages (PROLE 2022)2
Formal analysis of the application programming interface of the PVS verification system2
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications2
Location automata for synchronised shuffle expressions2
Formal models for consent-based privacy2
Book review2
Editorial message from the new Editor-in-Chief2
Editorial Board2
A distribution semantics for probabilistic term rewriting2
A Perron–Frobenius theorem for deciding matrix growth2
A formal framework for distributed cyber-physical systems2
0.079843997955322