Christian Stangier

According to our database1, Christian Stangier authored at least 20 papers between 1997 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2004
Invariant Checking Combining Forward and Backward Traversal.
Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

A Partitioning Methodology for BDD-Based Verification.
Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

2003
Improved Symbolic Verification Using Partitioning Techniques.
Proceedings of the Correct Hardware Design and Verification Methods, 2003

2002
High-level Methods for OBDD-based Sequential Verification
PhD thesis, 2002

Modular Partitioning and Dynamic Conjunction Scheduling in Image Computation.
Proceedings of the 11th IEEE/ACM International Workshop on Logic & Synthesis, 2002

2001
Modular Partitioning for Improvement of Image Computation
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2001

Hierarchical Image Computation with Dynamic Conjunction Scheduling.
Proceedings of the 19th International Conference on Computer Design (ICCD 2001), 2001

Applying Formal Verification with Protocol Compiler.
Proceedings of the Euromicro Symposium on Digital Systems Design 2001 (Euro-DSD 2001), 2001

A new partitioning scheme for improvement of image computation.
Proceedings of ASP-DAC 2001, 2001

Data Structures for Boolean Functions.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000
Speeding up symbolic model checking by accelerating dynamic variable reordering.
Proceedings of the 10th ACM Great Lakes Symposium on VLSI 2000, 2000

Speeding Up Image Computation by Using RTL Information.
Proceedings of the Formal Methods in Computer-Aided Design, Third International Conference, 2000

Algorithms and Heuristics in VLSI Design.
Proceedings of the Experimental Algorithmics, 2000

1999
Applying Formal Verification with Protocol Compiler
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

Speeding Up Symbolic Model Checking by Accelerating Dynamic Variable Reordering
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

Increasing Efficiency of Symbolic Model Checking by Accelerating Dynamic Variable Reordering.
Proceedings of the 1999 Design, 1999

1998
Do We Really Need Common Variable Orders for Synthesizing OBDDs?
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Increasing Efficiency of Symbolic Model Checking by Accelerating Dynamic Variable Reordering
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Binary Decision Diagrams and the Multiple Variable Order Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

1997
OBDD-based Verification of Communication Protocols - Methods for the Verification of Data Link Protocols
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997


  Loading...