Christian-Albrechts-Universitat zu Kiel

Displaying 1-11 of 11 results

  • White Papers // May 2013

    TrIMPI: A Data Structure for Efficient Pattern Matching on Moving Objects

    Managing movement data efficiently often requires the exploitation of some indexing scheme. Taking into account the kind of queries issued to the given data, several indexing structures have been proposed which focus on spatial, temporal or spatio-temporal data. Since all these approaches consider only raw data of moving objects, they...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jun 2012

    Deciding Epistemic and Strategic Properties of Cryptographic Protocols

    In design and verification of cryptographic protocols, symbolic techniques [DY83] have proven very successful. A breakthrough result in this area is that secrecy properties of protocols can be decided in coNP, even if the adversary is allowed to send arbitrarily complex terms. The authors propose a new, widely applicable model...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jan 2012

    Integrated Privacy Modeling and Validation for Business Process Models

    Privacy is an important issue, inducing a strong interest in correct holistic treatment of data in processes and systems of enterprises. Besides avoiding infringements, trust in the correct holistic treatment of data increases the overall trust in an enterprise, gaining a competitive advantage. More and more, enterprises utilize Business Process...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Oct 2011

    A Generic Database Schema for CIDOC-CRM Data Management

    Database management currently assumes a relative stability of database structures and supports user viewpoints through a number of views. New users must either adopt their data demand to existing views or issue a request for support of their demands. The support for the second option is not feasible whenever user...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Aug 2011

    Implementing Equational Constraints in a Functional Language

    KiCS2 is a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. The implementation is based on the idea to represent the search space as a data structure and logic variables as operations that generate their values. This has the advantage that...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // May 2011

    KiCS2: A New Compiler From Curry to Haskell

    In this paper, the authors present their first steps towards a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. Their implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. This...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Nov 2010

    Transforming Functional Logic Programs into Monadic Functional Programs

    The authors present a high-level transformation scheme to translate lazy functional logic programs into pure Haskell programs. This transformation is based on a recent proposal to efficiently implement lazy non-deterministic computations in Haskell in a monadic style. They build on this work and define a systematic method to transform lazy...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Oct 2010

    Lazy and Enforceable Assertions for Functional Logic Programs

    Assertions or contracts are an important technique to improve the quality of software. Thus, assertions are also desirable for functional logic programming. Unfortunately, there is no established meaning of assertions in languages with a demand-driven evaluation strategy. Strict assertions are immediately checked but may influence the behavior of programs. Lazy...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Oct 2010

    Constructing a Bidirectional Transformation Between BPMN and BPEL With a Functional Logic Programming Language

    In this paper, the authors show how functional logic programming techniques can be used to construct a bidirectional transformation between structured process models of the Business Process Modeling Notation (BPMN) and executable models of the Business Process Execution Language (BPEL). They specify the abstract syntax of structured process models by...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jan 2010

    Computationally Secure Two-Round Authenticated Message Exchange

    The authors prove secure a concrete and practical two-round authenticated message exchange protocol which reflects the authentication mechanisms for web services discussed in various standardization documents. The protocol consists of a single client request and a subsequent server response and works under the realistic assumptions that the responding server is...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jul 2009

    A Simulation-Based Treatment of Authenticated Message Exchange

    Simulation-based security notions for cryptographic protocols are regarded as highly desirable, primarily because they admit strong composability and, consequently, a modular design. In this paper, the authors give a simulation-based security definition for two-round authenticated message exchange and show that a concrete protocol, 2AMEX-1, satisfies the security property, that is,...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jun 2012

    Deciding Epistemic and Strategic Properties of Cryptographic Protocols

    In design and verification of cryptographic protocols, symbolic techniques [DY83] have proven very successful. A breakthrough result in this area is that secrecy properties of protocols can be decided in coNP, even if the adversary is allowed to send arbitrarily complex terms. The authors propose a new, widely applicable model...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jul 2009

    A Simulation-Based Treatment of Authenticated Message Exchange

    Simulation-based security notions for cryptographic protocols are regarded as highly desirable, primarily because they admit strong composability and, consequently, a modular design. In this paper, the authors give a simulation-based security definition for two-round authenticated message exchange and show that a concrete protocol, 2AMEX-1, satisfies the security property, that is,...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jan 2010

    Computationally Secure Two-Round Authenticated Message Exchange

    The authors prove secure a concrete and practical two-round authenticated message exchange protocol which reflects the authentication mechanisms for web services discussed in various standardization documents. The protocol consists of a single client request and a subsequent server response and works under the realistic assumptions that the responding server is...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Aug 2011

    Implementing Equational Constraints in a Functional Language

    KiCS2 is a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. The implementation is based on the idea to represent the search space as a data structure and logic variables as operations that generate their values. This has the advantage that...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // May 2011

    KiCS2: A New Compiler From Curry to Haskell

    In this paper, the authors present their first steps towards a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. Their implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. This...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Oct 2010

    Lazy and Enforceable Assertions for Functional Logic Programs

    Assertions or contracts are an important technique to improve the quality of software. Thus, assertions are also desirable for functional logic programming. Unfortunately, there is no established meaning of assertions in languages with a demand-driven evaluation strategy. Strict assertions are immediately checked but may influence the behavior of programs. Lazy...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Nov 2010

    Transforming Functional Logic Programs into Monadic Functional Programs

    The authors present a high-level transformation scheme to translate lazy functional logic programs into pure Haskell programs. This transformation is based on a recent proposal to efficiently implement lazy non-deterministic computations in Haskell in a monadic style. They build on this work and define a systematic method to transform lazy...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Oct 2010

    Constructing a Bidirectional Transformation Between BPMN and BPEL With a Functional Logic Programming Language

    In this paper, the authors show how functional logic programming techniques can be used to construct a bidirectional transformation between structured process models of the Business Process Modeling Notation (BPMN) and executable models of the Business Process Execution Language (BPEL). They specify the abstract syntax of structured process models by...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Oct 2011

    A Generic Database Schema for CIDOC-CRM Data Management

    Database management currently assumes a relative stability of database structures and supports user viewpoints through a number of views. New users must either adopt their data demand to existing views or issue a request for support of their demands. The support for the second option is not feasible whenever user...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // May 2013

    TrIMPI: A Data Structure for Efficient Pattern Matching on Moving Objects

    Managing movement data efficiently often requires the exploitation of some indexing scheme. Taking into account the kind of queries issued to the given data, several indexing structures have been proposed which focus on spatial, temporal or spatio-temporal data. Since all these approaches consider only raw data of moving objects, they...

    Provided By Christian-Albrechts-Universitat zu Kiel

  • White Papers // Jan 2012

    Integrated Privacy Modeling and Validation for Business Process Models

    Privacy is an important issue, inducing a strong interest in correct holistic treatment of data in processes and systems of enterprises. Besides avoiding infringements, trust in the correct holistic treatment of data increases the overall trust in an enterprise, gaining a competitive advantage. More and more, enterprises utilize Business Process...

    Provided By Christian-Albrechts-Universitat zu Kiel