Sciweavers

4502 search results - page 326 / 901
» Regular Model Checking
Sort
View
JFP
2006
78views more  JFP 2006»
15 years 6 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
15 years 11 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
SCALESPACE
2007
Springer
16 years 25 days ago
Level Set Methods for Watershed Image Segmentation
In this work a marker-controlled and regularized watershed segmentation is proposed. Only a few previous studies address the task of regularizing the obtained watershed lines from ...
Xue-Cheng Tai, Erlend Hodneland, Joachim Weickert,...
WCRE
2003
IEEE
15 years 12 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
145
Voted
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
16 years 8 days ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik