Sciweavers

771 search results - page 37 / 155
» Concept Analysis - A New Framework for Program Understanding
Sort
View
FSTTCS
2007
Springer
14 years 2 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
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
14 years 5 days ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
IWPC
2006
IEEE
14 years 2 months ago
JComp: A Reuse-Driven Componentization Framework for Java Applications
Program componentization has been proved to be an effective way to increase the speed and cost-effectiveness of reusing, maintaining, and understanding existing software systems. ...
Shimin Li, Ladan Tahvildari
ICST
2009
IEEE
13 years 5 months ago
A Flexible Framework for Quality Assurance of Software Artefacts with Applications to Java, UML, and TTCN-3 Test Specifications
Manual reviews and inspections of software artefacts are time consuming and thus, automated analysis tools have been developed to support the quality assurance of software artefac...
Jens Nodler, Helmut Neukirchen, Jens Grabowski
ICFP
2006
ACM
14 years 8 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers