Sciweavers

2944 search results - page 497 / 589
» Improving Bound Propagation
Sort
View
LPAR
2005
Springer
15 years 12 months ago
Concepts of Automata Construction from LTL
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
Carsten Fritz
SIGADA
2005
Springer
15 years 12 months ago
Temporal skeletons for verifying time
This paper presents an intermediate notation used in a framework for verification of real-time properties. The framework aims at overcoming the need for the framework user to hav...
Gustaf Naeser, Kristina Lundqvist, Lars Asplund
TGC
2005
Springer
15 years 12 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 12 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
CASES
2004
ACM
15 years 11 months ago
Memory overflow protection for embedded systems using run-time checks, reuse and compression
Title of thesis: MEMORY OVERFLOW PROTECTION FOR EMBEDDED SYSTEMS USING RUN-TIME CHECKS, REUSE AND COMPRESSION Surupa Biswas, Master of Science, 2004 Thesis directed by: Assistant ...
Surupa Biswas, Matthew Simpson, Rajeev Barua