Anna Slobodová

Publication Activity (10 Years)

Years Active: 1980-2021
Publications (10 Years): 4

Top Topics

Efficient Implementation

Formal Verification

Multimedia Learning

Asynchronous Circuits

Top Venues

Publications

Shilpi Goel, Anna Slobodová, Rob Sumners, Sol Swords
Balancing Automation and Control for Formal Verification of Microprocessors. CAV (1) (2021)
Mertcan Temel, Anna Slobodová, Warren A. Hunt
Automated and Scalable Verification of Integer Multipliers. CAV (1) (2020)
Shilpi Goel, Anna Slobodová, Rob Sumners, Sol Swords
Verifying x86 instruction implementations. CPP (2020)
Shilpi Goel, Anna Slobodová, Rob Sumners, Sol Swords
Verifying x86 Instruction Implementations. CoRR (2019)
Jared Davis, Anna Slobodová, Sol Swords
Microcode Verification - Another Piece of the Microprocessor Verification Puzzle. ITP (2014)
Anna Slobodová, Jared Davis, Sol Swords, Warren A. Hunt Jr.
A flexible formal verification framework for industrial scale validation. MEMOCODE (2011)
Roope Kaivola, Rajnish Ghughal, Naren Narasimhan, Amber Telfer, Jesse Whittemore, Sudhindra Pandav, Anna Slobodová, Christopher Taylor, Vladimir A. Frolov, Erik Reeber, Armaghan Naik
Replacing Testing with Formal Verification in Intel CoreTM i7 Processor Execution Engine Validation. CAV (2009)
Anna Slobodová
Formal Verification of Hardware Support for Advanced Encryption Standard. FMCAD (2008)
Anna Slobodová
Challenges for Formal Verification in Industrial Setting. FMICS/PDMC (2006)
Anna Slobodová
Formal Verification Methods for Industrial Hardware Design. SOFSEM (2001)
Christoph Meinel, Klaus Schwettmann, Anna Slobodová
Application Driven Variable Reordering and an Example Implementation in Reachability Analysis. ASP-DAC (1999)
Anna Slobodová, Christoph Meinel
Sample Method for Minimization of OBDDs. SOFSEM (1998)
Gianpiero Cabodi, Stefano Quer, Christoph Meinel, Harald Sack, Anna Slobodová, Christian Stangier
Binary Decision Diagrams and the Multiple Variable Order Problem Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Anna Slobodová
On the Composition Problem for OBDDs with Multiple Variable Orders. MFCS (1998)
Christoph Meinel, Klaus Schwettmann, Anna Slobodová
Application Driven Variable Reordering and an Example in Reachability Analysis Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Christoph Meinel, Anna Slobodová
Accelerating OBDD-Minimization by Means of Structural and Semantical Properties Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Martin Mundhenk, Anna Slobodová
Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms (1997)
Christoph Meinel, Anna Slobodová
Speeding up Variable Reordering of OBDDs. ICCD (1997)
Christoph Meinel, Anna Slobodová
A Unifying Theoretical Background for Some Bdd-based Data Structures. Formal Methods Syst. Des. 11 (3) (1997)
Anna Slobodová
Multivalued Extension of Conditional Belief Functions. ECSQARU-FAPR (1997)
Christoph Meinel, Anna Slobodová
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. Theory Comput. Syst. 30 (5) (1997)
Christoph Meinel, Anna Slobodová, Peter Willems
Block-Restricted Reordering - Extended Experiments Universität Trier, Mathematik/Informatik, Forschungsbericht (1997)
Christoph Meinel, Anna Slobodová
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. STACS (1997)
Christoph Meinel, Anna Slobodová
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Jochen Bern, Christoph Meinel, Anna Slobodová
Global rebuilding of OBDD's avoiding memory requirement maxima. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15 (1) (1996)
Christoph Meinel, Anna Slobodová
Speeding up Variable Reordering of OBDDs. Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Christoph Meinel, Anna Slobodová
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams Electron. Colloquium Comput. Complex. 3 (10) (1996)
Jochen Bern, Christoph Meinel, Anna Slobodová
Some heuristics for generating tree-like FBDD types. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15 (1) (1996)
Jochen Bern, Christoph Meinel, Anna Slobodová
Global rebuilding of OBDDs Avoiding Memory Requirement Maxima. CAV (1995)
Jochen Bern, Christoph Meinel, Anna Slobodová
Global Rebuilding of OBDD's - Tunneling Memory Requirement Maxima Universität Trier, Mathematik/Informatik, Forschungsbericht (1995)
Jochen Bern, Christoph Meinel, Anna Slobodová
Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits. DAC (1995)
Anna Slobodová
On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Maschines and Multihead Automata. Int. J. Found. Comput. Sci. 6 (4) (1995)
Christoph Meinel, Anna Slobodová
On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. MFCS (1994)
Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová
Boolean Manipulation with Free BDD's. First Experimental Results. EDAC-ETC-EUROASIC (1994)
Juraj Hromkovic, Branislav Rovan, Anna Slobodová
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Theor. Comput. Sci. 132 (2) (1994)
Christoph Meinel, Anna Slobodová
On the Complexity of Constructing Optimal OBDD's Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Jochen Bern, Christoph Meinel, Anna Slobodová
Some Heuristics for Generating Tree-like FBDD Types Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Christoph Meinel, Anna Slobodová
A Unifying Theoretical Background for Some BDD-based Data Structures Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Jochen Bern, Christoph Meinel, Anna Slobodová
Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová
Boolean Manipulation with Free BDD's - First Experimental Results Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Juraj Hromkovic, Branislav Rovan, Anna Slobodová
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Developments in Language Theory (1993)
Anna Slobodová, Christoph Meinel
Efficient Manipulation of FBDDs by Means of a Modified OBDD-Package Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Anna Slobodová
Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly. Theor. Comput. Sci. 96 (2) (1992)
Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, Klaus W. Wagner
On the Power of One-Way Synchronized Alternating Machines with Small Space. Int. J. Found. Comput. Sci. 3 (1) (1992)
Anna Slobodová
Communication for Alternating Machines. Acta Informatica 29 (5) (1992)
Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
On the power of synchronization in parallel computations. Discret. Appl. Math. 32 (2) (1991)
Anna Slobodová
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages. Inf. Process. Lett. 36 (2) (1990)
Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
On the Power of Synchronization in Parallel Computations. MFCS (1989)
Anna Slobodová
Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States. IMYCS (1988)
Anna Slobodová
On the Power of Communication in Alternating Machines. MFCS (1988)
Anna Slobodová
On a control of a Markov chain under conditions with respect to the absolute stationary probabilities and cost. Z. Oper. Research 24 (3) (1980)