2291 search results - page 259 / 459 » Representational Reasoning and Verification |
ENTCS
2008
13 years 10 months ago
2008
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
TSE
2008
13 years 10 months ago
2008
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Cryptographic check values (digital signatures, MACs and H-MACs) are useful only if they are free of errors. For that reason all of errors in cryptographic check values should be ...
TACAS
2010
Springer
13 years 8 months ago
2010
Springer
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
CONSTRAINTS
2010
13 years 8 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 ...