In Logical Properties, Colin McGinn offers a new theory of truth, which he describes as “thick disquotationalism.” In keeping with wider theme of the book, truth emerges as conceptually primitive. Echoing Moore, it is simple and unanalyzable. Though truth cannot be analyzed, in the sense of giving a conceptual decomposition, McGinn argues that truth can be defined. A non-circular statement of i...

The polyhedral model is a powerful algebraic framework that has enabled significant advances to analyses and transformations of sequential affine (sub)programs, relative to traditional AST-based approaches. However, given the rapid growth of parallel software, there is a need for increased experiences with using polyhedral frameworks for analysis and transformations of explicitly parallel progr...

Developing a good software architecture for a complex system is a critically important step for insuring that the system will satisfy its principal objectives. Unfortunately, today descriptions of software architecture are largely based on informal “box-and-line” drawings that are often ambiguous, incomplete, inconsistent, and unanalyzable. This need not be the case. Over the past decade a numb...

This dissertation presents a pointer analysis for Java programs, together with several practical analysis applications. For each program point, the analysis is able to construct a points-to graph that describes how local variables and object fields point to objects. Each points-to graph also contains escape information that identifies the objects that are reachable from outside the analysis sco...

Lexical decision task in an event-related potential experiment was used in order to determine the organization of mental lexicon regarding the polimorphemic words: are they stored as unanalyzable items or as separate morphemes? The results indicate the later: while monomorphemic words elicit N400 component, usually related to lexical-semantic processing, prefixed words and prefixed pseudo-words...

Standard array data dependence techniques can only reason about linear constraints. There has also been work on analyzing some dependences involving polynomial constraints. Analyzing array data dependences in real-world programs requires handling many \unanalyzable" terms: subscript arrays, run-time tests, function calls. The standard approach to analyzing such programs has been to omit and ign...

In this paper, the authors mention that there are two forms of TLP for Chip multiprocessors (CMPs): explicit threading and implicit threading. However, explicit threading is hard to program manually and, if automated, is limited in performance due to serialization of unanalyzable program segments. Implicit threading, on the other hand, requires buffering of program state to handle misspeculatio...

A fast calculation tool for state-dependent capacitance of power distribution network is proposed. The proposed method achieves linear time-complexity, which can be more than four orders magnitude faster than a conventional SPICE-based capacitance calculation. Large circuits that have been unanalyzable with the conventional method become analyzable for more comprehensive exploration of capacita...

Focusing on applications for analyzing learner language which evaluate semantic appropriateness and accuracy, we build from previous work which modeled some aspects of interaction, namely a picture description task (PDT), with the goal of integrating a spelling correction component in this context. After parsing a sentence and extracting semantic relations, a surprising number of analysis failu...