The temporal logic of programs

Pnueli, Amir

doi:10.1109/sfcs.1977.32

Cited by 4,195 publications

(2,551 citation statements)

References 14 publications

Supporting

Mentioning

2,526

Contrasting

Unclassified

Order By: Relevance

“…Nested-word automata can express a variety of requirements such as stack-inspection properties, pre-post conditions, and interprocedural data-flow properties. More broadly, modeling structured programs and program specifications as languages of nested words generalizes the linear-time semantics that allows integration of Pnueli-style temporal reasoning [Pnu77] and Hoare-style structured reasoning [Hoa69]. We believe that the nested-word view will provide a unifying basis for the next generation of specification logics for program analysis, software verification, and runtime monitoring.…”

Section: Introductionmentioning

confidence: 99%

Adding Nesting Structure to Words

Alur

Madhusudan

2006

Lecture Notes in Computer Science

147

364

View full text Add to dashboard Cite

We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define nested word automata-finite-state acceptors for nested words, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nested word automata are as expressive as their nondeterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-*, prefixes, and language homomorphisms; membership, emptiness, language inclusion, and language equivalence are all decidable; and definability in monadic second order logic corresponds exactly to finite-state recognizability. We also consider regular languages of infinite nested words and show that the closure properties, MSO-characterization, and decidability of decision problems carry over.The linear encodings of nested words give the class of visibly pushdown languages of words, and this class lies between balanced languages and deterministic context-free languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a context-free language over words, one should view it as a regular language of nested words (or equivalently, a visibly pushdown language), and this would allow model checking of many properties (such as stack inspection, pre-post conditions) that are not expressible in existing specification logics.We also study the relationship between ordered trees and nested words, and the corresponding automata: while the analysis complexity of nested word automata is the same as that of classical tree automata, they combine both bottom-up and top-down traversals, and enjoy expressiveness and succinctness benefits over tree automata.

show abstract

Section: Introductionmentioning

confidence: 99%

Adding Nesting Structure to Words

Alur

Madhusudan

2006

Lecture Notes in Computer Science

147

364

View full text Add to dashboard Cite

show abstract

“…To cope with the needs of the different aspects of a design, various sets of patterns have been defined [12], they build upon parametrized requirements patterns that have been known for a long time (e.g., [13], [14]). Many research contributions about contracts rely on formal languages, such as temporal logics [15] or IOAutomata [16]. Temporal logic is used in [17] for decomposing the system architecture with contracts.…”

Section: Related Work Regarding Contract-based Developmentmentioning

confidence: 99%

“…The interface between the safety view and the functional design is highlighted as well. Multiple safety patterns are provided in LTL [15] notation.…”

Section: Related Work Regarding Contract-based Developmentmentioning

confidence: 99%

Contract-Based Design of Embedded Systems Integrating Nominal Behavior and Safety

Kaiser¹,

Weber

Oertel

et al. 2015

J. Complex Syst. Inform. Model. Q.

View full text Add to dashboard Cite

Abstract. The distributed design process for safety-critical embedded systems has become an increasingly difficult challenge: Electronic Control Units (ECUs) in vehicles, for instance, participate in many vehicle functions, while each vehicle function, in turn, is spread across several ECUs. Many suppliers participate in systems design and many partial functions are reused from past projects, not always knowing the assumptions at the time of their development. In particular, efficient allocation of safety mechanisms and a sound safety case are difficult tasks for original equipment manufacturers (OEMs). Contractbased development has gained popularity as an approach for supporting distributed development by explicitly annotating assumptions and guarantees to components, but an integrated process covering specification of nominal behavior and safety has not been described so far. We present such an integrated development approach that encompasses the systematic breakdown of nominal system behavior using contracts, the consistent derivation of safety analysis by interpreting several types of contract violations as a specification for failure modes, and the subsequent integration of safety mechanisms that cover these failure modes through safety contracts. The approach equally fits hardware and software and is therefore applicable on the system level. We demonstrate it by an electric drive example. The extensibility of our approach towards Cyber Physical Systems, which compose themselves at runtime, is briefly outlined at the end of the article.

show abstract

“…Pnueli pioneered the use of temporal logic as a formal language for reasoning about reactive systems [Pnu77]. Temporal logic allows model checking, i.e.…”

Section: Introductionmentioning

confidence: 99%

On Solving Temporal Logic Queries

Hornus

Schnoebelen

2002

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

Abstract. Temporal query checking is an extension of temporal model checking where one asks what propositional formulae can be inserted in a temporal query (a temporal formula with a placeholder) so that the resulting formula is satisfied in the model at hand. We study the problem of computing all minimal solutions to a temporal query without restricting to so-called "valid" queries (queries guaranteed to have a unique minimal solution). While this problem is intractable in general, we show that deciding uniqueness of the minimal solution (and computing it) can be done in polynomial-time.

show abstract

The temporal logic of programs

Cited by 4,195 publications

References 14 publications

Adding Nesting Structure to Words

Adding Nesting Structure to Words

Contract-Based Design of Embedded Systems Integrating Nominal Behavior and Safety

On Solving Temporal Logic Queries

Contact Info

Product

Resources

About