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

Wojciech Wawrzynski - One of the best experts on this subject based on the ideXlab platform.

  • finite automata models for cs problem with Binary Semaphore
    Technical Symposium on Computer Science Education, 2006
    Co-Authors: Boguslaw Schreyer, Wojciech Wawrzynski
    Abstract:

    A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast majority of texts. However, a finite automata approach offers simplicity and visualization of synchronization mechanisms.

  • ITiCSE - Finite automata models for CS problem with Binary Semaphore
    Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education - ITICSE '06, 2006
    Co-Authors: Boguslaw Schreyer, Wojciech Wawrzynski
    Abstract:

    A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast majority of texts. However, a finite automata approach offers simplicity and visualization of synchronization mechanisms.

Javier Blanco - One of the best experts on this subject based on the ideXlab platform.

  • automatic refinement of split Binary Semaphore
    International Colloquium on Theoretical Aspects of Computing, 2007
    Co-Authors: Damian Barsotti, Javier Blanco
    Abstract:

    Binary Semaphores can be used to implement conditional critical regions by using the split Binary Semaphore (SBS) technique. Given a specification of a conditional critical regions problem, the SBS technique provides not only the resulting programs but also some invariants which ensure the correctness of the solution. The programs obtained in this way are generally not efficient. However, they can be optimized by strengthening these invariants and using them to eliminate unnecessary tests. We present a mechanical method to perform these optimizations. The idea is to use the backward propagation technique over a guarded transition system that models the behavior of the programs generated by the SBS. This process needs proving heavy implications and simplifying growing invariants. Our method automatically entrusts these tasks to the Isabelle theorem prover and the CVC Lite validity checker. We have tested our method on a number of classical examples from concurrent programming.

  • ICTAC - Automatic refinement of split Binary Semaphore
    Theoretical Aspects of Computing – ICTAC 2007, 1
    Co-Authors: Damian Barsotti, Javier Blanco
    Abstract:

    Binary Semaphores can be used to implement conditional critical regions by using the split Binary Semaphore (SBS) technique. Given a specification of a conditional critical regions problem, the SBS technique provides not only the resulting programs but also some invariants which ensure the correctness of the solution. The programs obtained in this way are generally not efficient. However, they can be optimized by strengthening these invariants and using them to eliminate unnecessary tests. We present a mechanical method to perform these optimizations. The idea is to use the backward propagation technique over a guarded transition system that models the behavior of the programs generated by the SBS. This process needs proving heavy implications and simplifying growing invariants. Our method automatically entrusts these tasks to the Isabelle theorem prover and the CVC Lite validity checker. We have tested our method on a number of classical examples from concurrent programming.

Bernard Goossens - One of the best experts on this subject based on the ideXlab platform.

  • Software Platform based Embedded Multiprocessor SoC Prototyping
    2011
    Co-Authors: Benaoumeur Senouci, Ali El Moussaoui, Bernard Goossens
    Abstract:

    Abstract. This paper describes our experience in processor/threads synchronization using the POSIX API standard for MPSoC virtual applications prototyping. Spin-Lock (Binary Semaphore) implementations on general purpose CPU are based on an atomic read and (conditional) write of a shared variable. In modern multiprocessor implementations, these operations occur as dependent pairs of conditional instructions, such as load linked and store conditional. We present and discuss how a hardware Semaphore could be a more efficient mechanism for processor/threads synchronisation that is CPU family independent. This mechanism has been implemented for an SMP Operating System with a validation on a top of a multi-ARM software platform

  • CIIA - Software Platform based Embedded Multiprocessor SoC Prototyping.
    2009
    Co-Authors: Benaoumeur Senouci, Ali El Moussaoui, Bernard Goossens
    Abstract:

    This paper describes our experience in processor/threads synchronization using the POSIX API standard for MPSoC virtual applications prototyping. Spin-Lock (Binary Semaphore) implementations on general purpose CPU are based on an atomic read and (conditional) write of a shared variable. In modern multiprocessor implementations, these operations occur as dependent pairs of conditional instructions, such as load linked and store conditional. We present and discuss how a hardware Semaphore could be a more efficient mechanism for processor/threads synchronisation that is CPU family independent. This mechanism has been implemented for an SMP Operating System with a validation on a top of a multi-ARM software platform.

Boguslaw Schreyer - One of the best experts on this subject based on the ideXlab platform.

  • finite automata models for cs problem with Binary Semaphore
    Technical Symposium on Computer Science Education, 2006
    Co-Authors: Boguslaw Schreyer, Wojciech Wawrzynski
    Abstract:

    A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast majority of texts. However, a finite automata approach offers simplicity and visualization of synchronization mechanisms.

  • ITiCSE - Finite automata models for CS problem with Binary Semaphore
    Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education - ITICSE '06, 2006
    Co-Authors: Boguslaw Schreyer, Wojciech Wawrzynski
    Abstract:

    A non-deterministic finite automata (NFA) application to a critical section (CS) problem modeling is investigated. A traditional approach to an analysis and design includes the C- like pseudo codes. This is also an educational method popular in the vast majority of texts. However, a finite automata approach offers simplicity and visualization of synchronization mechanisms.

Damian Barsotti - One of the best experts on this subject based on the ideXlab platform.

  • automatic refinement of split Binary Semaphore
    International Colloquium on Theoretical Aspects of Computing, 2007
    Co-Authors: Damian Barsotti, Javier Blanco
    Abstract:

    Binary Semaphores can be used to implement conditional critical regions by using the split Binary Semaphore (SBS) technique. Given a specification of a conditional critical regions problem, the SBS technique provides not only the resulting programs but also some invariants which ensure the correctness of the solution. The programs obtained in this way are generally not efficient. However, they can be optimized by strengthening these invariants and using them to eliminate unnecessary tests. We present a mechanical method to perform these optimizations. The idea is to use the backward propagation technique over a guarded transition system that models the behavior of the programs generated by the SBS. This process needs proving heavy implications and simplifying growing invariants. Our method automatically entrusts these tasks to the Isabelle theorem prover and the CVC Lite validity checker. We have tested our method on a number of classical examples from concurrent programming.

  • ICTAC - Automatic refinement of split Binary Semaphore
    Theoretical Aspects of Computing – ICTAC 2007, 1
    Co-Authors: Damian Barsotti, Javier Blanco
    Abstract:

    Binary Semaphores can be used to implement conditional critical regions by using the split Binary Semaphore (SBS) technique. Given a specification of a conditional critical regions problem, the SBS technique provides not only the resulting programs but also some invariants which ensure the correctness of the solution. The programs obtained in this way are generally not efficient. However, they can be optimized by strengthening these invariants and using them to eliminate unnecessary tests. We present a mechanical method to perform these optimizations. The idea is to use the backward propagation technique over a guarded transition system that models the behavior of the programs generated by the SBS. This process needs proving heavy implications and simplifying growing invariants. Our method automatically entrusts these tasks to the Isabelle theorem prover and the CVC Lite validity checker. We have tested our method on a number of classical examples from concurrent programming.