scientific article; zbMATH DE number 7453191

MaRDI QIDQ5020650zbMATH OpenFDO

Authors Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/2008.02932, http://eptcs.web.cse.unsw.edu.au/paper.cgi?VPTHCVS2020.5

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• Abstract recursion and intrinsic complexity
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Classes of languages and linear-bounded automata
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1339873 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• LOGSPACE and PTIME characterized by programming languages
• Nondeterministic Space is Closed under Complementation
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Relationships between nondeterministic and deterministic tape complexities
• Some Programming Languages for Logspace and Ptime
• The expressive power of higher-order types or, life without CONS
• The method of forced enumeration for nondeterministic automata
• The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
• Theory of program structures: Schemes, semantics, verification

Cited in

(1)

• Read/write factorizable programs

This page was built for publication:

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