http://www.forthgo.com/blog/2007/01/08/java-7-wish-list-item-static-analysis-optimizations/ Code and Recreations of Xan Gregg Wed, 28 Sep 2011 02:29:54 +0000 hourly 1 http://wordpress.org/?v=3.2.1 http://www.forthgo.com/blog/2007/01/08/java-7-wish-list-item-static-analysis-optimizations/comment-page-1/#comment-5398 xan Tue, 30 Jan 2007 12:20:53 +0000 http://www.forthgo.com/blog/2007/01/08/java-7-wish-list-item-static-analysis-optimizations/#comment-5398 I would expect so -- the hard part has got to be knowing where to look. At best, it's like factorization, where finding factors for a large number is much harder than verifying a given factorization. At worst, you at least prevent the JVM from investigating dead ends. I would expect so — the hard part has got to be knowing where to look. At best, it’s like factorization, where finding factors for a large number is much harder than verifying a given factorization. At worst, you at least prevent the JVM from investigating dead ends.

]]> http://www.forthgo.com/blog/2007/01/08/java-7-wish-list-item-static-analysis-optimizations/comment-page-1/#comment-5390 Anli Tue, 30 Jan 2007 01:54:22 +0000 http://www.forthgo.com/blog/2007/01/08/java-7-wish-list-item-static-analysis-optimizations/#comment-5390 Very interesting. As you say a proof has to be provided and the JVM will need to verify it. Is the proof's formal verification faster than its construction? Very interesting. As you say a proof has to be provided and the JVM will need to verify it. Is the proof’s formal verification faster than its construction?

]]>