James Worrell

CoRR, 2024

A parametric version of the Hilbert Nullstellensatz.

[BibT_eX]

[DOI]

CoRR, 2024

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates.

[BibT_eX]

[DOI]

Andrew Scoones

Mahsa Shirmohammadi

CoRR, 2024

On Tree Automata, Generating Functions, and Differential Equations.

[BibT_eX]

[DOI]

CoRR, 2024

On the Decidability of Presburger Arithmetic Expanded with Powers.

[BibT_eX]

[DOI]

CoRR, 2024

Determination Problems for Orbit Closures and Matrix Groups.

[BibT_eX]

[DOI]

CoRR, 2024

Multiple Reachability in Linear Dynamical Systems.

[BibT_eX]

[DOI]

CoRR, 2024

Nonnegativity Problems for Matrix Semigroups.

[BibT_eX]

[DOI]

Julian D'Costa

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

The 2-Dimensional Constraint Loop Problem Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

On Rational Recursion for Holonomic Sequences.

[BibT_eX]

[DOI]

Bertrand Teguia Tabuguia

Proceedings of the Computer Algebra in Scientific Computing - 26th International Workshop, 2024

2023

On the 𝑝-adic zeros of the Tribonacci sequence.

[BibT_eX]

[DOI]

Math. Comput., October, 2023

On Strongest Algebraic Program Invariants.

[BibT_eX]

[DOI]

J. ACM, October, 2023

On the Zeros of Exponential Polynomials.

[BibT_eX]

[DOI]

J. ACM, August, 2023

Markov chains and unambiguous automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

The Monadic Theory of Toric Words.

[BibT_eX]

[DOI]

CoRR, 2023

Transcendence of Sturmian Numbers over an Algebraic Base.

[BibT_eX]

[DOI]

CoRR, 2023

Skolem Meets Bateman-Horn.

[BibT_eX]

[DOI]

CoRR, 2023

The Power of Positivity.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Multiplicity Problems on Algebraic Series and Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

The Membership Problem for Hypergeometric Sequences with Quadratic Parameters.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Positivity Problems for Reversible Linear Recurrence Sequences.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

The Skolem Landscape (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

O-Minimal Invariants for Discrete-Time Dynamical Systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2022

What's decidable about linear loops?

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

Costs and rewards in priced timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Probabilistic automata of bounded ambiguity.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Cristian Riveros

Inf. Comput., 2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems.

[BibT_eX]

[DOI]

CoRR, 2022

When are Local Queries Useful for Robust Learning?

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Universal Skolem Set of Positive Lower Density.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Skolem Meets Schanuel.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

On the Skolem Problem and the Skolem Conjecture.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Identity Testing for Radical Expressions.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

The Membership Problem for Hypergeometric Sequences with Rational Parameters.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Algebraic Model Checking for Discrete Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022

Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

What's Decidable About Discrete Linear Dynamical Systems?

[BibT_eX]

[DOI]

Proceedings of the Principles of Systems Design, 2022

2021

Deciding ω-regular properties on linear recurrence sequences.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2021

First-Order Orbit Queries.

[BibT_eX]

[DOI]

Shaull Almagor

Theory Comput. Syst., 2021

When are emptiness and containment decidable for probabilistic automata?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices.

[BibT_eX]

[DOI]

CoRR, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.

[BibT_eX]

[DOI]

CoRR, 2021

On Positivity and Minimality for Second-Order Holonomic Sequences.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Pseudo-Skolem Problem is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Universal Skolem Sets.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Cyclotomic Identity Testing and Applications.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Decision Problems for Second-Order Holonomic Recurrences.

[BibT_eX]

[DOI]

Eike Neumann

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Porous Invariants.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

Effective definability of the reachability relation in timed automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Parametric Model Checking Continuous-Time Markov Chains.

[BibT_eX]

[DOI]

Catalin-Andrei Ilie

James B. Worrell

Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

How Fast Can You Escape a Compact Polytope?

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems.

[BibT_eX]

[DOI]

Toghrul Karimov

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

On the skolem problem and prime powers.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Invariants for Continuous Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On Ranking Function Synthesis and Termination for Polynomial Programs.

[BibT_eX]

[DOI]

Eike Neumann

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Algebraic Invariants for Linear Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Coverability in 1-VASS with Disequality Tests.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

On the Expressiveness and Monitoring of Metric Temporal Logic.

[BibT_eX]

[DOI]

Hsi-Ming Ho

Log. Methods Comput. Sci., 2019

On the Decidability of Membership in Matrix-exponential Semigroups.

[BibT_eX]

[DOI]

J. ACM, 2019

On the Hardness of Robust Classification.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

On Termination of Integer Linear Loops.

[BibT_eX]

[DOI]

Mehran Hosseini

CoRR, 2019

The Semialgebraic Orbit Problem.

[BibT_eX]

[DOI]

Shaull Almagor

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

On the Monniaux Problem in Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 26th International Symposium, 2019

On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields.

[BibT_eX]

[DOI]

Florent Guépin

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Termination of Linear Loops over the Integers.

[BibT_eX]

[DOI]

Mehran Hosseini

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

On Reachability Problems for Low-Dimensional Matrix Semigroups.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

On the decidability of reachability in linear time-invariant systems.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, 2019

2018

Model Checking Real-Time Systems.

[BibT_eX]

[DOI]

Patricia Bouyer

Uli Fahrenberg

Kim Guldstrand Larsen

Nicolas Markey

Proceedings of the Handbook of Model Checking., 2018

Reachability Problems 2014: Special issue.

[BibT_eX]

[DOI]

Igor Potapov

Theor. Comput. Sci., 2018

Model Checking Flat Freeze LTL on One-Counter Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Polynomial Invariants for Affine Programs.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

When is Containment Decidable for Probabilistic Automata?.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

O-Minimal Invariants for Linear Loops.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Effective Divergence Analysis for Linear Recurrence Sequences.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Nonnegative Matrix Factorization Requires Irrationality.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2017

Minimisation of Multiplicity Tree Automata.

[BibT_eX]

[DOI]

Stefan Kiefer

Ines Marusic

Log. Methods Comput. Sci., 2017

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Rationality of Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Revisiting reachability in timed automata.

[BibT_eX]

[DOI]

Karin Quaas

Mahsa Shirmohammadi

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Polynomial automata: Zeroness and applications.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The Zero Problem for Exponential Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

The Polytope-Collision Problem.

[BibT_eX]

[DOI]

Shaull Almagor

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Polytope Escape Problem for Continuous Linear Dynamical Systems.

[BibT_eX]

[DOI]

João Sousa Pinto

Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, 2017

Timed Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete.

[BibT_eX]

[DOI]

Ranko Lazic

ACM Trans. Comput. Log., 2016

Complexity of Two-Variable Logic on Finite Trees.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2016

On the Complexity of the Orbit Problem.

[BibT_eX]

[DOI]

J. ACM, 2016

Relating Reachability Problems in Timed and Counter Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Solvability of Matrix-Exponential Equations.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On Recurrent Reachability for Continuous Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On the Skolem Problem for Continuous Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

On Restricted Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Proving the Herman-Protocol Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Markov Chains and Unambiguous Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

On linear recurrence sequences and loop termination.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2015

Complexity of equivalence and learning for multiplicity tree automata.

[BibT_eX]

[DOI]

Ines Marusic

J. Mach. Learn. Res., 2015

Reachability problems for Markov chains.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

The Polyhedral Escape Problem is Decidable.

[BibT_eX]

[DOI]

João Sousa Pinto

CoRR, 2015

On the Decidability of the Continuous Infinite Zeros Problem.

[BibT_eX]

[DOI]

CoRR, 2015

On the Decidability of the Bounded Continuous Skolem Problem.

[BibT_eX]

[DOI]

CoRR, 2015

On Matrix Powering in Low Dimensions.

[BibT_eX]

[DOI]

Esther Galby

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On Termination of Integer Linear Loops.

[BibT_eX]

[DOI]

João Sousa Pinto

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

The Polyhedron-Hitting Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Complexity of Linear Arithmetic with Divisibility.

[BibT_eX]

[DOI]

Antonia Lechner

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Three Variables Suffice for Real-Time Logic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2015

Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Language equivalence of probabilistic pushdown automata.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Model Checking Markov Chains Against Unambiguous Buchi Automata.

[BibT_eX]

[DOI]

CoRR, 2014

Three Variables are Enough for Real-Time Specification.

[BibT_eX]

[DOI]

CoRR, 2014

Positivity Problems for Low-Order Linear Recurrence Sequences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Online Monitoring of Metric Temporal Logic.

[BibT_eX]

[DOI]

Hsi-Ming Ho

Proceedings of the Runtime Verification - 5th International Conference, 2014

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Positivity Problem for Simple Linear Recurrence Sequences, .

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013

Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Algorithmic probabilistic game semantics - Playing games with automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

A Static Analysis Framework for Livelock Freedom in CSP

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees

[BibT_eX]

[DOI]

CoRR, 2013

On the Complexity of Multitape Automata Equivalence

[BibT_eX]

[DOI]

CoRR, 2013

Two Variable vs. Linear Temporal Logic in Model Checking and Games

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Effective Positivity Problems for Simple Linear Recurrence Sequences.

[BibT_eX]

[DOI]

CoRR, 2013

LTL Model Checking of Interval Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

The orbit problem in higher dimensions.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian.

[BibT_eX]

[DOI]

Ranko Lazic

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Expressive Completeness for Metric Temporal Logic.

[BibT_eX]

[DOI]

Paul Hunter

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Revisiting the Equivalence Problem for Finite Multitape Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

Three tokens in Herman's algorithm.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

On termination and invariance for faulty channel machines.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints

[BibT_eX]

[DOI]

CoRR, 2012

When is Metric Temporal Logic Expressively Complete?

[BibT_eX]

[DOI]

Paul Hunter

CoRR, 2012

Decision Problems for Linear Recurrence Sequences.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 6th International Workshop, 2012

On the Relationship between Reachability Problems in Timed and Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 6th International Workshop, 2012

Verification of Two-Variable Logic Revisited.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

On the Magnitude of Completeness Thresholds in Bounded Model Checking.

[BibT_eX]

[DOI]

Daniel Bundala

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Bisimilarity of Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

On the Complexity of the Equivalence Problem for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Branching-Time Model Checking of Parametric One-Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

On the Complexity of Computing Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

Di Chen

Proceedings of the Foundations of Software Science and Computational Structures, 2012

APEX: An Analyzer for Open Probabilistic Programs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Recent Developments in FDR.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

On Stabilization in Herman's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

On Reachability for Hybrid Automata over Bounded Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

The Church Synthesis Problem with Metric.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2011

Static Livelock Analysis in CSP.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Tractable Reasoning in a Fragment of Separation Logic.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Linear Completeness Thresholds for Bounded Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

Language Equivalence for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010

Alternating Timed Automata over Bounded Time.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Towards a Theory of Time-Bounded Verification.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Model Checking Succinct and Parametric One-Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Computing Rational Radical Sums in Uniform TC^0.

[BibT_eX]

[DOI]

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

On Process-Algebraic Extensions of Metric Temporal Logic.

[BibT_eX]

[DOI]

Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009

Time-Bounded Verification.

[BibT_eX]

[DOI]

Alexander Rabinovich

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Reachability in Succinct and Parametric One-Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems.

[BibT_eX]

[DOI]

Babita Sharma

Thomas Christopher Newcomb

Log. Methods Comput. Sci., 2008

Nets with Tokens which Carry Data.

[BibT_eX]

[DOI]

Ranko Lazic

A. W. Roscoe

Fundam. Informaticae, 2008

Universality Analysis for One-Clock Timed Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Real-Time Model Checking: Algorithms and Complexity.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

On Automated Verification of Probabilistic Programs.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

On Termination for Faulty Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

On Expressiveness and Complexity in Real-Time Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Some Recent Results in Metric Temporal Logic.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007

Recursively defined metric spaces without contraction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the decidability and complexity of Metric Temporal Logic over finite words.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Labelled Markov Processes as Generalised Stochastic Relations.

[BibT_eX]

[DOI]

Dusko Pavlovic

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

The Cost of Punctuality.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Zone-Based Universality Analysis for Single-Clock Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

Undecidability of Universality for Timed Automata with Minimal Resources.

[BibT_eX]

[DOI]

Sara Adams

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

2006

Approximating and computing behavioural distances in probabilistic transition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Safety Metric Temporal Logic Is Fully Decidable.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

On Metric Temporal Logic and Faulty Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

Testing Semantics: Connecting Processes and Process Logics.

[BibT_eX]

[DOI]

Dusko Pavlovic

Proceedings of the Algebraic Methodology and Software Technology, 2006

2005

On the final sequence of a finitary set functor.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A behavioural pseudometric for probabilistic transition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Domain theory, testing and simulation for labelled Markov processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On the Decidability of Metric Temporal Logic.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

An Accessible Approach to Behavioural Pseudometrics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Decidability and Complexity Results for Timed Automata via Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Measuring the probabilistic powerdomain.

[BibT_eX]

[DOI]

Keye Martin

Theor. Comput. Sci., 2004

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Duality for Labelled Markov Processes.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

Timed CSP = Closed Timed epsilon-automata.

[BibT_eX]

Nord. J. Comput., 2003

Axioms for Probability and Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Revisiting Digitization, Robustness, and Decidability for Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Universality and Language Inclusion for Open and Closed Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 2003

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

A Note on Coalgebras and Presheaves.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2002

Timed CSP = Closed Timed Safety Automata.

[BibT_eX]

[DOI]

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Testing Labelled Markov Processes.

[BibT_eX]

[DOI]

Steven Shalit

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

On the structure of categories of coalgebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Towards Quantitative Verification of Probabilistic Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

An Algorithm for Quantitative Verification of Probabilistic Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2001, 2001

2000

Coinduction for recursive data types: partial orders, metric spaces and Omega-categories.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2000

1999

Terminal sequences for accessible endofunctors.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 1999

1998

Toposes of Coalgebras and Hidden Algebras.

[BibT_eX]

[DOI]