Sciweavers

4940 search results - page 99 / 988
» On the Complexity of Universal Programs
Sort
View
ENDM
2010
103views more  ENDM 2010»
15 years 3 months ago
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
Mathieu Lacroix, Ali Ridha Mahjoub, Sébasti...
AADEBUG
1993
Springer
15 years 10 months ago
Slicing Programs with Arbitrary Control-flow
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
Thomas Ball, Susan Horwitz
WSE
2003
IEEE
15 years 11 months ago
Evaluation Methods for Web Application Clustering
ing Business UML Diagrams from Web Applications G. Di Lucca, University of Sannio, Italy; A. Fasolino, P. Tramontana, U. De Carlini, University of Naples, Italy (25 min) Developmen...
Paolo Tonella, Filippo Ricca, Emanuele Pianta, Chr...
POPL
2003
ACM
16 years 6 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
MCU
2007
95views Hardware» more  MCU 2007»
15 years 7 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud