|
|
|
|
LEADER |
05171nam a22006135i 4500 |
001 |
978-3-642-11811-1 |
003 |
DE-He213 |
005 |
20151204170845.0 |
007 |
cr nn 008mamaa |
008 |
100305s2010 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642118111
|9 978-3-642-11811-1
|
024 |
7 |
|
|a 10.1007/978-3-642-11811-1
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Abstract State Machines, Alloy, B and Z
|h [electronic resource] :
|b Second International Conference, ABZ 2010, Orford, QC, Canada, February 22-25, 2010. Proceedings /
|c edited by Marc Frappier, Uwe Glässer, Sarfraz Khurshid, Régine Laleau, Steve Reeves.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
300 |
|
|
|a XIV, 416 p. 95 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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5977
|
505 |
0 |
|
|a Invited Talks -- A Structure for Dependability Arguments -- Formal Probabilistic Analysis: A Higher-Order Logic Based Approach -- ASM Papers -- Synchronous Message Passing and Semaphores: An Equivalence Proof -- AsmL-Based Concurrency Semantic Variations for Timed Use Case Maps -- Bârun: A Scripting Language for CoreASM -- AsmetaSMV: A Way to Link High-Level ASM Models to Low-Level NuSMV Specifications -- An Executable Semantics of the SystemC UML Profile -- Alloy Papers -- Specifying Self-configurable Component-Based Systems with FracToy -- Trace Specifications in Alloy -- An Imperative Extension to Alloy -- Towards Formalizing Network Architectural Descriptions -- Lightweight Modeling of Java Virtual Machine Security Constraints -- Alloy+HotCore: A Fast Approximation to Unsat Core -- B Papers -- Supporting Reuse in Event B Development: Modularisation Approach -- Reasoned Modelling Critics: Turning Failed Proofs into Modelling Guidance -- Applying the B Method for the Rigorous Development of Smart Card Applications -- Automatic Verification for a Class of Proof Obligations with SMT-Solvers -- A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking -- Development of a Synchronous Subset of AADL -- Matelas: A Predicate Calculus Common Formal Definition for Social Networking -- Structured Event-B Models and Proofs -- Refinement-Animation for Event-B — Towards a Method of Validation -- Reactivising Classical B -- Event-B Decomposition for Parallel Programs -- Z Papers -- Communication Systems in ClawZ -- Formalising and Validating RBAC-to-XACML Translation Using Lightweight Formal Methods -- Towards Formally Templated Relational Database Representations in Z -- Translating Z to Alloy -- ABZ Short Papers (Abstracts) -- B-ASM: Specification of ASM à la B -- A Case for Using Data-Flow Analysis to Optimize Incremental Scope-Bounded Checking -- On the Modelling and Analysis of Amazon Web Services Access Policies -- Architecture as an Independent Variable for Aspect-Oriented Application Descriptions -- ParAlloy: Towards a Framework for Efficient Parallel Analysis of Alloy Models -- Introducing Specification-Based Data Structure Repair Using Alloy -- Secrecy UML Method for Model Transformations -- Improving Traceability between KAOS Requirements Models and B Specifications -- Code Synthesis for Timed Automata: A Comparison Using Case Study -- Towards Validation of Requirements Models -- A Proof Based Approach for Formal Verification of Transactional BPEL Web Services -- On an Extensible Rule-Based Prover for Event-B -- B Model Abstraction Combining Syntactic and Semantic Methods -- A Basis for Feature-Oriented Modelling in Event-B -- Using Event-B to Verify the Kmelia Components and Their Assemblies -- Starting B Specifications from Use Cases -- Integrating SMT-Solvers in Z and B Tools -- Formal Analysis in Model Management: Exploiting the Power of CZT.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Mathematics of Computing.
|
700 |
1 |
|
|a Frappier, Marc.
|e editor.
|
700 |
1 |
|
|a Glässer, Uwe.
|e editor.
|
700 |
1 |
|
|a Khurshid, Sarfraz.
|e editor.
|
700 |
1 |
|
|a Laleau, Régine.
|e editor.
|
700 |
1 |
|
|a Reeves, Steve.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642118104
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5977
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-11811-1
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|