Journal of Logical and Algebraic Methods in Programming

Papers
(The median citation count of Journal of Logical and Algebraic Methods in Programming is 1. 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-09-01 to 2025-09-01.)
ArticleCitations
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic17
Exception-sensitive program slicing16
Editorial Board8
Bunch theory: Axioms, logic, applications and model8
Editorial Board8
Maude2Lean: Theorem proving for Maude specifications using Lean7
Generation of algebraic data type values using evolutionary algorithms6
ElixirST: A session-based type system for Elixir modules6
Efficient analysis of belief properties in process algebra6
Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar6
Verification of the ROS NavFn planner using executable specification languages6
Decomposing monolithic processes in a process algebra with multi-actions6
First order Büchi automata and their application to verification of LTL specifications5
The power of Tarski's relation algebra on trees5
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis5
Fair termination of multiparty sessions5
Guest Editor's foreword5
Time distance-based computation of the DBM over-approximation of preemptive real-time systems5
A model of systems with modes and mode transitions4
Plotkin's call-by-value λ-calculus as a modal calculus4
An algebraic theory of nondeterministic finite automata4
Editorial Board4
Composition of synchronous communicating systems4
Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday4
Relation-changing models meet paraconsistency3
From symbolic constraint automata to Promela3
Editorial Board3
Open compliance in multiparty sessions with partial typing3
Optimization of rewrite theories by equational partial evaluation3
Capturing constrained constructor patterns in matching logic3
Back to the format: A survey on SOS for probabilistic processes3
Coalgebraic tools for randomness-conserving protocols3
Expressive power and succinctness of the positive calculus of binary relations3
Advancing orchestration synthesis for contract automata3
Program equivalence in a typed probabilistic call-by-need functional language3
CRYSTAL framework: Cybersecurity assurance for cyber-physical systems3
Semantics of quantum programming languages: Classical control, quantum control3
A dynamic logic with branching modalities3
A type language for distributed reactive components governed by communication protocols3
Trace preservation in B and Event-B refinements3
A process calculus for privacy-preserving protocols in location-based service systems3
Program slicing of Java programs3
Verification of mutable linear data structures and iterator-based algorithms in Dafny3
Formal analysis of the application programming interface of the PVS verification system2
Editorial Board2
Location automata for synchronised shuffle expressions2
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework2
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models2
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net2
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications2
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting2
Probabilistic mediator: A coalgebraic perspective2
Towards refinable choreographies2
Editorial Board2
A generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications2
Monitorable hyperproperties of nonterminating systems2
Book review2
Session-based concurrency in Maude: Executable semantics and type checking2
Editorial message from the new Editor-in-Chief2
Associative unification in Maude1
Realizability modulo theories1
On algebraic array theories1
Quantum encoding of dynamic directed graphs1
Event structure semantics for multiparty sessions1
Monk algebras and Ramsey theory1
Editorial Board1
Partially typed multiparty sessions with internal delegation1
A formal framework for distributed cyber-physical systems1
Editorial Board1
An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency1
Coherent modal transition systems refinement1
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points1
A distribution semantics for probabilistic term rewriting1
Journal of Logical and Algebraic Methods in Programming – Publisher's Note 20251
On difunctions1
Editorial Board1
Axiomatizing recursion-free, regular monitors1
bGSL: An imperative language for specification and refinement of backtracking programs1
Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification1
Towards a type-based abstract semantics for Python1
Formal models for consent-based privacy1
A Perron–Frobenius theorem for deciding matrix growth1
A rewriting logic semantics for the analysis of P programs1
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems1
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks1
A lightweight approach to smart contracts supporting safety, security, and privacy1
Editorial Board1
On proving that an unsafe controller is not proven safe1
Comodule representations of second-order functionals1
A tableau construction for finite linear-time temporal logic1
Editorial Board1
Hypergraph Lambek grammars1
Control-data separation and logical condition propagation for efficient inference on probabilistic programs1
Program equivalence in an untyped, call-by-value functional language with uncurried functions1
Efficient iterative programs with distributed data collections1
A formal model for blockchain-based consent management in data sharing1
Stone dualities from opfibrations1
Editorial Board1
Metalevel transformation of strategies1
A formal framework for security testing of automotive over-the-air update systems1
Monadic second-order incorrectness logic for GP 21
Formalizing CCS and π-calculus in Guarded Cubical Agda1
A framework for formal verification of robot kinematics1
Static checking of GDPR-related privacy compliance for object-oriented distributed systems1
Secure information flow connections1
Formalization of the inverse kinematics of three-fingered dexterous hand1
0.094136953353882