3335 search results - page 105 / 667 » Grid result checking |
116
Voted
FMICS
2007
Springer
15 years 9 months ago
2007
Springer
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
122
click to vote
DAC
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
136
click to vote
ICTAC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
113
click to vote
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
141
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...