On one application of computations with oracle
DOI10.1134/S0361768810030047zbMATH Open1253.68089OpenAlexW2004171738MaRDI QIDQ1758675FDOQ1758675
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
Recommendations
Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of software (68N99)
Cites Work
- The concept of a supercompiler
- A structural approach to reversible computation
- Logical Reversibility of Computation
- Title not available (Why is that?)
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- Title not available (Why is that?)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- Constraint-based verification of parameterized cache coherence protocols
- Title not available (Why is that?)
- Title not available (Why is that?)
- On solving automaton equations
Cited In (5)
- Intermediate representation of programs with type specification based on pattern matching
- On low for speed oracles
- Title not available (Why is that?)
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
Uses Software
This page was built for publication: On one application of computations with oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758675)
