Sciweavers

1157 search results - page 25 / 232
» Descriptive Complexity and Model Checking
Sort
View
ISSTA
2009
ACM
14 years 2 months ago
Specifying the worst case: orthogonal modeling of hardware errors
During testing, the execution of valid cases is only one part of the task. Checking the behavior in boundary situations and in the presence of errors is an equally important subje...
Jewgenij Botaschanjan, Benjamin Hummel
CADE
2002
Springer
14 years 7 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
IS
2010
13 years 6 months ago
Content value chains modelling using a copyright ontology
Existing Digital Rights Management systems, initiatives like Creative Commons or research works as some digital rights ontologies provide limited support for content value chains m...
Roberto García, Rosa Gil
FM
2003
Springer
115views Formal Methods» more  FM 2003»
14 years 23 days ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn
UML
2000
Springer
13 years 11 months ago
Reconciling the Needs of Architectural Description with Object-Modeling Notations
Complex software systems require expressive notations for representing their software architectures. Two competing paths have emerged. One is to use a specialized notation for arc...
David Garlan, Andrew Kompanek