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
6
search results - page 2 / 2
»
Presburger Modal Logic Is PSPACE-Complete
Sort
relevance
views
votes
recent
update
View
thumb
title
132
click to vote
CSL
2009
Springer
164
views
Automated Reasoning
»
more
CSL 2009
»
Model Checking FO(R) over One-Counter Processes and beyond
15 years 10 months ago
Download
homepages.inf.ed.ac.uk
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »