scientific article

From MaRDI portal
Revision as of 15:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2742791

zbMath0978.68033MaRDI QIDQ2742791

Robert F. Stärk, Egon Börger, Joachim Schmid

Publication date: 23 September 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.





Related Items (37)

Verified bytecode verifiers.Verified bytecode verification and type-certifying compilationConcurrent abstract state machinesNeutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASMASM-based formal design of an adaptivity component for a cloud systemFrom Jinja bytecode to term rewriting: a complexity reflecting transformationConstruction and analysis of ground models and their refinements as a foundation for validating computer-based systemsTool-assisted specification and verification of typed low-level languagesA formally verified compiler back-endMechanising a type-safe model of multithreaded Java with a verified compilerAn algebraic approach to the design of compilers for object-oriented languagesThe rewriting logic semantics project: a progress reportThe Subject-Oriented Approach to Software Design and the Abstract State Machines MethodCoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent TypesAmbient abstract state machines with applicationsFormalizing non-interference for a simple bytecode language in CoqTowards proving type safety of .NET CILTowards proving type safety of \(\mathrm{C}^{\#}\)A data-flow approach to test multi-agent ASMsProof-theoretic notions for software maintenanceAbstract State Machines and the Inquiry ProcessAn assertion-based proof system for multithreaded JavaA high-level modular definition of the semantics of C\(_{\sharp}\)Abstract state machines: a unifying view of models of computation and of system design frameworksAxioms for strict and lazy functional programsAn operational semantics for object-oriented concepts based on the class hierarchyA rewriting logic approach to operational semanticsOn an algorithm determining direct superclasses in Java and similar languages with inner classes-its correctness, completeness and uniqueness of solutionsA provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++The Rewriting Logic Semantics Project: A Progress ReportA guarded fragment for abstract state machinesFormal specification and verification of the C\(\#\) thread modelA Rewriting Logic Approach to Operational Semantics (Extended Abstract)Product optimization in stepwise designFlashix: modular verification of a concurrent and crash-safe flash file systemComputation on structures. Behavioural theory, logic, complexityA framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines







This page was built for publication: