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

S. Hammoudi - One of the best experts on this subject based on the ideXlab platform.

  • Concurrency in object oriented language Actel
    Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems, 1997
    Co-Authors: Z. Abdelouahab, S. Hammoudi
    Abstract:

    This paper presents features of an object based concurrent language called Actel. In particular, it introduces the mechanisms of inter and intra-object concurrency and synchronisation. Inter object concurrency is achieved with conventional message passing (value and priority) and also with a new mode of message passing called the semi-reference. Intra-object concurrency may be achieved with parallel functions, parallel Compound Statements, simultaneous Compound Statement, and multiple methods invocation. Synchronisation may be achieved with simple, multiple, or overloaded future variables. An example illustrates various Actel features.

  • PDSE - Concurrency in object oriented language Actel
    Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems, 1997
    Co-Authors: Z. Abdelouahab, S. Hammoudi
    Abstract:

    This paper presents features of an object based concurrent language called Actel. In particular, it introduces the mechanisms of inter and intra-object concurrency and synchronisation. Inter object concurrency is achieved with conventional message passing (value and priority) and also with a new mode of message passing called the semi-reference. Intra-object concurrency may be achieved with parallel functions, parallel Compound Statements, simultaneous Compound Statement, and multiple methods invocation. Synchronisation may be achieved with simple, multiple, or overloaded future variables. An example illustrates various Actel features.

Z. Abdelouahab - One of the best experts on this subject based on the ideXlab platform.

  • Concurrency in object oriented language Actel
    Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems, 1997
    Co-Authors: Z. Abdelouahab, S. Hammoudi
    Abstract:

    This paper presents features of an object based concurrent language called Actel. In particular, it introduces the mechanisms of inter and intra-object concurrency and synchronisation. Inter object concurrency is achieved with conventional message passing (value and priority) and also with a new mode of message passing called the semi-reference. Intra-object concurrency may be achieved with parallel functions, parallel Compound Statements, simultaneous Compound Statement, and multiple methods invocation. Synchronisation may be achieved with simple, multiple, or overloaded future variables. An example illustrates various Actel features.

  • PDSE - Concurrency in object oriented language Actel
    Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems, 1997
    Co-Authors: Z. Abdelouahab, S. Hammoudi
    Abstract:

    This paper presents features of an object based concurrent language called Actel. In particular, it introduces the mechanisms of inter and intra-object concurrency and synchronisation. Inter object concurrency is achieved with conventional message passing (value and priority) and also with a new mode of message passing called the semi-reference. Intra-object concurrency may be achieved with parallel functions, parallel Compound Statements, simultaneous Compound Statement, and multiple methods invocation. Synchronisation may be achieved with simple, multiple, or overloaded future variables. An example illustrates various Actel features.

Aditya V. Nori - One of the best experts on this subject based on the ideXlab platform.

  • Bottom-up shape analysis using LISF
    ACM Transactions on Programming Languages and Systems, 2011
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this article, we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and noniterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from the Hoare triples of its component Statements. These inference rules are used as the basis for bottom-up shape analysis of programs. Specifically, we present a Logic of Iterated Separation Formulae (LISF), which uses the iterated separating conjunct of Reynolds [2002] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical formulas. We describe sound strong bi-abduction and satisfiability procedures for LISF. We have built a tool called S p I n E that implements these inference rules and have evaluated it on standard shape analysis benchmark programs. Our experiments show that S p I n E can generate expressive summaries, which are complete functional specifications in many cases.

  • SAS - Bottom-Up Shape Analysis
    Static Analysis, 2009
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from the Hoare triples of its component Statements. These inference rules are used as the basis for a bottom-up shape analysis of programs. Specifically, we present a logic of iterated separation formula (LISF) which uses the iterated separating conjunct of Reynolds [17] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical formulas. We describe sound strong bi-abduction and satisfiability decision procedures for LISF. We have built a prototype tool that implements these inference rules and have evaluated it on standard shape analysis benchmark programs. Preliminary results show that our tool can generate expressive summaries, which are complete functional specifications in many cases.

  • Bottom-up shape analysis
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely\ncompositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing\nheap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from\nthe Hoare triples of its component Statements. These inference rules are used as the basis for a bottom-up shape analysis\nof programs.\n\nSpecifically, we present a logic of iterated separation formula (LISF) which uses the iterated separating conjunct of Reynolds\n[17] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical\nformulas. We describe sound strong bi-abduction and satisfiability decision procedures for LISF.\n\n\n\nWe have built a prototype tool that implements these inference rules and have evaluated it on standard shape analysis benchmark\nprograms. Preliminary results show that our tool can generate expressive summaries, which are complete functional specifications\nin many cases.

Bhargav S. Gulavani - One of the best experts on this subject based on the ideXlab platform.

  • Bottom-up shape analysis using LISF
    ACM Transactions on Programming Languages and Systems, 2011
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this article, we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and noniterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from the Hoare triples of its component Statements. These inference rules are used as the basis for bottom-up shape analysis of programs. Specifically, we present a Logic of Iterated Separation Formulae (LISF), which uses the iterated separating conjunct of Reynolds [2002] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical formulas. We describe sound strong bi-abduction and satisfiability procedures for LISF. We have built a tool called S p I n E that implements these inference rules and have evaluated it on standard shape analysis benchmark programs. Our experiments show that S p I n E can generate expressive summaries, which are complete functional specifications in many cases.

  • SAS - Bottom-Up Shape Analysis
    Static Analysis, 2009
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from the Hoare triples of its component Statements. These inference rules are used as the basis for a bottom-up shape analysis of programs. Specifically, we present a logic of iterated separation formula (LISF) which uses the iterated separating conjunct of Reynolds [17] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical formulas. We describe sound strong bi-abduction and satisfiability decision procedures for LISF. We have built a prototype tool that implements these inference rules and have evaluated it on standard shape analysis benchmark programs. Preliminary results show that our tool can generate expressive summaries, which are complete functional specifications in many cases.

  • Bottom-up shape analysis
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely\ncompositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing\nheap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from\nthe Hoare triples of its component Statements. These inference rules are used as the basis for a bottom-up shape analysis\nof programs.\n\nSpecifically, we present a logic of iterated separation formula (LISF) which uses the iterated separating conjunct of Reynolds\n[17] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical\nformulas. We describe sound strong bi-abduction and satisfiability decision procedures for LISF.\n\n\n\nWe have built a prototype tool that implements these inference rules and have evaluated it on standard shape analysis benchmark\nprograms. Preliminary results show that our tool can generate expressive summaries, which are complete functional specifications\nin many cases.

Supratik Chakraborty - One of the best experts on this subject based on the ideXlab platform.

  • Bottom-up shape analysis using LISF
    ACM Transactions on Programming Languages and Systems, 2011
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this article, we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and noniterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from the Hoare triples of its component Statements. These inference rules are used as the basis for bottom-up shape analysis of programs. Specifically, we present a Logic of Iterated Separation Formulae (LISF), which uses the iterated separating conjunct of Reynolds [2002] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical formulas. We describe sound strong bi-abduction and satisfiability procedures for LISF. We have built a tool called S p I n E that implements these inference rules and have evaluated it on standard shape analysis benchmark programs. Our experiments show that S p I n E can generate expressive summaries, which are complete functional specifications in many cases.

  • SAS - Bottom-Up Shape Analysis
    Static Analysis, 2009
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from the Hoare triples of its component Statements. These inference rules are used as the basis for a bottom-up shape analysis of programs. Specifically, we present a logic of iterated separation formula (LISF) which uses the iterated separating conjunct of Reynolds [17] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical formulas. We describe sound strong bi-abduction and satisfiability decision procedures for LISF. We have built a prototype tool that implements these inference rules and have evaluated it on standard shape analysis benchmark programs. Preliminary results show that our tool can generate expressive summaries, which are complete functional specifications in many cases.

  • Bottom-up shape analysis
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009
    Co-Authors: Bhargav S. Gulavani, Ganesan Ramalingam, Supratik Chakraborty, Aditya V. Nori
    Abstract:

    In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely\ncompositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing\nheap manipulating programs. Our inference rules are compositional: Hoare triples for a Compound Statement are computed from\nthe Hoare triples of its component Statements. These inference rules are used as the basis for a bottom-up shape analysis\nof programs.\n\nSpecifically, we present a logic of iterated separation formula (LISF) which uses the iterated separating conjunct of Reynolds\n[17] to represent program states. A key ingredient of our inference rules is a strong bi-abduction operation between two logical\nformulas. We describe sound strong bi-abduction and satisfiability decision procedures for LISF.\n\n\n\nWe have built a prototype tool that implements these inference rules and have evaluated it on standard shape analysis benchmark\nprograms. Preliminary results show that our tool can generate expressive summaries, which are complete functional specifications\nin many cases.