Sciweavers

4340 search results - page 776 / 868
» Formal Methods and Cryptography
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 4 months ago
Automatic analysis of distance bounding protocols
Distance bounding protocols are used by nodes in wireless networks for the crucial purpose of estimating their distances to other nodes. Past efforts to analyze these protocols hav...
Sreekanth Malladi, Bezawada Bruhadeshwar, Kishore ...
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 4 months ago
Certifying cost annotations in compilers
We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the so...
Roberto M. Amadio, Nicholas Ayache, Yann Ré...
ENTCS
2010
88views more  ENTCS 2010»
15 years 4 months ago
On the Observable Behaviour of Composite Components
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
Rolf Hennicker, Stephan Janisch, Alexander Knapp
ALIFE
2006
15 years 4 months ago
Axiomatic Scalable Neurocontroller Analysis via the Shapley Value
One of the major challenges in the field of neurally driven evolved autonomous agents is deciphering the neural mechanisms underlying their behavior. Aiming at this goal, we have d...
Alon Keinan, Ben Sandbank, Claus C. Hilgetag, Isaa...
ENTCS
2008
140views more  ENTCS 2008»
15 years 4 months ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler