Foundational and Practical Aspects of Resource Analysis
Editat de Ricardo Peña, Marko Van Eekelen, Olha Shkaravskaen Limba Engleză Paperback – 13 iul 2012
Preț: 286.49 lei
Preț vechi: 358.12 lei
-20% Nou
Puncte Express: 430
Preț estimativ în valută:
50.70€ • 59.12$ • 44.51£
50.70€ • 59.12$ • 44.51£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642324949
ISBN-10: 3642324940
Pagini: 156
Ilustrații: VII, 143 p. 30 illus.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:2012
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642324940
Pagini: 156
Ilustrații: VII, 143 p. 30 illus.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:2012
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Rocket Surgery Made EasySteve Krug-20%Preț: 204.75 lei255.93 lei -
-20%Preț: 208.87 lei261.08 lei -
-20%Preț: 287.20 lei359.01 lei -
-20%Preț: 194.83 lei243.53 lei -
Game Analytics: Maximizing the Value of Player DataMagy Seif El-Nasr-20%Preț: 759.71 lei949.63 lei -
Learning Responsive Web DesignClarissa Peterson-20%Preț: 187.69 lei234.61 lei -
Designed for Use 2eLukas Mathis-20%Preț: 216.69 lei270.87 lei -
(Re)Searching the Digital BauhausThomas Binder-20%Preț: 960.21 lei1200.25 lei -
-20%Preț: 329.35 lei411.69 lei -
-20%Preț: 315.48 lei394.35 lei -
-20%Preț: 640.00 lei800.01 lei -
Hybrid Artificial Intelligent SystemsJeng-Shyang Pan-20%Preț: 342.20 lei427.75 lei
Public țintă
ResearchCuprins
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.
Textul de pe ultima copertă
This book constitutes the refereed post-proceedings of the Second International Workshop on Foundational and Practical Aspects of Resource Analysis, FOPARA 2011, held in Madrid, Spain, in May 2011. The 8 revised full papers were carefully reviewed and selected from the papers presented at the workshop and papers submitted following an open call for contributions after the workshop. The papers are organized in the following topical sections: implicit complexity, analysis and verfication of cost expressions, and worst case execution time analysis.
Caracteristici
State-of-the-art research Fast-track conference proceedings Unique visibility