01019nam a2200313 i 450099100125888970753620020507113531.0970308s1974 us ||| | eng b1019566x-39ule_instLE00644798ExLDip.to Fisicaita3510.92574.5'24'0184QH541May, R.59857Stability and complexity in model ecosystems /R. MayPrinceton, NJ :Princeton University Press,1974vii, 265 p. :ill. ;22 cm.Animal populationsEcologyPopulation dynamicsStability.b1019566x21-09-0627-06-02991001258889707536LE006 3 MAY12006000005906le006-E0.00-l- 01110.i1024144927-06-02Stability and complexity in model ecosystems33364UNISALENTOle00601-01-97ma -engus 0103477nam 2200649 a 450 991048480540332120250402154538.09786613567512978128038959712803895919783642161643364216164210.1007/978-3-642-16164-3(CKB)2670000000045146(SSID)ssj0000446632(PQKBManifestationID)11249946(PQKBTitleCode)TC0000446632(PQKBWorkID)10511801(PQKB)11624140(DE-He213)978-3-642-16164-3(MiAaPQ)EBC3065903(PPN)149025300(EXLCZ)99267000000004514620100818d2010 uy 0engurnn#008mamaatxtccrModel checking software 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010, proceedings /Jaco van de Pol, Michael Weber, (eds.)1st ed. 2010.Berlin ;Heidelberg Springer20101 online resource (X, 263 p. 70 illus.)LNCS sublibrary. SL 1, Theoretical computer science and general issuesLecture notes in computer science,0302-9743 ;v. 6349Bibliographic Level Mode of Issuance: Monograph9783642161636 3642161634 Includes bibliographical references and index.Satisfiability Modulo Theories for Model Checking -- SMT-Based Software Model Checking -- Symbolic Object Code Analysis -- Model Checking in Context -- Experimental Comparison of Concolic and Random Testing for Java Card Applets -- Combining SPIN with ns-2 for Protocol Optimization -- Automatic Generation of Model Checking Scripts Based on Environment Modeling -- Implementation and Performance of Model Checking -- Model Checking: Cleared for Take Off -- Context-Enhanced Directed Model Checking -- Efficient Explicit-State Model Checking on General Purpose Graphics Processors -- The SpinJa Model Checker -- LTL and Büchi Automata -- On the Virtue of Patience: Minimizing Büchi Automata -- Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance -- Nevertrace Claims for Model Checking -- Infinite State Models -- A False History of True Concurrency: From Petri to Tools -- Analysing Mu-Calculus Properties of Pushdown Systems -- Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains -- An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models -- Concurrent Software -- Context-Bounded Translations for Concurrent Software: An Empirical Evaluation -- One Stack to Run Them All.Lecture notes in computer science ;6349.LNCS sublibrary.SL 1,Theoretical computer science and general issues.Computer softwareVerificationsCongressesSpin (Computer program language)Computer softwareVerificationsSpin (Computer program language)005.1Pol Jaco van de1755261Weber Michael(Michael F.)190946International SPIN WorkshopMiAaPQMiAaPQMiAaPQBOOK9910484805403321Model checking software4199384UNINA