Specification-based test program generation for MIPS64 memory management units

Paper

First seen 6/25/2026

Last seen 8/16/2026

Evidence 11 chunks

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

29 connections

Ruby uses → 100% 2e

Test templates are written in Ruby

nML uses → 100% 2e

MicroTESK uses nML for ISA specifications

Genesys-Pro compares with → 90% 2e

The paper compares its approach to IBM's Genesys-Pro

buffer-event factorization uses → 90% 2e

Buffer-event factorization is used as a heuristic to avoid combinatorial explosion

Directed Acyclic Graph uses → 90% 2e

The MMU specification is represented as a labeled DAG for analysis

MMUSL introduces → 95% 1e

The paper introduces MMUSL, a dedicated problem-oriented language for MMU specification

MicroTESK uses → 100% 1e

The solution is based on the MicroTESK framework

Symbolic Execution uses → 100% 1e

Test data are generated using symbolic execution techniques

constraint solving uses → 100% 1e

Test data are generated using constraint solving techniques

Formal Specification uses → 100% 1e

The approach is based on formal specifications of the MMU

Test Template uses → 95% 1e

The paper uses user-defined test templates to guide test program generation

memory management unit evaluates → 100% 1e

The paper describes a tool for automatically generating test programs for MIPS64 MMUs

MIPS64 evaluates → 100% 1e

The paper applies its approach to MIPS64 MMU

DeepTrans compares with → 85% 1e

The paper discusses and compares its approach with IBM's DeepTrans

MA2TG compares with → 70% 1e

The paper references MA2TG as a related tool for microprocessor verification

Z3 SMT solver uses → 75% 1e

Z3 SMT solver is referenced as a constraint solving tool used in the framework

CVC4 SMT solver uses → 75% 1e

CVC4 SMT solver is referenced as a constraint solving tool used in the framework

Fortress library uses → 75% 1e

Fortress library is referenced as a solver API used in the framework

combinatorial test generation uses → 90% 1e

MicroTESK uses combinatorial generation as its main approach

execution path uses → 100% 1e

Execution paths are extracted from the DAG and used to generate test programs

preparator uses → 90% 1e

Preparators are used to transform test data into ISA-specific preparation code

Domain Specific Language uses → 90% 1e

DSLs are used for specifying ISAs and MMUs in the approach

test data generation uses → 95% 1e

The paper generates test data as part of test program generation

MIPS64 targets ISA → 100% 1e

The work focuses on generating test programs for the MIPS64 architecture’s MMUs, indicating it targets the MIPS64 ISA.

random test generation uses → 80% 1e

The paper also supports constrained random generation for more complex test programs

Specification-based test program generation uses → 95% 1e

Applies a specification-based approach to generate test programs for MIPS64 MMUs.

A.S. Kamkin authored by → 100% 1e

The paper is authored by A.S. Kamkin

A.M. Kotsynyak authored by → 100% 1e

The paper is authored by A.M. Kotsynyak

Institute for System Programming of the Russian Academy of Sciences published by → 100% 1e

The paper is published by ISP RAS