Sökning: "Invariant Generation"
Visar resultat 1 - 5 av 17 avhandlingar innehållade orden Invariant Generation.
1. Analysis of Iterative or Recursive Programs Using a First-Order Theorem Prover
Sammanfattning : Static analysis of program semantics can be used to provide strong guarantees about the correctness of software systems. In this thesis, we explore ways to perform automated program analysis and verification using a first-order theorem prover. LÄS MER
2. Residue fixed point index and wildly ramified power series
Sammanfattning : This thesis concerns discrete dynamical systems. These are systems where the dynamics is modeled by iterated functions. There are several applications of discrete dynamical system e.g. LÄS MER
3. Single layer near-field acoustic imaging in space-invariant reflective environments
Sammanfattning : The visualization of optical fields, or widely known as photography, is a common practice that can also be applied to acoustic fields. No less than three decades of research in acoustic imaging demonstrate its potential and relevance in plenty applications such as sound source identification and localization, as well as characterization of noise generation mechanisms. LÄS MER
4. Pose-invariant, model-based objectrecognition, using linear combination of viewsand Bayesian statistics
Sammanfattning : This thesis presents an in-depth study on the problem of object recognition, and in particular the detectionof 3-D objects in 2-D intensity images which may be viewed from a variety of angles. A solution to thisproblem remains elusive to this day, since it involves dealing with variations in geometry, photometryand viewing angle, noise, occlusions and incomplete data. LÄS MER
5. On linear graph invariants related to Ramsey and edge numbers : or how I learned to stop worrying and love the alien invasion
Sammanfattning : In this thesis we study the Ramsey numbers, R(l,k), the edge numbers, e(l,k;n) and graphs that are related to these. The edge number e(l,k;n) may be defined as the least natural number m for which all graphs on n vertices and less than m edges either contains a complete subgraph of size l or an independent set of size k. LÄS MER