4036 search results - page 496 / 808 » Formal Methods |
157
click to vote
FORMATS
2007
Springer
16 years 25 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
176
click to vote
FORMATS
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
182
click to vote
IFL
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
192
click to vote
IFM
2007
Springer
16 years 25 days ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
191
click to vote
RSEISP
2007
Springer
16 years 24 days ago
2007
Springer
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...