1264 search results - page 141 / 253 » Towards Theory Translation |
167
click to vote
CAV
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
144
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
174
Voted
FASE
2005
Springer
15 years 11 months ago
2005
Springer
Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entitie...
193
click to vote
AIIA
1995
Springer
15 years 9 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
171
click to vote
BPM
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...