AsmL

Source code checked in, #80132

Project Collection Service Accounts — Mon, 01 Oct 2012 21:49:39 GMT

Upgrade: New Version of LabDefaultTemplate.xaml. To upgrade your build definitions, please visit the following link: http://go.microsoft.com/fwlink/?LinkId=254563

Source code checked in, #80131

Project Collection Service Accounts — Mon, 01 Oct 2012 21:43:10 GMT

Checked in by server upgrade

Created Issue: asmlc.bootx.exe utility missing in AsmL-40620 [7506]

pjetrus — Sun, 31 Oct 2010 13:13:09 GMT

AsmL-40620.zip does not compile under VS2008. It seems that the zip file does not include asmlc.bootx.exe. The package comes with asmlc.boot.exe instead. Could you please fix it?

Source code checked in, #55373

_TFSSERVICE — Mon, 02 Aug 2010 22:49:34 GMT

Checked in by server upgrade

New Comment on "Examples"

lukadt — Wed, 21 Apr 2010 10:57:24 GMT

In the DFA Minimization document there's an error in the final result figure, after minimizing the automaton state 4 is not an accepting state, it should not be double circled.

Source code checked in, #40620

araschke — Fri, 22 Jan 2010 15:18:22 GMT

several changes for VS2008 compatibility

New Post: Alternating Bit Protocol in Abstract State Machine Language for Distributed Systems

priyankad — Mon, 02 Feb 2009 07:09:59 GMT

Hello All,
               This is Priyanka here, I'm doing my Master's Degree in Computer Engineering.Working on the research going on "ASML".So,There are following protocols which I want to merge with the help of "ASML".
1)Alternating Bit Protocol
2)Communication Protocol
3)TCP/IP Protocol
So,
     Does anyone have any information regarding the same.Please,help me to find the appropriate solution.
     Please,forward me your feedbacks on
     priyankadeore256@gmail.com

Thanks in advance... :)

UPDATED WIKI: Compiling Instructions

araschke — Thu, 05 Jun 2008 20:48:04 GMT

Compiling Instructions

One way (and currently the only one) to get an executable AsmL-compiler is to compile it yourself. This page describes in detail the necessary steps.

1. Download the complete source code.
Two possibilities are:

Download a complete ZIP-file. Click on the "Source Code"-tab at the top and then for the latest version its "Download"-link. After accepting the MSR-LA license you'll get a ZIP-file including the whole project.
Use a source control client. For details see Source Control Client Connection Instructions

From now on, we assume, all files are downloaded and/or extracted to the folder "C:\AsmL".

2. Start the "Visual Studio 2005 Command Prompt"
It can be found in the start menu under "Visual Studio 2005", "Visual Studio Tools". If you don't want to use a the "Visual Studio Command Prompt" you also can use a normal Windows Command Prompt and make sure, the C# 2.0 compiler (csc.exe) is accessible in the path.

3. Change the current directory to C:\AsmL.

4. Set the environment variable ASMLDEVDIR to "C:\AsmL".
set ASMLDEVDIR=C:\AsmL

5. Change directory to "C:\AsmL\AsmL".

6. Start the compilation process by typing "nmake".
For detailed information about the Makefile options see C:\AsmL\AsmL\README

7. Install everything via "nmake install".
Besides registering several DLLs, the installation copies two files ("Asml2 Specification.dot" and "Spec Explorer Document.dot" into the folder C:\Documents and Settings\%username%\Application Data\Microsoft\Templates.
Before opening one of these Word templates in Microsoft Word be sure, macros are enabled. Then you can easily create your AsmL specification and compile and execute it via the new menu item "Asml".

A comfortable Windows installer will be provided soon.

UPDATED WIKI: Compiling Instructions

araschke — Thu, 05 Jun 2008 20:47:21 GMT

Download a complete ZIP-file. Click on the "Source Code"-tab at the top and then for the latest version its "Download"-link. After accepting the MSR-LA license you'll get a ZIP-file including the whole project.
Use a source control client. For details see Source Control Client Connection Instructions

UPDATED WIKI: Home

araschke — Thu, 05 Jun 2008 20:17:15 GMT

AsmL

What is AsmL?

AsmL is the Abstract State Machine Language. The language was developed by the Foundations of Software Engineering (FSE) group at Microsoft Research. It is an executable specification language based on the theory of Abstract State Machines. This CodePlex project comprises an AsmL compiler that targets .NET code. The compiler was originally developed by the FSE group as well. In addition to the compiler itself, there is an add-in for Microsoft Word that facilitates literate programming.

What is AsmL good for?

AsmL is useful in any situation where you need a precise, non-ambiguous way to specify a computer system, either software or hardware. AsmL specifications are an ideal way for teams to communicate design decisions. Program managers, developers, and testers can all use an AsmL specification to achieve a single, unified understanding.
One of the greatest benefits of an AsmL specification is that you can execute it. That means it is useful before you commit yourself to coding the entire system. By exploring your design, you can answer the following questions: Does it do everything you intended it to? How do the features interact? Are there any unintended behaviors?

How do I get it?

You can download the Source Code, which contain a binary boot-compiler (i.e. the compiler that can build itself) called asmlc.boot.exe. Read these Compiling Instructions to learn how to build a new compiler yourself.
Or you can download just the executables from the Releases page.

How can I contribute?

Please write an email to Alexander to get added as a developer. Then you can submit source code and edit the wiki documentation, e.g. to add an example.

Documentation

The document AsmLReference.doc is the reference manual of AsmL.
The document AsmLReferenceExamples.zip is a zipped folder with samples from the reference manual.
Here are some examples showing various features of AsmL: Examples.

Source code checked in

araschke — Thu, 05 Jun 2008 13:18:44 GMT

small bug in word add-in fixed

UPDATED WIKI: Home

araschke — Fri, 30 May 2008 13:35:52 GMT

AsmL

What is AsmL?

What is AsmL good for?

How do I get it?

You can download the Source Code, which contain a binary boot-compiler (i.e. the compiler that can build itself) called asmlc.boot.exe. Read the README files to learn how build a new compiler yourself.
Or you can download just the executables from the Releases page.

How can I contribute?

Please write an email to Alexander to get added as a developer. Then you can submit source code and edit the wiki documentation, e.g. to add an example.

Documentation

The document AsmLReference.doc is the reference manual of AsmL.
The document AsmLReferenceExamples.zip is a zipped folder with samples from the reference manual.
Here are some examples showing various features of AsmL: Examples.

UPDATED WIKI: Examples

araschke — Fri, 30 May 2008 13:10:53 GMT

Examples

This is a collection of samples showing various ways of using AsmL. The samples are given as word documents in form of executable specifications with embedded AsmL code that can be executed directly from the documents.

Topological Sorting: an algorithm that given a directed acyclic graph G produces a sequence (v1,...,vk) of all the vertices in G, such that, if there is an edge (vi, vj) in G then i<j.
Graph Partitioning: Computes an automorphism partition of an undirected simple graph. This example illustrates a nontrivial use of nested set and bag comprehensions. The algorithm is described in Section 5 of the paper Can Abstract State Machines Be Useful in Language Theory?
Spanning Tree Computation: Illustrates Prim’s algorithm.
Stopwatch Specification: Shows how an AsmL specification, containing a collection of actions, can be used to specify a finite state machine.
Counting Problem: Shows how a decision problem involving a set of prisoners and a warden can be modeled in AsmL. In general, the model has an infinite number of states. However for a given number of prisoners, the number of states is finite. The model illustrates the use of state variables with unbounded value types (in this case integers) and the use of state variables with rich value types (in this case sets of integers).
DFA Minimization: Describes a well known algorithm for minimizing a deterministic finite automaton. This example is also described in detail in the above paper.
NFA Determinization: Describes the classical algorithm that, given a nondeterministic finite automaton, computes an equivalent deterministic finite automaton from it. This example is also described in detail in the paper mentioned above.

UPDATED WIKI: Home

nikolait — Wed, 28 May 2008 21:46:25 GMT

AsmL

What is AsmL?

What is AsmL good for?

How do I get it?

You can download the Source Code, which contain a binary boot-compiler (i.e. the compiler that can build itself) called asmlc.boot.exe. Read the README files to learn how build a new compiler yourself.
Or you can download just the executables from the Releases page.

How can I contribute?

Please write an email to Alexander to get added as a developer. Then you can submit source code and edit the wiki documentation, e.g. to add an example.

Documentation

The document AsmLReference.doc is the reference manual of AsmL.
The document AsmLReferenceExamples.zip is a zipped folder with samples from the reference manual.
Here are some examples showing various features of AsmL: Examples.

UPDATED WIKI: Home

nikolait — Wed, 28 May 2008 21:40:07 GMT

AsmL

What is AsmL?

What is AsmL good for?

How do I get it?

You can download the Source Code, which contain a binary boot-compiler (i.e. the compiler that can build itself) called asmlc.boot.exe. Read the README files to learn how build a new compiler yourself.
Or you can download just the executables from the Releases page.

Documentation

The document AsmLReference.doc is the reference manual of AsmL.
The document AsmLReferenceExamples.zip is a zipped folder with samples from the reference manual.
Here are some examples showing various features of AsmL: Examples.

UPDATED WIKI: Home

nikolait — Wed, 28 May 2008 21:38:21 GMT

AsmL

What is AsmL?

What is AsmL good for?

AsmL is useful in any situation where you need a precise way to specify a computer system without any undesired ambiguity, either software or hardware. AsmL specifications are an ideal way for teams to communicate design decisions. Program managers, developers, and testers can all use an AsmL specification to achieve a single, unified understanding.
One of the greatest benefits of an AsmL specification is that you can execute it. That means it is useful before you commit yourself to coding the entire system. By exploring your design, you can answer the following questions: Does it do everything you intended it to? How do the features interact? Are there any unintended behaviors?

How do I get it?

You can download the Source Code, which contain a binary boot-compiler (i.e. the compiler that can build itself) called asmlc.boot.exe. Read the README files to learn how build a new compiler yourself.
Or you can download just the executables from the Releases page.

Documentation

The document AsmLReference.doc is the reference manual of AsmL.
The document AsmLReferenceExamples.zip is a zipped folder with samples from the reference manual.
Here are some examples showing various features of AsmL: Examples.

Source code checked in

araschke — Tue, 27 May 2008 15:50:53 GMT

fixed a small bug concerning the parsing of floating numbers

UPDATED WIKI: Examples

veanesm — Thu, 22 May 2008 07:59:35 GMT

Examples

Topological Sorting: an algorithm that given a directed acyclic graph G produces a sequence (v1,...,vk) of all the vertices in G, such that, if there is an edge (vi, vj) in G then i<j.
Graph Partitioning: Computes an automorphism partition of an undirected simple graph. This example illustrates a nontrivial use of nested set and bag comprehensions. The algorithm is described in Section 5 of the paper Can Abstract State Machines Be Useful in Language Theory?
Spanning Tree Computation: Illustrates Prim’s algorithm.
Stopwatch Specification: Shows how an AsmL specification, containing a collection of actions, can be used to specify a finite state machine.
Counting Problem: Shows how a decision problem involving a set of prisoners and a warden can be modeled in AsmL. In general, the model has an infinite number of states. However for a given number of prisoners, the number of states is finite. The model illustrates the use of state variables with unbounded value types (in this case integers) and the use of state variables with rich value types (in this case sets of integers).
DFA Minimization: Describes a well known algorithm for minimizing a deterministic finite automaton. This example is also described in detail in the above paper.
NFA Determinization: Describes the classical algorithm that, given a nondeterministic finite automaton, computes an equivalent deterministic finite automaton from it. This example is also described in detail in the paper mentioned above.

UPDATED WIKI: Examples

veanesm — Thu, 22 May 2008 07:58:04 GMT

Examples

Topological Sorting: an algorithm that given a directed acyclic graph G produces a sequence (v1,...,vk) of all the vertices in G, such that, if there is an edge (vi, vj) in G then i<j.
Graph Partitioning: Computes an automorphism partition of an undirected simple graph. This example illustrates a nontrivial use of nested set and bag comprehensions. The algorithm is described in Section 5 of the paper Can Abstract State Machines Be Useful in Language Theory?,TCS 376 (2007) 17-29.
Spanning Tree Computation: Illustrates Prim’s algorithm.
Stopwatch Specification: Shows how an AsmL specification, containing a collection of actions, can be used to specify a finite state machine.
Counting Problem: Shows how a decision problem involving a set of prisoners and a warden can be modeled in AsmL. In general, the model has an infinite number of states. However for a given number of prisoners, the number of states is finite. The model illustrates the use of state variables with unbounded value types (in this case integers) and the use of state variables with rich value types (in this case sets of integers).
DFA Minimization: Describes a well known algorithm for minimizing a deterministic finite automaton. This example is also described in detail in the above paper.
NFA Determinization: Describes the classical algorithm that, given a nondeterministic finite automaton, computes an equivalent deterministic finite automaton from it. This example is also described in detail in the paper mentioned above.

UPDATED WIKI: Examples

veanesm — Thu, 22 May 2008 07:56:13 GMT

Examples

Topological Sorting: an algorithm that given a directed acyclic graph G produces a sequence (v1,...,vk) of all the vertices in G, such that, if there is an edge (vi, vj) in G then i<j.
Graph Partitioning: Computes an automorphism partition of an undirected simple graph. This example illustrates a nontrivial use of nested set and bag comprehensions. The algorithm is described in Section 5 of the paper Can Abstract State Machines Be Useful in Language Theory?,TCS 376 (2007) 17-29.
Spanning Tree Computation: Illustrates Prim’s algorithm.
Stopwatch Specification: Shows how an AsmL specification, containing a collection of actions, can be used to specify a finite state machine.
Counting Problem: Shows how a decision problem involving a set of prisoners and a warden can be modeled in AsmL. In general, the model has an infinite number of states. However for a given number of prisoners, the number of states is finite. The model illustrates the use of state variables with unbounded value types (in this case integers) and the use of state variables with rich value types (in this case sets of integers).
DFA Minimization: Describes a well known algorithm for minimizing a deterministic finite automaton. This example is also described in detail in the above paper.
NFA Determinization: Describes the classical algorithm that, given a nondeterministic finite automaton, computes an equivalent deterministic finite automaton from it. This example is also described in detail in the paper mentioned above.