scientific article; zbMATH DE number 7453191

MaRDI QIDQ5020650

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

Publication date: 6 January 2022

Full work available at URL: https://arxiv.org/abs/2008.02932

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (1)

Read/write factorizable programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The method of forced enumeration for nondeterministic automata
• Theory of program structures: Schemes, semantics, verification
• LOGSPACE and PTIME characterized by programming languages
• Relationships between nondeterministic and deterministic tape complexities
• The expressive power of higher-order types or, life without CONS
• The Power of Non-determinism in Higher-Order Implicit Complexity
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Some Programming Languages for Logspace and Ptime
• Nondeterministic Space is Closed under Complementation
• Abstract Recursion and Intrinsic Complexity
• Classes of languages and linear-bounded automata
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: