195 search results - page 30 / 39 » Efficient Model Checking of PSL Safety Properties |
93
Voted
ENTCS
2006
14 years 11 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
ESORICS
2008
Springer
15 years 1 months ago
2008
Springer
We are interested in this problem: a verifier, with a small and reliable storage, wants to periodically check whether a remote server is keeping a large file x. A dishonest server,...
205
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
96
Voted
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...