Regular inference for reactive systems
暂无分享,去创建一个
[1] Klaus Havelund,et al. Model Checking Programs , 2004, Automated Software Engineering.
[2] Piotr Berman,et al. Learning one-counter languages in polynomial time , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[3] David W. Binkley,et al. Program slicing , 2008, 2008 Frontiers of Software Maintenance.
[4] Gerard J. Holzmann,et al. The SPIN Verification System , 1997 .
[5] Jesper Wilhelmsson. Efficient memory management for message-passing concurrency, Part I : Single-threaded execution , 2005 .
[6] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[7] Naoki Abe,et al. Algorithmic Learning Theory: 12th International Conference, ALT 2001 Washington, DC, USA, November 25–28, 2001 Proceedings , 2001, Lecture Notes in Computer Science.
[8] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[9] Dexter Kozen,et al. Results on the Propositional µ-Calculus , 1982, ICALP.
[10] Ferhat Khendek,et al. Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..
[11] Erik Bängtsson. Robust preconditioned iterative solution methods for large-scale nonsymmetric problems , 2005 .
[12] N. Meyers,et al. H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.
[13] Pierre Wolper,et al. The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..
[14] Tsun S. Chow,et al. Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.
[15] Wang Yi,et al. Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.
[16] Tiziana Margaria,et al. Efficient test-based model generation for legacy reactive systems , 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).
[17] Ronitt Rubinfeld,et al. Efficient learning of typical finite automata from random walks , 1993, STOC.
[18] Edmund M. Clarke,et al. Sequential circuit verification using symbolic model checking , 1991, DAC '90.
[19] Itu-T. Specification and Description Language (SDL) , 1999 .
[20] Alex Groce,et al. Adaptive Model Checking , 2002, Log. J. IGPL.
[21] Harald Raffelt,et al. LearnLib: a library for automata learning and experimentation , 2005, FMICS '05.
[22] Marco Pistore,et al. Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.
[23] M. P. Vasilevskii. Failure diagnosis of automata , 1973 .
[24] Radu Mateescu,et al. An overview of CADP 2001 , 2001 .
[25] José L. Balcázar,et al. Algorithms for Learning Finite Automata from Queries: A Unified View , 1997, Advances in Algorithms, Languages, and Complexity.
[26] Niklas Johansson,et al. Usable IT systems for mobile work , 2005 .
[27] Pierre Dupont,et al. Incremental regular inference , 1996, ICGI.
[28] Amir Pnueli,et al. On the learnability of infinitary regular sets , 1991, COLT '91.
[29] Hardi Hungar,et al. Domain-Specific Optimization in Automata Learning , 2003, CAV.
[30] Frank Drewes,et al. Learning a Regular Tree Language from a Teacher , 2003, Developments in Language Theory.
[31] E. Mark Gold,et al. Complexity of Automaton Identification from Given Data , 1978, Inf. Control..
[32] Gerard J. Holzmann,et al. The Model Checker SPIN , 1997, IEEE Trans. Software Eng..
[33] Rance Cleaveland,et al. A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..
[34] Moshe Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.
[35] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[36] James R. Larus,et al. Mining specifications , 2002, POPL '02.
[37] Thomas A. Henzinger,et al. Proceedings of the 8th International Conference on Computer Aided Verification , 1996 .
[38] Chin-Laung Lei,et al. Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.
[39] Amnon Naamad,et al. Statemate: a working environment for the development of complex reactive systems , 1988, ICSE '88.
[40] Dana Angluin. Queries revisited , 2004, Theor. Comput. Sci..
[41] T. Kanade. Model-Based Testing of Reactive Systems , 2005 .
[42] Bernhard Steffen,et al. Model-Checking: A Tutorial Introduction , 1999, SAS.
[43] Paul Sjöberg,et al. Numerical solution of the Fokker–Planck approximation of the chemical master equation , 2005 .
[44] Bengt Jonsson,et al. On the Correspondence Between Conformance Testing and Regular Inference , 2005, FASE.
[45] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[46] S. Sieber. On a decision method in restricted second-order arithmetic , 1960 .
[47] Gerard J. Holzmann,et al. Logic Verification of ANSI-C Code with SPIN , 2000, SPIN.
[48] Thomas A. Henzinger,et al. Lazy abstraction , 2002, POPL '02.
[49] Corina S. Pasareanu,et al. Learning Assumptions for Compositional Verification , 2003, TACAS.
[50] Michael Schmitt,et al. Test Generation with Autolink and TestComposer , 2000 .
[51] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[52] Hardi Hungar,et al. Model Generation by Moderated Regular Extrapolation , 2002, FASE.
[53] Edmund M. Clarke,et al. Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.
[54] Moshe Y. Vardi. Branching vs. Linear Time: Final Showdown , 2001, TACAS.
[55] Magnus Ågren. High-level modelling and local search , 2005 .
[56] Paul Gastin,et al. Fast LTL to Büchi Automata Translation , 2001, CAV.
[57] Bengt Jonsson,et al. Insights to Angluin's Learning , 2005, SVV@ICLP.
[58] David Walker,et al. Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..
[59] Mihalis Yannakakis,et al. Black Box Checking , 1999, FORTE.
[60] Thierry Jéron,et al. An Experiment in Automatic Generation of Test Suites for Protocols with Verification Technology , 1997, Sci. Comput. Program..
[61] Wolfgang Thomas,et al. Report on the Program AMoRE , 1994 .
[62] Bengt Jonsson,et al. Automated test generation for industrial Erlang applications , 2003, ERLANG '03.
[63] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[64] Rance Cleaveland,et al. A Semantics Based Verification Tool for Finite State Systems , 1989, PSTV.
[65] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[66] J. R. Büchi. On a Decision Method in Restricted Second Order Arithmetic , 1990 .
[67] David Lee,et al. Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.
[68] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[69] Mei Hong,et al. On two methods for identifying dynamic errors-in-variables systems , 2005 .
[70] Bengt Jonsson,et al. Regular Inference for State Machines with Parameters , 2006, FASE.
[71] Matthew B. Dwyer,et al. Slicing Software for Model Construction , 2000, High. Order Symb. Comput..
[72] Oliver Niese,et al. An integrated approach to testing complex systems , 2003 .
[73] Linda Brus,et al. Recursive black-box identification of nonlinear state-space ODE models , 2006 .
[74] Sriram K. Rajamani,et al. The SLAM project: debugging system software via static analysis , 2002, POPL '02.
[75] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[76] Faron Moller,et al. Verification on Infinite Structures , 2001, Handbook of Process Algebra.
[77] James C. Corbett,et al. Bandera: extracting finite-state models from Java source code , 2000, ICSE.
[78] Gerard J. Holzmann,et al. SOFTWARE TESTING, VERIFICATION AND RELIABILITY , 2022 .