Sciweavers

1809 search results - page 165 / 362
» Software Model Checking Using Linear Constraints
Sort
View
ICFEM
2007
Springer
14 years 1 months ago
Testing for Refinement in CSP
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
Ana Cavalcanti, Marie-Claude Gaudel
SP
2003
IEEE
121views Security Privacy» more  SP 2003»
14 years 2 months ago
Specifying and Verifying Hardware for Tamper-Resistant Software
We specify a hardware architecture that supports tamper-resistant software by identifying an “idealized” hich gives the abstracted actions available to a single user program. ...
David Lie, John C. Mitchell, Chandramohan A. Thekk...
ATAL
2010
Springer
13 years 9 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
AMAST
2006
Springer
14 years 1 months ago
A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker
Abstract. Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence o...
Alastair F. Donaldson, Alice Miller
JSS
2010
136views more  JSS 2010»
13 years 4 months ago
Automated diagnosis of feature model configurations
Software product-lines (SPLs) are software architectures that can be readily reconfigured for different project requirements. A key part of an SPL is a model that captures the rul...
Jules White, David Benavides, Douglas C. Schmidt, ...