國立虎尾科技大學 |

Theoretical Aspects of Computing – ICTAC 2018 = 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Theoretical Aspects of Computing – ICTAC 2018/ edited by Bernd Fischer, Tarmo Uustalu.
Reminder of title:	15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings /
other author:	Fischer, Bernd.
Description:	XVII, 533 p. 84 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Software Engineering. -
Online resource:	https://doi.org/10.1007/978-3-030-02508-3
ISBN:	9783030025083

Theoretical Aspects of Computing – ICTAC 2018 = 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings /
Theoretical Aspects of Computing – ICTAC 201815th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings /[electronic resource] :edited by Bernd Fischer, Tarmo Uustalu. - 1st ed. 2018. - XVII, 533 p. 84 illus.online resource. - Theoretical Computer Science and General Issues ;11187. - Theoretical Computer Science and General Issues ;9163.

Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs -- LTL Semantic Tableaux and Alternating Omega-automata via Linear Factors -- Proof Nets and the Linear Substitution Calculus -- Modular Design of Domain-Specific Languages Using Splittings of Catamorphisms -- An Automata-Based View on Configurability and Uncertainty -- Formalising Boost POSIX Regular Expression Matching -- Monoidal Multiplexing -- Input/Output Stochastic Automata with Urgency: Conuence and Weak Determinism -- Layer by Layer: Combining Monads -- Layer Systems for Confluence – Formalized -- A Metalanguage for Guarded Iteration -- Generating Armstrong ABoxes for ALC TBoxes -- Spatio-Temporal Domains: An Overview -- Checking Modal Contracts for Virtually Timed Ambients -- Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers -- Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State Spaces -- Symbolic Computation via Program Transformation -- Double Applicative Functors -- Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving -- Explicit Auditing -- Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables -- Complexity Results on Register Context-Free Grammars and Register Tree Automata -- Information Flow Certificates -- The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers -- Convex Language Semantics for Nondeterministic Probabilistic Automata -- Fast Computations on Ordered Nominal Sets -- Non-preemptive Semantics for Data-Race-Free Programs.

This book constitutes the refereed proceedings of the 15th International Colloquium on Theoretical Aspects of Computing, ICTAC 2018, held in Stellenbosch, South Africa, in October 2018. The 25 revised full papers presented together with two short and two long invited talks were carefully reviewed and selected from 59 submissions. The ICTAC conference aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC also specifically aims to promote research cooperation between developing and industrial countries.

ISBN: 9783030025083

Standard No.: 10.1007/978-3-030-02508-3doiSubjects--Topical Terms:

669632
Software Engineering.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Theoretical Aspects of Computing – ICTAC 2018 = 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings /
LDR:03950nam a22004335i 4500 001 989943
003 DE-He213
005 20200630164449.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783030025083 $9 978-3-030-02508-3
024 7 $a 10.1007/978-3-030-02508-3 $2 doi
035 $a 978-3-030-02508-3
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Theoretical Aspects of Computing – ICTAC 2018 $h [electronic resource] : $b 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings / $c edited by Bernd Fischer, Tarmo Uustalu.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XVII, 533 p. 84 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11187
505 0 $a Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs -- LTL Semantic Tableaux and Alternating Omega-automata via Linear Factors -- Proof Nets and the Linear Substitution Calculus -- Modular Design of Domain-Specific Languages Using Splittings of Catamorphisms -- An Automata-Based View on Configurability and Uncertainty -- Formalising Boost POSIX Regular Expression Matching -- Monoidal Multiplexing -- Input/Output Stochastic Automata with Urgency: Conuence and Weak Determinism -- Layer by Layer: Combining Monads -- Layer Systems for Confluence – Formalized -- A Metalanguage for Guarded Iteration -- Generating Armstrong ABoxes for ALC TBoxes -- Spatio-Temporal Domains: An Overview -- Checking Modal Contracts for Virtually Timed Ambients -- Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers -- Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State Spaces -- Symbolic Computation via Program Transformation -- Double Applicative Functors -- Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving -- Explicit Auditing -- Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables -- Complexity Results on Register Context-Free Grammars and Register Tree Automata -- Information Flow Certificates -- The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers -- Convex Language Semantics for Nondeterministic Probabilistic Automata -- Fast Computations on Ordered Nominal Sets -- Non-preemptive Semantics for Data-Race-Free Programs.
520 $a This book constitutes the refereed proceedings of the 15th International Colloquium on Theoretical Aspects of Computing, ICTAC 2018, held in Stellenbosch, South Africa, in October 2018. The 25 revised full papers presented together with two short and two long invited talks were carefully reviewed and selected from 59 submissions. The ICTAC conference aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC also specifically aims to promote research cooperation between developing and industrial countries.
650 2 4 $a Software Engineering. $3 669632
650 0 $a Computer logic. $3 786340
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Artificial intelligence. $3 559380
650 0 $a Software engineering. $3 562952
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
700 1 $a Fischer, Bernd. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1067816
700 1 $a Uustalu, Tarmo. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 675489
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030025076
776 0 8 $i Printed edition: $z 9783030025090
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-02508-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)