Sciweavers

1368 search results - page 88 / 274
» Recursive modules for programming
Sort
View
FSTTCS
2007
Springer
15 years 8 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 7 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
CSL
2006
Springer
15 years 5 months ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
EUROGP
2008
Springer
135views Optimization» more  EUROGP 2008»
15 years 3 months ago
Using Genetic Programming for Turing Machine Induction
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
Amashini Naidoo, Nelishia Pillay
104
Voted
CVPR
2007
IEEE
16 years 4 months ago
Two-View Motion Segmentation from Linear Programming Relaxation
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We ...
Hongdong Li