Sciweavers

253 search results - page 8 / 51
» How to Transform an Analyzer into a Verifier
Sort
View
FASE
1998
Springer
13 years 11 months ago
Compositional Verification of Reactive Systems Specified by Graph Transformation
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual t...
Reiko Heckel
OTM
2004
Springer
14 years 25 days ago
Transforming UMM Business Collaboration Models to BPEL
UN/CEFACT’s Modeling Methodology (UMM) has been developed to analyze and design B2B business processes independent of the underlying exchange technology. It became the methodolog...
Birgit Hofreiter, Christian Huemer
CICLING
2009
Springer
14 years 8 months ago
A General Method for Transforming Standard Parsers into Error-Repair Parsers
A desirable property for any system dealing with unrestricted natural language text is robustness, the ability to analyze any input regardless of its grammaticality. In this paper ...
Carlos Gómez-Rodríguez, Miguel A. Al...
ICIAR
2005
Springer
14 years 1 months ago
Text-Pose Estimation in 3D Using Edge-Direction Distributions
Abstract. This paper presents a method for estimating the orientation of planar text surfaces using the edge-direction distribution (EDD) extracted from the image as input to a neu...
Marius Bulacu, Lambert Schomaker
FMSD
2002
114views more  FMSD 2002»
13 years 7 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa