Amanote Research

Amanote Research

    RegisterSign In

Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints

Journal of Automated Reasoning - Netherlands
doi 10.1007/s10817-016-9402-4
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational TheorySoftwareArtificial IntelligenceMathematics
Date

January 11, 2017

Authors
Moritz SinnFlorian ZulegerHelmut Veith
Publisher

Springer Science and Business Media LLC


Related search

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

Relational Cost Analysis for Functional-Imperative Programs

Proceedings of the ACM on Programming Languages
2019English

Declarative View of Imperative Programs

1998English

The Implicit Computational Complexity of Imperative Programming Languages

BRICS Report Series
2001English

Calculating Quantitative Integrity and Secrecy for Imperative Programs

International Journal of Secure Software Engineering
2015English

On the Complexity of Postoptimality Analysis of 01 Programs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1999English

Robustness Analysis of Stochastic Programs With Joint Probabilistic Constraints

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2013English

Bounded Expectations: Resource Analysis for Probabilistic Programs

2018English

Schedulability Analysis of Periodic and Aperiodic Tasks With Resource Constraints

Journal of Systems Architecture
HardwareArchitectureSoftware
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy