scholarly journals Amortised Resource Analysis with Separation Logic

2010 ◽  
pp. 85-103 ◽  
Author(s):  
Robert Atkey
Keyword(s):  
Separation Logic ◽  
Resource Analysis

Resource Analysis in Emergency Department Using Simulation-based Framework

2013 ◽  
Author(s):  
Chawalit Jeenanunta ◽  
◽  
Sariya Issrangkura na ayudhya ◽  
Prangvipha Doungraksa ◽  
Chaleeporn Sereewattanapong ◽  
...  
Keyword(s):  
Emergency Department ◽  
Resource Analysis ◽  
Simulation Based

Resource analysis method for multi-service network based on queuing network

2009 ◽  
Vol 29 (9) ◽  
pp. 2424-2427
Author(s):  
Ying ZHANG ◽  
Li-ru ZHAO ◽  
Xin-liang GU
Keyword(s):  
Analysis Method ◽  
Queuing Network ◽  
Resource Analysis ◽  
Service Network

scholarly journals Linear capabilities for fully abstract compilation of separation-logic-verified code

2021 ◽  
Vol 31 ◽  
Author(s):  
THOMAS VAN STRYDONCK ◽  
FRANK PIESSENS ◽  
DOMINIQUE DEVRIESE
Keyword(s):  
Spatial Separation ◽  
Separation Logic ◽  
Target Language ◽  
Fine Grained ◽  
Dynamic Contract ◽  
Modular Verification ◽  
Source Program ◽  
Memory Accesses ◽  
Memory Resources ◽  
Efficient Memory

Abstract Separation logic is a powerful program logic for the static modular verification of imperative programs. However, dynamic checking of separation logic contracts on the boundaries between verified and untrusted modules is hard because it requires one to enforce (among other things) that outcalls from a verified to an untrusted module do not access memory resources currently owned by the verified module. This paper proposes an approach to dynamic contract checking by relying on support for capabilities, a well-studied form of unforgeable memory pointers that enables fine-grained, efficient memory access control. More specifically, we rely on a form of capabilities called linear capabilities for which the hardware enforces that they cannot be copied. We formalize our approach as a fully abstract compiler from a statically verified source language to an unverified target language with support for linear capabilities. The key insight behind our compiler is that memory resources described by spatial separation logic predicates can be represented at run time by linear capabilities. The compiler is separation-logic-proof-directed: it uses the separation logic proof of the source program to determine how memory accesses in the source program should be compiled to linear capability accesses in the target program. The full abstraction property of the compiler essentially guarantees that compiled verified modules can interact with untrusted target language modules as if they were compiled from verified code as well. This article is an extended version of one that was presented at ICFP 2019 (Van Strydonck et al., 2019).

scholarly journals Cosmo: a concurrent separation logic for multicore OCaml

2020 ◽  
Vol 4 (ICFP) ◽  
pp. 1-29
Author(s):  
Glen Mével ◽  
Jacques-Henri Jourdan ◽  
François Pottier
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic

scholarly journals Static Profiling and Optimization of Ethereum Smart Contracts using Resource Analysis

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jesus Correas ◽  
Pablo Gordillo ◽  
Guillermo Roman-Diez
Keyword(s):  
Smart Contracts ◽  
Resource Analysis

Hub height optimisation of commercial WTGs based on accurate wind resource analysis

2021 ◽  
pp. 0309524X2110227
Author(s):  
Kyle O Roberts ◽  
Nawaz Mahomed
Keyword(s):  
Power Generation ◽  
Wind Turbine ◽  
Wind Power ◽  
Capacity Factor ◽  
Resource Analysis ◽  
Wind Speeds ◽  
Unique Maximum ◽  
Wind Measurements ◽  
Generation Capacity ◽  
Wind Resource

Wind turbine selection and optimal hub height positioning are crucial elements of wind power projects. However, in higher class wind speeds especially, over-exposure of wind turbines can lead to a reduction in power generation capacity. In this study, wind measurements from a met mast were validated according to specifications issued by IRENA and NREL. As a first step, it is shown that commercial WTGs from a database may be matched to the wind class and turbulence intensity. Secondly, a wind turbine selection algorithm, based on maximisation of capacity factor, was implemented across the range of WTGs. The selected WTGs were further exposed to an iterative algorithm using pointwise air density and wind shear coefficients. It is shown that a unique maximum capacity factor, and hence wind power generation, exists for a wind turbine, premised on its eventual over-exposure to the wind resource above a certain hub height.

Sign in / Sign up

Export Citation Format

Share Document