3909 search results - page 135 / 782 » Extreme Model Checking |
140
click to vote
RTSS
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
142
Voted
FORMATS
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
127
Voted
SPIN
2010
Springer
15 years 28 days ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
129
Voted
ICFEM
2009
Springer
15 years 8 days ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
115
click to vote
USS
2008
15 years 4 months ago
2008
Cross-site scripting (XSS) and SQL injection errors are two prominent examples of taint-based vulnerabilities that have been responsible for a large number of security breaches in...