756 search results - page 134 / 152 » Can Abstract State Machines Be Useful in Language Theory |
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
ECOOP
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. The information of execution frequencies of virtual call targets is valuable for program analyses and optimizations of object-oriented programs. However, to obtain this i...
IFM
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
FMCAD
1998
Springer
14 years 14 days ago
1998
Springer
Executable formal speci cation can allow engineers to test (or simulate) the speci ed system on concrete data before the system is implemented. This is beginning to gain acceptance...