All Research Papers Published In Journal of Logical and Algebraic Methods in Programming

Research Article
10.1016/j.jlamp.2026.101112

Should computations halt?

Jun 01, 2026
Journal of Logical and Algebraic Methods in Programming
Salvador Lucas

Research Article
10.1016/j.jlamp.2025.101097

Computational modelling for combinatorial game strategies

Mar 01, 2026
Journal of Logical and Algebraic Methods in Programming
Răzvan Diaconescu

Addendum
10.1016/j.jlamp.2025.101062

Corrigendum to “Runtime monitoring of 5G network slicing using STAn” [Journal of Logical and Algebraic Methods in Programming, 145 (2025) 101059

Jul 01, 2025
Journal of Logical and Algebraic Methods in Programming
Laura Panizo + 3 more +3

Research Article
10.1016/j.jlamp.2025.101056

Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms

May 01, 2025
Journal of Logical and Algebraic Methods in Programming
Naoki Nishida + 2 more +2

Research Article
1
10.1016/j.jlamp.2025.101045

A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems

Mar 01, 2025
Journal of Logical and Algebraic Methods in Programming
Naoki Nishida + 2 more +2

Research Article
1
10.1016/j.jlamp.2024.101022

Generation of algebraic data type values using evolutionary algorithms

Nov 13, 2024
Journal of Logical and Algebraic Methods in Programming
Ignacio Ballesteros + 4 more +4

Research Article
10.1016/j.jlamp.2024.101021

First order Büchi automata and their application to verification of LTL specifications

Oct 15, 2024
Journal of Logical and Algebraic Methods in Programming
Wenhui Zhang

Research Article
2
10.1016/j.jlamp.2024.101019

Executable contracts for Elixir

Oct 01, 2024
Journal of Logical and Algebraic Methods in Programming
Luis Eduardo Bueso De Barrio + 4 more +4

Research Article
10.1016/j.jlamp.2024.100987

Optimizing term rewriting with creeper trace transducers

May 31, 2024
Journal of Logical and Algebraic Methods in Programming
Rick Erkens

In the context of functional programming/term normalization algorithms we discuss the optimization problem of constructing the result of a sequence of rewrite steps, without computing all the intermediate terms. From a rewrite system we construct a creeper trace transducer, which reads a sequence of backwards overlapping rewrite steps while producing the desired answer. The transducer writes each symbol of the output only once, skipping overlap between each pair of subsequent rules. In some cases a part of the trace can be disregarded altogether.

Research Article
2
10.1016/j.jlamp.2023.100938

Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic

Dec 01, 2023
Journal of Logical and Algebraic Methods in Programming
Sven Schneider + 2 more +2