Syntactic Program Transformations for Automatic Abstraction
暂无分享,去创建一个
[1] Robert K. Brayton,et al. Automatic Datapath Abstraction In Hardware Systems , 1995, CAV.
[2] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[3] Yassine Lakhnech,et al. Computing Abstractions of Infinite State Systems Compositionally and Automatically , 1998, CAV.
[4] Amir Pnueli,et al. The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[5] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.
[6] Edmund M. Clarke,et al. Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..
[7] Richard Gerber,et al. Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic , 1997, CAV.
[8] E. Allen Emerson,et al. From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking , 1999, CHARME.
[9] Robin Milner,et al. An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.
[10] Somesh Jha,et al. Exploiting Symmetry In Temporal Logic Model Checking , 1993, CAV.
[11] Amir Pnueli,et al. Deciding Equality Formulas by Small Domains Instantiations , 1999, CAV.
[12] Tomás E. Uribe,et al. Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures , 1998, CAV.
[13] Orna Grumberg,et al. Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.
[14] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[15] David Notkin,et al. Combining Constraint Solving and Symbolic Model Checking for a Class of a Systems with Non-linear Constraints , 1997, CAV.
[16] Robert M. Keller,et al. Formal verification of parallel programs , 1976, CACM.
[17] Hardi Hungar,et al. First-Order-CTL Model Checking , 1998, FSTTCS.
[18] Pierre Wolper,et al. Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.
[19] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[20] Hardi Hungar,et al. What if model checking must be truly symbolic , 1995, CHARME.
[21] Nicolas Halbwachs,et al. Minimal Model Generation , 1990, CAV.
[22] Amir Pnueli,et al. Symbolic Model Checking with Rich ssertional Languages , 1997, CAV.
[23] Henny B. Sipma,et al. Deductive Model Checking , 1996, Formal Methods Syst. Des..
[24] Edmund M. Clarke,et al. Model checking and abstraction , 1994, TOPL.
[25] Hassen Saïdi,et al. Construction of Abstract State Graphs with PVS , 1997, CAV.
[26] Ranko S. Lazic,et al. A semantic study of data independence with applications to model checking , 1999 .
[27] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[28] Joseph Sifakis,et al. Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.
[29] David L. Dill,et al. Better verification through symmetry , 1996, Formal Methods Syst. Des..
[30] A. Prasad Sistla,et al. Reasoning about systems with many processes , 1992, JACM.
[31] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[32] Amir Pnueli,et al. Verification by Augmented Finitary Abstraction , 2000, Inf. Comput..
[33] David Lee,et al. Online minimization of transition systems (extended abstract) , 1992, STOC '92.
[34] C. Rattray,et al. Specification and Verification of Concurrent Systems , 1990, Workshops in Computing.
[35] Leslie Lamport,et al. A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.
[36] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.
[37] Orna Grumberg,et al. Model checking and modular verification , 1994, TOPL.