1368 search results - page 150 / 274 » Recursive modules for programming |
TAPSOFT
1997
Springer
14 years 1 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
COMPASS
1994
14 years 1 months ago
1994
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
ICALP
2000
Springer
14 years 27 days ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
MPC
1995
Springer
14 years 25 days ago
1995
Springer
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...