Bolzoni, Damiano, Etalle, Sandro, Hartel, Pieter
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...
Annalisa Bossi, Sabina Rossi, Sandro Etalle
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing...
Annalisa Bossi, Nicoletta Cocco, Sabina Rossi, Sandro Etalle
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove...
ABSTRACT Integrity Constraints in Trust Management (Extended Abstract) ∗ (2008)
We introduce the use, monitoring, and enforcement of integrity constraints in trust management-style authorization systems. We consider what portions of the policy state must be monitored to detect...
Specifying, Verifying and Cracking Security Protocols, Logically (2008)
Giorgio Delzanno, Sandro Etalle
Introduction Cryptographic protocols are the essential means for the exchange of confidential information and for authentication. Their correctness and robustness are crucial for guaranteeing that an...
Unification-Free Prolog Programs Revisited (2007)
In this article are provided new simple conditions which allow us to conclude that in case of several well-known Prolog programs the unication algorithm can be replaced by iterated matching. As...
Logic Programming with Requests (2007)
Sandro Etalle, Femke Van Raamsdonk
We propose an extension of logic programming where the user can specify, together with the initial query, the information he is interested in by means of a request. This allows one to extract a...
Using Licenses, Kathy Cartrysse, Ricardo Corin, Marnix Dekker, Sandro Etalle, Gabriele Lenzini
Abstract In the vision of an ambient intelligent world, innumerable small interconnected devices will surround us and support us in our daily tasks and while at leisure. To do so, these devices need...
Semantics and termination of simply moded logic programs with dynamic scheduling (2007)
Sandro Etalle, Cwi Amsterdam, Sabina Rossi, Foscari Venezia, ...
In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection...
Uni#cation-free Prolog programs revisited (2007)
New, simple conditions are provided which allow the conclusion that in the case of several well-known Prolog programs the uni#cation algorithm can be replaced by iterated matching. As already noticed...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Recent logic programming languages employ dynamic scheduling of calls to improve eciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically \delayed " until...
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
The simultaneous replacement transformation operation, is here defined and studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt the set of...
Transformation Systems and Nondeclarative Properties (2007)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Program transformation systems are applied both in program synthesis and in program optimization. For logic programs the "logic " component makes transformations very natural and...
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
We propose a modular approach to termination proofs of general logic programs (i.e., logic programs with negation). Our approach follows the style introduced by Apt and Pedreschi for proving left...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Recent logic programming languages employ dynamic scheduling of calls to improve eciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically \delayed " until...
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
We propose a modular approach to termination proofs of logic programs with negation (i.e., general programs). We consider programs consisting of a hierarchy of modules and supply a general method for...
Annalisa Bossi, Nicoletta Cocco, Sabina Rossi, Sandro Etalle
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove...
Experimenting with linear search in (2007)
Richard Brinkman, Ling Feng, Sandro Etalle, Pieter Hartel, Willem Jonker
encrypted data
ATLANTIDES: An Architecture for Alert Verification in Network Intrusion Detection Systems (2007)
Damiano Bolzoni, Bruno Crispo, Sandro Etalle
We present an architecture designed for alert verification (i.e., to reduce false positives) in network intrusion-detection systems. Our technique is based on a systematic (and automatic)...
A Posteriori Compliance Control (2007)
Sandro Etalle, William H. Winsborough
While preventative policy enforcement mechanisms can provide theoretical guarantees that policy is correctly enforced, they have limitations in practice. They are inflexible when unanticipated...
Ubiquitous Privacy Protection (2007)
Bryce, Ciaran, Dekker, M.A.C, Etalle, Sandro, Le Métayer, Daniel, Le Mouël, Frédéric, Minier, Marine, ...
The main message of this position paper is that ubiquitous computing technology need not necessarily be an obstacle to privacy protection: if legal and social issues are given proper consideration,...
Ubiquitous Privacy Protection (2007)
Bryce, Ciaran, Dekker, M.A.C, Etalle, Sandro, Le Métayer, Daniel, Le Mouël, Frédéric, Minier, Marine, ...
The main message of this position paper is that ubiquitous computing technology need not necessarily be an obstacle to privacy protection: if legal and social issues are given proper consideration,...
APHRODITE: an Anomaly-based Architecture for False Positive Reduction (2006)
Bolzoni, Damiano, Etalle, Sandro
We present APHRODITE, an architecture designed to reduce false positives in network intrusion detection systems. APHRODITE works by detecting anomalies in the output traffic, and by correlating them...
POSEIDON: a 2-tier Anomaly-based Network Intrusion Detection System (2006)
Damiano Bolzoni, Sandro Etalle, Pieter Hartel
We present POSEIDON, a new anomaly-based network intrusion detection system. POSEIDON is payload-based, and has a two-tier architecture: the first stage consists of a Self-Organizing Map, while the...
Approaches in anomaly-based intrusion detection systems (2006)
Damiano Bolzoni, Sandro Etalle
Anomaly-based network intrusion detection systems can take into consideration packet headers, the payload, or a combination of both. We argue that payload-based approaches are becoming the most...
Poseidon: a 2-tier Anomaly-based Intrusion Detection System (2005)
Bolzoni, Damiano, Zambon, Emmanuele, Etalle, Sandro, Hartel, Pieter
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...
Integrity Constraints in Trust Management (2005)
Etalle, Sandro, Winsborough, William H.
We introduce the use, monitoring, and enforcement of integrity constraints in trust management-style authorization systems. We consider what portions of the policy state must be monitored to detect...
Poseidon: A 2-tier Anomaly-based Intrusion Detection System (2005)
Bolzoni, Damiano, Zambon, Emmanuele, Etalle, Sandro, Hartel, Pieter
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...
Trust in Virtual Communities (2005)
Czenko, Marcin, Doumen, Jeroen, Etalle, Sandro
The objective of our research in the context of the BSIK Freeband project I-SHARE is to provide a sophisticated trust management framework for virtual communities.
PS-LTL for Constraint-based Security Protocol Analysis (2005)
Corin, Ricardo, Saptawijaya, Ari, Etalle, Sandro
Several formal approaches have been proposed to analyse security protocols, e.g. [2,7,11,1,6,12]. Recently, a great interest has been growing on the use of constraint solving approach. Initially...
Overview of Security Research in EYES (2005)
Law, Yee Wei, Hartel, Pieter, Etalle, Sandro, Havinga, Paul, Di Pietro, Roberto, Mancini, Luigi
The security research for the EYES project is mainly carried out by the the Univ. of Rome La Sapienza and the Univ. of Twente. While Rome is primarily interested in key management, Twente has been...
Constructive Specifications for Compositional Units (2005)
ORNAGHI, MARIO, MOMIGLIANO, ALBERTO, Sandro Etalle
Constructive Specifications for Compositional Units / K.-K. Lau, A. Momigliano, M. Ornaghi. - (Lecture Notes in Computer Science ; 3573). - In: Logic Based Program Synthesis and Transformation :...
Constructive Specifications for Compositional Units (2005)
ORNAGHI, MARIO, MOMIGLIANO, ALBERTO, Sandro Etalle
Constructive Specifications for Compositional Units / K.-K. Lau, A. Momigliano, M. Ornaghi. - (Lecture Notes in Computer Science ; 3573). - In: Logic Based Program Synthesis and Transformation :...
A Trace Logic for Local Security Properties (2004)
Corin, Ricardo, Durante, Antonio, Etalle, Sandro, Hartel, Pieter
We propose a new simple \emph{trace} logic that can be used to specify \emph{local security properties}, i.e. security properties that refer to a single participant of the protocol specification. Our...
Termination of Simply Moded Logic Programs with Dynamic Scheduling (2004)
Bossi, Annalisa, Etalle, Sandro, Rossi, Sabina, Smaus, Jan-Georg
In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection...
Termination of Simply Moded Logic Programs with Dynamic Scheduling (2004)
Annalisa Bossi, Sandro Etalle, Cwi Amsterdam, Jan-Georg Smaus, Sabina Rossi, Foscari Venezia, ...
this article, we provide a sucient and necessary criterion for termination of input consuming derivations of simply moded logic programs. The termination criterion we propose is based on a...
StreamTo: Streaming Content Using a Tamper-Resistant Token (2004)
Jieyin Cheng, Cheun Ngen Chong, Jeroen Doumen, Sandro Etalle, Ro Etalle, Pieter H Hartel, ...
StreamTo uses tamper resistant hardware tokens to generate the key stream needed to decrypt encrypted streaming music. The combination of a hardware token and steaming media effectively brings tried...
LKHW: A Directed Diffusion-Based Secure Multicast Scheme for Wireless Sensor Networks (2003)
Di Pietro, Roberto, Mancini, Luigi V., Law, Yee Wei, Etalle, Sandro, Havinga, Paul
In this paper, we present a mechanism for securing group communications in Wireless Sensor Networks (WSN). First, we derive an extension of Logical Key Hierarchy (LKH). Then we merge the extension...
Termination of Simply Moded Logic Programs with Dynamic Scheduling (2003)
Bossi, Annalisa, Etalle, Sandro, Rossi, Sabina, Smaus, Jan-Georg
In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection...
EYES - Energy Efficient Sensor Networks (2003)
Havinga, Paul, Etalle, Sandro, Karl, Holger, Petrioli, Chiara, Zorzi, Michele, Kip, Harry, ...
The EYES project (IST-2001-34734) is a three years European research project on self-organizing and collaborative energy-efficient sensor networks. It will address the convergence of distributed...
Experimenting with linear search in encrypted data (2003)
Brinkman, Richard, Feng, Ling, Etalle, Sandro, Hartel, Pieter, Jonker, Willem
Song, Wagner and Perrig have published a theoretical paper about keyword search on encrypted textual data. We describe a prototype implementing their theory. Tests are carried out with this prototype...
Guess what? Here is a new tool that finds some new guessing attacks (2003)
Ricardo Corin, Sreekanth Malladi, Jim Alves-Foss, Sandro Etalle, Ro Etalle
If a protocol is implemented using a poor password, then the password can be guessed and verified from the messages in the protocol run. This is termed as a guessing attack. Published design and...
Experimenting with linear search in (2003)
Richard Brinkman, Ling Feng, Sandro Etalle, Pieter Hartel, Willem Jonker
encrypted data
Properties of Input-Consuming Derivations (2002)
Bossi, Annalisa, Rossi, Sabina, Etalle, Sandro
We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing...
On Modular Termination Proofs of General Logic Programs (2002)
Bossi, Annalisa, Rossi, Sabina, Cocco, Nicoletta, Etalle, Sandro
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove...
Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo
We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations that guarantee the input/output CCP semantics is...
Transformations of CCP programs (2001)
Etalle, Sandro, Gabbrielli, Maurizio, Meo, Maria Chiara
We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input/output CCP...
Properties of Input-Consuming Derivations (2001)
Bossi, Annalisa, Etalle, Sandro, Rossi, Sabina
We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing...
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (2001)
Bossi, Annalisa, Etalle, Sandro, Rossi, Sabina, Smaus, Jan-Georg
In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed selection rule...
Transformations of CCP programs (2001)
Etalle, Sandro, Gabbrielli, Maurizio, Meo, Maria Chiara
We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations that guarantee the input/output CCP semantics is...
2001. Semantics and termination of simplymoded logic programs with dynamic scheduling (2001)
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-georg Smaus
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a xed selection...
2001. Semantics and termination of simplymoded logic programs with dynamic scheduling (2001)
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-georg Smaus
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed...
Transformations of CCP programs (2001)
Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo
We introduce a transformation system for concurrent constraint programming (CCP). We dene suitable applicability conditions for the transformations which guarantee that the input/output ccp semantics...
On Modular Termination Proofs of General Logic Programs (2000)
Bossi, Annalisa, Cocco, Nicoletta, Etalle, Sandro, Rossi, Sabina
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove...
The Replacement Operation for CCP Programs (2000)
Bertolino, Marco, Etalle, Sandro, Palamidessi, Catuscia
The Replacement is a very powerful transformation operation which - both within the functional paradigm as well as within the logic programming one - can micic the most common transformation...
Semantics of Well-Moded Input-Consuming Programs (2000)
Bossi, Annalisa, Etalle, Sandro, Rossi, Sabina
Recent logic programming languages employ dynamic scheduling of calls to improve efficiency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically "delayed" until their...
The lazy functional side of logic programming (2000)
The possibility of translating logic programs into functional ones has long been a subject of investigation. Among the dierent proposals we nd [9, 10, 8, 12, 13, 15]. Common to all the approaches...
The (Lazy) Functional Side of Logic Programming (2000)
The possibility of translating logic programs into functional ones has long been a subject of investigation. Common to the many approaches is that the original logic program, in order to be...
The Replacement Operation for CCP Programs (2000)
Marco Bertolino, Sandro Etalle, Catuscia Palamidessi
. The replacement is a very powerful transformation operation which { both within the functional paradigm as well as within the logic programming one { can mimic the most common transformation...
Declarative Solutions to Partitioned-Grid Problems (2000)
Sandro Etalle, Pieter H. Hartel, Willem G. Vree
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...
Semantics of Input-Consuming Logic Programs (2000)
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic...
Semantics of Input-Consuming Logic Programs (2000)
Annalisa Bossi Sandro, Sandro Etalle, Sabina Rossi
Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic...
Etalle, Sandro, Gabbrielli, Maurizio
Modes were introduced in logic programming to differentiate the input arguments of a predicate from its output arguments. This information can be used for verifying the most diverse properties of...
Etalle, Sandro, Smaus, Jan-Georg
This volume contains the proceedings of the Workshop on Verification of Logic Programs, organised within the 1999 International Conference on Logic Programming. The workshop took place on December 1,...
Etalle, Sandro, Gabbrielli, Maurizio
Modes were introduced in logic programming to differentiate the input arguments of a predicate from its output arguments. This information can be used for verifying the most diverse properties of...
The Replacement Operation for CCP Programs (1999)
Bertolino, Marco, Etalle, Sandro, Palamidessi, Catuscia
The Replacement is a very powerful transformation operation which - both within the functional paradigm as well as within the logic programming one - can micic the most common transformation...
Etalle, Sandro, Gabbrielli, Maurizio
Modes were introduced in logic programming to differentiate the input arguments of a predicate from its output arguments. This information can be used for verifying the most diverse properties of...
Logic Programming with Requests (1999)
Sandro Etalle, Femke Van Raamsdonk
We propose an extension of logic programming where the user can specify, together with the initial query, the information he is interested in by means of a request. This allows one to extract a...
A semantics for modular general logic programs (1998)
Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial...
A semantics for modular general logic programs (1998)
Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial...
A semantics for modular general logic programs (1998)
Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial...
Unfold/fold transformations of CCP programs (1998)
Sandro Etalle, Maurizio Gabbrielli
We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input/output CCP...
Beyond Success and Failure (1998)
Sandro Etalle, Femke Van Raamsdonk
We study a new programming framework based on logic programming where success and failure are replaced by predicates for adequacy and inadequacy. Adequacy allows to extract a result from a partial...
Partial Evaluation of Concurrent Constraint Languages (1998)
Sandro Etalle, Maurizio Gabbrielli
this paper we will substantiate our claims.
Unfold/Fold Transformations of CCP programs (1998)
Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo
. We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input/output ccp...
A Semantics for Modular General Logic Programs (1998)
Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial...
Beyond Success and Failure (1998)
Sandro Etalle, Femke Van Raamsdonk
We study a new programming framework based on logic programming where success and failure are replaced by predicates for adequacy and inadequacy. Adequacy allows to extract a result from a partial...
Unfold/Fold Transformations of CCP programs (1998)
Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo
. We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input/output ccp...
Partial Evaluation of Concurrent Constraints Languages (1998)
Sandro Etalle, Maurizio Gabbrielli
this paper we will substantiate our claims.
A Transformation System for CLP with Dynamic Scheduling and ccp (1997)
Sandro Etalle, Maurizio Gabbrielli, Elena Marchiori
In this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (ccp). We define suitable applicability...
Transformations of CLP modules (1996)
Etalle, Sandro, Gabbrielli, Maurizio
We propose a transformation system for Constraint Logic Programming (CLP) aprograms and modules. The framework is inspired by the one of [37] for pure logic programs. However, the use of CLP allows...
Transformations of CLP modules (1996)
Etalle, Sandro, Gabbrielli, Maurizio
We propose a transformation system for Constraint Logic Programming (CLP) aprograms and modules. The framework is inspired by the one of [37] for pure logic programs. However, the use of CLP allows...
Etalle, Sandro, Gabbrielli, Maurizio
We introduce here layered modes, an extension of existing mode systems which allow us to enlarge the class of programs which can be verified by sung modes. In particular, we show that this extension...
Transformations of CLP modules (1996)
Etalle, Sandro, Gabbrielli, Maurizio
We propose a transformation system for Constraint Logic Programming (CLP) aprograms and modules. The framework is inspired by the one of [37] for pure logic programs. However, the use of CLP allows...
Simultaneous replacement in normal programs (1996)
A. Bossi, N. Cocco, S. Etalle, Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
The simultaneous replacement transformation operation, is here defined and studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt the set of...
On the Correctness of the Replacement Operation for CLP Modules (1996)
Sandro Etalle, Editorial Board, H. Ait-kaci, L. Augustsson, Ch. Brzoska, J. Darlington, ...
In this paper we study the replacement transformation for Constraint Logic Programming modules. We define new applicability conditions that guarantee the correctness of the operation also wrt...
On the Correctness of the Replacement Operation for CLP Modules (1996)
Sandro Etalle, Maurizio Gabbrielli
In this paper we study the replacement transformation for Constraint Logic Programming modules. We define new applicability conditions which guarantee the correctness of the operation also wrt...
A Compositional Semantics for Normal Open Programs (1996)
In this paper we propose a semantics for first order modular (open) programs. Modular programs are built as a combination of separate modules, which may evolve separately, and be verified separately....
Sandro Etalle, Maurizio Gabbrielli
this paper we introduce layered modes, an extension of the standard definition of mode based on the idea of associating also a timing to each atom position. This determines a precedence relation...
Simultaneous Replacement in Normal Programs (1996)
BOSSI, ANNALISA, COCCO, NICOLETTA, ETALLE, SANDRO
The simultaneous replacement transformation operation is here defined and studied w.r.t. normal programs. We give applicability conditions able to ensure the correctness of the operation w.r.t. the...
The replacement operation for CLP modules (1995)
Etalle, Sandro, Gabbrielli, Maurizio
In this paper we study the replacement transformation for Constraint Logic Programming modules. We define new applicabihty conditions which guarantee the correctness of the operation also wrt...
Transformations of CLP Modules (1995)
Sandro Etalle, Maurizio Gabbrielli
We propose a transformation system for Constraint Logic Programming (CLP) programs and modules. The framework is inspired by the one of Tamaki and Sato for pure logic programs [37]. However, the use...
A Transformation System for Modular CLP Programs (1995)
We propose a transformation system for CLP programs and modules. The framework is inspired by the one of Tamaki and Sato for pure logic programs [19]. Here, the use of CLP allows us to introduce some...
Transforming acyclic programs (1994)
Bossi, Annalisa, Etalle, Sandro
An unfold/fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the...
Transforming acyclic programs (1994)
Bossi, Annalisa, Etalle, Sandro
An unfold/fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the...
Transforming acyclic programs (1994)
Bossi, Annalisa, Etalle, Sandro
An unfold/fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the...
Declarative solutions to partitioned-grid problems (1994)
Ro Etalle, Sandro Etalle, Pieter H. Hartel, Pieter H. Hartel, Willem G. Vree, Willem G. Vree
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...
Transforming Acyclic Programs (1994)
A. Bossi, S. Etalle, Annalisa Bossi, Sandro Etalle
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the...
Transforming Acyclic Programs (1994)
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the...
On the unification free Prolog programs (1993)
K. R. Apt, S. Etalle, Krzysztof R. Apt, Sandro Etalle
We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here are...
On the Unification Free Prolog Programs (1993)
Krzysztof R. Apt, Sandro Etalle
. We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here...
Trust Management in P2P Systems Using Standard TuLiP (1970)
Marcin Czenko, Jeroen Doumen, Sandro Etalle
In this paper we introduce Standard TuLiP - a new logic based Trust Management system. In Standard TuLiP, security decisions are based on security credentials, which can be issued by different...
Giorgio Delzanno, Sandro Etalle
Abstract. In [11] we developed a proof theoretic method for the speci-cation and the verication of security protocols in which protocol rules are described via rst order theories and the interaction...
Properties of Input-Consuming Derivations
Annalisa Bossi, Sandro Etalle, Sabina Rossi
We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations do not employ a fixed selection rule, and can be used to model the behaviour of logic...
Properties of Input-Consuming Derivations
Annalisa Bossi, Sabina Rossi, Sandro Etalle
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing...