Anna Slobodová

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