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-02-01 to 2025-02-01.)
ArticleCitations
Optimizing term rewriting with creeper trace transducers21
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic12
Editorial Board12
A Perron–Frobenius theorem for deciding matrix growth12
Editorial Board10
Event structures for the reversible early internal π-calculus7
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic6
Formally verified animation for RoboChart using interaction trees5
Program equivalence in a typed probabilistic call-by-need functional language5
A formal framework for distributed cyber-physical systems5
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems5
On proving that an unsafe controller is not proven safe5
Formalizing CCS and π-calculus in Guarded Cubical Agda5
A formal framework for security testing of automotive over-the-air update systems5
Capturing constrained constructor patterns in matching logic5
Trace preservation in B and Event-B refinements5
Verification of mutable linear data structures and iterator-based algorithms in Dafny5
CRYSTAL framework: Cybersecurity assurance for cyber-physical systems5
Verification of dynamic bisimulation theorems in Coq5
Metalevel transformation of strategies4
A process calculus for privacy-preserving protocols in location-based service systems4
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points4
Optimization of rewrite theories by equational partial evaluation4
Simulating and model checking membrane systems using strategies in Maude4
Editorial Board4
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks4
The generalised distribution semantics and projective families of distributions3
Static checking of GDPR-related privacy compliance for object-oriented distributed systems3
Program slicing of Java programs3
Advancing orchestration synthesis for contract automata3
Bunch theory: Axioms, logic, applications and model3
Editorial Board3
Coherent modal transition systems refinement3
Well-structuredness, safeness and soundness: A formal classification of BPMN collaborations3
Strategies, model checking and branching-time properties in Maude3
Open Compliance in Multiparty Sessions with Partial Typing3
Editorial Board3
Exception-sensitive program slicing3
Checking deadlock-freedom of parametric component-based systems3
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks2
Business processes resource management using rewriting logic and deep-learning-based predictive monitoring2
Reasoning about distributed information with infinitely many agents2
Specification of systems with parameterised events: An institution-independent approach2
The C-calculus: A model for confidential name passing2
Editorial Board2
Editorial Board2
Probabilistic mediator: A coalgebraic perspective2
Editorial Board2
Event-Based Time-Stamped Claim Logic2
Editorial Board2
Schreier split extensions of preordered monoids2
Monk algebras and Ramsey theory2
Editorial Board2
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework2
Protocol choice and iteration for the free cornering2
Decomposing monolithic processes in a process algebra with multi-actions2
ElixirST: A session-based type system for Elixir modules2
A tableau construction for finite linear-time temporal logic2
Hardware Trojan detection via rewriting logic2
Controlling stormwater detention ponds under partial observability1
Formalization of the inverse kinematics of three-fingered dexterous hand1
Lifted structural invariant analysis of Petri net product lines1
Maude2Lean: Theorem proving for Maude specifications using Lean1
Fundamentals of compositional rewriting theory1
Preface to selected papers from 20th Workshop on Programming and Languages (PROLE 2021)1
Editorial Board1
Determinism of multirelations1
Guest Editor's foreword1
Explaining safety failures in NetKAT1
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis1
Towards refinable choreographies1
Editorial Board1
Event structure semantics for multiparty sessions1
On algebraic array theories1
A logical approach to graph databases1
Editorial Board1
Generation of algebraic data type values using evolutionary algorithms1
Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar1
Semantics of multiway dataflow constraint systems1
Editorial Board1
Stone dualities from opfibrations1
Many-sorted hybrid modal languages1
Event structure semantics of (controlled) reversible CCS1
Operational semantics with semicommutations1
Hypergraph Lambek grammars1
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why31
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings1
Specification and modelling of computing systems through graphs and graph transformation1
Realizability modulo theories1
Verification of the ROS NavFn planner using executable specification languages1
When causality meets fairness: A survey1
Session-based concurrency in Maude: Executable semantics and type checking1
Partially typed multiparty sessions with internal delegation1
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models1
A semantic model for interacting cyber-physical systems1
Composition of multilevel domain-specific modelling languages1
Preface to the special issue on Open Problems in Concurrency Theory1
Computer says no: Verdict explainability for runtime monitors using a local proof system1
Expressing discrete spatial relations under granularity1
On difunctions1
Conflict vs causality in event structures1
Formal lumping of polynomial differential equations through approximate equivalences1
The Maude strategy language1
Certifying expressive power and algorithms of reversible primitive permutations with Lean1
Evaluation diversity for graph conditions0
Branching pomsets: Design, expressiveness and applications to choreographies0
A denotational semantics of Simulink with higher-order UTP0
Computational category-theoretic rewriting0
Semantics of quantum programming languages: Classical control, quantum control0
Editorial Board0
Tuning similarity-based fuzzy logic programs0
Relation-changing models meet paraconsistency0
A generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications0
Formal definitions and proofs for partial (co)recursive functions0
Monadic second-order incorrectness logic for GP 20
Editorial Board0
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes0
Towards the exact complexity of realizability for Safety LTL0
Succinct ordering and aggregation constraints in algebraic array theories0
Unification of drags and confluence of drag rewriting0
A dynamic logic with branching modalities0
Variants and satisfiability in the infinitary unification wonderland0
A formal treatment of the role of verified compilers in secure computation0
Associative unification in Maude0
Back to the format: A survey on SOS for probabilistic processes0
Verification of data-aware process models: Checking soundness of data Petri nets0
First order Büchi automata and their application to verification of LTL specifications0
Stit semantics for epistemic notions based on information disclosure in interactive settings0
Book review0
A memory-related vulnerability detection approach based on vulnerability model with Petri Net0
On the expressiveness and efficiency of guarded lists in Bach0
Efficient analysis of belief properties in process algebra0
A fixed-points based framework for compliance of behavioural contracts0
Editorial Board0
Formalization and analysis of the post-quantum signature scheme FALCON with Maude0
A lightweight approach to smart contracts supporting safety, security, and privacy0
Quantum encoding of dynamic directed graphs0
Applications and extensions of context-sensitive rewriting0
Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL0
Semantics of temporal constrained objects0
Compositional equivalences based on open pNets0
On primitives for compensation handling as adaptable processes0
Time distance-based computation of the DBM over-approximation of preemptive real-time systems0
Regular planar monoidal languages0
A formal semantics for agent distribution and fault tolerance in Jason0
Multiparty half-duplex systems and synchronous communications0
An abstract framework for choreographic testing0
From symbolic constraint automata to Promela0
Preface to the special issue on the 12th Workshop on Programming Language Approaches to Concurrency and Communication-Centric Software (PLACES) 20200
Tribute to Anna Labella0
Logic and Calculi for All on the occasion of Luís Barbosa’s 60th birthday0
The correctness of concurrencies in (reversible) concurrent calculi0
Formal analysis of the application programming interface of the PVS verification system0
Processes against tests: On defining contextual equivalences0
Editorial Board0
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking0
Automated construction of security integrity wrappers for Industry 4.0 applications0
A logical account of subtyping for session types0
An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency0
Belief base change as priority change: A study based on dynamic epistemic logic0
An axiomatic approach to differentiation of polynomial circuits0
Bridging formal methods and machine learning with model checking and global optimisation0
bGSL: An imperative language for specification and refinement of backtracking programs0
Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions0
Editorial Board0
Fair termination of multiparty sessions0
Formal models for consent-based privacy0
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis0
Coalgebraic tools for randomness-conserving protocols0
Operationally-based program equivalence proofs using LCTRSs0
Towards a type-based abstract semantics for Python0
Local confluence of conditional and generalized term rewriting systems0
The power of Tarski's relation algebra on trees0
Safety enforcement via programmable strategies in Maude0
Editorial Board0
Session-typed concurrent contracts0
A message-passing interpretation of adjoint logic0
A tribute to José Manuel Valença0
Comparing session type systems derived from linear logic0
Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets0
A formal model for blockchain-based consent management in data sharing0
A type language for distributed reactive components governed by communication protocols0
A computational framework based on the dynamic pipeline approach0
Formal verification of timed synchronous dataflow graphs using Lustre0
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications0
Observational interpretations of hybrid dynamic logic with binders and silent transitions0
Secure information flow connections0
Location automata for synchronised shuffle expressions0
Reversible computation in nets with bonds0
Certifying Findel derivatives for blockchain0
Liquidity analysis in resource-aware programming0
Transforming orthogonal inductive definition sets into confluent term rewrite systems0
Axiomatizing recursion-free, regular monitors0
Editorial Board0
Determinization of inverted grammar programs via context-free expressions0
Partial arithmetical data types of rational numbers and their equational specification0
Editorial Board0
Towards an efficient implementation of a tableau method for reactive safety specifications0
A framework for formal verification of robot kinematics0
Proving and disproving confluence of context-sensitive rewriting0
Matching logic explained0
Graded epistemic logic with public announcement0
A model of systems with modes and mode transitions0
Reversible debugging of concurrent Erlang programs: Supporting imperative primitives0
Comparing type systems for deadlock freedom0
Composition and decomposition of multiparty sessions0
Synthesis of sorting algorithms using multisets in Theorema0
Editorial Board0
Components and acyclicity of graphs. An exercise in combining precision with concision0
Expressive power and succinctness of the positive calculus of binary relations0
Control-data separation and logical condition propagation for efficient inference on probabilistic programs0
A probabilistic approximate logic for neuro-symbolic learning and reasoning0
Formalizing Moessner's theorem and generalizations in Nuprl0
The expression dependence graph0
Transforming concurrent programs with semaphores into logically constrained term rewrite systems0
On checking equivalence of simulation scripts0
Plotkin's call-by-value λ-calculus as a modal calculus0
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting0
Composition of synchronous communicating systems0
Program equivalence in an untyped, call-by-value functional language with uncurried functions0
Editorial Board0
Gaining trust by tracing security protocols0
Executable contracts for Elixir0
A structural approach to graph transformation based on symmetric Petri nets0
Automated verification of reactive and concurrent programs by calculation0
Resource separation in dynamic logic of propositional assignments0
Monitorable hyperproperties of nonterminating systems0
The origins of the halting problem0
Editorial Board0
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude0
Simpler proofs with decentralized invariants0
0.055394172668457