Sciweavers

35 search results - page 5 / 7
» Logic-flow analysis of higher-order programs
Sort
View
FOSSACS
2007
Springer
14 years 5 days ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
ICASSP
2011
IEEE
12 years 9 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
LICS
2009
IEEE
14 years 20 days ago
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context we examine its main applications. We focus in pa...
Dan R. Ghica
TPHOL
2007
IEEE
14 years 8 days ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
ICFP
2002
ACM
14 years 6 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley