489 search results - page 48 / 98 » Reasoning about confidentiality at requirements engineering ... |
87
Voted
RE
1999
Springer
15 years 4 months ago
1999
Springer
Scenarios have proven effective for eliciting, describing and validating software requirements; however, scenario management continues to be a significant challenge to practition...
132
click to vote
TACAS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
91
Voted
GLVLSI
2009
IEEE
15 years 7 months ago
2009
IEEE
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...
200
Voted
POPL
2004
ACM
16 years 24 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
107
click to vote
AIM
2006
15 years 17 days ago
2006
maintain awareness of its environment for a long period of time. Additionally, knowledge-intensive agents must be engineered such that their knowledge can be easily updated as envi...