Reasoning about classes in object-oriented languages: Logical models and tools

Abstract. This paper gives a semantical underpinning for a manysorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Manysorted Boolean Algebras with Operators, combining standard (categorical) models of modal logic and of many-sorted predicate logic. In this setting we will see Lindenbaum MBAO models as initial objects, and canonical coalgebraic models of maximally consistent sets of formulas as final objects. They will be used to (re)prove completeness results, and Hennessey-Milner style characterisation results for the modal logic, first established by Rößiger.Mathematics Subject Classification. 03G05, 03G30, 06E25.

show abstract

“…More information on the coalgebraic description of classes in object-oriented languages may be found in [7,9,11,14,21,25].…”

Section: Preliminariesmentioning

confidence: 99%

Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study

Jacobs

2001

RAIRO-Theor. Inf. Appl.

Self Cite

110

View full text Add to dashboard Cite

show abstract

“…A theorem prover (HOL or PVS) is used for verifying the validity of these verifications conditions. Of particular interest in this context is an integration of our method with related approaches like the Loop project [17,23].…”

Section: Resultsmentioning

confidence: 99%

Verification for Java’s Reentrant Multithreading Concept

Ábrahám-Mumm

Boer

Roever

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread-classes, allowing for a multithreaded flow of control. The concurrency model offers coordination via lock-synchronization, and communication by synchronous message passing, including re-entrant method calls, and by instance variables shared among threads. To reason about multithreaded programs, we introduce in this paper an assertional proof method for JavaMT ("Multi-Threaded Java"), a small concurrent sublanguage of Java, covering the mentioned concurrency issues as well as the object-based core of Java, i.e., object creation, side effects, and aliasing, but leaving aside inheritance and subtyping.

show abstract

“…It uses an internal specification language called Coalgebraic Class Specification Language or CCSL [HHJT98] to define the program in terms of a coalgebra, which provides a hidden state space and a set of functions on that space. Whilst CCSL can be generated "by hand", it can be generated automatically from either C++ or Java programs.…”

Section: Loopmentioning

confidence: 99%

Automatic verification of design patterns in Java

Blewitt

Bundy

Stark

2005

Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

Design patterns are widely used by designers and developers for building complex systems in object-oriented programming languages such as Java. However, systems evolve over time, increasing the chance that the pattern in its original form will be broken.To verify that a design pattern has not been broken involves specifying the original intent of the design pattern. Whilst informal descriptions of patterns exist, no formal specifications are available due to differences in implementations between programming languages. This thesis shows that many patterns (implemented in Java) can be verified automatically.Patterns are defined in terms of variants, mini-patterns, and artefacts in a pattern description language called SPINE. These specifications are then processed by HEDGEHOG, an automated proof tool that attempts to prove that Java source code meets these specifications.iii

show abstract

Reasoning about classes in object-oriented languages: Logical models and tools

Cited by 37 publications

References 16 publications

Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study

Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study

Verification for Java’s Reentrant Multithreading Concept

Automatic verification of design patterns in Java

Contact Info

Product

Resources

About