1996
DOI: 10.1145/250707.239116
|View full text |Cite
|
Sign up to set email alerts
|

Generating oracles from your favorite temporal logic specifications

Abstract: This paper describes a generic tableau algorithm, which is the basis for a general customizable method for producing oracles from temporal logic specifications. A generic argument gives semantic rules with which to build the semantic tableau for a specification. Parameterizing the tableau algorithm by semantic rules permits it to easily accommodate a variety of temporal operators and provides a clean mechanism for fine-tuning the algorithm to produce efficient oracles.The paper develops conditions to ensure th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

1998
1998
2009
2009

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(19 citation statements)
references
References 11 publications
0
19
0
Order By: Relevance
“…We also intend to explore the use of other temporal logics, especially Computation Tree Logic (CTL) and the µ-calculus [19], for the specification of security policies. The method mentioned in [10] suggests a means of modularizing the temporal logic engine out of the model-checker, allowing the same modelchecking system to be used for multiple temporal logics by changing which temporal logic engine is used. Examining how to use several of these engines at once seems a promising direction for our tool as well.…”
Section: Discussionmentioning
confidence: 99%
“…We also intend to explore the use of other temporal logics, especially Computation Tree Logic (CTL) and the µ-calculus [19], for the specification of security policies. The method mentioned in [10] suggests a means of modularizing the temporal logic engine out of the model-checker, allowing the same modelchecking system to be used for multiple temporal logics by changing which temporal logic engine is used. Examining how to use several of these engines at once seems a promising direction for our tool as well.…”
Section: Discussionmentioning
confidence: 99%
“…In most cases, the expected behavior of the software is assumed to be provided by the test designer. This behavior may be specified in several ways: (1) as predicates represented in a tabular form to express functional specifications of the software [40], (2) as temporal constraints that specify conditions that must not be violated during software execution [8,9,43,44], (3) as logical expressions to be satisfied by the software [11], and (4) as formal specifications [1,4,6,10,14,15,41], e.g., algebraic specifications to represent abstract data types (ADTs) [4,10,15]. This expected behavior is then used by a verifier that either performs a table lookup [40], creates a state-machine model [9,20], or evaluates a boolean expression [11] to determine the correctness of the actual output.…”
Section: Related Workmentioning
confidence: 99%
“…2) Temporal properties -the order of events, which can be checked by comparing the sequence of observed events with that specified by either a temporal logic [7], [8]; a finite state machine model [15], [6]; or a context-free grammar [2]. 3) Timing constraints -the time elapsed between events, which can be expressed using a real-time logic [23], [17]; or as extensions on a finite state machine model [25], [34].…”
Section: Related Workmentioning
confidence: 99%