Translation validation was introduced as a technique to formally verify the correctness of code generators that attempts to ensure that program transformations preserve the semantics of input program. In this work, we adopt this approach to construct a validator that formally verifies the preservation of clock semantics during the Signal compiler transformations. The clock semantics is represen...

Wetting transitions in two-dimensional lattice systems are considered. To obtain exact solutions the transfer-matrix method is used. Attention is focused on transitions at proper line defects (domain walls). The effective thickness of the wall increases as the transition point is approached, this being connected with growth of the intermediate (wetting) phase inside the domain wall. Depending o...

Supercompilation, or Supervised Compilation is a technique for program specialization, optimization and, more generally, program transformation. We present an idea to use supercompilation for verification of parameterized programs and protocols, present a case study and report on our initial experiments. 1 Supercompilation and Verification Verification of infinite-state or parameterized systems...

We present a new transformation of call-by-value lambda-terms into continuation-passing style (CPS). This transformation operates in one pass and is both compositional and first-order. Because it operates in one pass, it directly yields compact CPS programs that are comparable to what one would write by hand. Because it is compositional, it allows proofs by structural induction. Because it is f...

Tolerance representation models are used to specify tolerance types and explain semantics of tolerances for nominal geometry parts. To well explain semantics of geometrical tolerances, a representation model of geometrical tolerances based on First Order Logic (FOL) is presented in this paper. We first investigate the classifications of feature variations and give the FOL representations of the...

3 Production of lemmas in first order logic 10 The method "Model Elimination is a proof method very easy to implement and it is the reason of his success. To present it, we use the following references [OD97], [Don78] et [Sut12]. The last document presents clearly and concisely the production of the lemma. Without this help, it would have been impossible to write this explanation of the method ...