Sciweavers

662 search results - page 43 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
113
Voted
FSTTCS
2004
Springer
15 years 8 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
EPEW
2006
Springer
15 years 4 months ago
The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System
This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...
121
Voted
FOSSACS
2005
Springer
15 years 8 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
120
Voted
FIW
2007
133views Communications» more  FIW 2007»
15 years 4 months ago
Conflict Detection in Call Control Using First-Order Logic Model Checking
Feature interaction detection methods, whether online or offline, depend on previous knowledge of conflicts between the actions executed by the features. This knowledge is usually ...
Ahmed F. Layouni, Luigi Logrippo, Kenneth J. Turne...
121
Voted
FORTE
2007
15 years 4 months ago
Transactional Reduction of Component Compositions
Behavioural protocols are beneficial to Component-Based Software Engineering and Service-Oriented Computing as they foster automatic procedures for discovery, composition, composi...
Serge Haddad, Pascal Poizat