Learn More
The paper shows that, by an appropriate choice of a rich as-sertional language, it is possible to extend the utility of symbolic model checking beyond the realm of bdd-represented nite-state systems into the domain of innnite-state systems, leading to a powerful technique for uniform veriication of unbounded (parameterized) process networks. The main(More)
We propose to use a formal specification language as a high-level hardware description language. Formal languages allow for compact, unambiguous representations and yield designs that are correct by construction. The idea of automatic synthesis from specifications is old, but used to be completely impractical. Recently, great strides towards efficient(More)
This paper proposes a general framework for reconstructing sparse images from undersampled (squared)magnitude data corrupted with outliers and noise. This phase retrieval method uses a layered approach, combining repeated minimization of a convex majorizer (surrogate for a nonconvex objective function), and iterative optimization of that majorizer using a(More)
There is a growing awareness, both in industry and academia, of the crucial role of formally proving the correctness of safety-critical components of systems. Most formal verification methods verify the correctness of a high-level representation of the system against a given specification. However, if one wishes to infer from such a verification the(More)
—With the advent of the Internet, it is desirable to interpret and extract useful information from the Web. One major challenge in Web interface interpretation is to discover the semantic structure underlying a Web interface. Many heuristic approaches have been developed to discover and group semantically related interface objects. However, those approaches(More)
We propose a reconstruction method for the phase retrieval problem prevalent in optics, crystallography, and other imaging applications. Our approach uses signal sparsity to provide robust reconstruction, even in the presence of outliers. Our method is multi-layered, involving multiple random initial conditions, convex majorization, variable splitting, and(More)
The paper presents a method, called the method of verii-cation by invisible invariants, for the automatic veriication of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their induc-tiveness, using symbolic model-checking techniques for both tasks. First, we show how(More)
We describe CVT-a fully automatic tool for Code-Validation, i.e. verifying that the target code produced by a code-generator (equivalently, a compiler or a translator) is a correct implementation of the source specification. This approach is a viable alternative to a full formal verification of the code-generator program, and has the advantage of not(More)