Program Slicing

From MaRDI portal
Revision as of 14:24, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3345745

DOI10.1109/TSE.1984.5010248zbMath0552.68004MaRDI QIDQ3345745

Mark Weiser

Publication date: 1984

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)




Related Items (61)

Abstract Program SlicingExplaining safety violations in real-time systemsFast computation of strong control dependenciesPrecise interprocedural dependence analysis of parallel programsScaling down discrete-event simulation modelsTracking CSP computationsSelectively-amortized resource boundingDynamic program slicingAn alternative characterization of weak order dependenceSlicing concurrent constraint programsFrom NuSMV to SPIN: Experiences with model checking flight guidance systemsMaximal and Minimal Dynamic Petri Net SlicingStatic slicing of explicitly synchronized languagesProperties of data flow frameworks: A unified modelA formal semantics for program debuggingBlack-box testing based on colorful taint analysisAutomated debugging based on a constraint model of the program and a test caseA theory of compaction-based parallelizationA unifying theory of control dependence and its application to arbitrary program structuresImproved method to generate path-wise test dataCorrectly Slicing Extended Finite State MachinesFrom Exponential to Polynomial-Time Security Typing via Principal TypesA parallel algorithm for static program slicingComputing ripple effect for software maintenanceThe dependence condition graph: precise conditions for dependence between program pointsCut branches before looking for bugs: certifiably sound verification on relaxed slicesNon-discriminating Arguments and Their UsesA Case Study in Abstract Interpretation Based Program TransformationA trajectory-based strict semantics for program slicingSlicing for modern program structures: a theory for eliminating irrelevant loopsStratified Static Analysis Based on Variable DependenciesOn the HDL active trace – a new concept of HDL debuggingAn optimal algorithm for the construction of the system dependence graphCombining dynamic and static slicing for analysing assemblerDynamic slicing of lazy functional programs based on redex trailsTheoretical foundations of dynamic program slicingOn the relationship between model-based debugging and program slicingA non-standard semantics for program slicing and dependence analysisVerification of Software Product Lines with Delta-Oriented SlicingThe MEB and CEB Static Analysis for CSP SpecificationsA Theory of Slicing for Probabilistic Control Flow GraphsOn the automatic HDL bug identificationDynamic Slicing of Petri Nets Based on Structural Dependency Graph and its Application in System AnalysisCombining preprocessor slicing with C/C++ language slicingSlicing programs in the presence of errorsEfficient comparison of program slicesDynamic Slicing Techniques for Petri NetsOn the computational complexity of dynamic slicing problems for program schemasSource-tracking unificationInterconvertibility of a class of set constraints and context-free-language reachabilityThe application of hypergroups in symbolic executions and finite automataEquivalence of conservative, free, linear program schemas is decidableA compact execution history for dynamic slicingEnhancing Theorem Prover Interfaces with Program Slice InformationReconstructing sequential behavior from parallel behavior projectionsA formal semantics for debugging synchronous message passing-based concurrent programsAn efficient method for computing dynamic program slicesStatic Slicing of Rewrite SystemsA lazy query scheme for reachability analysis in Petri netsA backward slicing algorithm for PrologCombining slicing and constraint solving for validation of measurement software







This page was built for publication: Program Slicing