Execution traces and reduction sequences

04/11/2023
by   Gilles Dowek, et al.
0

In this note, we defend that the notion of algorithm as a set of execution traces is somewhat independent of the notion of abstract state machine. It can be reformulated in the more general framework of small step operational semantics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/03/2020

A small-step approach to multi-trace checking against interactions

Interaction models describe the exchange of messages between the differe...
research
12/16/2020

Trex: Learning Execution Semantics from Micro-Traces for Binary Similarity

Detecting semantically similar functions – a crucial analysis capability...
research
01/15/2020

Learning Concise Models from Long Execution Traces

Abstract models of system-level behaviour have applications in design ex...
research
07/10/2018

Understanding Differences among Executions with Variational Traces

One of the main challenges of debugging is to understand why the program...
research
01/08/2020

Learning to Encode and Classify Test Executions

The challenge of automatically determining the correctness of test execu...
research
02/23/2018

Guarded Traced Categories

Notions of guardedness serve to delineate the admissibility of cycles, e...
research
04/29/2019

Tracelets and Tracelet Analysis Of Compositional Rewriting Systems

Taking advantage of a recently discovered associativity property of rule...

Please sign up or login with your details

Forgot password? Click here to reset