7434 search results - page 278 / 1487 » Still |
183
click to vote
SPIN
2004
Springer
16 years 2 days ago
2004
Springer
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
181
click to vote
UIALL
2004
Springer
16 years 2 days ago
2004
Springer
At present, various types of car navigation systems are progressively entering the market. Simultaneously, mobile outdoor navigation systems for pedestrians and electronic tourist ...
150
click to vote
VMCAI
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotati...
240
click to vote
VOSS
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
145
click to vote
WAOA
2004
Springer
16 years 2 days ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...