Sciweavers

125 search results - page 22 / 25
» Computing Over-Approximations with Bounded Model Checking
Sort
View
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CONCUR
2000
Springer
14 years 20 hour ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
FMCAD
2007
Springer
13 years 11 months ago
Boosting Verification by Automatic Tuning of Decision Procedures
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
Frank Hutter, Domagoj Babic, Holger H. Hoos, Alan ...
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ECAI
2008
Springer
13 years 9 months ago
Coalition Structures in Weighted Voting Games
Abstract. Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can co...
Edith Elkind, Georgios Chalkiadakis, Nicholas R. J...