Steven Woods  Home/Search
Context Related
| csarchive.uwaterloo.ca...CS9633.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The process of understanding a source code in a high-level programming language is a complex cognitive task. The provision of helpful decision aid subsystems would be of great benefit to software maintainers. Given a library of program plan templates, generating a partial understanding of a piece of software source code can be shown to correspond to the construction of mappings between segments of the source code and particular program plans represented in a library of domain source programs... (Update)
Context of citations to this paper: More
...combine them. 4. 2 Recognizing Plans Our approach is to treat program plan recognition as a constraint satisfaction problem (CSP) [36,39,38,25,35]. In particular, our recognition engine, Layered MAPCAP, represents plan components as CSP variables and the possible values of these...
.... work [Woods and Yang, 1995b, Woods and Yang, 1996c, Woods and Quilici, 1996a, Woods and Quilici, 1996c, Quilici et al. 1996, Woods, 1995] include: 1) new formalisms, 2) new program and plan decomposition methods, 3) plan representations and pre processing, 4)...
Cited by: More
Scaffolding for Software Renovation - Sellink, Verhoef (2000) (Correct)
Native Patterns - Sellink, Verhoef (1998) (Correct)
A Method of Program Understanding using Constraint Satisfaction.. - Woods (1996) (Correct)
Similar documents (at the sentence level):
7.6%: Program Understanding: A Constraint Satisfaction Modeling.. - Woods, Yang, al. (1995) (Correct)
Active bibliography (related documents): More All
2.9: Program Understanding as Constraint Satisfaction.. - Woods, Yang (1995) (Correct)
1.4: Program Plan Recognition For Year 2000 Tools - van Deursen, Quilici, Woods (1999) (Correct)
1.3: New Experiments With A Constraint-Based Approach To.. - Quilici, Woods, Zhang (Correct)
Similar documents based on text: More All
0.7: Efficient Simulation of Message-Passing in Distributed-Memory.. - Demaine (1996) (Correct)
0.1: Multi-Resolution Approximate Inverses - Bridson (1999) (Correct)
0.1: Incremental 3D Reconstruction Using Stereo Image Sequences - Moyung (2000) (Correct)
Related documents from co-citation: More All
9: Automated program recognition by graph parsing (context) - Wills - 1992
8: Program understanding as constraint satisfaction - Woods, Yang - 1995
7: A memory-based approach to recognizing programming plans (context) - Quilici - 1994
BibTeX entry: (Update)
Woods, S. (1996). A method of program understanding using constraint satisfaction for software reverse engineering. http://citeseer.ist.psu.edu/woods96method.html More
@misc{ woods96method,
author = "S. Woods",
title = "A method of program understanding using constraint satisfaction for software
reverse engineering",
text = "Woods, S. (1996). A method of program understanding using constraint satisfaction
for software reverse engineering.",
year = "1996",
url = "citeseer.ist.psu.edu/woods96method.html" }
Citations (may not include all citations):702 Consistency in networks of relations (context) - Mackworth - 1981
702 Consistency in networks of relations (context) - Mackworth - 1977
554 Design Patterns: Elements of Reusable Object-Oriented Softwa.. (context) - Gamma, Helm et al. - 1995
473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
380 Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989
365 Pengi: An implementation of a theory of activity (context) - Agre, Chapman - 1987
356 Computers and Intractability : A guide to the theory of NP-C.. (context) - Garey, Johnson - 1979
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992
311 Partial constraint satisfaction - Freuder, Wallace - 1992
307 Networks of constraints: Fundamental properties and applicat.. (context) - Montanari - 1974
288 Planning in a hierarchy of abstraction spaces (context) - Sacerdoti - 1974
272 Pushing the envelope: Planning - Kautz, Selman - 1995
267 Network-based heuristics for constraint-satisfaction problem.. (context) - Dechter, Pearl - 1987
265 Increasing tree-search efficiency for constraint satisfactio.. (context) - Haralick, Elliott - 1980
211 Enhancement schemes for constraint processing: backjumping (context) - Dechter - 1990
211 Hybrid algorithms for the constraint satisfaction problem (context) - Prosser - 1993
201 Understanding line drawings of scenes with shadows - Waltz - 1975
198 Practical Planning: Extending the Classical AI Planning Para.. (context) - Wilkins - 1988
197 Noise strategies for improving local search - Selman, Kautz et al. - 1994
189 Arc and path consistency revisited (context) - Mohr, Henderson - 1986
186 Constraint satisfaction (context) - Mackworth - 1987
185 A sufficient condition of backtrack-free search (context) - Freuder - 1982
185 The complexity of some polynomial network consistency algori.. (context) - Mackworth, Freuder - 1985
154 Quantitative results concerning the utility of explanationba.. (context) - Minton - 1990
146 Domain-independent extensions to GSAT: Solving large structu.. - Selman, Kautz - 1993
141 Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
135 Solving large-scale constraint satisfaction and scheduling p.. (context) - Minton, Johnston et al. - 1990
134 Experimental results on the crossover point in satisfiabilit.. - Crawford, Auton - 1993
127 Constraint satisfaction algorithms (context) - Nadel - 1989
117 Generalized plan recognition (context) - Kautz, Allen - 1986
100 A generic arc-consistency algorithm and its specializations (context) - Van Hentenryck, Deville et al. - 1992
88 The programmer's apprentice (context) - Rich, Waters - 1990
87 A theoretical evaluation of selected backtracking algorithms - Kondrak, van Beek - 1995
80 From local to global consistency - Dechter - 1992
80 From local to global consistency - Dechter - 1990
74 Software Engineering (context) - Sommerville - 1982
74 Eliminating interchangeable values in constraint satisfactio.. (context) - Freuder - 1991
74 Software Engineering (context) - Sommerville - 1996
70 Efficient local search for very large-scale satisfiability p.. (context) - Gu - 1992
67 Automatically Generating Abstractions for Problem Solving - Knoblock - 1991
65 Empirical studies of programming knowledge (context) - Soloway, Ehrlich - 1984
63 Easy problems are sometimes hard - Gent, Walsh - 1994
61 Incorporating default inferences into plan recognition (context) - Carberry - 1990
59 A Formal Theory of Plan Recognition (context) - Kautz - 1987
58 Principles of Artificial Intelligence (context) - Nilsson - 1980
54 TXL: A rapid prototyping system for programming language dia.. (context) - Cordy, Halpern et al. - 1991
54 Manipulating and documenting software structures using SHriM.. - Storey, Muller - 1995
50 Automated program recognition by Graph Parsing (context) - Wills - 1992
49 Constraint satisfaction using constraint logic programming (context) - Van Hentenryck, Simonis et al. - 1992
47 Sparse constraint graphs and exceptionally hard problems - Smith, Grant - 1995
47 Search reduction in hierarchical problem solving - Knoblock - 1991
46 Experimental evaluation of preprocessing techniques in const.. (context) - Dechter, Meiri - 1989
46 Paradigms of Artificial Intelligence Programming (context) - Norvig - 1992
45 The Sciences of the Artificial (context) - Simon - 1968
43 An empirical analysis of search in GSAT - Gent, Walsh - 1993
43 Formalizing planning knowledge for hierarchical planning (context) - Yang - 1990
42 Automated program recognition: A feasibility demonstration (context) - Wills - 1990
41 Stimulus structures and mental representations in expert com.. (context) - Pennington - 1987
41 Relational consistency algorithms and their application in f.. (context) - McGregor - 1979
39 A memory-based approach to recognizing programming plans (context) - Quilici - 1994
38 The Programmer's Apprentice: A research overview (context) - Rich, Waters - 1988
38 Artificial Intelligence - Cooper, k-consistency - 1989
37 ACM Transactions on Software Engineering and Methodology (context) - Zaremski, Wing et al. - 1995
36 Modeling the user's plans and goals - Carberry - 1988
36 Intention Based Diagnosis of Novice Programming Errors (context) - Johnson - 1986
36 Case-based planning: A framework for planning from experienc.. - Hammond - 1990
33 language- and frontend - independent code analyzer (context) - Devanbu, GENII et al. - 1992
32 The logic of constraint satisfaction (context) - Mackworth - 1992
32 Using an enabling technology to re-engineer legacy systems (context) - Markosian, Newcomb et al. - 1994
31 and Austin Tate (context) - Allen, Hendler - 1990
29 Program comprehension during software maintenance and evolut.. (context) - von Mayhrhauser, Vans - 1995
28 The interleaving problem in program understanding - Rugaber, Stirewalt et al. - 1995
28 Design patterns: Abstraction and reuse of object-oriented de.. - Gamma, Helm et al. - 1993
27 Abstraction in Planning (context) - Tenenberg - 1988
26 The mythical man-month: essays on software engineering (context) - Jr - 1995
26 Automated program understanding by concept recognition (context) - Kozaczynski, Ning - 1994
26 A polynomial time algorithm for the n-queens problem - Sosic, Gu - 1990
24 Domain-retargetable reverse engineering - Tilley, Muller et al. - 1993
23 Proust: Knowledge-based program understanding (context) - Johnson, Soloway - 1985
23 Representation selection for constraint satisfaction: A case.. (context) - Nadel - 1990
22 Comprehension strategies in programming (context) - Pennington - 1987
22 Minimizing conflicts: A heuristic repair method for constrai.. - Minton, Johnston et al. - 1992
21 Hierarchical arc consistency for disjoint real intervals in .. - Sidebottom, Havens - 1992
21 Algorithms for constraint-satisfaction problems (context) - Kumar - 1992
20 Specification matching of software components - Zaremski, Wing - 1995
20 Understanding software systems using reverse engineering tec.. (context) - Muller, Wong et al. - 1994
19 From plan critiquing to clarification dialogue for cooperati.. (context) - van Beek, Cohen et al. - 1993
19 Modeling object-oriented program execution - De Pauw, Kimeham et al. - 1994
18 Program understanding as constraint satisfaction: Representa.. - Woods, Yang - 1996
18 Program understanding as constraint satisfaction: Representa.. - Woods, Yang - 1995
17 Speeding up problem-solving by abstraction: A graph-oriented.. - Holte, Mkadmi et al. - 1995
16 Decode: A cooperative program understanding environment (context) - Chin, Quilici - 1996
15 An efficient cross product representation of the constraint .. (context) - Hubbe, Freuder - 1992
15 DECODE: A cooperative environment for reverse-engineering le.. (context) - Quilici, Chin - 1995
14 Temporal reasoning during plan recognition (context) - Song, Cohen - 1991
14 Classifying architectural elements as a foundation for mecha.. - Kazman, Clements et al. - 1996
13 Automating the modularization of large cobol programs: Appli.. (context) - Newcomb, Markosian - 1993
13 Flexible control for program recognition - Wills - 1993
12 Removing redundancies in constraint networks (context) - Dechter, Dechter - 1987
12 Automatic control understanding for natural programs (context) - Hartman - 1991
11 Understanding natural programs using proper decomposition (context) - Hartman - 1991
10 A method of program understanding using constraint satisfact.. - Woods - 1995
8 An implementation and evaluation of a hierarchical non-linea.. (context) - Woods - 1991
8 A cooperative program understanding environment - Quilici, Chin - 1994
8 Applying plan recognition algorithms to program understandin.. - Quilici, Yang et al. - 1996
8 A hybrid approach to recognizing programming plans (context) - Quilici - 1993
8 Reverse engineering of legacy systems: A path toward success (context) - Quilici - 1995
8 Solving partial constraint satisfaction problems using local.. (context) - Yang, Fong - 1992
7 Approaching the program understanding problem: Analysis and .. (context) - Woods, Yang - 1996
6 Hierarchial arc consistency: Exploiting structured domains i.. (context) - Mackworth, Mulder et al. - 1985
6 Scalable interfaces to support program comprehension (context) - Citrin, Santiago et al. - 1996
6 Extending constraint satisfaction problem solving in structu.. (context) - Guan, Friedrich - 1992
6 Signature matching: A key to reuse - Zaremski, Wing - 1993
6 A processing model for temporal analysis and its application.. (context) - Song - 1990
6 Constraint-based plan recognition in legacy code (context) - Woods, Yang - 1995
5 an analyzer generator for c++ programs (context) - Devanbu, Eaves - 1994
5 Detecting code similarity using patterns - Kontogiannis, Galler et al. - 1995
5 Specifying and updating plan libraries for plan recognition .. (context) - Cohen, Spencer - 1993
4 A reverse engineering approach to subsytem structure identif.. (context) - Muller, Orgun et al. - 1993
4 Special Issue on Constraint-directed Reasoning (context) - Yang, of et al. - 1992
4 Toward a constraintsatisfaction framework for evaluating pro.. (context) - Woods, Quilici - 1996
3 Technical introduction to the first workshop on AI and autom.. (context) - Hartman - 1992
3 A constraint-satisfaction framework for evaluating program-u.. (context) - Woods, Quilici - 1996
3 A new look at plan recognition in natural language dialogue (context) - Carberry - 1990
3 Representing and propagating constraints in temporal reasoni.. (context) - Tolba, Charpillet et al. - 1991
3 Toward practical automated program understanding - Quilici - 1995
3 Assimilation in Plan Recognition via Truth Maintenance with .. (context) - Spencer - 1991
3 Program comprehension for reverse engineering - Rugaber - 1992
2 Customized software evaluation tools: Application of an enab.. (context) - Markosian, Brand et al. - 1994
2 Overview of software refinery: Product family for automated .. (context) - Burn - 1992
2 Laboratory for Artificial Intelligence Research (context) - Hartman, software et al. - 1994
2 An empirical study of architectural design operations - Kazman, Reddy - 1996
2 Program understanding and plan recognition: reasoning under .. (context) - Woods, Quilici et al. - 1995
1 Some experiments in the scalability of program understanding.. (context) - Woods, Quilici - 1996
1 Intelligent Planning - algorithms and analyses for plan reas.. (context) - Yang - 1996
1 Massachusets Institute of Technology (context) - Rich, in et al. - 1987
1 Improving repsonse generation by using abstract decompositio.. (context) - Ardissono, Cohen - 1996
1 The complexity of constraint satisfaction revistited (context) - Mackworth, Freuder - 1993
1 Hierarchical constraint satisfaction and program understandi.. (context) - Woods, Yang - 1996
1 Introduction to the special volume on constraint-based reaso.. (context) - Freuder, Mackworth - 1992
1 A double phase transition (context) - Hogg, Williams - 1994
1 Transactions on Software Engineering (context) - Kozaczynski, Ning et al. - 1992
1 Rigi - an extensible system for retargetable reverse enginee.. (context) - Muller - 1995
1 Multi-layer visualization of dynamic in software system beha.. (context) - Kimeham, Rosenburg et al. - 1994
1 empirical program understanding (context) - Hartman - 1992
1 Automated Software Engineering (context) - Selfridge, the et al. - 1994
1 Design pattern recognition during the re-design process (context) - Kazman, Atlee - 1996
1 The empirical derivation of a design space and design rules .. (context) - Reddy - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC