164 search results - page 10 / 33 » Formal testing from timed finite state machines |
COMCOM
1998
14 years 9 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
118
click to vote
DALT
2005
Springer
15 years 3 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
COMPSAC
1996
IEEE
15 years 1 months ago
1996
IEEE
This paper discusses how conventional testing criteria such as branch coverage can be applied for the testing of member functions inside a class. To support such testing technique...
CICLING
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—The generation of device drivers is a very time consuming and error prone activity. All the strategies proposed up to now to simplify this operation require a manual, ev...