Sciweavers

383 search results - page 57 / 77
» Testing Concurrent Systems: A Formal Approach
Sort
View
138
Voted
ASE
2002
160views more  ASE 2002»
15 years 3 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
137
Voted
FAC
2007
128views more  FAC 2007»
15 years 3 months ago
Verifying a signature architecture: a comparative case study
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
David A. Basin, Hironobu Kuruma, Kunihiko Miyazaki...
139
Voted
PPDP
2007
Springer
15 years 9 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
ATAL
2006
Springer
15 years 5 months ago
Selecting informative actions improves cooperative multiagent learning
In concurrent cooperative multiagent learning, each agent simultaneously learns to improve the overall performance of the team, with no direct control over the actions chosen by i...
Liviu Panait, Sean Luke
119
Voted
COORDINATION
2009
Springer
16 years 3 months ago
Mobility Models and Behavioural Equivalence for Wireless Networks
In protocol development for wireless systems, the choice of appropriate mobility models describing the movement patterns of devices has long been recognised as a crucial factor for...
Jens Chr. Godskesen, Sebastian Nanz