4 research outputs found
Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
The paper presents probabilistic extensions of interval temporal logic (ITL)
and duration calculus (DC) with infinite intervals and complete Hilbert-style
proof systems for them. The completeness results are a strong completeness
theorem for the system of probabilistic ITL with respect to an abstract
semantics and a relative completeness theorem for the system of probabilistic
DC with respect to real-time semantics. The proposed systems subsume
probabilistic real-time DC as known from the literature. A correspondence
between the proposed systems and a system of probabilistic interval temporal
logic with finite intervals and expanding modalities is established too.Comment: 43 page
Correct synthesis and integration of compiler-generated function units
PhD ThesisComputer architectures can use custom logic in addition to general pur-
pose processors to improve performance for a variety of applications. The
use of custom logic allows greater parallelism for some algorithms. While
conventional CPUs typically operate on words, ne-grained custom logic
can improve e ciency for many bit level operations. The commodi ca-
tion of eld programmable devices, particularly FPGAs, has improved
the viability of using custom logic in an architecture.
This thesis introduces an approach to reasoning about the correctness of
compilers that generate custom logic that can be synthesized to provide
hardware acceleration for a given application. Compiler intermediate
representations (IRs) and transformations that are relevant to genera-
tion of custom logic are presented. Architectures may vary in the way
that custom logic is incorporated, and suitable abstractions are used in
order that the results apply to compilation for a variety of the design
parameters that are introduced by the use of custom logic