The Computational Complexity of Evolving Systems
暂无分享,去创建一个
[1] Erik Harald Saaman,et al. Another formal specification language , 2000 .
[2] Peter van Emde Boas,et al. Machine Models and Simulation , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[3] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[4] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[5] J.J.H. Fey,et al. Design of a fruit juice blending and packaging plant , 2000 .
[6] J. P. Warners,et al. Nonlinear approaches to satisfiability problems , 1999 .
[7] G Goce Naumoski,et al. A discrete-event simulator for systems engineering , 1998 .
[8] Susan Stepney,et al. Journeys in non-classical computation I: A grand challenge for computing research , 2005, Parallel Algorithms Appl..
[9] urzburgAm Exerzierplatz. Persistent Computations , 1998 .
[10] Willem Otto David Griffioen,et al. Studies in computer aided verification of protocols , 2000 .
[11] M. B. van der Zwaag,et al. Models and logics for process algebra , 2002 .
[12] H.M.A. van Beek,et al. Specification and analysis of Internet applications , 2005 .
[13] Olga Tveretina,et al. A Decision Procedure for Equality Logic with Uninterpreted Functions , 2004, AISC.
[14] M. de Jonge,et al. To reuse or to be reused. Techniques for component composition and construction , 2003 .
[15] James R. Munkres,et al. Topology; a first course , 1974 .
[16] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[17] Jurgen Vinju,et al. Analysis and transformation of source code by parsing and rewriting , 2005 .
[18] P. Severi. Normalisation in lambda calculus and its relation to type inference , 1996 .
[19] van Robert Liere,et al. Studies in Interactive Visualization , 2001 .
[20] R Ronald Ruimerman,et al. Modeling and remodeling in bone tissue , 2005 .
[21] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[22] Joost Visser,et al. Generic traversal over typed source code representations , 2003 .
[23] F. Bartels,et al. On Generalised Coinduction and Probabilistic Specification Formats , 2004 .
[24] José L. Balcázar,et al. Structural Complexity II , 2012, EATCS.
[25] Mariëlle Stoelinga,et al. Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .
[26] Peter Wegner,et al. Computation beyond turing machines , 2003, CACM.
[27] M. F.,et al. Bibliography , 1985, Experimental Gerontology.
[28] J. van Leeuwen,et al. A computational model of interaction in embedded systems , 2001 .
[29] Cruz Filipe,et al. Constructive real analysis : a type-theoretical formalization and applications , 2004 .
[30] Ts Ed Voermans. Inductive datatypes with laws and subtyping : a relational model , 1999 .
[31] Sebastian Maneth,et al. Models of tree translation , 2004 .
[32] Lex Heerink,et al. Ins and Outs in Refusal Testing , 1998 .
[33] Jan van Leeuwen,et al. Relativistic Computers and Non-uniform Complexity Theory , 2002, UMC.
[34] Rina S. Cohen,et al. omega-Computations on Turing Machines , 1978, Theor. Comput. Sci..
[35] Isabelle Reymen. Improving design processes through structured reflection : case studies , 2001 .
[36] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[37] Theodorus Cornelis Ruys,et al. Towards effective model checking , 2001 .
[38] José L. Balcázar,et al. Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.
[39] Lawrence H. Landweber,et al. Decision problems forω-automata , 1969, Mathematical systems theory.
[40] T. Kuipers,et al. Techniques for understanding legacy software systems , 2002 .
[41] Dick Alstein,et al. Distributed algorithms for hard real-time systems , 1996 .
[42] Eelco Dolstra,et al. The purely functional software deployment model , 2006 .
[43] István Németi,et al. Non-Turing Computations Via Malament–Hogarth Space-Times , 2001 .
[44] M.H.G. Kesseler,et al. The implementation of functional languages on parallel machines with distributed memory , 1996 .
[45] Jan A. Bergstra,et al. Discrete time process algebra , 1992, Formal Aspects of Computing.
[46] Daniel R. Tauritz,et al. Adaptive Information Filtering: Concepts and Algorithms , 2002 .
[47] Jan van Leeuwen,et al. The emergent computational potential of evolving artificial living systems , 2002, AI Commun..
[48] V Victor Bos,et al. Formal specification and analysis of industrial systems , 2002 .
[49] Cristian S. Calude,et al. Coins, Quantum Measurements, and Turing's Barrier , 2002, Quantum Inf. Process..
[50] Wpaj Wil Michiels. Performance ratios for the differencing method , 2004 .
[51] Judi Maria Tirza Romijn,et al. Analysing Industrial Protocols with Formal Methods , 1999 .
[52] Markus Holzer,et al. Automata That Take Advice , 1995, MFCS.
[53] Angus Macintyre,et al. Primes and Their Residue Rings in Models of Open Induction , 1989, Ann. Pure Appl. Log..
[54] Joao Paulo Saraiva,et al. Purely Functional Implementation of Attribute Grammars , 1999 .
[55] Peter Achten,et al. Interactive functional programs: models, methods, and implementation , 1996 .
[56] N.J.M. van den Nieuwelaar,et al. Supervisory machine control by predictive-reactive scheduling , 2004 .
[57] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[58] Maurice H. ter Beek,et al. Team Automata: A Formal Approach to the Modeling of Collaboration Between System Components , 2003 .
[59] G Georgina Fabian,et al. A language and simulator for hybrid systems , 1999 .
[60] Peter Wegner,et al. Persistence as a Form of Interaction , 1998 .
[61] Hui Gao,et al. Design and verification of lock-free parallel algorithms , 2005 .
[62] Ad M. G. Peeters,et al. An asynchronous low-power 80C51 microcontroller , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.
[63] P. Odifreddi. Classical recursion theory , 1989 .
[64] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[65] P. Boas. Machine models and simulations , 1991 .
[66] A. T. Hofkamp,et al. Reactive machine control : a simulation approach using chi , 2001 .
[67] Michael Prasse,et al. Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability , 1998, Comput. J..
[68] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[69] J. Humphrys,et al. Beyond Words , 2006 .
[70] J. Wessels,et al. Faculty of Mathematics and Computing Science , 1988 .
[71] Holger Petersen. The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses , 1998, MFCS.
[72] Reinder J. Bril,et al. Real-time scheduling for media processing using conditionally guaranteed budgets , 2004 .
[73] Twan Laan. The evolution of type theory in logic and mathematics , 1997 .
[74] Stefan Blom,et al. Term Graph Rewriting. Syntax and semantics , 2001 .
[75] Goran Frehse,et al. Compositional verification of hybrid systems using simulation relations , 2005 .
[76] Daan Leijen,et al. The λ Abroad - A Functional Approach to Software Components , 2003 .
[77] P. Zoeteweij,et al. Composing constraint solvers , 2005 .
[78] Mohammad Reza Mousavi,et al. Structuring structural operational semantics , 2005 .
[79] D. Bosnacki. Enhancing state space reduction techniques for model checking , 2001 .
[80] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[81] A. M. Geerling,et al. Transformational development of data-parallel algorithms , 1996 .
[82] M. T. Ionita,et al. Scenario-based system architecting : a systematic approach to developing future-proof system architectures , 2005 .
[83] Dennis Dams,et al. Abstract interpretation and partition refinement for model checking , 1996 .
[84] Jjd Joep Aerts. Random redundant storage for video on demand , 2003 .
[85] Simona Orzan,et al. On Distributed Verification and Verified Distribution , 2004 .
[86] Rmc Rene Ahn,et al. Agents, objects and events : a computational approach to knowledge, observation and communication , 2001 .
[87] Peter Wegner,et al. Interaction as a basis for empirical computer science , 1995, CSUR.
[88] Ana Sokolova,et al. Coalgebraic analysis of probabilistic systems , 2005 .
[89] Dino Salvo Distefano,et al. On model checking the dynamics of object-based software : a foundational approach , 2003 .
[90] EO Esko Dijk. Indoor ultrasonic position estimation using a single base station , 2004 .
[91] Jeroen Eggermont,et al. Data Mining using Genetic Programming : Classification and Symbolic Regression , 2005 .
[92] Nwa Norbert Arends,et al. A systems engineering specification formalism , 1996 .
[93] J. van Leeuwen,et al. Lineages of automata , 2003 .
[94] Jeffrey D. Ullman,et al. Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.
[95] Jan van Leeuwen,et al. The Turing machine paradigm in contemporary computing , 2001 .
[96] Thomas Wolle,et al. Computational aspects of treewidth : Lower bounds and network reliability , 2005 .
[97] Cj Roel Bloo,et al. Preservation of termination for explicit substitution , 1997 .
[98] K. Leeuw. Cryptology and statecraft in the Dutch Republic , 2000 .
[99] Marieke Huisman,et al. Reasoning about Java programs in higher order logic using PVS and Isabelle , 2001 .
[100] Jpl John Segers. Algorithms for the simulation of surface processes , 1999 .
[101] M. Niqui,et al. Formalising Exact Arithmetic. Representations, Algorithms and Proofs , 2004 .
[102] Jan van Leeuwen,et al. On Algorithms and Interaction , 2000, MFCS.
[103] M. Franssen. Cocktail : a tool for deriving correct programs , 2000 .
[104] J Jan Zwanenburg,et al. Object-oriented concepts and proof rules : formalization in type theory and implementation in Yarrow , 1999 .
[105] M. Potter. Orders of infinity , 2004 .
[106] Leon Moonen,et al. Exploring software systems , 2003, International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings..
[107] Martijn M. Schrage,et al. Proxima: a presentation-oriented editor for structured documents , 2000 .
[108] J. Blanco. Definability with the State Operator in Process Algebra , 1995 .
[109] S. P. Luttik. Choice quantification in process algebra , 2002 .
[110] J. Verriet. Scheduling with communication for multiprocessor computation , 1998 .
[111] Dina Q. Goldin. Persistent Turing Machines as a Model of Interactive Computation , 2000, FoIKS.
[112] Pedro R. D'Argenio,et al. Algebras and Automata for Timed and Stochastic Systems , 1999 .
[113] G. Rozenberg,et al. Effective models for the structure of ð-calculus processes with replication , 2001 .
[114] RJ Roy Willemen,et al. School timetable construction : algorithms and complexity , 2002 .
[115] Ansgar Fehnker,et al. Citius, Vilius, Melius : guiding and cost-optimality in model checking of timed and hybrid systems , 2002 .
[116] A. G. Engels,et al. Languages for analysis and testing of event sequences , 2001 .
[117] R. S. Venema,et al. Aspects of an integrated neural prediction system , 1999 .
[118] B. D. Fluiter. Algorithms for graphs of small treewidth , 1997 .
[119] Pekka Orponen. An Overview Of The Computational Power Of Recurrent Neural Networks , 2000 .
[120] D. Turi,et al. Functional Operational Semantics and its Denotational Dual , 1996 .
[121] Oscar H. Ibarra,et al. On Two-way Multihead Automata , 1973, J. Comput. Syst. Sci..
[122] Jan van Leeuwen,et al. Emergence of a Super-Turing Computational Potential in Artificial Living Systems , 2001, ECAL.
[123] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[124] Y Yuechen Qian,et al. Data synchronization and browsing for home environments , 2004 .
[125] Michel A. Reniers,et al. Message sequence chart : syntax and semantics , 1999 .
[126] Grzegorz Rozenberg,et al. Theory Is Forever , 2004, Lecture Notes in Computer Science.
[127] Bastiaan Heeren,et al. Top quality type error Messages , 2005 .
[128] ter Hugo Wilfried Laurenz Doest. Towards Probabilistic Unification-Based Parsing , 1999 .
[129] Ad M. G. Peeters,et al. Single-rail handshake circuits , 1995, Proceedings Second Working Conference on Asynchronous Design Methodologies.
[130] Tac Tim Willemse. Semantics and verification in process algebras with data and timing , 2003 .
[131] Peter Wegner,et al. Interactive , 2021, Encyclopedia of the UN Sustainable Development Goals.
[132] Emilia I. Barakova,et al. Learning reliability : a study on dindecisiveness in sample selection , 1999 .
[133] Jaap-Henk Hoepman,et al. Communication, synchronization and fault tolerance , 1996 .
[134] Maria Eva Magdalena Lijding,et al. Real-Time Scheduling of Tertiary Storage , 2003 .
[135] M. A. Valero Espada,et al. Modal Abstraction and Replication of Processes with Data , 2005 .
[136] M. Oostdijk. Generation and presentation of formal mathematical documents , 2001 .
[137] Gabriele Lenzini,et al. Integration of Analysis Techniques in Security and Fault-Tolerance , 2005 .
[138] Bengt Jonsson,et al. Probabilistic Process Algebra , 2001 .
[139] Jurriaan Hage,et al. Structural Aspects Of Switching Classes , 2001 .
[140] Mark Burgin,et al. How we know what technology can do , 2001, CACM.
[141] Aa Twan Basten,et al. In terms of nets : system design with Petri nets and process algebra , 1998 .
[142] Cheun Ngen Chong. Experiments in rights control : expression and enforcement , 2005 .
[143] Erika Ábrahám,et al. An Assertional Proof System for Multithreaded Java - Theory and Tool Support , 2005 .
[144] Luca Cardelli. Global computation , 1997, SIGP.
[145] Jelasity Márk,et al. The shape of evolutionary search: discovering and representingsearch space structure , 2001 .
[146] Jan van Leeuwen,et al. Beyond the Turing Limit: Evolving Interactive Systems , 2001, SOFSEM.
[147] Elvira Mayordomo,et al. A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity , 2005, Mathematical systems theory.
[148] Oscar H. Ibarra,et al. Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties , 2005, Mathematical systems theory.
[149] R Rene Schiefer,et al. Viper : a visualisation tool for parallel program construction , 1999 .
[150] Michel A. Reniers,et al. Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..
[151] Peter Wegner,et al. Why interaction is more powerful than algorithms , 1997, CACM.
[152] D Dmitri Chkliaev,et al. Mechanical verification of concurrency control and recovery protocols , 2001 .
[153] F.A.M. van den Beuken,et al. A functional approach to syntax and typing , 1997 .