TEST - Catálogo BURRF
   

Foundational and practical aspects of resource analysis : third international workshop, fopara 2013, bertinoro, italy, august 29-31, 2013, revised selected papers / edited by Ugo Dal Lago, Ricardo Peña.

Colaborador(es): Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 8552Editor: Cham : Springer International Publishing : Springer, 2014Descripción: ix, 161 páginas : 34 ilustracionesTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783319124667
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA76.9.E94
Recursos en línea:
Contenidos:
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.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha