Certification Using the Mobius Base Logic

DOI10.1007/978-3-540-92188-2_2zbMath1209.68121MaRDI QIDQ3602993

Lennart Beringer, Mariela Pavlova, Martin Hofmann

Publication date: 12 February 2009

Published in: Formal Methods for Components and Objects (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92188-2_2

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Relational bytecode correlations, Verifying pointer and string analyses with region type systems

Uses Software

• SIMPLIFY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof-carrying code from certified abstract interpretation and fixpoint compression
• Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
• Precise interprocedural analysis through linear algebra
• Simplify: a theorem prover for program checking
• Integration of a Security Type System into a Program Logic
• A Bytecode Logic for JML and Types
• Theorem Proving in Higher Order Logics
• Logic for Programming, Artificial Intelligence, and Reasoning
• Logic for Programming, Artificial Intelligence, and Reasoning
• FM 2005: Formal Methods
• Verification, Model Checking, and Abstract Interpretation