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 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
ElixirST: A session-based type system for Elixir modules6
Maude2Lean: Theorem proving for Maude specifications using Lean6
Editorial Board6
Operational semantics with semicommutations5
Verification of the ROS NavFn planner using executable specification languages5
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
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
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
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
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 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
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 generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications1
Belief base change as priority change: A study based on dynamic epistemic logic1
Journal of Logical and Algebraic Methods in Programming – Publisher's Note 20251
Semantics of multiway dataflow constraint systems1
A formal framework for security testing of automotive over-the-air update systems1
On proving that an unsafe controller is not proven safe1
Monk algebras and Ramsey theory1
Editorial Board1
Metalevel transformation of strategies1
A lightweight approach to smart contracts supporting safety, security, and privacy1
Editorial Board1
On difunctions1
Location automata for synchronised shuffle expressions1
A formal model for blockchain-based consent management in data sharing1
Secure information flow connections1
Simpler proofs with decentralized invariants1
Monadic second-order incorrectness logic for GP 21
A tableau construction for finite linear-time temporal logic1
Realizability modulo theories1
Editorial Board1
Formalizing CCS and π-calculus in Guarded Cubical Agda1
Coherent modal transition systems refinement1
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems1
A framework for formal verification of robot kinematics1
A formal framework for distributed cyber-physical systems1
An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency1
Formal models for consent-based privacy1
Program equivalence in an untyped, call-by-value functional language with uncurried functions1
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications1
Hypergraph Lambek grammars1
Axiomatizing recursion-free, regular monitors1
On primitives for compensation handling as adaptable processes1
Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification1
Editorial Board1
Formalization of the inverse kinematics of three-fingered dexterous hand1
Editorial Board1
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points1
Editorial Board1
A Perron–Frobenius theorem for deciding matrix growth1
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking1
Monitorable hyperproperties of nonterminating systems1
bGSL: An imperative language for specification and refinement of backtracking programs1
Formal analysis of the application programming interface of the PVS verification system1
Quantum encoding of dynamic directed graphs1
Observational interpretations of hybrid dynamic logic with binders and silent transitions1
Tribute to Anna Labella1
Reversible computation in nets with bonds0
Editorial Board0
Reversible debugging of concurrent Erlang programs: Supporting imperative primitives0
Static checking of GDPR-related privacy compliance for object-oriented distributed systems0
The expression dependence graph0
Towards an efficient implementation of a tableau method for reactive safety specifications0
Runtime monitoring of 5G network slicing using STAn0
On algebraic array theories0
A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems0
Applications and extensions of context-sensitive rewriting0
Towards the exact complexity of realizability for Safety LTL0
Unification of drags and confluence of drag rewriting0
Towards a type-based abstract semantics for Python0
Stit semantics for epistemic notions based on information disclosure in interactive settings0
Partial arithmetical data types of rational numbers and their equational specification0
Transforming orthogonal inductive definition sets into confluent term rewrite systems0
A tribute to José Manuel Valença0
Efficient iterative programs with distributed data collections0
Graded epistemic logic with public announcement0
A denotational semantics of Simulink with higher-order UTP0
The correctness of concurrencies in (reversible) concurrent calculi0
Executable contracts for Elixir0
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks0
Preface to the special issue on the 12th Workshop on Programming Language Approaches to Concurrency and Communication-Centric Software (PLACES) 20200
Event structure semantics for multiparty sessions0
Formal lumping of polynomial differential equations through approximate equivalences0
Editorial Board0
When causality meets fairness: A survey0
Formalization and analysis of the post-quantum signature scheme FALCON with Maude0
Formally verified animation for RoboChart using interaction trees0
Composition of multilevel domain-specific modelling languages0
Safety enforcement via programmable strategies in Maude0
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why30
Proving and disproving confluence of context-sensitive rewriting0
Lifted structural invariant analysis of Petri net product lines0
Editorial Board0
Editorial Board0
Evaluation diversity for graph conditions0
Determinization of inverted grammar programs via context-free expressions0
Editorial Board0
Formal verification of timed synchronous dataflow graphs using Lustre0
Processes against tests: On defining contextual equivalences0
Reasoning about distributed information with infinitely many agents0
Certifying Findel derivatives for blockchain0
Partially typed multiparty sessions with internal delegation0
Specification of systems with parameterised events: An institution-independent approach0
Tuning similarity-based fuzzy logic programs0
Comparing session type systems derived from linear logic0
Stone dualities from opfibrations0
Automated construction of security integrity wrappers for Industry 4.0 applications0
Multiparty half-duplex systems and synchronous communications0
Verification of data-aware process models: Checking soundness of data Petri nets0
Compositional equivalences based on open pNets0
Control-data separation and logical condition propagation for efficient inference on probabilistic programs0
A formal treatment of the role of verified compilers in secure computation0
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes0
Gaining trust by tracing security protocols0
Associative unification in Maude0
A probabilistic approximate logic for neuro-symbolic learning and reasoning0
Automated verification of reactive and concurrent programs by calculation0
Comparing type systems for deadlock freedom0
A formal semantics for agent distribution and fault tolerance in Jason0
Certifying expressive power and algorithms of reversible primitive permutations with Lean0
Regular planar monoidal languages0
Editorial Board0
Determinism of multirelations0
Simulating and model checking membrane systems using strategies in Maude0
Strategies, model checking and branching-time properties in Maude0
Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions0
Editorial Board0
Preface to the special issue on Open Problems in Concurrency Theory0
Preface to Rewriting logic and its Applications (revised selected papers from WRLA 2020)0
Specification and modelling of computing systems through graphs and graph transformation0
Resource separation in dynamic logic of propositional assignments0
Fundamentals of compositional rewriting theory0
Transforming concurrent programs with semaphores into logically constrained term rewrite systems0
Preface to selected papers from 22nd Workshop on Programming and Languages (PROLE 2023)0
Hardware Trojan detection via rewriting logic0
Formal definitions and proofs for partial (co)recursive functions0
Protocol choice and iteration for the free cornering0
Operationally-based program equivalence proofs using LCTRSs0
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks0
Optimizing term rewriting with creeper trace transducers0
An abstract framework for choreographic testing0
A rewriting logic semantics for the analysis of P programs0
Editorial Board0
Editorial Board0
A logical account of subtyping for session types0
Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL0
Editorial Board0
On the expressiveness and efficiency of guarded lists in Bach0
Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets0
Local confluence of conditional and generalized term rewriting systems0
Liquidity analysis in resource-aware programming0
Event structure semantics of (controlled) reversible CCS0
Succinct ordering and aggregation constraints in algebraic array theories0
An axiomatic approach to differentiation of polynomial circuits0
Session-typed concurrent contracts0
Components and acyclicity of graphs. An exercise in combining precision with concision0
Variants and satisfiability in the infinitary unification wonderland0
Editorial Board0
A semantic model for interacting cyber-physical systems0
Computational category-theoretic rewriting0
Preface to selected papers from 20th Workshop on Programming and Languages (PROLE 2021)0
Editorial Board0
Business processes resource management using rewriting logic and deep-learning-based predictive monitoring0
Controlling stormwater detention ponds under partial observability0
Event structures for the reversible early internal π-calculus0
The Maude strategy language0
Formalizing Moessner's theorem and generalizations in Nuprl0
Editorial Board0
A computational framework based on the dynamic pipeline approach0
A logical approach to graph databases0
The generalised distribution semantics and projective families of distributions0
Branching pomsets: Design, expressiveness and applications to choreographies0
Event-Based Time-Stamped Claim Logic0
Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms0
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude0
Bridging formal methods and machine learning with model checking and global optimisation0
0.13509202003479