Finite differencing of logical formulas for static analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing specialized shape analyses for uniform change
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Refinement-based verification for possibly-cyclic lists
Program analysis and compilation, theory and practice
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The dynamic complexity of formal languages
ACM Transactions on Computational Logic (TOCL)
Effectively-Propositional reasoning about reachability in linked data structures
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Modular reasoning about heap paths via effectively propositional formulas
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
Dynamic computational complexity is the study of resource-bounded ongoing computational processes. We consider the general problem of processing a sequence of inputs, instead of a single input. We introduce a new model for dynamic computation, and investigate the computational complexity of various dynamic problems. The field of computational complexity has previously studied static computation, which takes a single fixed input and computes the desired result. We define a dynamic problem to be the function mapping a stream of data to the desired stream of output, and we investigate the complexity of the dynamic computation required to compute that function. We describe complexity classes of dynamic problems, reductions between dynamic problems, and complete problems for dynamic complexity classes.