Two Adpositional Predicates in Mayrinax Atayal— predicate selection and further implications
نویسندگان
چکیده
منابع مشابه
Linking constructions in Mayrinax Atayal
This study investigated and examined linking constructions in Mayrinax Atayal. Although in the literature, linkers are categorized as either complementizers or aspectual heads, their syntactic behaviors and statuses have not been fully probed and analyzed. From minimalist and cartographic viewpoints, this paper will divide Mayrinax linking constructions into three classes with respect to their ...
متن کاملQuantifier stranding and reflexive stranding in Mayrinax Atayal *
The stranding of quantifiers/prepositions is argued to show the path of movement. Mayrinax Atayal, a verb-initial ergative language, displays a wide range of positions for the quantifier kahabaag ‘all’ and the reflexive anaphor nanaq ‘self’ when they are interpreted with absolutive DPs. Assuming stranding phenomena as diagnostics for movement, I investigate quantifier stranding and reflexive st...
متن کاملPredicate Abstraction with Minimum Predicates
Predicate abstraction is a popular abstraction technique employed in formal software verification. A crucial requirement to make predicate abstraction effective is to use as few predicates as possible, since the abstraction process is in the worst case exponential (in both time and memory requirements) in the number of predicates involved. If a property can be proven to hold or not hold based o...
متن کاملMaking Predicate Abstraction Efficient: How to Eliminate Redundant Predicates
In this paper we consider techniques to identify and remove redundant predicates during predicate abstraction. We give three criteria for identifying redundancy. A predicate is redundant if any of the following three holds (i) the predicate is equivalent to a propositional function of other predicates. (ii) removing the predicate preserves safety properties satisfied by the abstract model (iii)...
متن کاملHeuristics for Selecting Predicates for Partial Predicate Abstraction
In this paper we consider the problem of configuring partial predicate abstraction that combines two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. A fundamental problem in partial predicate abstraction is deciding the variables to be abstracted and the predicates to be used. In this paper, we consider systems modeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LSA Annual Meeting Extended Abstracts
سال: 2013
ISSN: 2377-3367
DOI: 10.3765/exabs.v0i0.798