Sciweavers

18 search results - page 4 / 4
» Predicate Abstraction and Canonical Abstraction for Singly-L...
Sort
View
CONCUR
2009
Springer
13 years 9 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
ICFP
1999
ACM
13 years 9 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 8 days ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...