499 search results - page 73 / 100 » LTL satisfiability checking |
101
click to vote
SIPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— In this paper, we propose partly parallel architectures based on optimal overlapped sum-product (OSP) decoding. To ensure high throughput and hardware utilization effi...
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
Most people have long term information interests. Current Web search engines satisfy immediate information needs. Specific sites support tracking of long term interests. We prese...
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
QSIC
2003
IEEE
15 years 5 months ago
2003
IEEE
Algebraic testing is an automated software testing method based on algebraic formal specifications. It tests if a program correctly implements an algebraic specification by checki...