東華大學圖書館 |

Tools and algorithms for the construction and analysis of systems = 23rd International Conference, TACAS 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017 : proceedings.. Part II /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Tools and algorithms for the construction and analysis of systems/ edited by Axel Legay, Tiziana Margaria.
Reminder of title:	23rd International Conference, TACAS 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017 : proceedings.
remainder title:	TACAS 2017
other author:	Legay, Axel.
corporate name:	TACAS (Conference)
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2017.,
Description:	xxiv, 411 p. :ill., digital ;24 cm.
[NT 15003449]:	Security -- Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions -- Discriminating Traces with Time -- Directed Automated Memory Performance Testing -- Context-bounded Analysis for POWER -- Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas -- Almost Event-Rate Independent Monitoring of Metric Temporal Logic -- Optimal Translation of LTL to Limit Deterministic Automata -- Quantitative Systems -- Sequential Convex Programming for the Efficient Verification of Parametric MDPs -- JANI: Quantitative Model and Tool Interaction -- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults -- Long-run Rewards for Markov Automata -- SAT and SMT -- HiFrog: SMT-based Function Summarization for Software Verification -- Congruence Closure with Free Variables -- On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking -- Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations -- SV COMP -- Software Verification with Validation of Results (Report on SV-COMP 2017) -- AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution) -- CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution) -- DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution) -- Forester: From Heap Shapes to Automata Predicates (Competition Contribution) -- HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution) -- Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution) -- Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution) -- Symbiotic 4: Beyond Reachability (Competition Contribution) -- Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution) -- Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution) -- Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution) -- VeriAbs : Verification by Abstraction (Competition Contribution)
Contained By:	Springer eBooks
Subject:	System design - Congresses. -
Online resource:	http://dx.doi.org/10.1007/978-3-662-54580-5
ISBN:	9783662545805

Tools and algorithms for the construction and analysis of systems = 23rd International Conference, TACAS 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017 : proceedings.. Part II /
Tools and algorithms for the construction and analysis of systems23rd International Conference, TACAS 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017 : proceedings.Part II /[electronic resource] :TACAS 2017edited by Axel Legay, Tiziana Margaria. - Berlin, Heidelberg :Springer Berlin Heidelberg :2017. - xxiv, 411 p. :ill., digital ;24 cm. - Lecture notes in computer science,102060302-9743 ;. - Lecture notes in computer science ;10206..

Security -- Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions -- Discriminating Traces with Time -- Directed Automated Memory Performance Testing -- Context-bounded Analysis for POWER -- Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas -- Almost Event-Rate Independent Monitoring of Metric Temporal Logic -- Optimal Translation of LTL to Limit Deterministic Automata -- Quantitative Systems -- Sequential Convex Programming for the Efficient Verification of Parametric MDPs -- JANI: Quantitative Model and Tool Interaction -- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults -- Long-run Rewards for Markov Automata -- SAT and SMT -- HiFrog: SMT-based Function Summarization for Software Verification -- Congruence Closure with Free Variables -- On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking -- Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations -- SV COMP -- Software Verification with Validation of Results (Report on SV-COMP 2017) -- AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution) -- CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution) -- DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution) -- Forester: From Heap Shapes to Automata Predicates (Competition Contribution) -- HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution) -- Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution) -- Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution) -- Symbiotic 4: Beyond Reachability (Competition Contribution) -- Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution) -- Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution) -- Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution) -- VeriAbs : Verification by Abstraction (Competition Contribution)

The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP.

ISBN: 9783662545805

Standard No.: 10.1007/978-3-662-54580-5doiSubjects--Topical Terms:

661328
System design
--Congresses.

LC Class. No.: QA76.9.S88

Dewey Class. No.: 004.21

Tools and algorithms for the construction and analysis of systems = 23rd International Conference, TACAS 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017 : proceedings.. Part II /
LDR:04645nmm a2200373 a 4500 001 2092630
003 DE-He213
005 20170330100328.0
006 m d
007 cr nn 008maaau
008 171117s2017 gw s 0 eng d
020 $a 9783662545805 $q (electronic bk.)
020 $a 9783662545799 $q (paper)
024 7 $a 10.1007/978-3-662-54580-5 $2 doi
035 $a 978-3-662-54580-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.S88
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 004.21 $2 23
090 $a QA76.9.S88 $b T115 2017
111 2 $a TACAS (Conference) $n (23rd : $d 2017 : $c Uppsala, Sweden) $3 3226675
245 1 0 $a Tools and algorithms for the construction and analysis of systems $h [electronic resource] : $b 23rd International Conference, TACAS 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017 : proceedings. $n Part II / $c edited by Axel Legay, Tiziana Margaria.
246 3 $a TACAS 2017
246 3 $a ETAPS 2017
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2017.
300 $a xxiv, 411 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10206
505 0 $a Security -- Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions -- Discriminating Traces with Time -- Directed Automated Memory Performance Testing -- Context-bounded Analysis for POWER -- Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas -- Almost Event-Rate Independent Monitoring of Metric Temporal Logic -- Optimal Translation of LTL to Limit Deterministic Automata -- Quantitative Systems -- Sequential Convex Programming for the Efficient Verification of Parametric MDPs -- JANI: Quantitative Model and Tool Interaction -- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults -- Long-run Rewards for Markov Automata -- SAT and SMT -- HiFrog: SMT-based Function Summarization for Software Verification -- Congruence Closure with Free Variables -- On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking -- Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations -- SV COMP -- Software Verification with Validation of Results (Report on SV-COMP 2017) -- AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution) -- CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution) -- DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution) -- Forester: From Heap Shapes to Automata Predicates (Competition Contribution) -- HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution) -- Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution) -- Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution) -- Symbiotic 4: Beyond Reachability (Competition Contribution) -- Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution) -- Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution) -- Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution) -- VeriAbs : Verification by Abstraction (Competition Contribution)
520 $a The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP.
650 0 $a System design $x Congresses. $3 661328
650 0 $a Computer software $x Verification $v Congresses. $3 844546
650 0 $a System analysis $x Congresses. $3 535174
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Computation by Abstract Devices. $3 891207
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 891123
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
700 1 $a Legay, Axel. $3 2072458
700 1 $a Margaria, Tiziana. $3 1072078
710 2 $a SpringerLink (Online service) $3 836513
711 2 $a ETAPS (Conference) $n (20th : $d 2017 : $c Uppsala, Sweden) $3 3226671
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10206. $3 3226677
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-54580-5
950 $a Computer Science (Springer-11645)