Sciweavers

489 search results - page 46 / 98
» Reasoning about confidentiality at requirements engineering ...
Sort
View
76
Voted
IPMU
2010
Springer
15 years 4 months ago
Modelling Patterns of Evidence in Bayesian Networks: A Case-Study in Classical Swine Fever
Upon engineering a Bayesian network for the early detection of Classical Swine Fever in pigs, we found that the commonly used approach of separately modelling the relevant observab...
Linda C. van der Gaag, Janneke H. Bolt, Willie Loe...
100
Voted
TPHOL
2008
IEEE
15 years 6 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy
CAV
2005
Springer
173views Hardware» more  CAV 2005»
15 years 6 months ago
Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework
Model checking has proven to be an effective technology for verification and debugging in hardware and more recently in software domains. We believe that recent trends in both th...
Matthew B. Dwyer, John Hatcliff, Matthew Hoosier, ...
FOSSACS
2007
Springer
15 years 6 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ESEC
1997
Springer
15 years 4 months ago
Executable Connectors: Towards Reusable Design Elements
The decomposition of a software application into components and connectors at the design stage has been promoted as a way to describe and reason about complex software architecture...
Stéphane Ducasse, Tamar Richner