Many important decidability results in malware analysis are based on Turing machine models of computation. We exhibit computational models that use more realistic assumptions about machine and attacker resources. While seminal results such as [1–5] remain true for Turing machines, we show that under more realistic assumptions important tasks are decidable… (More)
This paper formalizes some proofs by Clarkson and Schneider about hyperproperties. The proofs are mechanically verified using the proof assistant Isabelle.
Current work deals with the design of a local unit, micro-controller based to acquire signals from a set of sensors and locally diagnose on the air quality. The local unit permits the interface with standards atmospheric and meteorological sensors, as well as the communication with a central unit by message passing protocol, via GSM. A fuzzy inference… (More)