Journal of Logical and Algebraic Methods in Programming

Papers
(The median citation count of Journal of Logical and Algebraic Methods in Programming is 0. 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 2022-06-01 to 2026-06-01.)
ArticleCitations
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic12
Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar11
Exception-sensitive program slicing11
ElixirST: A session-based type system for Elixir modules10
Generation of algebraic data type values using evolutionary algorithms10
Decomposing monolithic processes in a process algebra with multi-actions8
Editorial Board8
Bunch theory: Axioms, logic, applications and model7
Editorial Board7
Maude2Lean: Theorem proving for Maude specifications using Lean7
Efficient analysis of belief properties in process algebra6
On the inner structure of multirelations6
Bounded model checking of multitask PLC ST programs with preemption using rewriting modulo SMT6
Compositional separation of control flow and data flow6
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis5
Fair termination of multiparty sessions5
First order Büchi automata and their application to verification of LTL specifications5
Hoare-style logic for unstructured programs5
Plotkin's call-by-value λ-calculus as a modal calculus5
Verification of the ROS NavFn planner using executable specification languages5
Editorial Board5
Time distance-based computation of the DBM over-approximation of preemptive real-time systems5
Composition of synchronous communicating systems4
From symbolic constraint automata to Promela4
A model of systems with modes and mode transitions4
A dynamic logic with branching modalities4
Unified opinion formation analysis in rewriting logic4
An algebraic theory of nondeterministic finite automata4
Back to the format: A survey on SOS for probabilistic processes4
A type language for distributed reactive components governed by communication protocols4
Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday4
Relation-changing models meet paraconsistency4
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
Trace preservation in B and Event-B refinements3
Rule and constraint based debugging of DBpedia queries3
Capturing constrained constructor patterns in matching logic3
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework3
Open compliance in multiparty sessions with partial typing3
Verification of mutable linear data structures and iterator-based algorithms in Dafny3
Semantics of quantum programming languages: Classical control, quantum control3
Program slicing of Java programs3
CRYSTAL framework: Cybersecurity assurance for cyber-physical systems3
Session-based concurrency in Maude: Executable semantics and type checking2
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models2
A distribution semantics for probabilistic term rewriting2
Safe orchestrated multicomposition of systems of communicating finite state machines2
Inferring RPO symbol orderings2
Comodule representations of second-order functionals2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net2
Editorial message from the new Editor-in-Chief2
Probabilistic mediator: A coalgebraic perspective2
A generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications2
Counterpart-based Quantified Temporal Logics2
Formal models for consent-based privacy2
Formal analysis of the application programming interface of the PVS verification system2
Monadic second-order incorrectness logic for GP 22
Editorial Board2
Verification of time-bounded multiset rewriting properties2
Preface to selected papers from 21st Workshop on Programming and Languages (PROLE 2022)2
Editorial Board2
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications2
A formal framework for distributed cyber-physical systems2
Location automata for synchronised shuffle expressions2
Monitorable hyperproperties of nonterminating systems2
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting2
Towards refinable choreographies2
Algebraic reasoning for timeliness-guided system design1
Formalization of the inverse kinematics of three-fingered dexterous hand1
Axiomatizing recursion-free, regular monitors1
Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification1
Hypergraph Lambek grammars1
A formal framework for security testing of automotive over-the-air update systems1
Formalizing CCS and π-calculus in Guarded Cubical Agda1
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks1
An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency1
A lightweight approach to smart contracts supporting safety, security, and privacy1
Program equivalence in an untyped, call-by-value functional language with uncurried functions1
Unification and anti-unification in applicative matching logic1
Journal of Logical and Algebraic Methods in Programming – Publisher's Note 20251
Realizability modulo theories1
Editorial Board1
bGSL: An imperative language for specification and refinement of backtracking programs1
Preface of the PLACES 2023 special issue1
Coherent modal transition systems refinement1
DM-Check: Verifying invariants of concurrent systems by deductive model checking1
A framework for formal verification of robot kinematics1
Quantum encoding of dynamic directed graphs1
Editorial Board1
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems1
On difunctions1
Editorial Board1
Secure information flow connections1
Editorial Board1
On proving that an unsafe controller is not proven safe1
Nothing new under the sum: A formal model of fast Fourier algorithms1
Editorial Board1
Editorial Board1
A formal model for blockchain-based consent management in data sharing1
Lifted structural invariant analysis of Petri net product lines0
A tribute to José Manuel Valença0
Operationally-based program equivalence proofs using LCTRSs0
The correctness of concurrencies in (reversible) concurrent calculi0
Finitely defined preference and preference indiscernibility in ATL with strategy contexts0
Bridging formal methods and machine learning with model checking and global optimisation0
Preface to selected papers from 20th Workshop on Programming and Languages (PROLE 2021)0
Runtime monitoring of 5G network slicing using STAn0
Preface to Rewriting Logic and Its Applications (revised selected papers from WRLA 2020)0
Preface to selected papers from 22nd Workshop on Programming and Languages (PROLE 2023)0
An axiomatic approach to differentiation of polynomial circuits0
Editorial Board0
Controlling stormwater detention ponds under partial observability0
Verification of data-aware process models: Checking soundness of data Petri nets0
A computational framework based on the dynamic pipeline approach0
Specification and modelling of computing systems through graphs and graph transformation0
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes0
Safety enforcement via programmable strategies in Maude0
Towards an efficient implementation of a tableau method for reactive safety specifications0
Preface to the special issue on Open Problems in Concurrency Theory0
Regular planar monoidal languages0
NWPT 2022 - Special issue0
Efficient iterative programs with distributed data collections0
The Maude strategy language0
Editorial Board0
Partial arithmetical data types of rational numbers and their equational specification0
Towards a type-based abstract semantics for Python0
A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems0
A logical approach to graph databases0
Multiparty half-duplex systems and synchronous communications0
Stone dualities from opfibrations0
Fundamentals of compositional rewriting theory0
Executable contracts for Elixir0
Formal definitions and proofs for partial (co)recursive functions0
Editorial Board0
Compositional equivalences based on open pNets0
Succinct ordering and aggregation constraints in algebraic array theories0
Gaining trust by tracing security protocols0
Specification of systems with parameterised events: An institution-independent approach0
Computational category-theoretic rewriting0
Formal lumping of polynomial differential equations through approximate equivalences0
Hardware Trojan detection via rewriting logic0
On the expressiveness and efficiency of guarded lists in Bach0
Business processes resource management using rewriting logic and deep-learning-based predictive monitoring0
Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms0
Editorial Board0
Formal reasoning about Bernstein-Vazirani algorithm0
Combining sequential test cases into an equivalent set of adaptive test cases0
Towards the exact complexity of realizability for Safety LTL0
Branching pomsets: Design, expressiveness and applications to choreographies0
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why30
A denotational semantics of Simulink with higher-order UTP0
Computational modelling for combinatorial game strategies0
Nominal anti-unification modulo equational theories0
Certifying expressive power and algorithms of reversible primitive permutations with Lean0
Preface to the special issue on the 12th Workshop on Programming Language Approaches to Concurrency and Communication-Centric Software (PLACES) 20200
Optimizing term rewriting with creeper trace transducers0
Editorial Board0
Variants and satisfiability in the infinitary unification wonderland0
Formally verified animation for RoboChart using interaction trees0
Formal analysis of real-time systems with user-defined strategies in rewriting logic0
On algebraic array theories0
Editorial Board0
The generalised distribution semantics and projective families of distributions0
Editorial Board0
Liquidity analysis in resource-aware programming0
Editorial Board0
Unification of drags and confluence of drag rewriting0
Makina: A QuickCheck state machine library0
A formal semantics for agent distribution and fault tolerance in Jason0
Determinism of multirelations0
A semantic model for interacting cyber-physical systems0
Comparing session type systems derived from linear logic0
Composition of multilevel domain-specific modelling languages0
Tuning similarity-based fuzzy logic programs0
Formalization and analysis of the post-quantum signature scheme FALCON with Maude0
Partially typed multiparty sessions with internal delegation0
Evaluation diversity for graph conditions0
Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions0
When causality meets fairness: A survey0
Local confluence of conditional and generalized term rewriting systems0
Editorial Board0
Transforming concurrent programs with semaphores into logically constrained term rewrite systems0
Kind inference for the FreeST programming language0
Should computations halt?0
A logical account of subtyping for session types0
Editorial Board0
Transforming orthogonal inductive definition sets into confluent term rewrite systems0
Editorial Board0
A rewriting logic semantics for the analysis of 0
Protocol choice and iteration for the free cornering0
Editorial Board0
The expression dependence graph0
Control-data separation and logical condition propagation for efficient inference on probabilistic programs0
Using fixed memory blocks in GPUs to accelerate SpMV multiplication in probabilistic model checkers0
Corrigendum to “Runtime monitoring of 5G network slicing using STAn” [Journal of Logical and Algebraic Methods in Programming, 145 (2025) 101059]0
Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets0
Event structure semantics for multiparty sessions0
Editorial Board0
Reversible debugging of concurrent Erlang programs: Supporting imperative primitives0
Processes against tests: On defining contextual equivalences0
0.074965953826904