Formal Methods in Computer-Aided Design Second International Conference, FMCAD '98, Palo Alto, CA, USA, November 4-6, 1998, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Gopalakrishnan, Ganesh (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Windley, Phillip (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Έκδοση:1st ed. 1998.
Σειρά:Lecture Notes in Computer Science, 1522
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04822nam a2200565 4500
001 978-3-540-49519-2
003 DE-He213
005 20191021222529.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 |a 9783540495192  |9 978-3-540-49519-2 
024 7 |a 10.1007/3-540-49519-3  |2 doi 
040 |d GrThAP 
050 4 |a TA345-345.5 
072 7 |a UGC  |2 bicssc 
072 7 |a COM007000  |2 bisacsh 
072 7 |a UGC  |2 thema 
082 0 4 |a 620.00420285  |2 23 
245 1 0 |a Formal Methods in Computer-Aided Design  |h [electronic resource] :  |b Second International Conference, FMCAD '98, Palo Alto, CA, USA, November 4-6, 1998, Proceedings /  |c edited by Ganesh Gopalakrishnan, Phillip Windley. 
250 |a 1st ed. 1998. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1998. 
300 |a X, 538 p.  |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 1522 
505 0 |a Minimalist Proof Assistants: Interactions of Technology and Methodology in Formal System Level Verification -- Reducing Manual Abstraction in Formal Verification of Out- of- Order Execution -- Bit-Level Abstraction in the Verification of Pipelined Microprocessors by Correspondence Checking -- Solving Bit-Vector Equations -- The Formal Design of 1M-Gate ASICs -- Design of Experiments for Evaluation of BDD Packages Using Controlled Circuit Mutations -- A Tutorial on Stålmarck's Proof Procedure for Propositional Logic -- Almana: A BDD Minimization Tool Integrating Heuristic and RewritingMethods -- Bisimulation Minimization in an Automata-Theoretic Verification Framework -- Automatic Verification of Mixed-Level Logic Circuits -- A Timed Automaton-Based Method for Accurate Computation of Circuit Delay in the Presence of Cross-Talk -- Maximum Time Separation of Events in Cyclic Systems with Linear and Latest Timing Constraints -- Using MTBDDs for Composition and Model Checking of Real-Time Systems -- Formal Methods in CAD from an Industrial Perspective -- A Methodology for Automated Verification of Synthesized RTL Designs and Its Integration with a High-Level Synthesis Tool -- Combined Formal Post- and Presynthesis Verification in High Level Synthesis -- Formalization and Proof of a Solution to the PCI 2.1 Bus Transaction Ordering Problem -- A Performance Study of BDD-Based Model Checking -- Symbolic Model Checking Visualization -- Input Elimination and Abstraction in Model Checking -- Symbolic Simulation of the JEM1 Microprocessor -- Symbolic Simulation: An ACL2 Approach -- Verification of Data-Insensitive Circuits: An In-Order-Retirement Case Study -- Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification -- Formally Verifying Data and Control with Weak Reachability Invariants -- Generalized Reversible Rules -- An Assume-Guarantee Rule for Checking Simulation -- Three Approaches to Hardware Verification: HOL, MDG, and VIS Compared -- An Instruction Set Process Calculus -- Techniques for Implicit State Enumeration of EFSMs -- Model Checking on Product Structures -- BDDNOW: A Parallel BDD Package -- Model Checking VHDL with CV -- Alexandria: A Tool for Hierarchical Verification -- PV: An Explicit Enumeration Model-Checker. 
650 0 |a Computer-aided engineering. 
650 0 |a Computer hardware. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Computational complexity. 
650 1 4 |a Computer-Aided Engineering (CAD, CAE) and Design.  |0 http://scigraph.springernature.com/things/product-market-codes/I23044 
650 2 4 |a Computer Hardware.  |0 http://scigraph.springernature.com/things/product-market-codes/I1200X 
650 2 4 |a Logics and Meanings of Programs.  |0 http://scigraph.springernature.com/things/product-market-codes/I1603X 
650 2 4 |a Mathematical Logic and Formal Languages.  |0 http://scigraph.springernature.com/things/product-market-codes/I16048 
650 2 4 |a Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/T11022 
700 1 |a Gopalakrishnan, Ganesh.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Windley, Phillip.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662204689 
776 0 8 |i Printed edition:  |z 9783540651918 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1522 
856 4 0 |u https://doi.org/10.1007/3-540-49519-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)