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
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
A Calculus of Communicating Systems
A Calculus of Communicating Systems
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
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
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
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
Abstract Object Creation in Dynamic Logic
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A complete guide to the future
ESOP'07 Proceedings of the 16th European conference on Programming
The Why/Krakatoa/Caduceus platform for deductive program verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Generating unit tests from formal proofs
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Verification of object-oriented software: The KeY approach
Verification of object-oriented software: The KeY approach
Boogie: a modular reusable verifier for object-oriented programs
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Prototyping a tool environment for run-time assertion checking in JML with communication histories
Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
Dynamic resource reallocation between deployment components
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Models of Rate Restricted Communication for Concurrent Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
A system for compositional verification of asynchronous objects
Science of Computer Programming
Hi-index | 0.00 |
We present a verification system for Creol, an object-oriented modeling 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, explicit substitutions, and the taclet rule language, the system presented in this paper 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 which describe the interfaces of Creol units. Two example scenarios demonstrate the usage of the system.