499 search results - page 84 / 100 » LTL satisfiability checking |
RTAS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an assume-guarantee interface algebra for real-time components. In our formalism a component implements a set of task sequences that share a resource. A component inter...
DALT
2005
Springer
15 years 3 months ago
2005
Springer
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
CASSIS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper addresses the problem of static checking of programs to ensure that they satisfy confidentiality policies in the presence of dynamic access control in the for...
RAID
2004
Springer
15 years 2 months ago
2004
Springer
We present a formal framework for the analysis of intrusion detection systems (IDS) that employ declarative rules for attack recognition, e.g. specification-based intrusion detect...
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...