3335 search results - page 105 / 667 » Grid result checking |
144
click to vote
FMICS
2007
Springer
16 years 9 days 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 ...
157
click to vote
DAC
2006
ACM
16 years 3 days 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...
163
click to vote
ICTAC
2005
Springer
15 years 11 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...
150
click to vote
TACAS
2005
Springer
15 years 11 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 ...
182
click to vote
FSTTCS
2001
Springer
15 years 10 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...