Skip to Content.
Sympa Menu

maude-help - [Maude-help] Proving bit stream properties & Circ Prover

maude-help AT lists.cs.illinois.edu

Subject: Maude-help mailing list

List archive

[Maude-help] Proving bit stream properties & Circ Prover


Chronological Thread 
  • From: Daniel Mahler <dmahler AT gmail.com>
  • To: maude-help AT cs.uiuc.edu
  • Subject: [Maude-help] Proving bit stream properties & Circ Prover
  • Date: Sun, 25 Nov 2012 04:58:22 +0100
  • List-archive: <http://lists.cs.uiuc.edu/pipermail/maude-help/>
  • List-id: <maude-help.cs.uiuc.edu>

I am trying to prove the property of a given bit stream transformer that
if the input stream only contains only finitely man 1's
so does the output stream

Is this something that can be done using Circ?
If yes, how? I do not see how to express the property of having finitely many ones in the first place.
If not can anybody suggest tools that may help?

Is maude-help the right place for Circ questions or is there a better place to ask?

thanks
Daniel



  • [Maude-help] Proving bit stream properties & Circ Prover, Daniel Mahler, 11/24/2012

Archive powered by MHonArc 2.6.16.

Top of Page