Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Reasoning about knowledge and time in asynchronous systems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of verification
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
Formal Methods in System Design
Systematic design of program transformation frameworks by abstract interpretation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model Checking of Safety Properties
Formal Methods in System Design
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Weak Muller Acceptance Conditions for Tree Automata
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Automata-Theoretic Decision of Timed Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Improving the Encoding of LTL Model Checking into SAT
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Vacuity Detection in Temporal Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Inference of omega-Languages from Prefixes
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Constraint-Based Analysis of Broadcast Protocols
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
The Inverse Method Implements the Automata Approach for Modal Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Finite automata on timed ω-trees
Theoretical Computer Science
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Reasoning in expressive description logics
Handbook of automated reasoning
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Partial-Order Methods for Model Checking: From Linear Time to Branching Time
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Modal Mu-Calculus for Durational Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
The description logic handbook
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Combining interval-based temporal reasoning with general TBoxes
Artificial Intelligence
Inference of W-languages from prefixes
Theoretical Computer Science - Special issue: Algorithmic learning theory
From tableaux to automata for description logics
Fundamenta Informaticae
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Büchi automata and their degrees of nondeterminism and ambiguity
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Distributed breadth-first search LTL model checking
Formal Methods in System Design
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Relative Nondeterministic Information Logic is EXPTIME-complete
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
Groebner bases computation in Boolean rings for symbolic model checking
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Verification of well-formed communicating recursive state machines
Theoretical Computer Science
Verification of scope-dependent hierarchical state machines
Information and Computation
Automata can show PSpace results for description logics
Information and Computation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
ACM Computing Surveys (CSUR)
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Program Complexity in Hierarchical Module Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
LTL Generalized Model Checking Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
ACM Computing Surveys (CSUR)
A Refined Resolution Calculus for CTL
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Decidable reasoning in terminological knowledge representation systems
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Abductive matchmaking using description logics
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Interval-based temporal reasoning with general TBoxes
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Groebner bases computation in Boolean rings for symbolic model checking
MS '07 The 18th IASTED International Conference on Modelling and Simulation
Graded-CTL: Satisfiability and Symbolic Model Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Handling Liveness Properties in (ω-)Regular Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Logic and automata: a match made in heaven
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Hierarchical and recursive state machines with context-dependent properties
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Resets vs. aborts in linear temporal logic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Efficient model checking of safety properties
SPIN'03 Proceedings of the 10th international conference on Model checking software
A light-weight algorithm for model checking with symmetry reduction and weak fairness
SPIN'03 Proceedings of the 10th international conference on Model checking software
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Formal Methods in System Design
One-pass tableaux for computation tree logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Logic-based knowledge representation
Artificial intelligence today
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Program equivalence checking by two-tape automata
Cybernetics and Systems Analysis
Connection based strategies for deciding propositional temporal logic
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
An automata-theoretic approach to infinite-state systems
Time for verification
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Graded computation tree logic with binary coding
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Synthesis of trigger properties
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Relentful strategic reasoning in alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
The quest for a tight translation of büchi to co-büchi automata
Fields of logic and computation
Logics for two fragments beyond the syllogistic boundary
Fields of logic and computation
Generalized satisfiability for the description logic ALC
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Propositional dynamic logic with recursive programs
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Comparative similarity, tree automata, and diophantine equations
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about Co-Büchi tree automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A note on on-the-fly verification algorithms
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Complexity of subtype satisfiability over posets
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Verification of well-formed communicating recursive state machines
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
PDL with intersection and converse is decidable
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Journal of Computer and System Sciences
BDD-Based hardware verification
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Optimal and cut-free tableaux for propositional dynamic logic with converse
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
ACM Transactions on Computational Logic (TOCL)
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Automata-Based computation of temporal equilibrium models
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Relative Nondeterministic Information Logic is EXPTIME-complete
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
From Tableaux to Automata for Description Logics
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Tightening the exchange rates between automata
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the complexity of reasoning about dynamic policies
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Model checking systems and specifications with parameterized atomic propositions
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Propositional temporal proving with reductions to a SAT problem
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
Generalized satisfiability for the description logic ALC
Theoretical Computer Science
Automata-theoretic decision of timed games
Theoretical Computer Science
Using SPIN for automated debugging of infinite executions of Java programs
Journal of Systems and Software
| Hi-index | 0.01 |