4693 search results - page 44 / 939 » Verifying Hybrid Systems |
115
Voted
ISSTA
1998
ACM
15 years 4 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
128
click to vote
NA
2010
14 years 11 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
117
click to vote
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
SBMF
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper presents a case study on retrospective veri cation of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
100
click to vote
ARTS
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...