![Verification, model checking, and abstract interpretation [electronic resource] : 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings](https://image.aladin.co.kr/product/9902/38/cover/3319522337_2.jpg)
Verification, model checking, and abstract interpretation [electronic resource] : 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings
| 000 | 00000cam u2200205 a 4500 | |
| 001 | 000045992050 | |
| 005 | 20190801112303 | |
| 006 | m d | |
| 007 | cr | |
| 008 | 190726s2017 sz a ob 101 0 eng d | |
| 020 | ▼a 9783319522333 | |
| 020 | ▼a 9783319522340 (e-Book) | |
| 040 | ▼a 211009 ▼c 211009 ▼d 211009 | |
| 050 | 4 | ▼a QA76.76.V47 |
| 082 | 0 4 | ▼a 005.14 ▼2 23 |
| 084 | ▼a 005.14 ▼2 DDCK | |
| 090 | ▼a 005.14 | |
| 245 | 0 0 | ▼a Verification, model checking, and abstract interpretation ▼h [electronic resource] : ▼b 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings / ▼c Ahmed Bouajjani, David Monniaux (eds.). |
| 246 | 3 0 | ▼a VMCAI 2017 |
| 260 | ▼a Cham : ▼b Springer, ▼c c2017. | |
| 300 | ▼a 1 online resource (xvii, 560 p.) : ▼b ill. | |
| 490 | 1 | ▼a Lecture notes in computer science, ▼x 0302-9743 ; ▼v 10145 |
| 490 | 1 | ▼a Advanced research in computing and software science |
| 490 | 1 | ▼a LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| 500 | ▼a Title from e-Book title page. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 505 | 0 | ▼a Bringing LTL Model Checking to Biologists -- Verified Concurrent Code: Tricks of the Trade -- Detecting Strict Aliasing Violations in the Wild -- Effective Bug Finding in C Programs with Shape and Effect Abstractions -- Synthesizing Non-Vacuous Systems -- Static Analysis of Communicating Process Using Symbolic Transducers -- Reduction of Workflow Nets for Generalized Soundness Verification -- Structuring Abstract Interpreters through State and Value Abstractions -- Matching Multiplications in Bit-Vector Formulas -- Independence Abstractions and Models of Concurrency -- Complete Abstractions and Subclassical Modal Logics -- Using Abstract Interpretation to Correct Synchronization Faults -- Property Directed Reachability for Proving Absence of Concurrent Modification Errors -- Stabilizing Floating-Point Programs Using Provenance Analysis -- Dynamic Reductions for Model Checking Concurrent Software -- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games -- Counterexample Validation and Interpolation-Based Refinement for Forest Automata -- Block-wise Abstract Interpretation by Combining Abstract Domains with SMT -- Solving Nonlinear Integer Arithmetic with MCSat -- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms -- Efficient Elimination of Redundancies in Polyhedra Using Raytracing -- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions -- Detecting All High-Level Dataraces in an RTOS Kernel -- Reachability for Dynamic Parametric Processes -- Conjunctive Abstract Interpretation Using Paramodulation -- Reasoning in the Bernays-Schonfinkel-Ramsey Fragment of Separation Logic -- Finding Relevant Templates via the Principal Component Analysis -- Sound Bit-Precise Numerical Domains -- IC3 - Flipping the E in ICE -- Partitioned Memory Models for Program Analysis. |
| 520 | ▼a This book constitutes the refereed proceedings of the 18th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2017, held in Paris, France, in January 2017. The 27 full papers together with 3 invited keynotes presented were carefully reviewed and selected from 60 submissions. VMCAI provides topics including: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyber-physical systems. | |
| 530 | ▼a Issued also as a book. | |
| 538 | ▼a Mode of access: World Wide Web. | |
| 650 | 0 | ▼a Computer software ▼x Verification ▼v Congresses. |
| 650 | 0 | ▼a Software engineering ▼v Congresses. |
| 700 | 1 | ▼a Bouajjani, Ahmed. |
| 700 | 1 | ▼a Monniaux, David. |
| 711 | 2 | ▼a VMCAI (Conference) ▼n (18th : ▼d 2017 : ▼c Paris, France). |
| 830 | 0 | ▼a Lecture notes in computer science ; ▼v 10145. |
| 830 | 0 | ▼a Advanced research in computing and software science. |
| 830 | 0 | ▼a LNCS sublibrary. ▼n SL 1, ▼p Theoretical computer science and general issues. |
| 856 | 4 0 | ▼u https://oca.korea.ac.kr/link.n2s?url=https://doi.org/10.1007/978-3-319-52234-0 |
| 945 | ▼a KLPA | |
| 991 | ▼a E-Book(소장) |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 중앙도서관/e-Book 컬렉션/ | 청구기호 CR 005.14 | 등록번호 E14015902 | 도서상태 대출불가(열람가능) | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Bringing LTL Model Checking to Biologists.- Verified Concurrent Code: Tricks of the Trade.- Detecting Strict Aliasing Violations in the Wild.- Effective Bug Finding in C Programs with Shape and Effect Abstractions.- Synthesizing Non-Vacuous Systems.- Static Analysis of Communicating Process Using Symbolic Transducers.- Reduction of Workflow Nets for Generalized Soundness Verification.- Structuring Abstract Interpreters through State and Value Abstractions.- Matching Multiplications in Bit-Vector Formulas.- Independence Abstractions and Models of Concurrency.- Complete Abstractions and Subclassical Modal Logics.- Using Abstract Interpretation to Correct Synchronization Faults.- Property Directed Reachability for Proving Absence of Concurrent Modification Errors.- Stabilizing Floating-Point Programs Using Provenance Analysis.- Dynamic Reductions for Model Checking Concurrent Software.- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games.- Counterexample Validation and Interpolation-Based Refinement for Forest Automata.- Block-wise Abstract Interpretation by Combining Abstract Domains with SMT.- Solving Nonlinear Integer Arithmetic with MCSat.- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms.- Efficient Elimination of Redundancies in Polyhedra Using Raytracing.- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions.- Detecting All High-Level Dataraces in an RTOS Kernel.- Reachability for Dynamic Parametric Processes.- Conjunctive Abstract Interpretation Using Paramodulation.- Reasoning in the Bernays-Schonfinkel-Ramsey Fragment of Separation Logic.- Finding Relevant Templates via the Principal Component Analysis.- Sound Bit-Precise Numerical Domains.- IC3 - Flipping the E in ICE.- Partitioned Memory Models for Program Analysis.
정보제공 :
목차
Bringing LTL Model Checking to Biologists.- Verified Concurrent Code: Tricks of the Trade.- Detecting Strict Aliasing Violations in the Wild.- Effective Bug Finding in C Programs with Shape and Effect Abstractions.- Synthesizing Non-Vacuous Systems.- Static Analysis of Communicating Process Using Symbolic Transducers.- Reduction of Workflow Nets for Generalized Soundness Verification.- Structuring Abstract Interpreters through State and Value Abstractions.- Matching Multiplications in Bit-Vector Formulas.- Independence Abstractions and Models of Concurrency.- Complete Abstractions and Subclassical Modal Logics.- Using Abstract Interpretation to Correct Synchronization Faults.- Property Directed Reachability for Proving Absence of Concurrent Modification Errors.- Stabilizing Floating-Point Programs Using Provenance Analysis.- Dynamic Reductions for Model Checking Concurrent Software.- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games.- Counterexample Validation and Interpolation-Based Refinement for Forest Automata.- Block-wise Abstract Interpretation by Combining Abstract Domains with SMT.- Solving Nonlinear Integer Arithmetic with MCSat.- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms.- Efficient Elimination of Redundancies in Polyhedra Using Raytracing.- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions.- Detecting All High-Level Dataraces in an RTOS Kernel.- Reachability for Dynamic Parametric Processes.- Conjunctive Abstract Interpretation Using Paramodulation.- Reasoning in the Bernays-Schonfinkel-Ramsey Fragment of Separation Logic.- Finding Relevant Templates via the Principal Component Analysis.- Sound Bit-Precise Numerical Domains.- IC3 - Flipping the E in ICE.- Partitioned Memory Models for Program Analysis.
정보제공 :