#
4b9431d8 |
|
04-May-2017 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Finish fixing machine-code for new by build --selftest=3 now completes; I'm ready to merge into master.
|
#
caf04fc3 |
|
08-Aug-2016 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Build more machine-code example thys with pat_assum
|
#
91d66767 |
|
23-Jun-2013 |
Michael Norrish <michael.norrish@nicta.com.au> |
New goalstack pretty-printing trace & rationalise goalstack trace names New trace prints a count of the sub-goals at the end of the stack. This saves the user from having to scroll back over the several hundred goals they've just generated to find out the number.
|
#
4f2e9309 |
|
10-May-2013 |
Magnus Myreen <magnus.myreen@cl.cam.ac.uk> |
rearranging files in examples/machine-code to separate decompiler from ISA models
|
#
87477831 |
|
29-Oct-2012 |
Michael Norrish <michael.norrish@nicta.com.au> |
Get all of machine-code/garbage-collectors to build. Progress with #52. General principle is to avoid use of IN_DEF, and to instead prove rewrites of the form |- x ∈ myconstant arg1 .. argn ⇔ somerhs rewriting set l x back to MEM x l as necessary.
|
#
415a155c |
|
31-May-2010 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
I've changed the way tail-recursive functions are defined. They are now defined based on a step function: step: 'a -> 'a + 'b Tail-recursive functions loop until their step function returns something in the right component (INR).
|
#
0c564bf4 |
|
02-Dec-2009 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
Minor changes.
|
#
4761143b |
|
10-Aug-2009 |
Tjark Weber <Tjark.Weber@cl.cam.ac.uk> |
Removed trailing whitespace from all .sml and .sig files. This affects over 900 files and was done using emacs's delete-trailing-whitespace function in batch mode. Building the system with Poly/ML and Moscow ML seems to work, so I'm hoping these changes don't break anything. Please complain if they do!
|
#
9030ae5a |
|
26-Jun-2009 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
A general update: 1. the decompiler is now slightly faster, due to new code abbreviations (terms smaller in internal proofs); 2. the definition of the machine-code Hoare triple was slightly altered to support instruction caches; 3. the x86 model now includes an instruction cache. Also, I give up on attempting to support MoscowML for examples/machine-code/lisp. Both the standard kernel and the experimental kernel crash while loading files in this directory using the latest patched version of MoscowML. Both kernels exit with an uninformative message: Compiling lisp_equalScript.sml Linking lisp_equalScript.uo to produce theory-builder executable Uncaught exception: Chr Failed to build script file, lisp_equalScript Did they run out of memory? If so, why does the error message not say so?
|
#
8c3fc760 |
|
09-Jun-2009 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
A general update. Now lisp_finalTheory produces assembly files containing the verified LISP interpeteres (in machine code): arm_eval.s x86_eval.s ppc_eval.s Each of these have been successfully run on real hardware, for each respective platform. The proof scripts are likely to only work in the experimental kernel, due to some unfortuante differences between the two kernels. Some of these differences are exposed more frequently now due to recent(ish) changes to the datatype package. Maybe some of the changes made to the datatype package ought to be reconsidered?
|
#
44a6db21 |
|
03-Apr-2009 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
Restructuring and simplification.
|
#
c2f14f37 |
|
05-Mar-2009 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
Improvements to the verified LISP interepreters. The new interpreters have been proved to implement McCarthy's LISP 1.5 as formalise by Mike Gordon for the ACL2 workshop 2007. Warning: lisp_evalScript takes 73 minutes to run using Holmake under PolyML.
|
#
7c197d42 |
|
07-Jan-2009 |
Magnus Myreen <Magnus.Myreen@cl.cam.ac.uk> |
A new version of files previously in examples/mc-logic. Eventually examples/mc-logic will be deleted.
|