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-06-01 to 2024-06-01.)
ArticleCitations
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings17
Matching logic explained11
Composition and decomposition of multiparty sessions11
Static checking of GDPR-related privacy compliance for object-oriented distributed systems8
Strategies, model checking and branching-time properties in Maude7
Interval-valued fuzzy reasoning method based on similarity measure6
Constructing optimized constraint-preserving application conditions for model transformation rules6
Certifying Findel derivatives for blockchain6
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude5
Program slicing of Java programs5
Event structure semantics of (controlled) reversible CCS5
Replicated data types that unify eventual consistency and observable atomic consistency5
Twenty years of coordination technologies: COORDINATION contribution to the state of art5
A lightweight approach to smart contracts supporting safety, security, and privacy4
Hybrid search plan generation for generalized graph pattern matching4
Synthesis of sorting algorithms using multisets in Theorema4
A collaborative access control framework for online social networks4
Applications and extensions of context-sensitive rewriting4
Reversible computation in nets with bonds4
The origins of the halting problem4
Computer says no: Verdict explainability for runtime monitors using a local proof system4
A navigational logic for reasoning about graph properties4
A message-passing interpretation of adjoint logic4
Simpler proofs with decentralized invariants4
Specifying with syntactic theory functors4
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks4
Monadic second-order incorrectness logic for GP 23
Actor-based model checking for Software-Defined Networks3
A tableau construction for finite linear-time temporal logic3
A Perron–Frobenius theorem for deciding matrix growth3
Metalevel transformation of strategies3
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking3
Knowledge representation and update in hierarchies of graphs3
Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances3
Well-structuredness, safeness and soundness: A formal classification of BPMN collaborations3
An abstract framework for choreographic testing3
Comparing type systems for deadlock freedom3
Exception-sensitive program slicing3
Simulating and model checking membrane systems using strategies in Maude3
Operationally-based program equivalence proofs using LCTRSs2
On checking equivalence of simulation scripts2
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting2
Event structure semantics for multiparty sessions2
Monk algebras and Ramsey theory2
From global choreographies to verifiable efficient distributed implementations2
A denotational semantics of Simulink with higher-order UTP2
Location automata for synchronised shuffle expressions2
Double-pushout-rewriting in S-Cartesian functor categories: Rewriting theory and application to partial triple graphs2
Automated verification of reactive and concurrent programs by calculation2
Composition of multilevel domain-specific modelling languages2
Calculational relation-algebraic proofs in the teaching tool2
Free Kleene algebras with domain2
A formal treatment of the role of verified compilers in secure computation2
Runtime verification for dynamic architectures2
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes2
Towards refinable choreographies2
Hypergraph Lambek grammars2
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic2
0.65444397926331