Communicating sequential processes
Communicating sequential processes
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Denotational semantics of a parallel object-oriented language
Information and Computation
Proceedings of the Fourth Annual Symposium on Logic in computer science
ABCL: an object-oriented concurrent system
ABCL: an object-oriented concurrent system
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A compositional protocol verification using relativized bisimulation
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
RTsynchronizer: language support for real-time specifications in distributed systems
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Actor languages. their syntax, semantics, translation, and equivalence
Theoretical Computer Science
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Model checking
A methodology for hardware verification using compositional model checking
Science of Computer Programming - Special issue on mathematics of program construction
Information and Computation - Special issue on FLOC '96
An actor algebra for specifying distributed systems: The hurried philosophers case study
Concurrent object-oriented programming and petri nets
Formal reasoning about actor programs using temporal logic
Concurrent object-oriented programming and petri nets
Tool-supported program abstraction for finite-state verification
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Distributed Algorithms
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Programming dynamically reconfigurable open systems with SALSA
ACM SIGPLAN Notices
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
Actor theories in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Revised Lectures from the International Symposium on Compositionality: The Significant Difference
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Modularization and Abstraction: The Keys to Practical Formal Verification
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Divide, Abstract, and Model-Check
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Automating Modular Verification
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Compositional Verification in Linear-Time Temporal Logic
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Closing Open SDL-Systems for Model Checking with DTSpin
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Proof System for the Language POOL
Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
The Structure and Semantics of Actor Languages
Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
Composition: A Way to Make Proofs Harder
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
A foundation for actor computation
Journal of Functional Programming
A Front-End Tool for Automated Abstraction and Modular Verification of Actor-Based Models
ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Modere: the model-checking engine of Rebeca
Proceedings of the 2006 ACM symposium on Applied computing
Formal modeling of evolving self-adaptive systems
Science of Computer Programming
Timed-rebeca schedulability and deadlock-freedom analysis using floating-time transition system
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
Modeling and verification of probabilistic actor systems using prebeca
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Analysing timed Rebeca using McErlang
Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control
Reducing the verification cost of evolving product families using static analysis techniques
Science of Computer Programming
Hi-index | 0.00 |
Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their correctness. In this paper, we develop an actor-based model for describing such systems, use temporal logic to specify properties of the model, and apply different abstraction and verification methods for verifying that the model meets its specification. We use a compositional verification approach for verifying safety properties of these models. For that we introduce a notion of component, based on an user-defined decomposition of the model. Components are more abstract than the model itself, and so we can reduce the state space of the model which makes it more amenable to model checking techniques. We prove that our abstraction technique preserves a set of behavioral specifications in temporal logic. The soundness of the abstraction is proved by the weak simulation relation between the constructs.