Interface Theories for Component-Based Design
暂无分享,去创建一个
[1] Thomas A. Henzinger,et al. Decomposing refinement proofs using assume-guarantee reasoning , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).
[2] Stephen Gilmore,et al. Process Algebra and Probabilistic Methods. Performance Modelling and Verification , 2001, Lecture Notes in Computer Science.
[3] David L. Dill,et al. Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.
[4] Thomas A. Henzinger,et al. The Control of Synchronous Systems, Part II , 2001, CONCUR.
[5] Moshe Y. Vardi,et al. Alternating Re nement Relations ? ? ? , 1998 .
[6] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[7] Thomas A. Henzinger,et al. Reactive Modules , 1999, Formal Methods Syst. Des..
[8] Thomas A. Henzinger,et al. Interface automata , 2001, ESEC/FSE-9.
[9] Amir Pnueli,et al. Compositionality: The Significant Difference , 1999, Lecture Notes in Computer Science.
[10] C. A. Petri,et al. Concurrency Theory , 1986, Advances in Petri Nets.
[11] Thomas A. Henzinger,et al. The Control of Synchronous Systems , 2000, CONCUR.
[12] Edward A. Lee,et al. Overview of the Ptolemy project , 2001 .
[13] Edward A. Lee,et al. What's Ahead for Embedded Software? , 2000, Computer.
[14] Thomas A. Henzinger,et al. Alternating Refinement Relations , 1998, CONCUR.
[15] Stephan Merz,et al. Model Checking , 2000 .
[16] Natarajan Shankar,et al. Lazy Compositional Verification , 1997, COMPOS.
[17] Natarajan,et al. Lazy Compositional Veri cation ? , 1998 .
[18] Thomas A. Henzinger,et al. Alternating-time temporal logic , 1999 .
[19] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.