575 search results - page 43 / 115 » Model Checking Restricted Sets of Timed Paths |
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
116
click to vote
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
101
click to vote
ISCA
2005
IEEE
15 years 5 months ago
2005
IEEE
Instruction set customization is an effective way to improve processor performance. Critical portions of application dataflow graphs are collapsed for accelerated execution on s...
TAPSOFT
1991
Springer
15 years 3 months ago
1991
Springer
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
ASIACRYPT
2003
Springer
15 years 5 months ago
2003
Springer
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...