AsmL: Abstract State Machine Language. AsmL is an industrial-strength executable specification language. It can be used at any stage of the programming process: design, coding, or testing. It is fully integrated into the Microsoft .NET environment: AsmL models can interoperate with any other .NET assembly, no matter what source language it is written in. AsmL uses XML and Word for literate specifications. AsmL is the Abstract State Machine Language. The FSE group develops AsmL. It is an executable specification language based on the theory of Abstract State Machines, invented by Yuri Gurevich. The current version, AsmL for Microsoft .NET, is embedded into Microsoft Word. It uses XML and Word for literate specifications. It is fully interoperable with other .NET languages. AsmL generates .NET assemblies which can either be executed from the command line, linked with other .NET assemblies, or packaged as COM components.

References in zbMATH (referenced in 43 articles , 2 standard articles )

Showing results 1 to 20 of 43.
Sorted by year (citations)

1 2 3 next

  1. Anureev, I. S.: Domain-specific transition systems and their application to a formal definition of a model programming language (2014)
  2. Hierons, Robert M.: The complexity of asynchronous model based testing (2012)
  3. Hierons, Robert M.: Overcoming controllability problems in distributed testing from an input output transition system (2012)
  4. Hierons, Robert M.; Merayo, Mercedes G.; Núñez, Manuel: Implementation relations and test generation for systems with distributed interfaces (2012)
  5. Sinnig, Daniel; Khendek, Ferhat; Chalin, Patrice: Partial order semantics for use case and task models (2011)
  6. Cégielski, Patrick; Guessarian, Irène: Normalization of some extended abstract state machines (2010)
  7. Fruja, Nicu G.: Towards proving type safety of (\mathrmC^#) (2010)
  8. Hierons, Robert M.: Canonical finite state machines for distributed systems (2010)
  9. Jourdan, Guy-Vincent; Ural, Hasan; Yenigün, Hüsnü; Zhang, Ji Chao: Lower bounds on lengths of checking sequences (2010)
  10. Veanes, Margus; Bjørner, Nikolaj: Symbolic bounded conformance checking of model programs (2010)
  11. Beierle, Christoph; Kern-Isberner, Gabriele: A verified AsmL implementation of belief revision (2008)
  12. Beierle, Christoph; Kern-Isberner, Gabriele; Koch, Nicole: A high-level implementation of a system for automated reasoning with default rules. (System description) (2008)
  13. Börger, Egon (ed.); Butler, Michael (ed.); Bowen, Jonathan P. (ed.); Boca, Paul (ed.): Abstract state machines, B and Z. First international conference, ABZ 2008, London, UK, September 16--18, 2008. Proceedings (2008)
  14. Fruja, Nicu G.: Towards proving type safety of .NET CIL (2008)
  15. Hierons, R. M.; Ural, H.: Checking sequences for distributed test architectures (2008)
  16. Veanes, Margus; Saabas, Ando: On bounded reachability of programs with set comprehensions (2008)
  17. Anureev, Igor S.: Ontological transition systems structures (2007)
  18. Blass, Andreas; Gurevich, Yuri; Rosenzweig, Dean; Rossman, Benjamin: Interactive small-step algorithms. I: Axiomatization (2007)
  19. Gurevich, Yuri; Veanes, Margus; Wallace, Charles: Can abstract state machines be useful in language theory? (2007)
  20. Johnson, James E.; Langworthy, David E.; Lamport, Leslie; Vogt, Friedrich H.: Formal specification of a web services protocol (2007)

1 2 3 next