Orna Kupferman

According to our database1, Orna Kupferman authored at least 237 papers between 1993 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Automata Theory and Model Checking.
Proceedings of the Handbook of Model Checking., 2018

Synthesis from component libraries with costs.
Theor. Comput. Sci., 2018

An Abstraction-Refinement Methodologyfor Reasoning about Network Games.
Games, 2018

On relative and probabilistic finite counterability.
Formal Methods in System Design, 2018

Timed Network Games with Clocks.
CoRR, 2018

Flow Logic.
CoRR, 2018

Spanning the spectrum from safety to liveness.
Acta Inf., 2018

Spanning-Tree Games.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Timed Network Games with Clocks.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Alternating Reachability Games with Behavioral and Revenue Objectives.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Playing with the Maximum-Flow Problem.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Synthesis of Controllable Nash Equilibria in Quantitative Objective Game.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

The Unfortunate-Flow Problem.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Timed Vacuity.
Proceedings of the Formal Methods - 22nd International Symposium, 2018

Multi-Player Flow Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Latticed-LTL synthesis in the presence of noisy inputs.
Discrete Event Dynamic Systems, 2017

How Deterministic are Good-For-Games Automata?
CoRR, 2017

Hierarchical Network Formation Games.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk).
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Timed Network Games.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

An Abstraction-Refinement Methodology for Reasoning about Network Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Flow Games.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

How Deterministic are Good-For-Games Automata?.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

A Parametrized Analysis of Algorithms on Hierarchical Graphs.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Sensing as a Complexity Measure.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Flow Logic.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Quantitative Assume Guarantee Synthesis.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Formally Reasoning About Quality.
J. ACM, 2016

Network-formation games with regular objectives.
Inf. Comput., 2016

Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis.
CoRR, 2016

High-Quality Synthesis Against Stochastic Environments.
CoRR, 2016

Synthesis with rational environments.
Ann. Math. Artif. Intell., 2016

Dynamic Resource Allocation Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Eulerian Paths with Regular Constraints.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On the Capacity of Capacitated Automata.
Proceedings of the Language and Automata Theory and Applications, 2016

On High-Quality Synthesis.
Proceedings of the Computer Science - Theory and Applications, 2016

High-Quality Synthesis Against Stochastic Environments.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Minimizing Deterministic Lattice Automata.
ACM Trans. Comput. Log., 2015

Prime languages.
Inf. Comput., 2015

Profile trees for Büchi word automata, with application to determinization.
Inf. Comput., 2015

Stochastization of Weighted Automata.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Congestion Games with Multisets of Resources and Applications in Synthesis.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

The Sensing Cost of Monitoring and Synthesis.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

On Relative and Probabilistic Finite Counterability.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Repairing Multi-Player Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Inherent Vacuity in Lattice Automata.
Proceedings of the Fields of Logic and Computation II, 2015

Spanning the Spectrum from Safety to Liveness.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Temporal Specifications with Accumulative Values.
ACM Trans. Comput. Log., 2014

Parameterized Weighted Containment.
ACM Trans. Comput. Log., 2014

An abstraction-refinement framework for trigger querying.
Formal Methods in System Design, 2014

Discounting in LTL.
CoRR, 2014

Variations on Safety.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Discounting in LTL.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Properties and Utilization of Capacitated Automata (Invited Talk).
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Regular Sensing.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Network-Formation Games with Regular Objectives.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Latticed-LTL Synthesis in the Presence of Noisy Inputs.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Synthesis with Rational Environments.
Proceedings of the Multi-Agent Systems - 12th European Conference, 2014

Synthesis from Component Libraries with Costs.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

From Reachability to Temporal Specifications in Cost-Sharing Games.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

A Game-Theoretic Approach to Simulation of Data-Parameterized Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Rigorous approximated determinization of weighted automata.
Theor. Comput. Sci., 2013

When does abstraction help?
Inf. Process. Lett., 2013

Unifying Büchi Complementation Constructions
Logical Methods in Computer Science, 2013

Profile Trees for Büchi Word Automata, with Application to Determinization.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Prime Languages.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Nondeterminism in the Presence of a Diverse or Unknown Future.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Formalizing and Reasoning about Quality.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Attention-Based Coverage Metrics.
Proceedings of the Hardware and Software: Verification and Testing, 2013

Parameterized Weighted Containment.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Automatic Generation of Quality Specifications.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Weighted Safety.
Proceedings of the Automated Technology for Verification and Analysis, 2013

An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications.
Proceedings of the Automated Technology for Verification and Analysis, 2013

A Framework for Ranking Vacuity Results.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Translating to Co-Büchi Made Tight, Unified, and Useful.
ACM Trans. Comput. Log., 2012

Once and for all.
J. Comput. Syst. Sci., 2012

Coping with selfish on-going behaviors.
Inf. Comput., 2012

Improved model checking of hierarchical systems.
Inf. Comput., 2012

Recent Challenges and Ideas in Temporal Synthesis.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Environment-Friendly Safety.
Proceedings of the Hardware and Software: Verification and Testing, 2012

Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Approximating Deterministic Lattice Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2012

Model Checking Systems and Specifications with Parameterized Atomic Propositions.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Temporal Synthesis for Bounded Systems and Environments.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

An Abstraction-Refinement Framework for Trigger Querying.
Proceedings of the Static Analysis - 18th International Symposium, 2011

Temporal Specifications with Accumulative Values.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Rigorous Approximated Determinization of Weighted Automata.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Synthesis with Clairvoyance.
Proceedings of the Hardware and Software: Verification and Testing, 2011

Minimizing Deterministic Lattice Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Co-Büching Them All.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Unifying Büchi Complementation Constructions.
Proceedings of the Computer Science Logic, 2011

Formal Analysis of Online Algorithms.
Proceedings of the Automated Technology for Verification and Analysis, 2011

Max and Sum Semantics for Alternating Weighted Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2011

What's Decidable about Weighted Automata?
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Multi-Valued Automata and Their Applications.
Proceedings of the Logics and Languages for Reliability and Security, 2010

Erratum for "What causes a system to satisfy a specification?".
ACM Trans. Comput. Log., 2010

Reasoning about online algorithms with weighted automata.
ACM Trans. Algorithms, 2010

Latticed Simulation Relations and Games.
Int. J. Found. Comput. Sci., 2010

Improved Model Checking of Hierarchical Systems.
Proceedings of the Verification, 2010

Rational Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

The Blowup in Translating LTL to Deterministic Automata.
Proceedings of the Model Checking and Artificial Intelligence - 6th International Workshop, 2010

Synthesis of Trigger Properties.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Coping with Selfish On-Going Behaviors.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Variable Automata over Infinite Alphabets.
Proceedings of the Language and Automata Theory and Applications, 2010

Alternation Removal in Büchi Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Parityizing Rabin and Streett.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

An Automata-Theoretic Approach to Infinite-State Systems.
Proceedings of the Time for Verification, 2010

The Quest for a Tight Translation of Büchi to co-Büchi Automata.
Proceedings of the Fields of Logic and Computation, 2010

Promptness in omega-Regular Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2009
From liveness to promptness.
Formal Methods in System Design, 2009

Rational Synthesis
CoRR, 2009

Reasoning about online algorithms with weighted automata.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Co-ing Büchi Made Tight and Useful.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Reasoning about Finite-State Switched Systems.
Proceedings of the Hardware and Software: Verification and Testing, 2009

Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

09501 Abstracts Collection - Software Synthesis.
Proceedings of the Software Synthesis, 06.12. - 11.12.2009, 2009

2008
What causes a system to satisfy a specification?.
ACM Trans. Comput. Log., 2008

Multi-valued Logics, Automata, Simulations, and Games.
Proceedings of the Verification, 2008

Vacuity in Testing.
Proceedings of the Tests and Proofs, Second International Conference, 2008

On Verifying Fault Tolerance of Distributed Protocols.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata.
Proceedings of the Logic for Programming, 2008

A Framework for Inherent Vacuity.
Proceedings of the Hardware and Software: Verification and Testing, 2008

A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance.
Proceedings of the Formal Methods in Computer-Aided Design, 2008

2007
Concurrent reachability games.
Theor. Comput. Sci., 2007

Exponential Gaps in our Knowledge.
Bulletin of the EATCS, 2007

Lattice Automata.
Proceedings of the Verification, 2007

Better Under-Approximation of Programs by Hiding Variables.
Proceedings of the Verification, 2007

What Triggers a Behavior?
Proceedings of the Formal Methods in Computer-Aided Design, 7th International Conference, 2007

Tightening the Exchange Rates Between Automata.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

From Liveness to Promptness.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Leaping Loops in the Presence of Abstraction.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Latticed Simulation Relations and Games.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
On the universal and existential fragments of the mu-calculus.
Theor. Comput. Sci., 2006

Coverage metrics for formal verification.
STTT, 2006

Typeness for omega-regular Automata.
Int. J. Found. Comput. Sci., 2006

Büchi Complementation Made Tighter.
Int. J. Found. Comput. Sci., 2006

Coverage metrics for temporal logic model checking*.
Formal Methods in System Design, 2006

Relating word and tree automata.
Ann. Pure Appl. Logic, 2006

On Locally Checkable Properties.
Proceedings of the Logic for Programming, 2006

Memoryful Branching-Time Logic.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Avoiding Determinization.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

An Abstraction-Refinement Framework for Multi-Agent Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Sanity Checks in Formal Verification.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Safraless Compositional Synthesis.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

On the Construction of Fine Automata for Safety Properties.
Proceedings of the Automated Technology for Verification and Analysis, 2006

On the Succinctness of Nondeterminism.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
From linear time to branching time.
ACM Trans. Comput. Log., 2005

From complementation to certification.
Theor. Comput. Sci., 2005

Complementation Constructions for Nondeterministic Automata on Infinite Words.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Safraless Decision Procedures.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Verifying Quantitative Properties Using Bound Functions.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

Regular Vacuity.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

Abstraction for Falsification.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004
w-Regular languages are testable with a constant number of queries.
Theor. Comput. Sci., 2004

From Complementation to Certification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy.
Proceedings of the STACS 2004, 2004

Reasoning About Systems with Transition Fairness.
Proceedings of the Logic for Programming, 2004

Typeness for omega-Regular Automata.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

Büchi Complementation Made Tighter.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003
Response to "Comments on 'On Object Systems and Behavior Inheritance'".
IEEE Trans. Software Eng., 2003

Vacuity detection in temporal model checking.
STTT, 2003

From Pre-Historic to Post-Modern Symbolic Model Checking.
Formal Methods in System Design, 2003

What Causes a System to Satisfy a Specification?
CoRR, 2003

On the Universal and Existential Fragments of the µ-Calculus.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Resets vs. Aborts in Linear Temporal Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Π2 ∩ Σ2 ≡ AFMC.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

On Complementing Nondeterministic Büchi Automata.
Proceedings of the Correct Hardware Design and Verification Methods, 2003

Coverage Metrics for Formal Verification.
Proceedings of the Correct Hardware Design and Verification Methods, 2003

Fair Equivalence Relations.
Proceedings of the Verification: Theory and Practice, 2003

Formal Analysis of Scientific-Computation Methods.
Proceedings of the IFAC Conference on Analysis and Design of Hybrid Systems, 2003

2002
On Object Systems and Behavioral Inheritance.
IEEE Trans. Software Eng., 2002

Alternating-time temporal logic.
J. ACM, 2002

Fair Simulation.
Inf. Comput., 2002

On the Complexity of Verifying Concurrent Transition Systems.
Inf. Comput., 2002

omega-Regular Languages Are Testable with a Constant Number of Queries.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

An Improved Algorithm for the Membership Problem for Extended Regular Expressions.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Pushdown Specifications.
Proceedings of the Logic for Programming, 2002

Coverage of Implementations by Simulating Specifications.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Synthesis of Uninitialized Systems.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Trading Probability for Fairness.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Model Checking Linear Properties of Prefix-Recognizable Systems.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

The Complexity of the Graded µ-Calculus.
Proceedings of the Automated Deduction, 2002

2001
Weak alternating automata are not that weak.
ACM Trans. Comput. Log., 2001

Module Checking.
Inf. Comput., 2001

Model Checking of Safety Properties.
Formal Methods in System Design, 2001

Coverage Metrics for Temporal Logic Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

On Bounded Specifications.
Proceedings of the Logic for Programming, 2001

Synthesizing Distributed Systems.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

On the Complexity of Parity Word Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Extended Temporal Logic Revisited.
Proceedings of the CONCUR 2001, 2001

A Practical Approach to Coverage in Model Checking.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000
An automata-theortetic approach to modular model checking.
ACM Trans. Program. Lang. Syst., 2000

An automata-theoretic approach to branching-time model checking.
J. ACM, 2000

Branching-Depth Hierarchies.
Electr. Notes Theor. Comput. Sci., 2000

On the Behavioral Inheritance of State-Based Objects.
Proceedings of the TOOLS 2000: 34th International Conference on Technology of Object-Oriented Languages and Systems, 30 July, 2000

µ-Calculus Synthesis.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Fair Equivalence Relations.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Open Systems in Reactive Environments: Control and Synthesis.
Proceedings of the CONCUR 2000, 2000

An Automata-Theoretic Approach to Reasoning about Infinite-State Systems.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions.
J. Log. Comput., 1999

Church's problem revisited.
Bulletin of Symbolic Logic, 1999

The Weakness of Self-Complementation.
Proceedings of the STACS 99, 1999

Robust Satisfaction.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

Vacuity Detection in Temporal Model Checking.
Proceedings of the Correct Hardware Design and Verification Methods, 1999

Model Checking of Safety Properties.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998
Verification of Fair Transition Systems.
Chicago J. Theor. Comput. Sci., 1998

Weak Alternating Automata and Tree Automata Emptiness.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Relating linear and branching model checking.
Proceedings of the Programming Concepts and Methods, 1998

Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Concurrent Reachability Games.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Alternating Refinement Relations.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

From Pre-historic to Post-modern Symbolic Model Checking.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
Weak Alternating Automata Are Not That Weak.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

From Quantity to Quality.
Proceedings of the Hybrid and Real-Time Systems, 1997

Alternating-time Temporal Logic.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Existence of Reduction Hierarchies.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

Fair Simulation.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

On the Complexity of Verifying Concurrent Transition Systems.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

Modular Model Checking.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997

Alternating-Time Temporal Logic.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997

Module Checking Revisited.
Proceedings of the Computer Aided Verification, 9th International Conference, 1997

1996
Buy One, Get One Free!!!
J. Log. Comput., 1996

Branching-Time Temporal Logic and Tree Automata.
Inf. Comput., 1996

Relating Word and Tree Automata.
Proceedings of the Proceedings, 1996

Not checking for closure under stuttering.
Proceedings of the Spin Verification System, 1996

A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking.
Proceedings of the CONCUR '96, 1996

Verification of Fair Transisiton Systems.
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

Module Checking.
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995
Once and For All
Proceedings of the Proceedings, 1995

On the Complexity of Branching Modular Model Checking (Extended Abstract).
Proceedings of the CONCUR '95: Concurrency Theory, 1995

Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions.
Proceedings of the Computer Aided Verification, 1995

1994
Buy One, Get One Free!!!
Proceedings of the Temporal Logic, First International Conference, 1994

An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract).
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993
Branching Time Temporal Logic and Amorphous Tree Automata.
Proceedings of the CONCUR '93, 1993


  Loading...