Sciweavers

2736 search results - page 139 / 548
» Implementable allocation rules
Sort
View
SIGSOFT
2003
ACM
16 years 1 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
15 years 9 months ago
Hardware synthesis from guarded atomic actions with performance specifications
We present a new hardware synthesis methodology for guarded atomic actions (or rules), which satisfies performance-related scheduling specifications provided by the designer. The ...
Daniel L. Rosenband
FM
2003
Springer
160views Formal Methods» more  FM 2003»
15 years 6 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan
96
Voted
DTJ
1998
66views more  DTJ 1998»
15 years 13 days ago
DART: Fast Application-level Networking via Data-copy Avoidance
the window scaling extension, to abstractly support the advertisement of more than 64 kbytes of receive buffering. The rest of the improvements derived from implementation efforts ...
Robert J. Walsh
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 4 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea