Relevant bibliographies by topics / Emptiness checking

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Emptiness checking'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Emptiness checking.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Emptiness checking"

1

Tripakis, Stavros, Sergio Yovine, and Ahmed Bouajjani. "Checking Timed Büchi Automata Emptiness Efficiently." Formal Methods in System Design 26, no. 3 (2005): 267–92. http://dx.doi.org/10.1007/s10703-005-1632-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tripakis, Stavros. "Checking timed Büchi automata emptiness on simulation graphs." ACM Transactions on Computational Logic 10, no. 3 (2009): 1–19. http://dx.doi.org/10.1145/1507244.1507245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

YAN, Rong-Jie, Wen-Liang ZHANG, and Zhi-Song TANG. "Truly Bitstate-Hashing for SCC-Based Emptiness Checking Algorithms." Chinese Journal of Computers 31, no. 6 (2009): 979–88. http://dx.doi.org/10.3724/sp.j.1016.2008.00979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LU, LUNJIN. "Improving precision of type analysis using non-discriminative union." Theory and Practice of Logic Programming 8, no. 01 (2007): 33–79. http://dx.doi.org/10.1017/s1471068407003055.

Full text
Abstract:
AbstractThis paper presents a new type analysis for logic programs. The analysis is performed witha prioritype definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed
APA, Harvard, Vancouver, ISO, and other styles
5

Lu, Lunjin. "Checking Emptiness of Non-Deterministic Regular Types with Set Operators." Electronic Notes in Theoretical Computer Science 212 (April 2008): 191–206. http://dx.doi.org/10.1016/j.entcs.2008.04.062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Qian, Kairong, and Albert Nymeyer. "Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis." Electronic Notes in Theoretical Computer Science 149, no. 2 (2006): 33–49. http://dx.doi.org/10.1016/j.entcs.2005.07.025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ishibashi, Yukio, Masahiro Nagamatsu, and Torao Yanaru. "Accelerating concurrent fault simulation by parallel pattern emptiness checking of fault lists." Systems and Computers in Japan 28, no. 12 (1997): 53–64. http://dx.doi.org/10.1002/(sici)1520-684x(19971115)28:12<53::aid-scj6>3.0.co;2-c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

PENG, WUXU, and S. PURUSHOTHAMAN IYER. "A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES." International Journal of Foundations of Computer Science 06, no. 02 (1995): 169–86. http://dx.doi.org/10.1142/s0129054195000123.

Full text
Abstract:
In this paper we consider pushdown automata on infinite trees with empty stack as the accepting condition (ω-EPDTA). We provide the following regarding ω-EPDTA: (a) its relationship to other Pushdown automata on infinite trees, (b) a Kleene-Closure theorem and (c) a single exponential time algorithm for checking emptiness. We demonstrate the usefulness of ω-EPDTA through two example applications: defining the temporal uniform inevitability property and specifying a context-free process with unbounded state space, both of which cannot be defined and/or specified by the classical finite state au
APA, Harvard, Vancouver, ISO, and other styles
9

Akshay, S., Benedikt Bollig, and Paul Gastin. "Event clock message passing automata: a logical characterization and an emptiness checking algorithm." Formal Methods in System Design 42, no. 3 (2012): 262–300. http://dx.doi.org/10.1007/s10703-012-0179-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

BLOEM, RODERICK, ALESSANDRO CIMATTI, INGO PILL, and MARCO ROVERI. "SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA." International Journal of Foundations of Computer Science 18, no. 04 (2007): 727–43. http://dx.doi.org/10.1142/s0129054107004942.

Full text
Abstract:
This paper addresses the challenges of symbolic model checking and language emptiness checking where the specification is given as an alternating Büchi automaton. We introduce a novel version of Miyano and Hayashi's construction that allows us to directly convert an alternating automaton to a polynomially-sized symbolic structure. We thus avoid building an exponentially-sized explicit representation of the corresponding nondeterministic automaton. For one-weak automata, Gastin and Oddoux' construction produces smaller automata than Miyano and Hayashi's construction. We present a (symbolic) hyb
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Emptiness checking"

1

Maquet, Nicolas. "New algorithms and data structures for the emptiness problem of alternating automata." Doctoral thesis, Universite Libre de Bruxelles, 2011. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209961.

Full text
Abstract:
This work studies new algorithms and data structures that are useful in the context of program verification. As computers have become more and more ubiquitous in our modern societies, an increasingly large number of computer-based systems are considered safety-critical. Such systems are characterized by the fact that a failure or a bug (computer error in the computing jargon) could potentially cause large damage, whether in loss of life, environmental damage, or economic damage. For safety-critical systems, the industrial software engineering community increasingly calls for using techniques w
APA, Harvard, Vancouver, ISO, and other styles
2

Renault, Etienne. "Contribution aux tests de vacuité pour le model checking explicite." Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066452/document.

Full text
Abstract:
L'approche automate pour le model checking de propriétés temporelles à temps linéaire est une technique classique de vérification formelle de systèmes concurrents. Un système, ainsi qu'une propriété qu'on souhaite y vérifier, sont modélisés sous forme d’omega-automates reconnaissant des mots infinis. Des manipulations de ces automates (produit synchronisé et test de vacuité) permettent d'établir si le système vérifie la propriété ou non. Dans cette thèse nous nous focalisons sur un type particulier d'omega-automates qui permettent une représentation concise des propriétés d'équité faible: les
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Emptiness checking"

1

Couvreur, Jean-Michel, Alexandre Duret-Lutz, and Denis Poitrenaud. "On-the-Fly Emptiness Checks for Generalized Büchi Automata." In Model Checking Software. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11537328_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Chao, and Gary D. Hachtel. "Sharp Disjunctive Decomposition for Language Emptiness Checking." In Formal Methods in Computer-Aided Design. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36126-x_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Guangyuan. "Checking Timed Büchi Automata Emptiness Using LU-Abstractions." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04368-0_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Iosif, Radu, and Xiao Xu. "Abstraction Refinement for Emptiness Checking of Alternating Data Automata." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89963-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Keinänen, Helena. "Core Non-emptiness Checking in Hedonic Games via Difference Logic." In Agent and Multi-Agent Systems: Technologies and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13480-7_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Laarman, Alfons, Mads Chr Olesen, Andreas Engelbredt Dalsgaard, Kim Guldstrand Larsen, and Jaco van de Pol. "Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction." In Computer Aided Verification. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39799-8_69.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Emptiness checking"

1

Wang, Fang, and Sofiène Tahar. "Language emptiness checking using MDGs." In the 13th ACM Great Lakes Symposium. ACM Press, 2003. http://dx.doi.org/10.1145/764808.764832.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhao, Lu, Jianpei Zhang, and Jing Yang. "Advances in on-the-fly emptiness checking algorithms for Büchi automata." In 2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI). IEEE, 2012. http://dx.doi.org/10.1109/icaci.2012.6463132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Emptiness checking' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography