AsmL
From MaRDI portal
Software:23309
swMATH11363MaRDI QIDQ23309FDOQ23309
Author name not available (Why is that?)
Cited In (42)
- Checking sequences for distributed test architectures
- Formal methods for components and objects. Second international symposium, FMCO 2003, Leiden The Netherlands, November 4--7, 2003. Revised lectures.
- Abstract state machines 2003. Advances in theory and practice. 10th international workshop, ASM 2003, Taormina, Italy, March 3--7, 2003. Proceedings
- Foundations of Information and Knowledge Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial order semantics for use case and task models
- Automated Technology for Verification and Analysis
- On Bounded Reachability of Programs with Set Comprehensions
- Abstract State Machines 2004. Advances in Theory and Practice
- Supercharging plant configurations using Z3
- Semantic splitting of conditional belief bases
- Combining test case generation and runtime verification
- Automated technology for verification and analysis. Third international symposium, ATVA 2005, Taipei, Taiwan, October 4--7, 2005. Proceedings.
- Formal approaches to software testing. Third international workshop on formal approaches to testing of software, FATES 2003, Montreal, Quebec, Canada, October 6th, 2003. Revised papers
- The complexity of asynchronous model based testing
- Formal specification of a web services protocol
- Controllable Combinatorial Coverage in Grammar-Based Testing
- Interactive Small-Step Algorithms I: Axiomatization
- Can abstract state machines be useful in language theory?
- Partial updates
- A Verified AsmL Implementation of Belief Revision
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- A High-Level Implementation of a System for Automated Reasoning with Default Rules (System Description)
- Play to Test
- Normalization of Some Extended Abstract State Machines
- Abstract state machines, B and Z. First international conference, ABZ 2008, London, UK, September 16--18, 2008. Proceedings
- Interactive Algorithms 2005 with Added Appendix
- Ontological transition systems structures
- Lower bounds on lengths of checking sequences
- Towards proving type safety of \(\mathrm{C}^{\#}\)
- Implementation relations and test generation for systems with distributed interfaces
- Overcoming controllability problems in distributed testing from an input output transition system
- Trustworthy Global Computing
- Canonical finite state machines for distributed systems
- Symbolic Bounded Conformance Checking of Model Programs
- Title not available (Why is that?)
- Automated Technology for Verification and Analysis
- Towards proving type safety of .NET CIL
- Title not available (Why is that?)
This page was built for software: AsmL