OpenAlex
PricingAboutJobs
Log inGet started
Work

Memory-efficient algorithms for the verification of temporal properties

HTML

Year: 1992
Type: article
Source: Formal Methods in System Design
DOI: 10.1007/bf00121128
Authors: C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis
Institutions: University of Crete, IBM (United States), IBM Research - Almaden, University of Liège, AT&T (United States)
Language: English

Topic: Formal Methods in Verification
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: memory-efficient algorithms, Büchi automata, emptiness checking, product automaton, strongly connected components, randomized algorithms, random access memory, model checking

Open Access status: green
OpenAlex ID: W2012935476
FWCI: 12.02
Cites: 28
Cited by: 543
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms