Interface compatibility checking for software modules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2404, Issue , 2002, Pages 428-441

  Chakrabarti, Arindam ^a   De Alfaro, Luca ^b   Henzinger, Thomas A ^a   Jurdzi Ń Ski, Marcin ^a   Mang, Freddy Y C ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; SENSOR NODES;

AVAILABILITY CONSTRAINTS; FILE SERVERS; INTERFACE COMPATIBILITIES; LOCAL METHODS; PUSHDOWN GAMES; SOFTWARE INTERFACES; SOFTWARE MODULES;

COMPUTER SOFTWARE;

EID: 84937568787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_35     Document Type: Conference Paper

References (19)

1. S. Abramsky. Semantics of Interaction. Lecture Notes, Oxford University, 2002. 431
2. R. Alur et al. jMocha: A model-checking tool that exploits design structure. Proc. Int. Conf. Software Engineering, pp. 835–836. IEEE, 2001. 440
3. R. Allen and D. Garlan. A formal basis for architectural connection. ACM Trans. Software Engineering & Methodology, 6:213–249, 1997. 431
4. A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. Concurrency Theory, LNCS 1243, pp. 135–150. Springer, 1997. 440
5. A. Beugnard, J.-M. Jézéquel, N. Plouzeau, and D. Watkins. Making components contract aware. IEEE Software, 16:38–45, 1999. 431
6. L. de Alfaro and T. A. Henzinger. Interface automata. Proc. Symp. Foundations of Software Engineering, pp. 109–120. ACM, 2001. 430
7. L. de Alfaro and T. A. Henzinger. Interface theories for component-based design. Embedded Software, LNCS 2211, pp. 148–165. Springer, 2001. 430
8. R. DeLine and M. Fähndrich. Enforcing high-level protocols in low-level software. Proc. Conf. Programming Language Design & Implementation, pp. 59–69. ACM, 2001. 431
9. D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speedindependent Circuits. MIT Press, 1989. 430
10. J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Computer-Aided Verification, LNCS 2102, pp. 324–336. Springer, 2001. 434, 435
11. R. B. Findler, M. Latendresse, and M. Felleisen. Behavioral contracts and behavioral subtyping. Proc. Symp. Foundations of Software Engineering, pp. 229–236. ACM, 2001. 431
12. J. Foster, M. Fändrich, and A. Aiken. A theory of type qualifiers. Proc. Conf. Programming Language Design & Implementation, pp. 192–203. ACM, 1999. 431
13. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister. System architecture directions for networked sensors. Proc. Conf. Architectural Support for Programming Languages & Operating Systems, pp. 93–104. ACM, 2000. 431, 438
14. J. R. Larus, S. K. Rajamani, and J. Rehof. Behavioral Types for Structured Asynchronous Programming. Technical Report, Microsoft Research, 2001. 431
15. D. C. Luckham and F. von Henke. An overview of Anna, a specification language for Ada. IEEE Software, 2:9–23, 1985. 431
16. D. L. Parnas. A technique for software module specification with examples. Communications of the ACM, 15:330–336, 1972. 431
17. D. S. Rosenblum. A practical approach to programming with assertions. IEEE Trans. Software Engineering, 21:19–31, 1995. 431
18. I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164:234–263, 2001. 433, 439
19. F. Somenzi. CUDD: CU decision diagram package. Technical Report, University of Colorado at Boulder, 1997. 440