Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
71 | Chao Wang 0001, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi |
Compositional SCC Analysis for Language Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 28(1), pp. 5-36, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
language emptiness, model checking, BDD, LTL, abstraction refinement |
71 | Fang Wang, Sofiène Tahar |
Language emptiness checking using MDGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 13th ACM Great Lakes Symposium on VLSI 2003, Washington, DC, USA, April 28-29, 2003, pp. 88-91, 2003, ACM, 1-58113-677-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
MDGs (multiway decision graphs), ROBDDs (reduced ordered binary decision diagrams), büchi automata, formal hardware verification, language emptiness checking, model checking |
66 | Micha Sharir, Hayim Shaul |
Ray shooting amid balls, farthest point from a line, and range emptiness searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 525-534, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
66 | Jean-Michel Couvreur, Alexandre Duret-Lutz, Denis Poitrenaud |
On-the-Fly Emptiness Checks for Generalized Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 12th International SPIN Workshop, San Francisco, CA, USA, August 22-24, 2005, Proceedings, pp. 169-184, 2005, Springer, 3-540-28195-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
57 | Orna Kupferman, Moshe Y. Vardi |
From Complementation to Certification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, pp. 591-606, 2004, Springer, 3-540-21299-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Tony Tan |
On Pebble Automata for Data Languages with Decidable Emptiness Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 712-723, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Guangyuan Li |
Checking Timed Büchi Automata Emptiness Using LU-Abstractions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings, pp. 228-242, 2009, Springer, 978-3-642-04367-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Stavros Tripakis, Sergio Yovine, Ahmed Bouajjani |
Checking Timed Büchi Automata Emptiness Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 26(3), pp. 267-292, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
on-the fly verification, timed automata, symbolic model-checking, verification tools |
50 | Roderick Bloem, Harold N. Gabow, Fabio Somenzi |
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 28(1), pp. 37-56, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
language emptiness, Büchi automata, Streett automata, model checking, binary decision diagrams, depth-first search, breadth-first search, strongly connected components, symbolic algorithms |
49 | Jeff Erickson 0001 |
Better Lower Bounds for Halfspace Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 472-481, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
halfspace emptiness, query region, computational complexity, lower bounds, points, polyhedron, facets, partitioning algorithms, hyperplanes, polylogarithmic factors |
45 | Joe Hendrix, Hitoshi Ohsaki |
Combining Equational Tree Automata over AC and ACI Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 142-156, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Souheib Baarir, Alexandre Duret-Lutz |
Emptiness Check of Powerset Buchi Automata using Inclusion Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 10-13 July 2007, Bratislava, Slovak Republic, pp. 41-50, 2007, IEEE Computer Society, 978-0-7695-2902-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Yige Li, Kanglin Xie, Tao Hao |
Combining Couvreur's Algorithm with Bitstate-Hashing for Emptiness Check. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (2) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 2, pp. 283-286, 2006, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Philippe Balbiani |
Emptiness Relations in Property Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relational Methods in Computer Science, 6th International Conference, RelMICS 2001, and 1st Workshop of COST Action 274 TARSKI Oisterwijk, The Netherlands, October 16-21, 2001, Revised Papers, pp. 15-34, 2001, Springer, 3-540-00315-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Hubert Wagener |
On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings, pp. 384-399, 1988, Springer, 3-540-51659-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Pao-Ann Hsiung |
Parallel Object-Oriented Synthesis Environment Based On Message-Passing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TOOLS (27) ![In: TOOLS 1998: 27th International Conference on Technology of Object-Oriented Languages and Systems, 22-25 September 1998, Beijing, China, pp. 251-, 1998, IEEE Computer Society, 0-8186-9096-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Object-Oriented Synthesis, Emptiness, Message-Passing, Deadlock, Parallel Design |
34 | Slawomir Lasota 0001, Igor Walukiewicz |
Alternating timed automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(2), pp. 10:1-10:27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
emptyness problem, timed automata, Alternation |
34 | Lakshmi Manasa, Shankara Narayanan Krishna, Kumar Nagaraj |
Updatable Timed Automata with Additive and Diagonal Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 407-416, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Clare Dixon, Michael Fisher 0001, Boris Konev |
Is There a Future for Deductive Temporal Verification? ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: 13th International Symposium on Temporal Representation and Reasoning (TIME 2006), 15-17 June 2006, Budapest, Hungary, pp. 11-18, 2006, IEEE Computer Society, 0-7695-2617-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fragments of PTL, deductive verification, clausal temporal resolution, complexity |
34 | Kumar Neeraj Verma |
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 180-196, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Jean-Marc Talbot |
On the Alternation-Free Horn Mu-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, Proceedings, pp. 418-435, 2000, Springer. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008 |
New Decidability Results Concerning Two-way Counter Machines and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 313-324, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
32 | Stavros Tripakis |
Checking timed Büchi automata emptiness on simulation graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(3), pp. 15:1-15:19, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
property-preserving abstractions, timed Büchi automata, model checking, Formal methods, specification languages |
32 | Alexandre Duret-Lutz, Denis Poitrenaud, Jean-Michel Couvreur |
On-the-fly Emptiness Check of Transition-Based Streett Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings, pp. 213-227, 2009, Springer, 978-3-642-04760-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl |
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 121-133, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin |
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 94-105, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Mika Hirvensalo |
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 309-319, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Zeeshan Anwar, Frank P. Ferrie |
Towards Robust Voxel-Coloring: Handling Camera Calibration Errors and Partial Emptiness of Surface Voxels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (1) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 98-102, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Heikki Tauriainen |
Nested Emptiness Search for Generalized Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 16-18 June 2004, Hamilton, Canada, pp. 165-174, 2004, IEEE Computer Society, 0-7695-2077-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun |
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 103-114, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Chao Wang 0001, Gary D. Hachtel |
Sharp Disjunctive Decomposition for Language Emptiness Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proceedings, pp. 106-122, 2002, Springer, 3-540-00116-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulakos |
A Probabilistic Theory of Occupancy and Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (3) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part III, pp. 112-132, 2002, Springer, 3-540-43746-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Chao Wang 0001, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi |
Divide and Compose: SCC Refinement for Language Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 456-471, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Dietrich Kuske |
Emptiness Is Decidable for Asynchronous Cellular Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings, pp. 536-551, 2000, Springer, 3-540-67897-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | John G. Thistle, Walter Murray Wonham |
Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings, pp. 367-382, 1991, Springer, 3-540-55789-X. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
27 | Jirí Síma, Jirí Wiedermann |
Theory of Neuromata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(1), pp. 155-178, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
emptiness problem, finite neural networks, string acceptors, regular expressions, descriptional complexity, Hopfield networks |
23 | ZhangBing Zhou, Sami Bhiri, Armin Haller, Hai Zhuge, Manfred Hauswirth |
Assessment of Service Protocols Adaptability Using a Novel Path Computation Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OTM Conferences (1) ![In: On the Move to Meaningful Internet Systems: OTM 2009, Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009, Vilamoura, Portugal, November 1-6, 2009, Proceedings, Part I, pp. 237-254, 2009, Springer, 978-3-642-05147-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Christel Baier, Nathalie Bertrand 0001, Marcus Größer |
On Decision Problems for Probabilistic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 287-301, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Yakov Nekrich |
Data Structures with Local Update Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 138-147, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Mohab Safey El Din |
Testing Sign Conditions on a Multivariate Polynomial and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(1), pp. 177-207, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
optimization, complexity, Polynomial systems, inequalities, real solutions |
23 | Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato |
A Robust Class of Context-Sensitive Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pp. 161-170, 2007, IEEE Computer Society, 0-7695-2908-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin 0001 |
Tree Automata with Memory, Visibility and Structural Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, pp. 168-182, 2007, Springer, 978-3-540-71388-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Dario Carotenuto, Aniello Murano, Adriano Peron |
2-Visibly Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, pp. 132-144, 2007, Springer, 978-3-540-73207-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Yakov Nekrich |
Orthogonal Range Searching in Linear and Almost-Linear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 15-26, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Mathias Péron, Nicolas Halbwachs |
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings, pp. 268-282, 2007, Springer, 978-3-540-69735-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
difference-bound matrices, disequalities, static analysis, alias analysis, abstract domains |
23 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Satisfiability of a Spatial Logic with Tree Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 130-145, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Alain Frisch, Haruo Hosoya |
Towards Practical Typechecking for Macro Tree Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers, pp. 246-260, 2007, Springer, 978-3-540-75986-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Bendick Mahleko, Andreas Wombacher |
Indexing Business Processes based on Annotated Finite State Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICWS ![In: 2006 IEEE International Conference on Web Services (ICWS 2006), 18-22 September 2006, Chicago, Illinois, USA, pp. 303-311, 2006, IEEE Computer Society, 0-7695-2669-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan 0001 |
Propositional Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 50-65, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Barbara Jobstmann, Roderick Bloem |
Optimizations for LTL Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, 6th International Conference, FMCAD 2006, San Jose, California, USA, November 12-16, 2006, Proceedings, pp. 117-124, 2006, IEEE Computer Society, 0-7695-2707-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Slawomir Lasota 0001, Igor Walukiewicz |
Alternating Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 250-265, 2005, Springer, 3-540-25388-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Dang Van Hung, Bui Vu Anh |
Model Checking Real-Time Component Based Systems with Blackbox Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), 17-19 August 2005, Hong Kong, China, pp. 76-79, 2005, IEEE Computer Society, 0-7695-2346-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Duration Automata, Real-time Systems, Automatic Verification, Component Software |
23 | Catalin Dima |
Timed Shuffle Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, pp. 95-109, 2005, Springer, 3-540-28309-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Lopamudra Choudhury, Mihir K. Chakraborty |
On Extending Venn Diagram by Augmenting Names of Individuals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Diagrams ![In: Diagrammatic Representation and Inference, Third International Conference, Diagrams 2004, Cambridge, UK, March 22-24, 2004, Proceedings, pp. 142-146, 2004, Springer, 3-540-21268-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Salvatore La Torre, Aniello Murano |
Reasoning About Co-Büchi Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2004, First International Colloquium, Guiyang, China, September 20-24, 2004, Revised Selected Papers, pp. 527-542, 2004, Springer, 3-540-25304-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl |
Counting in Trees for Free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 1136-1149, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Jan Hladik, Ulrike Sattler |
A Translation of Looping Alternating Automata into Description Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 90-105, 2003, Springer, 3-540-40559-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Hitoshi Ohsaki, Toshinori Takai |
Decidability and Closure Properties of Equational Tree Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings, pp. 114-128, 2002, Springer, 3-540-43916-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Salvatore La Torre, Aniello Murano, Margherita Napoli |
Weak Muller Acceptance Conditions for Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002, Revised Papers, pp. 240-254, 2002, Springer, 3-540-43631-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Daniel Kirsten |
Alternating Tree Automata and Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automata, Logics, and Infinite Games ![In: Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], pp. 153-167, 2001, Springer, 3-540-00388-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Roderick Bloem, Harold N. Gabow, Fabio Somenzi |
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, Third International Conference, FMCAD 2000, Austin, Texas, USA, November 1-3, 2000, Proceedings, pp. 37-54, 2000, Springer, 3-540-41219-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | András Sebö |
An Introduction to Empty Lattice Simplices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 400-414, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Frank Neven |
Extensions of Attribute Grammars for Structured Document Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Research Issues in Structured and Semistructured Database Programming, 7th International Workshop on Database Programming Languages, DBPL'99, Kinloch Rannoch, Scotland, UK, September 1-3, 1999, Revised Papers, pp. 99-116, 1999, Springer, 3-540-41481-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard |
Pumping, Cleaning and Symbolic Constraints Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 436-449, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis |
Memory Efficient Algorithms for the Verification of Temporal Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 2nd International Workshop, CAV '90, New Brunswick, NJ, USA, June 18-21, 1990, Proceedings, pp. 233-242, 1990, Springer, 3-540-54477-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Dainis Geidmanis |
On Possibilities of One-Way Synchronized and Alternating Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 292-299, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Sophie Tison |
Fair Termination is Decidable for Ground Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings, pp. 462-476, 1989, Springer, 3-540-51081-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Pantelis Andreou, Stavros Konstantinidis, Taylor J. Smith |
Improved Randomized Approximation of Hard Universality and Emptiness Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.08707, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Olga Martynova 0001 |
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 296, pp. 105127, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault |
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.03561, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Rodrigo Raya |
The Complexity of Checking Non-Emptiness in Symbolic Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.05250, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Jiuqiang Liu |
Necessary and sufficient conditions for solutions of the Ky Fan minimax inequality and the non-emptiness of fuzzy cores in economies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 467, pp. 108580, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Weihao Su, Rongchen Li, Chengyao Peng, Haiming Chen |
Algorithms for Checking Intersection Non-emptiness of Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2023 - 20th International Colloquium, Lima, Peru, December 4-8, 2023, Proceedings, pp. 216-235, 2023, Springer, 978-3-031-47962-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault |
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 33:1-33:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Jakub Michaliszyn, Jan Otop, Piotr Wieczorek |
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 3:1-3:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
On the Complexity of Triangle Counting Using Emptiness Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 48:1-48:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Olga Martynova 0001 |
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.02380, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Jiuqiang Liu |
Non-emptiness of the fuzzy core in a finite production economy with infinite-dimensional commodity space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 447, pp. 123-136, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Dominik Peteler, Karin Quaas |
Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria., pp. 76:1-76:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-256-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz |
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 12:1-12:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Petra Wolf 0002 |
Generalized Synchronization and Intersection Non-Emptiness of Finite-State Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
21 | Laure Daviaud, Marcin Jurdzinski, Ranko Lazic 0001, Filip Mazowiecki, Guillermo A. Pérez 0001, James Worrell 0001 |
When are emptiness and containment decidable for probabilistic automata? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 119, pp. 78-96, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Bingchen Gong, Yinyu Nie, Yiqun Lin, Xiaoguang Han 0001, Yizhou Yu |
ME-PCN: Point Completion Conditioned on Mask Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.08187, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Henning Fernau, Stefan Hoffmann 0001, Michael Wehar |
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.05244, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann 0001, Markus Holzer 0001, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.01279, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Georg Zetzsche |
The emptiness problem for valence automata over graph monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 277, pp. 104583, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Bingchen Gong, Yinyu Nie, Yiqun Lin, Xiaoguang Han 0001, Yizhou Yu |
ME-PCN: Point Completion Conditioned on Mask Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 2021 IEEE/CVF International Conference on Computer Vision, ICCV 2021, Montreal, QC, Canada, October 10-17, 2021, pp. 12468-12477, 2021, IEEE, 978-1-6654-2812-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Pavol Vargovcík, Lukás Holík |
Simplifying Alternating Automata for Emptiness Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings, pp. 243-264, 2021, Springer, 978-3-030-89050-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Aaron Lye |
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings, pp. 97-108, 2021, Springer, 978-3-030-68194-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann 0001, Markus Holzer 0001, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 34:1-34:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Dominik Barth, Moritz Beck 0001, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau |
Emptiness problems for integer circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 824-825, pp. 11-35, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Amar Isli |
Buchi automata augmented with spatial constraints: simulating an alternating with a nondeterministic and deciding the emptiness problem for the latter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.11510, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Simon Wimmer 0001, Frédéric Herbreteau, Jaco van de Pol |
Certifying Emptiness of Timed Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.04150, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Petra Wolf 0002, Henning Fernau |
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.05826, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Achille Basile, Vincenzo Scalzo |
Non-emptiness of the alpha-core: sufficient and necessary conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Game Theory ![In: Int. J. Game Theory 49(4), pp. 1143-1153, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Antti Kuusisto, Fabian Reiter |
Emptiness problems for distributed automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 272, pp. 104503, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Mateus de Oliveira Oliveira, Michael Wehar |
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 24th International Conference, DLT 2020, Tampa, FL, USA, May 11-15, 2020, Proceedings, pp. 69-82, 2020, Springer, 978-3-030-48515-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Simon Wimmer 0001, Frédéric Herbreteau, Jaco van de Pol |
Certifying Emptiness of Timed Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems - 18th International Conference, FORMATS 2020, Vienna, Austria, September 1-3, 2020, Proceedings, pp. 58-75, 2020, Springer, 978-3-030-57627-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Petr Jancar, Jérôme Leroux, Grégoire Sutre |
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 169(1-2), pp. 123-150, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Xiujun Wang, Zhi Liu 0002, Yan Gao, Xiao Zheng, Xianfu Chen, Celimuge Wu |
Near-Optimal Data Structure for Approximate Range Emptiness Problem in Information-Centric Internet of Things. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 21857-21869, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|