Sciweavers

630 search results - page 52 / 126
» Combining Two Formalism for Reasoning about Concepts
Sort
View
IEEEPACT
2000
IEEE
14 years 1 months ago
Fine Grained Multithreading with Process Calculi
ÐThis paper presents a multithreaded abstract machine for the TyCO process calculus. We argue that process calculi provide a powerful framework to reason about fine-grained parall...
Luís M. B. Lopes, Fernando M. A. Silva, Vas...
CSFW
1997
IEEE
14 years 1 months ago
Verifying authentication protocols with CSP
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by ...
Steve Schneider
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 2 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
EMSOFT
2006
Springer
14 years 13 days ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...