Proceedings of the International Conference on Reliable Software - 1975
DOI: 10.1145/800027.808428
|View full text |Cite
|
Sign up to set email alerts
|

An approach to compiler correctness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

1978
1978
2014
2014

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Soundness of the logic and the care with which it is implemented in the theorem prover are strong advantages of the Boyer-Moore proof system over the GVE. There is empirical evidence over 15 years for virtually bug-free performance of the Boyer-Moore prover that has 8 not been matched by the Gypsy implementation.…”
Section: '(Proc-call-mg Mg_multiply_by_positive (Ans X Y) Nil)mentioning
confidence: 99%
See 1 more Smart Citation
“…Soundness of the logic and the care with which it is implemented in the theorem prover are strong advantages of the Boyer-Moore proof system over the GVE. There is empirical evidence over 15 years for virtually bug-free performance of the Boyer-Moore prover that has 8 not been matched by the Gypsy implementation.…”
Section: '(Proc-call-mg Mg_multiply_by_positive (Ans X Y) Nil)mentioning
confidence: 99%
“…Several compiler proofs have used axiomatic semantics [8,16] and much work has been directed toward specifying and proving compilers using denotational semantics [20,9],…”
Section: Chapter 8 Related Workmentioning
confidence: 99%
“…6 These two predicates can be taken as requiring that there be no security-related side effects of any statetransition instruction. The only objects actually read or modified by an instruction must be those explicitly contained in the instruction's argument list.…”
Section: (V I E/) (V S' S E S Such That S'{i}s) (V N ~ E[s']) (I Normentioning
confidence: 99%
“…that s'{i}s) (V n E P[s']) (V o' E s'.objects, o E s.objects such that o'.name = o.name = n)6 Recall that NoRef is defined in terms of objects into which transfer of information is possible. The possible recipient object collection in the definition of NoRef is therefore quantified over the entire object set, even though only a subset P[s] of the objects is being protected…”
mentioning
confidence: 99%
“…There are two main approaches for formally checking the correctness of code generators: translator verification [18,12,29] and translation validation [20]. Translator verification is based on applying program verification techniques to prove the correctness of a code generator.…”
Section: Introductionmentioning
confidence: 99%