Communicating sequential processes
Communicating sequential processes
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations
Bisimulation through probabilistic testing
Information and Computation
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
The complexity of probabilistic verification
Journal of the ACM (JACM)
A compositional approach to performance modelling
A compositional approach to performance modelling
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent constraint programming: towards probabilistic abstract interpretation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communication and Concurrency
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
A Per Model of Secure Information Flow in Sequential Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Symbolic Model Checking for Probabilistic Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Automatic Verification of Probabilistic Free Choice
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Demonic Product of Probabilistic Relations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Optimality in Abstractions of Model Checking
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Journal of Computer Security - Special issue on WITS'02
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Abstraction and Probabilities for Hybrid Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
| Hi-index | 0.00 |
We present a framework for the specification of abstract models whose verification results transfer to the abstracted models for a logic with unrestricted use of negation and quantification. This framework is novel in that its models have quantitative or probabilistic observables and state transitions. Properties of a quantitative temporal logic have measurable denotations in these models. For probabilistic models such denotations approximate the probabilistic semantics of full LTL. We show how predicate-based abstractions specify abstract quantitative and probabilistic models with finite state space.