Sciweavers

31 search results - page 2 / 7
» A Grammar Checking System for Punjabi
Sort
View
CONCUR
2004
Springer
14 years 23 days ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
HASE
2008
IEEE
14 years 1 months ago
A Grammar-Based Reverse Engineering Framework for Behavior Verification
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
Chunying Zhao, Kang Zhang
CUZA
2004
81views more  CUZA 2004»
13 years 7 months ago
The Quick Check Pre-unification Filter for Typed Grammars: Further Advances
We present several significant improvements in the implementation of the quick check pre-unification filter [7] [10], and the potential way in which the design of the quick check [...
Liviu-Virgil Ciortuz
IDA
2007
Springer
13 years 7 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ECMDAFA
2009
Springer
98views Hardware» more  ECMDAFA 2009»
14 years 1 months ago
A Language-Theoretic View on Guidelines and Consistency Rules of UML
Abstract. Guidelines and consistency rules of UML are used to control the degrees of freedom provided by the language to prevent faults. Guidelines are used in specific domains (e...
Zhe Chen, Gilles Motet