Program slicing can be used to aid in a variety of software maintenance activities including code understanding, code testing, debugging, and program reengineering. Program slicing (as well as other program analysis functions including forward slicing) can be efficiently performed on an internal program representation called a system dependence graph (SDG). The construction of the SDG depends p...

abstract: fortunately in recent years in iran, semiotics arguments in literature and art study are noticed by researchers. in according to, the denotation and connotation functions in photography are updated and expanded. thus, necessary bases for continuing this argument are available. although denotation and connotation are belong to semiotics area, but in photography, specially critique of p...

Detecting races is important for debugging explicit shared-memory parallel programs, because the races result in unintended non-deterministic executions of the programs. Previous on-they techniques to detect races in parallel programs with inter-thread coordination show serious space overhead in two components of complexity, and can not guarantee that, in an execution instance, the race detecte...

Program synthesis is the automated construction of software from a specification. While program synthesis is undecidable in general, we show that synthesising finite-state programs is NEXPTIMEcomplete. We then present a fully automatic, sound and complete algorithm for synthesising C programs from a specification written in C. Our approach uses a combination of bounded model checking, explicit-...

In order to combat the state space explosion resulting from explicit-state model checking of software, we investigate the use of a parameterised boolean equation system (Pbes) to solve on-the-fly (i.e., with incremental construction of the program state space) influence analysis of program variables w.r.t. Application Programming Interface (Api) calls executed in the program. The static analysi...

This paper deals with the implementation of min-max model predictive control for constrained linear systems with bounded additive uncertainties and quadratic cost functions. This type of controller has been shown to be a continuous piecewise affine function of the state vector by geometrical methods. However, no algorithm for computing the explicit solution has been given. In this paper, we sho...

A system’s constraints characterizes what that system can do. However, a dynamic environment may require that a system alter its constraints. If feedback about a specific situation is available, a system may be able to adapt by reflecting on its own reasoning processes. Such reflection may be guided not only by explicit representation of the system’s constraints but also by explicit representat...

Let X be a nonsingular projective variety with an algebraic action of a complex torus (c*)n. We study in this thesis the symplectic quotients (reduced phase spaces) and the quotients in a more general sense. As a part of our program, we have developed a general procedure for computing the intersection homology groups of the quotient varieties. In particular, we obtained an explicit inductive fo...

MEXICA is a computer model that produces frameworks for short stories based on the engagement-reflection cognitive account of writing. During engagement MEXICA generates material guided by content and rhetorical constraints, avoiding the use of explicit goals or storystructure information. During reflection the system breaks impasses, evaluates the novelty and interestingness of the story in pr...