Sciweavers

12272 search results - page 402 / 2455
» Experimental program analysis
Sort
View
DLS
2009
150views Languages» more  DLS 2009»
15 years 4 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...
OL
2011
332views Neural Networks» more  OL 2011»
15 years 1 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
14 years 2 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
ISORC
2007
IEEE
16 years 1 months ago
Experiences from Applying WCET Analysis in Industrial Settings
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. Today, measurement-based timing analysis tools such as in-ci...
Jan Gustafsson, Andreas Ermedahl
PEPM
1993
ACM
15 years 11 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel