Now showing items 1-5 of 5
A Decision Procedure for Equality Logic with Uninterpreted Functions
The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced. Since it is based on the DPLL method, the ...
Robots as assistive technology - does appearance matter
This paper studies the eflect of a robot’s design (appearance) in facilitating and encouraging interaction of children with autism with a small humanoid robot. The paper compares the children’s level of interaction with ...
A Proof System and a Decision Procedure for Equality Logic
Equality Logic with uninterpreted functions is used for proving the equivalense or refinement between systems (hardware verification, compiler translation, etc). Current approaches for deciding this type of formulas use a ...
Input-dependency analysis for hard real-time software
(IEEE COMPUTER SOC, 2004)
The execution time of soft-ware for hard real-time systems must be predictable. Further safe and not overly pessimistic bounds for the worst-case execution time (WCET) must be computable. We conceived a programming strategy ...
Tracking Information Flow through the Environment: Simple Cases of Stigmerg
(MIT Press, 2004)
Recent work in sensor evolution aims at studying the perception-action loop in a formalized information-theoretic manner. By treating sensors as extracting information and actuators as having the capability to "imprint" ...