Sciweavers

27 search results - page 2 / 6
» Open Modules: Modular Reasoning About Advice
Sort
View
JUCS
2007
108views more  JUCS 2007»
13 years 5 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
BIRTHDAY
2009
Springer
13 years 9 months ago
Modular Verification of Strongly Invasive Aspects
An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of a...
Emilia Katz, Shmuel Katz
AGP
1996
IEEE
13 years 9 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
13 years 11 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
LPAR
2010
Springer
13 years 3 months ago
Aligators for Arrays (Tool Paper)
This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out i...
Thomas A. Henzinger, Thibaud Hottelier, Laura Kov&...