My Account Log in

1 option

Correct Hardware Design and Verification Methods : 10th IFIP WG10.5 Advanced Research Working Conference, CHARME'99, Bad Herrenalb, Germany, September 27-29, 1999, Proceedings / edited by Laurence Pierre, Thomas Kropf.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Pierre, Laurence, editor.
Kropf, Thomas, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1703.
Lecture Notes in Computer Science, 0302-9743 ; 1703
Language:
English
Subjects (All):
Computer architecture.
Computer engineering.
Computer hardware.
Computer logic.
Software engineering.
Computational complexity.
Computer System Implementation.
Computer Engineering.
Computer Hardware.
Logics and Meanings of Programs.
Software Engineering.
Complexity.
Local Subjects:
Computer System Implementation.
Computer Engineering.
Computer Hardware.
Logics and Meanings of Programs.
Software Engineering.
Complexity.
Physical Description:
1 online resource (XII, 376 pages).
Edition:
First edition 1999.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
System Details:
text file PDF
Summary:
CHARME'99 is the tenth in a series of working conferences devoted to the dev- opment and use of leading-edge formal techniques and tools for the design and veri?cation of hardware and systems. Previous conferences have been held in Darmstadt (1984), Edinburgh (1985), Grenoble (1986), Glasgow (1988), Leuven (1989), Torino (1991), Arles (1993), Frankfurt (1995) and Montreal (1997). This workshop and conference series has been organized in cooperation with IFIP WG 10. 5. It is now the biannual counterpart of FMCAD, which takes place every even-numbered year in the USA. The 1999 event took place in Bad Her- nalb, a resort village located in the Black Forest close to the city of Karlsruhe. The validation of functional and timing behavior is a major bottleneck in current VLSI design systems. A predominantly academic area of study until a few years ago, formal design and veri?cation techniques are now migrating into industrial use. The aim of CHARME'99 is to bring together researchers and users from academia and industry working in this active area of research. Two invited talks illustrate major current trends: the presentation by G ́erard Berry (Ecole des Mines de Paris, Sophia-Antipolis, France) is concerned with the use of synchronous languages in circuit design, and the talk given by Peter Jansen (BMW, Munich, Germany) demonstrates an application of formal methods in an industrial environment. The program also includes 20 regular presentations and 12 short presentations/poster exhibitions that have been selected from the 48 submitted papers.
Contents:
Invited Talks
Esterel and Jazz : Two Synchronous Languages for Circuit Design
Design Process of Embedded Automotive Systems-Using Model Checking for Correct Specifications
Proof of Microprocessors
A Proof of Correctness of a Processor Implementing Tomasulo's Algorithm without a Reorder Buffer
Formal Verification of Explicitly Parallel Microprocessors
Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
Model Checking
Model Checking TLA+ Specifications
Efficient Decompositional Model Checking for Regular Timing Diagrams
Vacuity Detection in Temporal Model Checking
Formal Methods and Industrial Applications
Using Symbolic Model Checking to Verify the Railway Stations of Hoorn-Kersenboogerd and Heerhugowaard
Practical Application of Formal Verification Techniques on a Frame Mux/Demux Chip from Nortel Semiconductors
Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics
Abstraction and Compositional Techniques
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking
Automatic Error Correction of Large Circuits Using Boolean Decomposition and Abstraction
Abstract BDDs: A Technique for Using Abstraction in Model Checking
Theorem Proving Related Approaches
Formal Synthesis at the Algorithmic Level
Xs Are for Trajectory Evaluation, Booleans Are for Theorem Proving
Verification of Infinite State Systems by Compositional Model Checking
Symbolic Simulation/Symbolic Traversal
Formal Verification of Designs with Complex Control by Symbolic Simulation
Hints to Accelerate Symbolic Traversal
Specification Languages and Methodologies
Modeling and Checking Networks of Communicating Real-Time Processes
"Have I Written Enough Properties?" - A Method of Comparison Between Specification and Implementation
Program Slicing of Hardware Description Languages
Posters
Results of the Verification of a Complex Pipelined Machine Model
Hazard-Freedom Checking in Speed-Independent Systems
Yet Another Look at LTL Model Checking
Verification of Finite-State-Machine Refinements Using a Symbolic Methodology
Refinement and Property Checking in High-Level Synthesis Using Attribute Grammars
A Systematic Incrementalization Technique and Its Application to Hardware Design
Bisimulation and Model Checking
Circular Compositional Reasoning about Liveness
Symbolic Simulation of Microprocessor Models Using Type Classes in Haskell
Exploiting Retiming in a Guided Simulation Based Validation Methodology
Fault Models for Embedded Systems
Validation of Object-Oriented Concurrent Designs by Model Checking.
Other Format:
Printed edition:
ISBN:
978-3-540-48153-9
9783540481539
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account