Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: TIMTOWDTDI, obfu and analyzis of code

by chromatic (Archbishop)
on Mar 13, 2003 at 01:14 UTC ( [id://242560]=note: print w/replies, xml ) Need Help??


in reply to TIMTOWDTDI, obfu and analyzis of code

I have part of a bytecode analyser in progress. It's my intent to do something like the Stanford Checker. The next piece of the puzzle is matching subtrees. I have a good design, so it's just a matter of finding time.

  • Comment on Re: TIMTOWDTDI, obfu and analyzis of code

Replies are listed 'Best First'.
Re: Re: TIMTOWDTDI, obfu and analyzis of code
by zby (Vicar) on Mar 13, 2003 at 08:34 UTC
    This is the first time I hear about the Stanford Checker. I googled verify.stanford.edu/SVC - but I don't see how it can apply here. Could you explain a bit?
Re: Re: TIMTOWDTDI, obfu and analyzis of code
by Anonymous Monk on Mar 18, 2003 at 08:56 UTC

    Is the code public? You might get some help.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://242560]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others sharing their wisdom with the Monastery: (2)
As of 2024-04-26 00:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found