There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

物件導向軟體之架構(Object-Oriented Software Construction)探討

การวจยเชงคณภาพ เปนเครองมอสำคญอยางหนงสำหรบทำความเขาใจสงคมและพฤตกรรมมนษย การวจยแบบการสรางทฤษฎจากขอมล กเปนหนงในหลายระเบยบวธการวจยเชงคณภาพทกำลงไดรบความสนใจ และเปนทนยมเพมสงขนเรอยๆ จากนกวชาการ และนกวจยในสาขาสงคมศาสตร และศาสตรอนๆ เชน พฤตกรรมศาสตร สงคมวทยา สาธารณสขศาสตร พยาบาลศาสตร จตวทยาสงคม ศกษาศาสตร รฐศาสตร และสารสนเทศศกษา ดงนน หนงสอเรอง “ConstructingGrounded Theory: A Practical Guide through Qualitative Analysis” หรอ “การสรางทฤษฎจากขอมล:แนวทางการปฏบตผานการวเคราะหเชงคณภาพ” จะชวยใหผอานมความรความเขาใจถงพฒนาการของปฏบตการวจยแบบสรางทฤษฎจากขอมล ตลอดจนแนวทาง และกระบวนการปฏบตการวจยอยางเปนระบบ จงเปนหนงสอทควรคาแกการอานโดยเฉพาะนกวจยรนใหม เพอเปนแนวทางในการนำความรความเขาใจไประยกตในงานวจยของตน อกทงนกวจยผเชยวชาญสามารถอานเพอขยายมโนทศนดานวจยใหกวางขวางขน

Constructing Grounded Theory: A Practical Guide through Qualitative Analysis

ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

[서평]「The Unified Modeling Language User Guide」

Model-based testing (MBT) relies on models of a system under test and/or its environment to derive test cases for the system. This paper discusses the process of MBT and defines a taxonomy that covers the key aspects of MBT approaches. It is intended to help with understanding the characteristics, similarities and differences of those approaches, and with classifying the approach used in a particular MBT tool. To illustrate the taxonomy, a description of how three different examples of MBT tools fit into the taxonomy is provided. Copyright © 2011 John Wiley & Sons, Ltd.

/pdf/a-taxonomy-of-model-based-testing-approaches-242q024wa8.pdf

A taxonomy of model-based testing approaches

Testing of Finite State Machines.- I. Testing of Finite State Machines.- 1 Homing and Synchronizing Sequences.- 2 State Identification.- 3 State Verification.- 4 Conformance Testing.- II. Testing of Labeled Transition Systems.- Testing of Labeled Transition Systems.- 5 Preorder Relations.- 6 Test Generation Algorithms Based on Preorder Relations.- 7 I/O-automata Based Testing.- 8 Test Derivation from Timed Automata.- 9 Testing Theory for Probabilistic Systems.- III. Model-Based Test Case Generation.- Model-Based Test Case Generation.- 10 Methodological Issues in Model-Based Testing.- 11 Evaluating Coverage Based Testing.- 12 Technology of Test-Case Generation.- 13 Real-Time and Hybrid Systems Testing.- IV. Tools and Case Studies.- Tools and Case Studies.- 14 Tools for Test Case Generation.- 15 Case Studies.- V. Standardized Test Notation and Execution Architecture.- Standardized Test Notation and Execution Architecture.- 16 TTCN-3.- 17 UML 2.0 Testing Profile.- VI. Beyond Testing.- Beyond Testing.- 18 Run-Time Verification.- 19 Model Checking.- VII. Appendices.- Appendices.- 20 Model-Based Testing - A Glossary.- 21 Finite State Machines.- 22 Labelled Transition Systems.

/pdf/model-based-testing-of-reactive-systems-advanced-lectures-2dbmg9xhjn.pdf

Model-Based Testing of Reactive Systems, Advanced Lectures

With the exponentially growing amount of information available on the Internet, the task of retrieving documents of interest has become increasingly difficult. Search engines usually return more than 1,500 results per query, yet out of the top twenty results, only one half turn out to be relevant to the user. One reason for this is that Web queries are in general very short and give an incomplete specification of individual users' information needs. This paper explores ways of incorporating users' interests into the search process to improve the results. The user profiles are structured as a concept hierarchy of 4,400 nodes. These are populated by 'watching over a user's shoulder' while he is surfing. No explicit feedback is necessary. The profiles are shown to converge and to reflect the actual interests quite well. One possible deployment of the profiles is investigated: re-ranking and filtering search results. Increases in performance are moderate but noticeable and show that fully automatic creation of large hierarchical user profiles is possible.

/pdf/ontology-based-personalized-search-1p31p0v07s.pdf

Ontology based personalized search

The first pieces of software were introduced into cars in 1976. By 2010, premium class vehicles are expected to contain one gigabyte of on-board software. We present research challenges in the domain of automotive software engineering.

https://www.cse.msu.edu/~cse435/Handouts/HighAssurance/SE-AutomotiveSystems-Roadmap-2007.pdf

Software Engineering for Automotive Systems: A Roadmap

The amount of software in cars grows exponentially. Driving forces of this development are the availability of cheaper and more powerful hardware, as well as the demand for innovation through new functionality. The rapidly growing significance of software and software-based functionality is at the root of various challenges in the automotive industries. These concern their organization, definition of key competencies, processes, methods, tools, models, product structures, division of labor, logistics, maintenance, and long-term strategies. This paper pinpoints the idiosyncrasies of the domain, characterizes the essentials of automotive software, and discusses the challenges of automotive software engineering

https://mediatum.ub.tum.de/doc/1251761/file.pdf

Alexander Pretschner

Papers

A taxonomy of model-based testing approaches

Model-Based Testing of Reactive Systems, Advanced Lectures

Ontology based personalized search

Software Engineering for Automotive Systems: A Roadmap

Engineering Automotive Software