Results 11  20
of
10,311
FORMAL DEFINITION EXAMPLE
, 2012
"... Suppose you are flying from Kolkata to Agartala Any booking site will show you hundreds of flights Which one to choose? ARNAB BHATTACHARYA SKYLINES 2 / 30SKYLINE QUERIES ..."
Abstract
 Add to MetaCart
Suppose you are flying from Kolkata to Agartala Any booking site will show you hundreds of flights Which one to choose? ARNAB BHATTACHARYA SKYLINES 2 / 30SKYLINE QUERIES
Formal Definition of Selfreproductive Systems
, 2002
"... Formal definition of selfreproduction may have importance the Alife research program, especially for application of its achievements outside the discipline. The paper examines two formal definitions of selfreproduction, suggested by McMullin and Löfgren. It is pointed out that these definitio ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Formal definition of selfreproduction may have importance the Alife research program, especially for application of its achievements outside the discipline. The paper examines two formal definitions of selfreproduction, suggested by McMullin and Löfgren. It is pointed out
Learning Formal Definitions for Biomedical Concepts
"... Abstract. Ontologies such as the SNOMED Clinical Terms (SNOMED CT), and the Medical Subject Headings (MeSH) play a major role in life sciences. Modeling formally the concepts and the roles in this domain is a crucial process to allow for the integration of biomedical knowledge across applications. I ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. In this direction we propose a novel methodology to learn formal definitions for biomedical concepts from unstructured text. We evaluate experimentally the suggested methodology in learning formal definitions of SNOMED CT concepts, using their text definitions from MeSH. The evaluation is focused on the learning
Formal definition of the parameterized aspect calculus
, 2003
"... This paper gives the formal definition of the parameterized aspect calculus, or ςasp. The ςasp calculus is a core calculus for the formal study of aspectoriented programming languages. The calculus consists of a base language, taken from Abadi and Cardelli’s object calculus, and point cut descripti ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper gives the formal definition of the parameterized aspect calculus, or ςasp. The ςasp calculus is a core calculus for the formal study of aspectoriented programming languages. The calculus consists of a base language, taken from Abadi and Cardelli’s object calculus, and point cut
On the formal definition of separationofduty policies and their composition
 Proc. IEEE Symposium on Security and Privacy
, 1998
"... In this paper we define formally a wide variety of separationofduty (SoD) properties, which include the best known to date, and establish their relationships within a formal model of rolebased access control (RBAC). The formalism helps remove all ambiguities of informal definition, and offers a w ..."
Abstract

Cited by 101 (6 self)
 Add to MetaCart
In this paper we define formally a wide variety of separationofduty (SoD) properties, which include the best known to date, and establish their relationships within a formal model of rolebased access control (RBAC). The formalism helps remove all ambiguities of informal definition, and offers a
A formal definition of ALGOL 60
, 1972
"... A l g o l 6 0 C. D. A l l e n D.N. C h a p m a n C. B. J o n e s A u g u s t 1 9 7 2 21580520 T e c h n i c a l R e p o r t T.R. 1 2. 1 0 5 U n r e s t r i c t e d ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
A l g o l 6 0 C. D. A l l e n D.N. C h a p m a n C. B. J o n e s A u g u s t 1 9 7 2 21580520 T e c h n i c a l R e p o r t T.R. 1 2. 1 0 5 U n r e s t r i c t e d
Formal Definition of Disambiguation with Attribute Grammars
, 1434
"... The current problem of the disambiguation in Transformers with attribute grammars is that noone has a proof that allows certification of this approach. The current use of attribute grammars for the disambiguation of C and a part of C++ lets us think that this method is correct. In order to remove a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
any doubt, a definition and a formalization of our approach are necessary. This work is split in two. The first part relates to the proof of the validity of the approach used in Transformers. The second part is devoted to the correction and the Redevelopment of the existing tools in order
A Formal Definition of FRSM and Applications
"... FRSM (Formal Requirements Specification Method) is a structured formal language and method for requirements analysis and specification construction based on data flow analysis. It uses a formalized DeMarco data flow diagrams to describe the overall structure of systems and a VDMSL like formal notat ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
notation to describe precisely the functionality of components in the diagrams. This paper first describes the formal syntax and semantics of FRSM and then presents an example of using the axiom and inference rules given in the definition of the formal semantics for checking consistency of specifications
A formal definition of time in LOTOS
, 1998
"... Enhanced TimedLOTOS, denoted ETLOTOS, is an extension of LOTOS that allows the modelling of realtime behaviours. It covers all the aspects of full LOTOS, including data types, it supports both a dense and a discrete time domain and can manipulate time values as any other data values. A tutorial o ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Enhanced TimedLOTOS, denoted ETLOTOS, is an extension of LOTOS that allows the modelling of realtime behaviours. It covers all the aspects of full LOTOS, including data types, it supports both a dense and a discrete time domain and can manipulate time values as any other data values. A tutorial on ETLOTOS, showing many application examples, has already been published [Le # L97]. The present paper adds to it by providing an indepth presentation of its theoretical aspects. The complete semantics is given and explained, and its properties are studied. In particular, we prove that the semantics is consistent and that strong bisimulation is a congruence. This requires to deal carefully with the presence of negative premises in the operational semantics, which are necessary to express urgency. ETLOTOS is also shown to be a conservative extension of LOTOS for guarded processes, and is the basis of the timed extension of LOTOS currently developed by ISO [ISO98]. To our knowledge, this is the first indepth study of a language that combines data types and realtime behaviours.
Results 11  20
of
10,311