Sciweavers

545 search results - page 77 / 109
» Recursive logic frames
Sort
View
TPHOL
2009
IEEE
15 years 4 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
15 years 4 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
BIOTECHNO
2008
IEEE
15 years 4 months ago
Mathematical Description of Biological Structures and Mechanisms
A new formalism and approach to describing cellular and molecular processes and structures is introduced, designed to support the creation of knowledge bases of molecular and cell...
H. Joel Jeffrey
DDECS
2007
IEEE
143views Hardware» more  DDECS 2007»
15 years 4 months ago
An Experimental Analysis of SEU Sensitiveness on System Knowledge-based Hardening Techniques
Logic Soft Errors caused by radiation are a major concern when working with circuits that need to operate in harsh environments, such as space or avionics applications, where soft ...
Oscar Ruano, Pilar Reyes, Juan Antonio Maestro, Lu...
IAT
2007
IEEE
15 years 4 months ago
Training Intelligent Agents in the Semantic Web Era: The Golf Advisor Agent
Agent training techniques study methods to embed empirical, inductive knowledge representations into intelligent agents, in dynamic, recursive or semi-automated ways, expressed in...
Ioannis N. Athanasiadis