Eine aufbereitete Darstellung der Quelle

 
     
 
 
Anforderungen  |   Konzepte  |   Entwurf  |   Entwicklung  |   Qualitätssicherung  |   Lebenszyklus  |   Steuerung
 
 
 
 

Benutzer

Quelle  README.thy   Sprache: Isabelle

 

theory README imports Main
begin

section ‹TLA: Lamport's Temporal Logic of Actions›

text ‹
 TLA 🌐‹http://www.research.digital.com/SRC/personal/Leslie_Lamport/tla/tla.html›
 is a linear-time temporal logic introduced by Leslie Lamport in ∗‹The
 Temporal Logic of Actions
› (ACM TOPLAS 16(3), 1994, 872-923). Unlike other
 temporal logics, both systems and properties are represented as logical
 formulas, and logical connectives such as implication, conjunction, and
 existential quantification represent structural relations such as
 refinement, parallel composition, and hiding. TLA has been applied to
 numerous case studies.

 This directory formalizes TLA in Isabelle/HOL, as follows:

 ▪ 🚫‹Intensional.thy› prepares the ground by introducing basic syntax for
 "lifted", possible-world based logics.

 ▪ 🚫‹Stfun.thy› and 🚫‹Action.thy› represent the state and transition
 level formulas of TLA, evaluated over single states and pairs of states.

 ▪ 🚫‹Init.thy› introduces temporal logic and defines conversion functions
 from nontemporal to temporal formulas.

 ▪ 🚫‹TLA.thy› axiomatizes proper temporal logic.


 Please consult the ∗‹design notes›
 🌐‹http://www.pst.informatik.uni-muenchen.de/~merz/isabelle/IsaTLADesign.ps›
 for further information regarding the setup and use of this encoding of TLA.

 The theories are accompanied by a small number of examples:

 ▪ 🚫‹Inc›: Lamport's ∗‹increment› example, a standard TLA benchmark,
 illustrates an elementary TLA proof.

 ▪ 🚫‹Buffer›: a proof that two buffers in a row implement a single buffer,
 uses a simple refinement mapping.

 ▪ 🚫‹Memory›: a verification of (the untimed part of) Broy and Lamport's
 ∗‹RPC-Memory› case study, more fully explained in LNCS 1169 (the ∗‹TLA
 solution
› is available separately from
 🌐‹http://www.pst.informatik.uni-muenchen.de/~merz/papers/RPCMemory.html›).
 
›

end

Messung V0.5 in Prozent
C=3 H=-433 G=306

¤ Dauer der Verarbeitung: 0.13 Sekunden  (vorverarbeitet am  2026-09-29) ¤

*© Formatika GbR, Deutschland






Wurzel

Suchen

PVS Prover

Isabelle Prover

NIST Cobol Testsuite

Cephes Mathematical Library

Vienna Development Method

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.






                                                                                                                                                                                                                                                                                                                                                                                                     


Neuigkeiten

     Aktuelles
     Motto des Tages

Open Source Software

     Quellcodebibliothek
     Eigene Quellcodes
     Fremde Quellcodes
     Suchen

Jenseits des Üblichen ....

Besucherstatistik

Besucherstatistik

Statistik
#Sources=1126864
#Domains=1897691