Compositional model checking
暂无分享,去创建一个
[1] Edmund M. Clarke,et al. Characterizing Kripke Structures in Temporal Logic , 1987, TAPSOFT, Vol.1.
[2] K. Mani Chandy,et al. Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.
[3] David L. Dill,et al. Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.
[4] Edmund M. Clarke,et al. A language for compositional specification and verification of finite state hardware controllers , 1991 .
[5] Edmund M. Clarke,et al. Hierarchical Verification of Asynchronous Circuits Using Temporal Logic , 1985, Theor. Comput. Sci..
[6] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[7] Frank Thomson Leighton,et al. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits , 1988 .
[8] Edmund M. Clarke,et al. Automatic verification of asynchronous circuits using temporal logic , 1986 .
[9] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[10] Edmund M. Clarke,et al. Automatic Verification of Sequential Circuits Using Temporal Logic , 1986, IEEE Transactions on Computers.
[11] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[12] Chin-Laung Lei,et al. Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.
[13] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[14] E. Emerson,et al. Modalities for model checking (extended abstract): branching time strikes back , 1985, ACM-SIGACT Symposium on Principles of Programming Languages.
[15] Amir Pnueli,et al. Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.
[16] Amir Pnueli,et al. In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.
[17] Gérard Berry,et al. The ESTEREL Synchronous Programming Language and its Mathematical Semantics , 1984, Seminar on Concurrency.
[18] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[19] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[20] Joseph Sifakis,et al. Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.
[21] Bernhard Josko. MCTL - An Extension of CTL for Modular Verification of Concurrent Systems , 1987, Temporal Logic in Specification.
[22] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.