Axiomatic semantics of communicating sequential processes
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communicating sequential processes
Promises: linguistic support for efficient asynchronous procedure calls in distributed systems
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
A Hoare logic for dynamic networks of asychronously communicating deterministic processes
Theoretical Computer Science
Extended static checking for Java
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Dynamic Logic
A compositional formalism for object viewpoints
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
The incremental garbage collection of processes
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
An Asynchronous Communication Model for Distributed Concurrent Objects
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Safe Concurrency for Aggregate Objects with Invariants
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
An assertion-based proof system for multithreaded Java
Theoretical Computer Science - Formal methods for components and objects
The Definitive ANTLR Reference: Building Domain-Specific Languages
The Definitive ANTLR Reference: Building Domain-Specific Languages
Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
Verifying the Mondex Case Study
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
A Dynamic Logic for Deductive Verification of Concurrent Programs
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
KeY-C: A Tool for Verification of C Programs
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Intra-Object versus Inter-Object: Concurrency and Reasoning in Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Object Creation in Dynamic Logic
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Modeling and Analysis of Thread-Pools in an Industrial Communication Platform
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A Verification System for Distributed Objects with Asynchronous Method Calls
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A complete guide to the future
ESOP'07 Proceedings of the 16th European conference on Programming
Generating unit tests from formal proofs
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Boogie: a modular reusable verifier for object-oriented programs
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Validating timed models of deployment components with parametric concurrency
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
Information Sciences: an International Journal
ABS: a core language for abstract behavioral specification
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A component model for the ABS language
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Compositional reasoning about shared futures
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
A relational trace logic for simple hierarchical actor-based component systems
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
Hi-index | 0.00 |
We present a semantics, calculus, and system for compositional verification of Creol, an object-oriented modelling language for concurrent distributed applications. The system is an instance of KeY, a framework for object-oriented software verification, which has so far been applied foremost to sequential Java. Building on KeY characteristic concepts, like dynamic logic, sequent calculus, symbolic execution via explicit substitutions, and the taclet rule language, the presented system addresses functional correctness of Creol models featuring local cooperative thread parallelism and global communication via asynchronous method calls. The calculus heavily operates on communication histories specified by the interfaces of Creol units. Two example scenarios demonstrate the usage of the system. This article extends the conference paper of Ahrendt and Dylla (2009) [5] with a denotational semantics of Creol and an assumption-commitment style semantics of the logic.