
	Where results make sense

Topic: Abstract machine

Related Topics

Abstract Machine Notation

Turing machine

Computer science

Computer

Analog computer

Automata theory

Finite state transducer

Recursively enumerable language

State diagram

Tree automaton

Enigma machine

Chomsky hierarchy

Input

Regular grammar

Formal language

	Abstract machine
		Abstraction means a processor design[?] which is not intended to be implemented as hardware, but which is the notional executor of a particular intermediate language (abstract machine language) used in a compiler or interpreter[?].
		A virtual machine is an abstract machine for which an interpreter exists.
		Such abstract machines are not intended to be constructed as hardware but are used in thought experiments about computability.
	www.ebroadcast.com.au /lookup/encyclopedia/ab/Abstract_machine.html (172 words)

	Abstract machine - Wikipedia, the free encyclopedia
		A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter.
		An abstract machine can also refer to a microprocessor design which has yet to be (or is not intended to be) implemented as hardware.
		An abstract machine implemented as a software simulation, or for which an interpreter exists, is called a virtual machine.
	en.wikipedia.org /wiki/Abstract_machine (301 words)

	abstract from FOLDOC
		In general an interpretation is characterised by the domains used to represent the basic types and the abstract values it assigns to constants (where the constants of a language include primitive functions such as *).
		Examples are abstract data types (the representation details are hidden), abstract syntax (the details of the concrete syntax are ignored), abstract interpretation (details are ignored to analyse specific properties).
		A parse tree is similar to an abstract syntax tree but it will typically also contain features such as parentheses which are syntactically significant but which are implicit in the structure of the abstract syntax tree.
	foldoc.org /?abstract (1438 words)

	Charles Babbage Institute: RESEARCH PROGRAM> Current research (Site not responding. Last check: 2007-09-11)
		The term “virtual machine” (abbreviated VM), as it has generally been used in computing technology, refers to an extension of the virtual memory (qv) concept to provide users with the appearance of a complete, private “machine” (i.e., processor, memory, and I/O) which has all of the characteristics of a real machine with no operating system.
		The user of the abstract machine gets to use the objects through a high-level (usable) interface and does not have to be concerned with inner details of implementation.
		Abstract machines can be nested, and the outer machine may hide some of the instructions of the inner one.
	www.cbi.umn.edu /shp/entries/virtualmachine.html (1375 words)

	P-code and the (abstract) P Machine (Site not responding. Last check: 2007-09-11)
		The P machine was developed to make the Zurich implementation of Pascal portable.
		The P-machine is a stack machine organized to simplify the implementation of block structured languages.
		P-codes are the machine language of the P-machine.
	cs.wwc.edu /~aabyan/Code/Documentation/doc/node71.html (346 words)

	Turing machine - Wikipedia, the free encyclopedia
		Studying their abstract properties yields many insights into computer science and complexity theory.
		Common equivalent models are the multi-tape Turing machine, machines with input and output, and the non-deterministic Turing machine (NDTM) as opposed to the deterministic Turing machine (DTM) for which the action table has at most one entry for each combination of symbol and state.
		Algorithms running on Turing-equivalent abstract machines are usually more general than their counterparts running on real machines, because they have arbitrary-precision data types available and never have to deal with unexpected conditions (including, but not limited to, running out of memory).
	en.wikipedia.org /wiki/Turing_machine (4208 words)

	Abstract Machine -- from Wolfram MathWorld
		An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer system works.
		Abstract machines that model software are usually thought of as having very high-level operations.
		An abstract machine implemented in software is termed a virtual machine, and one implemented in hardware is called simply a "machine."
	mathworld.wolfram.com /AbstractMachine.html (159 words)

	Internet Archive: Details: ML-Abstract machine EP
		All abstract machines are linked to other abstract machines: their operations are convergent.
		An abstract machine is an affect, or mode of engagement, they are also recurrently and fortuitously re-effectuated, in a sporadic process of re-emergence, intensification and tranfiguration of the mode of engagement involved.
		But the plane is the abstract machine of which assemblages are the working parts.
	www.archive.org /details/pmact3 (185 words)

	A Functional Correspondence between Evaluators and Abstract Machines (Site not responding. Last check: 2007-09-11)
		We bridge the gap between functional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations.
		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.
		Together, they show that Krivine's abstract machine and the CEK machine correspond to the call-by-name and call-by-value facets of an ordinary evaluator for the lambda-calculus.
	www.brics.dk /RS/03/13 (218 words)

	Description of an abstract machine
		Nonetheless, this abstract machine provides some features that are not used by the C
		This abstract machine maintains an array of global variables.
		The abstract machine has two constant tables, one holding integer constants and one holding real constants.
	www.cs.ecu.edu /~karl/4627/spr02/machine.html (1828 words)

	OOTLab - IOOS - ABSTRACT MACHINE
		The overall architecture and instruction set of the Carbayonia abstract machine, which is the substrate of the SO4 operating system and the Integral OO System Oviedo3 is briefly described here.
		Furthermore, and based on the experience of using reflection as a property of the machine to get flexible systems, a new machine designed from the ground up with computational reflection capabilities is being built (here, you can find more information).
		However, we are considering the possibility of using a new reflective machine that is being developed with the insight gained while building the Carbayonia Abstract Machine.
	www.di.uniovi.es /ioos/lab/vm.html (1412 words)

	Abstract Machine Models
		Since the BASE machine uses none of the three techniques, its control flow constraint is the most severe; it prevents instructions from executing before any preceding branches.
		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 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.
	suif.stanford.edu /papers/lam92/section3_3.html (972 words)

	diagram / abstract (Site not responding. Last check: 2007-09-11)
		The abstract machine is like the cause of the concrete assemblages that execute its relations; and these relations take place 'not above' but within the very tissue of the assemblages they produce." (Deleuze, Foucault, p.
		According to, Brian Massumi, "The abstract machine is interpretation.
		Christopher Alexander: "Any pattern which, by being abstracted from a real situation, conveys the physical influence of certain demands or physical forces is a diagram." (Notes on the Synthesis of Form, p.
	www.christianhubert.com /hypertext/diagram___abstract.html (817 words)

	Deriving a Lazy Abstract Machine - Sestoft (ResearchIndex)
		Abstract: Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural University Thorvaldsensvej 40, DK-1871 Frederiksberg C, Denmark E-mail: sestoft@dina.kvl.dk Version 6 of March 13, 1996 Abstract We derive a simple abstract machine for lazy evaluation of the lambda calculus, starting from Launchbury's natural semantics.
		48 From operational semantics to abstract machines: Preliminary..
		1 An abstract machine for the normalization of -terms (context) - North-Holland, Abstract et al.
	citeseer.ist.psu.edu /sestoft97deriving.html (589 words)

	Abstract Interactions
		If components interact only through abstract interfaces, a component is unaware whether it is invoking operations of a component in the same address space or a proxy for a component in a different address space.
		AbstractInteractions sounds like this "virtual engine" or "abstract machine" which defines the protocol of this "policy for interaction between abstract components with open implementations." It also seems related to GOF patterns like "Strategy", "Template Method", "Adapter", and "Facade" which encapsulate such policies and/or their pluggable mechanisms.
		The "machine" is "abstract", because only the skeleton is there, while the details are deferred.
	c2.com /cgi/wiki?AbstractInteractions (3589 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.
	www.mcs.csuhayward.edu /~simon/handouts/4110/notes/pm.html (1855 words)

	Citations: An abstract machine for CLP - Jaffar, Michaylov, Stuckey, Yap (ResearchIndex) (Site not responding. Last check: 2007-09-11)
		Citations: An abstract machine for CLP - Jaffar, Michaylov, Stuckey, Yap (ResearchIndex)
		Abstract machines for parallel programming languages As noted by Blair [18] parallel and distributed models converge due to trends towards high speed networks, platform....
		1 Implementation Issues The abstract domains described in Sections 6, 7, and 8 have been implemented within the PLAI abstract interpretation system [Muthukumar and Hermenegildo 1990; 1992] which is an incarnation of the....
	citeseer.ist.psu.edu /context/301704/0 (696 words)

	Machine Reads Abstract Thought (Site not responding. Last check: 2007-09-11)
		Signals from brain cells involved in abstract thinking have been decoded, an important step towards creating better prosthetic devices for paralyzed people.
		Working with monkeys, researcher Richard Andersen and colleagues at the California Institute of Technology in Pasadena recorded signals from neurons related to reaching movements and then decoded the signals using a computer.
		Future technologies based on this research could allow a paralyzed person's goal-directed thoughts to be interpreted with smart machines.
	www.infowars.com /print/ps/abstract_thought.htm (549 words)

	The PL ideal abstract machine
		The PL abstract machine is very similar to The Abstract Machine described in the notes.
		This is not surprising, since PL is also a block structured language, just like Pascal is. PL is however simpler than Pascal, and this is reflected in the PL abstract machine which is also simpler.
		The architecture of the PL machine is identical to that of the Pascal machine.
	www.mcs.csuhayward.edu /~simon/handouts/4110/plam.html (767 words)

	Abstract State Machine Tutorial (Site not responding. Last check: 2007-09-11)
		The advances in the theory, the tool development, and the progressive industrial employment of Abstract State Machines (ASMs) in the 90's have turned ASMs into a practical technique for disciplined rigorous system engineering in the large.
		simplifies the (mathematical or machine checked) justification of the correctness of the design offering a rigorous framework for the analysis of run-time properties at the appropriate level of abstraction.
		The execution of these rules is understood as updating, in the given state and in the indicated way, the value of the function f at the indicated parameters, leaving everything else unchanged.
	www.di.unipi.it /~boerger/ASMTutorialEtaps.html (1130 words)

	Amazon.ca: Abstract Machine Models for Highly Parallel Computers: Books: J. R. Davy (Site not responding. Last check: 2007-09-11)
		This book contains papers collected from the Second Workshop on Abstract Machine Models for Highly Parallel Computers, sponsored by the BCS Parallel Processing Specialist Group.
		abstract machine models, key issues for future research, and terminology.
		Models for general purpose parallel computing, declarative models, performance modelling, and special purpose parallel models are also covered.
	www.amazon.ca /Abstract-Machine-Models-Parallel-Computers/dp/0198537964 (283 words)

	Ian Jacob's paper abstract (via CobWeb/3.1 planetlab1.isi.jhu.edu) (Site not responding. Last check: 2007-09-11)
		In this paper, we present the formal description of an abstract machine.
		Though similar to the other well-established abstract machines ---SPAM (Simple Person's Abstract Machine), FNAM (French National Abstract Machine), JAM (Jelly-like Abstract Machine)--- the SHAM is more ``abstract'' without being any less ``machine''.
		The SHAM introduces the notion of meta-abstraction, or virtual abstraction, which is a notch more abstract than traditional abstraction, as the term suggests.
	www.w3.org.cob-web.org:8888 /People/Jacobs/sham.html (268 words)

	abstractmachine » 2002 » March (via CobWeb/3.1 planetlab1.isi.jhu.edu) (Site not responding. Last check: 2007-09-11)
		This is a complement designed to work with the Abstract Machine Trane module.
		Filed under: machine, abstractmachine, instrument — Douglas Edric Stanley @ 20:30 pm
		Trane is one of the first components of a larger ongoing project entitled The Abstract Machine.
	www.abstractmachine.net.cob-web.org:8888 /blog/?m=200203 (405 words)

	Specifying Representations of Machine Instructions (Abstract) (Site not responding. Last check: 2007-09-11)
		We present SLED, a Specification Language for Encoding and Decoding, which describes abstract, binary, and assembly-language representations of machine instructions.
		SLED is suitable for describing both CISC and RISC machines; we have specified representations of MIPS R3000, SPARC, Alpha, and Intel Pentium instructions, and toolkit users have written specifications for the Power PC and Motorola 68000.
		SLED uses four elements; fields and tokens describe parts of instructions, patterns describe binary representations of instructions or groups of instructions, and constructors map between the abstract and binary levels.
	www.eecs.harvard.edu /~nr/pubs/specifying-abstract.html (317 words)

	Abstract State Machines: Title Index
		"Abstract State Machines: A Unifying View of Models of Computation and of System Design Frameworks"
		"Definition of a Parallel Execution Model with Abstract State Machines".
		"Formal design of an abstract machine for constraint logic programming".
	www.eecs.umich.edu /gasm/titleindex.html (1296 words)

	The Abstract Machine Notation
		This description of the Abstract Machine Notation is organised as follows:-
		Some constructs require the use of a type-determining predicate to be well-formed.
		Abstract Machine constructs are described by the following BNF-like syntax; the order in which optional clauses appear is not significant.
	www.b-core.com /ONLINEDOC/AMNotation.html (680 words)

	(E. Börger, D. Sona) A Neural Abstract Machine (Site not responding. Last check: 2007-09-11)
		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.
		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.
		Keywords: abstract state machines, distributed computation, neural abstract machine, neural networks
	www.jucs.org /jucs_7_11/a_neural_abstract_machine (138 words)

	Trishula Records - Megalopsy-The Abstract Machine [TRISHCD002] [© 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.
		After their first release on Trishula Records' compilation "Ignis Fatuus" Megalopsy strikes back with their first solo album "The Abstract Machine".
		The journey begins in the ultimate chaos, then leads you to a brief encounter with gobblins and juggling spheres and ends in the cosmos itself.
	www.trishula-records.com /trishcd002.htm (177 words)

Try your search on: Qwika (all wikis)