Formal Verification of Backward Compatibility of Microcode

Arons, Tamarah; Elster, Elad; Fix, Limor; Mador-Haim, Sela; Mishaeli, Michael; Shalev, Jonathan; Singerman, Eli; Tiemeyer, Andreas; Vardi, Moshe Y.; Zuck, Lenore D.

doi:10.1007/11513988_20

Cited by 36 publications

(21 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Several other works have targeted specific classes of languages: functional [7], microcode [8], CLP [9]. In order to be less language-specific some works advocate the use of intermediate languages, such as [10], which works on the Boogie intermediate language.…”

Section: Related Workmentioning

confidence: 99%

“…In order to be less language-specific some works advocate the use of intermediate languages, such as [10], which works on the Boogie intermediate language. And finally, only some few approaches, among which [5,8], deal with real-life language and industrial-size programs in Inria those languages. This is in contrast to the equivalence checking of hardware circuits, which has entered the mainstream industrial practice (see, e.g., [11] for a survey on this topic).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Program equivalence by circular reasoning

Lucanu

Rusu

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

We propose a logic and a deductive system for stating and automatically proving the equivalence of programs in deterministic languages having a rewriting-based operational semantics. The deductive system is circular in nature and is proved sound and weakly complete; together, these results say that, when it terminates, our system correctly solves the program-equivalence problem as we state it. We show that our approach is suitable for proving the equivalence of both terminating and non-terminating programs, and also the equivalence of both concrete and symbolic programs. The latter are programs in which some statements or expressions are symbolic variables. By proving the equivalence between symbolic programs, one proves in one shot the equivalence of (possibly, infinitely) many concrete programs obtained by replacing the variables by concrete statements or expressions. We also report on a prototype implementation of the proposed deductive system in the K Framework.Key-words: Program Equivalence, Circular Reasoning, K framework. * University of Iasi, Romania † Inria Lille Nord Europe Equivalence de Programmes par Raisonnement Circulaire Résumé :Nous proposons une logique et un système déductif pour exprimer et prouver automatiquement l'équivalence de programmes dans des langages déterministes munis de sé-mantiques opérationnelles définies par réécriture. Le système déductif proposé est de nature circulaire; nous démontrons qu'il est correct et faiblement complet. Ces deux résultats signifient que notre système résout correctement le problème d'équivalence de programmes tels que nous l'avons posé. Nous montrons que ce système fonctionne autant pour des programmes qui terminent que pour des programmes qui ne terminent pas. Les programmes dits symboliques, dans lesquels certaines expressions ou instructions restent non-interprétés, peuvent également être traités par notre approche. La démonstration d'une équivalence entre deux programmes symboliques revient à démontrer l'équivalence entre une infinité potentielle de programmes concrets, qui sont des instances des programmes symboliques obtenues en remplaçant les variables symboliques par des instructions ou des expressions concrètes. Enfin, nous décrivons une implé-mentation prototype de notre système déductif dans la K framework.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Program equivalence by circular reasoning

Lucanu

Rusu

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…Our basic theory remains that of [1], but our methodology has, of necessity, become significantly more sophisticated.…”

Section: Introductionmentioning

confidence: 99%

“…We have developed the MICROFORMAL tool-suite, originally used in the formal verification and analysis of microcode, and currently being extended for the verification of other embedded software. The MICROFORMAL tool-suite supports formal property verification, formal equivalence verification [1], and the extraction of feasible paths to serve as a coverage metric [2]. In this paper we focus not on the individual applications, but on their shared underlying symbolic simulation technology.…”

Section: Introductionmentioning

confidence: 99%

Efficient Symbolic Simulation of Low Level Software

Arons

Elster

Ozer

et al. 2008

2008 Design, Automation and Test in Europe

Self Cite

View full text Add to dashboard Cite

Symbolic execution has long been a staple technique for formal hardware verification. Its application to software requires methods for dealing with software specific complexities. In this paper we elaborate methods for the efficient symbolic simulation of embedded software; some methods are new, others are improvements of existing methods. Using these techniques we have been able to symbolically execute real life microcode of thousands of lines, allowing formal methods to become an integral part of microcode validation in Intel Corporation.

show abstract

“…Tools that build upon symbolic execution to perform program analysis and verification include [22,23,24,25]. Regarding program equivalence, one can mention works on C compiler correctness [26,27], and approaches targetting specific classes of languages: functional [28], microcode [29], CLP [30]. Some approaches target particular kinds of programs: successive versions of a given piece of code [31], recursive procedures [32].…”

Section: Introductionmentioning

confidence: 99%

Executing and verifying higher-order functional-imperative programs in Maude

Rusu¹,

Arusoaie²

2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

We incorporate higher-order functions and state monads in Maude, thereby embedding a higher-order functional language with imperative features in the Maude framework. We illustrate, via simple programs in the resulting language: the concrete and symbolic execution of programs; their verification with respect to properties expressed in Reachability Logic, a languageparametric generalisation of Hoare Logic; and the verification of programequivalence properties. Our approach is proved sound and is implemented in Full Maude by taking advantage of its reflective features and module system.

show abstract

Formal Verification of Backward Compatibility of Microcode

Cited by 36 publications

References 15 publications

Program equivalence by circular reasoning

Program equivalence by circular reasoning

Efficient Symbolic Simulation of Low Level Software

Executing and verifying higher-order functional-imperative programs in Maude

Contact Info

Product

Resources

About