Sciweavers

450 search results - page 59 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
FASE
2009
Springer
14 years 3 months ago
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
Marieke Huisman, Alejandro Tamalet
FMICS
2007
Springer
14 years 3 months ago
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
Leonard Lensink, Sjaak Smetsers, Marko C. J. D. va...
IJCAI
1997
13 years 10 months ago
Anytime Belief Revision
Belief Revision is a ubiquitous process underlying many forms of intelligent behaviour. The AGM paradigm is a powerful framework for modeling and implementing belief revision syst...
Mary-Anne Williams
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
NPL
2008
130views more  NPL 2008»
13 years 8 months ago
Adaptive Inverse Control of Excitation System with Actuator Uncertainty
: - This paper addresses an inverse controller design for excitation system with changing parameters and nonsmooth nonlinearities in the actuator. The existence of such nonlinearit...
Xiaofang Yuan, Yaonan Wang, Liang-Hong Wu