Results 1  10
of
5,824
Precise Definition Of Software Component Specifications
 Proceedings of the IFAC ComputerAided Control System Design Conference
, 1997
"... : A set of generic specification categories is presented which can be used to comprehensively define any software component within a certain class. With these categories as a template, a specific set of formal specifications can be generated for each component. Specifications for a particular compon ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
: A set of generic specification categories is presented which can be used to comprehensively define any software component within a certain class. With these categories as a template, a specific set of formal specifications can be generated for each component. Specifications for a particular component (an algorithm that estimates the position and orientation of a physical object using visual sensing) have been defined in EXPRESS, an information modeling language. A few example natural language specifications are presented for this particular component. Keywords: Components, Computer vision, Formal languages, Formal specification, Software engineering, Software metrics, Software performance, Software specification, Software tools 1. INTRODUCTION The following is the software system development sequence that this research addresses: . A new software component is created, and the component developer (i.e., the vendor) wants see it widely used . A software systems developer (i.e., the use...
Towards a Precise Definition of the OMG/MDA Framework
, 2001
"... Modeles; Metamodeles; Graphes conceptuels; UML; MOF; MDA MOTSCL ES Il y a actuellement un changement de paradigme dans le domaine du developpement de systemes d'information. ..."
Abstract

Cited by 87 (13 self)
 Add to MetaCart
Modeles; Metamodeles; Graphes conceptuels; UML; MOF; MDA MOTSCL ES Il y a actuellement un changement de paradigme dans le domaine du developpement de systemes d'information.
Towards a More Precise Definition of Feature Models
 Modelling Variability for ObjectOriented Product Lines
, 2003
"... Feature models are a well accepted means for expressing requirements in a domain on an abstract level. They are applied to describe variable and common properties of products in a product line, and to derive and validate configurations of software systems. Their industrial importance is increasi ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
is increasing rapidly. However, methodical usage and tool support demands for a more precise definition of features, their properties and their relations within a feature model. This position paper summarizes the state of the discussion and proposes issues for future development. Categories of features
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1748 (28 self)
 Add to MetaCart
on elliptic curves is an example of such a map. We give precise definitions for secure identity based encryption schemes and give several applications for such systems.
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
, 2008
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 535 (38 self)
 Add to MetaCart
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 529 (6 self)
 Add to MetaCart
Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
Results 1  10
of
5,824