10899 search results - page 255 / 2180 » The GP Programming System |
144
Voted
CAV
2004
Springer
15 years 11 months ago
2004
Springer
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
119
click to vote
IRAL
2003
ACM
15 years 10 months ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
155
Voted
FMICS
2006
Springer
15 years 9 months ago
2006
Springer
Formal specifications are more useful and easier to develop if they are executable. In this work, we describe a system for executing specifications written in the Java Modeling Lan...
172
click to vote
LOPSTR
2000
Springer
15 years 9 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
173
click to vote
CASCON
2001
15 years 7 months ago
2001
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...