Sciweavers

253 search results - page 35 / 51
» Imperative self-adjusting computation
Sort
View
ACSC
2004
IEEE
13 years 11 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
CONCUR
2006
Springer
13 years 11 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
ARTS
1997
Springer
13 years 11 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
WSCG
2004
130views more  WSCG 2004»
13 years 9 months ago
A Hybrid Approach to Rendering Handwritten Characters
With the growing popularity of pen-based computers comes the need to display clear handwritten characters at small sizes on low-resolution displays. This paper describes a method ...
Sara L. Su, Chenyu Wu, Ying-Qing Xu, Heung-Yeung S...
DAGSTUHL
1996
13 years 9 months ago
Pragmatics of Type-Directed Partial Evaluation
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
Olivier Danvy