Journal of Logic Programming
Artificial Intelligence
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
ANNA: a language for annotating Ada programs
ANNA: a language for annotating Ada programs
A designer/verifier's assistant
Readings in artificial intelligence and software engineering
Software interconnection models
ICSE '87 Proceedings of the 9th international conference on Software Engineering
Version control in the Inscape environment
ICSE '87 Proceedings of the 9th international conference on Software Engineering
Interprocedural slicing using dependence graphs
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Specification case studies
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Axiomatic Approach to Information Flow in Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Certification of programs for secure information flow
Communications of the ACM
A lattice model of secure information flow
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Information transmission in computational systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Approximate Reasoning About the Semantic Effects of Program Changes
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
A configuration management (CM) tool is supposed to build a consistent software system following incremental changes to the system. The notion of consistency usually is purely syntactic, having to do with the sorts of properties analyzed by compilers. Semantic consistency traditionally has been studied in the field of formal methods and has been considered an impractical goal for CM.Although the semantic CM problem is undecidable, it is possible to obtain a structural approximation of the semantic effects of a change in a finite number of steps. Our approximation technique is formalized in logic and is based on information-theoretic properties of programs. The method in its present form applies to many but not all software systems, and it is programming-language independent. To the best of our knowledge, the semantic CM problem has not been formalized previously in nonsemantic terms, and we believe that our simplified formulation offers the potential for considerably more powerful debugging and configuration management tools.