Filters








1,781 Hits in 1.8 sec

Page 52 of Journal of Research and Practice in Information Technology Vol. 21, Issue 2 [page]

1989 Journal of Research and Practice in Information Technology  
The WAM has nine special registers and a register file.  ...  The WAM uses structure copying to construct complex terms. This means that multiple copies of any structure are built on the heap as required, as opposed to sharing a single copy.  ... 

An Algorithm for Identifying the Isomorphism of Planar Multiple Joint and Gear Train Kinematic Chains

Yanhuo Zou, Peng He
2016 Mathematical Problems in Engineering  
In this paper, a new algorithm to identify the isomorphism of planar multiple joint and gear train kinematic chains has been presented.  ...  Firstly, the topological model (TM) and the corresponding weighted adjacency matrix (WAM) are introduced to describe the two types of kinematic chains, respectively.  ...  Acknowledgments This work is supported by the Science and Technology Project of Quanzhou City, 2014G48 and G20140047.  ... 
doi:10.1155/2016/5310582 fatcat:yrbnpvw6fbgfba3edpalp2orhe

1983–1993: The wonder years of sequential Prolog implementation

Peter Van Roy
1994 The Journal of Logic Programming  
Multiple specialization. Different calls of the same predicate frequently have different types in the same argument.  ...  A technique called entry specialization replaces built-ins by more specialized entry points depending on argument types known at compile time. l It is the first system to generate code which rivals the  ... 
doi:10.1016/0743-1066(94)90031-0 fatcat:kmwktuqn6ndovmlonzxyuxn5im

An extended Warren abstract machine for the execution of structured logic programs

Evelina Lamma, Paola Mello, Antonio Natali
1992 The Journal of Logic Programming  
As a matter of fact, contexts are represented as ordered lists of unit names and denote the union of the sets of clauses of the composing units.  ...  WARREN ABSTRACT MACHINE 189 of clauses, as happens in pure Prolog, g is evaluated by using a variable set of clauses determined by the current context of proof.  ...  Notice that you can have multiple occurrences of each unit in the context, i.e., multiple instances of the same unit U.  ... 
doi:10.1016/0743-1066(92)90011-q fatcat:k4653eakrfdi7e7zqw2ovbh3bq

A high speed prolog implementation on a VLIW processor

W. Schenk
1989 Microprocessing and Microprogramming  
The usage of the new retargetable compiler of the MSS for the development of a microcoded W-Code interpreter is described in this paper.  ...  The Warren Abstract Machine instruction set W-Code was choosen as the machine language of SAMP.  ...  Several authors have investigated various special purpose hardware structures Prolog machines that support the W-Code as their machine language.  ... 
doi:10.1016/0165-6074(89)90118-x fatcat:hhzfuzuel5dxziplawgsa3f3qq

The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines

PAUL TARAU
2011 Theory and Practice of Logic Programming  
With focus on its differences with conventional Warren Abstract Machine (WAM) implementations, we explain key details ofBinProlog's compilation technique, which replaces the WAM with a simplifiedcontinuation  ...  of its newer re-implementations as well as an overview of the most important architectural choices involved in their design.  ...  Special thanks go to Koen De Bosschere, Bart Demoen, Geert Engels, Ulrich Neumerkel, Satyam Tyagi and Peter Wilson for their contribution to the implementation of BinProlog and Jinni Prolog components.  ... 
doi:10.1017/s1471068411000433 fatcat:66os2n7mgvfmbgof4fvt5akdcm

The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines [article]

Paul Tarau
2011 arXiv   pre-print
With focus on its differences with conventional WAM implementations, we explain key details of BinProlog's compilation technique, which replaces the WAM with a simplified continuation passing runtime system  ...  We describe the BinProlog system's compilation technology, runtime system and its extensions supporting first-class Logic Engines while providing a short history of its development, details of some of  ...  Special thanks go to Koen De Bosschere, Bart Demoen, Geert Engels, Ulrich Neumerkel, Satyam Tyagi and Peter Wilson for their contribution to the implementation of BinProlog and Jinni Prolog components.  ... 
arXiv:1102.1178v1 fatcat:xk7uiec54fdl7mjdqxgwdxri2a

Precise interface identification to improve testing and analysis of web applications

William G.J. Halfond, Saswat Anand, Alessandro Orso
2009 Proceedings of the eighteenth international symposium on Software testing and analysis - ISSTA '09  
To address these limitations, we present a new approach for identifying web application interfaces that is based on a specialized form of symbolic execution.  ...  Accurate interface identification is fundamental for many of these techniques, as the components of a web application communicate extensively via implicitly-defined interfaces to generate customized and  ...  the web application code (wam-df and dfw).  ... 
doi:10.1145/1572272.1572305 dblp:conf/issta/HalfondAO09 fatcat:cj7uixyy3jeptfpb5agis5xmsu

The power of partial tanslation

Paul Tarau, Bart Demoen, Koen De Bosschere
1995 Proceedings of the 1995 ACM symposium on Applied computing - SAC '95  
The technique can be seen as an automatic specialization with respect to a given program of the traditional instruction folding techniques used to speed-up emulators.  ...  The main r&son for translating Prolog to C are 2. portability to multiple architectures; 3. stand alone executables.  ...  Acknowledgements Paul Tarau (tarau@info.umoncton.ca) thanks for support from NSERC (grant OGP0107411), from the FESR of the The code shown in this paper has been generated with Bin-Prolog 3.00, available  ... 
doi:10.1145/315891.315943 dblp:conf/sac/TarauDB95 fatcat:fllc7jicq5f2ljousoh2urzavu

Adiabatic quantum computing for finding low-peak-sidelobe codes

Gregory E. Coxson, Connie R. Hill, Jon C. Russo
2014 2014 IEEE High Performance Extreme Computing Conference (HPEC)  
The quantum algorithm shows roughly a 100 times speedup relative to the GA for binary codes longer that 100 bits and is capable of producing low sidelobe binary codes up to length 426 on the current D-Wave  ...  Results are presented for Doppler tolerant binary and quad-phase codes computed using the same quantum algorithm.  ...  A special case are the m th -root-ofunity codes, whose elements take values from the set of m th roots of unity, {e 2πi/m , e 4πi/m , . . . , 1}.  ... 
doi:10.1109/hpec.2014.7040953 dblp:conf/hpec/CoxsonHR14 fatcat:nsqid5mc6ra63dvcaz5i4s3lfu

Compiling dataflow analysis of logic programs

Jichang Tan, I-Peng Lin
1992 SIGPLAN notices  
Since abstract interpretation mimics standard interpretation, it is a promising alternative to compile abstract interpretation into the framework of the WAM (Warren Abstract Machine) for better performance  ...  To evaluate the possible benefits of this approach, a prototype dataflow analyzer has been implemented for inference of mode, type and variable aliasing information of logic programs.  ...  Preliminaries Warren Abstract Machine The basic idea of optimization is to generate specialized code for different caaes of source programs.  ... 
doi:10.1145/143103.143123 fatcat:wrqiqn6usred3pymnx2okpqu5u

Trade-offs between instantaneous and total capacity in multi-cell flash memories

Eyal En Gad, Anxiao Jiang, J. Bruck
2012 2012 IEEE International Symposium on Information Theory Proceedings  
other WAM codes with the same number of writes.  ...  We study the capacity of the new WAM codes with relative levels, where the information is represented by multiset permutations induced by the charge levels, and show that it achieves the capacity of any  ...  When we use a discrete model, the problem of designing update schemes with relative levels become a special case of the WAM problem.  ... 
doi:10.1109/isit.2012.6284712 dblp:conf/isit/GadJB12 fatcat:xhqwftkjk5eolaarre2hgjj7ei

Capturing the essentials of federated systems

Johannes Meinecke, Martin Gaedke, Frederic Majer, Alexander Brändle
2006 Proceedings of the 15th international conference on World Wide Web - WWW '06  
We introduce the WebComposition Architecture Model (WAM) as an overall modeling approach tailored to aspects of highly distributed systems with federation as an integral factor.  ...  The design and evolution of federated systems calls for models that give an overview of the structural as well as trust-specific composition and reflect the technical details of the various accesses.  ...  As a demonstration of how the schema types are instantiated in WAM-XML documents, we show an extract from an example model in the code listing below.  ... 
doi:10.1145/1135777.1135932 dblp:conf/www/MeineckeGMB06 fatcat:wvjnv6nffrgwjbpwbtey5u4kki

On the Implementation of GNU Prolog [article]

Daniel Diaz, Salvador Abreu, Philippe Codognet
2010 arXiv   pre-print
GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces standalone executables  ...  which don't rely on any byte-code emulator or meta-interpreter.  ...  Acknowledgements: The authors wish to acknowledge the anonymous reviewers who read early versions of this text and whose criticisms contributed to significantly improve its form and substance.  ... 
arXiv:1012.2496v2 fatcat:ykmu3xr72rcjbj5wprhmxvqvny

On the implementation of GNU Prolog

DANIEL DIAZ, SALVADOR ABREU, PHILIPPE CODOGNET
2011 Theory and Practice of Logic Programming  
AbstractGNU Prologis a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces stand-alone  ...  Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representations are materialized, in Unix compiler tradition.GNU Prologalso  ...  Acknowledgements The authors wish to acknowledge the anonymous reviewers who read early versions of this text and whose criticisms contributed to significantly improve its form and substance.  ... 
doi:10.1017/s1471068411000470 fatcat:4lyap34zeraspagmall4rzhuly
« Previous Showing results 1 — 15 out of 1,781 results