Sciweavers

798 search results - page 99 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
LICS
2003
IEEE
14 years 29 days ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
ENTCS
2002
145views more  ENTCS 2002»
13 years 7 months ago
Combining Monitors for Runtime System Verification
Runtime verification permits checking system properties that cannot be fully verified off-line. This is particularly true when the system includes complex third-party components, ...
Joshua Levy, Hassen Saïdi, Tomás E. Ur...
DEDS
2007
104views more  DEDS 2007»
13 years 7 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
ICPR
2008
IEEE
14 years 9 months ago
Image segmentation by convex quadratic programming
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
Mariano Rivera, Oscar Dalmau Cedeño, Josue ...
ICTAC
2005
Springer
14 years 1 months ago
Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
Reiko Heckel