OOIR: Observatory of International Research

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-04-01 to 2024-04-01.)

Article	Citations
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings	17
Matching logic explained	11
Composition and decomposition of multiparty sessions	11
Strategies, model checking and branching-time properties in Maude	7
Static checking of GDPR-related privacy compliance for object-oriented distributed systems	7
Constructing optimized constraint-preserving application conditions for model transformation rules	6
Interval-valued fuzzy reasoning method based on similarity measure	6
Event structure semantics of (controlled) reversible CCS	5
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude	5
Program slicing of Java programs	5
Certifying Findel derivatives for blockchain	5
Replicated data types that unify eventual consistency and observable atomic consistency	5
A lightweight approach to smart contracts supporting safety, security, and privacy	4
Simpler proofs with decentralized invariants	4
The origins of the halting problem	4
Twenty years of coordination technologies: COORDINATION contribution to the state of art	4
A collaborative access control framework for online social networks	4
Applications and extensions of context-sensitive rewriting	4
Hybrid search plan generation for generalized graph pattern matching	4
Synthesis of sorting algorithms using multisets in Theorema	4
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks	4
A navigational logic for reasoning about graph properties	4
A message-passing interpretation of adjoint logic	4
Specifying with syntactic theory functors	4
Computer says no: Verdict explainability for runtime monitors using a local proof system	4

A verified proof checker for higher-order logic	4
A denotational semantics of Simulink with higher-order UTP	3
Knowledge representation and update in hierarchies of graphs	3
A tableau construction for finite linear-time temporal logic	3
Exception-sensitive program slicing	3
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking	3
An abstract framework for choreographic testing	3
Comparing type systems for deadlock freedom	3
Process calculi as a tool for studying coordination, contracts and session types	3
Simulating and model checking membrane systems using strategies in Maude	3
Monadic second-order incorrectness logic for GP 2	3
Reversible computation in nets with bonds	3
Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances	3
Well-structuredness, safeness and soundness: A formal classification of BPMN collaborations	3
Metalevel transformation of strategies	3
Free Kleene algebras with domain	2
Location automata for synchronised shuffle expressions	2
Double-pushout-rewriting in S-Cartesian functor categories: Rewriting theory and application to partial triple graphs	2
Automated verification of reactive and concurrent programs by calculation	2
Monk algebras and Ramsey theory	2
A Perron–Frobenius theorem for deciding matrix growth	2
Runtime verification for dynamic architectures	2
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes	2
Actor-based model checking for Software-Defined Networks	2
Hypergraph Lambek grammars	2
Calculational relation-algebraic proofs in the teaching tool	2
From global choreographies to verifiable efficient distributed implementations	2
On checking equivalence of simulation scripts	2
A formal treatment of the role of verified compilers in secure computation	2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net	2
Composition of multilevel domain-specific modelling languages	2
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic	2