Sciweavers

783 search results - page 65 / 157
» Compositional Reasoning in Model Checking
Sort
View
FC
2010
Springer
169views Cryptology» more  FC 2010»
14 years 11 days ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
ISSTA
2006
ACM
14 years 3 months ago
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...
Jamieson M. Cobleigh, George S. Avrunin, Lori A. C...
IJCAI
2007
13 years 10 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
FUIN
2008
147views more  FUIN 2008»
13 years 9 months ago
A Basic Logic for Reasoning about Connector Reconfiguration
Abstract. Software systems evolve over time. From a component-based software engineering perspective, this means that either the components of the system need to change, or, if com...
Dave Clarke
CADE
2010
Springer
13 years 10 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise