P. H. Hartel

Publication List Details

Period

1984 - 2009

Number

106

Co-Authors

Energy-Efficient Link-Layer Jamming Attacks against Wireless Sensor Network MAC Protocols (2009)

Law, Y.W., Palaniswami, M., Doumen, J.M., Hartel, P.H., Havinga, P.J.M.

A typical wireless sensor node has little protection against radio jamming. The situation becomes worse if energy-efficient jamming can be achieved by exploiting knowledge of the data link layer....

Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes (2009)

Ibraimi, L., Tang, Q., Hartel, P.H., Jonker, W.

In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the data is encrypted under an access policy defined by a user who encrypts the data and a user secret key is associated with a set...

A Taxonomy of Service Discovery Systems (2009)

Sundramoorthy, V., Hartel, P.H., Scholten, J.

Service discovery is a platform for network entities, whether hardware or software, to spontaneously self-configure and self-heal in a volatile environment. An in-depth understanding of the...

On the Cost and Benefits of Building a High-Quality Institutional Repository (2009)

Hartel, P.H.

Much has been written about the difficulties of getting staff and students to contribute to an Institutional Repository (IR). The most difficult objections of staff to deal with are lack of time, and...

Secure pairing with biometrics (2009)

Buhan, I.R., Boom, B.J., Doumen, J.M., Hartel, P.H., Veldhuis, R.N.J.

Secure pairing enables two devices that share no prior context with each other to agree upon a security association, which they can use to protect their subsequent communication. Secure pairing...

Panacea: Automating Attack Classification for Anomaly-based Network Intrusion Detection Systems (2009)

Bolzoni, D., Etalle, S., Hartel, P.H.

Anomaly-based intrusion detection systems are usually criticized because they lack a classication of attack, thus security teams have to manually inspect any raised alert to classify it. We present a...

Ciphertext-Policy Attribute-Based Threshold Decryption with Flexible Delegation and Revocation of User Attributes (extended version) (2009)

Ibraimi, L., Petkovic, M., Nikova, S.I., Hartel, P.H., Jonker, W.

In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), a user secret key is associated with a set of attributes, and the ciphertext is associated with an access structure or decryption policy over...

The Application of Fuzzy Logic Controller to Compute a Trust Level for Mobile Agents in a Smart Home (2009)

Nasution, S., Suryana, N., Shahib, S., Abu, N.A., Hartel, P.H.

Agents that travel through many hosts may cause a threat on the security of the visited hosts. Assets, system resources, and the reputation of the host are few possible targets for such an attack....

Portunes: generating attack scenarios by finding inconsistencies between security policies in the physical, digital and social domain (2009)

Dimkov, T., Pieters, W., Hartel, P.H.

The security goals of an organization are implemented through security policies, which concern physical security, digital security and security awareness. An insider is aware of these security...

Dynamic User Role Assignment in Remote Access Control (2009)

Saffarian, M., Tang, Q., Jonker, W., Hartel, P.H.

The Role-Based Access Control (RBAC) model has been widely applied to a single domain in which users are known to the administrative unit of that domain, beforehand. However, the application of the...

Adaptively Secure Computationally Efficient Searchable Symmetric Encryption (2009)

Sedghi, S., Van Liesdonk, P., Doumen, J.M., Hartel, P.H., Jonker, W.

Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as...

Panacea: Automating Attack Classification for Anomaly-based Network Intrusion Detection Systems (2009)

Bolzoni, D., Etalle, S., Hartel, P.H.

Anomaly-based intrusion detection systems are usually criticized because they lack a classication of attack, thus security teams have to manually inspect any raised alert to classify it. We present a...

Towards Secure and Practical MACs for Body Sensor Networks (2009)

Gong, Z., Hartel, P.H., Nikova, S.I., Zhu, Bo

Wireless sensor network (WSN) commonly requires lower level security for public information gathering, whilst body sensor network (BSN) must be secured with strong authenticity to protect personal...

Architecture-based Qualitative Risk Analysis for Availability of IT Infrastructures (2009)

Zambon, Emmanuele, Etalle, S., Wieringa, R.J., Hartel, P.H.

An IT risk assessment must deliver the best possible quality of results in a time-effective way. Organisations are used to customise the general-purpose standard risk assessment methods in a way...

Trust Level and Routing Selection for Mobile Agents in a Smart Home (2009)

Nasution, S., Hartel, P.H., Suryana, N., Azman, N., Shahib, S.

The central security concern for systems where agents roam is how to establish trust in the agent. We present a Fuzzy Logic mechanism to calculate a level of trust and an optimal route for a mobile...

Inter-domain Identity-Based Proxy Re-encryption (2009)

Tang, Q., Hartel, P.H., Jonker, W.

Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). So far, research efforts have only been devoted...

Policies for Probe-Wear Leveling in MEMS-Based Storage Devices (2009)

Khatib, M.G., Hartel, P.H.

Probes (or read/write heads) in MEMS-based storage devices are susceptible to wear. We study probe wear, and analyze the causes of probe uneven wear. We show that under real-world traces some probes...

Panacea: Automating Attack Classification for Anomaly-based Network Intrusion Detection Systems (2009)

Bolzoni, D., Etalle, S., Hartel, P.H.

Anomaly-based intrusion detection systems are usually criticized because they lack a classication of attack, thus security teams have to manually inspect any raised alert to classify it. We present a...

EFFICIENT TREE SEARCH Efficient Tree Search in Encrypted Data (2008)

R. Brinkman, L. Feng, J. Doumen, P. H. Hartel, W. Jonker

owadays the need grows to store data securely on an untrusted system. Think, for instance, of a remote database server administered by somebody else. If you want your data to be secret, you have to...

Contents (2008)

R. Corin, S. Etalle, P. H. Hartel, A. Mader

We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol,...

On Consistency Maintenance In Service Discovery (2008)

V. Sundramoorthy, P. H. Hartel, J. Scholten

Communication and node failures degrade the ability of a service discovery protocol to ensure Users receive the correct service information when the service changes. We propose that service discovery...

Cluster-based service discovery for heterogeneous wireless sensor networks (2008)

Marin-Perianu, R.S., Scholten, J., Havinga, P.J.M., Hartel, P.H.

We propose an energy-efficient service discovery protocol for heterogeneous wireless sensor networks that interact with the users in open and dynamic environments. Our solution exploits a cluster...

Towards an Information Theoretic Analysis of Searchable Encryption (2008)

Sedghi, S., Doumen, J.M., Hartel, P.H., Jonker, W.

Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the...

Method of Key Management (2008)

Zych, A.K., Doumen, J.M., Jonker, W., Hartel, P.H., Petkovic, M.

The invention relates to a method of key management for group-based controlled access to encrypted data, in which a decryption key for the encrypted data can be obtained by a party if the party is a...

Towards Tamper-Evident Storage on Patterned Media (2008)

Hartel, P.H., Abelmann, L., Khatib, M.G.

We propose a tamper-evident storage system based on probe storage with a patterned magnetic medium. This medium supports normal read/write operations by out-of-plane magnetisation of individual...

Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow (with appendix) (2008)

Hartel, P.H., Ruys, T.C., Geilen, M.C.W.

Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling optimisations. We...

A Type-and-Identity-based Proxy Re-Encryption Scheme and its Application in Healthcare (2008)

Ibraimi, L., Tang, Q., Hartel, P.H., Jonker, W.

Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). In a proxy re-encryption scheme, the delegator...

Inter-domain Identity-based Proxy Re-encryption (2008)

Tang, Q., Hartel, P.H., Jonker, W.

Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). So far, no particular research efforts have been...

Towards an Information Theoretic Analysis of Searchable Encryption (Extended Version) (2008)

Sedghi, S., Doumen, J.M., Hartel, P.H., Jonker, W.

Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the...

A generalized clustering algorithm for dynamic wireless sensor networks (2008)

Marin-Perianu, R.S., Hurink, J.L., Hartel, P.H.

We propose a general clustering algorithm for dynamic sensor networks, that makes localized decisions (1-hop neighbourhood) and produces disjoint clusters. The purpose is to extract and emphasise the...

On the inability of existing security models to cope with data mobility in dynamic organizations (2008)

Dimkov, T., Tang, Q., Hartel, P.H.

Modeling tools play an important role in identifying threats in traditional IT systems, where the physical infrastructure and roles are assumed to be static. In dynamic organizations, the mobility of...

On the inability of existing security models to cope with data mobility in dynamic organizations (2008)

Dimkov, T., Tang, Q., Hartel, P.H.

Modeling tools like Microsoft's TAM, play an important role in identifying threats in traditional IT systems, where the physical infrastructure and roles are assumed to be static. In dynamic...

A Type-and-Identity-based Proxy Re-Encryption Scheme and its Application in Healthcare (2008)

Ibraimi, L., Tang, Q., Hartel, P.H., Jonker, W.

Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). In a proxy re-encryption scheme, the delegator...

Workload-Based Configuration of MEMS-Based Storage Devices for Mobile Systems (2008)

Khatib, M.G., Miller, E.L., Hartel, P.H.

Because of its small form factor, high capacity, and expected low cost, MEMS-based storage is a suitable storage technology for mobile systems. However, flash memory may outperform MEMS-based storage...

Power Management of MEMS-Based Storage Devices for Mobile Systems (2008)

Khatib, M.G., Hartel, P.H.

Because of its small form factor, high capacity, and expected low cost, MEMS-based storage is a suitable storage technology for mobile systems. MEMS-based storage devices should also be energy...

Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow (2008)

Hartel, P.H., Ruys, T.C., Geilen, M.C.W.

Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling optimisations. We...

A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks (2008)

Marin-Perianu, R.S., Hurink, J.L., Hartel, P.H.

We propose a general clustering algorithm for dynamic sensor networks, that makes localized decisions (1-hop neighbourhood) and produces disjoint clusters. The purpose is to extract and emphasise the...

KALwEN: A New Practical and Interoperable Key Management Scheme for Body Sensor Networks (2008)

Law, Y.W., Moniava, G., Gong, Z., Hartel, P.H., Palaniswami, M.

Key management is the pillar of a security architecture. Body sensor networks(BSNs) pose several challenges -- some inherited from wireless sensor networks(WSNs), some unique to themselves -- that...

Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes (2008)

Ibraimi, L., Tang, Q., Hartel, P.H., Jonker, W.

In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the data is encrypted under an access policy defined by a user who encrypts the data and a user secret key is associated with a set...

Energy-Efficient Streaming Using Non-volatile Memory (2008)

Khatib, M.G., Hartel, P.H., Van Dijk, H.W.

The disk and the DRAM in a typical mobile system consume a significant fraction (up to 30%) of the total system energy. To save on storage energy, the DRAM should be small and the disk should be spun...

Using A Functional Notation To Specify Abstract Simulation Models (2007)

H. L. Muller, P. H. Hartel, L. O. Hertzberger

SIMULATION MODELS H.L. Muller P.H. Hartel L.O. Hertzberger University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, Holland Abstract Simulation is the process where a real world entity is modelled...

The Pseudoknot Functional Benchmark (2007)

P. H. Hartel

Functional language implementations are often stigmatised as being inefficient. Such a sweeping statement is unjustified. To show this we have benchmarked over 25 implementations of different...

The Pseudoknot Functional Benchmark (2007)

P. H. Hartel

Functional language implementations are often stigmatised as being inefficient. Such a sweeping statement is unjustified. To show this we have benchmarked over 25

Method and apparatus for deployment of high integrity software using static procedure return addresses (2007)

De Jong, E.K., Hartel, P.H.

A method for statically allocating a procedure return address includes separating a software program including multiple procedures into a cyclic part and an acyclic part, allocating a static address...

Timed Analysis of Security Protocols (2007)

Corin, R.J., Etalle, S., Hartel, P.H., Mader, A.H.

We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol,...

Interposing Flash between Disk and DRAM to Save Energy for Streaming Workloads (2007)

Khatib, M.G., Van Der Zwaag, B.J., Hartel, P.H., Smit, G.J.M.

In computer systems, the storage hierarchy, composed of a disk drive and a DRAM, is responsible for a large portion of the total energy consumed. This work studies the energy merit of interposing...

Towards compliant data retention with probe storage on patterned media (2007)

Hartel, P.H., Abelmann, L.

We describe how the compliance requirements for data retention from recent laws such as the US Sarbanes Oxley Act may be supported by a tamper-evident secure storage system based on probe storage...

Secure Ad-hoc Pairing with Biometrics: SAfE (2007)

Buhan, I.R., Doumen, J.M., Hartel, P.H., Veldhuis, R.N.J.

The pairing problem is to enable two devices, which share no prior context with each other, to agree upon a security association that they can use to protect their subsequent communication. Secure...

Interposing Flash between Disk and DRAM to Save Energy for Streaming Workloads (2007)

Khatib, M.G., Van Der Zwaag, B.J., Hartel, P.H., Smit, G.J.M.

In computer systems, the storage hierarchy, composed of a disk drive and a DRAM, is responsible for a large portion of the total energy consumed. This work studies the energy merit of interposing...

A Taxonomy of Self-configuring Service Discovery Systems (2007)

Sundramoorthy, V., Hartel, P.H., Scholten, J.

We analyze the fundamental concepts and issues in service discovery. This analysis places service discovery in the context of distributed systems by describing service discovery as a third generation...

Lambda Calculus for Engineers (2007)

Hartel, P.H., Vree, W.G.

In pure functional programming it is awkward to use a stateful sub-computation in a predominantly stateless computation. The problem is that the state of the subcomputation has to be passed around...

How migrating 0.0001% of address space saves 12% of energy in hybrid storage (2007)

Van Der Zwaag, B.J., Khatib, M.G., Hartel, P.H.

We present a simple, operating- system independent method to reduce the num- ber of seek operations and consequently reduce the energy consumption of a hybrid storage device consisting of a hard disk...

Cluster-based service discovery for heterogeneous wireless sensor networks (2007)

Marin-Perianu, R.S., Scholten, J., Havinga, P.J.M., Hartel, P.H.

We propose an energy-efficient service discovery protocol for heterogeneous wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service...

Interim research assessment 2003-2005 - Computer Science (2007)

Mouthaan, A.J., Hartel, P.H.

This report primarily serves as a source of information for the 2007 Interim Research Assessment Committee for Computer Science at the three technical universities in the Netherlands. The report also...

On consistency maintenance in service discovery (2006)

Sundramoorthy, V., Hartel, P.H., Scholten, J.

Communication and node failures degrade the ability of a service discovery protocol to ensure users receive the correct service information when the service changes. We propose that service discovery...

Method of Key Management (2006)

Zych, A.K., Doumen, J.M., Jonker, W., Hartel, P.H., Petkovic, M.

The invention relates to a method of key management for group-based controlled access to encrypted data, in which a decryption key for the encrypted data can be obtained by a party if the party is a...

Survey and Benchmark of Block Ciphers for Wireless Sensor Networks (2006)

Law, Y.W., Doumen, J.M., Hartel, P.H.

Cryptographic algorithms play an important role in the security architecture of wireless sensor networks (WSNs). Choosing the most storage- and energy-efficient block cipher is essential, due to the...

LicenseScript: A Logical Language for Digital Rights Management (2006)

Chong, C.N., Corin, R.J., Doumen, J.M., Etalle, S., Hartel, P.H., Law, Y.W., ...

We propose LicenseScript, a language for digital rights management (DRM) based on multiset rewriting and logic programming. LicenseScript enjoys a precise syntax and semantics, and it is rich enough...

Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks (2006)

Marin-Perianu, R.S., Scholten, J., Havinga, P.J.M., Hartel, P.H.

We propose an energy-efficient service discovery protocol for wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service registry. A...

Poseidon: a 2-tier Anomaly-based Network Intrusion Detection System (2006)

Bolzoni, D., Zambon, Emmanuele, Etalle, S., Hartel, P.H.

We present Poseidon, a new anomaly based intrusion detection system. Poseidon is payload-based, and presents a two-tier architecture: the first stage consists of a Self-Organizing Map, while the...

Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks (2006)

Marin-Perianu, R.S., Scholten, J., Havinga, P.J.M., Hartel, P.H.

We propose an energy-efficient service discovery protocol for wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service registry. A...

The Performance of a Second Generation Service Discovery Protocol In Response to Message Loss (2006)

Sundramoorthy, V., Van De Glind, G.J., Hartel, P.H., Scholten, J.

We analyze the behavior of FRODO, a second generation service discovery protocol, in response to message loss in the network. Earlier protocols, like UPnP and Jini rely on underlying network layers...

Performance Evaluation of a Cluster-Based Service Discovery Protocol for Heterogeneous Wireless Sensor Networks (2006)

Marin-Perianu, R.S., Scholten, J., Havinga, P.J.M., Hartel, P.H.

Abstract—This paper evaluates the performance in terms of resource consumption of a service discovery protocol proposed for heterogeneous Wireless Sensor Networks (WSNs). The protocol is based on a...

On Consistency Maintenance In Service Discovery (2005)

Sundramoorthy, V., Hartel, P.H., Scholten, J.

Communication and node failures degrade the ability of a service discovery protocol to ensure Users receive the correct service information when the service changes. We propose that service discovery...

The Performance of a Second Generation Service Discovery Protocol In Response to Message Loss (2005)

Sundramoorthy, V., Glind Van De, G.J., Hartel, P.H., Scholten, J.

We analyze the behavior of FRODO, a second generation service discovery protocol, in response to message loss in the network. First generation protocols, like UPnP and Jini rely on underlying network...

Functional Principles of Registry-based Service Discovery (2005)

Sundramoorthy, V., Tan, C., Hartel, P.H., Hartog Den, J.I., Scholten, J.

Abstract¿As Service Discovery Protocols (SDP) are becoming increasingly important for ubiquitous computing, they must behave according to predefined principles. We present the functional Principles...

Timed Analysis of Security Protocols (2005)

Corin, R., Etalle, S., Hartel, P.H., Mader, A.

We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol,...

A Diffie-Hellman based Key Management Scheme for Hierarchical Access Control (2005)

Zych, Anna, Doumen, Jeroen, Hartel, P.H., Jonker, Willem

All organizations share data in a carefully managed fashion by using access control mechanisms. We focus on enforcing access control by encrypting the data and managing the encryption keys. We make...

Functional Principles of Registry-based Service Discovery (2005)

Sundramoorthy, V., Tan, C., Hartel, P.H., Hartog Den, J.I., Scholten, J.

As Service Discovery Protocols (SDP) are becoming increasingly important for ubiquitous computing, they must behave according to predefined principles. We present the functional Principles of Service...

Functional principles of registry-based service discovery (2005)

V. Sundramoorthy, C. Tan, P. H. Hartel, J. Scholten

are becoming increasingly important for ubiquitous computing, they must behave according to predefined principles. We present the functional Principles of Service Discovery for robust, registry-based...

Timed Model Checking of Security Protocols (2004)

Corin, R., Etalle, S., Hartel, P.H., Mader, A.

We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol....

Efficient Tree Search in Encrypted Data (2004)

Brinkman, R., Feng, L., Doumen, J., Hartel, P.H., Jonker, W.

In this article we propose a new protocol that is more suitable for handling large amounts of semistructured XML data. This new protocol exploits the XML tree structure. XPath queries can be answered...

Efficient tree search in encrypted data (2004)

R. Brinkman, L. Feng, J. Doumen, P. H. Hartel, W. Jonker

Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted...

Democratic processing Mastering the complexity of communicating systems (2004)

Samenstelling Promotiecommissie, Rector Magnificus Voorzitter, Prof. Dr. P. H. Hartel

ter verkrijging van de graad van doctor aan de Technische Universiteit Delft, op gezag van de Rector Magnificus prof.dr.ir. J.T. Fokkema, voorzitter van het College voor Promoties, in het openbaar te...

Music2Share - Copyright-Compliant Music Sharing in P2P Systems (Invited paper) (2004)

Kalker, T., Epema, D.H.J., Hartel, P.H., Lagendijk, R.L., Van Steen, M.

Peer-to-Peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in...

Efficient Tree Search in Encrypted Data (2004)

Brinkman, R., Feng, L., Doumen, J.M., Hartel, P.H., Jonker, W.

Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual...

Modelling mobility aspects of security policies (Invited paper) (2004)

Hartel, P.H., Etalle, S., Wieringa, R.J.

Security policies are rules that constrain the behaviour of a system. Different, largely unrelated sets of rules typically govern the physical and logical worlds. However, increased hardware and...

Benchmarking Block Ciphers for Wireless Sensor Networks (Extended Abstract) (2004)

Law, Y.W., Doumen, J.M., Hartel, P.H.

Choosing the most storage- and energy-efficient block cipher specifically for wireless sensor networks (WSNs) is not as straightforward as it seems. To our knowledge so far, there is no systematic...

On Modelling Real-time and Security properties of Distributed Systems (Extended Abstract) (2003)

Corin, R.J., Etalle, S., Hartel, P.H., Mader, A.H.

We discuss a simplified version of the timing attack to illustrate a connection between security and real-time properties of distributed systems. We suggest several avenues for further research on...

Design Rationale for Secure Probe Storage based on Patterned Magnetic Media (2002)

Abelmann, L., Chong, C.N., Hartel, P.H., Lodder, J.C.

We describe the design rationale for a hardware tamper resistant secure storage system based on probe storage with a patterned magnetic medium. This medium supports normal read/write operations by...

Key Management with Group-Wise Pre-Deployed Keying and Secret Sharing Pre-Deployed Keying (2002)

Law, Y.W., Etalle, S., Hartel, P.H.

In wireless sensor networks, the key deployment problem has received little attention, whereas it is in fact fundamental, heavily involving crucial (scarce) resources of ad-hoc networks, such as...

iButton enrolment and verification times for the pressure sequence smartcard biometric (2001)

Henderson, N.J., White, N.M., Hartel, P.H.

With the growing number of smartcard applications there comes an increasing need to restrict access to the card itself. In previous work we proposed the pressure sequence biometric, within which a...

Declarative solutions to partitioned-grid problems (1999)

Etalle, S., Hartel, P.H., Vree, W.G.

The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment...

LETOS -- A Lightweight Execution Tool for Operational Semantics (1999)

Hartel, P.H.

A lightweight tool is proposed to aid in the development of operational semantics. To use LETOS an operational semantics must be expressed in its meta-language, which itself is a superset of Miranda....

Experience with a Clustered Parallel Reduction Machine (1993)

M. Beemster, P. H. Hartel, L. O. Hertzberger, K. G. Langendoen, L. L. Li, ...

A clustered architecture has been designed to exploit divide and conquer parallelism in functional programs. The programming methodology developed for the machine is based on explicit annotations and...

The Dutch Parallel Reduction Machine Project H.P. BARENDREGT, (1984)

P. H. Hartel, L. O. Hertzberger

universities of Amsterdam, Nijmegen and Utrecht started a cooperative project sponsored by the Dutch Ministry of Science and Education (Science Coun-cil). The first phase lasting until the end of...