Wednesday, January 26, 2011

Quantifier Elimination

Quantifier elimination is a method of transforming a formula into an equivalent quantifier-free formula. Since quantifier-free formulae are easy to reason, quantifier elimination is useful for deduction and many quantifier-elimination procedures have been developed. Above all, quantifier-eliminationprocedures called "quantifier elimination by virtual substitutions" are known to be suitable for practical implementation. The idea of the virtual substitution based methods is to use a finit set of test cases, called an elimination set.

Emscripten: an LLVM-to-JavaScript compiler

It is very stunning to find Emscripten, a compiler of LLVM bitcodes into JavaScript. The LLVM bitcodes can be generated from C/C++ using llvm-gcc or clang or any other languages that can be converted into LLVM. The generated JavaScript can run on the WEB!

http://code.google.com/p/emscripten/