1226 search results - page 87 / 246 » Proofs, Programs and Abstract Complexity |
179
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
264
click to vote
ERSHOV
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
138
click to vote
ACTAC
2002
15 years 6 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
126
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
164
click to vote
ECAI
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We call verification the process of finding the actual explanation of a given set of manifestations. We consider an abductive setting, in which explanations are sets of a...