Sciweavers

351 search results - page 28 / 71
» Classical proof forestry
Sort
View
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
COMPUTING
2007
118views more  COMPUTING 2007»
13 years 7 months ago
The construction of good extensible Korobov rules
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
Josef Dick, Friedrich Pillichshammer, Benjamin J. ...
ESOP
2005
Springer
14 years 1 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
DCC
2001
IEEE
14 years 7 months ago
On Zador's Entropy-Constrained Quantization Theorem
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorith...
Robert M. Gray, Jia Li
SCL
2008
254views more  SCL 2008»
13 years 7 months ago
The Hybrid Maximum Principle is a consequence of Pontryagin Maximum Principle
We give a simple proof of the Maximum Principle for smooth hybrid control systems by reducing the hybrid problem to an optimal control problem of Pontryagin type and then by using...
A. V. Dmitruk, A. M. Kaganovich