The XSB logic programming system v2.1, 2000. Available from http://www.cs.sunysb.edu/sbprolog.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on the XMC system [18] a system that has been developed by one of the authors of this paper. XMC can handle certain classes of infinite state systems by using implicit representation of state space using constraints. The XMC system is implemented using the XSB tabled logic programming system [22] by casting the model checking problem as a query evaluation problem. Tabling provides stronger termination properties for XSB in comparison with (untabled) logic programming systems. In particular, computations for solving equations using iterative procedures (e.g. fix point iteration) can be ....

The XSB logic programming system v2.1, 2000. Available from http://www.cs.sunysb.edu/sbprolog.

....properties are veri ed using reachability queries. This formulation exploits CLP s handling of constrained variables and hence can verify parametric systems (computing, for instance, values of parameters for which a given property holds) Since, however, their tool is based on SICStus Prolog [77], which does not allow tabling, no termination guarantees are given. In [33, 34] discrete, in nite state systems (e.g. the bakery algorithm) are represented as CLP programs, and CTL properties are veri ed by computing least and greatest xed points of the logical consequence operator. The ....

SICStus. The SICStus Prolog System, 2000. Available from http://www.sics.se/isl/sicstus.html.

....handheld computing devices that are small enough to carry everywhere. Chips performing computation and communication are being embedded into all sorts of appliances, enabling them to perform sophisticated operations and empowering them with network connectivity. Terms such as pervasive computing [5] have been coined to describe this tendency to integrate computing and communication into our daily lives. An even more futuristic view is held by MIT s Project Oxygen [16] which believes that in the future, computation will be freely available everywhere, like oxygen in the air we breathe. We ....

M. Dertouzos. The Future of Computing. Scientific American, August 1999. Available from http://www.sciam.com/1999/0899issue/0899dertouzos.html.

....space of the concurrent systems is explored only until the rst evidence of non bisimilarity is found. Note that when the systems are indeed bisimilar, the local checker explores the entire (reachable) state space. Even in this case, our bisimulation checker encoded in XSB logic programming system [13] shows performance comparable to the global bisimulation checker in CWB NC. For systems that are non bisimilar, the local checker outperforms the global checker by several orders of magnitude. Having established the baseline that logic programming based bisimulation checkers can indeed be ....

XSB. The XSB logic programming system v2.3, 2001. Available from http://www.cs.sunysb.edu/sbprolog. 15

....with varying degree of computational power, ranging from powerful server systems to embedded net enabled devices. A natural progression of this trend is leading toward an era when computing will be widely available and embedded in our environments, where it will be ubiquitous [27] or pervasive [8, 4]. The number of users of mobile computing devices has also been growing dramatically spanning the entire spectrum from laptop computers to hand held personal digital assistants, to more specialized devices such as cellular phones or portable music players. For applications running on mobile ....

M. Dertouzos. The Future of Computing. Scientic American, August 1999. Available from http://www.sciam.com/1999/0899issue/ 0899dertouzos.html.

.... specification, shortening the usual gap between theory and practice often found in logical based approaches to agents (Sadri and Toni, 1999) The system integrating Dynamic Logic Programming, LUPS and Abduction, to achieve this form of planning, has been implemented and tested on top of the XSB System (1999). This overall system allows for several forms of reasoning having many applications currently being explored. The paper is structured thus: After an introductory section to briefly recap Dynamic Logic Programming and LUPS, the planning problem in LUPS is formalized and its solutions ....

The XSB Group. The XSB logic programming system, version 2.0, 1999. Available from http://www.cs.sunysb.edu/sbprolog .

....crucial issue, but clear specification and correctness is, Logic Programming and Nonmonotonic Reasoning have been revived from the shade back into the spotlight. To this accrues the recent significant improvements in the e#ciency of Logic Programming implementations for Non monotonic Reasoning [5, 16, 18]. Besides allowing for a unified declarative and procedural semantics, eliminating the traditional wide gap between theory and practice, the use of several and quite powerful results in the field of non monotonic extensions to Logic Programming (LP) such as belief revision, inductive learning, ....

The XSB Group. The XSB logic programming system, version 2.0, 1999. Available from http://www.cs.sunysb.edu/~sbprolog.

....cellular infrastructure. We believe that the widespread deployment of location dependent applications inside office buildings and homes has the potential to fundamentally change the way we interact with our immediate environment, where computing elements will be ubiquitous [20] or pervasive [8, 4]. In particular, our work will enable a new class of location based applications and user interactions in the context of Project Oxygen at MIT [16] The design and deployment of a system for obtaining location and spatial information in an indoor environment is a challenging task for several ....

DERTOUZOS, M. The Future of Computing. Scientific American (Aug. 1999). Available from http://www.sciam. com/1999/0899issue/0899dertouzos.html.

....or results in an illegal page fault. Since the driver s page fault handler is a local thread, it can recover the driver thread to a consistent state on such an illegal page fault. 6 Performance Summary In an initial experiment, we compare le system performance using the Iozone reread benchmark [1]. All the data is from a 500 MHz, Pentium III with 64MB RAM. Iozone was run on three systems: 1) Linux 2.2.1; 2) L4Linux derived from Linux 2.2.1; and (3) SawMill Linux derived from Linux 2.2.1. For our analysis we have focused on reread throughput, in which Iozone reads a le twice and measures ....

The IOZone lesystem benchmark, April 2000. Available from http://www.iozone.org.

....by the Flick compiler. For both versions, we measured stub instructions and application performance. For our measurements, we used a Pentium III running at 500 MHz with 64 MB of main memory and a 540 MB IDE disk drive (IBM DALA 3540) 5. 2 Effects On IOzone Throughput The IOzone benchmark [1] begins by writing a file of 64kB, then it reads the contents twice. In the second read phase, all requests can be backed by the page cache. The performance of the second phase is completely determined by processor operations, basically for communication and for copying data into the user ....

The IOZone filesystem benchmark, April 2000. Available from http://www.iozone.org/.

....random walks, and graphs. Maps are a special class of graphs that are drawn in the plane. This is an active eld of research to which our seminar already dedicated several sessions last year. Further progress has been made recently; this is reported in [1] 2] 3] and [4] The talks [5] and [6] are concerned with other types of graph enumerations: those of non crossing con gurations in the plane and of constrained subgraphs of rectangular grids. Models of random automata have been developed recently. A simple class of automata is introduced in [7] and a random generation algorithm is ....

....J. Z. Gao. 2] Some Sharp Concentration Results about Random Planar Triangulations. J. Z. Gao. 3] Planar Maps and Composition Schemes. G. Schae er. 4] Coalescence: Emergence of the Map Airy Law. C. Banderier. 5] Enumeration of Geometric Con gurations on a Convex Polygon. M. Noy. [6] Tutte Polynomials in Square Grids. M. Noy. 7] Random Group Automata. C. Nicaud. 8] Solving Discrete Initial and Boundary Value Problems. M. Petkov sek. 9] Classifying ECO Systems and Random Walks. C. Banderier. 10] Combinatorics of Harmonic Polynomials. F. Bergeron. PART II. COMPUTER ....

[Article contains additional citation context not shown here]

The MPFR library. { Available from http://www.loria.fr/projets/mpfr/.

....refined in future when experiments or more detailed documentation reveal inconsistencies between the Splice implementation and its model. For this reason, it is important that the model is well documented in that modeling choices are explicitly reported. The language chosen for the model is crl[10], a language based on process algebra with data. The motivation for using this language is threefold: 1) the language has a well defined semantics; 2) there is a tool set available for generation of labelled transition systems which can be processed by a popular model checker as can be found in ....

....algebraic specifications and basic process algebra, an intuitive grasp of the syntax and semantics of the language. A reader with a weak background in these fields is referred to [1, 2] for introductions in process algebra and algebraic specifications. The syntax and semantics of crl are given in [10]. A crl specification consists of four parts. A definition of the data types by their signatures and equations, a definition of the actions with, possibly, data parameters, a definition of the processes constructed from these actions and process algebraic primitives, and finally, a definition of ....

Groote, J. F. The syntax and semantics of timed CRL. Tech. Rep. SEN-R9709, CWI, June 1997. Available from http://www.cwi.nl. References 24

....is not always a real issue, but clear speci cation and correctness is, Logic Programming and Non monotonic Reasoning have been brought (back) to the spot light. To this accrues the recent signi cant improvements in the eciency of Logic Programming implementations for Non monotonic Reasoning [8, 19, 23]. Besides allowing for a uni ed declarative and procedural semantics, eliminating the traditional high gap between theory and practice, the use of several and quite powerful results in the eld of non monotonic extensions to Logic Programming (LP) can represent an important added value to the ....

The XSB Group. The XSB logic programming system, version 2.0, 1999. Available from http://www.cs.sunysb.edu/~sbprolog.

....Rightname admin system all system Login Faher Fig. 4.4: DOM representation of users database through various interfaces, the ability to intelligently query our data sources becomes increasingly important. XQL (XML Query Language) was jointly designed by Texcel, webMethods and Microsoft [69, 72, 71] in response to the proposal of the World Wide Web Consortium [19] It is a notation for addressing and filtering the content of XML documents. XQL is a declarative rather than procedural language. The basic syntax for XQL mimics the directory navigation syntax. For example User=Parents=Parent ....

Jonathan Robie. The Design of XQL. Technical report, Texcel Research, 1999. Available from http://www.texcel.no/whitepapers/xql-design.html.

....to its range. However, the terms of the maps are constructed explicitly. Some operators are used to manipulate maps; among these are dom which reruns the domain of the map, rng returns the range of the map, override, merge, domain restriction, range restriction. All other operators can be found in [39]. Composite type A composite type corresponds to record types in programming languages. In VDM SL, there is a reserved prefix is for names which is used to determine which record type a record value belongs to. This can be compared to the operator instanceof of the Java programming language ....

The VDM Tool Group and The Institute of Applied Computer Science. The IFAD VDM-SL Language. IFAD, December 1996. Available from http://www.ifad.dk. Bibliography 90

....mostly recent. We present and analyse them using complexity models based on three di erent multiplication algorithms (naive, Karatsuba, and FFT) The MPFR library developed by Guillaume Hanrot and Paul Zimmermann is a C library for multiprecision oating point computations with exact rounding [6]. Its main purpose is to achieve eciency with a well de ned semantics. Beside the elementary operations , and , it provides routines for square root (with remainder in the integer case, without remainder in the oating point case) logarithm and exponential. The longer term goal is to ....

The MPFR library. { Available from http://www.loria.fr/projets/mpfr/.

....of the last syllable preceding the boundary. 4.2. Topic Segmentation Table 2 gives our results using correct and recognized words for each of the individual knowledge sources as well as the combined model. All results reflect the word averaged, weighted error metric used in the TDT 2 evaluations [18]. The TDT 2 metric gives more weight to false alarms than to misses, and our system was optimized accordingly using a twofold jackknifing of the test set. As shown, the error rate for the prosody model alone is lower than that for the language model, and combining both models gives a further ....

The Topic Detection and Tracking Phase 2 (TDT2) evaluation plan. Available from http://www.nist.gov/speech/tdt98/tdt98.htm, 1998.

....and is optimal in the number of threads needed for this application. 6. Related Work Over the years, many design methods have been proposed for real time system development, for example JSD, MASCOT, RTSA, DARTS, CODARTS [6] HRTHOOD [3] OCTOPUS [6, 1] ROOM [17] the ShlaerMellor method [21], and the TMO method [9] and most of these are based on the object paradigm. While some of these methods address schedulability analysis, it is mostly done by imposing many restrictions on the object model (e.g. HRTHOOD, and TMO) or using less sophisticated scheduling theory (e.g. ....

S. Shlaer and S. Mellor. The Shlaer-Mellor Method. Technical Paper, Project Technology, Inc. 1996. Available from http://www.projtech.com.

....of [1] is currently implemented on top of XSB Prolog integrating tabulation and abduction. It consists of a preprocessor for generating the dual program, plus a metainterpreter for the tabled evaluation of abductive goals. A preliminary metainterpreter for Abdual, written using the XSB system [104], is available from http: www.cs. sunysb.edu tswift. Work is currently being done in order to migrate some of the tabling mechanisms of ABDUAL, now taken care by the meta interpreter, into the XSB engine. Work is also underway on the XSB system so that the counfounded set removal operation can ....

The XSB Group. The XSB logic programming system, version 2.0. 1999. Available from http://www.cs.sunysb.edu/~sbprolog.

....veri es properties written in the alternation free fragment of the modal mu calculus [Koz83] for systems speci ed in XL, an extension of value passing CCS [Mil89] The XMC system is available from http: www.cs.sunysb.edu lmc. XMC is implemented atop the tabled logic programming system XSB [XSB00] Its initial implementation [RRR 97] consisted of two predicates trans 3, which encoded the SOS semantics of XL terms, and models 2, which encoded the semantics of mu calculus formulas. The predicate trans 3 computes the transition relation of the automaton corresponding to the given XL ....

The XSB Group. The XSB logic programming system v2.1, 2000. Available from http://www.cs.sunysb.edu/sbprolog.

....the loading token would reactivate the original token copy and let it execute the imported program. For space limitation reasons we do not show this example here that would require introducing concurrency related operators for handling multiple token queues and steering their status but refer to [22]. Finally, a third approach for executing active packets would be to create a new (virtual) SPR context on the fly and to forward the active packet to it for (sanboxed) execution. IV. NEW APPLICATIONS The Stored Program Router Model a generalization of basic network functionality in several ....

C. Tschudin, The Token Active Router Model (TARM), Working paper, Jun 1998. Available from http://www.docs.uu.se/tschudin/pub/cft-wp-tarm.pdf

....term. It gives satisfactory results for this application. It is possible to circumvent the analysis and to directly generate two level terms if it can be proven in advance that they are well annotated with respect to the analysis. Specialization is very fast. 6 We rely on the PGG system [33], which specializes extremely fast because it relies on the cogen approach to program specialization [19] In this approach, there is no interpretation of two level terms. Instead, two level terms are executed directly using a fast implementation of the code generating constructs [32] Proving ....

.... in linear time, and be applicable with all specialization techniques, e.g. online partial evaluation [38] o ine partial evaluation [17] type specialization [14] type directed partial evaluation [6] The translations presented in this work have been designed and tested using the PGG system [33], an o ine partial evaluator for Scheme. The results of the translation are comparable to those of Colcombet and Fradet [3] The results are similar for straight line code. For programs that involve function calls, their technique should yield better results because our translation does not ....

P. Thiemann. The PGG System|User Manual. Universitat Freiburg, Freiburg, Germany, Mar. 2000. Available from http://www.informatik. uni-freiburg.de/proglang/software/pgg/.

....or non linear inequalities cannot be fully analyzed. A graphtheoretic scheme treating simple linear inequalities was described. For more complex linear inequalities existing compilation techniques could be used. Benhmark source Paths (total) Feasible Paths False Paths ( jian [16] 7 3 57 fancy [17] 162 31 81 ex2 [2] 8 4 50 seat belt 12284 15 99.87 TABLE 2: Experimental Results Acknowledgments The authors would like to thank the following persons for their contribution: L. Besnard and T.P. Amagbegnon for the implementation of the HCDG and the BDD control representation in the context ....

The High-Level Synthesis `92 Benchmark suit, available from http://www.cbl.ncsu.edu/CBL_Docs/hls92.html

....Hence, it is not clear, which features of HTS are required to solve the TSP. The present paper argues that rst class polyvariant functions and co arity raising are sucient to solve the TSP. Contribution We have designed and implemented a partial evaluator for Scheme (as part of the PGG system [25]) that encorporates rst class polyvariant functions and co arity raising. We specify its behavior using a structural operational semantics. We de ne a generalized binding time analysis for the specializer and prove type soundness with respect to the operational semantics. We illustrate the use of ....

....functions and co arity raising is sucient to perform tag removal. This extension has been formalized using a type system with singleton types and a structural operational semantics. Type soundness has been proved. The extension is implemented in the author s partial evaluation system for Scheme [25]. In another work, we have shown that HTS can insert security checks according to a safety policy into potentially unsafe code [24] The structure of this problem is very similar to the TSP addressed in the present work. In the other work, we have to extend HTS by intersection types to address ....

Peter Thiemann. The PGG System|User Manual. Universitat Freiburg, Freiburg, Germany, March 2000. Available from http://www.informatik.unifreiburg. de/proglang/software/pgg/.

....on the security state (x 4.1.1) Section 5 brie y introduces type specialization. Second, we show that a traditional partial evaluator can also implement the heterogeneous approach (x 4.1. 2) This requires a novel extension by rst class memo tables, which we have implemented in our PGG system [36] and applied successfully to a range of examples. Third, in Section 4.2, we introduce a novel extension of type specialization by intersection types. This extension avoids unnecessary code duplication in the heterogeneous approach. Section 6 contains the formal background on the extension. Our ....

....tables were di erent. These problems, outof line code generation on demand and uni cation of memo tables, also arise in the implementation of poly in a type specializer. The current release of the PGG specialization system contains an experimental implementation of rst class memoization tables [36]. 4.1.3 Properties of the translation The translation preserves typing. Proposition 3 If e : then jj jj 1 jej 1 : j j 1 . To argue for the correctness of the method, de ne the function erase( that maps a two level term to a standard term by erasing all overlining and underlining ....

[Article contains additional citation context not shown here]

Peter Thiemann. The PGG System|User Manual. Universitat Freiburg, Freiburg, Germany, March 2000. Available from http://www.informatik. uni-freiburg.de/proglang/software/pgg/.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC