Results 251 to 260 of about 1,204,356 (299)
Some of the next articles are maybe not open access.

Check out the Rules: Towards Time-Efficient Rule Checking over RFID Tags

Mobile Networks and Applications, 2014
With the rapid proliferation of RFID technologies, RFID has been introduced to the applications like safety inspection and warehouse management. Conventionally a number of deployment rules are specified for these applications. This paper studies a practically important problem of rule checking over RFID tags, i.e., checking whether the specified rules ...
Yafeng Yin 0002   +3 more
openaire   +2 more sources

Equivalence checking: a rule-based approach

Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings., 2006
A well-known problem in the design of embedded systems is checking for equivalence of two systems, and the traditional approach constructs and proves equivalence of finite state models of the two systems. Although widely and successfully used, the main problem is state space explosion, and other forms of higher-level analysis are also needed typically.
Masahiro Fujita   +2 more
openaire   +2 more sources

A Formal Approach to Design-Rule Checking

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
This paper describes the development of a layout model and the theoretical basis for a relatively technology-independent, false-error free, hierarchical design-rule checker for VLSI circuit layouts which have Manhattan geometry and are subject to some design-rule simplifications. A flat model of the layout of a VLSI circuit using set theory notation is
Hossein Modarres, Ronald J. Lomax
openaire   +2 more sources

Security Rule Check

2017
A major challenge with designing secure integrated circuits (ICs) is the diversity of existing and emerging attacks, attack goals, and potential countermeasures. While security concerns in digital hardware design have become well known in the recent years, a framework for comprehensive vulnerability analysis at design stage of hardware development is ...
Adib Nahiyan   +3 more
openaire   +1 more source

Model Checking with Graphical Validation Rules

15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ecbs 2008), 2008
The assurance of quality and reliability of process models and workflows is essential for model driven software development. There are numerous ways to achieve these objectives. One is model checking, through which it can be verified that a model satisfies specific logical rules. The model to be checked is usually given as a finite state machine. Rules
Sven Feja, Daniel Fötsch
openaire   +2 more sources

Defining ATPG rules checking in STIL

Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270), 2002
Developed for pattern interchange from test-generation output to tester input, the standard test interface language (STIL) was recently shown to support general test-generation input constructs. This paper shows how scan-test rules-checking can be driven by a single STIL input file.
Peter Wohl, John A. Waicukauski
openaire   +1 more source

Security Rule Checking in IC Design

Computer, 2016
The Design Security Rule Check (DSeRC) framework is a first step toward automating the analysis of integrated circuit design vulnerabilities. By mathematically modeling vulnerabilities at each abstraction level and associating them with metrics and rules, DSeRC aims to help designers quantitatively assess potential problems early on, improving security
Kan Xiao, Adib Nahiyan, Mark Tehranipoor
openaire   +1 more source

New rules keep EMTALA in check

Nursing Management (Springhouse), 2003
Recently proposed rules on the interpretation of EMTALA maintain the law's intention while protecting staff by limiting its ever-increasing application.
openaire   +2 more sources

Type Checking with Rewriting Rules

Proceedings of the 17th ACM SIGPLAN International Conference on Software Language Engineering
Type classes support the implementation of highly reusable algorithms and data structures without loss of efficiency. Initially developed in Haskell, they have become central to the design of several modern programming languages, including Swift, Rust, Hylo, and Carbon.
openaire   +1 more source

Checking DFT Rules with a VHDL Simulator

1993
Abstract We describe the application of VHDL simulators to check the conformance of a design with Design for Testability (DFT) rules. The basic idea is to define a special DFT logic using VHDL's powerful logic modeling capabilities and to perform a kind of symbolic simulation based on this DFT logic.
Wolfgang Glunz, Torsten Rössel
openaire   +2 more sources

Home - About - Disclaimer - Privacy