
- On Locally Checkable Properties Orna Kupferman 1 # , Yoad Lustig 1 , and Moshe Y. Vardi 2 ##
- Verification of Open Systems Moshe Y. Vardi ?
- A Note on the Reduction of TwoWay Automata to OneWay Automata #
- ViewBased Query Answering and Query Containment over Semistructured Data
- Rewriting of Regular Expressions and Regular Path Queries Diego Calvanese 1 , Giuseppe De Giacomo 1 , Maurizio Lenzerini 1 , Moshe Y. Vardi 2
- A SpaceEfficient Onthefly Algorithm for RealTime Model Checking
- Memoryful BranchingTime Logic Orna Kupferman
- Branching vs. Linear Time: Semantical Perspective Version 1.2
- Reference Manual June 24, 2001
- Pattern Search in Hierarchical High-Level Designs Zvi Terem, Gila Kamhi, Moshe Y. Vardi*, Amitai Irron
- Reasoning about The Past with TwoWay Automata
- Alternating Automata: Checking Truth and Validity for Temporal Logics
- Coverage Metrics for Temporal Logic Model Checking Hana Chockler 1 and Orna Kupferman 1 and Moshe Y. Vardi 2?
- Constraint Satisfaction and Database Theory: a Tutorial Moshe Y. Vardi
- Aggregating Disparate Estimates of Chance Daniel Osherson
- Efficient Buchi Universality Checking Seth Fogarty and Moshe Y. Vardi
- AUTOMATATHEORETIC TECHNIQUES FOR TEMPORAL REASONING
- From Liveness to Promptness # Orna Kupferman 1## , Nir Piterman 2 , and Moshe Y. Vardi 3# # #
- Extended Temporal Logic Revisited Orna Kupferman 1? Nir Piterman 2 Moshe Y. Vardi 3??
- An AutomataTheoretic Approach to BranchingTime Model Checking
- Branching vs. Linear Time: Final Showdown ? Moshe Y. Vardi ??
- GSTE is Partitioned Model Checking Roberto Sebastiani 1 ? , Eli Singerman 2 , Stefano Tonetta 1 , and Moshe Y. Vardi 3 ??
- Model Checking of Safety Properties Orna Kupferman
- Model Checking Linear Properties of PrefixRecognizable Systems Orna Kupferman
- BDDBased Decision Procedures for the Modal Guoqiang Pan * ---Ulrike Sattler ** ---Moshe Y. Vardi ***
- Alternating Automata and Program Verification Moshe Y. Vardi ?
- Experimental Evaluation Classical Automata Constructions #
- Constraint Satisfaction and Database Theory
- GSTE is Partitioned Model Checking + Roberto Sebastiani (rseba@dit.unitn.it) #
- Strong Cyclic Planning Revisited Marco Daniele 1;2 , Paolo Traverso 1 , and Moshe Y. Vardi 3?
- calculus Synthesis Orna Kupferman
- An Operational Semantics for Knowledge Bases Ronald Fagin
- Viewbased Query Processing and Constraint Satisfaction Diego Calvanese
- From Bidirectionality to Alternation Nir Piterman 1 and Moshe Y. Vardi 2?
- KnowledgeBased Programs \Lambda Ronald Fagin y
- A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints
- Why Is Modal Logic So Robustly Decidable?
- From Church and Prior to PSL Moshe Y. Vardi #
- Simplifying Schema Mappings Diego Calvanese
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Algorithmic Knowledge Joseph Y. Halpern
- Branching vs. Linear Time: Semantical Perspective
- B UCHI COMPLEMENTATION AND SIZE-CHANGE TERMINATION SETH FOGARTY AND MOSHE Y. VARDI
- On the Equivalence of Recursive and Nonrecursive Datalog Programs
- Model Checking of Safety Properties Orna Kupferman 1? and Moshe Y. Vardi 2??
- In nitary Logics and 0-1 Laws Phokion G. Kolaitis y
- On Complementing Nondeterministic B uchi Automata
- KnowledgeBased Programs Ronald Fagin \Lambda
- Complexity of Problems on Graphs Represented J. Feigenbaum, 1 S. Kannan, 2 ?? M. Y. Vardi, 3 ? ? ? M. Viswanathan 2 y
- Model Checking B uchi Specifications #
- Complementation Constructions for Nondeterministic Automata on Infinite Words
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction
- The Weakness of SelfComplementation Orna Kupferman 1? and Moshe Y. Vardi 2??
- Falsification of LTL Safety Properties in Hybrid Systems Erion Plaku, Lydia E. Kavraki, and Moshe Y. Vardi
- Sampling-based Motion Planning with Temporal Goals Amit Bhatia Lydia E. Kavraki Moshe Y. Vardi
- Lossless Regular Views Diego Calvanese
- Computational Model Theory: An Overview
- Fair Equivalence Relations Orna Kupferman 1 and Nir Piterman 2 and Moshe Y. Vardi 3?
- Robust Satisfaction Orna Kupferman 1 and Moshe Y. Vardi 2?
- An AutomataTheoretic Approach to BranchingTime Model Checking \Lambda
- AutomataTheoretic Approach to Planning for Temporally Extended Goals
- Global ModelChecking of InfiniteState Systems Nir Piterman 1 and Moshe Y. Vardi 2
- An AutomataTheoretic Approach to Reasoning about InfiniteState Systems
- FirstOrder Logic with Two Variables and Unary Temporal Logic \Lambda Kousha Etessami y Moshe Y. Vardi z Thomas Wilke x
- PropertyDriven Partitioning for Abstraction Refinement
- Branching vs. Linear Time: Final Showdown ? Moshe Y. Vardi ??
- The Hybrid -Calculus Ulrike Sattler 1? and Moshe Y. Vardi 2??
- Modular Model Checking ? Orna Kupferman 1?? and Moshe Y. Vardi 2???
- 2 \ 2 AFMC Orna Kupferman 1? and Moshe Y. Vardi 2??
- From Verification to Synthesis Moshe Y. Vardi
- ConjunctiveQuery Containment and Constraint Satisfaction Phokion G. Kolaitis \Lambda
- From Monadic Logic to PSL Moshe Y. Vardi
- Fair Equivalence Relations Orna Kupferman 1 and Nir Piterman 2 and Moshe Y. Vardi 3?
- Relating Word and Tree Automata Orna Kupferman
- On !-Automata and Temporal Logic Preliminary Report
- On the Expressive Power of Datalog: Tools and a Case Study
- Common Knowledge Revisited \Lambda Ronald Fagin
- Rewriting of Regular Expressions and Regular Path Queries Diego Calvanese 1 , Giuseppe De Giacomo 1 , Maurizio Lenzerini 1 , Moshe Y. Vardi 2
- Panel: Educational Response to Offshore Outsourcing William Aspray
- Coverage Metrics for Formal Verification Hana Chockler
- ConjunctiveQuery Containment and Constraint Satisfaction \Lambda
- On the Complexity of Modular Model Checking Moshe Y. Vardi
- Module Checking Orna Kupferman 1 and Moshe Y. Vardi 2
- Optimizing a BDDbased Modal Solver ? Guoqiang Pan, Moshe Y. Vardi
- Eliminating Incoherence from Subjective Estimates of Chance Randy Batsell
- ViewBased Query Containment Diego Calvanese
- Journal of Artificial Intelligence Research 1 (2005) 1-28 Submitted 9/05; published ??/05 The Planning Spectrum --One, Two, Three, Infinity
- An Analysis of Slow Convergence in Interval Propagation
- On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs
- BMC 2004 Preliminary Version SAT-based Induction for Temporal Safety
- On the Complexity of Verifying Concurrent Transition Systems \Lambda
- Synthesis from KnowledgeBased Specifications ? (Extended Abstract)
- Regular Vacuity Doron Bustan 2 , Alon Flaisher 1 , Orna Grumberg 1 , Orna Kupferman 3# , and
- On Bounded Speci cations Orna Kupferman
- The Complexity of the Graded Calculus Orna Kupferman 1 , Ulrike Sattler 2 , Moshe Y. Vardi 3?
- Formal Methods in System Design manuscript No. (will be inserted by the editor)
- Globalization and Offshoring of Software Moshe Y. Vardi
- Hybrid Systems: From Verification to Falsification
- B uchi Complementation: A FortyYear Saga Moshe Y. Vardi #
- Automated Verification: Graphs, Logic, and Automata Moshe Y. Vardi
- Reasoning about Infinite Computations \Lambda Moshe Y. Vardi y
- Freedom, Weakness, and Determinism: From Lineartime to Branchingtime
- Coverage Metrics for Temporal Logic Model Checking Hana Chockler
- Synthesizing Distributed Systems Orna Kupferman
- Homomorphism Closed vs. Existential Positive Tomas Feder Moshe Y. Vardi y
- Module Checking Orna Kupferman
- Pushdown Module Checking with Imperfect Information #
- International Journal of Foundations of Computer Science # World Scientific Publishing Company
- Search vs. Symbolic Techniques in Satisfiability Solving Guoqiang Pan ? , Moshe Y. Vardi ?
- Viewbased Query Processing: On the Relationship between Rewriting,
- Verification of Concurrent Programs: The AutomataTheoretic Framework \Lambda
- Containment of Conjunctive Regular Path Queries with Inverse To appear in Proceedings of KR 2000
- A Temporal Fixpoint Calculus Extended Abstract
- Reasoning about Actions and Planning in ltl Action Theories
- The ForSpec Temporal Logic: A New Temporal PropertySpecification Language ?
- ViewBased Query Processing for Regular Path Queries with Inverse
- Fixpoint Logics, Relational Machines, and Computational Complexity
- Weak Alternating Automata Are Not That Weak 1 ORNA KUPFERMAN
- Branching vs. Linear Time: Semantical Perspective # Sumit Nain and Moshe Y. Vardi
- What is ViewBased Query Rewriting? (Position Paper)
- On the Complexity of Verifying Concurrent Transition Systems ? David Harel 1 and Orna Kupferman 2?? and Moshe Y. Vardi 3???
- Formal Techniques for SystemC Verification Position Paper
- Buchi Complementation and Size-Change Termination Seth Fogarty and Moshe Y. Vardi
- Journal of Artificial Intelligence Research 40 (2011) 657-676 Submitted 12/10; published 03/11 The Complexity of Integer Bound Propagation
- Symbolic Systems, Explicit Properties: on Hybrid Approaches
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- State of Buchi Complementation (Full Version) Ming-Hsien Tsai1
- Monitoring Temporal SystemC Properties Deian Tabakov
- Relentful Strategic Reasoning in Alternating-Time Temporal Logic
- Synthesis of Trigger Properties Orna Kupferman Moshe Vardi
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- An Automata-Theoretic Approach to Regular XPath Diego Calvanese1
- Trace Semantics Is Fully Abstract Sumit Nain and Moshe Y. Vardi
- Trace Semantics Is Fully Abstract Sumit Nain and Moshe Y. Vardi
- Synthesis from Component Libraries Yoad Lustig and Moshe Y. Vardi
- From Philosophical to Industrial Logics Moshe Y. Vardi
- Intelligate: Scalable Dynamic Invariant Learning for Power
- The Complexity of Relational Queries: A Personal Perspective
- Impact of Workspace Decompositions on Discrete Search Leading Continuous Exploration (DSLX) Motion Planning
- Logical Methods in Computer Science Volume 00, Number 0, Pages 000000
- 44 January 2008/Vol. 51, No. 1 COMMUNICATIONS OF THE ACM CACM: PAST, PRESENT,
- Automata: From Logics to Algorithms Moshe Y. Vardi1
- From Liveness to Promptness Orna Kupferman
- Branching vs. Linear Time: Semantical Perspective Version 1.1
- GROEBNER BASES COMPUTATION IN BOOLEAN RINGS FOR SYMBOLIC MODEL CHECKING
- PowerQuest: Trace Driven Data Mining for Power Optimization Pietro Babighian Gila Kamhi Moshe Vardi
- Automata-Theoretic Model Checking Revisited Moshe Y. Vardi
- Aggregating Disparate Estimates of Chance Daniel Osherson
- Automata Theory: From Theory to Applications
- Treewidth in Verification: Local vs. Global Andrea Ferrara1
- Efficient LTL Compilation for SAT-based Model Roy Armoni, Sergey Egorov, Ranan Fraer, Dmitry
- A Continuous-Discontinuous Second-Order Transition in the
- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
- Reasoning About Knowledge Reasoning About Knowledge
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES 28, 3-28 (1984) The Implication and Finite Implication Problems for
- Fixed-Parameter Hierarchies inside PSPACE Guoqiang Pan
- Submitted to Electronic Proceedings in Theoretical Computer Science.
- In writing formulas, it is convenient to use three other operators that are defined in terms of the above operators.
- A Measured Collapse of The Modal -Calculus Alternation Hierarchy
- Vacuity Detection in Temporal Model Checking Orna Kupferman 1 and Moshe Y. Vardi 2?
- The Planning Spectrum ---One, Two, Three, Infinity Marco Pistore
- An AutomataTheoretic Approach to Fair Realizability and Synthesis
- Sometimes and Not Never Rerevisited: On Branching Versus Linear Time
- From Complementation to Certification Orna Kupferman
- Branching vs. Linear Time: Final Showdown
- Is There a Best Symbolic Cycle-Detection Kathi Fisler 1;4 , Ranan Fraer 2 , Gila Kamhi 2 , Moshe Y. Vardi 1? , and Zijiang
- BLACK BOX CHECKING DORON PELED
- On the Complexity of Parity Word Automata Valerie King 1? and Orna Kupferman 2 and Moshe Y. Vardi 3??
- Verification by Augmented Abstraction: The AutomataTheoretic View \Lambda
- Random 3-SAT: The Plot Thickens Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel
- Counting with Automata Orna Kupferman
- 01 Laws for Fragments of Existential SecondOrder Logic: A Survey
- Random 3SAT: The Plot Thickens Cristian Coarfa, Demetrios D. Demopoulos ? , Alfonso San Miguel Aguirre ?? ,
- Decidable Containment of Recursive Queries Diego Calvanese 1 , Giuseppe De Giacomo 1 , and Moshe Y. Vardi 2
- Verification of Open Systems # Orna Kupferman
- Formal Verification of Backward Compatibility of Microcode ?
- Linear vs. Branching Time: A ComplexityTheoretic Perspective
- What purpose is served by a concept of process? Robin Milner, November 2009
- COMPLETE AXIOMATIZATIONS FOR REASONING ABOUT KNOWLEDGE AND TIME
- Deeper Bound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1
- Implementing KnowledgeBased Programs Moshe Y. Vardi \Lambda
- Model Checking for Database Theoreticians Moshe Y. Vardi 1#
- Weak Alternating Automata Are Not That Weak \Lambda Orna Kupferman y
- From Complementation to Certification Orna Kupferman
- Panel: Logic in the Computer Science Curriculum \Lambda Kim B. Bruce
- Branching vs. Linear Time: Final Showdown Moshe Y. Vardi ?
- Synthesis with Incomplete Informatio Orna Kupferman y
- An AutomataTheoretic Approach to Modular Model ORNA KUPFERMAN
- The Hierarchical Approach to Modeling Knowledge and Common Knowledge \Lambda
- Pushdown Specifications Orna Kupferman 1? and Nir Piterman 2 and Moshe Y. Vardi 3??
- LTL Satisfiability Checking Kristin Y. Rozier 1 # and Moshe Y. Vardi 2
- Verifying #Regular Properties of Markov Chains Doron Bustan 1 , Sasha Rubin 2 , and Moshe Y. Vardi 1
- Relating Linear and Branching Model Checking
- Weak Alternating Automata and Tree Automata Emptiness Orna Kupferman \Lambda
- Symbolic Decision Procedures for QBF ? Guoqiang Pan, Moshe Y. Vardi
- On the Expressive Power of VariableConfined Logics Phokion G. Kolaitis \Lambda
- Buchi Complementation Made Tighter Ehud Friedgut 1 , Orna Kupferman 2? , and Moshe Y. Vardi 3??
- Resets vs. Aborts in Linear Temporal Logic Roy Armoni 1 , Doron Bustan 2 , Orna Kupferman 3 , and Moshe Y. Vardi 2
- Model Checking and TransitiveClosure Logic ? Neil Immerman ??1 and Moshe Y. Vardi ???2
- The Buchi Complementation Saga Moshe Y. Vardi #
- Module Checking Revisited ? Orna Kupferman 1?? and Moshe Y. Vardi 2???
- Constraint Propagation as a Proof System Albert Atserias ?1 , Phokion G. Kolaitis ??2 , and Moshe Y. Vardi ? ? ?3
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Reasoning on Regular Path Queries D. Calvanese, G. De Giacomo, M. Lenzerini
- Improved Automata Generation for Linear Temporal Logic \Lambda
- Branching vs. Linear Time: Final Showdown # Moshe Y. Vardi ##
- Model Checking Database Theoreticians
- Relating Word and Tree Automata Orna Kupferman
- Model Checking vs. Theorem Proving: A Manifesto \Lambda Joseph Y. Halpern and Moshe Y. Vardi
- A Practical Approach to Coverage in Model Checking Hana Chockler 1 Orna Kupferman 1? Robert P. Kurshan 2 Moshe Y. Vardi 3??
- MicroMacro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems
- Symbolic Techniques in Satis ability Solving Guoqiang Pan and Moshe Y. Vardi
- Deterministic Dynamic Monitors for LinearTime Assertions
- Random 3SAT and BDDs: The Plot Thickens Further
- On the Complexity of BoundedVariable Queries (Extended Abstract)
- A GameTheoretic Approach to Constraint Satisfaction Phokion G. Kolaitis
- From Bidirectionality to Alternation Nir Piterman a;\Lambda Moshe Y. Vardi b;1
- Probabilistic LinearTime Model Checking: an Overview of The AutomataTheoretic Approach
- Finite Model Theory and Its Applications
- What is an inference rule? Ronald Fagin
- What is a process? Robin Milner, September 2009
- From Linear Time to Branching Time \Lambda Orna Kupferman y
- Answering Regular Path Queries Using Views Diego Calvanese 1 , Giuseppe De Giacomo 1 , Maurizio Lenzerini 1 , Moshe Y. Vardi 2
- Nontraditional Applications of Automata Theory ?
- Verification of Fair Transition Systems Orna Kupferman 1 and Moshe Y. Vardi 2
- MultipleCounterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation
- Multi-Objective Model Checking of Markov Decision Processes
- A Temporal Language for SystemC Deian Tabakov
- Symbolic Techniques in Propositional Satisfiability
- A New Heuristic for Bad Cycle Detection Using BDDs R. H. Hardin 1 R. P. Kurshan 1
- Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
- Safraless Decision Procedures # Orna Kupferman +
- Projection Pushing Revisited # Benjamin J. McMahan ## , Guoqiang Pan # # # , Patrick Porter + , and Moshe Y. Vardi #
- MemoryEfficient Algorithms for the Verification
- The phase transition in the random 1-3-HornSAT Demetrios D. Demopoulos
- The Only Way is Up Jasmin Fisher1
- Synthesis from Probabilistic Components Yoad Lustig, Sumit Nain, and Moshe Y. Vardi
- Optimized Temporal Monitors for SystemC Deian Tabakov and Moshe Y. Vardi
- Dynamic Reactive Modules , T.A. Henzinger2
- Node Selection Query Languages for Trees Diego Calvanese
- Once and For All6 Orna Kupfermana