☆ 4.2 Article

The correctness of concurrencies in (reversible) concurrent calculi

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING (2024)

Reversible computing and implicit computational complexity

Lars Kristiansen

Summary: The article explores the connection between implicit computational complexity theory and reversible computation, introducing inherently reversible programming languages and discussing higher order versions.

SCIENCE OF COMPUTER PROGRAMMING (2022)

添加到收藏夹

Article Computer Science, Theory & Methods

Processes against tests: On defining contextual equivalences

Clement Aubert et al.

Summary: This paper proposes a model for studying program equivalences within the framework of process algebras for concurrent computation. The model divides the notion of process into process terms, (completed) processes, and tests, emphasizing the importance of formalizing the completion of process terms and the instrumentation of placing a (completed) process into a test. The paper highlights the distinction between the tasks of programmers and testers, and addresses pre-existing issues in process algebras.

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING (2022)

添加到收藏夹

Article Computer Science, Theory & Methods