1818 search results - page 237 / 364 » Granularity-Adaptive Proof Presentation |
128
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
133
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
165
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
138
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The theme of this paper is certifying software for state estimation of dynamic systems, which is an important problem found in spacecraft, aircraft, geophysical, and in m...
126
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...