Sciweavers

861 search results - page 62 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 3 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
SIGDOC
2006
ACM
15 years 9 months ago
Handling objects: a scenario based approach
We report on the development of a tool which supports software programmers in programming to an interface by providing just in time (JIT) solutions. The development of the tool wa...
Thomas George Kannampallil, John M. Daughtry III
PLDI
2006
ACM
15 years 9 months ago
Continuations and transducer composition
On-line transducers are an important class of computational agent; we construct and compose together many software systems using them, such as stream processors, layered network p...
Olin Shivers, Matthew Might
CGO
2008
IEEE
15 years 9 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
POPL
2010
ACM
16 years 14 days ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...