class SeqAAM[Exp, Abs, Addr, Time] extends EvalKontMachine[Exp, Abs, Addr, Time]
SeqAAM: Sequential AAM (with list)
This is a reimplementation of the AAM class of Scala-AM written by Quentin Stiévenart. A fork of the original version of Scala-AM used is available here: https://bitbucket.org/OPiMedia/scala-am. The subsumption part has been removed. So this class corresponds in fact to the AAMNS (AAM No Subsumption) class of Scala-AM in this copy repository.
Compared to AAMNS of Scala-AM this class used Set Scala native data structures instead to specific WorkList and VisitedSet. The recursive loop has been replaced by a for loop.
The worklist is implemented by an immutable list of states.
This sequential machine (or the SeqAAMS and SeqAAMLS alternative) is the comparison point for the different version of parallel machines implemented in Scala-Par-AM.
The original description by Quentin Stiévenart: Implementation of a CESK machine following the AAM approach (Van Horn, David, and Matthew Might. "Abstracting abstract machines." ACM Sigplan Notices. Vol. 45. No. 9. ACM, 2010).
A difference with the paper is that we separate the continuation store (KontStore) from the value store (Store). That simplifies the implementation of both stores, and the only change it induces is that we are not able to support first-class continuation as easily (we don't support them at all, but they could be added).
Also, in the paper, a CESK state is made of 4 components: Control, Environment, Store, and Kontinuation. Here, we include the environment in the control component, and we distinguish "eval" states from "continuation" states. An eval state has an attached environment, as an expression needs to be evaluated within this environment, whereas a continuation state only contains the value reached.
- Alphabetic
- By Inheritance
- SeqAAM
- EvalKontMachine
- AbstractMachine
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new SeqAAM()(implicit arg0: Expression[Exp], arg1: JoinLattice[Abs], arg2: Address[Addr], arg3: Timestamp[Time])
Type Members
-
trait
Output extends AnyRef
The output of the abstract machine.
The output of the abstract machine.
- Definition Classes
- AbstractMachine
-
trait
Control extends MemoHashCode
The control component of the machine
The control component of the machine
- Definition Classes
- EvalKontMachine
-
case class
ControlError(err: SemanticError) extends Control with Product with Serializable
Or an error component, in case an error is reached (e.g., incorrect number of arguments in a function call)
Or an error component, in case an error is reached (e.g., incorrect number of arguments in a function call)
- Definition Classes
- EvalKontMachine
-
case class
ControlEval(exp: Exp, env: Environment[Addr]) extends Control with Product with Serializable
It can either be an eval component, where an expression needs to be evaluated in an environment
It can either be an eval component, where an expression needs to be evaluated in an environment
- Definition Classes
- EvalKontMachine
-
case class
ControlKont(v: Abs) extends Control with Product with Serializable
Or it can be a continuation component, where a value has been reached and a continuation should be popped from the stack to continue the evaluation
Or it can be a continuation component, where a value has been reached and a continuation should be popped from the stack to continue the evaluation
- Definition Classes
- EvalKontMachine
-
trait
KontAddr extends MemoHashCode
The store used for continuations is a KontStore (defined in Kontinuation.scala).
The store used for continuations is a KontStore (defined in Kontinuation.scala). It is parameterized by continuation addresses, that are element of the KontAddress typeclass.
Value Members
-
def
eval(exp: Exp, sem: Semantics[Exp, Abs, Addr, Time], config: MachineConfig): Output
Performs the evaluation of an expression exp (more generally, a program) under the given semantics sem.
Performs the evaluation of an expression exp (more generally, a program) under the given semantics sem.
If config.dotfile.nonEmpty is true, it will compute and generate the graph corresponding to the execution of the program (otherwise it will just visit every reachable state).
A timeout is also given by config.
- exp
The program to be evaluate
- config
Specify some parameters of the machine
- returns
An object implementing the Output trait, containing information about the evaluation.
- Definition Classes
- SeqAAM → AbstractMachine
-
def
isParallel: Boolean
Returns true iff the machine is a parallel machine
Returns true iff the machine is a parallel machine
- Definition Classes
- AbstractMachine
-
def
minProcess: Int
Returns the minimum processes possible for this machine.
Returns the minimum processes possible for this machine. Must be >= 1 and must be 1 if !isParallel.
- Definition Classes
- AbstractMachine
-
def
name: String
The name of the abstract machine.
The name of the abstract machine.
- Definition Classes
- SeqAAM → AbstractMachine
-
def
nbNotEvalProcess: Int
Returns the number of processes that whose task is not to perform step evaluation.
Returns the number of processes that whose task is not to perform step evaluation. Must be >= 0.
- Definition Classes
- AbstractMachine