Sciweavers

3738 search results - page 455 / 748
» Parametrized Logic Programming
Sort
View
POPL
2011
ACM
14 years 4 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
SIGSOFT
2002
ACM
16 years 1 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
ICFP
2007
ACM
16 years 1 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
INFORMS
1998
150views more  INFORMS 1998»
15 years 25 days ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
LOPSTR
2007
Springer
15 years 7 months ago
Snapshot Generation in a Constructive Object-Oriented Modeling Language
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
Mauro Ferrari, Camillo Fiorentini, Alberto Momigli...