Amanote Research

Amanote Research

    RegisterSign In

Hoare Logics for Time Bounds

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-89960-2_9
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2018

Authors
Maximilian P. L. HaslbeckTobias Nipkow
Publisher

Springer International Publishing


Related search

Linear Time Bounds for Median Computations

1972English

Real-Time Logics: Complexity and Expressiveness

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1993English

First-Order Logics of Branching Time

Logical Investigations
2013English

Comparison-Based Time–Space Lower Bounds for Selection

2009English

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Time Step Estimates for Reciprocal Mass Matrices Using Ostrowski's Bounds

2019English

Hoare-Style Verification of Graph Programs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Logics for Knowledge Representation

2001English

Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy