Sciweavers

1901 search results - page 141 / 381
» Predicting Program Properties from
Sort
View
AGP
1998
IEEE
15 years 7 months ago
Parsing with Non-Deterministic Functions
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
Rafael Caballero, Francisco Javier López-Fr...
ECOOP
1987
Springer
15 years 6 months ago
Dynamic Grouping in an Object-Oriented Virtual Memory Hierarchy
Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual...
Ifor Williams, Mario Wolczko, Trevor Hopkins
CSMR
2004
IEEE
15 years 6 months ago
Source Code Modularization Using Lattice of Concept Slices
Most legacy systems have been altered due to prolonged maintenance to the point that they deviate significantly from their original and intended design and consequently, they lack...
Raihan Al-Ekram, Kostas Kontogiannis
CAV
2008
Springer
108views Hardware» more  CAV 2008»
15 years 5 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 9 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur