1023 search results - page 161 / 205 » A Formal Method for Program Slicing |
103
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
130
click to vote
CAV
2007
Springer
15 years 7 months ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
100
click to vote
FORMATS
2007
Springer
15 years 7 months 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...
116
click to vote
IFM
2007
Springer
15 years 7 months 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...
101
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
There is a wide agreement on the use of norms in order to specify the expected behaviour of agents in open MAS. However, in highly regulated domains, where norms dictate what can a...