Sciweavers

261 search results - page 48 / 53
» Formal Proof from UML Models
Sort
View
CAISE
2004
Springer
14 years 2 months ago
Ontology for Characterising Architecture Frameworks
This paper outlines an ontology for characterising architecture frameworks. The ontology is based on the metamodel of MAF, and is currently being tried out on a set of well-known e...
Oddrun Pauline Ohren
MBEES
2008
13 years 10 months ago
Composition of Model-based Test Coverage Criteria
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
Mario Friske, Bernd-Holger Schlingloff, Stephan We...
AGTIVE
2003
Springer
14 years 1 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
ESOP
2010
Springer
14 years 6 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
14 years 9 days ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir