186 search results - page 11 / 38 » Grammar constraints |
SAS
1999
Springer
13 years 11 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
ETAI
2000
13 years 7 months ago
2000
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
In this paper we present an innovative approach to automatically generate adjacency grammars describing graphical symbols. A grammar production is formulated in terms of rulesets ...
CC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
TSE
2008
13 years 7 months ago
2008
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...