Filters








413 Hits in 5.0 sec

Extracting Non-strict independent and-parallelism using sharing and freeness information [chapter]

Daniel Cabeza Gras, Manuel Hermenegildo
1994 Lecture Notes in Computer Science  
"Non-strict" independence (NSI) is a more relaxed notion than the traditional notion of "strict" independence (SI) which still ensures the relevant efficiency properties and can allow considerable more  ...  Logic programming systems which exploit and-parallelism among non-deterministic goals rely on notions of independence among those goals in order to ensure certain efficiency properties.  ...  using difference lists) in order to exploit the non-strictly independent and-parallelism it contains.  ... 
doi:10.1007/3-540-58485-4_48 fatcat:e7pjsvjfl5ctpdqnr5lxwwdmj4

Non-strict independence-based program parallelization using sharing and freeness information

Daniel Cabeza Gras, Manuel V. Hermenegildo
2009 Theoretical Computer Science  
However, extracting non-strict independence information from available analyses and domains is non-trivial.  ...  Keywords: Parallelism Automatic parallelization Abstract interpretation Abstract domains Sharing and freeness Non-strict independence Parallelizing compilers Declarative languages Logic programming The  ...  Manuel Hermenegildo was also supported in part by the Prince of Asturias Chair in Information Science and Technology at the U. of New Mexico.  ... 
doi:10.1016/j.tcs.2009.07.044 fatcat:mlyqfbx37bgrvah7tftagi7rni

Set-Sharing Is Not Always Redundant for Pair-Sharing [chapter]

Francisco Bueno, Maria Garcia de la Banda
2004 Lecture Notes in Computer Science  
We show that this is not the case when set-sharing is combined with other kinds of information, such as the popular freeness.  ...  Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) share.  ...  The above kind of information is used, for example, for detecting non-strict independence [6] as we will see in the next section.  ... 
doi:10.1007/978-3-540-24754-8_10 fatcat:dm3u64xhjnayth4zaej2zwkizy

Foreword

Moreno Falaschi, Maurizio Gabbrielli, Catuscia Palamidessi
2009 Theoretical Computer Science  
• Detecting Non-Strict Independence Using Sharing and Freeness Information for Automatic Parallelization of Logic Programs. Daniel Cabeza and Manuel Hermenegildo.  ...  This paper presents (some extension on) classic techniques for compile-time detection of non-strict independence based on extracting information from (abstract interpretation-based) analyses using the  ... 
doi:10.1016/j.tcs.2009.07.034 fatcat:z2ffxlhiwrebnk2ovcquuqgbt4

Set-sharing is redundant for pair-sharing

Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
2002 Theoretical Computer Science  
Indeed, Sharing encodes a lot of information.  ...  for the sharing information under investigation.  ...  A more powerful abstract unification operator has been defined in [10] , which exploits some non-trivial interactions between the sharing and the freeness components.  ... 
doi:10.1016/s0304-3975(00)00312-1 fatcat:vmcxqd5oozfutnaeqe2phkxskq

Set-sharing is redundant for pair-sharing [chapter]

Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
1997 Lecture Notes in Computer Science  
Indeed, Sharing encodes a lot of information.  ...  for the sharing information under investigation.  ...  A more powerful abstract unification operator has been defined in [10] , which exploits some non-trivial interactions between the sharing and the freeness components.  ... 
doi:10.1007/bfb0032733 fatcat:x4cyozrkh5bldeldi7jhaaugca

Towards independent and-parallelism in CLP [chapter]

María García de la Banda, Francisco Bueno, Manuel Hermenegildo
1996 Lecture Notes in Computer Science  
In this paper we propose a complete scheme for automatic exploitation of independent and-parallelism in CLP programs.  ...  Finally, we perform a preliminary evaluation of the efficiency, accuracy, and effectiveness of the approach by implementing a parallehzing compiler for CLP based on the proposed ideas and applying it on  ...  The parallel program obtained using a non-split method can always be executed using a grouping independence notion.  ... 
doi:10.1007/3-540-61756-6_78 fatcat:ixzbjux4uncgzjwjesgbx3bxnq

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs [chapter]

Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo
2008 Lecture Notes in Computer Science  
The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator.  ...  We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism.  ...  Our work in this paper will focus on goal-level (strict and non-strict) independent and-parallelism.  ... 
doi:10.1007/978-3-540-78769-3_10 fatcat:aik3wu5i5ja5noj55cwtin2l4m

Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism

K. Muthukumar, F. Bueno, M. García de la Banda, M. Hermenegildo
1999 The Journal of Logic Programming  
The methodology is generic in the sense of being able to deal with several different notions of independence, and incorporating the role of program analysis information independently of the domain used  ...  functional programming, Sarkar [68, 69] defines an algorithm for finding optimal linearizations of a graph into fork and join non-nested expressions, based on available information on granularity.  ...  We have recently developed an automatic parallelizer using non-strict independence [14] .  ... 
doi:10.1016/s0743-1066(98)10022-5 fatcat:b6zqfpcnhffoplaixwpy24r46m

Program Development Using Abstract Interpretation (And the Ciao System Preprocessor) [chapter]

Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García
2003 Lecture Notes in Computer Science  
This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system libraries), to generate and simplify  ...  , termination, non-failure, and bounds on resource consumption (time or space cost).  ...  ., Ben-Gurion U, and INRIA. The system documentation and related publications contain more specific credits.  ... 
doi:10.1007/3-540-44898-5_8 fatcat:hltqs6kn6vebbgiiarmbneebuy

Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García
2005 Science of Computer Programming  
This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system libraries), to generate and simplify  ...  The framework uses modular, incremental abstract interpretation to obtain information about the program.  ...  More info: For more information, full versions of papers and technical reports, and/or to download Ciao and other related systems please access: http://www.cliplab.org/.  ... 
doi:10.1016/j.scico.2005.02.006 fatcat:oioh3jlcivavfjq5oaaqr47t5a

Cloud And Parallel Network File System Using Authenticated Key Exchange Protocols

2016 International Journal of Science and Research (IJSR)  
., parallel Network File System (pNFS), which makes use of Kerberos to establish parallel session keys between clients and storage devices.  ...  We show that our protocols are capable of reducing up to approximately 90% of the workload of the metadata server and concurrently supporting forward secrecy and escrow-freeness.  ...  Main Idea Major goals of texture analysis in computer vision area unit to know, model and process texture. To extract the features from image use transforms and textures.  ... 
doi:10.21275/v5i5.nov163973 fatcat:zem74bm3wvbtjmvdsvey2egx4a

A sharing-based approach to supporting adaptation in service compositions

Dragan Ivanović, Manuel Carro, Manuel V. Hermenegildo
2012 Computing  
This sharing analysis approach can be used both at design time and at run time.  ...  A number of these properties can be expressed using a notion of sharing.  ...  We use a combined, abstract interpretation-based sharing, freeness, and groundness analysis for logic programs [30] , which computes abstract substitutions and freeness information as described in Sect  ... 
doi:10.1007/s00607-012-0230-z fatcat:hsgn7faqy5fgjavj2q5ydcmoim

What Security Can We Achieve Within 4 Rounds? [chapter]

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2016 Lecture Notes in Computer Science  
More recently, Ostrovsky, Richelson and Scafuro [ORS15] strengthened this construction by demonstrating a five-round protocol where additionally the underlying cryptographic primitives are used only in  ...  full security in the presence of non-aborting malicious adversaries corrupting the other party.  ...  Since A * can extract both x 0 and x 1 with non-negligible probability we conclude that A * violates the claw-freeness of the function family.  ... 
doi:10.1007/978-3-319-44618-9_26 fatcat:w3fcm25dxnbx5n74jk46viow6a

Parallel Logic Programming: A Sequel [article]

Agostino Dovier, Andrea Formisano, Gopal Gupta, Manuel V. Hermenegildo, Enrico Pontelli, Ricardo Rocha
2022 arXiv   pre-print
The goal of the survey is to serve not only as a reference for researchers and developers of logic programming systems, but also as engaging reading for anyone interested in logic and as a useful source  ...  Multi-core and highly-connected architectures have become ubiquitous, and this has brought renewed interest in language-based approaches to the exploitation of parallelism.  ...  Also, improved parallelization algorithms for non-strict independence (Hermenegildo and Rossi 1995) using sharing and freeness information have been proposed (Cabeza and Hermenegildo 2009) .  ... 
arXiv:2111.11218v2 fatcat:hek4fidju5fblprut2squ6o3rm
« Previous Showing results 1 — 15 out of 413 results