Moshe Vardi
American computer scientist
Moshe Vardi's AcademicInfluence.com Rankings
Download Badge
Computer Science
Why Is Moshe Vardi Influential?
(Suggest an Edit or Addition)According to Wikipedia, Moshe Ya'akov Vardi is an Israeli mathematician and computer scientist. He is the Karen Ostrum George Distinguished Service Professor in Computational Engineering at Rice University, United States. and a faculty advisor for the Ken Kennedy Institute. His interests focus on applications of logic to computer science, including database theory, finite model theory, knowledge of multi-agent systems, computer-aided verification and reasoning, and teaching logic across the curriculum. He is an expert in model checking, constraint satisfaction and database theory, common knowledge , and theoretical computer science.
Moshe Vardi's Published Works
Published Works
- An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) (1986) (1772)
- The complexity of relational query languages (Extended Abstract) (1982) (1522)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (1999) (1036)
- Reasoning About Infinite Computations (1994) (903)
- Simple on-the-fly automatic verification of linear temporal logic (1995) (856)
- Automatic verification of probabilistic concurrent finite state programs (1985) (765)
- An Automata-Theoretic Approach to Linear Temporal Logic (1996) (748)
- An automata-theoretic approach to branching-time model checking (2000) (668)
- Model Checking of Safety Properties (1999) (650)
- Automata-Theoretic Techniques for Modal Logics of Programs (1986) (602)
- Memory-efficient algorithms for the verification of temporal properties (1990) (601)
- The Complementation Problem for Büchi Automata with Appplications to Temporal Logic (1987) (453)
- Conjunctive-query containment and constraint satisfaction (1998) (445)
- Linear Temporal Logic and Linear Dynamic Logic on Finite Traces (2013) (433)
- Reasoning about The Past with Two-Way Automata (1998) (408)
- On the semantics of updates in databases (1983) (408)
- A Proof Procedure for Data Dependencies (1984) (405)
- Parametric real-time reasoning (1993) (388)
- Alternating Refinement Relations (1998) (352)
- On the Decision Problem for Two-Variable First-Order Logic (1997) (348)
- Reasoning about infinite computation paths (1983) (331)
- Black Box Checking (1999) (321)
- Updating Logical Databases (1986) (313)
- Why is Modal Logic So Robustly Decidable? (1996) (313)
- On the foundations of the universal relation model (1984) (310)
- Weak alternating automata are not that weak (1997) (299)
- Branching vs. Linear Time: Final Showdown (2001) (298)
- The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds (1989) (281)
- The complexity of reasoning about knowledge and time (1986) (279)
- Globalization and offshoring of software : a report of the ACM Job Migration Task Force (2006) (269)
- The Implication Problem for Data Dependencies (1981) (266)
- Module Checking (1996) (250)
- Model Checking vs. Theorem Proving: A Manifesto (1991) (247)
- Safraless decision procedures (2005) (237)
- Sampling-based motion planning with temporal goals (2010) (236)
- Improved Automata Generation for Linear Temporal Logic (1999) (226)
- A temporal fixpoint calculus (1988) (225)
- Benefits of Bounded Model Checking at an Industrial Setting (2001) (225)
- Rewriting of regular expressions and regular path queries (1999) (211)
- First-order logic with two variables and unary temporal logic (1997) (209)
- On the Complexity of Bounded-Variable Queries. (1995) (207)
- Vacuity Detection in Temporal Model Checking (1999) (205)
- Reasoning About Strategies: On the Model-Checking Problem (2011) (204)
- LTL satisfiability checking (2007) (203)
- Finite Model Theory and Its Applications (2007) (202)
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics (2002) (200)
- Optimization of real conjunctive queries (1993) (199)
- Containment of Conjunctive Regular Path Queries with Inverse (2000) (196)
- Multi-Objective Model Checking of Markov Decision Processes (2007) (194)
- Complete Axiomatizations for Reasoning about Knowledge and Time (2002) (193)
- Will MOOCs destroy academia? (2012) (191)
- The ForSpec Temporal Logic: A New Temporal Property-Specification Language (2002) (184)
- Sometimes and Not Never Re-revisited: On Branching Versus Linear Time (1998) (182)
- Logic programs as types for logic programs (1991) (180)
- On monadic NP vs. monadic co-NP (1993) (179)
- Improved upper and lower bounds for modal logics of programs (1985) (178)
- Decidable optimization problems for database logic programs (1988) (172)
- A new approach to database logic (1984) (171)
- Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning (2010) (169)
- On the expressive power of datalog: tools and a case study (1990) (168)
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable (1985) (167)
- Monotone monadic SNP and constraint satisfaction (1993) (166)
- Verification of Concurrent Programs: The Automata-Theoretic Framework (1991) (154)
- Infinitary Logics and 0-1 Laws (1992) (151)
- On the equivalence of recursive and nonrecursive datalog programs (1992) (149)
- Undecidable optimization problems for database logic programs (1993) (145)
- On Epistemic Logic and Logical Omniscience (1986) (144)
- Synthesis for LTL and LDL on Finite Traces (2015) (143)
- Knowledge-based programs (1995) (142)
- Answering regular path queries using views (2000) (141)
- A model-theoretic analysis of knowledge (1991) (141)
- Distribution-Aware Sampling and Weighted Model Counting for SAT (2014) (138)
- A Scalable Approximate Model Counter (2013) (137)
- Synthesizing Distributed Systems (2001) (136)
- Alternating Automata and Program Verification (1995) (134)
- Automata-Theoretic Approach to Planning for Temporally Extended Goals (1999) (128)
- Weak alternating automata and tree automata emptiness (1998) (127)
- Open Systems in Reactive Environments: Control and Synthesis (2000) (126)
- Learning to Solve NP-Complete Problems - A Graph Neural Network for the Decision TSP (2018) (123)
- Motion Planning with Complex Goals (2011) (123)
- What can machines know?: On the properties of knowledge in distributed systems (1992) (121)
- ACUTE DELIRIOUS STATE AFTER ϵ-AMINOCAPROIC ACID (1978) (118)
- Experimental Evaluation of Classical Automata Constructions (2005) (117)
- On the complexity of bounded-variable queries (extended abstract) (1995) (115)
- Automata-Theoretic Model Checking Revisited (2007) (113)
- A Nonstandard Approach to the Logical Omniscience Problem (1990) (111)
- Safraless Compositional Synthesis (2006) (111)
- Proving that programs eventually do something good (2007) (110)
- Formal Systems for Tuple and Equality Generating Dependencies (1984) (110)
- Synthesis from component libraries (2009) (109)
- From liveness to promptness (2007) (108)
- Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls (2016) (107)
- The Hybrid µ-Calculus (2001) (106)
- What is an algorithm? (2012) (105)
- Querying logical databases (1985) (105)
- The Complexity of Set Constraints (1993) (104)
- On the Unusual Effectiveness of Logic in Computer Science (2001) (103)
- Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach (1999) (101)
- Conferences vs. journals in computing research (2009) (98)
- Conference on Theoretical Aspects of Reasoning about Knowledge (1990) (98)
- Module Checking Revisited (1997) (98)
- Polynomial-time implication problems for unary inclusion dependencies (1990) (97)
- Falsification of LTL safety properties in hybrid systems (2009) (97)
- Reasoning on regular path queries (2003) (96)
- Globalization and offshoring of software (2009) (96)
- A Practical Approach to Coverage in Model Checking (2001) (96)
- The decision problem for the probabilities of higher-order properties (1987) (95)
- Coverage metrics for formal verification (2003) (95)
- View-based query processing and constraint satisfaction (2000) (94)
- Fixpoint logics, relational machines, and computational complexity (1992) (93)
- Strong Cyclic Planning Revisited (1999) (89)
- Modular Model Checking (1997) (89)
- An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) (1994) (89)
- On Parallel Scalable Uniform SAT Witness Generation (2015) (88)
- An Automata-Theoretic Approach to Fair Realizability and Synthesis (1995) (88)
- Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning (2007) (87)
- Freedom, weakness, and determinism: from linear-time to branching-time (1998) (86)
- Iterative temporal motion planning for hybrid systems in partially unknown environments (2013) (86)
- Synthesis with rational environments (2014) (85)
- A Scalable and Nearly Uniform Generator of SAT Witnesses (2013) (85)
- Enhanced Vacuity Detection in Linear Temporal Logic (2003) (85)
- 0-1 laws and decision problems for fragments of second-order logic (1988) (84)
- The Complexity of the Graded µ-Calculus (2002) (84)
- The logical data model (1993) (84)
- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (2000) (83)
- On the complexity of epistemic reasoning (1989) (83)
- Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series) (2005) (83)
- Fixpoint logic vs. infinitary logic in finite-model theory (1992) (82)
- Yet Another Process Logic (Preliminary Version) (1983) (82)
- Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective (2020) (82)
- Decidability and undecidability results for boundedness of linear recursive queries (1988) (82)
- Nontraditional Applications of Automata Theory (1994) (80)
- The theory of data dependencies - a survey (1984) (80)
- Is There a Best Symbolic Cycle-Detection Algorithm? (2001) (79)
- Church's Problem Revisited (1999) (79)
- View-Based Query Processing: On the Relationship Between Rewriting, Answering and Losslessness (2005) (78)
- Towards manipulation planning with temporal logic specifications (2015) (78)
- The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) (1985) (78)
- Strategy logic with imperfect information (2017) (77)
- Reasoning about Actions and Planning in LTL Action Theories (2002) (77)
- Hybrid systems: from verification to falsification by combining motion planning and discrete search (2008) (76)
- Balancing scalability and uniformity in SAT witness generator (2014) (75)
- The hierarchical approach to modeling knowledge and common knowledge (1999) (75)
- Iterative Temporal Planning in Uncertain Environments With Partial Satisfaction Guarantees (2016) (74)
- On the Complexity of Verifying Concurrent Transition Systems (1997) (74)
- A Game-Theoretic Approach to Constraint Satisfaction (2000) (72)
- Algorithmic Knowledge (1994) (71)
- Constrained Sampling and Counting: Universal Hashing Meets SAT Solving (2015) (71)
- Büchi Complementation Made Tighter (2006) (71)
- Automata theoretic techniques for modal logics of programs: (Extended abstract) (1984) (70)
- Random 3-SAT: The Plot Thickens (2000) (69)
- Symbolic Decision Procedures for QBF (2004) (68)
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic (2012) (68)
- A Note on the Reduction of Two-Way Automata to One-Way Automata (1989) (68)
- The Büchi Complementation Saga (2007) (67)
- View-based query processing for regular path queries with inverse (2000) (66)
- On ω-automata and temporal logic (1989) (66)
- Proof-tree transformation theorems and their applications (1989) (66)
- Automata: from logics to algorithms (2008) (66)
- Regular Queries on Graph Databases (2017) (65)
- Optimized temporal monitors for SystemC (2010) (65)
- Constraint Propagation as a Proof System (2004) (64)
- On computing minimal independent support and its applications to sampling and counting (2015) (64)
- The Complexity of Enriched Mu-Calculi (2008) (63)
- The Theory of Data Dependencies - An Overview (1984) (63)
- Undecidable Boundedness Problems for Datalog Programs (1995) (61)
- On Complementing Nondeterministic Büchi Automata (2003) (61)
- This Time the Robot Settles for a Cost: A Quantitative Approach to Temporal Logic Planning with Partial Satisfaction (2015) (60)
- Decidable Optimization Problems for Database Logic Programs (Preliminary Report) (1988) (60)
- Coverage metrics for temporal logic model checking* (2006) (60)
- Aggregating disparate estimates of chance (2006) (60)
- Armstrong Databases for Functional and Inclusion Dependencies (1983) (59)
- Supervisory control and reactive synthesis: a comparative introduction (2017) (58)
- Once and for all (1995) (58)
- Constraint satisfaction and database theory: a tutorial (2000) (58)
- Regular Vacuity (2005) (58)
- A Temporal Language for SystemC (2008) (57)
- BDD-based decision procedures for the modal logic K ★ (2006) (57)
- Symbolic LTLf Synthesis (2017) (57)
- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation (2003) (56)
- Extended Temporal Logic Revisited (2001) (56)
- Decidable containment of recursive queries (2003) (56)
- Treewidth in Verification: Local vs. Global (2005) (56)
- Common Knowledge Revisited (1996) (55)
- Model Checking and Transitive-Closure Logic (1997) (55)
- Motion planning with hybrid dynamics and temporal goals (2010) (55)
- From complementation to certification (2005) (54)
- An automata-theoretic approach to modular model checking (2000) (54)
- A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking (1996) (53)
- Formal Techniques for SystemC Verification; Position Paper (2007) (53)
- BDD-Based Decision Procedures for K (2002) (53)
- View-Based Query Answering and Query Containment over Semistructured Data (2001) (53)
- Verification of Fair Transition Systems (1998) (52)
- The Complexity of Enriched µ-Calculi (2006) (52)
- Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics (1997) (52)
- Bisimulation and Model Checking (1999) (52)
- On the Complexity of Parity Word Automata (2001) (51)
- From Weighted to Unweighted Model Counting (2015) (51)
- A Multi-encoding Approach for LTL Symbolic Satisfiability Checking (2011) (51)
- From linear time to branching time (2005) (50)
- From Church and Prior to PSL (2008) (50)
- µ-Calculus Synthesis (2000) (50)
- Approximate Probabilistic Inference via Word-Level Counting (2015) (49)
- On the Properties of Join Dependencies (1979) (49)
- Notions of dependency satisfaction (1982) (49)
- Lossless regular views (2002) (49)
- Query processing using views for regular path queries with inverse (2000) (48)
- Search vs. Symbolic Techniques in Satisfiability Solving (2004) (48)
- State of Büchi Complementation (2010) (48)
- Temporal property verification as a program analysis task (2011) (47)
- Büchi Complementation and Size-Change Termination (2009) (46)
- A Framework for Inherent Vacuity (2009) (46)
- A Model-Theoretic Analysis of Knowledge: Preliminary Report (1984) (46)
- On the integrity of databases with incomplete information (1985) (45)
- On the Complexity of Branching Modular Model Checking (Extended Abstract) (1995) (44)
- The implication and finite implication problems for typed template dependencies (1982) (44)
- The Complexity of Problems on Graphs Represented as OBDDs (1998) (44)
- Formal Verification of Backward Compatibility of Microcode (2005) (44)
- The Decision Problem for Database Dependencies (1981) (44)
- Random 3-SAT and BDDs: The Plot Thickens Further (2001) (43)
- Counting-Based Reliability Estimation for Power-Transmission Grids (2017) (43)
- Homomorphism closed vs. existential positive (2003) (43)
- Bma: Visual Tool for Modeling and Analyzing Biological Networks (2012) (43)
- Memory-Ecient Algorithms for the Verication of Temporal Properties (1992) (42)
- Efficient Büchi Universality Checking (2010) (42)
- Optimizing a BDD-Based Modal Solver (2003) (42)
- Safety of datalog queries over infinite databases (1989) (42)
- On the Complexity of Queries in the Logical Data Model (1988) (42)
- Pushdown module checking with imperfect information (2007) (41)
- Relating word and tree automata (1996) (41)
- Pushdown Specifications (2002) (41)
- The universal-relation data model for logical independence (1988) (41)
- Reasoning about Strategies: on the Satisfiability Problem (2016) (41)
- What is an inference rule? (1990) (40)
- Mushroom poisoning from species of genus Inocybe (fiber head mushroom): a case series with exact species identification (2009) (40)
- Predatory scholarly publishing (2012) (40)
- Unary inclusion dependencies have polynomial time inference problems (1983) (40)
- Coverage Metrics for Temporal Logic Model Checking (2001) (39)
- Semantic acyclicity on graph databases (2013) (39)
- An internal semantics for modal logic (1985) (39)
- Reasoning about Infinite Computation Paths (Extended Abstract) (1983) (39)
- Monitoring temporal SystemC properties (2010) (39)
- From Philosophical to Industrial Logics (2009) (39)
- Theory in practice for system design and verification (2015) (38)
- Verification of Fair Transisiton Systems (1996) (38)
- A New Heuristic for Bad Cycle Detection Using BDDs (1997) (38)
- View-based query containment (2003) (38)
- Fixed-Parameter Hierarchies inside PSPACE (2006) (38)
- Synthesis from knowledge-based specifications (1998) (37)
- 0-1 laws for infinitary logics (1990) (37)
- Robust Satisfaction (1999) (37)
- An Automata-Theoretic Approach to Regular XPath (2009) (37)
- Linear vs. branching time: a complexity-theoretic perspective (1998) (37)
- A Logical Approach to Constraint Satisfaction (2008) (37)
- Branching vs. Linear Time: Semantical Perspective (2007) (37)
- Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking (2005) (37)
- Vacuity detection in temporal model checking (2003) (37)
- Relating linear and branching model checking (1998) (37)
- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification (2000) (36)
- The effect of vitamin E supplementation on cardiovascular risk in diabetic individuals with different haptoglobin phenotypes. (2010) (36)
- Bisimulation Minimization and Symbolic Model Checking (2002) (36)
- On the complexity of modular model checking (1995) (36)
- Hybrid Systems: From Verification to Falsification (2007) (36)
- Automata Theory for Database Theoreticans (1991) (36)
- Deterministic Dynamic Monitors for Linear-Time Assertions (2006) (35)
- Reasoning about fair concurrent programs (1986) (35)
- On the complexity of equivalence between recursive and nonrecursive Datalog programs (1994) (35)
- Knowledge and implicit knowledge in a distributed environment (1986) (34)
- Tools for Datalog boundedness (1991) (34)
- Memoryful Branching-Time Logic (2006) (34)
- Global Model-Checking of Infinite-State Systems (2004) (33)
- BDD-Based Boolean Functional Synthesis (2016) (33)
- Complementation Constructions for Nondeterministic Automata on Infinite Words (2005) (33)
- Unifying Büchi Complementation Constructions (2013) (33)
- Automata-theoretic techniques for temporal reasoning (2007) (33)
- Resets vs. Aborts in Linear Temporal Logic (2003) (33)
- SAT-based Induction for Temporal Safety Properties (2005) (32)
- Moore's law and the sand-heap paradox (2014) (32)
- Bisimulation Minimization in an Automata-Theoretic Verification Framework (1998) (32)
- Invited talk: automata theory for database theoreticians (1989) (32)
- What is Query Rewriting? (2000) (32)
- The financial meltdown and computing (2009) (32)
- Safety and efficacy metrics for primary nitinol stenting in femoropopliteal occlusive disease: A meta‐analysis and critical examination of current methodologies (2014) (32)
- Query Processing under GLAV Mappings for Relational and Graph Databases (2012) (32)
- A Model-Theoretic Analysis of Monotonic Knowledge (1985) (32)
- Symbolic Techniques in Satisfiability Solving (2005) (31)
- The Weakness of Self-Complementation (1999) (31)
- Acute delirious state after epsilon-aminocaproic acid. (1978) (31)
- Efficient LTL compilation for SAT-based model checking (2005) (31)
- LTLf and LDLf Synthesis under Partial Observability (2016) (30)
- Profile trees for Büchi word automata, with application to determinization (2013) (30)
- LTL Satisfiability Checking Revisited (2013) (30)
- Computing with Infinitary Logic (1995) (28)
- Move fast and break things (2018) (28)
- On decomposition of relational databases (1982) (28)
- Reactive synthesis for finite tasks under resource constraints (2017) (28)
- Verification by Augmented Abstraction: The Automata-Theoretic View (2001) (28)
- The Taming of Converse: Reasoning about Two-way Computations (1985) (28)
- Temporal Synthesis for Bounded Systems and Environments (2011) (27)
- On Bounded Specifications (2001) (27)
- Model Checking Linear Properties of Prefix-Recognizable Systems (2002) (26)
- Revisiting the publication culture in computing research (2010) (26)
- Implementing Knowledge-Based Programs (1996) (26)
- Flow Games (2017) (26)
- Synthesis from Knowledge-Based Specifications (Extended Abstract) (1998) (26)
- A Symbolic Approach to Safety ltl Synthesis (2017) (26)
- 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey (2000) (26)
- Reasoning about knowledge and time in asynchronous systems (1988) (26)
- The Hybrid mu-Calculus (2001) (26)
- Projection Pushing Revisited (2004) (25)
- Artificial intelligence (2012) (24)
- ADDMC: Weighted Model Counting with Algebraic Decision Diagrams (2020) (24)
- The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies (2014) (24)
- Database Theory — ICDT '95 (1995) (24)
- The planning spectrum - one, two, three, infinity (2003) (24)
- SAT-Based Explicit LTL Reasoning (2015) (24)
- On the equivalence of logical databases (1984) (24)
- Science has only two legs (2010) (24)
- GSTE is partitioned model checking (2004) (24)
- What Can Machines Know? On the Epistemic Properties of Machines (1986) (23)
- Node Selection Query Languages for Trees (2010) (23)
- Bridging the Gap between Supervisory Control and Reactive Synthesis: Case of Full Observation and Centralized Control (2014) (23)
- Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications (2019) (23)
- Efficient Symbolic Reactive Synthesis for Finite-Horizon Tasks (2019) (22)
- Relentful strategic reasoning in alternating-time temporal logic (2010) (22)
- SAT-based Explicit LTLf Satisfiability Checking (2018) (22)
- Logical Query Optimization by Proff-Tree Transformation (1993) (22)
- An Automata-Theoretic Approach to (2009) (22)
- Dynamic Reactive Modules (2011) (22)
- Boolean satisfiability (2014) (21)
- Verification of Open Systems (1997) (21)
- On Epistemic Logic and Logical Omniscience. (1988) (21)
- On the expressive power of variable-confined logics (1996) (21)
- Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report (1988) (21)
- The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge (1992) (20)
- Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 (1997) (20)
- On the expressive power of the logical data model: prelimiary report (1985) (20)
- LTLf Satisfiability Checking (2014) (20)
- Verifying omega-Regular Properties of Markov Chains (2004) (20)
- The complexity of ordering subgoals (1988) (20)
- Lost in math? (2019) (20)
- Model Checking for Database Theoreticians (2005) (19)
- Groebner bases computation in Boolean rings for symbolic model checking (2007) (19)
- On Locally Checkable Properties (2006) (19)
- Verifying ω-regular properties of Markov chains (2004) (19)
- On the power of bounded concurrency. III. Reasoning about programs (1990) (19)
- Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning (2008) (18)
- On the complexity and axiomatizability of consistent database states (1984) (18)
- 0-1 LAWS FOR FRAGMENTS OF SECOND-ORDER LOGIC: AN OVERVIEW (1990) (18)
- Drug Target Optimization in Chronic Myeloid Leukemia Using Innovative Computational Platform (2015) (18)
- Validation of SoC firmware-hardware flows: Challenges and solution directions (2014) (18)
- The moral imperative of artificial intelligence (2016) (17)
- Alternating Re nement Relations ? ? ? (1998) (17)
- Model Checking Büchi Specifications (2007) (17)
- First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation (2019) (16)
- Modeling, Analysis, and Verification - The Formal Methods Manifesto 2010 (Dagstuhl Perspectives Workshop 10482) (2011) (16)
- LTLf Synthesis with Fairness and Stability Assumptions (2019) (16)
- Inferring multivalued dependencies from functional and join dependencies (1983) (16)
- Satisfiability Checking for Mission-Time LTL (2019) (15)
- Deep Tech Ethics: An Approach to Teaching Social Justice in Computer Science (2021) (15)
- Simplifying schema mappings (2011) (15)
- automata theory: its relevance to computer science students and course contents (2006) (15)
- Factored boolean functional synthesis (2017) (15)
- An Internal Semantics for Modal Logic: Preliminary Report (1985) (15)
- A randomized trial of human C1 inhibitor prophylaxis in children with hereditary angioedema (2019) (15)
- Regular Real Analysis (2013) (15)
- The Complexity of Integer Bound Propagation (2011) (15)
- Eliminating Incoherence from Subjective Estimates of Chance (2002) (15)
- Open Implication (2008) (15)
- What is View-Based Query Rewriting? (2000) (15)
- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees (2020) (15)
- A simple proof that connectivity of finite graphs is not first-order definable (1985) (15)
- From Verification to Synthesis (2008) (14)
- Automatic aspectization of systemC (2012) (14)
- Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, Pacific Grove, CA, USA, March 1988 (1988) (14)
- From bidirectionality to alternation (2003) (14)
- Alternating Automata: Checking Truth and Validity for Temporal Logics (1998) (14)
- On omega-Automata and Temporal Logic (Preliminary Report) (1989) (14)
- LTLf Synthesis on Probabilistic Systems (2020) (14)
- Are we having an ethical crisis in computing? (2018) (14)
- An Automata-Theoretic Approach to Infinite-State Systems (2010) (14)
- Combining the k-CNF and XOR Phase-Transitions (2016) (14)
- Formal Systems for Join Dependencies (1985) (14)
- Comparator Automata in Quantitative Verification (2018) (14)
- Principled network reliability approximation: A counting-based approach (2019) (14)
- Unified Verification Theory (1987) (14)
- Does query evaluation tractability help query containment? (2014) (13)
- Globalization and Offshoring of Software revisited (2010) (13)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (2018) (13)
- PowerQuest: Trace Driven Data Mining for Power Optimization (2007) (13)
- Model Checking Buechi Specifications (2007) (13)
- Solving Parity Games Using an Automata-Based Algorithm (2016) (13)
- A Theory of Regular Queries (2016) (13)
- A sampling-based strategy planner for nondeterministic hybrid systems (2014) (13)
- A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy (2004) (13)
- Reasoning About Strategies (2010) (13)
- Logic and Automata: A Match Made in Heaven (2003) (12)
- A call to regularity (2003) (12)
- An Analysis of Slow Convergence in Interval Propagation (2007) (12)
- Functional Synthesis via Input-Output Separation (2018) (12)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (2019) (12)
- On Hashing-Based Approaches to Approximate DNF-Counting (2017) (12)
- Fair access (2012) (12)
- What can be done about gender diversity in computing? (2015) (12)
- Trace Semantics is Fully Abstract (2009) (11)
- From visual to logical formalisms for SoC validation (2014) (11)
- Would Turing have passed the Turing Test? (2014) (11)
- Solving Partial-Information Stochastic Parity Games (2013) (11)
- The revenge of the JD (1983) (11)
- Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions (2019) (11)
- Synthesis from Probabilistic Components (2014) (11)
- On Acyclic Database Decompositions (1984) (11)
- Partitioning Techniques in LTLf Synthesis (2019) (11)
- To serve humanity (2019) (11)
- Automated Abstraction of Manipulation Domains for Cost-Based Reactive Synthesis (2019) (11)
- FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints (2019) (11)
- How the hippies destroyed the internet (2018) (11)
- Is Moore's Party over? (2011) (11)
- Academic rankings considered harmful! (2016) (11)
- Is information technology destroying the middle class? (2015) (11)
- Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking (2012) (10)
- Safety model checking with complementary approximations (2016) (10)
- A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints (2007) (10)
- Aborts vs Resets in Linear Temporal Logic (2002) (10)
- Synthesis of Trigger Properties (2010) (10)
- Computer professionals for social responsibility (2017) (10)
- On the expressive power of data dependencies (1986) (10)
- educational response to offshore outsourcing (2006) (10)
- The homomorphism problem for regular graph patterns (2017) (9)
- The moral hazard of complexity-theoretic assumptions (2016) (9)
- Query Answering Using Views for Data Integration over the Web (1999) (9)
- Network Reliability Estimation in Theory and Practice (2018) (9)
- A Model for Knowledge (2004) (9)
- Infinitary Logic for Computer Science (1992) (9)
- Synthesis from Recursive-Components Libraries (2011) (9)
- Rewriting of Regular Expressions and Regular Path (1999) (9)
- Advances in Software Engineering Techniques (2009) (9)
- From Monadic Logic to PSL (2008) (9)
- Fast LTL Satisfiability Checking by SAT Solvers (2014) (9)
- The people vs. tech (2021) (9)
- On P, NP, and computational complexity (2010) (9)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (2005) (8)
- Long-term safety outcomes of prekallikrein (Fletcher factor) deficiency: A systematic literature review of case reports. (2020) (8)
- Reactive Synthesis vs.Supervisory Control: Bridging the Gap (2013) (8)
- Efficiency vs. resilience (2020) (8)
- How we lost the women in computing (2018) (8)
- Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract) (1998) (8)
- Global decision problems for relational databases (1981) (8)
- Synthesis of Orchestrations of Transducers for Manufacturing (2018) (8)
- A Decidable Fragment of Strategy Logic (2012) (8)
- Who begat computing? (2013) (8)
- On simplification of schema mappings (2013) (8)
- Two-Stage Technique for LTLf Synthesis Under LTL Assumptions (2020) (8)
- CHIMP: A Tool for Assertion-Based Dynamic Verification of SystemC Models (2013) (8)
- Interactive presentation: PowerQuest: trace driven data mining for power optimization (2007) (8)
- SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability (2018) (8)
- The long game of research (2019) (8)
- Counting with Automata (1999) (8)
- What is View-Based Query Rewriting? (Position Paper) In Proc. of WS on Knowledge Representation Meets Databases (KRDB 2000) (2000) (8)
- Attitudes towards and practice of venous thromboembolism prevention in general internal medicine wards: a multinational survey from member countries of the European Federation of Internal Medicine. (2012) (8)
- Quantum hype and quantum skepticism (2019) (8)
- Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting (2001) (8)
- Polsat: A Portfolio LTL Satisfiability Solver (2013) (8)
- ProCount: Weighted Projected Model Counting with Graded Project-Join Trees (2021) (7)
- Understanding Boolean Function Learnability on Deep Neural Networks (2020) (7)
- Intelligate: Scalable Dynamic Invariant Learning for Power Reduction (2009) (7)
- Transactions on Data Hiding and Multimedia Security VIII (2012) (7)
- Mode-Target Games: Reactive Synthesis for Control Applications (2015) (7)
- Computer aided verification : 10th International Conference, CAV '98, Vancouver, BC, Canada, June 28-July 2, 1998 : proceedings (1998) (7)
- On lethal autonomous weapons (2015) (7)
- Cyber insecurity and cyber libertarianism (2017) (7)
- Solving Parity Games: Explicit vs Symbolic (2018) (7)
- The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas (2017) (7)
- On the Unreasonable Effectiveness of SAT Solvers (2020) (7)
- An explicit transition system construction approach to LTL satisfiability checking (2018) (7)
- Safety and Co-safety Comparator Automata for Discounted-Sum Inclusion (2019) (7)
- LTLf Synthesis under Partial Observability: From Theory to Practice (2020) (7)
- Parallel Weighted Model Counting with Tensor Networks (2020) (7)
- The Rise and Fall of LTL: Invited Presentation at the Second International Symposium on Games, Automata, Logics and Formal Verification (2011) (7)
- Reboot the computing-research publication systems (2020) (6)
- Design and Synthesis from Components (Dagstuhl Seminar 14232) (2014) (6)
- Automata vs Linear-Programming Discounted-Sum Inclusion (2018) (6)
- Symbolic Techniques in Propositional Satisfiability Solving (2009) (6)
- Finite-Horizon Synthesis for Probabilistic Manipulation Domains (2021) (6)
- Rank Predicates vs. Progress Measures in Concurrent-Program Verification (1996) (6)
- Would Turing have won the Turing award? (2017) (6)
- On Monadic NP vs. Monadic co-NP (Extended Abstract) (1993) (6)
- To boycott or not to boycott (2013) (6)
- 05241 Executive Summary - Synthesis and Planning (2005) (6)
- Formal Techniques for Networked and Distributed Sytems — FORTE 2002 (2002) (6)
- Towards an Efficient Library for SAT: a Manifesto (2001) (6)
- Automated Verification: Graphs, Logic, and Automata (2003) (6)
- Finite-Trace and Generalized-Reactivity Specifications in Temporal Synthesis (2021) (6)
- On the Power of Unambiguity in Büchi Complementation (2020) (6)
- A Space-eecient On-the--y Algorithm for Real-time Model Checking ? (1996) (6)
- Quantum-inspired Boolean states for bounding engineering network reliability assessment (2018) (6)
- On Continuous Local BDD-Based Search for Hybrid SAT Solving (2020) (5)
- Assertion-based flow monitoring of SystemC models (2014) (5)
- Model Checking as A Reachability Problem (2009) (5)
- The great robotics debate (2013) (5)
- Technology for the most effective use of mankind (2016) (5)
- An Operational Semantics for Knowledge Bases (1994) (5)
- Scalable conferences (2014) (5)
- Openism, IPism, fundamentalism, and pragmatism (2014) (5)
- A Note on Lossless Database Decompositions (1984) (5)
- Solving the unsolvable (2011) (5)
- Pattern search in hierarchical high-level designs (2004) (5)
- Divination by program committee (2017) (5)
- A note on decompositions of relational databases (1981) (5)
- Π2 ∩ Σ2 ≡ Afmc (2003) (5)
- Sequential Relational Decomposition (2018) (5)
- The executive summary, findings, and overview of a comprehensive ACM report on the offshoring of software worldwide (2006) (5)
- Endmarkers can Make a Difference (1990) (5)
- Unbounded Orchestrations of Transducers for Manufacturing (2019) (5)
- First-Order vs. Second-Order Encodings for \textsc ltl_f -to-Automata Translation (2019) (5)
- On-the-fly Synthesis for LTL over Finite Traces (2021) (5)
- Ten years at the helm of communications of the ACM (2017) (4)
- B uchi Complementation: A Forty-Year Saga (2006) (4)
- More debate, please! (2010) (4)
- Accelerating LTL satisfiability checking by SAT solvers (2018) (4)
- Bio Model Analyzer: Visual Tool for Modeling and Analysis of Biological Networks (2012) (4)
- On the Hardness of Probabilistic Inference Relaxations (2019) (4)
- Synthesizing Probabilistic Composers (2012) (4)
- CACM: past, present, and future (2008) (4)
- The Siren Song of Temporal Synthesis (Invited Talk) (2018) (4)
- Controller Synthesis for Mode-Target Games (2015) (4)
- Micro-macro stack systems: a new frontier of elementary decidability for sequential systems (2003) (4)
- Reminiscences on influential papers (2005) (4)
- The Equivalence of Universal Relation Definitions. (1982) (4)
- Incentivizing quality and impact in computing research (2015) (4)
- Property-Driven Partitioning for Abstraction Refinement (2007) (4)
- On the Power of Automata Minimization in Temporal Synthesis (2020) (4)
- Fumbling the future (2011) (4)
- A Multi-layered Synergistic Approach to Motion Planning with Complex Goals (2011) (4)
- Labor Division with Movable Walls: Composing Executable Specifications with Machine Learning and Search (Blue Sky Idea) (2019) (4)
- Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452) (2013) (4)
- Deeper Bound in BMC by Combining Constant Propagation and Abstraction (2007) (4)
- FPRAS Approximation of the Matrix Permanent in Practice (2020) (4)
- "Where do you come from? and where are you going?" (2008) (4)
- The accuracy of clinical prediction of prognosis for patients admitted with sepsis to internal medicine departments (2015) (4)
- Quantum-Inspired Perfect Matching under Vertex-Color Constraints (2022) (3)
- The end of the American network (2013) (3)
- Fair Equivalence Relations (2000) (3)
- Assume-Guarantee Synthesis for Prompt Linear Temporal Logic (2020) (3)
- Efficacy, pharmacokinetics, and safety of icatibant for the treatment of Japanese patients with an acute attack of hereditary angioedema: A phase 3 open-label study. (2020) (3)
- ACM, ethics, and corporate behavior (2022) (3)
- Explicit or symbolic translation of linear temporal logic to automata (2012) (3)
- Proceedings of the 10th International Conference on Computer Aided Verification (1998) (3)
- Hypercriticality (2010) (3)
- Computing for humans (2011) (3)
- Dynamic assertion-based verification for systemc (2010) (3)
- Reasoning about Knowledge: A Response by the Authors (1997) (3)
- Computer-Aided Personalized Education (2020) (3)
- Publish and perish (2019) (3)
- π 2 ∩ Σ 2 ≡ AFMC (2003) (3)
- DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving (2022) (3)
- View Synthesis from Schema Mappings (2010) (3)
- Rewriting Regular Expressions in Semi-Structured Data To appear in ICDT ’ 99 WS on Query Processing for SSD and Non-standard Data Formats (1999) (3)
- Advancing computing as a science and profession (2020) (3)
- Are we headed toward another global tech bust? (2016) (3)
- On Satisficing in Quantitative Games (2021) (3)
- Open, closed, or clopen access? (2009) (3)
- C1 INHIBITOR ADMINISTRATION IN PEDIATRIC PATIENTS WITH HEREDITARY ANGIOEDEMA: PATIENT COMPLIANCE WITH INTRAVENOUS THERAPY (2018) (3)
- In memory of Seymour Ginsburg 1928 - 2004 (2005) (3)
- What do we do when the jobs are gone, and why we must embrace active learning (2015) (3)
- Two Variables and Unary Temporal Logic (1997) (3)
- Confidentiality-Preserving Query Execution of Fragmented Outsourced Data (2018) (3)
- Risk Assessment to Predict Arterial and Venous Events in Patients Undergoing Percutaneous Coronary Intervention (2014) (3)
- Modeling, Analysis, and Verification: The Formal Methods Manifesto 2010 (2011) (3)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (2018) (3)
- What should be done about social media? (2020) (3)
- Intelligate: An Algorithm for Learning Boolean Functions for Dynamic Power Reduction (2009) (2)
- The rise and fall of industrial research labs (2014) (2)
- The Complexity of Synthesis from Probabilistic Components (2015) (2)
- In memoriam Paris C. Kanellakis (1996) (2)
- Database Research: Lead, Follow, or Get Out of the Way? - Panel Abstract (1996) (2)
- Panel: logic in the computer science curriculum (1998) (2)
- Program verification (2021) (2)
- Adapting Behaviors via Reactive Synthesis (2021) (2)
- Where have all the workshops gone? (2011) (2)
- Nash Equilibria in Finite-Horizon Multiagent Concurrent Games (2021) (2)
- The Only Way Is Up (2011) (2)
- Why doesn't ACM have a SIG for theoretical computer science? (2015) (2)
- On Uniformly Sampling Traces of a Transition System (2020) (2)
- A Rice University perspective on software engineering licensing (2002) (2)
- Will AI destroy education? (2021) (2)
- Computational Model Theory: An Overview (1998) (2)
- Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints (2023) (2)
- 0-1 Laws for Infinitary Logics (Preliminary Report) (1990) (2)
- Survey Results Show Better Balance in Supply and Demand (2003) (2)
- Humans, machines, and the future of work (2015) (2)
- An Automata-Theoretic Approach to Protocol Verification (Abstract) (1988) (2)
- Protocols and Programs (2004) (2)
- Is the image crisis over? (2009) (2)
- A computational lens on economics (2020) (2)
- Are you talking to me? (2011) (2)
- Temporal property verification as a program analysis task (2012) (2)
- Efficiency vs. Resilience: Lessons from COVID-19 (2021) (2)
- The winner-takes-all tech corporation (2019) (2)
- Model Checking: A Complexity-Theoretic Perspective (invited talk) (2002) (2)
- Runtime Verification on FPGAs with LTLf Specifications (2020) (2)
- Intersection and Rotation of Assumption Literals Boosts Bug-Finding (2019) (2)
- Has the innovation cup run dry? (2013) (1)
- The Only Way is Up On A Tower of Abstractions for Biology (2012) (1)
- CORE EQUIVALENCE IN ECONOMY UNDER AWARENESS (2006) (1)
- Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition (2022) (1)
- Experimental Evaluation of Explicit and Symbolic Automata-Theoretic Algorithms (1)
- War and tech (and ACM) (2022) (1)
- The Phase Transition in the Random HornSAT Problem (2006) (1)
- Fricative computing (2013) (1)
- ACM's open-conference principle and political reality (2017) (1)
- Open access and ACM (2018) (1)
- F eb 2 01 5 The Complexity of Synthesis from Probabilistic Components ∗ (2015) (1)
- Synthesis with rational environments (2016) (1)
- "Yes, it can be done" (2009) (1)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (2021) (1)
- Abstract 10487: Vitamin E Supplementation is Associated With Increased Cardiovascular Disease and Mortality in Individuals With the Hp 2-1 Genotype and Diabetes (2010) (1)
- Safety, efficacy, and pharmacokinetics of intravenous C1 esterase inhibitor (human) prophylaxis in children with hereditary angioedema (HAE): 123 (2019) (1)
- Full presentation : Reasoning about machine ethics (2013) (1)
- Database Logic Programming, Deductive Databases, and Expert Database Systems (1988) (1)
- Automated Verification = Graphs, Automata, and Logic (2000) (1)
- ADDMC: Weighted Model Counting with Algebraic Decision Diagrams (2019) (1)
- Smart Robots and Their Impact on Employment (2016) (1)
- Symbolic Techniques in Satisfiability Solving j (1)
- The ritual of academic-unit review (2016) (1)
- Containment of Conjun tive Regular Path Queries with Inverse To appear in Pro eedings of KR 2000 (2000) (1)
- A logical revolution (keynote) (2013) (1)
- Why ACM? (2012) (1)
- On the Complexity of Queries in the Logical Data Model (Extended Abstract) (1988) (1)
- Database Logic Programming (1991) (1)
- The phase transition in the random 1-3-HornSAT problem (2004) (1)
- Where have all the domestic graduate students gone? (2020) (1)
- The sand-heap paradox of privacy and influence (2021) (1)
- Approximate Model Counting (2021) (1)
- What is a flagship publication? (2013) (1)
- Regular Open APIs (2016) (1)
- Completeness and Complexity (2004) (1)
- Too Much Debate? Author's reply (2010) (1)
- Branching-time reasoning for infinite-state systems (2010) (1)
- Special selection in logic in computer science (1997) (1)
- Technology has social consequences (2011) (1)
- From Löwenheim to PSL and SVA (2014) (1)
- Let us---together---make CACM exciting (2008) (1)
- Proceedings 1st International Workshop on Strategic Reasoning: Preface (2013) (1)
- 2010 CAV award announcement (2012) (1)
- Logic for Programming, Artificial Intelligence, and Reasoning: 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings (2003) (1)
- A declaration of the dependence of cyberspace (2018) (1)
- Query Containment Using Views (2003) (1)
- Globalization, computing, and their political impact (2016) (1)
- Response to the letter to the Editor (1983) (1)
- Program Verification: a 70+- Year History (2021) (1)
- Hierarchical Strategic Reasoning (2017) (1)
- State of Büchi Complementation ( Full Version ) ? (2010) (1)
- ECONOMIC CONSIDERATIONS WITH REGARD TO PORT CONGESTION SURCHARGES (1973) (1)
- Linear-Time Model Checking: Automata Theory in Practice (2007) (1)
- 4th International Workshop on Strategic Reasoning (SR 2016) (2018) (0)
- The Challenges of Regulating Technology and the Role of Think Tanks in Informing Sound Tech Policy (2021) (0)
- Undecidable Boundedness Problem for Datalog (1992) (0)
- Self-reference and section 230 (2018) (0)
- From automated verification to automated design ( Invited Talk Abstract ) (2010) (0)
- Editorial Board (2004) (0)
- Phase transitions and computational complexity (2014) (0)
- Çôò Ëý×øøñ× Ò Êêê Blockinøøú Òúúöóòññòø×× (2000) (0)
- Dedicated to the memory of Harald Ganzinger (2004) (0)
- What is an inferen e rule ? (1992) (0)
- Constraints, Graphs, Algebra, Logic, and Complexity (2009) (0)
- TCT-204 Comparable Outcomes despite Differences in Patient Representation between Premarket and Postmarket coronary Intervention Studies: Findings from the ENDEAVOR and PROTECT Programs (2013) (0)
- בעיית הגרירה לתלויות בין נתונים במסדי נתונים יחסיים (The implication problem for data dependencies in relational databases.) (1981) (0)
- Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings (2002) (0)
- Quantitative Policies over Streaming Data (2016) (0)
- Towards an EÆ ient Library for SAT : a ManifestoEnri (2008) (0)
- Chess fans remember many dramatic chess matches in the 20 th century . I recall being transfixed by the 1972 interminable match between challenger Bobby Fischer and artificial intelligence : Past and future (2012) (0)
- L O ] 2 4 Ju l 2 01 3 Synthesis from Knowledge-Based Specifications ⋆ (2014) (0)
- Proceedings of the 5th International Conference on Database Theory (1995) (0)
- Common knowledge revisited 5 (2003) (0)
- The agency trilemma and ACM (2021) (0)
- Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk) (2011) (0)
- Special issue on SR 2013 (2015) (0)
- Public and Private Affairs in Strategic Reasoning (2022) (0)
- Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California, USA (1987) (0)
- Abstract 11821: HDL-Induced Cholesterol Efflux Capacity From Niacin Therapy in Diabetes is Haptoglobin Genotype-Dependent (2014) (0)
- Ambient Intelligence (2004) (0)
- Åóð Òò Óó Ëëëëøý Èöóôöøøø× (2017) (0)
- ACM for the Public Good (2023) (0)
- Games Programs Play : Analyzing Multiplayer Programs [ Extended Version ] (2016) (0)
- Veri fi cation of Open Systems (2016) (0)
- PODS Alberto O. Mendelzon Test-of-Time Award 2008 (2008) (0)
- Branching vs . Linear Time : Semantical Perspective Version 1 . 1 ? (2007) (0)
- Π2 n Σ2 ≡ AFMC (2003) (0)
- Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, California, USA (1992) (0)
- TCT-548 Variability in Analysis of Freedom from Primary Patency from Trials Assessing Stent Implantation in the Superficial Femoral Artery. (2013) (0)
- Technology and democracy (2022) (0)
- PODS 30th Anniversary Colloquium (2011) (0)
- DPSampler: Exact Weighted Sampling Using Dynamic Programming (2022) (0)
- An association of the members, by the members, for the members (2022) (0)
- Optimized temporal monitors for SystemC (2012) (0)
- Decision Problems for Data Dependencies (1980) (0)
- Ising Model Partition Function Computation as a Weighted Counting Problem (2022) (0)
- Complexity and structural heuristics for propositional and quantified satisfiability (2007) (0)
- Viewpoints on "Logic activities in Europe", twenty years later (2016) (0)
- Pi 2 cap Sigma 2 equiv AFMC. (2003) (0)
- 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures (2007) (0)
- Branching-time reasoning for programs (extended version) (2011) (0)
- Iowa State University From the SelectedWorks of Kristin Yvonne Rozier May , 2010 LTL satisfiability checking (2017) (0)
- 2011 CAV award announcement (2012) (0)
- Knowledge and Computation (2004) (0)
- Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems (2002) (0)
- Logical Algorithmics: From Theory to Practice (Invited Talk) (2023) (0)
- Proceedings of the 4th International Workshop on Strategic Reasoning: Preface (2016) (0)
- Preface to the Special Issue on SR 2014 (2017) (0)
- Á× Ìììöö ×ø Ëýñóðð Ý Blockinðð¹¹¹øø Blockinøøóò (2001) (0)
- Rewriting of Regular Path Queries (1999) (0)
- Accountability and liability in computing (2022) (0)
- 2017 ACM PODS Alberto O. Mendelzon Test-of-Time Award (2017) (0)
- 2014 CAV award announcement (2016) (0)
- From Automated Verification to Automated Design (2010) (0)
- Panel on "Past and Future of Computer Science Theory" (Discussion Paper) (2021) (0)
- Proceedings 1st International Workshop on Strategic Reasoning (2013) (0)
- Compositional Temporal Synthesis (2012) (0)
- Ëóóøûöö Ìóóð× Óö Ì Blockinòóðóóý Ìööò×××ö Ññòù× Blockinööôø Aeóº´ûûðð (2007) (0)
- In Memoriam: Paris C. Kanellakis (1953-1995) (1996) (0)
- 05241 Abstracts Collection - Synthesis and Planning (2005) (0)
- List of presentations (2019) (0)
- A publication culture in software engineering (panel) (2013) (0)
- Query Containment Using Views ( extended abstract ) ? (0)
- The Strategy Logic Saga (2012) (0)
- Algorithmic-Logical Theory of In nite Structures Dagstuhl Seminar (2008) (0)
- Äó××ðð×× Êêêùððö Îîîû× (2007) (0)
- Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007 (2008) (0)
- D B ] 1 4 N ov 2 01 8 FIXPOINT NODE SELECTION QUERY LANGUAGES FOR TREES (2018) (0)
- Ììì Àýýööö ¹¹¹ð Blockinùðù× (2007) (0)
- ¥ ¾ ¦ ¾ Å (2007) (0)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (2019) (0)
- Satisfiability checking for Mission-time LTL (MLTL) (2022) (0)
- Random Models for Evaluating Efficient Büchi Universality Checking (2017) (0)
- N ov 2 01 5 Approximate Probabilistic Inference via Word-Level Counting ( Extended Abstract ) ∗ † (2015) (0)
- Undecidable Boundedness Problem For Datalog Program (1992) (0)
- Abstracted Power and Responsibility in Computer Science Ethics Education (2023) (0)
- Don't Ignore Security Offshore, or in the Cloud. Authors' replies (2010) (0)
- Ðð Óòøøøòññòø Óó Êê Blockinùö××ú Éùùööö× (2009) (0)
- 0-1 Laws and Decision Probleiiis for Fragments Second-Order Logic (1988) (0)
- On !-Automata and Temporal Logi Preliminary Report (2017) (0)
- Éùùöý Ò×ûööòò Í××òò Îîîû× Óö Øø Áòøøøööøøóò Óúö Øøø Ï Áò Èöó Blockinº Óó ¾òò Áòøº Ïóöö××óô Óò Øøø Ï Òò Øøøø×××´ï³³³µ (2007) (0)
- In Memoriam: Paris C. Kanellakis (2003) (0)
- Strong Cyclic Planning (2007) (0)
- LOW EJECTION FRACTION: COMMON LINK BETWEEN ARTERIAL AND VENOUS EVENTS IN PATIENTS UNDERGOING PCI (2013) (0)
- On Symbolic Approaches for Computing the Matrix Permanent (2019) (0)
- Coverage Metri s for Temporal Logi Model (2002) (0)
- Who Is Responsible Around Here? (2023) (0)
- Behind the Scenes of Building a Scalable Approximate Model Counter (Draft Version) (2019) (0)
- Approximate Reachability (2016) (0)
- Database theory -- ICDT '95 : 5th International Conference, Prague, Czech Republic, January 11-13, 1995 : proceedings (1995) (0)
- [Massive hemorrhage from an intestinal arteriovenous aneurysm]. (1972) (0)
- Explorer Multi-Objective Model Checking of Markov Decision Processes (2007) (0)
- Knowledge in Multi-Agent Systems (2004) (0)
- A wledge: Freli~~na~ (1984) (0)
- Counting with AutomataOrna KupfermanHebrew (1999) (0)
- In memoriam: Paris C. Kanellakis (1996) (0)
- Knowledge-Based Programming (2004) (0)
- Common Knowledge and Agreement (2004) (0)
- Amir Pnueli Memorial (2010) (0)
- Synthesis and Planning, 12.-17. June 2005 (2006) (0)
- The 2008 CAV Award citation (2009) (0)
- Dagstuhl Workshop on Finite Model Theory, Databases, and Computer Aided Verification (2008) (0)
- Veri cation by Augmented Abstraction : TheAutomata-Theoretic View (2001) (0)
- Alonzo Church Award 2016 - Call for Nominations (2016) (0)
- Symbolic LTL f Synthesis Shufang Zhu East China Normal University (2017) (0)
- Proceedings of the 4th International Workshop on Strategic Reasoning (2016) (0)
- 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures (2007) (0)
- The Hybrid-Cal ulus (2019) (0)
- How Not to Win a Tech War (2022) (0)
- Symbolic LTL Compilation for Model Checking: Extended Abstract (2007) (0)
- De idable Containment of Re ursive (2003) (0)
- Proceedings 37th International Conference on Logic Programming (Technical Communications) (2021) (0)
- Global Optimization Problems for Database Logic Programs (1990) (0)
- A responce to "A complete axiomatisation for full join dependencies in relations" (1985) (0)
- Proving that systems code eventually does something good (2006) (0)
- Second-Order Dependency Theory (1983) (0)
- Fixpoint Node Selection Query Languages for Trees (2015) (0)
- Automata Linear Dynamic Logic on Finite Traces (2021) (0)
- 2009 CAV award announcement (2010) (0)
- Erratum to “Pharmacogenomic interaction between the Haptoglobin genotype and vitamin E on atherosclerotic plaque progression and stability” [Atherosclerosis 239/1 (March 2015) 232–239] (2015) (0)
- Multi-Agent Systems with Quantitative Satisficing Goals (2023) (0)
- The paradox of choice in computing-research conferences (2021) (0)
- Synthesis and Planning (2006) (0)
- A Weighted Model Counting Approach for Critical Infrastructure Reliability (2019) (0)
This paper list is powered by the following services:
Other Resources About Moshe Vardi
What Schools Are Affiliated With Moshe Vardi?
Moshe Vardi is affiliated with the following schools: