Sciweavers

1763 search results - page 115 / 353
» A Formalization of Polytime Functions
Sort
View
POPL
2005
ACM
15 years 10 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
IEAAIE
2009
Springer
15 years 4 months ago
A Virtual Human Agent Model with Behaviour Based on Feeling Exhaustion
A computational agent model for monitoring and control of a virtual human agent’s resources and exhaustion is presented. It models a physically grounded intelligent decision maki...
Jan Treur
CAV
2007
Springer
118views Hardware» more  CAV 2007»
15 years 4 months ago
C32SAT: Checking C Expressions
C32SAT is a tool for checking C expressions. It can check whether a given C expression can be satisfied, is tautological, or always defined according to the ISO C99 standard. C32...
Robert Brummayer, Armin Biere
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
15 years 3 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton
ISCIS
2005
Springer
15 years 3 months ago
Recovering the Lattice of Repetitive Sub-functions
Abstract. Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...