1157 search results - page 41 / 232 » Descriptive Complexity and Model Checking |
ICSE
2003
IEEE-ACM
14 years 3 months ago
2003
IEEE-ACM
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
ACSD
2003
IEEE
14 years 3 months ago
2003
IEEE
As modern embedded systems become more integrated and complex, it is crucial to be able to represent systems ple levels of abstraction, so that the design space can be effectively...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
ENTCS
2008
13 years 10 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...