|
| |
| | Abstract machine - Wikipedia, the free encyclopedia |
 | | In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory). | | | An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system. | | | An abstract machine implemented as a software simulation, or for which an interpreter exists, is called a virtual machine. |
|
http://en.wikipedia.org/wiki/Abstract_machine
(295 words)
|
|
| |
| | A Threaded Abstract Machine |
| | The machine we have designed is a distributed memory multiprocessor SPMD machine whose nodal model of execution is based on a paradigm of self-scheduling threads. | | | An abstract machine program is defined a collection of disjoint "threads" each made up of a sequence of abstract machine instructions. | | | Each node of our machine holds its own distinct copy of the abstract machine program P, and executes threads from that program in a manner that is independent of the state of any other node. |
|
http://www.cs.adelaide.edu.au/~idea/idea4/final/andreww.htm
(1249 words)
|
|
| |
| | [No title] |
| | A typical thing is for the abstract machine state to contain a way to lookup the value of a variable (sometimes called an environment or store.) The abstract machine state also includes the program (or expression) that we're evaluating. | | | Multiply of exp * exp Abstract machine states (aka configurations): essentially, the "memory" of a machine that is executing a program. | | | We can specify an operational semantics for a language by first defining the abstract syntax for the language, then define abstract machine states, and then define a transition relation between machine states. |
|
http://www.cs.cornell.edu/courses/cs411/2003fa/lecture_sep_1.txt
(873 words)
|
|
| |
| | [No title] |
| | It runs each virtual machine in the "user" mode so that the sensitive instructions are not executable; an attempt by a program to execute a sensitive instruction causes an interrupt, allowing the VMM to simulate that instruction in a way that does not disturb the computing environments of any other virtual machine. | | | The functions of an abstract machine are software routines contained inside the machine's perimeter; to the user, these functions look like extensions to the instruction set of the machine. | | | Abstract machines can be nested, and the outer machine may hide some of the instructions of the inner one. |
|
http://cne.gmu.edu/pjd/cs571f01/RES/virtmachdef.txt
(665 words)
|
|
| |
| | GANIMAM Documentation |
| | The instructions of an abstract machine are tailored to specific operations required to implement operations of a source language or even better for languages of the same language paradigm. | | | This means, that an abstract machine starts with all registers set to the default values given in the abstract machine specification and stacks and heaps are empty and then the initialization sequence is executed to set the values of registers, stack and heap cells. | | | After generating an implemenation of the abstract machine, the user can input an abstract machine program, execute it step by step and inspect the contents of each register or memory cell. |
|
http://rw4.cs.uni-sb.de/~ganimal/GANIMAM/doc
(1730 words)
|
|
| |
| | abstract machine from FOLDOC |
| | Such abstract machines are not intended to be constructed as hardware but are used in thought experiments about computability. | | | A virtual machine is an abstract machine for which an interpreter exists. | | | It may provide instructions which are closer to the language being compiled than any physical computer or it may be used to make the language implementation easier to port to other platforms. |
|
http://foldoc.org/?abstract+machine
(179 words)
|
|
| |
| | Machine Learning |
| | Machine learning of grammars finds a variety of applications in syntactic pattern recognition, adaptive intelligent agents, diagnosis, computational biology, systems modelling, prediction, natural language acquisition, data mining and knowledge discovery. | | | Abstract: "Machine learning has always been an integral part of artificial intelligence, and its methodology has evolved in concert with the major concerns of the field. | | | Machine learning refers to a system capable of the autonomous acquisition and integration of knowledge. |
|
http://www.aaai.org/AITopics/html/machine.html
(2951 words)
|
|
| |
| | [No title] |
| | Common principles of abstract machines come into play at three levels: the design of the specification language, the choice of graphical annotations to visualize higher-level abstractions and the use of the system to explore and better understand known and detect new principles. | | | Then we introduce common principles of abstract machines by first presenting the programming language concept and then its implementation in form of abstract machine instructions and compilation schemes. | | | In this paper we propose a design methodology based on our generator and as an example we design a functional abstract machine which turns out to be very similar to the categorial abstract machine. |
|
http://rw4.cs.uni-sb.de/users/diehl/abstracts.html
(1377 words)
|
|
| |
| | A Functional Correspondence between Evaluators and Abstract Machines |
| | The Categorical Abstract Machine, for example, has an instruction set, but Krivine's machine, the CEK machine, the CLS machine, and the SECD machine do not; they directly operate on lambda-terms instead. | | | We illustrate this bridge by deriving Krivine's abstract machine from an ordinary call-by-name evaluator and by deriving an ordinary call-by-value evaluator from Felleisen et al.'s CEK machine. | | | We formally compare the corresponding evaluators and we illustrate some relative degrees of freedom in the design spaces of evaluators and of abstract machines for the lambda-calculus with computational effects. |
|
http://www.brics.dk/RS/03/13
(218 words)
|
|
| |
| | What is a Turing Machine? |
| | Like a state of mind, the machine's internal configuration establishes the environment in which a decision is made. | | | Such a mechanism is now known as a Turing machine. | | | Each combination of symbol and state specifies what, if anything, needs to be done to a cell, in which direction to move after the action, and the state of the machine, that is, which set of instructions it will follow for its next move. |
|
http://www.science.gmu.edu/~jsteidel/801-prj/turing.html
(907 words)
|
|
| |
| | Abstract Machine Models |
| | The executions of the other machine models are shown in Figure 3, where the edges represent the dependences due to control flow and instructions at the same level execute at the same time. | | | The CD machine has perfect control dependence information, and thus, instructions that are not dependent upon a branch need not wait for it to be resolved. | | | The SP machine executes all of the instructions between mispredicted branches in parallel. |
|
http://suif.stanford.edu/papers/lam92/section3_3.html
(972 words)
|
|
| |
| | Untitled Document |
| | Well, an abstract machine is a virtual device that communicates with its environment using a well defined language suited to the level of tasks that it performs. | | | In this introductory module we consider the computer as a multi-level abstract machine. | | | The remainder of this module deals with the notions of translation and abstraction as they might be applied to a computer system. |
|
http://www.cit.gu.edu.au/~sdrew/cit1507/m1/m1_t1.htm
(516 words)
|
|
| |
| | ISO-PROLOG and the Warren Abstract Machine |
| | Kwon's machine which permits procedure definitions to be given a scope. | | | PAM(see abstract), developed at IBM Germany, where the abstract types are refined by polymorphic order-sorted types, as they appear in Protos-L, and implemented in the WAM extension | | | Constraint Logic Arithmetical Machine CLAM, developed at IBM Yorktown Heights, implementing the constraint logic programming language CLP(R), |
|
http://www.di.unipi.it/~boerger/prologwam.html
(193 words)
|
|
| |
| | [No title] |
| | Machine designers might expect binary representations to be untyped. | | | The programs interpreted by the abstract machines are represented as strings, and they appear to have been written by hand. | | | To describe a machine, we begin by specifying tokens and fields, which are the basic components of instructions. |
|
http://www.eecs.harvard.edu/~nr/pubs/specifying.html
(12937 words)
|
|
| |
| | [No title] |
| | In an abstract state machine it is possible for state variables to have complex nested data structures as their values, or come from infinite sets like real numbers. | | | Abstract state machines are more general than other kinds of machines and automata. | | | The run of this machine proceeds like this: In the first step, the values of all variables are their initial values. |
|
http://research.microsoft.com/fse/asml/doc/AsmL2_Tutorial.doc
(8925 words)
|
|
| |
| | Untitled Document |
| | Using the same concepts of levels of abstraction and abstract machines, it is possible to identify the abstract layers that make up a computer system. | | | Each abstract layer is a virtual machine with a well defined input language and output actions. | | | The language that is translated an interpreted is the language that we use to control the actions of a computer. |
|
http://www.cit.gu.edu.au/teaching/1507CIT/mod01/ct05m01t02s01.htm
(382 words)
|
|
| |
| | An abstract machine for memory-safe DEC Alpha machine code |
| | Because the experiments in this paper use the DEC Alpha assembly language, our abstract machine is essentially a high-level formal description of the Alpha architecture [19]. | | | To define how programs are executed, we define an abstract machine as a state-transition function, the essential core of which is shown in Figure 3. | | | Another interesting aspect of the abstract machine is the level of abstraction of our specification. |
|
http://www.cs.cmu.edu/~petel/papers/pcc/osdi/node4.html
(875 words)
|
|
| |
| | The Abstract Machine |
| | The semantics of the language is easily understood in terms of the instructions of the machine. | | | For simplicity, we will assume that the ideal machine's instructions are coded in variable-length instructions of one, two, three or more words. | | | Though we will describe the instructions in an ideal assembly language in which the names and parameters of an instruction remind us of their meaning, the machine language will consist of (n+1) words, where n is the number of parameters of the instruction. |
|
http://www.mcs.csuhayward.edu/~simon/handouts/4110/notes/pm.html
(1855 words)
|
|
| |
| | CSCI 4627, Spring 2005 |
| | The abstract machine has a (binary) machine language called the byte code, a (symbolic) assembly language and an interpreter that reads and executes a byte code. | | | We looked at a simple finite state machine and translated it into a function that reads a lexeme and returns a token. | | | We saw how to compute the closure of a set of LR(0) items, and how to construct a finite state machine that reads the shift-reduce parsing stack and tells the next action to perform, based on the lookahead token. |
|
http://www.cs.ecu.edu/~karl/4627/spr05
(982 words)
|
|
| |
| | The Tail Recursive SECD Machine |
| | The SECD machine implements the caller saves convention, which means that the callee is free to do as it pleases with the SEC (stack, environment, and code) part of an SECD's machine state. | | | The TR-SECD machine version of timed reduction is slightly more complex than the original SECD machine version because the step count differs depending on whether a call is tail recursive. | | | One method for producing verified implementations of programming languages is to formally derive them from abstract machines. |
|
http://www.cs.utexas.edu/users/boyer/ftp/nqthm/trsecd/trsecd.html
(2298 words)
|
|
| |
| | diagram / abstract |
| | In their capacities for emulation, computers "realize" abstract machines. | | | The formalization of machines by Gödel, Turing, von Neumann separated its "logical form" from its material basis of construction. | | | Algorithms are thought of today as abstract machines. |
|
http://www.christianhubert.com/hypertext/diagram___abstract.html
(817 words)
|
|
| |
| | A High-Performance Abstract Machine for Prolog and its Extensions |
| | A High-Performance Abstract Machine for Prolog and its Extensions | | | This paper reviews the evolution of the TOAM as a Prolog machine, describes the changes needed to support the extensions, and reports the result of a comparison of B-Prolog and many other systems. | | | Since then, the machine has been extended to support several extensions of Prolog, including even-driven action rules, constraint solving, and tabling. |
|
http://www.probp.com/whitepaper/whitepaper.html
(186 words)
|
|
| |
| | Abstract Machine Models |
| | The abstract machines we have used in our experiments are summarized in Table 1. | | | The fully relaxed machine is only constrained by the true data dependencies of the program and closely approximates the data disambiguation capabilities of an Oracle machine [LW92]. | | | To examine the performance properties of each of the reordering types we define a set of abstract machine models and analyze the potential parallelism that is available for each machine. |
|
http://www.cs.waikato.ac.nz/timewarp/wengine/papers/wp97_28/node3.html
(218 words)
|
|
| |
| | Citebase - An Abstract Machine for Unification Grammars |
| | Citebase - An Abstract Machine for Unification Grammars | | | Amalia is composed of data structures and a set of instructions, augmented by a compiler from the grammatical formalism to the abstract instructions, and a (portable) interpreter of the abstract instructions. | | | Towards a methodology for the design of abstract machines for logic programming languages. |
|
http://citebase.eprints.org/cgi-bin/citations?id=oai:arXiv.org:cmp-lg/9709013
(1340 words)
|
|
| |
| | [No title] |
| | Only the Tunes way is more generic and higher-level than ITS: because every thread may be running at some abstract level of computation, with an abstract instruction set that needn't be the raw CPU hardware with magic OS instructions. | | | Nonetheless, the implementation may use a lot of optimized assembly code everywhere: by use of reflection, where meta-objects can locally break objects' invariants, as long as the abstract invariant is restored whenever abstract observation takes place. |
|
http://lists.tunes.org/archives/tunes-lll/1997-June.txt
(829 words)
|
|
| |
| | Publications |
| | The Weka system is a full, industrial-strength implementation of essentially almost the state-of-the-art machine learning techniques, and it contains a framework, in the form of a Java class library, which supports applications that use embedded machine learning and even the implementation of new learning schemes. | | | However, user modeling poses a number of challenges for machine learning that have hindered its application in user modeling, including: the need for large data sets; the need for labelled data; concept drift; and computational complexity. | | | The use of admissible search is of potential value to the machine learning community as it means that the exact learning biases to be employed for complex learning tasks can be precisely specified and manipulated. |
|
http://www.csse.monash.edu.au/~webb/cgi-bin/publications.cgi?showabstract=y&showkeywords=y
(14237 words)
|
|
| |
| | Abstract State Machines: Title Index |
| | "Abstract state machines and computationally complete query languages" | | | "Formal design of an abstract machine for constraint logic programming". | | | "Abstract State Machines: A Method for High-Level System Design and Analysis" |
|
http://www.eecs.umich.edu/gasm/titleindex.html
(1249 words)
|
|
| |
| | (E. Börger, D. Sona) A Neural Abstract Machine |
| | In an attempt to capture the fundamental features that are common to neural networks, we define a parameterized Neural Abstract Machine (NAM) in such a way that the major neural networks in the literature can be described as natural extensions or refinements of the NAM. | | | Keywords: abstract state machines, distributed computation, neural abstract machine, neural networks | | | The NAM provides a platform and programming language independent basis for a comparative mathematical and experimental analysis and evaluation of different implementations of neural networks. |
|
http://www.jucs.org/jucs_7_11/a_neural_abstract_machine
(138 words)
|
|
| |
| | Description of an abstract machine |
| | Constants in the tables are referred to by their index, starting at 0. | | | If the executable code for machine.c is in file machine, then command line | | | Each member of the array occupies a given number of consecutive words. |
|
http://www.cs.ecu.edu/~karl/4627/spr02/machine.html
(1828 words)
|
|
| |
| | The PL ideal abstract machine |
| | Each item starts with the integer opcode of the instruction, followed by its assembly language representation, followed by a brief description of the instruction. | | | We describe briefly each instruction of the PL machine. | | | It's memory consists of an array of integer words, addressed from 1 to some maximum. |
|
http://www.mcs.csuhayward.edu/~simon/handouts/4110/plam.html
(767 words)
|
|
| |
| | abstract machine - OneLook Dictionary Search |
| | abstract machine : Free On-line Dictionary of Computing [home, info] | | | abstract machine : Dictionary of Computing and Digital Media [home, info] | | | Phrases that include abstract machine: abstract machine notation, categorical abstract machine language, warren abstract machine |
|
http://www.onelook.com/cgi-bin/cgiwrap/bware/dofind.cgi?word=abstract+machine
(120 words)
|
|
| |
| | Citebase - Abstract Machine for Typed Feature Structures |
| | The core design of the abstract machine is given in detail, including the compilation process from a high-level language to the abstract machine language and the implementation of the abstract instructions. | | | A separate module deals with control structures and instructions to accommodate parsing for phrase structure grammars. | | | This paper describes an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. |
|
http://citebase.eprints.org/cgi-bin/citations?id=oai:arXiv.org:cmp-lg/9504009
(526 words)
|
|
| |
| | A Typed, Compositional Logic for a Stack-Based Abstract Machine Lambda the Ultimate |
| | Notable features of the logic include a careful treatment of auxiliary variables and quantification and the use of substructural typing to permit local, modular reasoning about program fragments. | | | A Typed, Compositional Logic for a Stack-Based Abstract Machine. | | | A Typed, Compositional Logic for a Stack-Based Abstract Machine |
|
http://lambda-the-ultimate.org/node/view/814
(364 words)
|
|
| |
| | Abstract Machine |
| | Foam is designed to contain only those concepts which can have an efficient realization in both Lisp and C. For example it is not possible to take an address of a variable because that would be inefficient in Lisp (a closure would be created). | | | The abstract machine does not support asharp types directly and relies on the code generator to produce appropriate calls to create and maintain types. | | | ``Foam'' is an acronym for ``First Order Abstract Machine.'' The abstract machine is first order in the sense that it does not treat its types as values. |
|
http://www.aldor.org/docs/reports/i94acomp/node9.html
(335 words)
|
|
| |
| | Trishula Records - Cutting edge psychedelic trance [© 2004-2006] |
| | The Abstract Machine: Welcome to the abstract machine, our dark network of twisted and magic nodes as a form of energy twisting between all things and unpredictable force of thousands of strange beings. | | | So take a ride with The Abstract Machine! | | | After their first release on Trishula Records' compilation "Ignis Fatuus" Megalopsy strikes back with their first solo album "The Abstract Machine". |
|
http://www.trishula-records.com/trishcd002.htm
(177 words)
|
|
| |
| | Energy Citations Database (ECD) - Energy and Energy-Related Bibliographic Citations |
| | Availability information may be found in the Availability, Publisher, Research Organization, Resource Relation and/or Author (affiliation information) fields and/or via the "Full-text Availability" link. | | | Energy Citations Database (ECD) Document #6293327 - Short note on achievable LIP rates using the Warren Abstract Prolog Machine | | | Short note on achievable LIP rates using the Warren Abstract Prolog Machine |
|
http://www.osti.gov/energycitations/product.biblio.jsp?osti_id=6293327
(94 words)
|
|
| |
| | Abstract machine |
| | "Abstract machines consist of unformed matters and non-formal functions. | | |
Each abstract machine can be considered a plateau of content and expression in continuity" (Deleuze & Guattari, A Thousand Plateaus) The suggested abstract machine is a virtual underlying self-combinatorial system. |
|
http://www.acadia.org/competition-98/sites/ntua.gr/archtech/con6.htm
(39 words)
|
|
| |
| | SatAM - Satchmo Abstract Machine (ResearchIndex) |
| | 1.0: An Abstract Machine for Model Generation with PHUR.. | | | 2 An abstract machine for model generation with PUHR tableaux (context) - von Drach, Geisler et al. | | | Abstract: Machine (System Description) Alexander von Drach, Tim Geisler, Sven Panne, David Sacher In: Proc 13th Workshop Logische Programmierung (WLP '98), TU Wien, Oct. 1998 http://www.pms.informatik.uni-muenchen.de/publikationen Forschungsbericht/Research Report PMS-FB-1998-9, May SatAM -- Satchmo Abstract Machine (System Description) Alexander von Drach, Tim Geisler, Sven Panne, and David Sacher Institut fur Informatik, Universitat Munchen, Oettingenstr. |
|
http://citeseer.ist.psu.edu/172745.html
(193 words)
|
|
| |
| | The Abstract State Machine Language |
| | It is an executable specification language based on the theory of Abstract State Machines. | | | Descriptions of some of this work along with more general research papers can be found on our web site. |
|
http://research.microsoft.com/fse/asml
(276 words)
|
|
| |
| | Abstract State Machines |
| | For a non-frame alternative to the Abstract State Machine home page, please proceed immediately to http://www.eecs.umich.edu/gasm/cover.html. |
|
http://www.eecs.umich.edu/gasm
(16 words)
|
|
| |
| | Categorical Abstract Machine Language from FOLDOC |
| | (Originally "CAML" - Categorical Abstract Machine Language) A version of ML by G. Huet, G. Cousineau, Ascander Suarez, Pierre Weis, Michel Mauny and others of INRIA and ENS. | | | Nearby terms: Cat 5 « catatonic « CATE « Categorical Abstract Machine Language » category » Category 3 » Category 5 |
|
http://foldoc.org/?Categorical+Abstract+Machine+Language
(210 words)
|
|
| |
| | ATGT Abstract State Machine Tests Generation Tool |
| | Rinzivillo, Using model checking to generate tests from ASM specifications, Dagstuhl Seminar No. 02101, Report No. 336, Theory and Application of Abstract State Machines, editors A. Blass, E. Börger, Y. Gurevich | | | Angelo Gargantini, Elvinia Riccobene, Salvatore Rinzivillo, Using Spin to Generate Tests from ASM Specifications, ASM 2003 - Taormina, Italy, March 2003. | | | Gargantini, E. Riccobene, ASM-based Testing: Coverage Criteria and Automatic Test Sequence Generation, JUCS, Volume 10 Number 8 (Nov 2001) |
|
http://www.dmi.unict.it/garganti/atgt
(185 words)
|
|
| |
| | Area Rugs - Modern Rugs - Floor Coverings - Contemporary Abstract Rug |
| | Order your floor coverings in the Contemporary Abstract design today. | | | These striking floor coverings will add a dramatic, colorful statement to any room. | | | The Confetti Collection offers the Contemporary Abstract floor coverings in a variety of sizes - there is one just right for you. |
|
http://www.homedecorators.com/detail.php?parentid=25422&aid=pt
(172 words)
|
|
|
