Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
A Framework for Expressing the Relationships Between Multiple Views in Requirements Specification
IEEE Transactions on Software Engineering
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Science of Computer Programming
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
xlinkit: a consistency checking and smart link generation service
ACM Transactions on Internet Technology (TOIT)
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Three-Layer Model for Schema Management in Federated
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Platform independent model transformation based on triple
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Model checking, testing and verification working together
Formal Aspects of Computing
Refinement is complete for implementations
Formal Aspects of Computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Abstraction and Probabilities for Hybrid Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Hi-index | 5.24 |
Many applications, for instance the MS .NET Global Assembly Cache (GAC), are naturally expressed as 3-valued models where an additional third truth value models uncertainty or under-specification. An example of under-specification is that a component in a GAC may or may not have a main method. Models described in this manner can then be analyzed to refute or verify properties about the concrete systems they intend to model. This approach to system validation traditionally considers only one model at a time, even though this model may evolve if subjected to analysis. Many applications, however, benefit from or require the simultaneous consideration of multiple models of systems. We mention here requirements from different stake holders, and data drawn from federated databases. This paper therefore builds the mathematical foundations for property verification and refutation as applied to finitely many 3-valued models, where each model is endowed with states - possibly named by nominals, also known as hybrid constraints - labelled transitions, and atomic propositions. Specifically, we show that deciding whether a finite set of models has a common concrete system (consistency) is typically in PTIME, and that deciding whether a common concrete system satisfies a formula of the hybrid mu-calculus (satisfiability), and its dual (validity), are EXPTIME-complete. We propose sound and efficient approximations of these EXPTIME-complete checks by synthesizing and checking ''summary'' models. These approximations are optimal if all models are deterministic. Finally, we point out that such optimality of summary models is unattainable whenever not all summarized models are deterministic.