Sciweavers

395 search results - page 29 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
DAARC
2007
Springer
97views Algorithms» more  DAARC 2007»
14 years 1 months ago
Null Subjects Are Reflexives, Not Pronouns
Abstract. It has been a prevalent assumption in the literature that phonetically null Subjects of finite clauses are pronouns. This paper examines in detail this empirical generali...
António Horta Branco
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
14 years 1 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
14 years 1 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
FORTE
2008
13 years 11 months ago
Model Generation for Horn Logic with Stratified Negation
Abstract. Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn lo...
Ethan K. Jackson, Wolfram Schulte
JLP
2008
108views more  JLP 2008»
13 years 10 months ago
Composition mechanisms for retrenchment
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
Richard Banach, Czeslaw Jeske, Michael Poppleton