Skip to Content.
Sympa Menu

k-user - Re: [[K-user] ] Source-to-source transformations / rule-based optimizations

k-user AT lists.cs.illinois.edu

Subject: K-user mailing list

List archive

Re: [[K-user] ] Source-to-source transformations / rule-based optimizations


Chronological Thread 
  • From: "Park, Daejun" <dpark69 AT illinois.edu>
  • To: "bongiovanni AT gmail.com" <bongiovanni AT gmail.com>
  • Cc: "k-user AT lists.cs.illinois.edu" <k-user AT lists.cs.illinois.edu>
  • Subject: Re: [[K-user] ] Source-to-source transformations / rule-based optimizations
  • Date: Fri, 8 Sep 2017 23:25:22 +0000
  • Accept-language: en-US
  • Authentication-results: illinois.edu; spf=pass smtp.mailfrom=dpark69 AT illinois.edu

Hi Francesco,

> Given any two K formal semantics, let's say, C and ORC, do you think it is
> possible (and feasible) to create a K-based source-to-source translator that
> would translate a C program into an ORC program while retaining the
> semantics
> of the original C program ?


It depends.

In general there are two approaches: "verifying" the translation itself vs
"validating" each of the translation instances. Note that I intentionally
differentiate two terminologies: "verification" vs "validation".

We have a tool, called KEQ (which I'm working on), which is the program
equivalence checker that are robust (i.e., general enough) for the
"validation" purpose.

For some simple translations, you can still use KEQ for the "verification"
purpose as well. By "simple", I mean the local translation rules such as the
peep-hole optimizations.

We can talk more if you can share more details about your need. For example,
what kinds of translations (or optimizations) you have in mind?

Best,
Daejun


Archive powered by MHonArc 2.6.19.

Top of Page