504,040 research outputs found
Abstract State Machines 1988-1998: Commented ASM Bibliography
An annotated bibliography of papers which deal with or use Abstract State
Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm
A Logic for Non-Deterministic Parallel Abstract State Machines
We develop a logic which enables reasoning about single steps of
non-deterministic parallel Abstract State Machines (ASMs). Our logic builds
upon the unifying logic introduced by Nanchen and St\"ark for reasoning about
hierarchical (parallel) ASMs. Our main contribution to this regard is the
handling of non-determinism (both bounded and unbounded) within the logical
formalism. Moreover, we do this without sacrificing the completeness of the
logic for statements about single steps of non-deterministic parallel ASMs,
such as invariants of rules, consistency conditions for rules, or step-by-step
equivalence of rules.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0748
State machines for large scale computer software and systems
A method for specifying the behavior and architecture of discrete state
systems such as digital electronic devices and software using deterministic
state machines and automata products. The state machines are represented by
sequence maps where indicates that the output of the
system is in the state reached by following the sequence of events from
the initial state. Examples provided include counters, networks, reliable
message delivery, real-time analysis of gates and latches, and
producer/consumer. Techniques for defining, parameterizing, characterizing
abstract properties, and connecting sequence functions are developed. Sequence
functions are shown to represent (possibly non-finite) Moore type state
machines and general products of state machines. The method draws on state
machine theory, automata products, and recursive functions and is ordinary
working mathematics, not involving formal methods or any foundational or
meta-mathematical techniques. Systems in which there are levels of components
that may operate in parallel or concurrently are specified in terms of function
composition
Program Optimization Using Abstract State Machines
Usually the result code of source code by a compiler is not necessary the best one, and can be improved to run faster or to use less memory. This kind of improvement is done in compiling phase after parsing. Some good techniques in optimization are in folding the constants, elimination of dead code, or improvement of the loops. Here it is considered the runtime overhead and present how can this be improved. The source is specific for objectoriented languages with late binding, where a name of method to be called is bound to method dynamically. It increases the computation time by a cost of traversing the class hierarchy each time a method is called
- âŠ