Sciweavers

481 search results - page 1 / 97
» Model Checking Abstract State Machines and Beyond
Sort
View
LPAR
2005
Springer
13 years 10 months ago
Model Checking Abstract State Machines with Answer Set Programming
ECKING ABSTRACT STATE MACHINES WITH ANSWER SET PROGRAMMING by Calvin Kai Fan Tang B.Sc., Simon Fraser University, 2003 a thesis submitted in partial fulfillment of the requirements...
Calvin Kai Fan Tang, Eugenia Ternovska
PAPM
2001
Springer
126views Mathematics» more  PAPM 2001»
13 years 9 months ago
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
Gabriel G. Infante López, Holger Hermanns, ...
SIGCOMM
2006
ACM
13 years 11 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...