Completeness for Algebraic Theories of Local State. Retaining the Probabilities in Probabilistic Testing Theory. Forward Analysis of Depth-Bounded Processes.
Parameterised Multiparty Session Types. Counting CTL. Degrees of Lookahead in Regular Infinite Games. Reachability Analysis of Communicating Pushdown Systems. Page 1 Navigate to page number of 2. Contributor s Goubault-Larrecq, Jean editor. Show full item record. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions.
The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.
DOI Publisher Springer Nature. Publication date and place Cham, Classification Mathematical foundations. The export option will allow you to export the current search results of the entered query to a file. Differen formats are available for download. To export the items, click on the button corresponding with the preferred download format.
A logged-in user can export up to items. If you're not logged in, you can export no more than items. To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.
After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.
0コメント