Sciweavers

323 search results - page 47 / 65
» Verifying the Mondex Case Study
Sort
View
GPCE
2009
Springer
14 years 2 months ago
Safe composition of non-monotonic features
Programs can be composed from features. We want to verify automatically that all legal combinations of features can be composed safely without errors. Prior work on this problem a...
Martin Kuhlemann, Don S. Batory, Christian Kä...
COMPGEOM
1997
ACM
14 years 2 months ago
Realistic Input Models for Geometric Algorithms
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
Mark de Berg, Matthew J. Katz, A. Frank van der St...
ESEC
1997
Springer
14 years 2 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
FORMATS
2009
Springer
14 years 1 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
ICDE
2007
IEEE
146views Database» more  ICDE 2007»
14 years 1 months ago
Index-based Most Similar Trajectory Search
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...
Elias Frentzos, Kostas Gratsias, Yannis Theodoridi...