Computable execution traces

DOI10.1007/978-3-030-88853-4_15MaRDI QIDQ2148796zbMATH OpenOpenAlexFDO

Authors Declan Thompson

Publication date 24 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88853-4_15

zbMATH Keywords

computabilitymodels of computationexecution trace

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Execution trace sets for real computation
• Abstract effective models
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Traces, traceability, and lattices of traces under the set theoretic inclusion
• Models of computation. An introduction to computability theory

Cites work

• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 1163990 (Why is no real title available?)
• Linear Automaton Transformations
• Process logic: Expressiveness, decidability, completeness
• Sequential abstract-state machines capture sequential algorithms
• Trace Semantics for IPDL

Cited in

(4)

• Source-Based Trace Exploration
• Execution trace sets for real computation
• scientific article; zbMATH DE number 4219133 (Why is no real title available?)
• scientific article; zbMATH DE number 765178 (Why is no real title available?)

This page was built for publication: Computable execution traces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148796)