Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Abstract Machine Notation

Related Topics

  Abstract machine - Wikipedia, the free encyclopedia
Abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory).
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.
en.wikipedia.org /wiki/Abstract_machine   (272 words)

 [No title]
The abstract machine [2] is the basic element of a B development.
The description of an abstract machine is composed of three parts, the declarative part which describes the states and their properties, the execution part which introduces operations, and composition clauses.
For a top-level machine, there are proof obligations (PO) related to its mathematical consistency; if the abstract machine is a refinement or an implementation, there are proofs of its correctness with respect to the previous steps of the development chain.
www.chez.com /abtools/BMethod.htm   (1866 words)

 abstract machine from FOLDOC   (Site not responding. Last check: 2007-11-02)
An abstract machine has an instruction set, a register set and a model of memory.
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.
wombat.doc.ic.ac.uk /foldoc/foldoc.cgi?abstract+machine   (179 words)

 Introduction   (Site not responding. Last check: 2007-11-02)
Configuration and Integrity Management of all files, including AMN (Abstract Machine Notation) constructs, proofs, documents hypertext constructs as well as generated binary code files.
Dependency management is automatically provided which means that it is impossible to have an out-of-date construct configured; this also means that the rich variety of `Remake' facilities have an extremely fine grain (by construct, by tool, by job, or, simply, all!), the system being rebuilt automatically to its former state, including code, documentation and proofs.
Give the machine a new name (pressing help will produce a small help window which says that the maximum length of the name is 20 characters).
www-dse.doc.ic.ac.uk /sel/sereports/cs1/cs1.html   (2199 words)

 Experiences of Using HOL and PVS for AMN Proof   (Site not responding. Last check: 2007-11-02)
The Abstract Machine Notation (AMN) is a formal notation for system specification and for refinement to executable code.
We have constructed a prototype tool to generate AMN proof obligations in a form suitable for consideration by the HOL and PVS theorem provers.
I will discuss the problems that we have encountered in supporting AMN proof using the HOL and PVS theorem provers, and attempt to highlight the particular advantages and disadvantages of the two systems for this type of application.
www.cl.cam.ac.uk /Research/HVG/ARG_Talks/abstracts/abstract_960523.html   (116 words)

abashed abstemious abstentionist abstention abstinence abstract abstracted abstractedly abstraction "abstraction of documents" "abstraction of mind" abstrusely abstruse affectation "affectation to a service" "affected pathos" affectionate affectionately affection "affixed statement" affixture aphicide apostasy apostate apostleship apostle apostolate apostolic apostrophe apposite avast!
abstract abstracted abstraction affect affectation affecting affection affectionate apostasy apostate apostatize apostle
abashed abecedarian abecedary absquatulate abstain abstainer abstemious abstention abstinence abstract abstracted abstraction abstruse affect affectation affected affecting affection affectionate affixation apostasy apostate apostatize apostle apostolic apposite
dictionary-x.com /AbstractMachineNotation.html   (659 words)

 Finite State Machine Design   (Site not responding. Last check: 2007-11-02)
Finite state machines are so named because the sequential logic that implements them can be in only a fixed number of possible states.
More generally, the outputs and next state of a finite state machine are combinational logic functions of their inputs and present state.
Finite state machines are critical for realizing the control and decision-making logic in digital -systems.
www2.ele.ufes.br /~ailson/digital2/cld/chapter8/chapter08.doc.html   (248 words)

 November 1997-November 1998. Post-doctoral position at SRI (Menlo Park)   (Site not responding. Last check: 2007-11-02)
In contrast to the original notation whose semantics is based on set theory, the semantics of the PVS machines is based on type theory.
In this way, the notation wins in expressiveness and the proof obligations can be handled directly by the type checker.
The type conditions of the theory correspond to the proof obligations of the machine.
www.csl.sri.com /users/munoz/cv_sec1.html   (295 words)

 Research Programme   (Site not responding. Last check: 2007-11-02)
This is a substantial technical report that attempts to make precise the notion of the Abstract Machine Notation.
This paper uses the Z Notation to make precise the notion of a relational data model.
This paper explains how the Z Notation can be used to express concrete syntax in the same manner as Extended BNF.
www.dcs.ex.ac.uk /~jbwordsw/research.html   (145 words)

 The Abstract Machine Notation
This description of the Abstract Machine Notation is organised as follows:-
The generic syntactic variables are as follows: P, Q, R for predicates; S, T, U, V for AMN substitutions, E,F for expressions; ff, xx, yy for variables; l, m, n for lists of expressions; vlx for variable lists; opn for AMN operation names; asub for AMN substitutions.
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)

 [No title]   (Site not responding. Last check: 2007-11-02)
Fields are as shown in the instructions at the head of this file and the human-readable version above.
B-Toolkit Abstract Machine Notation Yes Yes Yes Yes Ye Yes - - Yes IBM/RS6000 running AIX Sun Sparc running SunOS 4.1.x.
Scotland +44 (0)31-650 2722 +44 (0)31-650 651 geraint@ai.ed.ac.uk ftp, tape (at media cost) Partly automated proof development systems, which use high level abstract descriptions of proof strategies to carry out formal construction and validation.
www-formal.stanford.edu /clt/FMTDB/fm_tools_db   (3724 words)

 Open Directory - Computers: Programming: Languages: Z   (Site not responding. Last check: 2007-11-02)
Standard for Z Notation - International Z Notation standardization effort finished in 2002 and yielded The ISO/IEC Z Standard.
The Z Notation - The formal specification notation Z is based on Zermelo-Fraenkel set theory and first order predicate logic.
The Z Notation - The World Wide Web Virtual Library entry for the Z formal specification language, providing links to resources around the world.
dmoz.org /Computers/Programming/Languages/Z   (511 words)

 Amazon.ca: Books: An Introduction to the B Abstract Machine Notation   (Site not responding. Last check: 2007-11-02)
Amazon.ca: Books: An Introduction to the B Abstract Machine Notation
An Introduction to the B Abstract Machine Notation
Top of Page : An Introduction to the B Abstract Machine Notation
www.amazon.ca /exec/obidos/ASIN/0077090144   (108 words)

 Abstract Machine Notation from FOLDOC   (Site not responding. Last check: 2007-11-02)
(AMN) A language for specifying abstract machines in the B-Method, based on the mathematical theory of Generalised Substitutions.
Previous: abstract data type, abstract interpretation, abstraction, abstract machine
Next: abstract syntax, Abstract Syntax Notation 1, abstract syntax tree
www.instantweb.com /foldoc/foldoc.cgi?Abstract+Machine+Notation   (46 words)

 Translating Statecharts to B   (Site not responding. Last check: 2007-11-02)
We present algorithms for the translation of statecharts to the Abstract Machine Notation of the B method.
These algorithms have been implemented in iState, a tool for translating statecharts to various programming languages.
We give a model of statecharts, a model of the code in AMN, as well as the intermediate representations in terms of class diagrams and their textual counterpart.
www.cas.mcmaster.ca /~emil/publications/icode   (106 words)

Try your search on: Qwika (all wikis)

  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.