Titlebook: Mathematical Foundations of Computer Science 2011; 36th International S Filip Murlak,Piotr Sankowski Conference proceedings 2011 Springer-V

magnanimity

hallow

Quantitative Refinement for Weighted Modal Transition Systemsent specification theories are however qualitative in nature and hence fragile and unsuited for modern software systems. We propose the first specification theory which allows to capture quantitative aspects during the refinement and implementation process.

confide

COMMA

Verifying Proofs in Constant Depthadmit proof systems in this very restricted model. Formulated alternatively, we ask which languages can be enumerated by . functions. Our results show that the answer to this problem is not determined by the complexity of the language. On the one hand, we construct . proof systems for a variety of l

tenuous

coagulate

LEER

addict

巡回

富饒

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domainsover . domains of ?. and ?., under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane