 |
||
|
Advanced Search |
||
|
|||||
|
Domain-Specific Analysis < Verification & Validation < Results Home
|
|
Click here to complete a short survey. The results of this survey will be used to help us improve the research program and this website.
Click here to view research projects that had new research results added in the last 90 days.
|
| Implementing MARTHA: A Next-Generation Testable Language | |
| Point of Contact |
Tim Menzies tim@menzies.us |
| Dates | January 2004 - December 2006 |
| Problem | IV&V struggles to test software. Much research is being conducted to support the testing of the current generation of software. The current generation of software tools is optimized for execution speed (e.g. "C") or usability (e.g. Python or UML). Here we take a bold step away from current practice and ask the fundamental question: what would a software language look like if it was designed for testability? Our premise will be that a testable language is a reflective language that automatically and routinely explores itself looking for previously undetected interactions. |
| Objective | The design and implementation of an interpreter for MARTHA: a next-generation testable language that automatically seeks the "unknown knowns". |
| Results |
Definition of the MARTHA language.zip 2004 Report to SAS.ppt SAS 05 Executive Briefing.ppt Reusable Modeling Tools - WITSE Paper.pdf 2004 Submission to an Internationally refereed venue.pdf SAS 05 Technical Presentation.ppt MARTHA interpreter.zip Paper samples of systems encoded in MARTHA.pdf 2005 Submission to an Internationally refereed venue.pdf |
| Keywords | |
| Categories |
Domain-Specific Analysis Process Improvement |
|
| |
|
Curator: Josh Stonestreet NASA Official: Lisa Montgomery |
|
NASA Privacy, Security, Notices |