Sciweavers

691 search results - page 44 / 139
» Automatically Proving Linearizability
Sort
View
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 3 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
ASM
2008
ASM
15 years 1 months ago
Model Checking Event-B by Encoding into Alloy
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
Paulo J. Matos, João Marques-Silva
FMOODS
2008
15 years 1 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
NIPS
2004
15 years 1 months ago
Stable adaptive control with online learning
Learning algorithms have enjoyed numerous successes in robotic control tasks. In problems with time-varying dynamics, online learning methods have also proved to be a powerful too...
Andrew Y. Ng, H. Jin Kim
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 12 months ago
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
Hans Zantema