262 search results - page 8 / 53 » Verifying Web Applications Using Bounded Model Checking |
ICCD
2003
IEEE
15 years 8 months ago
2003
IEEE
Multiple clock domains are a challenge for hardware specification and verification. We present a method for specifying the relations between multiple clocks, and for modeling th...
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
84
Voted
DEDS
2006
14 years 11 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
151
click to vote
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
109
click to vote
CODES
2008
IEEE
15 years 1 months ago
2008
IEEE
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...