Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

85

Voted

CADE
2000
Springer

favoriteEmaildiscussreport

132views Logical Reasoning» more CADE 2000»

Reducing Model Checking of the Many to the Few

15 years 2 months ago

Reducing Model Checking of the Many to the Few

Download userweb.cs.utexas.edu

E. Allen Emerson, Vineet Kahlon

Real-time Traffic

CADE 2000 | Logical Reasoning |

claim paper

Related Content

» Tapir Language Support to Reduce the State Space in ModelChecking

» Proving the Safety of SQL Queries

» Model Checking Vs Generalized Model Checking Semantic Minimizations for Temporal Logics

» Model Checking Timed Automata with Priorities Using DBM Subtraction

» Compositional Reasoning in Model Checking

» Automated Extraction of Inductive Invariants to Aid Model Checking

» Production Scheduling by Reachability Analysis A Case Study

» A New Approach to Bounded Model Checking for Branching Time Logics

» A Direct Algorithm for Multivalued Bounded Model Checking

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CADE
Authors	E. Allen Emerson, Vineet Kahlon

Comments (0)