Journal of Logical and Algebraic Methods in Programming

(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. 500 papers]. The publications cover those that have been published in the past four years, i.e., from 2019-08-01 to 2023-08-01.)
From distributed coordination to field calculus and aggregate computing36
Programming and symbolic computation in Maude25
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings15
Generalized rewrite theories, coherence completion, and symbolic methods14
Realisability of pomsets10
Multilevel coupled model transformations for precise and reusable definition of model behaviour10
Composition and decomposition of multiparty sessions9
Connecting open systems of communicating finite state machines8
Matching logic explained8
Determinizing monitors for HML with recursion7
Constructing optimized constraint-preserving application conditions for model transformation rules6
A partial evaluation framework for order-sorted equational programs modulo axioms5
Strategies, model checking and branching-time properties in Maude5
Ground confluence of order-sorted conditional specifications modulo axioms5
A logical study of group-size based social network creation5
Interval-valued fuzzy reasoning method based on similarity measure5
Replicated data types that unify eventual consistency and observable atomic consistency4
Hybrid search plan generation for generalized graph pattern matching4
Computer says no: Verdict explainability for runtime monitors using a local proof system4
Ensuring liveness properties of distributed systems: Open problems4
On the modeling of optimal and automatized cloud application deployment4
Modal transition system encoding of featured transition systems4
Event structure semantics of (controlled) reversible CCS4
A verified proof checker for higher-order logic4
A message-passing interpretation of adjoint logic4
Simpler proofs with decentralized invariants4
Specifying with syntactic theory functors4
Introspection as an action in relational models4
A navigational logic for reasoning about graph properties4
The origins of the halting problem3
A linear-time–branching-time spectrum for behavioral specification theories3
Twenty years of coordination technologies: COORDINATION contribution to the state of art3
Simulating and model checking membrane systems using strategies in Maude3
Well-structuredness, safeness and soundness: A formal classification of BPMN collaborations3
Applications and extensions of context-sensitive rewriting3
Certifying Findel derivatives for blockchain3
A denotational semantics of textually aligned SPMD programs3
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks3
On the essence and initiality of conflicts in M-adhesive transformation syste3
Metalevel transformation of strategies3
Process calculi as a tool for studying coordination, contracts and session types3
Model checking for hybrid branching-time logics3
A dynamic logic for learning theory3
A core Erlang semantics for declarative debugging3
Synthesis of sorting algorithms using multisets in Theorema3
Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances3
Latent semantic analysis of game models using LSTM3
Static checking of GDPR-related privacy compliance for object-oriented distributed systems3
A lightweight approach to smart contracts supporting safety, security, and privacy3
Reversible computation in nets with bonds3
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes2
Monadic second-order incorrectness logic for GP 22
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude2
Knowledge representation and update in hierarchies of graphs2
Dynamic structural operational semantics2
Calculational relation-algebraic proofs in the teaching tool2
A collaborative access control framework for online social networks2
Formalization of functional variation in HOL Light2
Double-pushout-rewriting in S-Cartesian functor categories: Rewriting theory and application to partial triple graphs2
Actor-based model checking for Software-Defined Networks2
A modular framework for verifying versatile distributed systems2
A tableau construction for finite linear-time temporal logic2
A uniform approach to completions of posets2
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking2
An abstract framework for choreographic testing2
Logics for Actor Networks: A two-stage constrained-hybridisation approach2
Graph transformation through graph surfing in reaction systems2
Probabilistic software product lines2
Free Kleene algebras with domain2
Optimization of rewrite theories by equational partial evaluation1
Soft constraint automata with memory1
Checking deadlock-freedom of parametric component-based systems1
Combining free choice and time in Petri nets1
Associative unification in Maude1
Expressive power and succinctness of the positive calculus of binary relations1
A denotational semantics of Simulink with higher-order UTP1
A probabilistic approximate logic for neuro-symbolic learning and reasoning1
Relational and algebraic methods in computer science1
Conflict vs causality in event structures1
Secure information flow connections1
A semantic model for interacting cyber-physical systems1
Processes against tests: On defining contextual equivalences1
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic1
A formal model for blockchain-based consent management in data sharing1
Verification of dynamic bisimulation theorems in Coq1
CoReS: A tool for computing core graphs via SAT/SMT solvers1
From global choreographies to verifiable efficient distributed implementations1
Introducing complexity to formal testing1
The complexity of identifying characteristic formulae1
Input urgent semantics for asynchronous timed session types1
Hypergraph Lambek grammars1
Multiparty half-duplex systems and synchronous communications1
Relational characterisations of paths1
On checking equivalence of simulation scripts1
Towards refinable choreographies1
A generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications1
A formal approach to the engineering of domain-specific distributed systems1
Belief base change as priority change: A study based on dynamic epistemic logic1
Consistency in Parametric Interval Probabilistic Timed Automata1
On the group memory complexity of extended finite automata over groups1
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems1
Components and acyclicity of graphs. An exercise in combining precision with concision1
A Perron–Frobenius theorem for deciding matrix growth1
Session-typed concurrent contracts1
Program slicing of Java programs1
Guest editors' foreword1
A calculus for modeling floating authorizations1
Comparing type systems for deadlock freedom1
A fixed-points based framework for compliance of behavioural contracts1
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis1
Abstracting models of strong normalization for classical calculi1
Partial predicate abstraction and counter-example guided refinement1
A coordination protocol language for power grid operation control1
Monk algebras and Ramsey theory1
Proving and disproving confluence of context-sensitive rewriting1
Leveraging access mode declarations in a model for memory consistency in heterogeneous systems1
Automated construction of security integrity wrappers for Industry 4.0 applications1
Program algebra for quantitative information flow1
Axiomatization and characterization of BSP algorithms1
Event structures for the reversible early internal π-calculus1
Safety enforcement via programmable strategies in Maude1
Editorial Board0
Composition of multilevel domain-specific modelling languages0
Editorial Board0
Graded epistemic logic with public announcement0
Book review0
Fundamentals of Compositional Rewriting Theory0
Editorial Board0
Editorial Board0
Decomposing monolithic processes in a process algebra with multi-actions0
Relation algebras of Sugihara, Belnap, Meyer, and Church0
A calculus of concurrent graph-rewriting processes0
Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL0
Axiomatization and computability of a variant of iteration-free PDL with fork0
DaLí - Dynamic Logic, new trends and applications0
Formal verification of timed synchronous dataflow graphs using Lustre0
Editorial Board0
Editorial Board0
A memory-related vulnerability detection approach based on vulnerability model with Petri Net0
Editorial Board0
Observational interpretations of hybrid dynamic logic with binders and silent transitions0
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks0
Editorial Board0
Evaluation diversity for graph conditions0
Axiomatizing recursion-free, regular monitors0
An Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis0
Variants and satisfiability in the infinitary unification wonderland0
Semantics of multiway dataflow constraint systems0
Preface to the special issue on the 12th Workshop on Programming Language Approaches to Concurrency and Communication-Centric Software (PLACES) 20200
On the expressiveness of multiplicities in data-based coordination languages0
Expressing discrete spatial relations under granularity0
Compositional equivalences based on open pNets0
Reasoning about distributed information with infinitely many agents0
Editorial Board0
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models0
Spreading nets: A uniform approach to unfoldings0
Probabilistic mediator: A coalgebraic perspective0
Monitorable hyperproperties of nonterminating systems0
Editorial Board0
Verification of the ROS NavFn planner using executable specification languages0
A process calculus for privacy-preserving protocols in location-based service systems0
Editorial Board0
Editorial Board0
Editorial Board0
A formal framework for security testing of automotive over-the-air update systems0
A formal treatment of the role of verified compilers in secure computation0
Tribute to Anna Labella0
Editorial Board0
Exception-sensitive program slicing0
Coalgebraic tools for randomness-conserving protocols0
Editorial Board0
Editorial Board0
Editorial Board0
The power of Tarski's relation algebra on trees0
Specification of systems with parameterised events: An institution-independent approach0
Editorial Board0
Selected papers from the 28th Nordic Workshop on Programming Theory (NWPT'16)0
A structural approach to graph transformation based on symmetric Petri nets0
The C-calculus: A model for confidential name passing0
Editorial Board0
Determinization of inverted grammar programs via context-free expressions0
Editorial Board0
Program equivalence in an untyped, call-by-value functional language with uncurried functions0
Editorial Board0
Special issue on the tenth Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software0
On primitives for compensation handling as adaptable processes0
Editorial Board0
Specifying reversibility with TLA+0
Relation-changing models meet paraconsistency0
Editorial Board0
Many-sorted hybrid modal languages0
A tribute to José Manuel Valença0
Preface to the special issue on Formal Approaches to Parallel and Distributed Systems 20180
Preface to the special issue on the 11th International Conference on Graph Transformation0
Explaining safety failures in NetKAT0
Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions0
Schreier split extensions of preordered monoids0
bGSL: An imperative language for specification and refinement of backtracking programs0
Editorial Board0
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why30
Formal lumping of polynomial differential equations through approximate equivalences0
Verification of mutable linear data structures and iterator-based algorithms in Dafny0
Semantics of quantum programming languages: Classical control, quantum control0
A model of systems with modes and mode transitions0
Preface to the special issue on Open Problems in Concurrency Theory0
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points0
Partial arithmetical data types of rational numbers and their equational specification0
Editorial Board0
Guest Editor's foreword0
Formalizing CCS and π-calculus in Guarded Cubical Agda0
Transforming orthogonal inductive definition sets into confluent term rewrite systems0
A formal semantics for agent distribution and fault tolerance in Jason0
Preface for the special issue on Interaction and Concurrency Experience 20170
(Co)inductive proof systems for compositional proofs in reachability logic0
Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets0
Session-based concurrency in Maude: Executable semantics and type checking0
Editorial Board0
Runtime verification for dynamic architectures0
Automated verification of reactive and concurrent programs by calculation0
Lifted structural invariant analysis of Petri net product lines0
Preface to the special issue on the 12th International Conference on Graph Transformation0
Gaining trust by tracing security protocols0
Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels0
Editorial Board0
Plotkin's call-by-value λ-calculus as a modal calculus0
Logical characterisations, rule formats and compositionality for input-output conformance simulation0
Semantics of temporal constrained objects0
Editorial Board0
Location automata for synchronised shuffle expressions0
Resource separation in dynamic logic of propositional assignments0
On difunctions0
Computational category-theoretic rewriting0
Replacement freeness: A criterion for separating process calculi0
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications0
Editorial Board0
Stone dualities from opfibrations0
Unification of drags and confluence of drag rewriting0
Hardware Trojan detection via rewriting logic0
Special Issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2015 and 2016)0
Operational semantics with semicommutations0
Formalizing Moessner's theorem and generalizations in Nuprl0
Event-Based Time-Stamped Claim Logic0
Formal models for consent-based privacy0
From symbolic constraint automata to Promela0
Formalization of the inverse kinematics of three-fingered dexterous hand0
The Maude strategy language0
Capturing constrained constructor patterns in matching logic0
Formal analysis of the application programming interface of the PVS verification system0
A type language for distributed reactive components governed by communication protocols0
Event structure semantics for multiparty sessions0
A formal framework for distributed cyber-physical systems0
Stit semantics for epistemic notions based on information disclosure in interactive settings0