The verification problem for safe replaceability

1994 ◽  
pp. 311-323 ◽  
Author(s):  
Vigyan Singhal ◽  
Carl Pixley
Keyword(s):  
Verification Problem

Cylindrical Geometry Verification Problem for Enclosure Radiation

2009 ◽  
Vol 23 (4) ◽  
pp. 711-715 ◽  
Author(s):  
Ben Blackwell ◽  
Kevin Dowding ◽  
Michael Modest
Keyword(s):  
Cylindrical Geometry ◽  
Verification Problem

Sensitivity Analysis for Nonlinear Heat Conduction

2000 ◽  
Vol 123 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Kevin J. Dowding ◽  
Bennie F. Blackwell
Keyword(s):  
Heat Conduction ◽  
General Procedure ◽  
Model Parameters ◽  
Nonlinear Heat Conduction ◽  
Temperature Dependent ◽  
Sensitivity Equations ◽  
Verification Problem ◽  
Temperature Variable ◽  
Numerical Solver ◽  
Temperature Dependent Properties

Parameters in the heat conduction equation are frequently modeled as temperature dependent. Thermal conductivity, volumetric heat capacity, convection coefficients, emissivity, and volumetric source terms are parameters that may depend on temperature. Many applications, such as parameter estimation, optimal experimental design, optimization, and uncertainty analysis, require sensitivity to the parameters describing temperature-dependent properties. A general procedure to compute the sensitivity of the temperature field to model parameters for nonlinear heat conduction is studied. Parameters are modeled as arbitrary functions of temperature. Sensitivity equations are implemented in an unstructured grid, element-based numerical solver. The objectives of this study are to describe the methodology to derive sensitivity equations for the temperature-dependent parameters and present demonstration calculations. In addition to a verification problem, the design of an experiment to estimate temperature variable thermal properties is discussed.

scholarly journals Revisiting the Notion of Extension over Incomplete Abstract Argumentation Frameworks

2020 ◽  
Author(s):  
Bettina Fazzinga ◽  
Sergio Flesca ◽  
Filippo Furfaro
Keyword(s):  
Fundamental Notion ◽  
Beneficial Effects ◽  
Abstract Argumentation ◽  
Verification Problem ◽  
Np Complete ◽  
Definition Of

We revisit the notion of i-extension, i.e., the adaption of the fundamental notion of extension to the case of incomplete Abstract Argumentation Frameworks. We show that the definition of i-extension raises some concerns in the "possible" variant, e.g., it allows even conflicting arguments to be collectively considered as members of an (i-)extension. Thus, we introduce the alternative notion of i*-extension overcoming the highlighted problems, and provide a thorough complexity characterization of the corresponding verification problem. Interestingly, we show that the revisitation not only has beneficial effects for the semantics, but also for the complexity: under various semantics, the verification problem under the possible perspective moves from NP-complete to P.

Bounded Verification of Multi-threaded Programs via Lazy Sequentialization

2022 ◽  
Vol 44 (1) ◽  
pp. 1-50
Author(s):  
Omar Inverso ◽  
Ermenegildo Tomasco ◽  
Bernd Fischer ◽  
Salvatore La Torre ◽  
Gennaro Parlato
Keyword(s):  
Program Analysis ◽  
High Performance ◽  
Software Verification ◽  
Bounded Model Checking ◽  
New Approach ◽  
C Programming Language ◽  
C Programming ◽  
Verification Problem ◽  
Practical Program ◽  
Verification Techniques

Bounded verification techniques such as bounded model checking (BMC) have successfully been used for many practical program analysis problems, but concurrency still poses a challenge. Here, we describe a new approach to BMC of sequentially consistent imperative programs that use POSIX threads. We first translate the multi-threaded program into a nondeterministic sequential program that preserves reachability for all round-robin schedules with a given bound on the number of rounds. We then reuse existing high-performance BMC tools as backends for the sequential verification problem. Our translation is carefully designed to introduce very small memory overheads and very few sources of nondeterminism, so it produces tight SAT/SMT formulae, and is thus very effective in practice: Our Lazy-CSeq tool implementing this translation for the C programming language won several gold and silver medals in the concurrency category of the Software Verification Competitions (SV-COMP) 2014–2021 and was able to find errors in programs where all other techniques (including testing) failed. In this article, we give a detailed description of our translation and prove its correctness, sketch its implementation using the CSeq framework, and report on a detailed evaluation and comparison of our approach.

OPTIMAL PROTOTYPE FUNCTIONS OF FEATURES FOR ONLINE SIGNATURE VERIFICATION

2004 ◽  
Vol 18 (07) ◽  
pp. 1189-1206 ◽  
Author(s):  
JULIO CESAR MARTÍNEZ ROMO ◽  
ROGELIO ALCÁNTARA SILVA
Keyword(s):  
Error Rates ◽  
Signature Verification ◽  
Static Characteristics ◽  
Continuous Space ◽  
Verification Algorithm ◽  
Verification Problem ◽  
Online Signature ◽  
Online Signature Verification ◽  
The One ◽  
Rejection Rates

It is well known that the approach of functions of time to represent the dynamic and static characteristics of signatures usually outperforms the approaches based on parameters; in addition to this result, we propose here that the model or prototype function of the discriminant features of the signatures should be created considering the signature verification problem as a bi-objective optimization problem in which the false acceptance and false rejection rates are minimized simultaneously; to accomplish these goals, a discrete space of solutions is searched by a genetic algorithm, and a continuous space of solutions is searched by a modified gradient method, both spaces containing candidate prototype functions and the one that best meets some optimization criteria is first chosen as the optimal prototype function and then improved. Given that creating the prototype functions of features is just one of the earlier steps of a signature verification system, we also propose here a scheme of signature verification algorithm with intelligent classification. Our approach was tested in the context of random and highly skilled forgeries, with error rates below 0.1% over 7,300 verifications. Our database consisted of 1,762 exemplars, containing genuine signatures and skilled forgeries from 36 persons. Comparison to other methods of making prototype functions of features is shown.

scholarly journals The Sedov Blast Wave as a Radial Piston Verification Test

2016 ◽  
Vol 1 (3) ◽  
Author(s):  
Clark Pederson ◽  
Bart Brown ◽  
Nathaniel Morgan
Keyword(s):  
Energy Source ◽  
Boundary Condition ◽  
Point Source ◽  
Blast Wave ◽  
Time Varying ◽  
Initial Condition ◽  
Piston Problem ◽  
Great Utility ◽  
Verification Problem ◽  
Verification Test

The Sedov blast wave is of great utility as a verification problem for hydrodynamic methods. The typical implementation uses an energized cell of finite dimensions to represent the energy point source. This approximation can be avoided by directly finding the effects of the energy source as a boundary condition (BC). The proposed method transforms the Sedov problem into an outward moving radial piston problem with a time-varying velocity. A portion of the mesh adjacent to the origin is removed and the boundaries of this hole are forced with the velocities from the Sedov solution. This verification test is implemented on two types of meshes, and convergence is shown. The results from the typical initial condition (IC) method and the new BC method are compared.

scholarly journals Proof-Carrying Hardware: Concept and Prototype Tool Flow for Online Verification

2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Stephanie Drzevitzky ◽  
Uwe Kastens ◽  
Marco Platzner
Keyword(s):  
Software Security ◽  
Reconfigurable Hardware ◽  
Networked Systems ◽  
Equivalence Checking ◽  
Dynamically Reconfigurable ◽  
Prototype Tool ◽  
Reconfigurable System ◽  
Novel Approach ◽  
Verification Problem ◽  
Online Verification

Dynamically reconfigurable hardware combines hardware performance with software-like flexibility and finds increasing use in networked systems. The capability to load hardware modules at runtime provides these systems with an unparalleled degree of adaptivity but at the same time poses new challenges for security and safety. In this paper, we elaborate on the presentation of proof carrying hardware (PCH) as a novel approach to reconfigurable system security. PCH takes a key concept from software security, known as proof-carrying code, into the reconfigurable hardware domain. We outline the PCH concept and discuss runtime combinational equivalence checking as a first online verification problem applying the concept. We present a prototype tool flow and experimental results demonstrating the feasibility and potential of the PCH approach.

Geometric and Textural Cues for Automatic Kinship Verification

2015 ◽  
Vol 29 (03) ◽  
pp. 1556001 ◽  
Author(s):  
Andrea Bottino ◽  
Tiago Figueiredo Vieira ◽  
Ihtesham Ul Islam
Keyword(s):  
State Of The Art ◽  
Challenging Problem ◽  
Age And Gender ◽  
Kinship Verification ◽  
Verification Problem ◽  
Experimental Protocols ◽  
Textural Data ◽  
And Gender ◽  
Computer Identification ◽  
Facial Images

Automatic Kinship verification aims at recognizing the degree of kinship of two individuals from their facial images and it has possible applications in image retrieval and annotation, forensics and historical studies. This is a recent and challenging problem, which must deal with different degrees of kinship and variations in age and gender. Our work explores the computer identification of parent–child pairs using a combination of (i) features of different natures, based on geometric and textural data, (ii) feature selection and (iii) state-of-the-art classifiers. Experiments show that the proposed approach provides a valuable solution to the kinship verification problem, as suggested by its comparison with different methods on the same data and the same experimental protocols. We further show the good generalization capabilities of our method in several cross-database experiments.

scholarly journals Security monitor inlining and certification for multithreaded Java

2014 ◽  
Vol 25 (3) ◽  
pp. 528-565 ◽  
Author(s):  
MADS DAM ◽  
BART JACOBS ◽  
ANDREAS LUNDBLAD ◽  
FRANK PIESSENS
Keyword(s):  
Security Policy ◽  
Security Policies ◽  
Policy Enforcement ◽  
Practical Application ◽  
Aspect Oriented Programming ◽  
Application Security ◽  
Fundamental Limitations ◽  
Java Bytecode ◽  
Verification Problem ◽  
Security Monitor

Security monitor inlining is a technique for security policy enforcement whereby monitor functionality is injected into application code in the style of aspect-oriented programming. The intention is that the injected code enforces compliance with the policy (security), and otherwise interferes with the application as little as possible (conservativity and transparency). Such inliners are said to be correct. For sequential Java-like languages, inlining is well understood, and several provably correct inliners have been proposed. For multithreaded Java one difficulty is the need to maintain a shared monitor state. We show that this problem introduces fundamental limitations in the type of security policies that can be correctly enforced by inlining. A class of race-free policies is identified that precisely characterizes the inlineable policies by showing that inlining of a policy outside this class is either not secure or not transparent, and by exhibiting a concrete inliner for policies inside the class which is secure, conservative and transparent. The inliner is implemented for Java and applied to a number of practical application security policies. Finally, we discuss how certification in the style of proof-carrying code could be supported for inlined programs by using annotations to reduce a potentially complex verification problem for multithreaded Java bytecode to sequential verification of just the inlined code snippets.

Sign in / Sign up

Export Citation Format

Share Document