Certifying DFA Bounds for Recognition and Separation

Orna Kupferman, Nir Lavee, Salomon Sickert

Type: Article

Publication Date: 2022-03-15

Citations: 2

DOI: https://doi.org/10.1007/s11334-022-00446-6

View Publication

Download PDF

Locations

Innovations in Systems and Software Engineering - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Certifying DFA Bounds for Recognition and Separation	2021	Orna Kupferman Nir Lavee Salomon Sickert
+ PDF Chat	ATP and Presentation Service for Mizar Formalizations	2012	Josef Urban Piotr Rudnicki Geoff Sutcliffe
+ PDF Chat	A Framework for the Verification of Certifying Computations	2013	Eyad Alkassar Sascha Böhme Kurt Mehlhorn Christine Rizkallah
+ PDF Chat	Equivalence Checking of Non-deterministic Operations	2018	Sergio Antoy Michael Hanus
+	Computing Bounds from Arithmetical Proofs	2010	Stanley S. Wainer
+ PDF Chat	TWAM: A Certifying Abstract Machine for Logic Programs	2018	Rose Bohrer Karl Crary
+	Finite-Type Invariants	2006	Dror Bar-Natan
+	Finite-Type Invariants	2006	Dror Bar-Natan
+ PDF Chat	High-level signatures and initial semantics	2018	Benedikt Ahrens André Hirschowitz Ambroise Lafont Marco Maggesi
+	Polynomial-time Martin-L�f type theory	1992	Leina M. Joseph
+	Understanding preservation theorems: omega-omega bounding	2005	Chaz Schlindwein
+	Certified Cost Bounds in Agda: A Step Towards Automated Complexity Analysis	2015	Bowornmet Hudson
+ PDF Chat	Normal Form Bisimulations for Delimited-Control Operators	2012	Dariusz Biernacki Sergueï Lenglet
+ PDF Chat	Lifting CDCL to Template-Based Abstract Domains for Program Verification	2017	Rajdeep Mukherjee Peter Schrammel Leopold Haller Daniel Kroening Tom Melham
+	Minimal DFA for testing divisibility	2004	Boris V. Alexeev
+	The Ehrenfeucht conjecture for transducers	1987	Juhani Karhumäki
+ PDF Chat	Undecidability and Finite Automata	2017	Jörg Endrullis Jeffrey Shallit Tim Smith
+ PDF Chat	Preservation of Normality by Unambiguous Transducers	2022	Olivier Carton
+	polynomially bounded structures	2008	Marcus Tressl
+ PDF Chat	Proving Correctness and Completeness of Normal Programs — A Declarative Approach	2001	Włodzimierz Drabent Miroslawa Miłkowska

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Certifying DFA Bounds for Recognition and Separation	2021	Orna Kupferman Nir Lavee Salomon Sickert

Works Cited by This (4)

Action	Title	Year	Authors
+ PDF Chat	Efficient Separability of Regular Languages by Subsequences and Suffixes	2013	Wojciech Czerwiński Wim Martens Tomáš Masopust
+ PDF Chat	Explainable Reactive Synthesis	2020	Tom Baumeister Bernd Finkbeiner Hazem Torfah
+ PDF Chat	Certifying Inexpressibility	2021	Salomon Sickert Orna Kupferman
+	Certifying Inexpressibility	2021	Orna Kupferman Salomon Sickert