Anna Slobodová

According to our database1, Anna Slobodová
  • authored at least 47 papers between 1980 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Microcode Verification - Another Piece of the Microprocessor Verification Puzzle.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2011
A flexible formal verification framework for industrial scale validation.
Proceedings of the 9th IEEE/ACM International Conference on Formal Methods and Models for Codesign, 2011

2009
Replacing Testing with Formal Verification in Intel CoreTM i7 Processor Execution Engine Validation.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Formal Verification of Hardware Support for Advanced Encryption Standard.
Proceedings of the Formal Methods in Computer-Aided Design, 2008

2006
Challenges for Formal Verification in Industrial Setting.
Proceedings of the Formal Methods: Applications and Technology, 2006

2001
Formal Verification Methods for Industrial Hardware Design.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

1999
Application Driven Variable Reordering and an Example Implementation in Reachability Analysis.
Proceedings of the 1999 Conference on Asia South Pacific Design Automation, 1999

1998
Accelerating OBDD-Minimization by Means of Structural and Semantical Properties
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Application Driven Variable Reordering and an Example in Reachability Analysis
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

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

Sample Method for Minimization of OBDDs.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

On the Composition Problem for OBDDs with Multiple Variable Orders.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Block-Restricted Reordering - Extended Experiments
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.
Theory Comput. Syst., 1997

A Unifying Theoretical Background for Some Bdd-based Data Structures.
Formal Methods in System Design, 1997

A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Speeding up Variable Reordering of OBDDs.
Proceedings of the Proceedings 1997 International Conference on Computer Design: VLSI in Computers & Processors, 1997

Multivalued Extension of Conditional Belief Functions.
Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

Optimal Non-approximability of MAXCLIQUE.
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996
Speeding up Variable Reordering of OBDDs.
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Global rebuilding of OBDD's avoiding memory requirement maxima.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1996

Some heuristics for generating tree-like FBDD types.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1996

An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC), 1996

1995
Global Rebuilding of OBDD's - Tunneling Memory Requirement Maxima
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Maschines and Multihead Automata.
Int. J. Found. Comput. Sci., 1995

Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits.
Proceedings of the 32st Conference on Design Automation, 1995

Global rebuilding of OBDDs Avoiding Memory Requirement Maxima.
Proceedings of the Computer Aided Verification, 1995

1994
A Unifying Theoretical Background for Some BDD-based Data Structures
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

On the Complexity of Constructing Optimal OBDD's
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Some Heuristics for Generating Tree-like FBDD Types
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci., 1994

On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Boolean Manipulation with Free BDD's. First Experimental Results.
Proceedings of the EDAC - The European Conference on Design Automation, ETC - European Test Conference, EUROASIC - The European Event in ASIC Design, Proceedings, February 28, 1994

1993
Boolean Manipulation with Free BDD's - First Experimental Results
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Efficient Manipulation of FBDDs by Means of a Modified OBDD-Package
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Proceedings of the Developments in Language Theory, 1993

1992
Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly.
Theor. Comput. Sci., 1992

On the Power of One-Way Synchronized Alternating Machines with Small Space.
Int. J. Found. Comput. Sci., 1992

Communication for Alternating Machines.
Acta Inf., 1992

1991
On the power of synchronization in parallel computations.
Discrete Applied Mathematics, 1991

1990
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages.
Inf. Process. Lett., 1990

1989
On the Power of Synchronization in Parallel Computations.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988
On the Power of Communication in Alternating Machines.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States.
Proceedings of the Machines, 1988

1980
On a control of a Markov chain under conditions with respect to the absolute stationary probabilities and cost.
Zeitschr. für OR, 1980


  Loading...