Language Definition

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 204 Experts worldwide ranked by ideXlab platform

Mona Vajihollahi - One of the best experts on this subject based on the ideXlab platform.

  • an abstract machine architecture for web service based business process management
    Lecture Notes in Computer Science, 2006
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We define an abstract operational model of the Business Process Execution Language for Web Services (BPEL) based on the abstract state machine (ASM) formalism. That is, we abstractly model dynamic properties of the key Language constructs through the construction of a BPEL abstract machine. Specifically, we present the process execution model and the underlying execution lifecycle of BPEL activities. The goal of our work is to provide a precise and well defined semantic framework for establishing the key Language attributes. To this end, the BPEL abstract machine forms a comprehensive and robust formalization closely reflecting the view of the informal Language Definition.

  • an abstract machine architecture for web service based business process management
    International Journal of Business Process Integration and Management, 2006
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We define an abstract operational model of the Business Process Execution Language for Web Service (BPEL4WS) based on the Abstract State Machine (ASM) formalism. That is, we abstractly model dynamic properties of the key Language constructs through the construction of a Business Process Execution Language (BPEL) abstract machine. Specifically, we present the process execution model and the underlying execution lifecycle of BPEL activities. The goal of our work is to provide a precise and well defined semantic framework for establishing the key Language attributes. To this end, the BPEL abstract machine forms a comprehensive and robust formalisation closely reflecting the view of the informal Language Definition.

  • specification and validation of the business process execution Language for web services
    Lecture Notes in Computer Science, 2004
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We formally define an abstract executable semantics for the Business Process Execution Language for Web Services in terms of a distributed ASM. The goal of this work is to support the design and standardization of the Language. “There is a need for formalism. It will allow us to not only reason about the current specification and related issues, but also uncover issues that would otherwise go unnoticed. Empirical deduction is not sufficient.” – Issue #42, OASIS WSBPEL TC. The Language Definition assumes an infrastructure for running Web services on some asynchronous communication architecture. A business process is built on top of a collection of Web services performing continuous interactions with the outside world by sending and receiving messages over a communication network. The underlying execution model is characterized by its concurrent and reactive behavior making it particularly difficult to predict dynamic system properties with a sufficient degree of detail and precision under all circumstances.

Roozbeh Farahbod - One of the best experts on this subject based on the ideXlab platform.

  • an abstract machine architecture for web service based business process management
    Lecture Notes in Computer Science, 2006
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We define an abstract operational model of the Business Process Execution Language for Web Services (BPEL) based on the abstract state machine (ASM) formalism. That is, we abstractly model dynamic properties of the key Language constructs through the construction of a BPEL abstract machine. Specifically, we present the process execution model and the underlying execution lifecycle of BPEL activities. The goal of our work is to provide a precise and well defined semantic framework for establishing the key Language attributes. To this end, the BPEL abstract machine forms a comprehensive and robust formalization closely reflecting the view of the informal Language Definition.

  • an abstract machine architecture for web service based business process management
    International Journal of Business Process Integration and Management, 2006
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We define an abstract operational model of the Business Process Execution Language for Web Service (BPEL4WS) based on the Abstract State Machine (ASM) formalism. That is, we abstractly model dynamic properties of the key Language constructs through the construction of a Business Process Execution Language (BPEL) abstract machine. Specifically, we present the process execution model and the underlying execution lifecycle of BPEL activities. The goal of our work is to provide a precise and well defined semantic framework for establishing the key Language attributes. To this end, the BPEL abstract machine forms a comprehensive and robust formalisation closely reflecting the view of the informal Language Definition.

  • specification and validation of the business process execution Language for web services
    Lecture Notes in Computer Science, 2004
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We formally define an abstract executable semantics for the Business Process Execution Language for Web Services in terms of a distributed ASM. The goal of this work is to support the design and standardization of the Language. “There is a need for formalism. It will allow us to not only reason about the current specification and related issues, but also uncover issues that would otherwise go unnoticed. Empirical deduction is not sufficient.” – Issue #42, OASIS WSBPEL TC. The Language Definition assumes an infrastructure for running Web services on some asynchronous communication architecture. A business process is built on top of a collection of Web services performing continuous interactions with the outside world by sending and receiving messages over a communication network. The underlying execution model is characterized by its concurrent and reactive behavior making it particularly difficult to predict dynamic system properties with a sufficient degree of detail and precision under all circumstances.

Uwe Glässer - One of the best experts on this subject based on the ideXlab platform.

  • an abstract machine architecture for web service based business process management
    Lecture Notes in Computer Science, 2006
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We define an abstract operational model of the Business Process Execution Language for Web Services (BPEL) based on the abstract state machine (ASM) formalism. That is, we abstractly model dynamic properties of the key Language constructs through the construction of a BPEL abstract machine. Specifically, we present the process execution model and the underlying execution lifecycle of BPEL activities. The goal of our work is to provide a precise and well defined semantic framework for establishing the key Language attributes. To this end, the BPEL abstract machine forms a comprehensive and robust formalization closely reflecting the view of the informal Language Definition.

  • an abstract machine architecture for web service based business process management
    International Journal of Business Process Integration and Management, 2006
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We define an abstract operational model of the Business Process Execution Language for Web Service (BPEL4WS) based on the Abstract State Machine (ASM) formalism. That is, we abstractly model dynamic properties of the key Language constructs through the construction of a Business Process Execution Language (BPEL) abstract machine. Specifically, we present the process execution model and the underlying execution lifecycle of BPEL activities. The goal of our work is to provide a precise and well defined semantic framework for establishing the key Language attributes. To this end, the BPEL abstract machine forms a comprehensive and robust formalisation closely reflecting the view of the informal Language Definition.

  • specification and validation of the business process execution Language for web services
    Lecture Notes in Computer Science, 2004
    Co-Authors: Roozbeh Farahbod, Uwe Glässer, Mona Vajihollahi
    Abstract:

    We formally define an abstract executable semantics for the Business Process Execution Language for Web Services in terms of a distributed ASM. The goal of this work is to support the design and standardization of the Language. “There is a need for formalism. It will allow us to not only reason about the current specification and related issues, but also uncover issues that would otherwise go unnoticed. Empirical deduction is not sufficient.” – Issue #42, OASIS WSBPEL TC. The Language Definition assumes an infrastructure for running Web services on some asynchronous communication architecture. A business process is built on top of a collection of Web services performing continuous interactions with the outside world by sending and receiving messages over a communication network. The underlying execution model is characterized by its concurrent and reactive behavior making it particularly difficult to predict dynamic system properties with a sufficient degree of detail and precision under all circumstances.

  • the formal semantics of sdl 2000 status and perspectives
    Computer Networks, 2003
    Co-Authors: Uwe Glässer, Reinhard Gotzhein, Andreas Prinz
    Abstract:

    In November 1999, the current version of specification and description Language (SDL), commonly referred to as SDL-2000, passed through ITU-T. In November 2000, the formal semantics of SDL- 2000 was officially approved to become part of the SDL Language Definition. It covers both the static and the dynamic semantics, and is based on the formalism of abstract state machines (ASMs). To support executability, the formal semantics defines, for each SDL specification, reference ASM code, which enables an SDL-to-ASM-compiler.In this paper, we briefly survey and compare existing approaches to define the semantics of SDL formally. The ITU-T approach is then outlined in more detail, addressing the following steps: (1) mapping of non-basic Language constructs to the core Language, (2) checking of static semantics conditions, (3) Definition of the SDL abstract machine (SAM), and (4) Definition of the SDL virtual machine (SVM). The paper concludes with experiences from the SDL-to-ASM-compiler project. It is proposed that the SDL-2000 semantics can be adapted and extended to formally define the meaning of UML 2.0 class, composite structure, and statechart diagrams.

Eelco Visser - One of the best experts on this subject based on the ideXlab platform.

  • integrated Language Definition testing enabling test driven Language development
    Technical Report Series TUD-SERG-2011-011, 2011
    Co-Authors: Lennart C L Kats, Rob Vermaas, Eelco Visser
    Abstract:

    The reliability of compilers, interpreters, and development environments for programming Languages is essential for effective software development and maintenance. They are often tested only as an afterthought. Languages with a smaller scope, such as domain-specific Languages, often remain untested. General-purpose testing techniques and test case generation methods fall short in providing a low-threshold solution for test-driven Language development. In this paper we introduce the notion of a Language-parametric testing Language (LPTL) that provides a reusable, generic basis for declaratively specifying Language Definition tests. We integrate the syntax, semantics, and editor services of a Language under test into the LPTL for writing test inputs. This paper describes the design of an LPTL and the tool support provided for it, shows use cases using examples, and describes our implementation in the form of the Spoofax testing Language. This paper is a pre-print of: Lennart C. L. Kats, Rob Vermaas, Eelco Visser. Integrated Language Definition Testing. Enabling Test-Driven Language Development. In Kathleen Fisher, editor, Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2011), ACM, 2010.

  • integrated Language Definition testing enabling test driven Language development
    Conference on Object-Oriented Programming Systems Languages and Applications, 2011
    Co-Authors: Lennart C L Kats, Rob Vermaas, Eelco Visser
    Abstract:

    The reliability of compilers, interpreters, and development environments for programming Languages is essential for effective software development and maintenance. They are often tested only as an afterthought. Languages with a smaller scope, such as domain-specific Languages, often remain untested. General-purpose testing techniques and test case generation methods fall short in providing a low-threshold solution for test-driven Language development. In this paper we introduce the notion of a Language-parametric testing Language (LPTL) that provides a reusable, generic basis for declaratively specifying Language Definition tests. We integrate the syntax, semantics, and editor services of a Language under test into the LPTL for writing test inputs. This paper describes the design of an LPTL and the tool support provided for it, shows use cases using examples, and describes our implementation in the form of the Spoofax testing Language.

Gabriele Taentzer - One of the best experts on this subject based on the ideXlab platform.

  • integrating meta modelling aspects with graph transformation for efficient visual Language Definition and model manipulation
    Fundamental Approaches to Software Engineering, 2004
    Co-Authors: Roswitha Bardohl, Hartmut Ehrig, Juan De Lara, Gabriele Taentzer
    Abstract:

    Visual Languages (VLs) play a central role in modelling various system aspects. Besides standard Languages like UML, a variety of domain-specific Languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on VL specifications. To define a VL, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional Language properties. Defining a VL by a graph grammar, the constructive way is followed where graphs describe the abstract syntax of models and graph rules formulate the Language grammar.

  • integrating meta modelling aspects with graph transformation for efficient visual Language Definition and model manipulation
    Lecture Notes in Computer Science, 2004
    Co-Authors: Roswitha Bardohl, Hartmut Ehrig, Juan De Lara, Gabriele Taentzer
    Abstract:

    Visual Languages (VLs) play a central role in modelling various system aspects. Besides standard Languages like UML, a variety of domain-specific Languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on VL specifications. To define a VL, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional Language properties. Defining a VL by a graphs grammar, the constructive way is followed where graphs describe the syntax of models and graph rules formulate the Language grammar. In this paper, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations with edge types of some graph class. In this way, declarative as well as constructive elements may be used for Language Definition and model manipulation. Two concrete approaches, the GENGED and the AToM 3 approach, illustrate how VLs can be defined and models can be manipulated by the techniques described above.