Anna Slobodová
According to our database1,
Anna Slobodová
authored at least 43 papers
between 1980 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021
2020
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020
2014
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014
2011
Proceedings of the 9th IEEE/ACM International Conference on Formal Methods and Models for Codesign, 2011
2010
Proceedings of the Design and Verification of Microprocessor Systems for High-Assurance Applications., 2010
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
Proceedings of the Formal Methods in Computer-Aided Design, 2008
2006
Proceedings of the Formal Methods: Applications and Technology, 2006
2001
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
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998
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
Formal Methods Syst. Des., 1997
Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997
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
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
Electron. Colloquium Comput. Complex., 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
Proceedings of the Computer Aided Verification, 1995
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
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci., 1994
Proceedings of the Mathematical Foundations of Computer Science 1994, 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
1992
Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly.
Theor. Comput. Sci., 1992
Int. J. Found. Comput. Sci., 1992
1991
1990
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages.
Inf. Process. Lett., 1990
1989
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989
1988
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.
Z. Oper. Research, 1980