Sciweavers

119 search results - page 17 / 24
» Assertion Application in Theorem Proving and Proof Planning
Sort
View
POPL
2009
ACM
14 years 9 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
AAAI
2010
13 years 10 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 3 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
JCT
1998
193views more  JCT 1998»
13 years 8 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
FAC
2008
97views more  FAC 2008»
13 years 8 months ago
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
Julien Schmaltz, Dominique Borrione