Sciweavers

691 search results - page 57 / 139
» Automatically Proving Linearizability
Sort
View
COMPSAC
2003
IEEE
14 years 3 months ago
Automated Metamorphic Testing
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs fo...
Arnaud Gotlieb, Bernard Botella
DATE
2003
IEEE
108views Hardware» more  DATE 2003»
14 years 3 months ago
Generalized Posynomial Performance Modeling
This paper presents a new method to automatically generate posynomial symbolic expressions for the performance characteristics of analog integrated circuits. The coefficient set ...
Tom Eeckelaert, Walter Daems, Georges G. E. Gielen...
CAV
2004
Springer
140views Hardware» more  CAV 2004»
14 years 1 months ago
Indexed Predicate Discovery for Unbounded System Verification
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
Shuvendu K. Lahiri, Randal E. Bryant
FM
2006
Springer
161views Formal Methods» more  FM 2006»
14 years 1 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller
CSFW
2010
IEEE
14 years 1 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin