Export Citations
2 Results for: Keyword: pushdown model checking
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,815,652 records)|Limit your search to The ACM Full-Text Collection (772,220 records)
Select All
- articleMarch 2009
CaRet With Forgettable Past
Electronic Notes in Theoretical Computer Science (ENTCS) (ENTCS), Volume 231Pages 343–361https://doi.org/10.1016/j.entcs.2009.02.045We study the extension of the full logic CaRet with the unary regular modality N (which reads ''from now on'') which allows to model forgettable past. For such an extension, denoted NCaRet, we show the following: (1) NCaRet is expressively complete for ...
- ArticleJune 2007
Regularly annotated set constraints
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 331–341https://doi.org/10.1145/1250734.1250772A general class of program analyses area combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6