Image from Google Jackets

Foundational and Practical Aspects of Resource Analysis [electronic resource] : Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers / edited by Ugo Dal Lago, Ricardo Peña.

Contributor(s): Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science ; 8552Publication details: Cham : Springer International Publishing, 2014.Description: 1 online resource (IX, 161 p. 34 ill.)ISBN:
  • 9783319124667
Subject(s): Online resources:
Contents:
Certified Complexity (CerCo) -- On the Modular Integration of Abstract Semantics for WCET Analysis -- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? -- Probabilistic Analysis of Programs: A Weak Limit Approach -- Predicative Lexicographic Path Orders: An Application of Term Rewriting to the Region of Primitive Recursive Functions -- A Hoare Logic for Energy Consumption Analysis -- Reasoning About Resources in the Embedded Systems Language Hume -- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets -- Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Status Date due Barcode Item holds
Books Books National Library of India Available EBK000024837ENG
Total holds: 0

Certified Complexity (CerCo) -- On the Modular Integration of Abstract Semantics for WCET Analysis -- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? -- Probabilistic Analysis of Programs: A Weak Limit Approach -- Predicative Lexicographic Path Orders: An Application of Term Rewriting to the Region of Primitive Recursive Functions -- A Hoare Logic for Energy Consumption Analysis -- Reasoning About Resources in the Embedded Systems Language Hume -- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets -- Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists.

There are no comments on this title.

to post a comment.
                                                                           
web counter

Copyright ©2020 The National Library of India, Govt. of India ↔ Hosted by NVLI, MOC ↔ Technology and Design by National Library of India, Ministry of Culture, Govt. of India