The Experts below are selected from a list of 5442 Experts worldwide ranked by ideXlab platform
Wang Sheng - One of the best experts on this subject based on the ideXlab platform.
-
A TRANSLATOR TO CONVERT RELATIONAL DATA MODEL TO XML DOCUMENTS
Computer Engineering, 2001Co-Authors: Wang ShengAbstract:The XML technology has very close relationship with relational data models. It has realistic significance to convert the relational data formats to XML documents. This paper mainly discusses how to develop a translator with OmniMark programing language, and analyses the key technologies, including the relationship between relationship schemas, DTD and XML schemas, platform independence and SGML Syntax Checking.
Gary T. Leavens - One of the best experts on this subject based on the ideXlab platform.
-
Polymorphic type-Checking in scheme
Computer Languages, 1996Co-Authors: Steven L. Jenkins, Gary T. LeavensAbstract:This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a type system that is simple enough to be used by beginner students, yet is powerful enough to express the ideas of polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs some rudimentary Syntax Checking. The system uses subtyping, but only in a primitive fashion. It has a type datum which is a supertype of all types, and a type poof which is a subtype of all types. It uses intersection types to control the use of datum and to generate simple but accurate types.
-
Polymorphic Type Inference in Scheme
1995Co-Authors: Steven L. Jenkins, Gary T. LeavensAbstract:This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a simple type inference system that can be used by beginning students, yet is powerful enough to express the ideas of types, polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs some rudimentary Syntax Checking. The system uses subtyping, but only in a primitive fashion. It has a type datum which is a supertype of all types, and a type poof which is a subtype of all types. It uses and-types (intersection types) to control the use of datum and to generate accurate but simple types.
Bashar Nuseibeh - One of the best experts on this subject based on the ideXlab platform.
-
RE - OpenArgue: Supporting argumentation to evolve secure software systems
2011 IEEE 19th International Requirements Engineering Conference, 2011Co-Authors: Thein Than Tun, Alessandra Tedeschi, Virginia N. L. Franqueira, Bashar NuseibehAbstract:When software systems are verified against security requirements, formal and informal arguments provide a structure for organizing the software artifacts. Our recent work on the evolution of security-critical software systems demonstrates that our argumentation technique is useful in limiting the scope of change and in identifying changes to security properties. In support of this work, we have developed OpenArgue, a tool for Syntax Checking, visualizing, formalizing, and reasoning about incremental arguments. OpenArgue has been integrated with requirements engineering tools for Problem Frames and i∗, and applied to an Air Traffic Management (ATM) case study.
In Young Choi - One of the best experts on this subject based on the ideXlab platform.
-
Modeling the Arden Syntax for medical decisions in XML
International journal of medical informatics, 2008Co-Authors: Sukil Kim, Peter J. Haug, Roberto A. Rocha, In Young ChoiAbstract:Purpose: A new model expressing Arden Syntax with the eXtensible Markup Language (XML) was developed to increase its portability. Methods: Every example was manually parsed and reviewed until the schema and the style sheet were considered to be optimized. When the first schema was finished, several MLMs in Arden Syntax Markup Language (ArdenML) were validated against the schema. They were then transformed to HTML formats with the style sheet, during which they were compared to the original text version of their own MLM. When faults were found in the transformed MLM, the schema and/or style sheet was fixed. This cycle continued until all the examples were encoded into XML documents. The original MLMs were encoded in XML according to the proposed XML schema and reverse-parsed MLMs in ArdenML were checked using a public domain Arden Syntax checker. Results: Two hundred seventy seven examples of MLMs were successfully transformed into XML documents using the model, and the reverse-parse yielded the original text version of MLMs. Two hundred sixty five of the 277 MLMs showed the same error patterns before and after transformation, and all 11 errors related to statement structure were resolved in XML version. The model uses two Syntax Checking mechanisms, first an XML validation process, and second, a Syntax check using an XSL style sheet.
Jörg Becker - One of the best experts on this subject based on the ideXlab platform.
-
Wirtschaftsinformatik - Applicability of Business Process Model Analysis Approaches – A Case Study in Financial Services Consulting
Wirtschaftsinformatik und Angewandte Informatik, 2013Co-Authors: Jörg Becker, Mathias Eggert, Dennis Bruning, Jan SaatAbstract:The analysis of business process models gains more and more atten- tion in IS research. Several analysis approaches have been developed. All of them provide different features, such as Syntax Checking or pattern recognition. This paper investigates the applicability and relevance of business process model analysis approaches using a case study from financial services consult- ing. Two research contributions are provided. First, an overview about common model analysis features and its relevance for consulting processes are provided. Second, the applicability of the automatic business process model analysis ap- proaches is investigated. Results show that the majority of features can raise ef- ficiency of analyses in business process reengineering projects.
-
Business Process Management Workshops - A Runtime Analysis of Graph-Theoretical Algorithms to Detect Patterns in Process Model Collections
Business Process Management Workshops, 2013Co-Authors: Jörg Becker, Dominic Breuker, Patrick Delfmann, Hanns-alexander Dietrich, Matthias SteinhorstAbstract:Pattern detection serves different purposes in managing large collections of process models, ranging from Syntax Checking to compliance validation. This paper presents a runtime analysis of four graph-theoretical algorithms for (frequent) pattern detection. We apply these algorithms to large collections of process and data models to demonstrate that, despite their theoretical intractability, they are able to return results within (milli-) seconds. We discuss the relative performance of these algorithms and their applicability in practice.
