In this document, a brief overview of my doctoral research is presented. In model-driven engineering (MDE), most problems are solved using model transformation. An efficient process to solving these problems is to apply reusable patterns while solving them. Finding reusable design patterns to specific subsets of problems helps to decrease the time and cost needed to solve them. My doctoral rese...

Tracking control of the direct-drive robot manipulators in high-speed is a challenging problem. The Coriolis and centrifugal torques become dominant in the high-speed motion control. The dynamical model of the robotic system including the robot manipulator and actuators is highly nonlinear, heavily coupled, uncertain and computationally extensive in non-companion form. In order to overcome thes...

German is a language with a relatively free word order. During the last few years considerable efforts have been made in all syntactic frameworks to explain so-called scrambling phenomena. In the following paper, I deal with some tough cases of German word order which cannot be described by assuming flat sentence structures or word order domains. The phenomena discussed are PP complements of no...

Order domains were originally proposed to deal with constituent order, but have recently been concerned with more than just linearization. This paper seeks to contribute to this discussion by considering the possibility of analysing word forms in terms of order domains. We focus on the distribution of the English relative and interrogative pronouns who and whom. It is shown that a small number ...

Inference problems in dynamically data-driven application systems use physical measurements along with a physical model to estimate the parameters or state of a physical system. Errors in measurements and uncertainties in the model lead to inaccurate inference results. This work develops a methodology to estimate the impact of various errors on the variational solution of a DDDAS inference prob...

This paper introduces Scavenger, the first theorem prover for pure first-order logic without equality based on the new conflict resolution calculus. Conflict resolution has a restricted resolution inference rule that resembles (a first-order generalization of) unit propagation as well as a rule for assuming decision literals and a rule for deriving new clauses by (a first-order generalization o...

Combining verification methods developed separately for software and hardware is motivated by the industry’s need for a technology that would make formal verification of realistic software/hardware co-designs practical. We focus on techniques that have proved successful in each of the two domains: BDD-based symbolic model checking for hardware verification and partial order reduction for the ve...

We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to generate an equivalent Ordered (0, S,=)-BDD from any given (0, S,=)-BDD. Having the ordered representation of the BDDs, one can verify the original formula in cons...

In this paper we address the relationship between questions as grammatical and semantic entities and questions as pragmatic entities arguing that a contextually-conditioned association holds between the former, as interrogative formulae, and the latter, as particular types of speech acts (namely offers and requests). This argument is supported by evidence from a corpus of spontaneous Cypriot Gr...