Sciweavers

1710 search results - page 32 / 342
» High-Level Programs and Program Conditions
Sort
View
SAC
2010
ACM
13 years 5 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
IJCNN
2000
IEEE
14 years 9 days ago
Comparison of a Heuristic Dynamic Programming and a Dual Heuristic Programming Based Adaptive Critics Neurocontroller for a Turb
: This paper presents the design of a neurocontroller for a turbogenerator that augments/replaces the conventional Automatic Voltage Regulator (AVR) and the turbine governor. The n...
Ganesh K. Venayagamoorthy, Ronald G. Harley, Donal...
MOR
2006
94views more  MOR 2006»
13 years 7 months ago
Conditional Risk Mappings
We introduce an axiomatic definition of a conditional convex risk mapping and we derive its properties. In particular, we prove a representation theorem for conditional risk mappi...
Andrzej Ruszczynski, Alexander Shapiro
ESOP
2001
Springer
14 years 13 days ago
Entailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
Zhendong Su, Alexander Aiken
IWPC
2000
IEEE
14 years 9 days ago
The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
Derek Rayside, Steve Reuss, Erik Hedges, Kostas Ko...