4447 search results - page 163 / 890 » Model Checking Games |
145
click to vote
CAV
1998
Springer
15 years 8 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
155
click to vote
RTSS
1997
IEEE
15 years 8 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
click to vote
SPIN
2010
Springer
15 years 2 months 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...
142
click to vote
ICFEM
2009
Springer
15 years 1 months 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...
132
click to vote
USS
2008
15 years 6 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...