Results 11 to 20 of about 202,791 (96)

Region-based memory management for Mercury programs [PDF]

arXiv, 2012
Region-based memory management (RBMM) is a form of compile time memory management, well-known from the functional programming world. In this paper we describe our work on implementing RBMM for the logic programming language Mercury. One interesting point about Mercury is that it is designed with strong type, mode, and determinism systems. These systems
arxiv  

Practical Aspects for a Working Compile Time Garbage Collection System for Mercury [PDF]

arXiv, 2001
Compile-time garbage collection (CTGC) is still a very uncommon feature within compilers. In previous work we have developed a compile-time structure reuse system for Mercury, a logic programming language. This system indicates which datastructures can safely be reused at run-time.
arxiv  

Generic and Efficient Program Monitoring by trace analysis [PDF]

E. Jahier and M. Ducass'e "Generic Program Monitoring by Trace Analysis" in the Theory and Practice of Logic Programming journal, Volume 2 part 4&5, pp 613-645, September 2002, Special Issue Program Development, Cambridge University Press, 2003
Program execution monitoring consists of checking whole executions for given properties in order to collect global run-time information. Monitoring is very useful to maintain programs. However, application developers face the following dilemma: either they use existing tools which never exactly fit their needs, or they invest a lot of effort to ...
arxiv  

Checking modes of HAL programs [PDF]

Theory and Practice of Logic Programming: 5(6):623-668, 2005, 2004
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-time. Unfortunately, mode checking in such languages is difficult.
arxiv  

A Test Automation Framework for Mercury [PDF]

Proceedings of CICLOPS-WLPE 2010, 2010
This paper presents a test automation framework for Mercury programs. We developed a method that generates runnable Mercury code from a formalized test suite, and which code provides a report on execution about the success of test cases. We also developed a coverage tool for the framework, which identifies and provide a visualization of the reached ...
arxiv  

XSB: Extending Prolog with Tabled Logic Programming [PDF]

arXiv, 2010
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However the overriding reasons are practical.
arxiv  

Percolation modeling of hydraulic hysteresis in a porous media [PDF]

Computer Research and Modeling , 2014, vol. 6, no. 4, pp. 543-558 (Russian), 2013
In this paper we consider various models of hydraulic hysteresis in invasive mercury porosimetry. For simulating the hydraulic hysteresis is used isotropic site percolation on three-dimensional square lattices with $(1, d)$-neighborhood.
arxiv  

Source-to-source optimizing transformations of Prolog programs based on abstract interpretation [PDF]

arXiv, 2007
Making a Prolog program more efficient by transforming its source code, without changing its operational semantics, is not an obvious task. It requires the user to have a clear understanding of how the Prolog compiler works, and in particular, of the effects of impure features like the cut. The way a Prolog code is written - e.g., the order of clauses,
arxiv  

Estimating the overlap between dependent computations for automatic parallelization [PDF]

Theory and Practice of Logic Programming, 27th Int'l. Conference on Logic Programming (ICLP'11) Special Issue, volume 11, issue 4-5, pages 575-587. July 2011, 2011
Researchers working on the automatic parallelization of programs have long known that too much parallelism can be even worse for performance than too little, because spawning a task to be run on another CPU incurs overheads. Autoparallelizing compilers have therefore long tried to use granularity analysis to ensure that they only spawn off computations
arxiv  

Test for consistence of a flyby anomaly simulation with the observed Doppler residuals for the Messenger flybys of Mercury [PDF]

arXiv, 2010
In 2007, the observed Earth flyby anomalies have been successfully simulated using an empirical formula (H. J. Busack, 2007). This simulation has led to the prediction of anomaly values, to be expected for the Rosetta flybys of Mars in 2007, and following twice of Earth in 2007 and 2009.
arxiv