Výsledky vyhľadávania - "Worst-case computational complexity estimation"

Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings

Autori: Alias, Christophe Darte, Alain Feautrier, Paul a ďalší

Prispievatelia: Alias, Christophe Darte, Alain Feautrier, Paul a ďalší

Zdroj: https://inria.hal.science/inria-00464356 ; [Research Report] RR-7235, INRIA. 2010, pp.32.

Predmety: Static analysis, Polyhedral model, Abstract interpretation, Termination proof, Multi-dimensional affine ranking functions, Worst-case computational complexity estimation, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.0: Complexity measures, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.5: Program analysis, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]

Dostupnosť: https://inria.hal.science/inria-00464356
https://inria.hal.science/inria-00464356v1/document
https://inria.hal.science/inria-00464356v1/file/RR-7235.pdf