The benefits of relaxing punctuality
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Algebras for querying text regions (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Interaction as a basis for empirical computer science
ACM Computing Surveys (CSUR)
Sequential synthesis using S1S
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Reductions for learning via queries
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Learning branches and learning to win closed games
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Hardware synthesis from requirement specifications
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
Automatic verification of pointer programs using monadic second-order logic
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Relative liveness and behavior abstraction (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Relative Liveness: From Intuition to Automated Verification
Formal Methods in System Design
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Software engineering education: Rôles of formal specification and design calculi
Annals of Software Engineering - Special issue on software engineering education
Existential second-order logic over strings
Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hardware/software synthesis of formal specifications in codesign of embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
Formal Methods in System Design
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Formal specification in VHDL for hardware verification
Proceedings of the conference on Design, automation and test in Europe
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Constraints in computational logics
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
ACM SIGMOD Record
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Internet Technology (TOIT)
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
Finite variability interpretation of monadic logic of order
Theoretical Computer Science
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
A unified language processing methodology
Theoretical Computer Science
Reduction and Quantifier Elimination Techniques for Program Validation
Formal Methods in System Design
Alternating-time temporal logic
Journal of the ACM (JACM)
Markov decision processes and deterministic Büchi automata
Fundamenta Informaticae
A Methodological View of Constraint Solving
Constraints
Formal Verification of a Partial-Order Reduction Technique for Model Checking
Journal of Automated Reasoning
Timing Diagrams: Formalization and Algorithmic Verification
Journal of Logic, Language and Information
Generating Model Checkers from Algebraic Specifications
Formal Methods in System Design
Complexity of weak acceptance conditions in tree automata
Information Processing Letters
A Formal Security Model for Microprocessor Hardware
IEEE Transactions on Software Engineering
The monadic theory of morphic infinite words and generalizations
Information and Computation
Determinization of transducers over finite and infinite words
Theoretical Computer Science
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
Compile-Time Debugging of C Programs Working on Trees
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Directional Type Checking for Logic Programs: Beyond Discriminative Types
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Learning of Regular Bi-omega Languages
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Unification in a Description Logic with Transitive Closure of Roles
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Model Checking and Higher-Order Recursion
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On the Structure of the Monadic Logic of the Binary Tree
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The Monadic Theory of Morphic Infinite Words and Generalizations
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Bilinear Functions and Trees over the (max, +) Semiring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Compiling process algebraic specifications into timed automata
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Faster Model Checking for Open Systems
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
On Model Checking Synchronised Hardware Circuits
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Visual Abstractions for Temporal Verification
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
B2M: A Semantic Based Tool for BLIF Hardware Descriptions
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
On Deciding if Deterministic Rabin Language Is in Büchi Class
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Determinization of Transducers over Infinite Words
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Abstracting WS1S Systems to Verify Parameterized Networks
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
FMona: A Tool for Expressing Validation Techniques over Infinite State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Symbolic Model Checking for Rectangular Hybrid Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Weak Alternating Automata in Isabelle/HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Experiments with Finite Tree Automata in Coq
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Further Step towards a Theory of Regular MSC Languages
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness
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
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Unifying Approach to Data-Independence
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Decidable Class of Asynchronous Distributed Controllers
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Yet another Look at the LTL Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Verifying Universal Properties of Parameterized Networks
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Logical Characterisation of Event Recording Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A Decidable Dense Branching-Time Temporal Logic
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
An Automata-Theoretic Approach to Constraint LTL
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Local Normal Forms for Logics over Traces
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Towards a Computer-Aided Design of Reactive Systems
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Do We Need Liveness? - Approximation of Liveness Properties by Safety Properties
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Model-Checking: A Tutorial Introduction
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
On the Power of Interactive Computing
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Dominance Constraints with Set Operators
CL '00 Proceedings of the First International Conference on Computational Logic
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
A Formal Security Model for Microprocessor Hardware
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Verification of Parameterized Systems by Dynamic Induction on Diagrams
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Inference of omega-Languages from Prefixes
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Second-Order Logic over Strings: Regular and Non-regular Fragments
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Optimal Complexity Bounds for Positive LTL Games
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A Logic of Probability with Decidable Model-Checking
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Kleene Theorems for Event-Clock Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Scenario-Based Monitoring and Testing of Real-Time UML Models
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
Regular Event Structures and Finite Petri Nets: A Conjecture
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
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
Model checking: a tutorial overview
Modeling and verification of parallel processes
Regular event structures and finite Petri nets: a conjecture
Formal and natural computing
Finite automata on timed ω-trees
Theoretical Computer Science
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Theoretical Computer Science - Latin American theoretical informatics
Set constraints with intersection
Information and Computation - Special issue: LICS'97
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Handbook of automated reasoning
Fundamental study: a hierarchy of deterministic context-free ω-languages
Theoretical Computer Science
Borel hierarchy and omega context free languages
Theoretical Computer Science
On omega context free languages which are Borel sets of infinite rank
Theoretical Computer Science
Relative liveness: from intuition to automated verification
ASYNC '95 Proceedings of the 2nd Working Conference on Asynchronous Design Methodologies
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Decision Procedure for Term Algebras with Queues
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The Role of Decidability in First Order Separations over Classes of Finite Structures
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Formal Verification of Digital Systems
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Feature specification and automated conflict detection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Ambiguity in omega context free languages
Theoretical Computer Science
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
On temporal logic versus datalog
Theoretical Computer Science - Logic and complexity in computer science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
Architectural bias in recurrent neural networks: fractal analysis
Neural Computation
Weighted finite automata and metrics in cantor space
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Journal of Automata, Languages and Combinatorics
Automata logics, and infinite games
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Information and Computation - TACS 2001
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Regular sets of infinite message sequence charts
Information and Computation
A topological characterization of random sequences
Information Processing Letters
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
Checking Finite Traces Using Alternating Automata
Formal Methods in System Design
Inference of W-languages from prefixes
Theoretical Computer Science - Special issue: Algorithmic learning theory
Past pushdown timed automata and safety verification
Theoretical Computer Science - Implementation and application automata
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Temporalized logics and automata for time granularity
Theory and Practice of Logic Programming
Asynchronous circuits, communicating processes, and muller automaton
Fundamenta Informaticae
Keeping track of the latest gossip in a distributed system
Distributed Computing
Well-quasi-orders and regular ω-languages
Theoretical Computer Science - Words, languages and combinatorics
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Improved on-the-fly verification with testers
Nordic Journal of Computing
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Encyclopedia of Computer Science
Code aware resource management
Proceedings of the 5th ACM international conference on Embedded software
Learning via finitely many queries
Annals of Mathematics and Artificial Intelligence
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
Topologies for the set of disjunctive ω-words
Acta Cybernetica
Quasi-star-free languages on infinite words
Acta Cybernetica
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
A theory of regular MSC languages
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
A verification methodology for concurrent software with synchronous communication
Formal methods and models for system design
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science
Observations on determinization of Büchi automata
Theoretical Computer Science - Implementation and application of automata
Transformations of Timed Cooperating Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Journal of Computer and System Sciences
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
A power-set construction for reducing Büchi automata to non-determinism degree two
Information Processing Letters
Revising Type-2 Computation and Degrees of Discontinuity
Electronic Notes in Theoretical Computer Science (ENTCS)
An automata-theoretic approach to constraint LTL
Information and Computation
On decidability properties of local sentences
Theoretical Computer Science - Logic, language, information and computation
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
Specifying and analyzing security automata using CSP-OZ
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Bounded model checking of infinite state systems
Formal Methods in System Design
Classifying regular languages by a split game
Theoretical Computer Science
Skew and infinitary formal power series
Theoretical Computer Science
Alternating two-way AC-tree automata
Information and Computation
Finite automata encoding geometric figures
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
A complete characterization of deterministic regular liveness properties
Theoretical Computer Science
Predicate abstraction with indexed predicates
ACM Transactions on Computational Logic (TOCL)
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the length of the Wadge hierarchy of ω-context-free languages
Journal of Automata, Languages and Combinatorics
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Verification of well-formed communicating recursive state machines
Theoretical Computer Science
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Commitment Monitoring in a Multiagent System
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Model Checking: From Tools to Theory
25 Years of Model Checking
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
How We Think of Computing Today
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Recasting Constraint Automata into Büchi Automata
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A Theory of Bounded Fair Scheduling
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
On Bifix Systems and Generalizations
Language and Automata Theory and Applications
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
RTComposer: a framework for real-time components with scheduling interfaces
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Don't care words with an application to the automata-based approach for real addition
Formal Methods in System Design
Practical Efficient Modular Linear-Time Model-Checking
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
The Compositional Method and Regular Reachability
Electronic Notes in Theoretical Computer Science (ENTCS)
Adding nesting structure to words
Journal of the ACM (JACM)
An Automata-Based Monitoring Technique for Commitment-Based Multi-Agent Systems
Coordination, Organizations, Institutions and Norms in Agent Systems IV
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Theoretical Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Decidability of Conjugacy of Tree-Shifts of Finite Type
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Information and Computation
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Context-Free Languages of Countable Words
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Automata theory for reasoning about actions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Formalizing communication protocols for multiagent systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Decision problems for Turing machines
Information Processing Letters
Bidirectional answer set programs with function symbols
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
A Decidable Probability Logic for Timed Probabilistic Systems
Fundamenta Informaticae
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Enforcing Concurrent Temporal Behaviors
Electronic Notes in Theoretical Computer Science (ENTCS)
On Decidability Properties of Local Sentences
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying a UMTS Protocol Using Spin and EASN
Electronic Notes in Theoretical Computer Science (ENTCS)
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy Sets and Systems
A theory of regular MSC languages
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
Stream schema: providing and exploiting static metadata for data stream processing
Proceedings of the 13th International Conference on Extending Database Technology
On the completeness of compositional reasoning methods
ACM Transactions on Computational Logic (TOCL)
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Verification of probabilistic systems with faulty communication
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Compositional circular assume-guarantee rules cannot be sound and complete
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
On the structure of inductive reasoning: circular and tree-shaped proofs in the µ-calculus
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Tiling systems over infinite pictures and their acceptance conditions
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On enumeration of Müller automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Model checking and testing combined
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Abstract interpretation of programs as Markov decision processes
SAS'03 Proceedings of the 10th international conference on Static analysis
Automata based interfaces for control and scheduling
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Reduced languages as ω-generators
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Fine hierarchy of regular aperiodic ω-languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Recognizable tree series with discounting
Acta Cybernetica
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On the expressive power of QLTL
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Mechanizing the powerset construction for restricted classes of ω-automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On infinitary rational relations and Borel sets
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Non-standard inferences in description logics
Non-standard inferences in description logics
Generation of efficient programs for solving maximum multi-marking problems
SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
On verifying fault tolerance of distributed protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
What else is decidable about integer arrays?
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
From norms to interaction patterns: deriving protocols for agent institutions
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Services as a paradigm of computation
Formal methods and hybrid real-time systems
On the Borel Complexity of MSO Definable Sets of Branches
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Model checking firewall policy configurations
POLICY'09 Proceedings of the 10th IEEE international conference on Policies for distributed systems and networks
Formal analysis of design process dynamics
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
Automata for Epistemic Temporal Logic with Synchronous Communication
Journal of Logic, Language and Information
Journal of Logic, Language and Information
A proposal for real-time interfaces in SPEEDS
Proceedings of the Conference on Design, Automation and Test in Europe
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On Müller context-free grammars
DLT'10 Proceedings of the 14th international conference on Developments in language theory
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
The isomorphism problem for ω-automatic trees
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Situation calculus on a dense flow of time
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Nevertrace claims for model checking
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Theoretical Computer Science
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
Complexity of fairness constraints for the Dolev-Yao attacker model
Proceedings of the 2011 ACM Symposium on Applied Computing
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Generalized rabin(1) synthesis with applications to robust system synthesis
NFM'11 Proceedings of the Third international conference on NASA Formal methods
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Church synthesis problem for noisy input
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Impact of XML Schema Evolution
ACM Transactions on Internet Technology (TOIT)
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
MSO logics for weighted timed automata
Formal Methods in System Design
Büchi automata for modeling component connectors
Software and Systems Modeling (SoSyM)
Communications of the ACM
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Max and sum semantics for alternating weighted automata
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
On locally checkable properties
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the accepting power of 2-tape büchi automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
First-order and counting theories of ω-automatic structures
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
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
Foundations for the run-time monitoring of reactive systems: fundamentals of the MaC language
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Journal of the ACM (JACM)
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Regular sets over extended tree structures
Theoretical Computer Science
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A formal comparison of visual web wrapper generators
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Automata based model checking for reo connectors
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
The MSO theory of connectedly communicating processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Check it out: on the efficient formal verification of live sequence charts
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Abstract numeration systems and tilings
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Simulation-Based iteration of tree transducers
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Using language inference to verify omega-regular properties
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A new algorithm for strategy synthesis in LTL games
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
From PSL to LTL: a formal validation in HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Verification of well-formed communicating recursive state machines
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Proving properties of incremental merkle trees
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Journal of Computer and System Sciences
Using fairness constraints in process-algebraic verification
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Sofic and almost of finite type tree-shifts
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Learning deterministic DEC grammars is learning rational numbers
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
On the succinctness of nondeterminism
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Verifying complex continuous real-time systems with coinductive CLP(R)
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Multi-modal scenarios revisited: A net-based representation
Theoretical Computer Science
Computation as an unbounded process
Theoretical Computer Science
BDD-Based hardware verification
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Formal methods meet domain specific languages
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Observations on determinization of büchi automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
The expressive power of analog recurrent neural networks on infinite input streams
Theoretical Computer Science
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
Visual temporal logic as a rapid prototyping tool
Computer Languages
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Improved ramsey-based büchi complementation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Robustness of structurally equivalent concurrent parity games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Supervisory control of discrete event systems
Mathematical and Computer Modelling: An International Journal
Constraint programming on infinite data streams
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Computing infinite plans for LTL goals using a classical planner
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
ACM Transactions on Computational Logic (TOCL)
The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action
On Deadlock and Fairness Decision Problems for Computations on Client-server Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On the Generative Power of ω-Grammars and ω-Automata
Fundamenta Informaticae
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Acceptance conditions for ω-languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
Asynchronous Circuits, Communicating Processes, and Muller Automaton
Fundamenta Informaticae
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
Markov Decision Processes and Deterministic Büchi Automata
Fundamenta Informaticae
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Transformations of Timed Cooperating Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
On Topological Hierarchies of Temporal Properties
Fundamenta Informaticae
Fundamenta Informaticae
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Fundamenta Informaticae
Theoretical Computer Science
Solving games via three-valued abstraction refinement
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Automatic derivation of compositional rules in automated compositional reasoning
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
There exist some ω-powers of any Borel rank
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Regular ideal languages and their boolean combinations
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Parameterized weighted containment
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Code aware resource management
Formal Methods in System Design
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fair LTL synthesis for non-deterministic systems using strong cyclic planners
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Theory of Computing Systems
Theory of Computing Systems
Quantitative reactive modeling and verification
Computer Science - Research and Development
Compositional probabilistic verification through multi-objective model checking
Information and Computation
Automata-theoretic decision of timed games
Theoretical Computer Science
On the topological complexity of ω-languages of non-deterministic Petri nets
Information Processing Letters
Program Verification: State of the Art, Problems, and Results. II1
Cybernetics and Systems Analysis
Forcing MSO on Infinite Words in Weak MSO
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.05 |