For design and documentation, TLA+ fulfills the same purpose as informal technical specifications. However, TLA+ specifications are written in a formal language of logic and mathematics, and the precision of specifications written in this language is intended to uncover design flaws before system implementation is underway.[6]
Since TLA+ specifications are written in a formal language, they are amenable to finite model checking. The model checker finds all possible system behaviours up to some number of execution steps, and examines them for violations of desired invariance properties such as safety and liveness. TLA+ specifications use basic set theory to define safety (bad things won't happen) and temporal logic to define liveness (good things eventually happen).
TLA+ is also used to write machine-checked proofs of correctness both for algorithms and mathematical theorems. The proofs are written in a declarative, hierarchical style independent of any single theorem prover backend. Both formal and informal structured mathematical proofs can be written in TLA+; the language is similar to LaTeX, and tools exist to translate TLA+ specifications to LaTeX documents.[7]
TLA+ was introduced in 1999, following several decades of research into a verification method for concurrent systems. Ever since, a toolchain has been developed, including an IDE and a distributed model checker. The pseudocode-like language PlusCal was created in 2009; it transpiles to TLA+ and is useful for specifying sequential algorithms. TLA+2 was announced in 2014, expanding language support for proof constructs. The current TLA+ reference is The TLA+ Hyperbook by Leslie Lamport.
History
Modern temporal logic was developed by Arthur Prior in 1957, then called tense logic. Although Amir Pnueli was the first to seriously study the applications of temporal logic to computer science, Prior speculated on its use a decade earlier in 1967:
The usefulness of systems of this sort [on discrete time] does not depend on any serious metaphysical assumption that time is discrete; they are applicable in limited fields of discourse in which we are concerned only with what happens next in a sequence of discrete states, e.g. in the working of a digital computer.
Pnueli researched the use of temporal logic in specifying and reasoning about computer programs, introducing linear temporal logic in 1977. LTL became an important tool for analysis of concurrent programs, easily expressing properties such as mutual exclusion and freedom from deadlock.[8]
Concurrent with Pnueli's work on LTL, academics were working to generalize Hoare logic for verification of multiprocess programs. Leslie Lamport became interested in the problem after peer review found an error in a paper he submitted on mutual exclusion. Ed Ashcroft introduced invariance in his 1975 paper "Proving Assertions About Parallel Programs", which Lamport used to generalize Floyd's method in his 1977 paper "Proving Correctness of Multiprocess Programs". Lamport's paper also introduced safety and liveness as generalizations of partial correctness and termination, respectively.[9] This method was used to verify the first concurrent garbage collection algorithm in a 1978 paper with Edsger Dijkstra.[10]
Lamport first encountered Pnueli's LTL during a 1978 seminar at Stanford organized by Susan Owicki. According to Lamport, "I was sure that temporal logic was some kind of abstract nonsense that would never have any practical application, but it seemed like fun, so I attended." In 1980 he published "'Sometime' is Sometimes 'Not Never'", which became one of the most frequently-cited papers in the temporal logic literature.[11] Lamport worked on writing temporal logic specifications during his time at SRI, but found the approach to be impractical:
However, I became disillusioned with temporal logic when I saw how Schwartz, Melliar-Smith, and Fritz Vogt were spending days trying to specify a simple FIFO queue – arguing over whether the properties they listed were sufficient. I realized that, despite its aesthetic appeal, writing a specification as a conjunction of temporal properties just didn't work in practice.[12]
His search for a practical method of specification resulted in the 1983 paper "Specifying Concurrent Programming Modules", which introduced the idea of describing state transitions as boolean-valued functions of primed and unprimed variables.[12] Work continued throughout the 1980s, and Lamport began publishing papers on the temporal logic of actions in 1990; however, it was not formally introduced until "The Temporal Logic of Actions" was published in 1994. TLA enabled the use of actions in temporal formulas, which according to Lamport "provides an elegant way to formalize and systematize all the reasoning used in concurrent system verification."[13]
TLA specifications mostly consisted of ordinary non-temporal mathematics, which Lamport found less cumbersome than a purely temporal specification. TLA provided a mathematical foundation to the specification language TLA+, introduced with the paper "Specifying Concurrent Systems with TLA+" in 1999.[1] Later that same year, Yuan Yu wrote the TLC model checker for TLA+ specifications; TLC was used to find errors in the cache coherence protocol for a Compaq multiprocessor.[14]
Lamport published a full textbook on TLA+ in 2002, titled "Specifying Systems: The TLA+ Language and Tools for Software Engineers".[15]PlusCal was introduced in 2009,[16] and the TLA+ proof system (TLAPS) in 2012.[17] TLA+2 was announced in 2014, adding some additional language constructs as well as greatly increasing in-language support for the proof system.[2] Lamport is engaged in creating an updated TLA+ reference, "The TLA+ Hyperbook". The incomplete work is available from his official website. Lamport is also creating The TLA+ Video Course, described therein as "a work in progress that consists of the beginning of a series of video lectures to teach programmers and software engineers how to write their own TLA+ specifications".
Language
TLA+ specifications are organized into modules. Modules can extend (import) other modules to use their functionality. Although the TLA+ standard is specified in typeset mathematical symbols, existing TLA+ tools use LaTeX-like symbol definitions in ASCII. TLA+ uses several terms which require definition:
State – an assignment of values to variables
Behaviour – a sequence of states
Step – a pair of successive states in a behavior
Stuttering step – a step during which variables are unchanged
Next-state relation – a relation describing how variables can change in any step
State function – an expression containing variables and constants that is not a next-state relation
State predicate – a Boolean-valued state function
Invariant – a state predicate true in all reachable states
Temporal formula – an expression containing statements in temporal logic
Safety
TLA+ concerns itself with defining the set of all correct system behaviours. For example, a one-bit clock ticking endlessly between 0 and 1 could be specified as follows:
The next-state relation Tick sets clock′ (the value of clock in the next state) to 1 if clock is 0, and 0 if clock is 1. The state predicate Init is true if the value of clock is either 0 or 1. Spec is a temporal formula asserting all behaviours of one-bit clock must initially satisfy Init and have all steps either match Tick or be stuttering steps. Two such behaviours are:
The safety properties of the one-bit clock – the set of reachable system states – are adequately described by the spec.
Liveness
The above spec disallows strange states for the one-bit clock, but does not say the clock will ever tick. For example, the following perpetually-stuttering behaviours are accepted:
A clock which does not tick is not useful, so these behaviours should be disallowed. One solution is to disable stuttering, but TLA+ requires stuttering always be enabled; a stuttering step represents a change to some part of the system not described in the spec, and is useful for refinement. To ensure the clock must eventually tick, weak fairness is asserted for Tick:
Weak fairness over an action means if that action is continuously enabled, it must eventually be taken. With weak fairness on Tick only a finite number of stuttering steps are permitted between ticks. This temporal logical statement about Tick is called a liveness assertion. In general, a liveness assertion should be machine-closed: it shouldn't constrain the set of reachable states, only the set of possible behaviours.[18]
Most specifications do not require assertion of liveness properties. Safety properties suffice both for model checking and guidance in system implementation.[19]
Temporal logic operators are built into TLA+. Temporal formulas use to mean P is always true, and to mean P is eventually true. The operators are combined into to mean P is true infinitely often, or to mean eventually P will always be true. Other temporal operators include weak and strong fairness. Weak fairness WFe(A) means if action A is enabled continuously (i.e. without interruptions), it must eventually be taken. Strong fairness SFe(A) means if action A is enabled continually (repeatedly, with or without interruptions), it must eventually be taken.
Temporal existential and universal quantification are included in TLA+, although without support from the tools.
User-defined operators are similar to macros. Operators differ from functions in that their domain need not be a set: for example, the set membership operator has the category of sets as its domain, which is not a valid set in ZFC (since its existence leads to Russell's paradox). Recursive and anonymous user-defined operators were added in TLA+2.
Data structures
The foundational data structure of TLA+ is the set. Sets are either explicitly enumerated or constructed from other sets using operators or with {x \in S : p} where p is some condition on x, or {e : x \in S} where e is some function of x. The unique empty set is represented as {}.
Functions in TLA+ assign a value to each element in their domain, a set. [S -> T] is the set of all functions with f[x] in T, for each x in the domain set S. For example, the TLA+ function Double[x \in Nat] == x*2 is an element of the set [Nat -> Nat] so Double \in [Nat -> Nat] is a true statement in TLA+. Functions are also defined with [x \in S |-> e] for some expression e, or by modifying an existing function [f EXCEPT ![v1] = v2].
Records are a type of function in TLA+. The record [name |-> "John", age |-> 35] is a record with fields name and age, accessed with r.name and r.age, and belonging to the set of records [name : String, age : Nat].
Tuples are included in TLA+. They are explicitly defined with <<e1,e2,e3>> or constructed with operators from the standard Sequences module. Sets of tuples are defined by Cartesian product; for example, the set of all pairs of natural numbers is defined Nat \X Nat.
Standard modules
TLA+ has a set of standard modules containing common operators. They are distributed with the syntactic analyzer. The TLC model checker uses Java implementations for improved performance.
FiniteSets: Module for working with finite sets. Provides IsFiniteSet(S) and Cardinality(S) operators.
Sequences: Defines operators on tuples such as Len(S), Head(S), Tail(S), Append(S, E), concatenation, and filter.
Bags: Module for working with multisets. Provides primitive set operation analogues and duplicate counting.
Naturals: Defines the Natural numbers along with inequality and arithmetic operators.
The TLC model checker builds a finite state model of TLA+ specifications for checking invariance properties. TLC generates a set of initial states satisfying the spec, then performs a breadth-first search over all defined state transitions. Execution stops when all state transitions lead to states which have already been discovered. If TLC discovers a state which violates a system invariant, it halts and provides a state trace path to the offending state. TLC provides a method of declaring model symmetries to defend against combinatorial explosion.[14] It also parallelizes the state exploration step, and can run in distributed mode to spread the workload across a large number of computers.[20]
As an alternative to exhaustive breadth-first search, TLC can use depth-first search or generate random behaviours. TLC operates on a subset of TLA+; the model must be finite and enumerable, and some temporal operators are not supported. In distributed mode TLC cannot check liveness properties, nor check random or depth-first behaviours. TLC is available as a command line tool or bundled with the TLA toolbox.
Proof system
The TLA+ Proof System, or TLAPS, mechanically checks proofs written in TLA+. It was developed at the Microsoft Research-INRIA Joint Centre to prove correctness of concurrent and distributed algorithms. The proof language is designed to be independent of any particular theorem prover; proofs are written in a declarative style, and transformed into individual obligations which are sent to back-end provers. The primary back-end provers are Isabelle and Zenon, with fallback to SMT solvers CVC3, Yices, and Z3. TLAPS proofs are hierarchically structured, easing refactoring and enabling non-linear development: work can begin on later steps before all prior steps are verified, and difficult steps are decomposed into smaller sub-steps. TLAPS works well with TLC, as the model checker quickly finds small errors before verification is begun. In turn, TLAPS can prove system properties which are beyond the capabilities of finite model checking.[17]
TLAPS does not currently support reasoning with real numbers, nor most temporal operators. Isabelle and Zenon generally cannot prove arithmetic proof obligations, requiring use of the SMT solvers.[21] TLAPS has been used to prove correctness of Byzantine Paxos, the Memoir security architecture, components of the Pastry distributed hash table,[17] and the Spire consensus algorithm.[22] It is distributed separately from the rest of the TLA+ tools and is free software, distributed under the BSD license.[23] TLA+2 greatly expanded language support for proof constructs.
Amazon Web Services has used TLA+ since 2011. TLA+ model checking uncovered bugs in DynamoDB, S3, EBS, and an internal distributed lock manager; some bugs required state traces of 35 steps. Model checking was also used to verify aggressive optimizations. In addition, TLA+ specifications were found to hold value as documentation and design aids.[4][25]
--------------------------- MODULE KeyValueStore ---------------------------
CONSTANTS Key, \* The set of all keys.
Val, \* The set of all values.
TxId \* The set of all transaction IDs.
VARIABLES store, \* A data store mapping keys to values.
tx, \* The set of open snapshot transactions.
snapshotStore, \* Snapshots of the store for each transaction.
written, \* A log of writes performed within each transaction.
missed \* The set of writes invisible to each transaction.
----------------------------------------------------------------------------
NoVal == \* Choose something to represent the absence of a value.
CHOOSE v : v \notin Val
Store == \* The set of all key-value stores.
[Key -> Val \cup{NoVal}]
Init == \* The initial predicate.
/\ store = [k \in Key |-> NoVal] \* All store values are initially NoVal.
/\ tx = {}\* The set of open transactions is initially empty.
/\ snapshotStore = \* All snapshotStore values are initially NoVal.
[t \in TxId |-> [k \in Key |-> NoVal]]
/\ written = [t \in TxId |-> {}] \* All write logs are initially empty.
/\ missed = [t \in TxId |-> {}] \* All missed writes are initially empty.
TypeInvariant == \* The type invariant.
/\ store \in Store
/\ tx \subseteq TxId
/\ snapshotStore \in [TxId -> Store]
/\ written \in [TxId -> SUBSET Key]
/\ missed \in [TxId -> SUBSET Key]
TxLifecycle ==
/\ \A t \in tx : \* If store != snapshot & we haven't written it, we must have missed a write.
\A k \in Key : (store[k] /= snapshotStore[t][k] /\ k \notin written[t]) => k \in missed[t]
/\ \A t \in TxId \ tx : \* Checks transactions are cleaned up after disposal.
/\ \A k \in Key : snapshotStore[t][k] = NoVal
/\ written[t] = {}
/\ missed[t] = {}
OpenTx(t) == \* Open a new transaction.
/\ t \notin tx
/\ tx' = tx \cup{t}
/\ snapshotStore' = [snapshotStore EXCEPT ![t] = store]
/\ UNCHANGED <<written, missed, store>>
Add(t, k, v) == \* Using transaction t, add value v to the store under key k.
/\ t \in tx
/\ snapshotStore[t][k] = NoVal
/\ snapshotStore' = [snapshotStore EXCEPT ![t][k] = v]
/\ written' = [written EXCEPT ![t] = @ \cup{k}]
/\ UNCHANGED <<tx, missed, store>>
Update(t, k, v) == \* Using transaction t, update the value associated with key k to v.
/\ t \in tx
/\ snapshotStore[t][k] \notin{NoVal, v}
/\ snapshotStore' = [snapshotStore EXCEPT ![t][k] = v]
/\ written' = [written EXCEPT ![t] = @ \cup{k}]
/\ UNCHANGED <<tx, missed, store>>
Remove(t, k) == \* Using transaction t, remove key k from the store.
/\ t \in tx
/\ snapshotStore[t][k] /= NoVal
/\ snapshotStore' = [snapshotStore EXCEPT ![t][k] = NoVal]
/\ written' = [written EXCEPT ![t] = @ \cup{k}]
/\ UNCHANGED <<tx, missed, store>>
RollbackTx(t) == \* Close the transaction without merging writes into store.
/\ t \in tx
/\ tx' = tx \ {t}
/\ snapshotStore' = [snapshotStore EXCEPT ![t] = [k \in Key |-> NoVal]]
/\ written' = [written EXCEPT ![t] = {}]
/\ missed' = [missed EXCEPT ![t] = {}]
/\ UNCHANGED store
CloseTx(t) == \* Close transaction t, merging writes into store.
/\ t \in tx
/\ missed[t] \cap written[t] = {}\* Detection of write-write conflicts.
/\ store' = \* Merge snapshotStore writes into store.
[k \in Key |-> IF k \in written[t] THEN snapshotStore[t][k] ELSE store[k]]
/\ tx' = tx \ {t}
/\ missed' = \* Update the missed writes for other open transactions.
[otherTx \in TxId |-> IF otherTx \in tx' THEN missed[otherTx] \cup written[t] ELSE {}]
/\ snapshotStore' = [snapshotStore EXCEPT ![t] = [k \in Key |-> NoVal]]
/\ written' = [written EXCEPT ![t] = {}]
Next == \* The next-state relation.
\/\E t \in TxId : OpenTx(t)
\/\E t \in tx : \E k \in Key : \E v \in Val : Add(t, k, v)
\/\E t \in tx : \E k \in Key : \E v \in Val : Update(t, k, v)
\/\E t \in tx : \E k \in Key : Remove(t, k)
\/\E t \in tx : RollbackTx(t)
\/\E t \in tx : CloseTx(t)
Spec == \* Initialize state with Init and transition with Next.
Init /\ [][Next]_<<store, tx, snapshotStore, written, missed>>
----------------------------------------------------------------------------
THEOREM Spec => [](TypeInvariant /\ TxLifecycle)
=============================================================================
^Lamport, Leslie (18 June 2002). "7.1 Why Specify". Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley. p. 75. ISBN978-0-321-14306-8. Having to describe a design precisely often reveals problems - subtle interactions and "corner cases" that are easily overlooked.
^
Øhrstrøm, Peter; Hasle, Per (1995). "3.7 Temporal Logic and Computer Science". Temporal Logic: From Ancient Ideas to Artificial Intelligence. Studies in Linguistics and Philosophy. Vol. 57. Springer Netherlands. pp. 344–365. doi:10.1007/978-0-585-37463-5. ISBN978-0-7923-3586-3.
^Lamport, Leslie (18 June 2002). "8.9.2 Machine Closure". Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley. p. 112. ISBN978-0-321-14306-8. We seldom want to write a specification that isn't machine closed. If we do write one, it's usually by mistake.
^
Markus A. Kuppe (3 June 2014). Distributed TLC (Recording of technical talk). TLA+ Community Event 2014, Toulouse, France.{{cite AV media}}: CS1 maint: location (link)
Salib Pasar, dibangun pada 1814 untuk menggantikan salib sebelumnya yang berdiri sedikit ke selatan[1] Devizes /dɪˈvaɪzɪz/ merupakan kota pasar dan paroki sipil di Wiltshire, Inggris. Kota ini berkembang di sekitar Puri Devizes, sebuah puri Norman abad ke-XI,[2] dan menerima piagam pada 1141. Puri itu dikepung selama The Anarchy, perang saudara abad ke-XII antara Stephen dari Inggris dan Matilda dari Inggris, dan lagi selama Perang Saudara Inggris ketika Cavalier mengangkat p…
U.S. gubernatorial election 1852 Connecticut gubernatorial election ← 1851 April 5, 1852 1853 → Nominee Thomas H. Seymour Green Kendrick Party Democratic Whig Popular vote 31,624 28,241 Percentage 50.39% 44.99% County Results Seymour: 40–50% 50–60% Kendrick: 40–50% Governor before election Thomas H. Seymour Democratic Elected Governor Thomas H. Seymour Democratic Elec…
Voce principale: The Glades. Questa voce sull'argomento episodi di fiction televisive è solo un abbozzo. Contribuisci a migliorarla secondo le convenzioni di Wikipedia. Segui i suggerimenti del progetto di riferimento. Immagine dalla sigla alternativa della serie televisiva La prima stagione della serie televisiva The Glades, composta da tredici episodi, è stata trasmessa in prima visione negli Stati Uniti d'America dal canale via cavo A&E Network dall'11 luglio al 3 ottobre 2010. In …
President of North Yemen from 1962 to 1967 This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: Abdullah al-Sallal – news · newspapers · books · scholar · JSTOR (January 2018) (Learn how and when to remove this message) Abdullah al-SallalAl-Sallal in 19631st President of Yemen Arab RepublicIn office26 September 1962…
Park in Baltimore, Maryland, United States The neutrality of this article is disputed. Relevant discussion may be found on the talk page. Please do not remove this message until conditions to do so are met. (September 2023) (Learn how and when to remove this message) Leakin ParkOrianda Mansion (Crimea) in Leakin ParkLocation4921 Windsor Mill RoadBaltimore, MD, 21207Coordinates39°18′23″N 76°41′27″W / 39.30639°N 76.69083°W / 39.30639; -76.69083Area1,216 acres (4…
Posizione del Montenegro in Europa I diritti delle persone LGBT (lesbiche, gay, bisessuali e transgender) in Montenegro sono differenti rispetto a quelli delle persone eterosessuali. L'omosessualità è legale in Montenegro. Le famiglie guidate dalle coppie formate da individui dello stesso sesso non hanno diritto alle stesse protezioni legali disponibili per le coppie sposate composte da individui sesso opposto. Indice 1 Legalità dei rapporti sessuali tra persone dello stesso sesso 2 Riconosci…
Премия «Золотой глобус» за лучшую женскую роль в комедии или мюзикле — престижная награда Голливудской ассоциации иностранной прессы, присуждаемая ежегодно с 1951 года. Первоначально категория носила название «Лучшая женская роль в художественном фильме». С 1951 го…
2022 film by Valentina Maurel I Have Electric DreamsPromotional release posterSpanishTengo sueños eléctricos Directed byValentina MaurelWritten byValentina MaurelProduced byBenoit RolandGrégoire DebaillyStarring Reinaldo Amien Gutiérrez Daniela Marín Navarro Vivian Rodriguez Adriana Castro García Jose Pablo Segreda Johanning CinematographyNicolás Wong DíazEdited byBertrand ConardProductioncompanies Wrong Men Geko Films Distributed byCinéartRelease date 8 August 2022 (2022…
Public research university in Bandung, Indonesia Bandung Institute of TechnologyInstitut Teknologi BandungFormer nameTechnische Hoogeschool te Bandoeng (Dutch)MottoIn Harmonia Progressio (Latin)Motto in EnglishProgress in HarmonyTypePublic universityEstablished3 July 1920 (as Technische Hoogeschool te Bandoeng)2 March 1959 (as Institut Teknologi Bandung)RectorProf. Ir. N. R. Reini Djuhraeni Wirahadikusumah, MSCE, Ph.D.Academic staff1,207 (as of 2014):[1]Undergraduate: 19 (1.57%…
Yelena Grigorievna MazanikNama asalЕлена Григорьевна МазаникLahir2 Maret 1914Desa Poddegtyarnaya, Kegubernuran Minsk, Kekaisaran RusiaMeninggal7 April 1996 (usia 82)Minsk, BelarusKebangsaan Uni SovietPenghargaanPahlawan Uni SovietOrdo LeninOrdo Perang Patriotik Kelas 1 Yelena Mazanik (bahasa Rusia: Елена Мазаник; 2 Maret 1914 – 7 April 1996) adalah partisan Soviet yang utamanya bertanggung jawab atas pembunuhan perwira SS papan ata…
Protected area in South AustraliaTantanoola Caves Conservation ParkTantanoola[1], South AustraliaIUCN category III (natural monument or feature)[2] Main chamber of Tantantoola caveManaging authoritiesDepartment for Environment and WaterSee alsoProtected areas of South Australia The Tantanoola Caves Conservation Park is a 14-hectare (35-acre) protected area near Tantanoola in the Limestone Coast tourism region in the south-east of South Australia. The conservation park preser…
1991 single by Right Said Fred I'm Too SexySingle by Right Said Fredfrom the album Up Released15 July 1991Genre Dance-pop[1][2] Eurodance[3] Length2:50Label Tug (UK) Charisma (US) Songwriter(s) Fred Fairbrass Richard Fairbrass Rob Manzoli Producer(s)TommyDRight Said Fred singles chronology I'm Too Sexy (1991) Don't Talk Just Kiss (1991) Right Said Fred singles chronology Where Do You Go to My Love?(2006) I'm Too Sexy 2007(2007) I'm a Celebrity(2008) Music videoI'm Too…
A Couple of CuckoosSampul volume manga pertama A Couple of Cuckoos edisi bahasa Indonesia oleh Elex Media Komputindo yang menampilkan Nagi Umino (kiri) dan Erika Amano (kanan)カッコウの許嫁(Kakkō no Iinazuke)GenreKomedi romantis[1] MangaPengarangMiki YoshikawaPenerbitKodanshaPenerbit bahasa InggrisNA Kodansha USAPenerbit bahasa IndonesiaElex Media KomputindoMajalahWeekly Shōnen MagazineDemografiShōnenTerbit29 Januari 2020 – sekarangVolume22 Seri animeSutradaraHiroaki AkagiYos…
Міністерство оборони Північної МакедоніїМинистерство за одбрана на Македонија (укр. МОПМ, мак. МОРМ) Емблема Армії Республіки Північна МакедоніяЗагальна інформаціяКраїна Північна МакедоніяДата створення 1991Попередні відомства Республіканський секретаріат народної…
American public-service television network Television channel C-SPANCountryUnited StatesBroadcast areaNationwideHeadquartersCapitol Hill, Washington, D.C.ProgrammingLanguage(s)EnglishPicture format1080i (HDTV)(downscaled to letterboxed 480i for SDTV feeds)OwnershipOwnerNational Cable Satellite CorporationSister channelsC-SPAN2C-SPAN3C-SPAN RadioHistoryLaunchedMarch 19, 1979; 45 years ago (1979-03-19)(C-SPAN)June 2, 1986; 38 years ago (1986-06-02)(C-SPAN2)Janua…
British record label This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: Chrysalis Records – news · newspapers · books · scholar · JSTOR (March 2013) (Learn how and when to remove this message) Chrysalis RecordsFounded1968; 56 years ago (1968)FounderChris WrightTerry EllisStatusUK and Europe: Inde…
English bassist of rock band Yes (1948–2015) Chris SquireSquire in August 1977Background informationBirth nameChristopher Russell Edward SquireBorn(1948-03-04)4 March 1948Kingsbury, London, EnglandDied27 June 2015(2015-06-27) (aged 67)Phoenix, Arizona, U.S.GenresProgressive rocksymphonic rockart rockOccupationsMusiciansingersongwriterInstrumentsBassvocalsYears active1965–2015LabelsAtlanticWounded BirdSanctuaryLimeStone GhostFormerly ofThe Selfsthe SynMabel Greer's ToyshopYesXYZConspirac…