979 research outputs found
Typable Fragments of Polynomial Automatic Amortized Resource Analysis
Being a fully automated technique for resource analysis, automatic amortized resource analysis (AARA) can fail in returning worst-case cost bounds of programs, fundamentally due to the undecidability of resource analysis. For programmers who are unfamiliar with the technical details of AARA, it is difficult to predict whether a program can be successfully analyzed in AARA. Motivated by this problem, this article identifies classes of programs that can be analyzed in type-based polynomial AARA. Firstly, it is shown that the set of functions that are typable in univariate polynomial AARA coincides with the complexity class PTime. Secondly, the article presents a sufficient condition for typability that axiomatically requires every sub-expression of a given program to be polynomial-time. It is proved that this condition implies typability in multivariate polynomial AARA under some syntactic restrictions
Compact Argumentation Frameworks
Abstract argumentation frameworks (AFs) are one of the most studied
formalisms in AI. In this work, we introduce a certain subclass of AFs which we
call compact. Given an extension-based semantics, the corresponding compact AFs
are characterized by the feature that each argument of the AF occurs in at
least one extension. This not only guarantees a certain notion of fairness;
compact AFs are thus also minimal in the sense that no argument can be removed
without changing the outcome. We address the following questions in the paper:
(1) How are the classes of compact AFs related for different semantics? (2)
Under which circumstances can AFs be transformed into equivalent compact ones?
(3) Finally, we show that compact AFs are indeed a non-trivial subclass, since
the verification problem remains coNP-hard for certain semantics.Comment: Contribution to the 15th International Workshop on Non-Monotonic
Reasoning, 2014, Vienn
Relational reasoning via probabilistic coupling
Probabilistic coupling is a powerful tool for analyzing pairs of
probabilistic processes. Roughly, coupling two processes requires finding an
appropriate witness process that models both processes in the same probability
space. Couplings are powerful tools proving properties about the relation
between two processes, include reasoning about convergence of distributions and
stochastic dominance---a probabilistic version of a monotonicity property.
While the mathematical definition of coupling looks rather complex and
cumbersome to manipulate, we show that the relational program logic pRHL---the
logic underlying the EasyCrypt cryptographic proof assistant---already
internalizes a generalization of probabilistic coupling. With this insight,
constructing couplings is no harder than constructing logical proofs. We
demonstrate how to express and verify classic examples of couplings in pRHL,
and we mechanically verify several couplings in EasyCrypt
Probabilistic Semantics: Metric and Logical Character\ua8ations for Nondeterministic Probabilistic Processes
In this thesis we focus on processes with nondeterminism and probability in the PTS model, and we propose novel techniques to study their semantics, in terms of both classic behavioral relations and the more recent behavioral metrics.
Firstly, we propose a method for decomposing modal formulae in a probabilistic extension of the Hennessy-Milner logic. This decomposition method allows us to derive the compositional properties of probabilistic (bi)simulations.
Then, we propose original notions of metrics measuring the disparities in the behavior of processes with respect to (decorated) trace and testing semantics.
To capture the differences in the expressive power of the metrics we order them by the relation `makes processes further than'.
Thus, we obtain the first spectrum of behavioral metrics on the PTS model.
From this spectrum we derive an analogous one for the kernels of the metrics, ordered by the relation `makes strictly less identification than'.
Finally, we introduce a novel technique for the logical characterization of both behavioral metrics and their kernels, based on the notions of mimicking formula and distance on formulae.
This kind of characterization allows us to obtain the first example of a spectrum of distances on processes obtained directly from logics.
Moreover, we show that the kernels of the metrics can be characterized by simply comparing the mimicking formulae of processes
Probabilistic Semantics: Metric and Logical Characteršations for Nondeterministic Probabilistic Processes
In this thesis we focus on processes with nondeterminism and probability in the PTS model, and we propose novel techniques to study their semantics, in terms of both classic behavioral relations and the more recent behavioral metrics.
Firstly, we propose a method for decomposing modal formulae in a probabilistic extension of the Hennessy-Milner logic. This decomposition method allows us to derive the compositional properties of probabilistic (bi)simulations.
Then, we propose original notions of metrics measuring the disparities in the behavior of processes with respect to (decorated) trace and testing semantics.
To capture the differences in the expressive power of the metrics we order them by the relation `makes processes further than'.
Thus, we obtain the first spectrum of behavioral metrics on the PTS model.
From this spectrum we derive an analogous one for the kernels of the metrics, ordered by the relation `makes strictly less identification than'.
Finally, we introduce a novel technique for the logical characterization of both behavioral metrics and their kernels, based on the notions of mimicking formula and distance on formulae.
This kind of characterization allows us to obtain the first example of a spectrum of distances on processes obtained directly from logics.
Moreover, we show that the kernels of the metrics can be characterized by simply comparing the mimicking formulae of processes
The use of data-mining for the automatic formation of tactics
This paper discusses the usse of data-mining for the automatic formation of tactics. It was presented at the Workshop on Computer-Supported Mathematical Theory Development held at IJCAR in 2004. The aim of this project is to evaluate the applicability of data-mining techniques to the automatic formation of tactics from large corpuses of proofs. We data-mine information from large proof corpuses to find commonly occurring patterns. These patterns are then evolved into tactics using genetic programming techniques
- âŠ