LEADER 06879nam 22007935 450 001 996465781203316 005 20230221150157.0 010 $a1-280-38785-8 010 $a9786613565778 010 $a3-642-14295-8 024 7 $a10.1007/978-3-642-14295-6 035 $a(CKB)2550000000015596 035 $a(SSID)ssj0000446364 035 $a(PQKBManifestationID)11297669 035 $a(PQKBTitleCode)TC0000446364 035 $a(PQKBWorkID)10492148 035 $a(PQKB)10580752 035 $a(DE-He213)978-3-642-14295-6 035 $a(MiAaPQ)EBC3065505 035 $a(PPN)149072821 035 $a(EXLCZ)992550000000015596 100 $a20100709d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Aided Verification$b[electronic resource] $e22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010, Proceedings /$fedited by Tayssir Touili, Byron Cook, Paul Jackson 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XVI, 676 p. 169 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6174 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14294-X 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Policy Monitoring in First-Order Temporal Logic -- Retrofitting Legacy Code for Security -- Quantitative Information Flow: From Theory to Practice? -- Memory Management in Concurrent Algorithms -- Invited Tutorials -- ABC: An Academic Industrial-Strength Verification Tool -- There?s Plenty of Room at the Bottom: Analyzing and Verifying Machine Code -- Constraint Solving for Program Verification: Theory and Practice by Example -- Session 1. Software Model Checking -- Invariant Synthesis for Programs Manipulating Lists with Unbounded Data -- Termination Analysis with Compositional Transition Invariants -- Lazy Annotation for Program Testing and Verification -- The Static Driver Verifier Research Platform -- Dsolve: Safety Verification via Liquid Types -- Contessa: Concurrency Testing Augmented with Symbolic Analysis -- Session 2. Model Checking and Automata -- Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing -- Efficient Emptiness Check for Timed Büchi Automata -- Session 3. Tools -- Merit: An Interpolating Model-Checker -- Breach, A Toolbox for Verification and Parameter Synthesis of Hybrid Systems -- Jtlv: A Framework for Developing Verification Algorithms -- Petruchio: From Dynamic Networks to Nets -- Session 4. Counter and Hybrid Systems Verification -- Synthesis of Quantized Feedback Control Software for Discrete Time Linear Hybrid Systems -- Safety Verification for Probabilistic Hybrid Systems -- A Logical Product Approach to Zonotope Intersection -- Fast Acceleration of Ultimately Periodic Relations -- An Abstraction-Refinement Approach to Verification of Artificial Neural Networks -- Session 5. Memory Consistency -- Fences in Weak Memory Models -- Generating Litmus Tests for Contrasting Memory Consistency Models -- Session 6. Verification of Hardware and Low Level Code -- Directed Proof Generation for Machine Code -- Verifying Low-Level Implementations of High-Level Datatypes -- Automatic Generation of Inductive Invariants from High-Level Microarchitectural Models of Communication Fabrics -- Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification -- Session 7. Tools -- LTSmin: Distributed and Symbolic Reachability -- libalf: The Automata Learning Framework -- Session 8. Synthesis -- Symbolic Bounded Synthesis -- Measuring and Synthesizing Systems in Probabilistic Environments -- Achieving Distributed Control through Model Checking -- Robustness in the Presence of Liveness -- RATSY ? A New Requirements Analysis Tool with Synthesis -- Comfusy: A Tool for Complete Functional Synthesis -- Session 9. Concurrent Program Verification I -- Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs -- Automatically Proving Linearizability -- Model Checking of Linearizability of Concurrent List Implementations -- Local Verification of Global Invariants in Concurrent Programs -- Abstract Analysis of Symbolic Executions -- Session 10. Compositional Reasoning -- Automated Assume-Guarantee Reasoning through Implicit Learning -- Learning Component Interfaces with May and Must Abstractions -- A Dash of Fairness for Compositional Reasoning -- SPLIT: A Compositional LTL Verifier -- Session 11. Tools -- A Model Checker for AADL -- PESSOA: A Tool for Embedded Controller Synthesis -- Session 12. Decision Procedures -- On Array Theory of Bounded Elements -- Quantifier Elimination by Lazy Model Enumeration -- Session 13. Concurrent Program Verification II -- Bounded Underapproximations -- Global Reachability in Bounded Phase Multi-stack Pushdown Systems -- Model-Checking Parameterized Concurrent Programs Using Linear Interfaces -- Dynamic Cutoff Detection in Parameterized Concurrent Programs -- Session 14. Tools -- PARAM: A Model Checker for Parametric Markov Models -- Gist: A Solver for Probabilistic Games -- A NuSMV Extension for Graded-CTL Model Checking. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6174 606 $aComputer science 606 $aSoftware engineering 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aArtificial intelligence 606 $aComputer networks 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 606 $aComputer Communication Networks 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aCompilers (Computer programs). 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aComputer networks. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 615 24$aArtificial Intelligence. 615 24$aComputer Communication Networks. 676 $a005.1015113 702 $aTouili$b Tayssir$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCook$b Byron$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJackson$b Paul$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465781203316 996 $aComputer Aided Verification$9772228 997 $aUNISA LEADER 02092nam 2200553I 450 001 9910702659103321 005 20141029082737.0 035 $a(CKB)5470000002429597 035 $a(OCoLC)893973590 035 $a(EXLCZ)995470000002429597 100 $a20141029j201401 ua 0 101 0 $aeng 135 $aurmn||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAdaptive back sheet material for acoustics liner applications--ARMD Seedling Fund phase I final report /$fCarl H. Gerhold and Michael G. Jones, Dawnielle Farrar 210 1$aHampton, Virginia :$cNational Aeronautics and Space Administration, Langley Research Center,$dJanuary 2014. 215 $a1 online resource (12 pages) $cillustrations (some color) 225 1 $aNASA/TM ;$v2014-218154 300 $aTitle from title screen (viewed July 9, 2014). 300 $a"January 2014." 320 $aIncludes bibliographical references (page 12). 517 1 $aAdaptive back sheet material for acoustics liner applications--Aeronautics Research Mission Directorate Seedling Fund phase I final report 606 $aAcoustic excitation$2nasat 606 $aLinings$2nasat 606 $aAcoustic ducts$2nasat 606 $aNoise reduction$2nasat 606 $aAdaptive control$2nasat 606 $aMetal sheets$2nasat 606 $aComposite materials$2nasat 615 7$aAcoustic excitation. 615 7$aLinings. 615 7$aAcoustic ducts. 615 7$aNoise reduction. 615 7$aAdaptive control. 615 7$aMetal sheets. 615 7$aComposite materials. 700 $aGerhold$b Carl H.$01410844 702 $aJones$b Michael G. 702 $aFarrar$b Dawnielle 712 02$aLangley Research Center, 712 02$aUnited States.$bNational Aeronautics and Space Administration, 801 0$bGPO 801 1$bGPO 906 $aBOOK 912 $a9910702659103321 996 $aAdaptive back sheet material for acoustics liner applications--ARMD Seedling Fund phase I final report$93500448 997 $aUNINA LEADER 03640nam 2200529 450 001 9910828441303321 005 20220525075748.0 010 $a1-4704-4815-7 035 $a(CKB)4100000007133848 035 $a(MiAaPQ)EBC5571101 035 $a(Au-PeEL)EBL5571101 035 $a(OCoLC)1065073359 035 $a(RPAM)20662073 035 $a(PPN)231946023 035 $a(EXLCZ)994100000007133848 100 $a20220525d2018 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgebraic Q-groups as abstract groups /$fOlivier Fre?con 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[2018] 210 4$dİ2018 215 $a1 online resource (v, 99 pages) 225 1 $aMemoirs of the American Mathematical Society ;$vNumber 1219 300 $a"September 2018 . Volume 255 . Number 1219 (second of 7 numbers)." 311 $a1-4704-2923-3 320 $aIncludes bibliographical references and index. 327 $aCover -- Title page -- Chapter 1. Introduction -- 1.1. Related work -- 1.2. The field of definition -- 1.3. Overview of the paper -- Chapter 2. Background material -- 2.1. Groups of finite Morley rank -- 2.2. Fundamental theorems -- 2.3. Decent tori and pseudo-tori -- 2.4. Unipotence -- Chapter 3. Expanded pure groups -- Chapter 4. Unipotent groups over \ov{\Q} and definable linearity -- Chapter 5. Definably affine groups -- 5.1. Definition and generalities -- 5.2. The subgroup ( ) -- 5.3. The subgroup ( ) -- Chapter 6. Tori in expanded pure groups -- Chapter 7. The definably linear quotients of an -group -- 7.1. The subgroups ( ) and ( ) -- 7.2. The nilpotence of ( ) -- 7.3. The subgroup ( ) when the ground field is \ov{\Q} -- 7.4. The subgroups ( ) and ( ) in positive characteristic -- Chapter 8. The group _{ } and the Main Theorem for =\ov{\Q} -- Chapter 9. The Main Theorem for =?\ov{\Q} -- Chapter 10. Bi-interpretability and standard isomorphisms -- 10.1. Positive characteristic and bi-interpretability -- 10.2. Characteristic zero -- Acknowledgements -- Bibliography -- Index of notations -- Index -- Back Cover. 330 $aThe author analyzes the abstract structure of algebraic groups over an algebraically closed field K. For K of characteristic zero and G a given connected affine algebraic \overline{\mathbb Q}-group, the main theorem describes all the affine algebraic \overline{\mathbb Q} -groups H such that the groups H(K) and G(K) are isomorphic as abstract groups. In the same time, it is shown that for any two connected algebraic \overline{\mathbb Q} -groups G and H, the elementary equivalence of the pure groups G(K) and H(K) implies that they are abstractly isomorphic. In the final section, the author applies his results to characterize the connected algebraic groups, all of whose abstract automorphisms are standard, when K is either \overline {\mathbb Q} or of positive characteristic. In characteristic zero, a fairly general criterion is exhibited. 410 0$aMemoirs of the American Mathematical Society ;$vNumber 1219. 606 $aAlgebra 606 $aFinite groups 606 $aIsomorphisms (Mathematics) 615 0$aAlgebra. 615 0$aFinite groups. 615 0$aIsomorphisms (Mathematics) 676 $a512.9 700 $aFre?con$b Olivier$f1974-$01595202 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910828441303321 996 $aAlgebraic Q-groups as abstract groups$93916033 997 $aUNINA