Journal of Logical and Algebraic Methods in Programming

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
Static checking of GDPR-related privacy compliance for object-oriented distributed systems	7
Strategies, model checking and branching-time properties in Maude	6
Constructing optimized constraint-preserving application conditions for model transformation rules	6
Certifying Findel derivatives for blockchain	5
Event structure semantics of (controlled) reversible CCS	5
Interval-valued fuzzy reasoning method based on similarity measure	5
Applications and extensions of context-sensitive rewriting	4
A lightweight approach to smart contracts supporting safety, security, and privacy	4
Hybrid search plan generation for generalized graph pattern matching	4
Synthesis of sorting algorithms using multisets in Theorema	4
A collaborative access control framework for online social networks	4
Replicated data types that unify eventual consistency and observable atomic consistency	4
Resource provisioning strategies for BPMN processes: Specification and analysis using Maude	4
The origins of the halting problem	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 message-passing interpretation of adjoint logic	4
Simpler proofs with decentralized invariants	4
Specifying with syntactic theory functors	4
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks	4
A navigational logic for reasoning about graph properties	4
Comparing type systems for deadlock freedom	3

Twenty years of coordination technologies: COORDINATION contribution to the state of art	3
Simulating and model checking membrane systems using strategies in Maude	3
Reversible computation in nets with bonds	3
Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances	3
Program slicing of Java programs	3
Metalevel transformation of strategies	3
Monadic second-order incorrectness logic for GP 2	3
Knowledge representation and update in hierarchies of graphs	3
A tableau construction for finite linear-time temporal logic	3
Process calculi as a tool for studying coordination, contracts and session types	3
Well-structuredness, safeness and soundness: A formal classification of BPMN collaborations	3
An abstract framework for choreographic testing	3
On checking equivalence of simulation scripts	2
A denotational semantics of Simulink with higher-order UTP	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
From global choreographies to verifiable efficient distributed implementations	2
A formal treatment of the role of verified compilers in secure computation	2
Double-pushout-rewriting in S-Cartesian functor categories: Rewriting theory and application to partial triple graphs	2
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes	2
Composition of multilevel domain-specific modelling languages	2
Calculational relation-algebraic proofs in the teaching tool	2
Exception-sensitive program slicing	2
Location automata for synchronised shuffle expressions	2
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking	2
Actor-based model checking for Software-Defined Networks	2
Hypergraph Lambek grammars	2
Free Kleene algebras with domain	2
Non-dual modal operators as a basis for 4-valued accessibility relations in Hybrid logic	2
A fixed-points based framework for compliance of behavioural contracts	1
A formal framework for distributed cyber-physical systems	1
Relational characterisations of paths	1
A formal framework for security testing of automotive over-the-air update systems	1
Automated construction of security integrity wrappers for Industry 4.0 applications	1
Checking deadlock-freedom of parametric component-based systems	1
Processes against tests: On defining contextual equivalences	1
A generalized concurrent rule construction for double-pushout rewriting: Generalized concurrency theorem and language-preserving rule applications	1
Formalizing CCS and π-calculus in Guarded Cubical Agda	1
Compositional equivalences based on open pNets	1
Session-typed concurrent contracts	1
Safety enforcement via programmable strategies in Maude	1
Associative unification in Maude	1
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis	1
A semantic model for interacting cyber-physical systems	1
Fundamentals of compositional rewriting theory	1
A probabilistic approximate logic for neuro-symbolic learning and reasoning	1
Relation algebras of Sugihara, Belnap, Meyer, and Church	1
Runtime verification for dynamic architectures	1
Verification of dynamic bisimulation theorems in Coq	1

Belief base change as priority change: A study based on dynamic epistemic logic	1
Capturing constrained constructor patterns in matching logic	1
A model of systems with modes and mode transitions	1
Secure information flow connections	1
A memory-related vulnerability detection approach based on vulnerability model with Petri Net	1
Components and acyclicity of graphs. An exercise in combining precision with concision	1
Event structure semantics for multiparty sessions	1
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models	1
Towards refinable choreographies	1
Conflict vs causality in event structures	1
Event structures for the reversible early internal π-calculus	1
Multiparty half-duplex systems and synchronous communications	1
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems	1
Expressive power and succinctness of the positive calculus of binary relations	1
Optimization of rewrite theories by equational partial evaluation	1
Proving and disproving confluence of context-sensitive rewriting	1
The complexity of identifying characteristic formulae	1
Program equivalence in an untyped, call-by-value functional language with uncurried functions	1
A formal model for blockchain-based consent management in data sharing	1
Soft constraint automata with memory	1
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis	1
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why3	1
Probabilistic mediator: A coalgebraic perspective	1
On the group memory complexity of extended finite automata over groups	1
Specification of systems with parameterised events: An institution-independent approach	0
An axiomatic approach to differentiation of polynomial circuits	0
Resource separation in dynamic logic of propositional assignments	0
Semantics of temporal constrained objects	0
Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels	0
Operationally-based program equivalence proofs using LCTRSs	0
Preface to the special issue on the 11th International Conference on Graph Transformation	0
Unification of drags and confluence of drag rewriting	0
Editorial Board	0
Monitorable hyperproperties of nonterminating systems	0
From symbolic constraint automata to Promela	0
Formalizing Moessner's theorem and generalizations in Nuprl	0
Local confluence of conditional and generalized term rewriting systems	0
A type language for distributed reactive components governed by communication protocols	0
On algebraic array theories	0
Semantics of multiway dataflow constraint systems	0
Editorial Board	0
Tribute to Anna Labella	0
The Maude strategy language	0
Reasoning about distributed information with infinitely many agents	0
Time distance-based computation of the DBM over-approximation of preemptive real-time systems	0
Preface to the special issue on Open Problems in Concurrency Theory	0
Editorial Board	0
Transforming orthogonal inductive definition sets into confluent term rewrite systems	0
Editorial Board	0
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic	0
Preface to the special issue on the 12th Workshop on Programming Language Approaches to Concurrency and Communication-Centric Software (PLACES) 2020	0
Computational category-theoretic rewriting	0
Many-sorted hybrid modal languages	0
Formally verified animation for RoboChart using interaction trees	0
Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets	0
Gaining trust by tracing security protocols	0
Explaining safety failures in NetKAT	0
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points	0
Formal analysis of the application programming interface of the PVS verification system	0
Protocol choice and iteration for the free cornering	0
(Co)inductive proof systems for compositional proofs in reachability logic	0
Editorial Board	0
Formalizing and analyzing security ceremonies with heterogeneous devices in ANP and PDL	0
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework	0
Editorial Board	0
Observational interpretations of hybrid dynamic logic with binders and silent transitions	0
Determinization of inverted grammar programs via context-free expressions	0
Lifted structural invariant analysis of Petri net product lines	0
Editorial Board	0
Axiomatizing recursion-free, regular monitors	0
Editorial Board	0
Editorial Board	0
bGSL: An imperative language for specification and refinement of backtracking programs	0
Editorial Board	0
Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions	0
Semantics of quantum programming languages: Classical control, quantum control	0
Editorial Board	0
Spreading nets: A uniform approach to unfoldings	0
Specifying reversibility with TLA+	0
A dynamic logic with branching modalities	0

Editorial Board	0
Control-data separation and logical condition propagation for efficient inference on probabilistic programs	0
Preface to the special issue on Formal Approaches to Parallel and Distributed Systems 2018	0
Bridging formal methods and machine learning with model checking and global optimisation	0
Formal lumping of polynomial differential equations through approximate equivalences	0
Schreier split extensions of preordered monoids	0
Evaluation diversity for graph conditions	0
Quantum encoding of dynamic directed graphs	0
Guest Editor's foreword	0
Session-based concurrency in Maude: Executable semantics and type checking	0
Graded epistemic logic with public announcement	0
Variants and satisfiability in the infinitary unification wonderland	0
Formalization of the inverse kinematics of three-fingered dexterous hand	0
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks	0
Partial arithmetical data types of rational numbers and their equational specification	0
Liquidity analysis in resource-aware programming	0
Stone dualities from opfibrations	0
On proving that an unsafe controller is not proven safe	0
Editorial Board	0
A formal semantics for agent distribution and fault tolerance in Jason	0
Operational semantics with semicommutations	0
Editorial Board	0
Editorial Board	0
Editorial Board	0
Verification of mutable linear data structures and iterator-based algorithms in Dafny	0
Branching pomsets: Design, expressiveness and applications to choreographies	0
A structural approach to graph transformation based on symmetric Petri nets	0
Decomposing monolithic processes in a process algebra with multi-actions	0
Editorial Board	0
On primitives for compensation handling as adaptable processes	0
Plotkin's call-by-value λ-calculus as a modal calculus	0
The C-calculus: A model for confidential name passing	0
Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications	0
On the expressiveness of multiplicities in data-based coordination languages	0
A tribute to José Manuel Valença	0
Editorial Board	0
Formal models for consent-based privacy	0
Editorial Board	0
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks	0
Back to the format: A survey on SOS for probabilistic processes	0
Editorial Board	0
Certifying expressive power and algorithms of reversible primitive permutations with Lean	0
Replacement freeness: A criterion for separating process calculi	0
Editorial Board	0
Editorial Board	0
Verification of the ROS NavFn planner using executable specification languages	0
Hardware Trojan detection via rewriting logic	0
The correctness of concurrencies in (reversible) concurrent calculi	0
On difunctions	0
Event-Based Time-Stamped Claim Logic	0
Relation-changing models meet paraconsistency	0
Specification and modelling of computing systems through graphs and graph transformation	0
ElixirST: A session-based type system for Elixir modules	0
Coalgebraic tools for randomness-conserving protocols	0
The power of Tarski's relation algebra on trees	0
Editorial Board	0
Trace preservation in B and Event-B refinements	0
Stit semantics for epistemic notions based on information disclosure in interactive settings	0
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting	0
Expressing discrete spatial relations under granularity	0
A process calculus for privacy-preserving protocols in location-based service systems	0
Preface to the special issue on the 12th International Conference on Graph Transformation	0
Editorial Board	0
Program equivalence in a typed probabilistic call-by-need functional language	0
Editorial Board	0
Book review	0
Business processes resource management using rewriting logic and deep-learning-based predictive monitoring	0
Editorial Board	0
Composition of synchronous communicating systems	0
Formal verification of timed synchronous dataflow graphs using Lustre	0