Analysis of Recursive State Machines
暂无分享,去创建一个
[1] Michael Benedikt,et al. Model Checking of Unrestricted Hierarchical State Machines , 2001, ICALP.
[2] Thomas W. Reps,et al. Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation , 1995, TAPSOFT.
[3] Patrick Cousot,et al. Static Determination of Dynamic Properties of Recursive Procedures , 1977, Formal Description of Programming Concepts.
[4] Leslie G. Valiant,et al. General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..
[5] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.
[6] Rajeev Alur,et al. Model checking of hierarchical state machines , 2001, SIGSOFT '98/FSE-6.
[7] Javier Esparza,et al. Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.
[8] Sriram K. Rajamani,et al. Bebop: A Symbolic Model Checker for Boolean Programs , 2000, SPIN.
[9] Pierre Wolper,et al. Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.
[10] Colin Stirling,et al. Modal and temporal logics , 1993, LICS 1993.
[11] Bernhard Steffen,et al. Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes , 1997, Theor. Comput. Sci..
[12] Igor Walukiewicz. Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..
[13] Thomas W. Reps,et al. Precise interprocedural chopping , 1995, SIGSOFT FSE.
[14] Henrik Reif Andersen,et al. Model Checking and Boolean Graphs , 1992, Theor. Comput. Sci..
[15] David Harel,et al. Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..
[16] David A. McAllester,et al. On the cubic bottleneck in subtyping and flow analysis , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[17] Thomas W. Reps,et al. Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.
[18] Jeffrey D. Ullman,et al. Principles Of Database And Knowledge-Base Systems , 1979 .
[19] Thomas W. Reps,et al. Program analysis via graph reachability , 1997, Inf. Softw. Technol..
[20] David W. Binkley,et al. Interprocedural slicing using dependence graphs , 1990, TOPL.
[21] David A. Wagner,et al. MOPS: an infrastructure for examining security properties of software , 2002, CCS '02.
[22] Thomas W. Reps,et al. Speeding up slicing , 1994, SIGSOFT '94.
[23] William A. Woods,et al. Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .
[24] Mihalis Yannakakis,et al. Graph-theoretic methods in database theory , 1990, PODS.
[25] Thomas Reps,et al. Wisconsin Program-Slicing Tool , 1997 .
[26] Tayssir Touili,et al. A Generic Approach to the Static Analysis of Concurrent Programs with Procedures , 2003, Int. J. Found. Comput. Sci..
[27] Jeffrey D. Ullman,et al. Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.
[28] Didier Caucal,et al. On the transition graphs of automata and grammars , 1990, WG.
[29] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[30] Pierre Wolper,et al. A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.
[31] Ivar Jacobson,et al. The Unified Modeling Language User Guide , 1998, J. Database Manag..
[32] Thomas W. Reps,et al. Interprocedural Path Profiling , 1999, CC.
[33] Thomas W. Reps,et al. Interconvertibility of a class of set constraints and context-free-language reachability , 2000, Theor. Comput. Sci..