429 search results - page 30 / 86 » Symbolic Computation Software Composability |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
KBSE
1999
IEEE
13 years 12 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
SPAA
2010
ACM
14 years 12 days ago
2010
ACM
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...
IFM
2009
Springer
14 years 2 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
CC
2003
Springer
14 years 25 days ago
2003
Springer
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...