Sciweavers

4940 search results - page 234 / 988
» On the Complexity of Universal Programs
Sort
View
IFIP
2010
Springer
15 years 1 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
PPDP
2010
Springer
15 years 5 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
IWPC
2005
IEEE
16 years 3 days ago
Adding Control-Flow to a Visual Data-Flow Representation
Previous studies have shown that novices do not tend to extract or use data-flow information during program comprehension. However, for impact analysis and similar tasks, data-...
David Dearman, Anthony Cox, Maryanne Fisher
ICSE
2004
IEEE-ACM
16 years 6 months ago
Feature-Oriented Programming and the AHEAD Tool Suite
1 Feature Oriented Programming (FOP) is an emerging paradigm for application synthesis, analysis, and optimization. A target application is specified declaratively as a set of feat...
Don S. Batory
SEKE
2001
Springer
15 years 11 months ago
Gadget: A Tool for Extracting the Dynamic Structure of Java Programs
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
Juan Gargiulo, Spiros Mancoridis