Amanote Research

Amanote Research

    RegisterSign In

Verifying Quantitative Properties Using Bound Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/11560548_7
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2005

Authors
Arindam ChakrabartiKrishnendu ChatterjeeThomas A. HenzingerOrna KupfermanRupak Majumdar
Publisher

Springer Berlin Heidelberg


Related search

Specifying and Verifying Partial Order Properties Using Template MSCs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Promoting Public Transport Using Mobility Management and Verifying Its Quantitative Effect

Doboku Gakkai Ronbunshuu D
2006English

Verifying Functional Properties of Smart Contracts Using Symbolic Model-Checking

Proceedings of the Institute for System Programming of the RAS
2018English

Verifying Properties of Neural Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Verifying a Quantitative Relaxation of Linearizability via Refinement

International Journal on Software Tools for Technology Transfer
Information SystemsSoftware
2015English

Verifying Properties of Process Definitions

ACM SIGSOFT Software Engineering Notes
2000English

Verifying Information Flow Properties of Hybrid Systems

2013English

Verifying Spatial Queries Using Voronoi Neighbors

2010English

Verifying SeVeCom Using Set-Based Abstraction

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy