Abstract State - Explore the Science & Experts | ideXlab

Scan Science and Technology

Contact Leading Edge Experts & Companies

Abstract State

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

Yuri Gurevich – 1st expert on this subject based on the ideXlab platform

  • Abstract State Machines – Using Abstract State Machines at Microsoft: A Case Study
    Lecture Notes in Computer Science, 2020
    Co-Authors: Mike Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes

    Abstract:

    Our goal is to provide a rigorous method, clear notation and convenient tool support for high-level system design and analysis. For this purpose we use Abstract State machines (ASMs). Here we describe a particular case study: modeling a debugger of a stack based runtime environment. The study provides evidence for ASMs being a suitable tool for building executable models of software systems on various Abstraction levels, with precise refinement relationships connecting the models. High level ASM models of proposed or existing programs can be used throughout the software development cycle. In particular, ASMs can be used to model inter component behavior on any desired level of detail. This allows one to specify application programming interfaces more precisely than it is done currently.

  • Abstract State Machines – Abstract State Machines and Computationally Complete Query Languages
    Lecture Notes in Computer Science, 2020
    Co-Authors: Andreas Blass, Yuri Gurevich, Jan Van Den Bussche

    Abstract:

    Abstract State machines (ASMs) form a relatively new computation model holding the promise that they can simulate any computational system in lockstep. In particular, an instance of the ASM model has recently been introduced for computing queries to relational databases. This model, to which we refer as the BGS model, provides a powerful query language in which all computable queries can be expressed. In this paper, we show that when one is only interested in polynomial-time computations, BGS is strictly more powerful than both QL and whilenew, two well-known computationally complete query languages. We then show that when a language such as whilenew is extended with a duplicate elimination mechanism, polynomial-time simulations between the language and BGS become possible.

  • Abstract State Machines – Investigating Java Concurrency Using Abstract State Machines
    Lecture Notes in Computer Science, 2020
    Co-Authors: Yuri Gurevich, Wolfram Schulte, Charles Wallace

    Abstract:

    We present a mathematically precise, platform-independent model of Java concurrency using the Abstract State Machine method. We cover all aspects of Java threads and synchronization, gradually adding details to the model in a series of steps. We motivate and explain each concurrency feature, and point out subtleties, inconsistencies and ambiguities in the official, informal Java specification.

Klaus-dieter Schewe – 2nd expert on this subject based on the ideXlab platform

  • The Evolution of Conceptual Modeling – Composing Personalised Services on top of Abstract State Services
    , 2020
    Co-Authors: Hui Ma, Klaus-dieter Schewe, Bernhard Thalheim, Qing Wang

    Abstract:

    We introduce Abstract State Services (ASSs) as an Abstraction of data-intensive services that can be made available for use by other systems, e.g. via the web. An ASS combines a hidden database layer with an operation-equipped view layer, and can be anything from a simple function to a full-fledged Web Information System or a Data Warehouse. We adopt the fundamental approach of Abstract State Machines to model ASSs. Then we show how tailored services can be extracted from available ASSs, integrated with other ASSs and personalised to user preferences.

  • BSP Abstract State machines capture bulk synchronous parallel computations
    Science of Computer Programming, 2019
    Co-Authors: Flavio Ferrarotti, Senén González, Klaus-dieter Schewe

    Abstract:

    Abstract The bulk synchronous parallel (BSP) bridging model is a model for concurrent computations with alternating computation and communication phases between programs running on different processors. In a computation phase the programs proceed independently and asynchronously until a barrier is reached. In a communication phase initiated by all programs having reached the barrier only messages between the programs are exchanged until normal processing can be continued. In this article we present a behavioural theory for BSP computations comprising an axiomatisation of the BSP model, the definition of a restricted class of concurrent Abstract State machines, which we call BSP Abstract State machines, and the proof that BSP Abstract State machines capture BSP computations as defined by the axiomatisation. We illustrate the use of BSP Abstract State machines on map-reduce.

  • ABZ – Abstract State Machines with Exact Real Arithmetic
    Lecture Notes in Computer Science, 2018
    Co-Authors: Christoph Beierle, Klaus-dieter Schewe

    Abstract:

    Type-2 Theory of Effectivity is a well established theory of computability on infinite strings, which in this paper is exploited to define a data type \( Real \) as part of the background structure of Abstract State Machines. Real numbers are represented by rapidly converging Cauchy sequences, on top of which standard operations such as addition, multiplication, division, exponentials, trigonometric functions, etc. can be defined. In this way exact computation with real numbers is enabled. Output can be generated at any degree of precision by exploring only sufficiently long prefixes of the representing Cauchy sequences.

Margus Veanes – 3rd expert on this subject based on the ideXlab platform

  • Abstract State Machines – Using Abstract State Machines at Microsoft: A Case Study
    Lecture Notes in Computer Science, 2020
    Co-Authors: Mike Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes

    Abstract:

    Our goal is to provide a rigorous method, clear notation and convenient tool support for high-level system design and analysis. For this purpose we use Abstract State machines (ASMs). Here we describe a particular case study: modeling a debugger of a stack based runtime environment. The study provides evidence for ASMs being a suitable tool for building executable models of software systems on various Abstraction levels, with precise refinement relationships connecting the models. High level ASM models of proposed or existing programs can be used throughout the software development cycle. In particular, ASMs can be used to model inter component behavior on any desired level of detail. This allows one to specify application programming interfaces more precisely than it is done currently.

  • Can Abstract State machines be useful in language theory
    Theoretical Computer Science, 2007
    Co-Authors: Yuri Gurevich, Margus Veanes, Charles Wallace

    Abstract:

    The Abstract State machine (ASM) is a modern computation model. ASMs and ASM based tools are used in academia and industry, albeit on a modest scale. They allow you to give high-level operational semantics to computer artifacts and to write executable specifications of software and hardware at the desired Abstraction level. In connection with the 2006 conference on Developments in Language Theory, we point out several ways that we believe Abstract State machines can be useful to the DLT community.

  • generating finite State machines from Abstract State machines
    International Symposium on Software Testing and Analysis, 2002
    Co-Authors: Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes

    Abstract:

    We give an algorithm that derives a finite State machine (FSM) from a given Abstract State machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have typically too many, often infinitely many States. We group ASM States into finitely many hyperStates which are the nodes of the FSM. The links of the FSM are induced by the ASM State transitions.