Heinrich Heine Universitat Dusseldorf

Displaying 1-12 of 12 results

  • White Papers // Jul 2011

    Partial Evaluation of Pointcuts

    This paper makes use of declarative languages, together with associated analysis and specialisation tools, to implement powerful and extensible query languages for aspect oriented programming. Pointcuts are predicates over events in the execution of a program, and are used to specify where an aspect should be applied. Expressive and extensible...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jun 2011

    Finding Deadlocks of Event-B Models by Constraint Solving

    Establishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is limited because in many industrial applications the state space is either infinite or much too large to be explored exhaustively. In this paper, the authors...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // May 2011

    Automatic Flow Analysis for Event-B

    In Event-B a system is developed using refinement. The language is based on a relatively small core; in particular there is only a very small number of substitutions. This results in much simpler proof obligations that can be handled by automatic tools. However, the downside is that, in case of...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Apr 2011

    Compact Vehicular Trajectory Encoding

    In Vehicular (V2X) communications, applications are designed to improve safety, efficiency and convenience of daily traffic. To this end, traffic participants run applications on their on-board computing units to collect and exchange information. Depending on the context of the particular application, this information ranges from mere collections of location waypoints...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jan 2011

    Node Control and a Charging and Accounting Approach to Ad-Hoc Networks

    Mobile Ad hoc NETworks (MANETs) are networks of mobile nodes with a limited transmission range. Despite this, it is possible to perform long-distance data transmissions through other mobile nodes in the system since every mobile node is simultaneously both an end-user and a router in such networks. On the other...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Oct 2010

    Allocation Removal by Partial Evaluation in a Tracing JIT

    The performance of many dynamic language implementations suffers from high allocation rates and run-time type checks. This makes dynamic languages less applicable to purely algorithmic problems, despite their growing popularity. In this paper, the authors present a simple compiler optimization based on online partial evaluation to remove object allocations and...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jul 2010

    Efficient Approximate Verification of B and Z Models Via Symmetry Markers

    The authors present a new approximate verification technique for falsifying the in-variants of B models. The technique employs symmetry of B models induced by the use of deferred sets. The basic idea is to efficiently compute markers for states, so that symmetric states are guaranteed to have the same marker...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Mar 2010

    Towards a Jitting VM for Prolog Execution

    Most Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes them hard to write. The authors present a high-level continuation-based Prolog interpreter written in RPython, a restricted subset of Python. This interpreter...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Mar 2010

    A Probabilistic Method for Cooperative Hierarchical Aggregation of Data in VANETs

    The authors propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed parameters directly, they propose soft-state sketches - an extension of Flajolet-Martin sketches - as a probabilistic approximation. This data representation is duplicating insensitive, a trait that overcomes two central...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Feb 2010

    Automated Property Verification for Large Scale B Models

    In this paper, the authors describe the successful application of the ProB validation tool on an industrial case study. The case study centres on the San Juan metro system installed by Siemens. The control software was developed and formally proven with B. However, the development contains certain assumptions about the...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // May 2009

    Towards Just-in-Time Partial Evaluation of Prolog

    The authors introduce a just-in-time specializer for Prolog. Just-in-time specialization attempts to unify of the concepts and benefits of Partial Evaluation (PE) and Just-In-Time (JIT) compilation. It is a variant of PE that occurs purely at run-time, which lazily generates residual code and is constantly driven by run-time feedback. Their...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // May 2009

    Lightweight Detection of Node Presence in MANETs

    While mobility in the sense of node movement has been an intensively studied aspect of Mobile Ad-hoc NETworks (MANETs), another aspect of mobility has not yet been subjected to systematic research: nodes may not only move around but also enter and leave the network. In fact, many proposed protocols for...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Apr 2011

    Compact Vehicular Trajectory Encoding

    In Vehicular (V2X) communications, applications are designed to improve safety, efficiency and convenience of daily traffic. To this end, traffic participants run applications on their on-board computing units to collect and exchange information. Depending on the context of the particular application, this information ranges from mere collections of location waypoints...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Mar 2010

    A Probabilistic Method for Cooperative Hierarchical Aggregation of Data in VANETs

    The authors propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed parameters directly, they propose soft-state sketches - an extension of Flajolet-Martin sketches - as a probabilistic approximation. This data representation is duplicating insensitive, a trait that overcomes two central...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // May 2009

    Lightweight Detection of Node Presence in MANETs

    While mobility in the sense of node movement has been an intensively studied aspect of Mobile Ad-hoc NETworks (MANETs), another aspect of mobility has not yet been subjected to systematic research: nodes may not only move around but also enter and leave the network. In fact, many proposed protocols for...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jan 2011

    Node Control and a Charging and Accounting Approach to Ad-Hoc Networks

    Mobile Ad hoc NETworks (MANETs) are networks of mobile nodes with a limited transmission range. Despite this, it is possible to perform long-distance data transmissions through other mobile nodes in the system since every mobile node is simultaneously both an end-user and a router in such networks. On the other...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jun 2011

    Finding Deadlocks of Event-B Models by Constraint Solving

    Establishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is limited because in many industrial applications the state space is either infinite or much too large to be explored exhaustively. In this paper, the authors...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // May 2011

    Automatic Flow Analysis for Event-B

    In Event-B a system is developed using refinement. The language is based on a relatively small core; in particular there is only a very small number of substitutions. This results in much simpler proof obligations that can be handled by automatic tools. However, the downside is that, in case of...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Oct 2010

    Allocation Removal by Partial Evaluation in a Tracing JIT

    The performance of many dynamic language implementations suffers from high allocation rates and run-time type checks. This makes dynamic languages less applicable to purely algorithmic problems, despite their growing popularity. In this paper, the authors present a simple compiler optimization based on online partial evaluation to remove object allocations and...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jul 2010

    Efficient Approximate Verification of B and Z Models Via Symmetry Markers

    The authors present a new approximate verification technique for falsifying the in-variants of B models. The technique employs symmetry of B models induced by the use of deferred sets. The basic idea is to efficiently compute markers for states, so that symmetric states are guaranteed to have the same marker...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Mar 2010

    Towards a Jitting VM for Prolog Execution

    Most Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes them hard to write. The authors present a high-level continuation-based Prolog interpreter written in RPython, a restricted subset of Python. This interpreter...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // May 2009

    Towards Just-in-Time Partial Evaluation of Prolog

    The authors introduce a just-in-time specializer for Prolog. Just-in-time specialization attempts to unify of the concepts and benefits of Partial Evaluation (PE) and Just-In-Time (JIT) compilation. It is a variant of PE that occurs purely at run-time, which lazily generates residual code and is constantly driven by run-time feedback. Their...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Feb 2010

    Automated Property Verification for Large Scale B Models

    In this paper, the authors describe the successful application of the ProB validation tool on an industrial case study. The case study centres on the San Juan metro system installed by Siemens. The control software was developed and formally proven with B. However, the development contains certain assumptions about the...

    Provided By Heinrich Heine Universitat Dusseldorf

  • White Papers // Jul 2011

    Partial Evaluation of Pointcuts

    This paper makes use of declarative languages, together with associated analysis and specialisation tools, to implement powerful and extensible query languages for aspect oriented programming. Pointcuts are predicates over events in the execution of a program, and are used to specify where an aspect should be applied. Expressive and extensible...

    Provided By Heinrich Heine Universitat Dusseldorf