Sciweavers

3889 search results - page 313 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
TACS
2001
Springer
15 years 9 months ago
A Logic Programming Language Based on Binding Algebras
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
Makoto Hamana
AOSD
2006
ACM
15 years 11 months ago
Expressing different conceptual models of join point selections in aspect-oriented design
When specifying pointcuts, i.e. join point selections, in AspectOriented Software Development, developers have in different situations different conceptual models in mind. Aspect-...
Dominik Stein, Stefan Hanenberg, Rainer Unland
CASCON
2000
119views Education» more  CASCON 2000»
15 years 6 months ago
Efficient mapping of software system traces to architectural views
Information about a software system's execution can help a developer with many tasks, including software testing, performance tuning, and program understanding. In almost all...
Robert J. Walker, Gail C. Murphy, Jeffrey Steinbok...
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 5 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
PASTE
1998
ACM
15 years 8 months ago
Efficient Composite Data Flow Analysis Applied to Concurrent Programs
FLAVERS, a tool for verifying properties of concurrent systems, uses composite data flow analysis to incrementally improve the precision of the results of its verifications. Altho...
Gleb Naumovich, Lori A. Clarke, Leon J. Osterweil