Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
116
search results - page 24 / 24
»
Minimization of Automata
Sort
relevance
views
votes
recent
update
View
thumb
title
142
click to vote
ASE
2005
137
views
more
ASE 2005
»
Rewriting-Based Techniques for Runtime Verification
15 years 2 months ago
Download
www.havelund.com
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
claim paper
Read More »
« Prev
« First
page 24 / 24
Last »
Next »