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 2020-11-01 to 2024-11-01.)
ArticleCitations
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings21
Strategies, model checking and branching-time properties in Maude12
Composition and decomposition of multiparty sessions12
Matching logic explained11
Static checking of GDPR-related privacy compliance for object-oriented distributed systems10
Certifying Findel derivatives for blockchain7
Program slicing of Java programs6
A formal framework for security testing of automotive over-the-air update systems5
Simulating and model checking membrane systems using strategies in Maude5
A message-passing interpretation of adjoint logic5
Session-typed concurrent contracts5
Event structure semantics of (controlled) reversible CCS5
Well-structuredness, safeness and soundness: A formal classification of BPMN collaborations5
Simpler proofs with decentralized invariants5
Synthesis of sorting algorithms using multisets in Theorema5
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks5
Exception-sensitive program slicing5
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude5
Computer says no: Verdict explainability for runtime monitors using a local proof system5
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking4
The origins of the halting problem4
Operationally-based program equivalence proofs using LCTRSs4
Applications and extensions of context-sensitive rewriting4
The Maude strategy language4
A lightweight approach to smart contracts supporting safety, security, and privacy4
Reversible computation in nets with bonds4
A navigational logic for reasoning about graph properties4
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes3
Automated verification of reactive and concurrent programs by calculation3
Fair termination of multiparty sessions3
Event structure semantics for multiparty sessions3
Metalevel transformation of strategies3
Actor-based model checking for Software-Defined Networks3
Comparing type systems for deadlock freedom3
Program equivalence in an untyped, call-by-value functional language with uncurried functions3
A tableau construction for finite linear-time temporal logic3
Monadic second-order incorrectness logic for GP 23
An abstract framework for choreographic testing3
Variants and satisfiability in the infinitary unification wonderland3
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting3
A Perron–Frobenius theorem for deciding matrix growth3
Free Kleene algebras with domain2
Expressive power and succinctness of the positive calculus of binary relations2
Location automata for synchronised shuffle expressions2
Reversible debugging of concurrent Erlang programs: Supporting imperative primitives2
Quantum encoding of dynamic directed graphs2
Associative unification in Maude2
Towards refinable choreographies2
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks2
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic2
A formal treatment of the role of verified compilers in secure computation2
A denotational semantics of Simulink with higher-order UTP2
Branching pomsets: Design, expressiveness and applications to choreographies2
A formal model for blockchain-based consent management in data sharing2
Composition of multilevel domain-specific modelling languages2
Monk algebras and Ramsey theory2
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems2
Runtime verification for dynamic architectures2
On checking equivalence of simulation scripts2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net2
Soft constraint automata with memory2
Hypergraph Lambek grammars2
Calculational relation-algebraic proofs in the teaching tool2
0.23533701896667