2488 search results - page 305 / 498 » An improvement in formal verification |
112
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for temporal synthesis, l...
134
click to vote
PROVSEC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
105
Voted
ICSE
2009
IEEE-ACM
14 years 11 months ago
2009
IEEE-ACM
Aerospace systems have strict dependability and real-time requirements, as well as a need for flexible resource reallocation and reduced size, weight and power consumption. To cope...
120
Voted
CONSTRAINTS
2010
14 years 11 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
131
click to vote
ENTCS
2010
14 years 11 months ago
2010
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...