scholarly journals Automatic verification of extensions of hardware descriptions

2005 ◽  
pp. 2-12 ◽  
Author(s):  
Hans Eveking
Keyword(s):  
Automatic Verification

scholarly journals Verification of Outstanding Claim Provisions—Separation Technique

1977 ◽  
Vol 9 (1-2) ◽  
pp. 26-32 ◽  
Author(s):  
R. E. Beard
Keyword(s):  
Distribution Function ◽  
Automatic Verification ◽  
Separation Technique ◽  
Implicit Assumption ◽  
Subjective Judgment ◽  
Constant Rate ◽  
The Future ◽  
Average Distribution ◽  
Chain Ladder ◽  
A Chain

In reference [1] Dr. G. C. Taylor has described a useful advance in the techniques available for verification of outstanding claims estimates when the data provided is the cohort development of numbers and amounts of claims. In this note it is assumed that the numbers relate to settled claims and that the amounts relate to claim payments, so there is an implicit assumption that the pattern of partial payments is constant. If the amounts of settled claims were to be used, there would be a one/one relationship between the numbers and amounts, but the effect of the exogeneous factor would be blurred because the settlements in a year other than the first include partial payments made some time previously, and, by hypothesis, based on different factors. If information relating to partial payments is available the data can be examined for any major fluctuation in the pattern and allowance made accordingly.In paragraph (2) of reference [1] a brief description is given of a standard routine calculation in which the average distribution function of claim payments in time is estimated from the triangle of payments by a chain ladder technique. This distribution function is then used to estimate the expected development of the incomplete cohorts, the implicit assumption being made that the function was stable in time. With a constant rate of inflation the results obtained by this technique were found to be satisfactory but with a rapid increase in the rate of inflation the distribution function changed so that projection led to underestimates of the future claims payments. Various methods of adjusting the projections to allow for the change in the rate of inflation have been investigated, but they all involve an important element of subjective judgment and so far no generally suitable basis for “automatic” verification by this particular technique has been discovered. See however reference [2].

Automatic Verification of GCD Constraint for Construction of Girth-Eight QC-LDPC Codes

2019 ◽  
Vol 23 (9) ◽  
pp. 1453-1456
Author(s):  
Guohua Zhang ◽  
Yi Fang ◽  
Yuanhua Liu
Keyword(s):  
Ldpc Codes ◽  
Automatic Verification

Interface Identification of Automatic Verification System Based on Deep Learning

2021 ◽  
Author(s):  
Andi Zheng ◽  
Yaqiong Fu ◽  
Mingze Dong ◽  
Xinyi Du ◽  
Yueming Chen ◽  
...  
Keyword(s):  
Deep Learning ◽  
Automatic Verification ◽  
Verification System

Mapping OWL-S Process Model to Timed Automata

2018 ◽  
Vol 11 (1) ◽  
pp. 29-48
Author(s):  
Amel Boumaza ◽  
Ramdane Maamri
Keyword(s):  
Web Services ◽  
Process Model ◽  
Timed Automata ◽  
Automatic Verification ◽  
Covering Problems ◽  
Field Verification ◽  
Starting Point ◽  
Quantitative Properties ◽  
Time Systems

The conversion of web services to semantic web comes the opportunity to automate various tasks. OWL-S plays a key role in describing web services behaviour. While ontology-based semantics given to OWL-S is structural rather than behaviourally oriented, we cannot automate an essential task in this field, verification. In this article, the mapping of OWL-S process model to Timed automata is investigated, which is a suitable formalism for real time systems modeling and automatic verification. Hence, this has led to not only enabling automatic verification but also covering problems related to automated verification of temporal quantitative properties as bounded liveness property. As a starting point, the OWL-S and sub entry of time ontologies for describing the timed behaviour of services has been chosen. A defined set of mapping rules is used to automatically encode control constructs defined in OWL-S and temporal information into timed automata. Also, it is shown how a Uppaal checker is used to check required properties formulated in TCTL. Finally, an EClinic case study is used to illustrate the technique.

Sign in / Sign up

Export Citation Format

Share Document