On one application of computations with oracle

DOI10.1134/S0361768810030047zbMath1253.68089OpenAlexW2004171738MaRDI QIDQ1758675

A. P. Nemytykh, Alexej P. Lisitsa

Publication date: 16 November 2012

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768810030047

zbMATH Keywords

evolution pathverification tasks for cache coherence protocols

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Related Items (2)

Intermediate representation of programs with type specification based on pattern matching ⋮ Ping-pong protocols as prefix grammars: modelling and verification via program transformation

Uses Software

• Refal

Cites Work

• Constraint-based verification of parameterized cache coherence protocols
• Verification as a parameterized testing (experiments with the SCP4 supercompiler)
• A structural approach to reversible computation
• REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
• The concept of a supercompiler
• On solving automaton equations
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On one application of computations with oracle