In this thesis we develop a theory of program refinement and equivalence which can be used to develop practical tools for program development, analysis and modification. The theory is based on the use of general specifications and an imperative kernel language. We use weakest preconditions, expressed as formulae in infinitary logic to prove refinement and equivalence between programs. The kerne...

Type refinements, introduced by Freeman and Pfenning and explored by Davies and Dunfield, unify the ontological and epistemic views of typing. Types tell us what programming language constructs exist, whereas refinements express properties of the values of a type. Here we show that refinements are very useful in compiler correctness proofs, wherein it often arises that two expressions that are ...

In this paper, we present some refinements of a generalized Hölder’s inequality, which is due to Vasić and Pečarić. Mathematics subject classification (2010): Primary 26D15; Secondary 26D10.

Recent refinements of the phenomenology of Higgs bosons in the Standard Model and the Minimal Supersymmetric Standard Model are reviewed. Invited Talk at the 1995 International Europhysics Conference on High Energy Physics, Brussels, Belgium, 27 July–2 August, 1995 CERN-TH/96-07 January, 1996 RECENT REFINEMENTS IN HIGGS PHYSICS

Church’s Problem (1962) asks for the construction of a procedure which, given a logical specification φ on sequence pairs, realizes for any input sequence X an output sequence Y such that (X,Y ) satisfies φ. Büchi and Landweber (1969) gave a solution for MSO specifications in terms of finite-state automata. We address the problem in a more general logical setting where not only the specificatio...

Refinement systems currently select the best rule refinements from a set of conflicting and alternative refinements by using heuristics. This paper presents a new operations research approach for the selection of optimal rule refinements. The problem analysis and the description of the optimization are performed using two well-defined examples. The analysis of the refinement selection problem l...

We present a system to beautify curves: i.e. to take curves that roughly depict some property of interest and make them look more like what experts would draw. The focus of our work is in applications for artistic drawings, but our system can also be plugged into various other domains where curves and trajectories play a dominant role such as robot path planning, animation or edge-deblurring. O...

It is a common practice to design a protocol (say Q) assuming some secure channels. Then the secure channels are implemented using any standard protocol, e.g. TLS. In this paper, we study when such a practice is indeed secure. We provide a characterization of both confidential and authenticated channels. As an application, we study several protocols of the literature including TLS and BAC proto...