Results 21  30
of
409
Counterexampleguided synthesis of observation predicates
 In FORMATS
, 2012
"... Abstract. We present a novel approach to the safety controller synthesis problem with partial observability for realtime systems. This in general undecidable problem can be reduced to a decidable one by fixing the granularity of the controller: finite sets of clocks and constants in the guards. C ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We present a novel approach to the safety controller synthesis problem with partial observability for realtime systems. This in general undecidable problem can be reduced to a decidable one by fixing the granularity of the controller: finite sets of clocks and constants in the guards
On the Complexity of Gödel’s Proof Predicate
, 2009
"... The undecidability of firstorder logic implies that there is no computable bound on the length of shortest proofs of valid sentences of firstorder logic. Some valid sentences can only have quite long proofs. How hard is it to prove such “hard ” valid sentences? The polynomial time tractability of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of this problem would imply the fixedparameter tractability of the parameterized problem that, given a natural number n in unary as input and a firstorder sentence ϕ as parameter, asks whether ϕ has a proof of length ≤ n. As the underlying classical problem has been considered by Gödel we denote this problem
Probabilistic PredicateAware Modulo Scheduling
"... Predicated execution enables the removal of branches by converting segments of branching code into sequences of conditional operations. An important side effect of this transformation is that the compiler must unconditionally assign resources to predicated operations. However, a resource is only put ..."
Abstract
 Add to MetaCart
their predicates evaluate to True. A predicateaware VLIW processor pipeline detects such conflicts, recovers, and correctly executes the conflicting operations. By increasing the effective throughput of a fixed set of resources, probabilistic predicateaware scheduling provided an average of 20 % performance gain
Back to the future: Pointcuts as predicates over traces
 In Workshop on Foundations of AspectOriented Languages (FOAL) at AOSD’05
, 2005
"... Pointcuts in aspectoriented languages can be seen as predicates over events in the computation of a program. The ability to express temporal relations between such events is a key feature towards more expressive pointcut languages. In this paper, we describe the design and implementation of a poin ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
pointcut language within which pointcuts are predicates over the complete execution trace of the program. In particular, pointcuts may refer to events that will happen in the future. In this model, advice application is an iterative process that stops once a fixedpoint is reached. On the negative side
Categorial Grammars, Lexical Rules and the English Predicative
 Formal Grammar: Theory and Implementation
, 1995
"... this paper, we will study the possibilities for applying lexical rules to the analysis of English syntax, and in particular the structure of the verb phrase. We will develop a lexicon whose empirical coverage extends to the full range of verb subcategories, complex adverbial phrases, auxiliaries, th ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
, the passive construction, yes/no questions and the particularly troublesome case of predicatives. The effect of a lexical rule, in our system, will be to produce new lexical entries from old lexical entries. The similarity between our system and the metarule system of generalized phrasestructure grammar
New Foundations for Fixpoint Computations: FIXHyperdoctrines and the FIXLogic
"... This paper introduces a new higherorder typed constructive predicate logic for fixpoint computations, which exploits the categorical semantics of computations introduced by Moggi [Mog 89] and contains a version of Martin Löf’s ‘iteration type’ [MarL 83]. The type system enforces a separation of com ..."
Abstract

Cited by 43 (8 self)
 Add to MetaCart
This paper introduces a new higherorder typed constructive predicate logic for fixpoint computations, which exploits the categorical semantics of computations introduced by Moggi [Mog 89] and contains a version of Martin Löf’s ‘iteration type’ [MarL 83]. The type system enforces a separation
Relating Multifunctions and Predicate Transformers through Closure Operators
 of Lecture Notes in Computer Science
, 1994
"... . We study relations between predicate transformers and multifunctions in a topological setting based on closure operators. We give topological definitions of safety and liveness predicates and using these predicates we define predicate transformers. State transformers are multifunctions with values ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
with values in the collection of fixed points of a closure operator. We derive several isomorphisms between predicate transformers and multifunctions. By choosing different closure operators we obtain multifunctions based on the usual power set construction, on the Hoare, Smyth and Plotkin power domains
Detecting Quantified Global Predicates in Parallel Programs
, 1995
"... Global predicates in parallel programs are predicates considering the state of more than one process. They are a useful concept for debugging parallel programs, e.g., for specifying assertions or breakpoints. In this paper 9predicates are defined and examined, a restricted class of global predica ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. Furthermore, it is outlined how 9predicates can be used for global breakpoints and where to stop a parallel program reaching such a breakpoint. The underlying machine models is a fixed set of processes communicating by message passing or shared memory.
Extending mapreduce for efficient predicatebased sampling
 In ICDE
, 2012
"... Abstract—In this paper we address the problem of using MapReduce to sample a massive data set in order to produce a fixedsize sample whose contents satisfy a given predicate. While it is simple to express this computation using MapReduce, its default Hadoop execution is dependent on the input size ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract—In this paper we address the problem of using MapReduce to sample a massive data set in order to produce a fixedsize sample whose contents satisfy a given predicate. While it is simple to express this computation using MapReduce, its default Hadoop execution is dependent on the input size
An Efficient Method for Eliminating Varying Predicates from a Circumscription
, 1992
"... Circumscription appears to be the most powerful and wellstudied technique used in formalizing commonsense reasoning. The general form of predicate circumscription allows for fixed and varying (floating) predicates. We show that the inference problem under this form of circumscription is efficientl ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Circumscription appears to be the most powerful and wellstudied technique used in formalizing commonsense reasoning. The general form of predicate circumscription allows for fixed and varying (floating) predicates. We show that the inference problem under this form of circumscription
Results 21  30
of
409